Home
last modified time | relevance | path

Searched refs:HASHTABLESIZE (Results 1 – 25 of 88) sorted by relevance

1234

/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/alephdir/
H A Dalephmem.h68 #define HASHTABLESIZE 23123 macro
70 (hashtable[(a)%HASHTABLESIZE].mw) : \
73 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
76 (hashtable[(a)%HASHTABLESIZE].mw.cint) : \
79 (hashtable[(a)%HASHTABLESIZE].mw.hh.rh) : \
82 (hashtable[(a)%HASHTABLESIZE].mw.cint1) : \
85 (hashtable[(a)%HASHTABLESIZE].mw.hh.b1) : \
88 (hashtable[(a)%HASHTABLESIZE].mw.hh.b0) : \
91 (hashtable[(a)%HASHTABLESIZE].mw=v) : \
94 (hashtable[(a)%HASHTABLESIZE].mw.cint=v) : \
[all …]
H A Daleph.c191 hashword hashtable[HASHTABLESIZE];
197 for (i=0; i<HASHTABLESIZE; i++) { in inithhashtable()
206 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createeqtbpos()
223 hashword *runner= &(hashtable[p%HASHTABLESIZE]);
240 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createxeqlevel()
257 hashword *runner= &(hashtable[p%HASHTABLESIZE]); in createhashpos()
276 for (i=0; i<HASHTABLESIZE; i++) { in dumphhashtable()
287 dumpint(-HASHTABLESIZE); in dumphhashtable()
297 while (j<HASHTABLESIZE) { in undumphhashtable()
303 if (i<HASHTABLESIZE) { in undumphhashtable()
/dports/security/keynote/keynote-2.3/
H A Dauxil.c64 res += BN_mod_word(dsa->p, HASHTABLESIZE); in keynote_keyhash()
65 res += BN_mod_word(dsa->q, HASHTABLESIZE); in keynote_keyhash()
66 res += BN_mod_word(dsa->g, HASHTABLESIZE); in keynote_keyhash()
67 res += BN_mod_word(dsa->pub_key, HASHTABLESIZE); in keynote_keyhash()
68 return res % HASHTABLESIZE; in keynote_keyhash()
72 res += BN_mod_word(rsa->n, HASHTABLESIZE); in keynote_keyhash()
73 res += BN_mod_word(rsa->e, HASHTABLESIZE); in keynote_keyhash()
74 return res % HASHTABLESIZE; in keynote_keyhash()
80 return res % HASHTABLESIZE; in keynote_keyhash()
91 return keynote_stringhash(key, HASHTABLESIZE); in keynote_keyhash()
[all …]
H A Denvironment.c373 HASHTABLESIZE * sizeof(struct environment *)); in keynote_init_environment()
375 HASHTABLESIZE * sizeof(struct assertion *)); in keynote_init_environment()
380 keynote_current_session->ks_env_table, HASHTABLESIZE, in keynote_init_environment()
526 for (i = 0; i < HASHTABLESIZE; i++) in kn_close()
590 HASHTABLESIZE, flags); in kn_add_action()
625 HASHTABLESIZE); in kn_remove_action()
630 HASHTABLESIZE); in kn_remove_action()
686 for (i = 0; i < HASHTABLESIZE; i++) in kn_do_query()
723 for (i = 0; i < HASHTABLESIZE; i++) in kn_get_failed()
970 for (i = 0; i < HASHTABLESIZE; i++) in kn_get_authorizer()
[all …]
H A Dassertion.h28 #define HASHTABLESIZE 37 macro
36 struct environment *ks_env_table[HASHTABLESIZE];
39 struct assertion *ks_assertion_table[HASHTABLESIZE];
H A Dparse_assertion.c204 for (i = 0; i < HASHTABLESIZE; i++) in keynote_fix_fields()
257 for (i = 0; i < HASHTABLESIZE; i++) in keynote_fix_fields()
297 for (i = 0, prev = 0; i < HASHTABLESIZE; i++) in keynote_evaluate_query()
H A Dkeynote.y729 HASHTABLESIZE); in my_lookup()
737 ks->ks_env_table, HASHTABLESIZE); in my_lookup()
762 ret = keynote_env_lookup(s, ks->ks_env_table, HASHTABLESIZE); in my_lookup()
/dports/graphics/seejpeg/seejpeg-1.10/
H A Dcmap.c20 #define HASHTABLESIZE 1024 macro
31 static unsigned long hashtable[HASHTABLESIZE];
45 for (i = 0; i < HASHTABLESIZE; i++) in translate_init()
81 if (++key == HASHTABLESIZE) in lookup_colour()
/dports/net/kamailio/kamailio-5.4.5/src/modules/siputils/
H A Dring.h34 #define HASHTABLESIZE (((unsigned int)1) << HASHTABLEBITS) macro
35 #define HASHTABLEMASK (HASHTABLESIZE - 1)
H A Dring.c69 typedef struct hashtable_entry_t hashtable_t[HASHTABLESIZE];
120 for (i=0; i<HASHTABLESIZE; i++) { in ring_init_hashtable()
135 for (i=0; i<HASHTABLESIZE; i++) { in ring_destroy_hashtable()
/dports/devel/allegro/allegro-4.4.3.1/src/
H A Dquantize.c51 #define HASHTABLESIZE 1031 macro
86 p = &hash_table[color % HASHTABLESIZE]; in insert_node()
285 hash_table = _AL_MALLOC(HASHTABLESIZE * sizeof(NODE)); in generate_optimized_palette_ex()
289 for (i = 0; i < HASHTABLESIZE; i++) { in generate_optimized_palette_ex()
367 for (i = 0, j = rsvduse; i<HASHTABLESIZE; i++) { in generate_optimized_palette_ex()
/dports/textproc/ltxml/ltxml-1.2.9/XML/src/std/
H A Dhash.c14 #ifndef HASHTABLESIZE
15 #define HASHTABLESIZE 3000 macro
31 HashTab *NewHashStruct( void ) { return NewSizedHashStruct( HASHTABLESIZE ); } in NewHashStruct()
/dports/irc/scrollz/ScrollZ-ScrollZ-2.3/include/
H A Dmystructs.h13 #define HASHTABLESIZE 31 macro

1234