Searched defs:blocks (Results 1 - 13 of 13) sorted by relevance

/dalvik/dexgen/src/com/android/dexgen/rop/code/
H A DLocalVariableExtractor.java31 private final BasicBlockList blocks; field in class:LocalVariableExtractor
36 /** {@code non-null;} work set indicating blocks needing to be processed */
60 BasicBlockList blocks = method.getBlocks();
61 int maxLabel = blocks.getMaxLabel();
64 this.blocks = blocks;
93 BasicBlock block = blocks.labelToBlock(label);
H A DRopMethod.java28 private final BasicBlockList blocks; field in class:RopMethod
41 * the labels for the blocks that return, if calculated
48 * @param blocks {@code non-null;} basic block list of the method
51 public RopMethod(BasicBlockList blocks, int firstLabel) { argument
52 if (blocks == null) {
53 throw new NullPointerException("blocks == null");
60 this.blocks = blocks;
73 return blocks;
130 RopMethod result = new RopMethod(blocks
[all...]
/dalvik/dx/src/com/android/dx/rop/code/
H A DLocalVariableExtractor.java31 private final BasicBlockList blocks; field in class:LocalVariableExtractor
36 /** {@code non-null;} work set indicating blocks needing to be processed */
60 BasicBlockList blocks = method.getBlocks();
61 int maxLabel = blocks.getMaxLabel();
64 this.blocks = blocks;
93 BasicBlock block = blocks.labelToBlock(label);
H A DRopMethod.java27 private final BasicBlockList blocks; field in class:RopMethod
40 * the labels for the blocks that return, if calculated
47 * @param blocks {@code non-null;} basic block list of the method
50 public RopMethod(BasicBlockList blocks, int firstLabel) { argument
51 if (blocks == null) {
52 throw new NullPointerException("blocks == null");
59 this.blocks = blocks;
72 return blocks;
129 RopMethod result = new RopMethod(blocks
[all...]
/dalvik/dx/src/com/android/dx/ssa/
H A DLocalVariableExtractor.java39 private final ArrayList<SsaBasicBlock> blocks; field in class:LocalVariableExtractor
44 /** {@code non-null;} work set indicating blocks needing to be processed */
68 ArrayList<SsaBasicBlock> blocks = method.getBlocks();
71 this.blocks = blocks;
73 this.workSet = new BitSet(blocks.size());
105 SsaBasicBlock block = blocks.get(blockIndex);
H A DDominators.java50 /* Method's basic blocks. */
51 private final ArrayList<SsaBasicBlock> blocks; field in class:Dominators
73 this.blocks = meth.getBlocks();
74 this.info = new DFSInfo[blocks.size() + 2];
180 * First we perform a DFS numbering of the blocks, by
199 SsaBasicBlock predBlock = blocks.get(j);
H A DSsaMethod.java41 /** basic blocks, indexed by block index */
42 private ArrayList<SsaBasicBlock> blocks; field in class:SsaMethod
131 * @param blocks Rop blocks
135 static BitSet bitSetFromLabelList(BasicBlockList blocks, argument
137 BitSet result = new BitSet(blocks.size());
140 result.set(blocks.indexOfLabel(labelList.get(i)));
150 * @param ropBlocks Rop blocks
170 blocks = new ArrayList<SsaBasicBlock>(sz + 2);
174 blocks
[all...]
/dalvik/dx/src/com/android/dx/ssa/back/
H A DIdenticalBlockCombiner.java27 * Searches for basic blocks that all have the same successor and insns
28 * but different predecessors. These blocks are then combined into a single
29 * block and the now-unused blocks are deleted. These identical blocks
30 * frequently are created when catch blocks are edge-split.
34 private final BasicBlockList blocks; field in class:IdenticalBlockCombiner
44 blocks = ropMethod.getBlocks();
45 newBlocks = blocks.getMutableCopy();
51 * compare blocks with the same hash.
56 int szBlocks = blocks
[all...]
H A DSsaToRop.java131 * Removes all blocks containing only GOTOs from the control flow.
135 * blocks containing the real return or throw statements must be
139 final ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks();
151 SsaBasicBlock pb = blocks.get(i);
166 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks();
168 for (SsaBasicBlock block : blocks) {
169 // Add moves in all the pred blocks for each phi insn.
170 block.forEachPhiInsn(new PhiVisitor(blocks));
180 for (SsaBasicBlock block : blocks) {
190 private final ArrayList<SsaBasicBlock> blocks; field in class:SsaToRop.PhiVisitor
192 PhiVisitor(ArrayList<SsaBasicBlock> blocks) argument
[all...]
/dalvik/vm/compiler/
H A DUtility.cpp58 * See if there are previously allocated arena blocks before the last
89 /* Reclaim all the arena blocks allocated so far */
178 ALOGD("%d blocks in total", cUnit->numBlocks);
247 ALOGD("Compiler arena uses %d blocks (%d bytes each)",
370 void dvmDumpBlockBitVector(const GrowableList *blocks, char *msg, argument
379 (BasicBlock *) dvmGrowableListGetElement(blocks, i);
H A DCompilerIR.h160 const Method *containingMethod; // For blocks from the callee
162 bool needFallThroughBranch; // For blocks ended due to length limit
176 GrowableList blocks; member in struct:BasicBlock::__anon52
181 * The "blocks" field in "successorBlockList" points to an array of
183 * For catch blocks, key is type index for the exception.
184 * For swtich blocks, key is the case value.
/dalvik/dx/src/com/android/dx/cf/code/
H A DRopper.java50 * blocks.
87 private final ByteBlockList blocks; field in class:Ropper
142 /** list of all blocks that jsr to this subroutine */
144 /** List of all blocks that return from this subroutine */
165 * @param retBlock one of the ret blocks (final blocks) of this
181 * Adds a label to the list of ret blocks (final blocks) for this
191 * Adds a label to the list of caller blocks for this subroutine.
200 * Generates a list of subroutine successors. Note: successor blocks
[all...]
/dalvik/vm/alloc/
H A DCopying.cpp57 * The block queue exists to thread lists of blocks from the various
68 * more contiguous blocks. Objects that are small enough to fit
71 * blocks. When half the available blocks are filled, a garbage
78 * scheme; blocks containing such objects are grayed (promoted) at the
153 * We use 512-byte blocks.
183 /* Total number of blocks available for allocation. */
194 * Base and limit blocks. Basically the shifted start address of
195 * the block. We convert blocks to a relative number when
294 * blocks
296 allocateBlocks(HeapSource *heapSource, size_t blocks) argument
587 size_t aligned, available, blocks; local
[all...]

Completed in 262 milliseconds