Searched refs:bucket (Results 1 - 25 of 48) sorted by relevance

12

/openbsd-current/usr.bin/yacc/
H A Dsymtab.c44 bucket **symbol_table;
45 bucket *first_symbol;
46 bucket *last_symbol;
67 bucket *
70 bucket *bp;
73 bp = malloc(sizeof(bucket));
92 bucket *
95 bucket *bp, **bpp;
118 bucket *bp;
120 symbol_table = calloc(TABLE_SIZE, sizeof(bucket *));
[all...]
H A Dreader.c56 bucket *goal;
62 bucket **pitem;
65 bucket **plhs;
79 bucket *get_literal(void);
81 bucket *get_name(void);
92 void start_rule(bucket *, int);
630 bucket *
635 bucket *bp;
801 bucket *
888 bucket *b
[all...]
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.dg/noncompile/
H A D920923-1.c71 register prec_t bucket; local
73 bucket = mem_hash+((((v_addr)>>ITEMBITS))&hash_mask); /* { error "undeclared|for each function" } */
75 if (bucket->v_addr == ((v_addr)>>ITEMBITS) { /* { error "incomplete type|parse error" } */
76 if(!(bucket->perm_set&va_op))
80 } while((bucket++)->v_addr != ((caddr_t)0)); /* { error "parse error" } */
83 p_addr = (--bucket)->p_addr; /* { error "undeclared|pointer to" } */
103 register prec_t bucket;
105 bucket = hasht;
107 bucket->v_addr = ((caddr_t)0);/* { error "undeclared|pointer to|parse error" } */
108 bucket
[all...]
/openbsd-current/usr.sbin/npppd/common/
H A Dhash.c53 htbl->bucket = calloc(htbl->size, sizeof(hash_link *));
63 * Returns a pointer of first bucket on success. Otherwise returns
75 * Returns a pointer of next bucket on success. Otherwise returns
89 if (htbl->bucket[htbl->cur] != NULL) {
90 hlink = htbl->bucket[htbl->cur++];
100 * Return a pointer of the bucket on success. Otherwise returns
112 for (w = htbl->bucket[c]; w != NULL; w = w->next)
138 n->next = htbl->bucket[c];
139 htbl->bucket[c] = n;
159 for (w = htbl->bucket[
[all...]
H A Dhash.h44 hash_link **bucket; member in struct:__anon10709
/openbsd-current/gnu/gcc/gcc/
H A Dtree-phinodes.c134 int bucket = NUM_BUCKETS - 2; local
139 for (bucket = len - 2; bucket < NUM_BUCKETS - 2; bucket++)
140 if (free_phinodes[bucket])
144 if (bucket < NUM_BUCKETS - 2
145 && PHI_ARG_CAPACITY (free_phinodes[bucket]) >= len)
148 phi = free_phinodes[bucket];
149 free_phinodes[bucket] = PHI_CHAIN (free_phinodes[bucket]);
244 int bucket; local
[all...]
H A Drtl-factoring.c315 p_hash_bucket bucket; local
324 bucket = htab_find (hash_buckets, &tmp_bucket);
326 if (bucket)
331 elem = htab_find (bucket->seq_candidates, &tmp_elem);
1205 p_hash_bucket bucket = (p_hash_bucket) p; local
1206 return bucket->hash;
1222 p_hash_bucket bucket = (p_hash_bucket) p; local
1224 if (bucket->seq_candidates)
1225 htab_delete (bucket->seq_candidates);
1227 free (bucket);
1265 p_hash_bucket bucket; local
[all...]
/openbsd-current/gnu/usr.bin/perl/
H A Dmalloc.c53 # Add one page to big powers of two when calculating bucket size.
58 # Use intermediate bucket sizes between powers-of-two. This is
66 # Use table lookup to decide in which bucket a given allocation will go.
113 # size of the bucket. This enables optimized allocations of sizes
130 # Add this much memory to big powers of two to get the bucket size.
143 # define this to disable 12-byte bucket (will increase memory footprint)
405 u_char ovu_index; /* bucket # */
408 /* Subtract one to fit into u_short for an extra bucket */
424 # define RMAGIC_SZ sizeof (u_int) /* Overhead at end of bucket */
537 * schemes above], see OV_MAGIC(block,bucket)
1181 int bucket; local
1237 int bucket; local
1439 get_from_bigger_buckets(int bucket, MEM_SIZE size) argument
1469 getpages(MEM_SIZE needed, int *nblksp, int bucket) argument
1663 morecore(int bucket) argument
1813 u_char bucket; local
1916 int bucket; local
2163 const int bucket = OV_INDEX(ovp); local
[all...]
/openbsd-current/gnu/usr.bin/binutils/gdb/
H A Dbcache.c74 struct bstring **bucket; member in struct:bcache
162 * sizeof (bcache->bucket[0]));
171 for (s = bcache->bucket[i]; s; s = next)
184 if (bcache->bucket)
185 xfree (bcache->bucket);
186 bcache->bucket = new_buckets;
220 /* Search the hash bucket for a string identical to the caller's.
223 for (s = bcache->bucket[hash_index]; s; s = s->next)
241 new->next = bcache->bucket[hash_index];
243 bcache->bucket[hash_inde
[all...]
/openbsd-current/regress/sys/net/rtable/
H A Dkern_compat.h46 #define malloc(size, bucket, flag) calloc(1, size)
47 #define mallocarray(nelems, size, bucket, flag) calloc(nelems, size)
48 #define free(x, bucket, size) free(x)
/openbsd-current/usr.bin/dig/lib/isc/
H A Dsymtab.c152 unsigned int bucket; local
157 FIND(symtab, key, type, bucket, elt);
211 unsigned int bucket; local
217 FIND(symtab, key, type, bucket, elt);
223 UNLINK(symtab->table[bucket], elt, link);
250 PREPEND(symtab->table[bucket], elt, link);
/openbsd-current/libexec/tradcpp/
H A Dmacro.c326 struct macroarray *bucket; local
331 bucket = macroarrayarray_get(&macros, i);
332 if (bucket != NULL) {
333 macroarray_destroyall(bucket);
334 macroarray_destroy(bucket);
346 struct macroarray *bucket; local
352 bucket = macroarrayarray_get(&macros, hash & hashmask);
353 if (bucket == NULL) {
356 num = macroarray_num(bucket);
358 m = macroarray_get(bucket,
440 struct macroarray *bucket; local
[all...]
/openbsd-current/sys/uvm/
H A Duvm_amap.c117 int bucket = UVM_AMAP_BUCKET(amap, slot); local
125 for (chunk = amap->am_buckets[bucket]; chunk != NULL;
127 if (UVM_AMAP_BUCKET(amap, chunk->ac_baseslot) != bucket)
147 KASSERT(amap->am_buckets[bucket] == NULL);
148 amap->am_buckets[bucket] = newchunk;
162 int bucket = UVM_AMAP_BUCKET(amap, chunk->ac_baseslot); local
170 if (amap->am_buckets[bucket] == chunk) {
172 UVM_AMAP_BUCKET(amap, nchunk->ac_baseslot) == bucket)
173 amap->am_buckets[bucket] = nchunk;
175 amap->am_buckets[bucket]
1019 int bucket, startbucket, endbucket; local
[all...]
/openbsd-current/lib/libc/stdlib/
H A Dmalloc.c223 u_short bucket; member in struct:chunk_info
326 * real size, otherwise low bits is the bucket + 1
978 init_chunk_info(struct dir_info *d, struct chunk_info *p, u_int bucket) argument
982 p->bucket = bucket;
983 p->total = p->free = MALLOC_PAGESIZE / B2ALLOC(bucket);
994 alloc_chunk_info(struct dir_info *d, u_int bucket) argument
998 if (LIST_EMPTY(&d->chunk_info_list[bucket])) {
1003 count = MALLOC_PAGESIZE / B2ALLOC(bucket);
1012 if (mopts.chunk_canaries && bucket >
1049 omalloc_make_chunks(struct dir_info *d, u_int bucket, u_int listnum) argument
1169 u_int i, j, k, r, bucket, listnum; local
[all...]
/openbsd-current/sys/kern/
H A Dkern_malloc.c91 struct kmembuckets bucket[MINBUCKET + 16]; variable in typeref:struct:kmembuckets
191 kbp = &bucket[indx];
329 panic("malloc: wrong bucket");
386 kbp = &bucket[kup->ku_indx];
566 XSIMPLEQ_INIT(&bucket[indx].kb_freelist);
571 bucket[indx].kb_elmpercl = 1;
573 bucket[indx].kb_elmpercl = PAGE_SIZE / (1 << indx);
574 bucket[indx].kb_highwat = 5 * bucket[indx].kb_elmpercl;
622 memcpy(&kb, &bucket[BUCKETIND
[all...]
H A Dkern_timeout.c542 * Hash the absolute time into a bucket on a given level of the wheel.
550 * resulting number indicates which bucket the absolute time belongs
592 * to dump every bucket in the level. We have necessarily completed
597 * expired bucket is greater than that of the last then we have
927 db_show_callout_bucket(struct circq *bucket) argument
931 CIRCQ_FOREACH(p, bucket)
932 db_show_timeout(timeout_from_circq(p), bucket);
936 db_show_timeout(struct timeout *to, struct circq *bucket) argument
948 if (bucket == &timeout_new)
950 else if (bucket
[all...]
/openbsd-current/gnu/llvm/clang/utils/hmaptool/
H A Dhmaptool139 for i,bucket in enumerate(hmap.buckets):
140 key_idx,prefix_idx,suffix_idx = bucket
150 print (" bucket[%d]: %r -> (%r, %r) -- %d" % (
226 for bucket in table:
227 f.write(struct.pack(bucket_fmt, *bucket))
/openbsd-current/lib/libc/db/hash/
H A Dhash.c154 * maximum bucket number, so the number of buckets is
284 /* Fix bucket size to be optimal for file system */
579 /* Pin the bucket chain */
686 u_int32_t bucket; local
707 for (bucket = hashp->cbucket;
708 bucket <= hashp->MAX_BUCKET;
709 bucket++, hashp->cndx = 1) {
710 bufp = __get_buf(hashp, bucket, NULL, 0);
718 hashp->cbucket = bucket;
808 * split bucket t
846 int n, bucket; local
[all...]
/openbsd-current/gnu/usr.bin/perl/regen/
H A Dmk_invlists.pl996 # contents of the corresponding bucket. Effectively this function just
1066 # If the bucket contains only one element, convert from an array to a
2837 # pretty much can ignore the 2nd bucket, as it is completely
2841 # bucket is an inversion list of native code points that map
2866 my $bucket;
2873 $bucket = join "\cK", map { a2n($_) } @{$invmap[0]};
2883 $bucket = $invmap[0] == 0 ? 0 : a2n($invmap[0]);
2885 $bucket = $invmap[0];
2888 # We now have the bucket that all code points in the range
2891 # it into its bucket
[all...]
/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Ddominance.c81 /* bucket[x] points to the first node of the set of nodes having x as key. */
82 TBB *bucket; member in struct:dom_info
162 init_ar (di->bucket, TBB, num, 0);
188 free (di->bucket);
521 di->next_bucket[v] = di->bucket[k];
522 di->bucket[k] = v;
525 for (w = di->bucket[par]; w; w = di->next_bucket[w])
534 di->bucket[par] = 0;
H A Dprint-tree.c35 struct bucket struct
38 struct bucket *next;
41 static struct bucket **table;
51 table = (struct bucket **) xcalloc (HASH_SIZE, sizeof (struct bucket *));
169 struct bucket *b;
215 b = (struct bucket *) xmalloc (sizeof (struct bucket));
/openbsd-current/sbin/isakmpd/
H A Dsa.c329 u_int16_t bucket = 0; local
338 bucket ^= cp[0] | cp[1] << 8;
343 bucket ^= cp[0] | cp[1] << 8;
345 bucket &= bucket_mask;
346 LIST_INSERT_HEAD(&sa_tab[bucket], sa, link);
370 u_int16_t bucket = 0; local
385 bucket ^= cp[0] | cp[1] << 8;
391 bucket ^= cp[0] | cp[1] << 8;
393 bucket &= bucket_mask;
394 for (sa = LIST_FIRST(&sa_tab[bucket]);
[all...]
H A Dx509.c481 u_int16_t bucket = 0; local
487 bucket ^= (id[i] + 1) * (id[i + 1] + 257);
491 bucket ^= (id[i] + 1) * (id[i] + 257);
493 bucket &= bucket_mask;
494 return bucket;
571 u_int16_t bucket = 0; local
591 bucket = x509_hash(id[i], len[i]);
593 LIST_INSERT_HEAD(&x509_tab[bucket], certh, link);
595 "x509_hash_enter: cert %p added to bucket %d",
596 cert, bucket));
[all...]
/openbsd-current/gnu/usr.bin/cvs/diff/
H A Dio.c43 int next; /* Next item in this bucket. */
57 The bucket-chains go through the elements in this array.
197 int i, *bucket;
284 bucket = &buckets[h % nbuckets];
292 put the line into bucket[-1]. */
294 bucket = &buckets[-1];
301 for (i = *bucket; ; i = eqs[i].next)
304 /* Create a new equivalence class in this bucket. */
309 eqs[i].next = *bucket;
313 *bucket
194 int i, *bucket; local
[all...]
/openbsd-current/gnu/llvm/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h98 // ForEach acquires a lock on each bucket while iterating over
115 Bucket *bucket = &table_[n]; local
117 ReadLock lock(&bucket->mtx);
120 Cell *c = &bucket->cells[i];
128 (AddBucket *)atomic_load(&bucket->add, memory_order_acquire)) {
215 // If we want to remove the element, we need exclusive access to the bucket,
352 // See if we need to compact the bucket.

Completed in 554 milliseconds

12