Lines Matching refs:graph
19 * perform the hoisting only if graph()->use_optimistic_licm() is true.
82 HGraph* graph() const { return graph_; }
83 Counters* counters() const { return graph()->isolate()->counters(); }
97 for (int i = 0; i < graph()->blocks()->length(); i++) {
113 * The problem is that in the loop code graph there could be execution paths
177 explicit InductionVariableBlocksTable(HGraph* graph)
178 : graph_(graph), loop_header_(NULL),
179 elements_(graph->blocks()->length(), graph->zone()) {
180 for (int i = 0; i < graph->blocks()->length(); i++) {
182 element.set_block(graph->blocks()->at(i));
183 elements_.Add(element, graph->zone());
231 !graph()->use_optimistic_licm())) {
253 Zone* zone = graph()->zone();
254 HValue* context = graph()->GetInvalidContext();
372 InductionVariableBlocksTable table(graph());
373 table.CollectInductionVariableData(graph()->entry_block());
374 for (int i = 0; i < graph()->blocks()->length(); i++) {
375 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
