Lines Matching refs:at
102 // Ensure that at least one copy of the last-seen edge was deleted.
649 // Previously I was using only powers-of-2 which peaked at 128 edges.
672 // Previously I was using only powers-of-2 which peaked at 128 edges.
705 // Add a new required input at the end
717 if( in(i) == NULL ) // Find the NULL at end of prec edge list
726 // Add a new required input at the end
744 if( _in[i] == NULL ) // Find the NULL at end of prec edge list
777 // Insert a new required input at the end
888 // duplicates removed and NULLs packed down at the end.
892 // Check for NULL at end
905 // duplicates removed and NULLs packed down at the end.
911 if( !_in[i] ) // Find the NULL at end of prec edge list
947 // Emit bytes starting at parameter 'ptr'.
994 // 'Idealize' the graph rooted at this Node.
1001 // The Ideal call almost arbitrarily reshape the graph rooted at the 'this'
1160 intptr_t ni = (intptr_t)nlist.at(j);
1217 // inside the dead region, just at the borders.
1702 Node* tp = nstack.at(j);
1723 nstack.at(j)->dump();
1727 nstack.at(j)->dump();
2046 Node *n = at(i);