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: hash.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.
 */

/*
 * Hash table functions
 */

#include "gen_locl.h"

RCSID("$Id$");

static Hashentry *_search(Hashtab * htab,	/* The hash table */
			  void *ptr);	/* And key */

Hashtab *
hashtabnew(int sz,
	   int (*cmp) (void *, void *),
	   unsigned (*hash) (void *))
{
    Hashtab *htab;
    int i;

assert(sz > 0);

htab = (Hashtab *) malloc(sizeof(Hashtab) + (sz - 1) * sizeof(Hashentry *));
    if (htab == NULL)
	return NULL;

for (i = 0; i < sz; ++i)
	htab->tab[i] = NULL;

htab->cmp = cmp;
    htab->hash = hash;
    htab->sz = sz;
    return htab;
}

/* Intern search function */

static Hashentry *
_search(Hashtab * htab, void *ptr)
{
    Hashentry *hptr;

assert(htab && ptr);

for (hptr = htab->tab[(*htab->hash) (ptr) % htab->sz];
	 hptr;
	 hptr = hptr->next)
	if ((*htab->cmp) (ptr, hptr->ptr) == 0)
	    break;
    return hptr;
}

/* Search for element in hash table */

void *
hashtabsearch(Hashtab * htab, void *ptr)
{
    Hashentry *tmp;

tmp = _search(htab, ptr);
    return tmp ? tmp->ptr : tmp;
}

/* add element to hash table */
/* if already there, set new value */
/* !NULL if succesful */

void *
hashtabadd(Hashtab * htab, void *ptr)
{
    Hashentry *h = _search(htab, ptr);
    Hashentry **tabptr;

assert(htab && ptr);

if (h)
	free((void *) h->ptr);
    else {
	h = (Hashentry *) malloc(sizeof(Hashentry));
	if (h == NULL) {
	    return NULL;
	}
	tabptr = &htab->tab[(*htab->hash) (ptr) % htab->sz];
	h->next = *tabptr;
	*tabptr = h;
	h->prev = tabptr;
	if (h->next)
	    h->next->prev = &h->next;
    }
    h->ptr = ptr;
    return h;
}

/* delete element with key key. Iff freep, free Hashentry->ptr */

int
_hashtabdel(Hashtab * htab, void *ptr, int freep)
{
    Hashentry *h;

assert(htab && ptr);

h = _search(htab, ptr);
    if (h) {
	if (freep)
	    free(h->ptr);
	if ((*(h->prev) = h->next))
	    h->next->prev = h->prev;
	free(h);
	return 0;
    } else
	return -1;
}

/* Do something for each element */

void
hashtabforeach(Hashtab * htab, int (*func) (void *ptr, void *arg),
	       void *arg)
{
    Hashentry **h, *g;

assert(htab);

for (h = htab->tab; h < &htab->tab[htab->sz]; ++h)
	for (g = *h; g; g = g->next)
	    if ((*func) (g->ptr, arg))
		return;
}

/* standard hash-functions for strings */

unsigned
hashadd(const char *s)
{				/* Standard hash function */
    unsigned i;

assert(s);

for (i = 0; *s; ++s)
	i += *s;
    return i;
}

unsigned
hashcaseadd(const char *s)
{				/* Standard hash function */
    unsigned i;

assert(s);

for (i = 0; *s; ++s)
	i += toupper((unsigned char)*s);
    return i;
}

#define TWELVE (sizeof(unsigned))
#define SEVENTYFIVE (6*sizeof(unsigned))
#define HIGH_BITS (~((unsigned)(~0) >> TWELVE))

unsigned
hashjpw(const char *ss)
{				/* another hash function */
    unsigned h = 0;
    unsigned g;
    const unsigned char *s = (const unsigned char *)ss;

for (; *s; ++s) {
	h = (h << TWELVE) + *s;
	if ((g = h & HIGH_BITS))
	    h = (h ^ (g >> SEVENTYFIVE)) & ~HIGH_BITS;
    }
    return h;
}

003 File Manager

Editing: hash.c

Upload File

Create Folder