| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 50 /* 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);
|
| /dalvik/vm/compiler/ |
| CompilerIR.h | 160 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::__anon869
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.
|
| /external/ceres-solver/internal/ceres/ |
| compressed_row_jacobian_writer.cc | 101 << "Duplicate parameter blocks detected in a cost function. "
111 // Iterate over parameter blocks in the order which they occur in the
170 // It is necessary to determine the order of the jacobian blocks before
172 // function uses parameter blocks 1 after 2 in its arguments does not mean
174 // jacobian. Thus, determine the order by sorting the jacobian blocks by their
190 // Iterate over the jacobian blocks in increasing order of their
|
| block_evaluate_preparer.cc | 49 // Point the jacobian blocks directly into the block sparse matrix.
73 // that creates the layout strips out any blocks for inactive
|
| block_evaluate_preparer.h | 31 // A evaluate preparer which puts jacobian the evaluated jacobian blocks
57 // Point the jacobian blocks directly into the block sparse matrix, if
|
| detect_structure.h | 39 // Detect static blocks in the problem sparsity. For rows containing
41 // blocks, e_blocks and the f_blocks remain constant. If they do, then
|
| linear_least_squares_problems.h | 55 // blocks are e_type blocks.
|
| schur_complement_solver.cc | 106 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0);
110 blocks[j] = bs->cols[i].size;
113 set_lhs(new BlockRandomAccessDenseMatrix(blocks));
125 // The case where there are no f blocks, and the system is block
174 // Determine the non-zero blocks in the Schur Complement matrix, and
208 // Iterate over the blocks in the row, ignoring the first
273 // The case where there are no f blocks, and the system is block
347 // The case where there are no f blocks, and the system is block
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| Dominators.java | 50 /* 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);
|
| /external/e2fsprogs/misc/ |
| util.c | 240 "1024 and 10240000 filesystem blocks.\n\n"), stderr);
248 * Determine the number of journal blocks to use, either via
252 * Find a reasonable journal file size (in blocks) given the number of blocks
270 "size is %d blocks; it must be\n"
271 "between 1024 and 10240000 blocks. "
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 39 /// of PhysReg in all basic blocks.
89 /// Blocks - Interference for each block in the function.
90 SmallVector<BlockInterference, 8> Blocks;
92 /// update - Recompute Blocks[MBBNum]
125 if (Blocks[MBBNum].Tag != Tag)
127 return &Blocks[MBBNum];
|
| /external/webrtc/src/common_audio/signal_processing/ |
| resample_fractional.c | 42 // K: number of blocks
51 // process in sub blocks of size 3 samples.
88 // K: number of blocks
97 // process in sub blocks of size 4 samples.
197 // K: number of blocks
206 // process in sub blocks of size 11 samples.
|
| /device/asus/deb/original-kernel-headers/media/ |
| msmb_pproc.h | 34 * pad internally like other blocks, also needed for rotation
35 * rotation expects all the blocks in the stripe to be the same size
|
| /device/asus/flo/original-kernel-headers/media/ |
| msmb_pproc.h | 34 * pad internally like other blocks, also needed for rotation
35 * rotation expects all the blocks in the stripe to be the same size
|
| /external/chromium/chrome/browser/search_engines/ |
| template_url_model_test_util.h | 50 // Blocks the caller until the service has finished servicing all pending
54 // Blocks the caller until the I/O thread has finished servicing all pending
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| tabpose_window.h | 38 // active tab. The window blocks clicks on the tab strip and the download
90 // The window blocks all keyboard and mouse events and releases itself when
|
| /external/chromium_org/chrome/browser/ui/cocoa/ |
| tabpose_window.h | 37 // active tab. The window blocks clicks on the tab strip and the download
89 // The window blocks all keyboard and mouse events and releases itself when
|
| /external/chromium_org/media/audio/pulse/ |
| pulse_output.h | 15 // WARNING: This object blocks on internal PulseAudio calls in Open() while
16 // waiting for PulseAudio's context structure to be ready. It also blocks in
|
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| instruction.h | 45 // Once we have computed basic blocks, these pointers will be entered as
54 // computed basic blocks.
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| 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/opus/src/celt/ |
| vq.h | 47 * @ret A mask indicating which blocks in the band received pulses
61 * @ret A mask indicating which blocks in the band received pulses
|
| /external/chromium_org/third_party/re2/re2/ |
| unicode_casefold.h | 26 // In addition to blocks that map to each other (A-Z mapping to a-z)
27 // there are blocks of pairs that individually map to each other
|
| /external/chromium_org/v8/src/ |
| hydrogen-sce.cc | 39 for (int i = 0; i < graph()->blocks()->length(); i++) {
40 HBasicBlock* block = graph()->blocks()->at(i);
|
| /external/clang/test/Analysis/ |
| misc-ps-region-store.mm | 1 // RUN: %clang_cc1 -triple i386-apple-darwin9 -analyze -analyzer-checker=core,alpha.core -analyzer-store=region -verify -fblocks -analyzer-opt-analyze-nested-blocks %s
2 // RUN: %clang_cc1 -triple x86_64-apple-darwin9 -analyze -analyzer-checker=core,alpha.core -analyzer-store=region -verify -fblocks -analyzer-opt-analyze-nested-blocks %s
|
| /external/dropbear/libtomcrypt/src/mac/f9/ |
| f9_memory_multi.c | 16 f9 support, process multiple blocks of memory, Tom St Denis
22 f9 multiple blocks of memory
|
