| /dalvik/dx/src/com/android/dx/cf/code/ |
| ByteBlock.java | 36 /** {@code non-null;} list of successors that this block may branch to */
37 private final IntList successors; field in class:ByteBlock
50 * @param successors {@code non-null;} list of successors that this block may
55 public ByteBlock(int label, int start, int end, IntList successors,
69 if (successors == null) {
73 int sz = successors.size();
75 if (successors.get(i) < 0) {
76 throw new IllegalArgumentException("successors[" + i +
78 successors.get(i))
[all...] |
| Ropper.java | 186 * Generates a list of subroutine successors. Note: successor blocks
189 * before we leave the ropper. Redundent successors will result in
192 * @return all currently known successors
196 IntList successors = new IntList(callerBlocks.size()); local
207 successors.add(subCaller.getSuccessors().get(0));
210 successors.setImmutable();
212 return successors;
216 * Merges the specified frame into this subroutine's successors,
518 * successors of this block which are out of the range of
533 * any successors
575 IntList successors = block.getSuccessors(); local
697 IntList successors = block.getSuccessors(); local
1229 IntList successors = bb.getSuccessors(); local
1443 IntList successors; local
1650 IntList successors = next.getSuccessors(); local
[all...] |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlock.java | 35 * {@code non-null;} full list of successors that this block may
38 private final IntList successors; field in class:BasicBlock
42 * {@code -1} if this block has no successors (that is, it
52 * @param successors {@code non-null;} full list of successors that this
56 * successors (that is, it exits the function/method or is an
59 public BasicBlock(int label, InsnList insns, IntList successors,
94 successors.throwIfMutable();
97 throw new NullPointerException("successors == null");
104 if (primarySuccessor >= 0 && !successors.contains(primarySuccessor))
[all...] |
| LocalVariableExtractor.java | 177 IntList successors = block.getSuccessors(); local
178 int succSz = successors.size();
182 int succ = successors.get(i);
|
| RopMethod.java | 158 * For each block, find its successors, and add the block's label to
164 IntList successors = one.getSuccessors(); local
165 int ssz = successors.size();
171 int succLabel = successors.get(j);
|
| BasicBlockList.java | 224 * the preferred successor. If the block has no successors, then
232 IntList successors = block.getSuccessors(); local
233 int succSize = successors.size();
240 return labelToBlock(successors.get(0));
247 return labelToBlock(successors.get(0));
257 * @return {@code true} if the two blocks' non-primary successors
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaBasicBlock.java | 58 private BitSet successors; field in class:SsaBasicBlock
129 this.successors = new BitSet(parent.getBlocks().size());
162 result.successors
348 * @return {@code non-null;} successors set, indexed by block index
351 return successors;
421 newPred.successors.set(index) ;
456 if (!successors.get(other.index)) {
463 newSucc.successors.set(other.index) ;
477 successors.clear(other.index);
478 successors.set(newSucc.index)
[all...] |
| LocalVariableExtractor.java | 110 // The exit block has no insns and no successors
194 IntList successors = block.getSuccessorList(); local
195 int succSz = successors.size();
199 int succ = successors.get(i);
|
| SsaConverter.java | 142 * successors and multiple predecessors.
168 * Any block with that has both multiple successors and multiple
242 // Successors list is modified in loop below.
243 BitSet successors = (BitSet)block.getSuccessors().clone(); local
244 for (int j = successors.nextSetBit(0);
245 j >= 0; j = successors.nextSetBit(j+1)) {
|
| SsaRenamer.java | 654 BitSet successors = block.getSuccessors(); local
655 for (int i = successors.nextSetBit(0); i >= 0;
656 i = successors.nextSetBit(i + 1)) {
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 138 IntList successors = bb.getSuccessors(); local
140 if (successors.size() == 0) {
142 } else if (successors.size() == 1) {
144 + Hex.u2(successors.get(0)) + ";");
147 for (int j = 0; j < successors.size(); j++ ) {
148 int successor = successors.get(j);
|
| BlockDumper.java | 242 IntList successors = bb.getSuccessors(); local
243 int ssz = successors.size();
248 int succ = successors.get(j);
330 IntList successors = bb.getSuccessors(); local
331 int ssz = successors.size();
337 int succ = successors.get(j);
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| StdCatchBuilder.java | 218 IntList successors = block.getSuccessors(); local
219 int succSize = successors.size();
231 || (primary != successors.get(catchSize))))) {
234 * successor -- if any -- last in the successors list, but
238 "shouldn't happen: weird successors list");
257 CodeAddress oneHandler = addresses.getStart(successors.get(i));
|
| RopTranslator.java | 324 * (aka default) successor (if any). Keep following successors
379 * unordered successors (hopefully the primary), and so
380 * on, until we run out of unordered successors.
415 IntList successors = one.getSuccessors(); local
416 int ssz = successors.size();
419 int candidate = successors.get(i);
611 IntList successors = block.getSuccessors(); local
613 int succSz = successors.size();
618 * less than the number of successors and that the last
625 (primarySuccessor != successors.get(casesSz)))
[all...] |
| /prebuilt/sdk/tools/lib/ |
| dx.jar | |
| /external/v8/test/mjsunit/ |
| regexp.js | 277 // Check that the back reference has two successors. See
|
| /external/v8/src/ |
| jsregexp.cc | [all...] |
| jsregexp.h | 320 // The successors are a list of sets that contain the same values
323 ZoneList<OutSet*>* successors() { return successors_; } function in class:v8::internal::OutSet
378 // successors in a zone and caches them.
[all...] |
