Lines Matching defs:in
5 * you may not use this file except in compliance with the License.
10 * Unless required by applicable law or agreed to in writing, software
27 * See A Fast Algorithm for Finding Dominators in a Flowgraph
30 * This implementation runs in time O(n log n). The time bound
33 * overheads are high enough that the current method is faster in all but the
80 * to avoid calling a large amount of code in the constructor.)
113 * @param in Basic block whose DFS info we are path compressing.
115 private void compress(SsaBasicBlock in) {
116 DFSInfo bbInfo = info[in.getIndex()];
122 worklist.add(in);
203 * PredInfo may not exist in case the predecessor is
216 * Normally we would call link here, but in our O(m log n)
253 * in the {@code info}list.
273 * rep(resentative) is known as "label" in the paper. It is the node