diff options
author | eadler <eadler@FreeBSD.org> | 2013-06-15 20:29:07 +0000 |
---|---|---|
committer | eadler <eadler@FreeBSD.org> | 2013-06-15 20:29:07 +0000 |
commit | bf7c0f2705c32e44d3c3b62d60453a30dbbffe3f (patch) | |
tree | dca088b474d4fedf5e6d4ef16e823d7756d587bc /contrib/cvs/src/hash.h | |
parent | b95c459e182fd072e6dac884c7eed86a220534e7 (diff) | |
download | FreeBSD-src-bf7c0f2705c32e44d3c3b62d60453a30dbbffe3f.zip FreeBSD-src-bf7c0f2705c32e44d3c3b62d60453a30dbbffe3f.tar.gz |
Remove CVS from the base system.
Discussed with: many
Reviewed by: peter, zi
Approved by: core
Diffstat (limited to 'contrib/cvs/src/hash.h')
-rw-r--r-- | contrib/cvs/src/hash.h | 64 |
1 files changed, 0 insertions, 64 deletions
diff --git a/contrib/cvs/src/hash.h b/contrib/cvs/src/hash.h deleted file mode 100644 index 77d095a..0000000 --- a/contrib/cvs/src/hash.h +++ /dev/null @@ -1,64 +0,0 @@ -/* - * Copyright (C) 1986-2005 The Free Software Foundation, Inc. - * - * Portions Copyright (C) 1998-2005 Derek Price, Ximbiot <http://ximbiot.com>, - * and others. - * - * Portions Copyright (C) 1992, Brian Berliner and Jeff Polk - * - * You may distribute under the terms of the GNU General Public License as - * specified in the README file that comes with the CVS source distribution. - */ - -/* - * The number of buckets for the hash table contained in each list. This - * should probably be prime. - */ -#define HASHSIZE 151 - -/* - * Types of nodes - */ -enum ntype -{ - NT_UNKNOWN, HEADER, ENTRIES, FILES, LIST, RCSNODE, - RCSVERS, DIRS, UPDATE, LOCK, NDBMNODE, FILEATTR, - VARIABLE, RCSFIELD, RCSCMPFLD -}; -typedef enum ntype Ntype; - -struct hashnode -{ - Ntype type; - struct hashnode *next; - struct hashnode *prev; - struct hashnode *hashnext; - struct hashnode *hashprev; - char *key; - void *data; - void (*delproc) (); -}; -typedef struct hashnode Node; - -struct hashlist -{ - Node *list; - Node *hasharray[HASHSIZE]; - struct hashlist *next; -}; -typedef struct hashlist List; - -List *getlist PROTO((void)); -Node *findnode PROTO((List * list, const char *key)); -Node *findnode_fn PROTO((List * list, const char *key)); -Node *getnode PROTO((void)); -int insert_before PROTO((List * list, Node * marker, Node * p)); -int addnode PROTO((List * list, Node * p)); -int addnode_at_front PROTO((List * list, Node * p)); -int walklist PROTO((List * list, int (*)(Node *n, void *closure), void *closure)); -int list_isempty PROTO ((List *list)); -void dellist PROTO((List ** listp)); -void delnode PROTO((Node * p)); -void freenode PROTO((Node * p)); -void sortlist PROTO((List * list, int (*)(const Node *, const Node *))); -int fsortcmp PROTO((const Node * p, const Node * q)); |