| /prebuilts/ndk/9/platforms/android-9/arch-x86/usr/include/linux/mmc/ |
| mmc.h | 69 unsigned int blocks; member in struct:mmc_data
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | 143 // LoopBlocks contains all of the basic blocks of the loop, including the
144 // preheader of the loop, the body of the loop, and the exit blocks of the
147 // NewBlocks contained cloned copy of basic blocks from LoopBlocks.
197 /// Split all of the edges from inside the loop to their exit blocks.
239 // expansion, and the number of basic blocks, to avoid loops with
433 // Loop over all of the basic blocks in the loop. If we find an interior
662 /// mapping the blocks with the specified map.
668 // Add all of the blocks in L to the new loop.
717 << " blocks] in Function " << L->getHeader()->getParent()->getName()
754 /// blocks. Update the appropriate Phi nodes as we do so
[all...] |
| /art/compiler/dex/ |
| ssa_transformation.cc | 46 GrowableArray<SuccessorBlockInfo*>::Iterator iterator(bb->successor_block_list.blocks);
87 /* Sort the blocks by the Depth-First-Search */
211 * blocks.
230 GrowableArray<SuccessorBlockInfo*>::Iterator iterator(bb->successor_block_list.blocks);
455 * Iterate through all successor blocks and propagate up the live-in sets.
473 GrowableArray<SuccessorBlockInfo*>::Iterator iterator(bb->successor_block_list.blocks);
519 /* Calculate the phi blocks for each Dalvik register */
543 * Iterate through the original blocks plus the new ones in
579 * predecessor blocks
658 GrowableArray<SuccessorBlockInfo*>::Iterator iterator(block->successor_block_list.blocks);
[all...] |
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 132 BasicBlockList blocks = rmeth.getBlocks(); local
134 int sz = blocks.size();
136 BasicBlock bb = blocks.get(i);
|
| SsaDumper.java | 41 * Dumper for the SSA-translated blocks of a method.
123 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
125 (ArrayList<SsaBasicBlock>) blocks.clone();
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| package-info.java | 45 * semantics are quite similar to basic blocks in
82 * <li> The Rop-form method, its blocks and their instructions are directly
86 * split} and new basic blocks inserted as required to meet the constraints
|
| /external/bluetooth/bluedroid/stack/avct/ |
| avct_int.h | 132 tAVCT_LCB lcb[AVCT_NUM_LINKS]; /* link control blocks */
133 tAVCT_BCB bcb[AVCT_NUM_LINKS]; /* browse control blocks */
134 tAVCT_CCB ccb[AVCT_NUM_CONN]; /* connection control blocks */
|
| /external/ceres-solver/internal/ceres/ |
| covariance_impl.cc | 123 // If either of the two parameter blocks is constant, then the
210 // blocks 1 and 2. J_1 and J_2 are respectively the local to global
211 // jacobians for parameter blocks 1 and 2.
260 // parameter blocks by their pointers.
282 // ordering of parameter blocks just constructed.
294 // the way flip any covariance blocks which are in the lower
322 VLOG(2) << "No non-zero covariance blocks found";
328 // blocks as they will occur in the CompressedRowSparseMatrix that
339 // Iterate over parameter blocks and in turn over the rows of the
342 // blocks requested by the user. If this is the case then fill out
[all...] |
| detect_structure.cc | 48 // Iterate over row blocks of the matrix, checking if row_block,
52 // We do not care about the sizes of the blocks in rows which do
106 CHECK_NE(*e_block_size, 0) << "No e type blocks found";
|
| implicit_schur_complement_test.cc | 77 vector<int> blocks(num_col_blocks - num_eliminate_blocks_, 0);
79 blocks[i - num_eliminate_blocks_] = bs->cols[i].size;
82 BlockRandomAccessDenseMatrix blhs(blocks);
|
| preconditioner.h | 65 // Hints about the order in which the parameter blocks should be
70 // parameter blocks 0 ... elimination_groups[0] - 1 first, and
73 // choose how the parameter blocks are ordered. Different linear
|
| /external/checkpolicy/ |
| module_compiler.h | 51 /* Functions called from REQUIRE blocks. Add the first symbol on the
95 /* ELSE blocks are similar to normal blocks with the following two
|
| /external/chromium_org/chrome/browser/notifications/sync_notifier/ |
| notification_bitmap_fetcher_browsertest.cc | 122 // Blocks until test delegate is notified via a callback.
173 // Blocks until test delegate is notified via a callback.
197 // Blocks until test delegate is notified via a callback.
|
| /external/chromium_org/sandbox/win/src/ |
| sharedmem_ipc_client.h | 14 // The shared memory is divided on blocks called channels, and potentially
34 // 4) client signals the ping event and waits (blocks) on the pong event
106 // blocks until there is a free channel
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| FastTextAutosizer.cpp | 126 const WTF::HashSet<const RenderBlock*>& blocks = cluster->m_blocks; local
129 for (WTF::HashSet<const RenderBlock*>::iterator it = blocks.begin(); it != blocks.end(); ++it)
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| block.cc | 5 // Decodes the blocks generated by block_builder.cc.
184 // blocks before "mid" are uninteresting.
187 // Key at "mid" is >= "target". Therefore all blocks at or
|
| /external/chromium_org/third_party/libxml/src/ |
| SAX.c | 39 * DEPRECATED: use xmlSAX2InitDefaultSAXHandler() for the new SAX2 blocks
88 * DEPRECATED: use xmlSAX2InitHtmlDefaultSAXHandler() for the new SAX2 blocks
135 * DEPRECATED: use xmlSAX2InitDocbDefaultSAXHandler() for the new SAX2 blocks
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_fs_cfg.cpp | 34 * blocks with successor/predecessor edges connecting them.
242 blocks = ralloc_array(mem_ctx, fs_bblock *, num_blocks);
247 blocks[i++] = link->block;
|
| /external/e2fsprogs/lib/ext2fs/ |
| res_gdt.c | 2 * res_gdt.c --- reserve blocks for growing the group descriptor table
56 * This code assumes that the reserved blocks have already been marked in-use
84 /* Maximum possible file size (we donly use the dindirect blocks) */
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| Monitor.java | 291 * Enters this monitor. Blocks indefinitely.
298 * Enters this monitor. Blocks indefinitely, but may be interrupted.
305 * Enters this monitor. Blocks at most the given time.
335 * Enters this monitor. Blocks at most the given time, and may be interrupted.
355 * Enters this monitor when the guard is satisfied. Blocks indefinitely, but may be interrupted.
376 * Enters this monitor when the guard is satisfied. Blocks indefinitely.
397 * Enters this monitor when the guard is satisfied. Blocks at most the given time, including both
431 * Enters this monitor when the guard is satisfied. Blocks at most the given time, including
482 * Enters this monitor if the guard is satisfied. Blocks indefinitely acquiring the lock, but
505 * Enters this monitor if the guard is satisfied. Blocks indefinitely acquiring the lock, but doe
[all...] |
| /external/libxml2/ |
| SAX.c | 39 * DEPRECATED: use xmlSAX2InitDefaultSAXHandler() for the new SAX2 blocks
88 * DEPRECATED: use xmlSAX2InitHtmlDefaultSAXHandler() for the new SAX2 blocks
135 * DEPRECATED: use xmlSAX2InitDocbDefaultSAXHandler() for the new SAX2 blocks
|
| /external/llvm/include/llvm/Analysis/ |
| ProfileDataLoader.h | 39 /// An edge is defined by its source and sink basic blocks.
44 // blocks.
50 /// \brief Count the number of times a transition between two blocks is
|
| Trace.h | 10 // This class represents a single trace of LLVM basic blocks. A trace is a
35 /// Trace ctor - Make a new trace from a vector of basic blocks,
77 /// block as B2.. Both blocks must be in the trace.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| EdgeProfiling.cpp | 69 // Keep track of which blocks need to be instrumented. We don't want to
70 // instrument blocks that are added as the result of breaking critical
90 if (BlocksToInstrument.count(BB)) { // Don't instrument inserted blocks
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_cfg.cpp | 34 * blocks with successor/predecessor edges connecting them.
242 blocks = ralloc_array(mem_ctx, fs_bblock *, num_blocks);
247 blocks[i++] = link->block;
|
