Lines Matching refs:graph
42 * perform the hoisting only if graph()->use_optimistic_licm() is true.
105 HGraph* graph() const { return graph_; }
106 Counters* counters() const { return graph()->isolate()->counters(); }
120 for (int i = 0; i < graph()->blocks()->length(); i++) {
136 * The problem is that in the loop code graph there could be execution paths
200 explicit InductionVariableBlocksTable(HGraph* graph)
201 : graph_(graph), loop_header_(NULL),
202 elements_(graph->blocks()->length(), graph->zone()) {
203 for (int i = 0; i < graph->blocks()->length(); i++) {
205 element.set_block(graph->blocks()->at(i));
206 elements_.Add(element, graph->zone());
254 !graph()->use_optimistic_licm())) {
276 Zone* zone = graph()->zone();
277 HValue* context = graph()->GetInvalidContext();
395 InductionVariableBlocksTable table(graph());
396 table.CollectInductionVariableData(graph()->entry_block());
397 for (int i = 0; i < graph()->blocks()->length(); i++) {
398 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
