Cross Reference: /art/compiler/optimizing/nodes.cc

Lines Matching refs:size
50   block->SetBlockId(blocks_.size());
62       &allocator, blocks_.size(), /* expandable */ false, kArenaAllocGraphBuilder);
65   ScopedArenaVector<size_t> successors_visited(blocks_.size(),
79     if (successors_visited[current_id] == current->GetSuccessors().size()) {
145   for (size_t i = 0; i < blocks_.size(); ++i) {
158   for (size_t i = 0; i < blocks_.size(); ++i) {
183   ArenaBitVector visited(&allocator, blocks_.size(), false, kArenaAllocGraphBuilder);
266   reverse_post_order_.reserve(blocks_.size());
272   ScopedArenaVector<size_t> visits(blocks_.size(), 0u, allocator.Adapter(kArenaAllocGraphBuilder));
274   ScopedArenaVector<size_t> successors_visited(blocks_.size(),
286     if (successors_visited[current_id] == current->GetSuccessors().size()) {
295           successor->GetPredecessors().size() - successor->NumberOfBackEdges()) {
388     for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) {
405   for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) {
460   for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) {
518   size_t number_of_incomings = header->GetPredecessors().size() - info->NumberOfBackEdges();
563   // can be invalidated. We remember the initial size to avoid iterating over the new blocks.
564   for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) {
567     if (block->GetSuccessors().size() > 1) {
572       for (size_t j = 0, e = normal_successors.size(); j < e; ++j) {
579         } else if (successor->GetPredecessors().size() > 1) {
585           DCHECK_EQ(e, normal_successors.size());
827                            graph->GetBlocks().size(),
951   for (size_t i = 0; i < inputs.size(); ++i) {
1076   for (size_t i = 0; i < locals.size(); i++) {
1315   input->AddUseAt(this, inputs_.size() - 1);
1322   for (size_t i = index + 1u, e = inputs_.size(); i < e; ++i) {
1332   for (size_t i = index, e = inputs_.size(); i < e; ++i) {
1689   if (inputs.size() != other_inputs.size()) return false;
1690   for (size_t i = 0; i != inputs.size(); ++i) {
1991   size_t length = handlers1.size();
1992   if (length != handlers2.size()) {
2006   size_t size = 0;
2009     size++;
2011   return size;
2115       if (successor->predecessors_.size() == 1u) {
2162       while (predecessor->GetSuccessors().size() > 1) {
2171     uint32_t num_pred_successors = predecessor->GetSuccessors().size();
2415   if (GetBlocks().size() == 3) {
2469     size_t blocks_added = (reverse_post_order_.size() - kNumberOfSkippedBlocksInCallee)
2505     for (size_t pred = 0; pred < to->GetPredecessors().size(); ++pred) {