Lines Matching refs:Reachable
87 // - still reachable: cases 1, 2
122 // Also, --show-reachable is a bad name because it also turns on the showing
173 // are mentioned elsewhere (if --show-reachable=yes or indirect is given
198 // reachable, depending on whether interior-pointers were required to
200 // - At this point we know for every block if it's reachable or not.
230 // prior node is a block which is reachable from the root-set via
233 // reachable from the root-set via a path including at least one
437 // Heuristic with which this block was considered reachable.
438 // LchNone if state != Reachable or no heuristic needed to
439 // consider it reachable.
518 // are considered reachable due to the corresponding heuristic.
750 // If ch is heuristically reachable via an heuristic member of heur_set,
752 // If ch cannot be considered reachable using one of these heuristics,
893 Reachedness ch_via_ptr; // Is ch reachable via ptr, and how ?
898 if (ex->state == Reachable) {
900 // If block was considered reachable via an heuristic, and it is now
901 // directly reachable via ptr, clear the heuristic field.
908 // - Unreached --> Reachable
909 // - Possible --> Reachable
912 ch_via_ptr = Reachable;
918 ch_via_ptr = Reachable;
924 if (ch_via_ptr == Reachable && is_prior_definite) {
927 // definite, which means that this block is definitely reachable.
928 ex->state = Reachable;
930 // State has changed to Reachable so (re)scan the block to make
936 // which means that we can only mark this block as possibly reachable.
970 // Note that, unlike reachable blocks, we currently don't distinguish
1154 VG_(umsg)("block at %#lx considered reachable "
1349 for (int r = Reachable; r <= Unreached; r++)
1404 for (UInt r = Reachable; r <= Unreached; r++)
1409 for (UInt r = Reachable; r <= Unreached; r++)
1414 for (UInt r = Reachable; r <= Unreached; r++)
1426 a loss kind: R = Reachable P = Possibly I = Indirectly D = Definitely
1435 "RB : Reachable Bytes" ","
1447 "RBk : reachable Blocks" ","
1453 "iRB : increase Reachable Bytes" ","
1465 "iRBk : increase reachable Blocks" ","
1472 "dRB : decrease Reachable Bytes" ","
1484 "dRBk : decrease reachable Blocks" ","
1679 } else if (Reachable == lr->key.state) {
1724 VG_(umsg)(" still reachable: %'lu%s bytes in %'lu%s blocks\n",
1733 "reachable via heuristic:\n");
1764 MC_(blocks_reachable) > 0 && !RiS(Reachable,lcp->show_leak_kinds)) {
1765 VG_(umsg)("Reachable blocks (those to which a pointer "
1768 VG_(umsg)("To see them, add 'reachable any' args to leak_check\n");
1893 if (ex->state != Reachable) {
1894 // We can print the clique in all states, except Reachable.
2179 // Process the pushed blocks. After this, every block that is reachable
2193 // the mark stack, and find all the as-yet-Unreached blocks reachable
