Lines Matching defs:that
130 bblock_t::can_combine_with(const bblock_t *that) const
132 if ((const bblock_t *)this->link.next != that)
136 starts_block(that->start()))
143 bblock_t::combine_with(bblock_t *that)
145 assert(this->can_combine_with(that));
146 foreach_list_typed (bblock_link, link, link, &that->parents) {
150 this->end_ip = that->end_ip;
151 this->instructions.append_list(&that->instructions);
153 this->cfg->remove_block(that);
298 * This guarantees that there is a control-flow path from any
300 * (immediately past the WHILE instruction) such that it overlaps the
306 * This way we make sure that any variables that are live throughout
355 * point that overlaps the whole IP range of the loop and skips over
539 * The authors claim that for control flow graphs of sizes normally encountered
540 * (less than 1000 nodes) that this algorithm is significantly faster than