272       a_hi = ((Addr)chunks[i]->data) + chunks[i]->szB;  in find_chunk_for_OLD()
300       a_mid_hi = chunks[mid]->data + chunks[mid]->szB;  in find_chunk_for()
307       if (chunks[mid]->szB == 0)  in find_chunk_for()
379          if (mc->szB > 1) {  in find_active_chunks()
380             m = find_chunk_for(mc->data + (mc->szB - 1), mallocs, n_mallocs);  in find_active_chunks()
547          tl_assert(ptr < ch->data + ch->szB + (ch->szB==0  ? 1  : 0));  in lc_is_a_chunk_ptr()
566          VG_(printf)("pushing %#lx-%#lx\n", ch->data, ch->data + ch->szB);  in lc_push()
779          if (3 * sizeof(SizeT) + capacity + 1 == ch->szB  in heuristic_reachedness()
808          if (size > 0 && (ch->szB - sizeof(ULong)) == size) {  in heuristic_reachedness()
834          if (nr_elts > 0 && (ch->szB - sizeof(SizeT)) % nr_elts == 0) {  in heuristic_reachedness()
977                         ch_no, clique, (SizeT)ch->szB, ex->IorC.indirect_szB);  in lc_push_with_clique_if_a_chunk_ptr()
980                         ch_no, clique, (SizeT)ch->szB);  in lc_push_with_clique_if_a_chunk_ptr()
983       lc_extras[clique].IorC.indirect_szB += ch->szB;  in lc_push_with_clique_if_a_chunk_ptr()
1042                Addr searched, SizeT szB)  in lc_scan_memory()  argument
1134             if (addr >= searched && addr < searched + szB) {  in lc_scan_memory()
1187       lc_scan_memory(lc_chunks[top]->data, lc_chunks[top]->szB,  in lc_process_markstack()
1215    SizeT total_szB_a = lr_a->szB + lr_a->indirect_szB;  in cmp_LossRecords()
1216    SizeT total_szB_b = lr_b->szB + lr_b->indirect_szB;  in cmp_LossRecords()
1278          = lr->szB > lr->old_szB  in get_printing_rules()
1283       delta_considered = lr->szB != lr->old_szB  in get_printing_rules()
1353          lr_array[i]->old_szB          = lr_array[i]->szB;  in print_results()
1356          lr_array[i]->szB              = 0;  in print_results()
1376         MC_(bytes_heuristically_reachable)[ex->heuristic] += ch->szB;  in print_results()
1381                        ch->data, (SizeT)ch->szB);  in print_results()
1389          old_lr->szB          += ch->szB;  in print_results()
1398          lr->szB              = ch->szB;  in print_results()
1463          MC_(bytes_suppressed)  += lr->szB;  in print_results()
1467          MC_(bytes_leaked)      += lr->szB;  in print_results()
1471          MC_(bytes_indirect)    += lr->szB;  in print_results()
1475          MC_(bytes_dubious)     += lr->szB;  in print_results()
1479          MC_(bytes_reachable)   += lr->szB;  in print_results()
1593                    (void *)ind_ch->data, (SizeT)ind_ch->szB,  in print_clique()
1599                 (void *)ind_ch->data, (SizeT)ind_ch->szB);  in print_clique()
1675                             (void *)ch->data, (SizeT)ch->szB,  in MC_()
1679                             (void *)ch->data, (SizeT)ch->szB);  in MC_()
1694                       (void *)ch->data, (SizeT)ch->szB);  in MC_()
1705 static void scan_memory_root_set(Addr searched, SizeT szB)  in scan_memory_root_set()  argument
1755                      searched, szB);  in scan_memory_root_set()
1838       Addr end1      = ch1->data + ch1->szB - 1;  in MC_()
1839       Addr end2      = ch2->data + ch2->szB - 1;  in MC_()
1982 void MC_(who_points_at) ( Addr address, SizeT szB)  in MC_()
1988    if (szB == 1)  in MC_()
1992                  szB, address);  in MC_()
1997    scan_memory_root_set(address, szB);  in MC_()
2001       lc_scan_memory(chunks[i]->data, chunks[i]->szB,  in MC_()
2004                      address, szB);  in MC_()
2010    searched_szB = szB;  in MC_()