/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | SsaConverter.java | 147 ArrayList<SsaBasicBlock> blocks = result.getBlocks(); 150 * New blocks are added to the end of the block list during 153 for (int i = blocks.size() - 1; i >= 0; i-- ) { 154 SsaBasicBlock block = blocks.get(i); 188 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); 191 * New blocks are added to the end of the block list during 194 for (int i = blocks.size() - 1; i >= 0; i-- ) { 195 SsaBasicBlock block = blocks.get(i); 209 SsaBasicBlock predecessor = blocks.get(j); 233 ArrayList<SsaBasicBlock> blocks [all...] |
H A D | LocalVariableExtractor.java | 40 private final ArrayList<SsaBasicBlock> blocks; field in class:LocalVariableExtractor 45 /** {@code non-null;} work set indicating blocks needing to be processed */ 69 ArrayList<SsaBasicBlock> blocks = method.getBlocks(); 72 this.blocks = blocks; 74 this.workSet = new BitSet(blocks.size()); 106 SsaBasicBlock block = blocks.get(blockIndex);
|
H A D | SsaMethod.java | 42 /** basic blocks, indexed by block index */ 43 private ArrayList<SsaBasicBlock> blocks; field in class:SsaMethod 132 * @param blocks Rop blocks 136 static BitSet bitSetFromLabelList(BasicBlockList blocks, argument 138 BitSet result = new BitSet(blocks.size()); 141 result.set(blocks.indexOfLabel(labelList.get(i))); 151 * @param ropBlocks Rop blocks 171 blocks = new ArrayList<SsaBasicBlock>(sz + 2); 175 blocks [all...] |
/external/chromium_org/v8/src/ |
H A D | handles.cc | 15 int n = impl->blocks()->length(); 18 (isolate->handle_scope_data()->next - impl->blocks()->last())); 38 if (!impl->blocks()->is_empty()) { 39 Object** limit = &impl->blocks()->last()[kHandleBlockSize]; 51 // Add the extension to the global list of blocks, but count the 53 impl->blocks()->Add(result); 98 DCHECK(data->limit == &impl_->blocks()->last()[kHandleBlockSize]); 99 impl_->blocks()->Add(new_next);
|
H A D | hydrogen-flow-engine.h | 52 // over a graph of basic blocks, either one block at a time (local analysis) 74 pred_counts_(graph->blocks()->length(), zone), 76 block_states_(graph->blocks()->length(), zone), 77 loop_effects_(graph->blocks()->length(), zone) { 78 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone); 90 // Global analysis. Iterates over all blocks that are dominated by the given 96 // Iterate all dominated blocks starting from the given start block. 97 for (int i = root->block_id(); i < graph_->blocks()->length(); i++) { 98 HBasicBlock* block = graph_->blocks()->at(i); 100 // Skip blocks no [all...] |
/external/chromium_org/third_party/smhasher/src/ |
H A D | KeysetTest.h | 25 // Keyset 'Combination' - all possible combinations of input blocks 29 uint32_t * blocks, int blockcount, 36 key[len] = blocks[i]; 47 CombinationKeygenRecurse(key,len+1,maxlen,blocks,blockcount,hash,hashes); 53 bool CombinationKeyTest ( hashfunc<hashtype> hash, int maxlen, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument 55 printf("Keyset 'Combination' - up to %d blocks from a set of %d - ",maxlen,blockcount); 63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashes); 81 // Keyset 'Permutation' - given a set of 32-bit blocks, generate keys 82 // consisting of all possible permutations of those blocks 85 void PermutationKeygenRecurse ( pfHash hash, uint32_t * blocks, in argument 28 CombinationKeygenRecurse( uint32_t * key, int len, int maxlen, uint32_t * blocks, int blockcount, pfHash hash, std::vector<hashtype> & hashes ) argument 109 PermutationKeyTest( hashfunc<hashtype> hash, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument [all...] |
H A D | main.cpp | 315 // Keyset 'Permutation' - all possible combinations of a set of blocks 327 uint32_t blocks[] = local 334 result &= CombinationKeyTest<hashtype>(hash,8,blocks,sizeof(blocks) / sizeof(uint32_t),true,true,drawDiagram); 346 uint32_t blocks[] = local 353 result &= CombinationKeyTest<hashtype>(hash,8,blocks,sizeof(blocks) / sizeof(uint32_t),true,true,drawDiagram); 365 uint32_t blocks[] = local 372 result &= CombinationKeyTest<hashtype>(hash,20,blocks,sizeof(blocks) / sizeo 384 uint32_t blocks[] = local 403 uint32_t blocks[] = local [all...] |
/external/chromium_org/v8/test/cctest/ |
H A D | test-alloc.cc | 171 // Tests memory management in a CodeRange by allocating and freeing blocks, 204 List< ::Block> blocks(1000); 221 blocks.Add(::Block(base, static_cast<int>(allocated))); 226 int index = Pseudorandom() % blocks.length(); 227 code_range.FreeRawMemory(blocks[index].base, blocks[index].size); 228 current_allocated -= blocks[index].size; 229 if (index < blocks.length() - 1) { 230 blocks[index] = blocks [all...] |
/external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
H A D | SsaToRop.java | 132 * Removes all blocks containing only GOTOs from the control flow. 136 * blocks containing the real return or throw statements must be 140 final ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); 152 SsaBasicBlock pb = blocks.get(i); 167 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); 169 for (SsaBasicBlock block : blocks) { 170 // Add moves in all the pred blocks for each phi insn. 171 block.forEachPhiInsn(new PhiVisitor(blocks)); 181 for (SsaBasicBlock block : blocks) { 191 private final ArrayList<SsaBasicBlock> blocks; field in class:SsaToRop.PhiVisitor 193 PhiVisitor(ArrayList<SsaBasicBlock> blocks) argument [all...] |
/external/chromium_org/third_party/markdown/ |
H A D | blockprocessors.py | 37 This parser handles basic parsing of Markdown blocks. It doesn't concern itself 39 blocks, lists, quotes, etc. 43 as they need to alter how markdown blocks are parsed. 136 def run(self, parent, blocks): 151 the list of blocks. 156 * ``blocks``: A list of all remaining blocks of the document. 188 def run(self, parent, blocks): 189 block = blocks.pop(0) 258 """ Process code blocks [all...] |
/external/valgrind/main/memcheck/tests/ |
H A D | leak-cases-possible.stderr.exp | 5 16 bytes in 1 blocks are definitely lost in loss record ... of ... 11 32 (16 direct, 16 indirect) bytes in 1 blocks are definitely lost in loss record ... of ... 17 32 (16 direct, 16 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
|
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
H A D | codegen.h | 96 // Basic blocks are defined as sequences of instructions whose only branch 109 // Cuts the DAG of instructions into basic blocks. 112 TargetsToBlocks* blocks); 114 // Find common tail sequences of basic blocks and coalesce them. 115 void MergeTails(TargetsToBlocks* blocks); 122 // Topologically sort the basic blocks so that all jumps are forward jumps. 125 const TargetsToBlocks& blocks, 134 // Concatenate instructions from all basic blocks into a BPF program that 138 // We stick all instructions and basic blocks into pools that get destroyed
|
/external/chromium_org/third_party/markdown/extensions/ |
H A D | admonition.py | 107 def run(self, parent, blocks): 109 block = blocks.pop(0) 132 # line. Insert these lines as the first block of the master blocks 134 blocks.insert(0, theRest)
|
H A D | def_list.py | 70 def run(self, parent, blocks): 72 raw_block = blocks.pop(0) 89 blocks.insert(0, raw_block) 120 blocks.insert(0, theRest)
|
/external/jemalloc/src/ |
H A D | tsd.c | 119 ql_foreach(iter, &head->blocks, link) { 128 ql_tail_insert(&head->blocks, block, link); 138 ql_remove(&head->blocks, block, link);
|
/external/lzma/C/ |
H A D | Xz.c | 28 p->blocks = 0;
34 alloc->Free(alloc, p->blocks);
36 p->blocks = 0;
|
/external/ceres-solver/internal/ceres/ |
H A D | block_random_access_dense_matrix.h | 57 // blocks is a vector of block sizes. The resulting matrix has 58 // blocks.size() * blocks.size() cells. 59 explicit BlockRandomAccessDenseMatrix(const vector<int>& blocks);
|
H A D | block_random_access_diagonal_matrix.cc | 48 const vector<int>& blocks) 49 : blocks_(blocks) { 85 // Assume that the user does not hold any locks on any cell blocks 110 // Assume that the user does not hold any locks on any cell blocks 47 BlockRandomAccessDiagonalMatrix( const vector<int>& blocks) argument
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.h | 30 * cost of being unable to explicitly free one of the allocated blocks. 41 struct memory_block * blocks; member in struct:memory_pool
|
/external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
H A D | LocalVariableInfo.java | 60 BasicBlockList blocks = method.getBlocks(); 61 int maxLabel = blocks.getMaxLabel(); 63 this.regCount = blocks.getRegCount(); 67 new HashMap<Insn, RegisterSpec>(blocks.getInstructionCount());
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.h | 30 * cost of being unable to explicitly free one of the allocated blocks. 41 struct memory_block * blocks; member in struct:memory_pool
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/xvmc/tests/ |
H A D | test_rendering.c | 149 short *blocks; local 189 blocks = block_array.blocks; 220 blocks, 227 blocks += BLOCK_SIZE; 237 blocks, 244 blocks += BLOCK_SIZE; 248 blocks, 255 blocks += BLOCK_SIZE;
|
/external/mesa3d/src/gallium/state_trackers/xvmc/tests/ |
H A D | test_rendering.c | 149 short *blocks; local 189 blocks = block_array.blocks; 220 blocks, 227 blocks += BLOCK_SIZE; 237 blocks, 244 blocks += BLOCK_SIZE; 248 blocks, 255 blocks += BLOCK_SIZE;
|
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | BasicBlock.java | 41 public static BasicBlock find(BasicBlock[] blocks, int pos) argument 44 for (int i = 0; i < blocks.length; i++) { 45 int iPos = blocks[i].position; 46 if (iPos <= pos && pos < iPos + blocks[i].length) 47 return blocks[i]; 312 ArrayList blocks = new ArrayList(); 320 blocks.add(prev); 329 blocks.add(prev); 355 blocks.add(bb); 360 return (BasicBlock[])blocks 374 addCatchers(BasicBlock[] blocks, ExceptionTable et) argument [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
H A D | malloc_extension_c_test.c | 98 int blocks; local 106 MallocExtension_MallocMemoryStats(&blocks, &total, hist);
|