| /frameworks/compile/libbcc/bcinfo/BitReader_2_7/ |
| BitcodeReader.h | 159 /// blocks for the function.
184 /// BlockAddrFwdRefs - These are blockaddr references to basic blocks. These
|
| /frameworks/compile/libbcc/bcinfo/BitReader_3_0/ |
| BitcodeReader.h | 159 /// blocks for the function.
184 /// BlockAddrFwdRefs - These are blockaddr references to basic blocks. These
|
| /hardware/broadcom/wlan/bcmdhd/dhdutil/include/ |
| bcm_mpool_pub.h | 16 * instrumentation, such as reporting all blocks
21 * memory pool: An object for allocating homogenous memory blocks.
|
| /libcore/luni/src/main/java/java/io/ |
| PushbackInputStream.java | 126 * Blocks until one byte has been read, the end of the source stream is
153 * are required. Blocks until {@code byteCount} bytes have been read, the end of
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| dumbdbm.py | 177 # by the old value. The blocks used by the old value are
190 # The blocks used by the associated value are lost.
|
| threading.py | 41 # sys.exc_clear is used to work around the fact that except blocks
314 This method releases the underlying lock, and then blocks until it is
416 blocks if necessary until it can return without making the counter
425 method blocks if necessary until it can return without making the counter
508 initial value. The acquire() method blocks if necessary until it can return
543 to false with the clear() method. The wait() method blocks until the flag is
552 with the clear() method. The wait() method blocks until the flag is true.
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| dumbdbm.py | 177 # by the old value. The blocks used by the old value are
190 # The blocks used by the associated value are lost.
|
| threading.py | 41 # sys.exc_clear is used to work around the fact that except blocks
314 This method releases the underlying lock, and then blocks until it is
416 blocks if necessary until it can return without making the counter
425 method blocks if necessary until it can return without making the counter
508 initial value. The acquire() method blocks if necessary until it can return
543 to false with the clear() method. The wait() method blocks until the flag is
552 with the clear() method. The wait() method blocks until the flag is true.
[all...] |
| /system/core/sdcard/ |
| fuse.h | 89 __u64 blocks; member in struct:fuse_attr
106 __u64 blocks; member in struct:fuse_kstatfs
|
| /system/core/sh/ |
| miscbltin.c | 303 { "file(blocks)", RLIMIT_FSIZE, 512, 'f' },
312 { "coredump(blocks)", RLIMIT_CORE, 512, 'c' },
|
| /system/extras/tests/ext4/ |
| android_emmc_perf_tests.sh | 147 # Do it again to make sure to fill up all the reserved blocks used for
148 # wear levelling, plus any unused blocks in the other partitions. Yes,
|
| /external/qemu/ |
| exec.c | 121 RAMList ram_list = { .blocks = QLIST_HEAD_INITIALIZER(ram_list) };
636 /* flush all the translation blocks */
[all...] |
| /external/valgrind/main/memcheck/docs/ |
| mc-tech-docs.xml | 118 basic blocks (BBs, straight-line sequences of code) into
162 basic blocks for C++ compiled with optimisation on. Generating
216 block is placed on the freed blocks queue
220 Keeping <computeroutput>free</computeroutput>'d blocks in this
222 to them. However, once the volume of blocks in the free queue
224 blocks are finally removed from the queue.</para>
257 Valgrind to run just some number of basic blocks, and then run
341 every 1000 basic blocks, which means 500 to 2000 times/second
351 This does a complete check of all blocks and chains in an
378 <para>The JITter parses x86 basic blocks into sequence
[all...] |
| /external/llvm/docs/ |
| Passes.rst | 446 This pass combines instructions inside basic blocks to form vector
462 idea is to put frequently executed blocks together at the start of the function
465 orders blocks in depth-first order.
719 basic block. This pass looks at blocks that have multiple predecessors and
767 into the preheader block, or by sinking code to the exit blocks if it is safe.
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 56 STATISTIC(NumGVNBlocks, "Number of blocks merged");
732 /// track of which blocks we know are fully alive in FullyAvailableBlocks. This
739 /// other blocks.
754 // speculation of other blocks.
778 // used the speculation to mark other blocks as available.
788 // If we did speculate on this value, we could have blocks set to 1 that are
796 // Note that this sets blocks to 0 (unavailable) if they happen to not
[all...] |
| /external/v8/src/ |
| hydrogen.cc | 257 // Only loop header blocks can have a predecessor added after
281 // Keep the list of dominated blocks sorted such that if there is two
320 // Mark blocks that dominate all subsequent reachable blocks inside their
321 // loop. Exploit the fact that blocks are sorted in reverse post order. When
327 // dominator_candidate block is guaranteed to dominate all blocks reachable
334 HBasicBlock* dominator_candidate = graph_->blocks()->at(j);
346 // all of the blocks with higher IDs. In this case, assume conservatively
437 // Checks reachability of the blocks in this graph and stores a bit in
441 // returns the number of reachable blocks
7895 const ZoneList<HBasicBlock*>* blocks = graph->blocks(); local
[all...] |
| /art/compiler/dex/ |
| mir_graph.h | 279 GrowableArray<SuccessorBlockInfo*>* blocks; member in struct:art::BasicBlock::__anon5
284 * The "blocks" field in "successor_block_list" points to an array of elements with the type
285 * "SuccessorBlockInfo". For catch blocks, key is type index for the exception. For swtich
286 * blocks, key is the case value.
|
| /art/compiler/dex/quick/ |
| mir_to_lir-inl.h | 62 * The following are building blocks to construct low-level IRs with 0 - 4
|
| /art/test/015-switch/src/ |
| Main.java | 18 * Test switch() blocks
|
| /cts/tests/src/android/os/cts/ |
| FileUtils.java | 71 public long blocks; field in class:FileUtils.FileStatus
|
| /cts/tests/tests/permission/jni/ |
| android_permission_cts_FileUtils.cpp | 159 gFileStatusBlocksFieldID = env->GetFieldID(fileStatusClass, "blocks", "J");
|
| /cts/tools/vm-tests-tf/src/util/build/ |
| BuildDalvikSuite.java | 552 int blocks = 1;
553 while ((currentChar = (char) reader.read()) != -1 && blocks > 0) {
556 blocks--;
561 blocks++;
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| DeadCodeRemover.java | 133 // Prune instructions from unreachable blocks
|
| DomFront.java | 24 * Calculates the dominance-frontiers of a methot's basic blocks.
|
| SsaRenamer.java | 59 * and used as the initial state for child blocks.<p>
80 * sub-arrays that exist at any one time are the start states for blocks
363 * phis in successor blocks.
624 * Updates the phi insns in successor blocks with operands based
|
