Lines Matching refs:loop
13 * It is used to check if, inside one loop, all execution paths contain
15 * The reason is that if there is a path that stays in the loop without
16 * executing a check then the check cannot be hoisted out of the loop (it
18 * We also check is there are paths that exit the loop early, and if yes we
43 * Initializes the table element for a given loop (identified by its
48 HLoopInformation* loop = data->phi()->block()->current_loop();
49 is_start_ = (block() == loop->loop_header());
51 is_in_loop_ = loop->IsNestedInThisLoop(block()->current_loop());
93 * Initializes the table for a given loop (identified by its induction
112 * induction variable out of the loop.
113 * The problem is that in the loop code graph there could be execution paths
115 * semantics as performing it at every loop iteration, which could cause
118 * (loop back to the header) without meeting a check, or UNSAFE is set if
132 // We found a check or we reached a dominated block out of the loop,
141 // We found a path that exits the loop early, and is not the exit
149 // We found a path that does one loop iteration without meeting any
188 // Tries to hoist a check out of its induction loop.
197 // Check that the limit is defined in the loop preheader.
211 // Check that the length is defined in the loop preheader.
