Lines Matching full:ch_no
501 Int ch_no;
512 ch_no = find_chunk_for(ptr, lc_chunks, lc_n_chunks);
513 tl_assert(ch_no >= -1 && ch_no < lc_n_chunks);
515 if (ch_no == -1) {
520 ch = lc_chunks[ch_no];
521 ex = &(lc_extras[ch_no]);
527 VG_(printf)("ptr=%#lx -> block %d\n", ptr, ch_no);
529 *pch_no = ch_no;
539 static void lc_push(Int ch_no, MC_Chunk* ch)
541 if (!lc_extras[ch_no].pending) {
547 lc_markstack[lc_markstack_top] = ch_no;
548 tl_assert(!lc_extras[ch_no].pending);
549 lc_extras[ch_no].pending = True;
575 Int ch_no;
579 if ( ! lc_is_a_chunk_ptr(ptr, &ch_no, &ch, &ex) )
593 lc_push(ch_no, ch);
602 lc_push(ch_no, ch);
618 Int ch_no;
624 if ( ! lc_is_a_chunk_ptr(ptr, &ch_no, &ch, &ex) )
628 // If ch_no==clique, it's the clique leader, which means this is a cyclic
630 if (ex->state == Unreached && ch_no != clique) {
634 lc_push(ch_no, ch);
643 ch_no, clique, (unsigned long)ch->szB,
647 ch_no, clique, (unsigned long)ch->szB);