ArenaAllocator allocator(&pool);
HGraph* graph = new (&allocator) HGraph(&allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
graph->AddBlock(entry);
ArenaAllocator allocator(&pool);
HGraph* graph = new (&allocator) HGraph(&allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
graph->AddBlock(entry);
ArenaAllocator allocator(&pool);
HGraph* graph = new (&allocator) HGraph(&allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
graph->AddBlock(entry);
ArenaAllocator allocator(&pool);
HGraph* graph = new (&allocator) HGraph(&allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
graph->AddBlock(entry);
int increment,
IfCondition cond = kCondGE) {
HGraph* graph = new (allocator) HGraph(allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (allocator) HBasicBlock(graph);
graph->AddBlock(entry);
int increment = -1,
IfCondition cond = kCondLE) {
HGraph* graph = new (allocator) HGraph(allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (allocator) HBasicBlock(graph);
graph->AddBlock(entry);
int increment,
IfCondition cond) {
HGraph* graph = new (allocator) HGraph(allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (allocator) HBasicBlock(graph);
graph->AddBlock(entry);
int initial,
IfCondition cond = kCondGE) {
HGraph* graph = new (allocator) HGraph(allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (allocator) HBasicBlock(graph);
graph->AddBlock(entry);
ArenaAllocator allocator(&pool);
HGraph* graph = new (&allocator) HGraph(&allocator);
+ graph->SetHasArrayAccesses(true);
HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
graph->AddBlock(entry);