File Manager

003 File Manager

Current Path: /usr/src/crypto/heimdal/lib/asn1

usr / src / crypto / heimdal / lib / asn1 /

📁 ..
📄 ChangeLog(44.84 KB)
📄 Makefile.am(7.72 KB)
📄 Makefile.in(51.46 KB)
📄 asn1-common.h(2.06 KB)
📄 asn1-template.h(3.97 KB)
📄 asn1_err.et(1.27 KB)
📄 asn1_gen.c(4.8 KB)
📄 asn1_print.c(9.23 KB)
📄 asn1_queue.h(6.52 KB)
📄 asn1parse.c(81.78 KB)
📄 asn1parse.h(6.44 KB)
📄 asn1parse.y(20.85 KB)
📄 canthandle.asn1(793 B)
📄 check-common.c(10.03 KB)
📄 check-common.h(2.87 KB)
📄 check-der.c(26.7 KB)
📄 check-gen.c(35.1 KB)
📄 check-timegm.c(2.28 KB)
📄 cms.asn1(4.16 KB)
📄 cms.opt(55 B)
📄 der-private.h(1.29 KB)
📄 der-protos.h(10.5 KB)
📄 der.c(3.69 KB)
📄 der.h(3.08 KB)
📄 der_cmp.c(3.48 KB)
📄 der_copy.c(4.75 KB)
📄 der_format.c(3.93 KB)
📄 der_free.c(3.01 KB)
📄 der_get.c(14.56 KB)
📄 der_length.c(4.67 KB)
📄 der_locl.h(2.15 KB)
📄 der_put.c(10.02 KB)
📄 digest.asn1(4.86 KB)
📄 extra.c(3.69 KB)
📄 gen.c(25.75 KB)
📄 gen_copy.c(6.68 KB)
📄 gen_decode.c(17.89 KB)
📄 gen_encode.c(13.23 KB)
📄 gen_free.c(5.01 KB)
📄 gen_glue.c(4.13 KB)
📄 gen_length.c(7.54 KB)
📄 gen_locl.h(3.26 KB)
📄 gen_seq.c(3.89 KB)
📄 gen_template.c(22.2 KB)
📄 hash.c(4.57 KB)
📄 hash.h(2.92 KB)
📄 heim_asn1.h(2.33 KB)
📄 krb5.asn1(20.53 KB)
📄 krb5.opt(147 B)
📄 kx509.asn1(662 B)
📄 lex.c(73.99 KB)
📄 lex.h(1.76 KB)
📄 lex.l(7.74 KB)
📄 main.c(4.78 KB)
📄 pkcs12.asn1(2.29 KB)
📄 pkcs8.asn1(629 B)
📄 pkcs9.asn1(809 B)
📄 pkinit.asn1(5.47 KB)
📄 rfc2459.asn1(16.79 KB)
📄 setchgpw2.asn1(3.82 KB)
📄 symbol.c(2.68 KB)
📄 symbol.h(3.57 KB)
📄 template.c(24.54 KB)
📄 test.asn1(3.1 KB)
📄 test.gen(290 B)
📄 timegm.c(3.83 KB)
📄 version-script.map(135 B)

Editing: timegm.c

/*
 * Copyright (c) 1997 Kungliga Tekniska Högskolan
 * (Royal Institute of Technology, Stockholm, Sweden).
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * 3. Neither the name of the Institute nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include "der_locl.h"

#define ASN1_MAX_YEAR	2000

static int
is_leap(unsigned y)
{
    y += 1900;
    return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
}

static const unsigned ndays[2][12] ={
    {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
    {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};

/*
 * This is a simplifed version of timegm(3) that doesn't accept out of
 * bound values that timegm(3) normally accepts but those are not
 * valid in asn1 encodings.
 */

time_t
_der_timegm (struct tm *tm)
{
  time_t res = 0;
  int i;

/*
   * See comment in _der_gmtime
   */
  if (tm->tm_year > ASN1_MAX_YEAR)
      return 0;

if (tm->tm_year < 0)
      return -1;
  if (tm->tm_mon < 0 || tm->tm_mon > 11)
      return -1;
  if (tm->tm_mday < 1 || tm->tm_mday > (int)ndays[is_leap(tm->tm_year)][tm->tm_mon])
      return -1;
  if (tm->tm_hour < 0 || tm->tm_hour > 23)
      return -1;
  if (tm->tm_min < 0 || tm->tm_min > 59)
      return -1;
  if (tm->tm_sec < 0 || tm->tm_sec > 59)
      return -1;

for (i = 70; i < tm->tm_year; ++i)
    res += is_leap(i) ? 366 : 365;

for (i = 0; i < tm->tm_mon; ++i)
    res += ndays[is_leap(tm->tm_year)][i];
  res += tm->tm_mday - 1;
  res *= 24;
  res += tm->tm_hour;
  res *= 60;
  res += tm->tm_min;
  res *= 60;
  res += tm->tm_sec;
  return res;
}

struct tm *
_der_gmtime(time_t t, struct tm *tm)
{
    time_t secday = t % (3600 * 24);
    time_t days = t / (3600 * 24);

memset(tm, 0, sizeof(*tm));

tm->tm_sec = secday % 60;
    tm->tm_min = (secday % 3600) / 60;
    tm->tm_hour = secday / 3600;

/*
     * Refuse to calculate time ~ 2000 years into the future, this is
     * not possible for systems where time_t is a int32_t, however,
     * when time_t is a int64_t, that can happen, and this becomes a
     * denial of sevice.
     */
    if (days > (ASN1_MAX_YEAR * 365))
	return NULL;

tm->tm_year = 70;
    while(1) {
	unsigned dayinyear = (is_leap(tm->tm_year) ? 366 : 365);
	if (days < dayinyear)
	    break;
	tm->tm_year += 1;
	days -= dayinyear;
    }
    tm->tm_mon = 0;

while (1) {
	unsigned daysinmonth = ndays[is_leap(tm->tm_year)][tm->tm_mon];
	if (days < daysinmonth)
	    break;
	days -= daysinmonth;
	tm->tm_mon++;
    }
    tm->tm_mday = days + 1;

return tm;
}

003 File Manager

Editing: timegm.c

Upload File

Create Folder