| /external/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
69 // Blocks - The list of blocks in this loop. First entry is the header node.
70 std::vector<BlockT*> Blocks;
85 /// blocks, where depth 0 is used for blocks not inside any loops.
93 BlockT *getHeader() const { return Blocks.front(); }
134 /// getBlocks - Get a list of the basic blocks which make up this loop.
136 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
[all...] |
| /external/llvm/lib/MC/ |
| MCFunction.cpp | 29 Blocks.push_back(new MCBasicBlock(TA, this));
30 return *Blocks.back();
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXSplitBBatBar.h | 11 // for splitting basic blocks at barrier instructions.
34 return "Split basic blocks at barrier";
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| UncondBranchToReturn.ll | 1 ; The unify-function-exit-nodes pass often makes basic blocks that just contain
21 ; as well, even if the return block is shared and the source blocks are
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_cfg.h | 97 /** Ordered list (by ip) of basic blocks */
99 fs_bblock **blocks; member in class:fs_cfg
|
| /external/valgrind/main/memcheck/docs/ |
| mc-manual.xml | 23 heap blocks, overrunning the top of the stack, and accessing memory after
34 blocks, or mismatched use of
162 <para>The contents of heap blocks (allocated with
259 <para>Memcheck keeps track of the blocks allocated by your program
337 xreflabel="Overlapping source and destination blocks">
338 <title>Overlapping source and destination blocks</title>
347 The blocks pointed to by their <computeroutput>src</computeroutput> and
361 <para>You don't want the two blocks to overlap because one of them could
384 <para>Memcheck keeps track of all heap blocks issued in response to
387 So when the program exits, it knows which blocks have not been freed
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
| armVCM4P2_SetPredDir_s.s | 25 ; * alpha blocks spatially corresponding to luminance
26 ; * blocks 0 to 3 in the same macroblock.
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
| armVCM4P2_SetPredDir_s.s | 25 ; * alpha blocks spatially corresponding to luminance
26 ; * blocks 0 to 3 in the same macroblock.
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/comm/src/ |
| omxVCCOMM_SAD_16x.c | 12 * This function will calculate SAD for 16x16 and 16x8 blocks
27 * This function calculates the SAD for 16x16 and 16x8 blocks.
|
| omxVCCOMM_SAD_8x.c | 12 * This function will calculate SAD for 8x16, 8x8, 8x4 blocks
27 * This function calculates the SAD for 8x16, 8x8, 8x4 blocks.
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_SAD_4x.c | 12 * This function will calculate SAD for 4x8 and 4x4 blocks
27 * This function calculates the SAD for 4x8 and 4x4 blocks.
|
| /packages/apps/InCallUI/res/layout/ |
| call_card.xml | 26 blocks, depending on whether one or two lines are in use.
28 The call_info blocks are stacked vertically inside a CallCard (LinearLayout),
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/asm/ |
| stat.h | 51 /* Number 512-byte blocks allocated. */
80 long st_blocks; /* Number 512-byte blocks allocated. */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| stat.h | 51 /* Number 512-byte blocks allocated. */
80 long st_blocks; /* Number 512-byte blocks allocated. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| stat.h | 51 /* Number 512-byte blocks allocated. */
80 long st_blocks; /* Number 512-byte blocks allocated. */
|
| /system/core/libsparse/ |
| sparse_format.h | 28 __le32 total_blks; /* total blocks in the non-sparse output image */
45 __le32 chunk_sz; /* in blocks in output image */
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /external/ceres-solver/include/ceres/ |
| cost_function.h | 58 // function (number and sizes of input parameter blocks and number of outputs)
72 // various parameter blocks. parameters has the same number of
73 // elements as parameter_block_sizes_. Parameter blocks are in the
83 // pointers to storage for jacobian blocks corresponding to each
84 // parameter block. Jacobian blocks are in the same order as
104 // parameters. If the initial values of the parameter blocks satisfy
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_crs_matrix.cc | 49 const vector<int>& blocks,
52 blocks_(blocks) {
53 CHECK_LT(blocks.size(), kMaxRowBlocks);
94 // Add entries to layout_ for all the blocks for this row.
132 // Assume that the user does not hold any locks on any cell blocks
163 // Assume that the user does not hold any locks on any cell blocks
|
| /external/chromium_org/net/disk_cache/ |
| block_files.h | 40 // Creates a new entry of |size| blocks on the allocation map, updating the
54 // more records. |block_count| is the number of blocks to allocate.
61 // Returns the number of empty blocks for this file.
67 // Returns the number of blocks that this file can store.
105 // blocks to allocate, and block_address is the address of the new entry.
120 // Returns true if the blocks pointed by a given address are currently used.
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /external/e2fsprogs/e2fsck/ |
| mtrace.h | 99 /* The allocator divides the heap into blocks of fixed size; large
100 requests receive one or more whole blocks, and small requests
113 /* Number of contiguous free blocks allowed to build up at the end of
133 /* Size (in blocks) of a large cluster. */
141 size_t size; /* Size (in blocks) of a free cluster. */
173 /* List of blocks allocated with `memalign' (or `valloc'). */
|
| problem.h | 32 #define PR_LATCH_BLOCK 0x0010 /* Latch for illegal blocks (pass 1) */
33 #define PR_LATCH_BBLOCK 0x0020 /* Latch for bad block inode blocks (pass 1) */
176 /* Backup journal inode blocks */
179 /* Reserved blocks w/o resize_inode */
235 /* Pass 1: Checking inodes, blocks, and sizes */
283 /* Inode has illegal blocks (latch question) */
286 /* Too many bad blocks in inode */
292 /* Bad block inode has illegal blocks (latch question) */
295 /* Duplicate or bad blocks in use! */
325 /* Error allocating blocks for relocating metadata *
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| UnifyFunctionExitNodes.cpp | 49 // Loop over all of the blocks in a function, tracking all of the blocks that
60 // Then unreachable blocks.
78 // Now handle return blocks.
81 return false; // No blocks return
105 // Loop over all of the blocks, replacing the return instruction with an
|
