luke
/
netgen
mirror of https://github.com/RTimothyEdwards/netgen.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
netgen/base/hash.h

53 lines
2.1 KiB
C
Raw Normal View History

Initial commit at Mon May 18 09:27:46 EDT 2015 by tim on stravinsky
2015-05-18 15:27:46 +02:00
#ifndef _HASH_H
#define _HASH_H
struct hashlist {
char *name;
void *ptr;
struct hashlist *next;
};
extern void InitializeHashTable(struct hashlist **tab, int size);
extern int RecurseHashTable(struct hashlist **hashtab, int hashsize,
int (*func)(struct hashlist *elem));
extern int RecurseHashTableValue(struct hashlist **hashtab, int hashsize,
int (*func)(struct hashlist *elem, int), int);
extern struct nlist *RecurseHashTablePointer(struct hashlist **hashtab,
int hashsize, struct nlist *(*func)(struct hashlist *elem,
void *), void *pointer);
extern int CountHashTableEntries(struct hashlist *p);
extern int CountHashTableBinsUsed(struct hashlist *p);
extern void HashDelete(char *name, struct hashlist **hashtab, int hashsize);
extern void HashIntDelete(char *name, int value, struct hashlist **hashtab,
int hashsize);
/* these functions return a pointer to a hash list element */
extern struct hashlist *HashInstall(char *name, struct hashlist **hashtab,
int hashsize);
extern struct hashlist *HashPtrInstall(char *name, void *ptr,
struct hashlist **hashtab, int hashsize);
extern struct hashlist *HashIntPtrInstall(char *name, int value, void *ptr,
struct hashlist **hashtab, int hashsize);
Fairly extensive modifications that allow for handling of, and comparisons between, duplicate cells (cells with the same netlist that may have more than one name in a circuit, or which for some reason appear with the same name more than once in a netlist). Added more checks to the list prematching, which prevents various troubles with cells having a mismatched hierarchy. Added a command option to "flatten class" to flatten instances only within a specific cell. Corrected one error in the pin matching routine. Added a check in the pin matching routine to look for pins that have been found to be no-connects after cleaning up the pin lists of the children of that cell.
2016-05-16 16:50:12 +02:00
extern struct hashlist *HashInt2PtrInstall(char *name, int c, void *ptr,
struct hashlist **hashtab, int hashsize);
Initial commit at Mon May 18 09:27:46 EDT 2015 by tim on stravinsky
2015-05-18 15:27:46 +02:00
/* these functions return the ->ptr field of a struct hashlist */
extern void *HashLookup(char *s, struct hashlist **hashtab, int hashsize);
extern void *HashIntLookup(char *s, int i, struct hashlist **hashtab, int hashsize);
Fairly extensive modifications that allow for handling of, and comparisons between, duplicate cells (cells with the same netlist that may have more than one name in a circuit, or which for some reason appear with the same name more than once in a netlist). Added more checks to the list prematching, which prevents various troubles with cells having a mismatched hierarchy. Added a command option to "flatten class" to flatten instances only within a specific cell. Corrected one error in the pin matching routine. Added a check in the pin matching routine to look for pins that have been found to be no-connects after cleaning up the pin lists of the children of that cell.
2016-05-16 16:50:12 +02:00
extern void *HashInt2Lookup(char *s, int c, struct hashlist **hashtab, int hashsize);
Initial commit at Mon May 18 09:27:46 EDT 2015 by tim on stravinsky
2015-05-18 15:27:46 +02:00
extern void *HashFirst(struct hashlist **hashtab, int hashsize);
extern void *HashNext(struct hashlist **hashtab, int hashsize);
extern unsigned long hashnocase(char *s, int hashsize);
extern unsigned long hash(char *s, int hashsize);
extern int (*matchfunc)(char *, char *);
/* matchintfunc() compares based on the name and the first */
/* entry of the pointer value, which is cast as an integer */
extern int (*matchintfunc)(char *, char *, int, int);
extern unsigned long (*hashfunc)(char *, int);
#endif /* _HASH_H */