/dports/devel/plan9port/plan9port-1f098efb7370a0b28306d10681e21883fb1c1507/src/cmd/venti/srv/ |
H A D | fmtbloom.c | 20 int nhash; in threadmain() local 27 nhash = 0; in threadmain() 31 if(nhash || nblocks) in threadmain() 36 if(nhash || nblocks) in threadmain() 39 if(nhash > BloomMaxHash){ in threadmain() 99 nhash = bits*7/10; in threadmain() 101 nhash = BloomMaxHash; in threadmain() 103 if(!nhash) in threadmain() 104 nhash = BloomMaxHash; in threadmain() 107 b.nhash = nhash; in threadmain() [all …]
|
/dports/security/vuls/vuls-0.13.7/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/cortexproject/cortex/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/www/gitea/gitea-1.16.5/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/games/automuteus/automuteus-6.15.2/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/security/go-cve-dictionary/go-cve-dictionary-0.5.5/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/grafana/loki/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/net/storj/storj-1.45.3/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/www/oauth2-proxy/oauth2-proxy-7.2.0/vendor/github.com/dgryski/go-rendezvous/ |
H A D | rdv.go | 6 nhash []uint64 member 16 nhash: make([]uint64, len(nodes)), 23 r.nhash[i] = hash(n) 38 var mhash = xorshiftMult64(khash ^ r.nhash[0]) 40 for i, nhash := range r.nhash[1:] { 41 if h := xorshiftMult64(khash ^ nhash); h > mhash { 53 r.nhash = append(r.nhash, r.hash(node)) 65 r.nhash[nidx] = r.nhash[l] 66 r.nhash = r.nhash[:l]
|
/dports/games/scummvm/scummvm-2.5.1/engines/grim/lua/ |
H A D | ltable.cpp | 60 int32 tsize = nhash(t); in present() 80 Node *hashnodecreate(int32 nhash) { in hashnodecreate() argument 83 for (i = 0; i < nhash; i++) in hashnodecreate() 99 nblocks -= gcsize(frees->nhash); in luaH_free() 105 Hash *luaH_new(int32 nhash) { in luaH_new() argument 107 nhash = luaO_redimension((int32)((float)nhash / REHASH_LIMIT)); in luaH_new() 109 nhash(t) = nhash; in luaH_new() 113 nblocks += gcsize(nhash); in luaH_new() 134 int32 nold = nhash(t); in rehash() 138 nhash(t) = luaO_redimension(nhash(t)); in rehash() [all …]
|
/dports/games/residualvm/residualvm-0.3.1/engines/grim/lua/ |
H A D | ltable.cpp | 61 int32 tsize = nhash(t); in present() 115 int32 tsize = nhash(t); 139 for (i = 0; i < nhash; i++) in hashnodecreate() 155 nblocks -= gcsize(frees->nhash); in luaH_free() 161 Hash *luaH_new(int32 nhash) { in luaH_new() argument 163 nhash = luaO_redimension((int32)((float)nhash / REHASH_LIMIT)); in luaH_new() 165 nhash(t) = nhash; in luaH_new() 169 nblocks += gcsize(nhash); in luaH_new() 190 int32 nold = nhash(t); in rehash() 194 nhash(t) = luaO_redimension(nhash(t)); in rehash() [all …]
|
/dports/games/scummvm-tools/scummvm-tools-2.5.0/engines/grim/lua/ |
H A D | ltable.cpp | 64 int32 tsize = nhash(t); in present() 83 Node *hashnodecreate (int32 nhash) in hashnodecreate() argument 87 for (i=0; i<nhash; i++) in hashnodecreate() 113 Hash *luaH_new (int32 nhash) in luaH_new() argument 116 nhash = luaO_redimension((int32)((float)nhash/REHASH_LIMIT)); in luaH_new() 118 nhash(t) = nhash; in luaH_new() 122 L->nblocks += gcsize(nhash); in luaH_new() 130 int32 size = nhash(t); in newsize() 145 int32 nold = nhash(t); in rehash() 150 nhash(t) = nnew; in rehash() [all …]
|
/dports/devel/ucpp/ucpp-31b719e/ |
H A D | Makefile | 84 CSRC = mem.c nhash.c cpp.c lexer.c assert.c macro.c eval.c 90 COBJ = mem.o nhash.o cpp.o lexer.o assert.o macro.o eval.o 102 assert.o: tune.h ucppi.h cpp.h nhash.h mem.h 104 cpp.o: tune.h ucppi.h cpp.h nhash.h mem.h 106 eval.o: tune.h ucppi.h cpp.h nhash.h mem.h arith.c arith.h 108 lexer.o: tune.h ucppi.h cpp.h nhash.h mem.h 110 macro.o: tune.h ucppi.h cpp.h nhash.h mem.h 114 nhash.o: nhash.h mem.h 115 @$(CC) $(CFLAGS) -c nhash.c
|
/dports/biology/clustal-omega/clustal-omega-1.2.4/src/squid/ |
H A D | gki.c | 141 for (i = 0; i < hash->nhash; i++) in GKIFree() 197 if (hash->nkeys > 3*hash->nhash && hash->primelevel < GKI_NPRIMES-1) in GKIStoreKey() 251 for (i = 0; i < hash->nhash; i++) in GKIStatus() 263 printf("Hash table size: %d\n", hash->nhash); in GKIStatus() 296 hash->nhash = gki_primes[hash->primelevel]; in gki_alloc() 297 hash->table = MallocOrDie(sizeof(struct gki_elem) * hash->nhash); in gki_alloc() 298 for (i = 0; i < hash->nhash; i++) in gki_alloc() 331 if (*(++key) == '\0') { val = val % hash->nhash; break; } in gki_hashvalue() 332 val = (GKI_ALPHABETSIZE*val + *key) % hash->nhash; in gki_hashvalue() 365 for (i = 0; i < old->nhash; i++) in gki_upsize() [all …]
|
/dports/converters/p5-Convert-Binary-C/Convert-Binary-C-0.84/ucpp/ |
H A D | Makefile | 82 COBJ = mem.o nhash.o cpp.o lexer.o assert.o macro.o eval.o 93 assert.o: tune.h ucppi.h cpp.h nhash.h mem.h 94 cpp.o: tune.h ucppi.h cpp.h nhash.h mem.h 95 eval.o: tune.h ucppi.h cpp.h nhash.h mem.h arith.c arith.h 96 lexer.o: tune.h ucppi.h cpp.h nhash.h mem.h 97 macro.o: tune.h ucppi.h cpp.h nhash.h mem.h 99 nhash.o: nhash.h mem.h
|
/dports/textproc/heirloom-doctools/heirloom-doctools-160308/refer/ |
H A D | inv6.c | 30 whash(FILE *ft, FILE *fa, FILE *fb, int nhash, int iflong, long *ptotct, int *phused) in whash() argument 43 hpt = calloc (nhash+1, sizeof(*hpt)); in whash() 45 hfreq = calloc (nhash, sizeof(*hfreq)); in whash() 80 while (hash<nhash) in whash() 82 fwrite(&nhash, sizeof(nhash), 1, fa); in whash() 84 fwrite(hpt, sizeof(*hpt), nhash, fa); in whash() 86 fwrite (hfreq, sizeof(*hfreq), nhash, fa); in whash()
|
H A D | glue1.c | 64 static int nhash = 0; in huntmain() local 164 fread (&nhash, sizeof(nhash), 1, fa); in huntmain() 166 if (nhash > maxhash) in huntmain() 174 maxhash=nhash; in huntmain() 180 hpt = zalloc(nhash, sizeof(*hpt)); in huntmain() 185 err("No space for hash list (%d)", nhash); in huntmain() 186 fread( hpt, sizeof(*hpt), nhash, fa); in huntmain() 188 hfreq=zalloc(nhash, sizeof(*hfreq)); in huntmain() 191 nhash); in huntmain() 192 frtbl = fread(hfreq, sizeof(*hfreq), nhash, fa); in huntmain() [all …]
|
/dports/textproc/xmlf90/xmlf90-1.5.5/doc/Examples/sax/count/ |
H A D | m_count.f90 | 19 INTEGER, public, save :: nhash = 0 variable 40 nhash=nhash+1 44 DO i=1,nhash 59 nhash=nhash+1 62 n=nhash
|
/dports/graphics/opendx/dx-4.4.4/src/exec/libdx/ |
H A D | neighbors.c | 141 for (nhash=1; nhash<goal; nhash*=2) in _dxf_TetraNeighbors() 153 for (nhash=1; nhash<goal; nhash*=2) in _dxf_TetraNeighbors() 180 h = (h+1) & (nhash-1); in _dxf_TetraNeighbors() 188 if (++n>nhash) in _dxf_TetraNeighbors() 301 for (nhash=1; nhash<4*ntriangles; nhash*=2) in TriNeighbors() 390 int nquads, nhash; in QuadNeighbors() local 426 for (nhash=1; nhash<4*nquads; nhash*=2) in QuadNeighbors() 531 int ncubes, nhash; in _dxf_CubeNeighbors() local 572 for (nhash=1; nhash<goal; nhash*=2) in _dxf_CubeNeighbors() 583 for (nhash=1; nhash<goal; nhash*=2) in _dxf_CubeNeighbors() [all …]
|
/dports/devel/stylua/StyLua-0.11.0/cargo-crates/memchr-2.4.1/src/memmem/ |
H A D | rabinkarp.rs | 47 nhash: &NeedleHash, in find_with() 59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with() 65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with() 78 nhash: &NeedleHash, in rfind_with() 88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with() 95 &nhash, in rfind_with() 186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll() 187 self.del(nhash, old); in roll() 198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del() 199 let factor = nhash.hash_2pow; in del()
|
/dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/memchr-2.4.1/src/memmem/ |
H A D | rabinkarp.rs | 47 nhash: &NeedleHash, in find_with() 59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with() 65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with() 78 nhash: &NeedleHash, in rfind_with() 88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with() 95 &nhash, in rfind_with() 186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll() 187 self.del(nhash, old); in roll() 198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del() 199 let factor = nhash.hash_2pow; in del()
|
/dports/misc/broot/broot-1.7.0/cargo-crates/memchr-2.4.0/src/memmem/ |
H A D | rabinkarp.rs | 47 nhash: &NeedleHash, in find_with() 59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with() 65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with() 78 nhash: &NeedleHash, in rfind_with() 88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with() 95 &nhash, in rfind_with() 186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll() 187 self.del(nhash, old); in roll() 198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del() 199 let factor = nhash.hash_2pow; in del()
|
/dports/devel/cargo-c/cargo-c-0.9.6+cargo-0.58/cargo-crates/memchr-2.4.1/src/memmem/ |
H A D | rabinkarp.rs | 47 nhash: &NeedleHash, in find_with() 59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with() 65 hash.roll(&nhash, haystack[0], haystack[needle.len()]); in find_with() 78 nhash: &NeedleHash, in rfind_with() 88 if nhash.eq(hash) && is_suffix(haystack, needle) { in rfind_with() 95 &nhash, in rfind_with() 186 fn roll(&mut self, nhash: &NeedleHash, old: u8, new: u8) { in roll() 187 self.del(nhash, old); in roll() 198 fn del(&mut self, nhash: &NeedleHash, byte: u8) { in del() 199 let factor = nhash.hash_2pow; in del()
|