Lines Matching full:ddpa
91 DedupPoolAlloc* ddpa;
98 ddpa = alloc_fn(cc, sizeof(*ddpa));
99 VG_(memset)(ddpa, 0, sizeof(*ddpa));
100 ddpa->poolSzB = poolSzB;
101 ddpa->fixedSzb = 0;
102 ddpa->strPA = False;
103 ddpa->eltAlign = eltAlign;
104 ddpa->alloc_fn = alloc_fn;
105 ddpa->cc = cc;
106 ddpa->free_fn = free_fn;
107 ddpa->pools = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(void*) );
109 ddpa->ht_elements = VG_(HT_construct) (cc);
110 ddpa->ht_node_pa = VG_(newPA) ( sizeof(ht_node),
115 ddpa->curpool = NULL;
116 ddpa->curpool_limit = NULL;
117 ddpa->curpool_free = NULL;
119 return ddpa;
122 void VG_(deleteDedupPA) ( DedupPoolAlloc* ddpa)
125 if (ddpa->ht_elements)
127 VG_(freezeDedupPA) (ddpa, NULL);
128 for (i = 0; i < VG_(sizeXA) (ddpa->pools); i++)
129 ddpa->free_fn (*(UWord **)VG_(indexXA) ( ddpa->pools, i ));
130 VG_(deleteXA) (ddpa->pools);
131 ddpa->free_fn (ddpa);
135 UChar* ddpa_align ( DedupPoolAlloc* ddpa, UChar *c )
137 return (UChar*)VG_ROUNDUP(c, ddpa->eltAlign);
140 /* Allocate a new pool or grow the (only) pool for a fixed size ddpa. */
142 static void ddpa_add_new_pool_or_grow ( DedupPoolAlloc* ddpa )
144 vg_assert(ddpa);
146 if (ddpa->fixedSzb > 0 && ddpa->curpool != NULL) {
148 UChar *curpool_align = ddpa_align(ddpa, ddpa->curpool);
149 SizeT curpool_used = ddpa->curpool_free - curpool_align;
150 SizeT curpool_size = ddpa->curpool_limit - ddpa->curpool + 1;
151 UChar *newpool = ddpa->alloc_fn (ddpa->cc, 2 * curpool_size);
152 UChar *newpool_free = ddpa_align (ddpa, newpool);
160 VG_(HT_ResetIter) (ddpa->ht_elements);
161 while ((n = VG_(HT_Next) (ddpa->ht_elements))) {
166 VG_(dropHeadXA) (ddpa->pools, 1);
167 ddpa->free_fn (ddpa->curpool);
168 ddpa->curpool = newpool;
169 ddpa->curpool_free = newpool_free;
170 ddpa->curpool_limit = newpool_limit;
171 VG_(addToXA)( ddpa->pools, &ddpa->curpool);
174 fixed size ddpa. */
175 ddpa->curpool = ddpa->alloc_fn( ddpa->cc, ddpa->poolSzB);
176 ddpa->curpool_limit = ddpa->curpool + ddpa->poolSzB - 1;
177 ddpa->curpool_free = ddpa_align (ddpa, ddpa->curpool);
179 VG_(addToXA)( ddpa->pools, &ddpa->curpool );
214 static void print_stats (DedupPoolAlloc *ddpa)
219 ddpa->cc,
220 (long int) ddpa->nr_alloc_calls,
221 VG_(HT_count_nodes)(ddpa->ht_elements),
222 VG_(sizeXA)(ddpa->pools),
223 ddpa->curpool ?
224 (long int) (ddpa->curpool_limit - ddpa->curpool_free + 1) : 0);
225 if (ddpa->strPA)
226 VG_(HT_print_stats) (ddpa->ht_elements, cmp_pool_str);
228 VG_(HT_print_stats) (ddpa->ht_elements, cmp_pool_elt);
237 void VG_(freezeDedupPA) (DedupPoolAlloc *ddpa,
242 print_stats(ddpa);
244 vg_assert (!ddpa->fixedSzb || VG_(sizeXA) (ddpa->pools) == 1);
245 if (shrink_block && ddpa->curpool_limit > ddpa->curpool_free)
246 (*shrink_block)(ddpa->curpool, ddpa->curpool_free - ddpa->curpool);
247 VG_(HT_destruct) ( ddpa->ht_elements, htelem_dummyfree);
248 ddpa->ht_elements = NULL;
249 VG_(deletePA) (ddpa->ht_node_pa);
250 ddpa->ht_node_pa = NULL;
266 static ht_node* allocEltDedupPA (DedupPoolAlloc *ddpa, SizeT eltSzB,
272 vg_assert(ddpa);
273 vg_assert(ddpa->ht_elements);
275 ddpa->nr_alloc_calls++;
281 if (ddpa->strPA)
282 ht_ins = VG_(HT_gen_lookup) (ddpa->ht_elements, &ht_elt, cmp_pool_str);
285 ht_ins = VG_(HT_gen_lookup) (ddpa->ht_elements, &ht_elt, cmp_pool_elt);
294 if (eltSzB + ddpa->eltAlign > ddpa->poolSzB) {
297 UChar *newpool = ddpa->alloc_fn (ddpa->cc, eltSzB + ddpa->eltAlign);
299 VG_(addToXA)( ddpa->pools, &newpool );
300 elt_ins = ddpa_align (ddpa, newpool);
302 if (UNLIKELY(ddpa->curpool_free == NULL
303 || ddpa->curpool_free + eltSzB - 1 > ddpa->curpool_limit)) {
304 ddpa_add_new_pool_or_grow (ddpa);
306 elt_ins = ddpa->curpool_free;
307 ddpa->curpool_free = ddpa_align(ddpa, ddpa->curpool_free + eltSzB);
312 ht_ins = VG_(allocEltPA) (ddpa->ht_node_pa);
314 if (ddpa->strPA)
315 ht_ins->eltSzBorStrNr = VG_(HT_count_nodes)(ddpa->ht_elements) + 1;
319 VG_(HT_add_node)(ddpa->ht_elements, ht_ins);
323 const void* VG_(allocEltDedupPA) (DedupPoolAlloc *ddpa, SizeT eltSzB,
326 return allocEltDedupPA(ddpa, eltSzB, elt)->elt;
329 UInt VG_(allocStrDedupPA) (DedupPoolAlloc *ddpa,
333 if (!ddpa->strPA) {
334 // First insertion in this ddpa
335 vg_assert (ddpa->nr_alloc_calls == 0);
336 vg_assert (ddpa->fixedSzb == 0);
337 ddpa->strPA = True;
340 const UInt nr_str = VG_(HT_count_nodes)(ddpa->ht_elements);
341 const ht_node* ht_ins = allocEltDedupPA(ddpa, VG_(strlen)(str)+1, str);
343 *newStr = nr_str < VG_(HT_count_nodes)(ddpa->ht_elements);
348 UInt elt2nr (DedupPoolAlloc *ddpa, const void *dedup_elt)
350 vg_assert (dedup_elt >= (const void *)ddpa->curpool
351 && dedup_elt < (const void *)ddpa->curpool_free);
352 return 1 + ((const UChar*)dedup_elt - (const UChar *)ddpa->curpool)
353 / VG_ROUNDUP(ddpa->fixedSzb, ddpa->eltAlign);
356 UInt VG_(allocFixedEltDedupPA) (DedupPoolAlloc *ddpa,
359 if (ddpa->fixedSzb == 0) {
360 // First insertion in this ddpa
361 vg_assert (!ddpa->strPA);
362 vg_assert (ddpa->nr_alloc_calls == 0);
364 ddpa->fixedSzb = eltSzB;
366 vg_assert (ddpa->fixedSzb == eltSzB);
367 const void *dedup_elt = VG_(allocEltDedupPA) (ddpa, eltSzB, elt);
368 return elt2nr (ddpa, dedup_elt);
371 void* VG_(indexEltNumber) (DedupPoolAlloc *ddpa,
376 dedup_elt = ddpa->curpool
377 + (eltNr - 1) * VG_ROUNDUP(ddpa->fixedSzb, ddpa->eltAlign);
379 vg_assert ((UChar*)dedup_elt >= ddpa->curpool
380 && (UChar*)dedup_elt < ddpa->curpool_free);
385 UInt VG_(sizeDedupPA) (DedupPoolAlloc *ddpa)
387 if (ddpa->curpool == NULL)
390 vg_assert (ddpa->fixedSzb);
391 return (ddpa->curpool_free - ddpa_align(ddpa, ddpa->curpool))
392 / VG_ROUNDUP(ddpa->fixedSzb, ddpa->eltAlign);
