Lines Matching refs:graph
105 HGraph* graph() const { return graph_; } in graph() function in v8::internal::BASE_EMBEDDED
106 Counters* counters() const { return graph()->isolate()->counters(); } in counters()
120 for (int i = 0; i < graph()->blocks()->length(); i++) { in InitializeLoop()
200 explicit InductionVariableBlocksTable(HGraph* graph) in InductionVariableBlocksTable() argument
201 : graph_(graph), loop_header_(NULL), in InductionVariableBlocksTable()
202 elements_(graph->blocks()->length(), graph->zone()) { in InductionVariableBlocksTable()
203 for (int i = 0; i < graph->blocks()->length(); i++) { in InductionVariableBlocksTable()
205 element.set_block(graph->blocks()->at(i)); in InductionVariableBlocksTable()
206 elements_.Add(element, graph->zone()); in InductionVariableBlocksTable()
254 !graph()->use_optimistic_licm())) { in ProcessRelatedChecks()
276 Zone* zone = graph()->zone(); in ProcessRelatedChecks()
277 HValue* context = graph()->GetInvalidContext(); in ProcessRelatedChecks()
395 InductionVariableBlocksTable table(graph()); in HoistRedundantBoundsChecks()
396 table.CollectInductionVariableData(graph()->entry_block()); in HoistRedundantBoundsChecks()
397 for (int i = 0; i < graph()->blocks()->length(); i++) { in HoistRedundantBoundsChecks()
398 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i)); in HoistRedundantBoundsChecks()