Lines Matching defs:bbs
36 bb_hash bbs;
42 bbs.size = 8437;
43 bbs.entries = 0;
44 bbs.table = (BB**) CLG_MALLOC("cl.bb.ibh.1",
45 bbs.size * sizeof(BB*));
47 for (i = 0; i < bbs.size; i++) bbs.table[i] = NULL;
52 return &bbs;
55 /* The hash stores BBs according to
73 new_size = 2* bbs.size +3;
80 for (i = 0; i < bbs.size; i++) {
81 if (bbs.table[i] == NULL) continue;
83 curr = bbs.table[i];
101 VG_(free)(bbs.table);
105 bbs.size, new_size,
106 bbs.entries, conflicts1, conflicts2);
108 bbs.size = new_size;
109 bbs.table = new_table;
126 bbs.entries++;
127 if (10 * bbs.entries / bbs.size > 8)
152 idx = bb_hash_idx(obj, offset, bbs.size);
153 bb->next = bbs.table[idx];
154 bbs.table[idx] = bb;
182 idx = bb_hash_idx(obj, offset, bbs.size);
183 bb = bbs.table[idx];
230 * BBs are never discarded. There are 2 cases where this function
295 idx = bb_hash_idx(obj, offset, bbs.size);
296 bb = bbs.table[idx];
322 tl_assert(bb == bbs.table[idx]);
323 bbs.table[idx] = bb->next;
325 tl_assert(bb != bbs.table[idx]);
