| /external/valgrind/main/memcheck/tests/ |
| addressable.stderr.exp | 4 in use at exit: ... bytes in ... blocks
33 in use at exit: ... bytes in ... blocks
42 in use at exit: ... bytes in ... blocks
56 in use at exit: ... bytes in ... blocks
75 in use at exit: ... bytes in ... blocks
85 in use at exit: ... bytes in ... blocks
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 64 /* Return true when blocks A and B can be merged into single basic block. */
67 /* Merge blocks A and B. */
100 calls, volatile inline assembly in the bitmap of blocks specified by
101 BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
|
| basic-block.h | 37 /* The two blocks at the ends of the edge. */
117 Basic blocks need not start with a label nor end with a jump insn.
127 basic blocks. */
144 /* Previous and next blocks in the chain. */
207 /* Only set on blocks that have just been created by create_bb. */
214 /* Set for blocks in an irreducible loop by loop analysis. */
217 /* Set on blocks that may actually not be single-entry single-exit block. */
220 /* Set on basic blocks that the scheduler should not touch. This is used
224 /* Set on blocks that should be put in a hot section. */
227 /* Set on blocks that should be put in a cold section. *
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 64 /* Return true when blocks A and B can be merged into single basic block. */
67 /* Merge blocks A and B. */
100 calls, volatile inline assembly in the bitmap of blocks specified by
101 BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
|
| basic-block.h | 37 /* The two blocks at the ends of the edge. */
117 Basic blocks need not start with a label nor end with a jump insn.
127 basic blocks. */
144 /* Previous and next blocks in the chain. */
207 /* Only set on blocks that have just been created by create_bb. */
214 /* Set for blocks in an irreducible loop by loop analysis. */
217 /* Set on blocks that may actually not be single-entry single-exit block. */
220 /* Set on basic blocks that the scheduler should not touch. This is used
224 /* Set on blocks that should be put in a hot section. */
227 /* Set on blocks that should be put in a cold section. *
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 64 /* Return true when blocks A and B can be merged into single basic block. */
67 /* Merge blocks A and B. */
100 calls, volatile inline assembly in the bitmap of blocks specified by
101 BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
|
| basic-block.h | 37 /* The two blocks at the ends of the edge. */
117 Basic blocks need not start with a label nor end with a jump insn.
127 basic blocks. */
144 /* Previous and next blocks in the chain. */
207 /* Only set on blocks that have just been created by create_bb. */
214 /* Set for blocks in an irreducible loop by loop analysis. */
217 /* Set on blocks that may actually not be single-entry single-exit block. */
220 /* Set on basic blocks that the scheduler should not touch. This is used
224 /* Set on blocks that should be put in a hot section. */
227 /* Set on blocks that should be put in a cold section. *
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 64 /* Return true when blocks A and B can be merged into single basic block. */
67 /* Merge blocks A and B. */
100 calls, volatile inline assembly in the bitmap of blocks specified by
101 BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
|
| basic-block.h | 37 /* The two blocks at the ends of the edge. */
117 Basic blocks need not start with a label nor end with a jump insn.
127 basic blocks. */
144 /* Previous and next blocks in the chain. */
207 /* Only set on blocks that have just been created by create_bb. */
214 /* Set for blocks in an irreducible loop by loop analysis. */
217 /* Set on blocks that may actually not be single-entry single-exit block. */
220 /* Set on basic blocks that the scheduler should not touch. This is used
224 /* Set on blocks that should be put in a hot section. */
227 /* Set on blocks that should be put in a cold section. *
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| jbd.h | 95 * Standard header for all descriptor blocks:
115 * The revoke descriptor: used on disk to describe a series of blocks to
143 __be32 s_maxlen; /* total blocks in journal file */
169 __be32 s_max_transaction; /* Limit of journal blocks per trans.*/
170 __be32 s_max_trans_data; /* Limit of data blocks per trans. */
216 * Return the minimum number of blocks which must be free in the journal
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/ |
| types.h | 235 typedef __blkcnt_t blkcnt_t; /* Type to count number of disk blocks. */
239 typedef __fsblkcnt_t fsblkcnt_t; /* Type to count file system blocks. */
248 typedef __blkcnt64_t blkcnt_t; /* Type to count number of disk blocks. */
252 typedef __fsblkcnt64_t fsblkcnt_t; /* Type to count file system blocks. */
262 typedef __blkcnt64_t blkcnt64_t; /* Type to count number of disk blocks. */
263 typedef __fsblkcnt64_t fsblkcnt64_t; /* Type to count file system blocks. */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| jbd.h | 95 * Standard header for all descriptor blocks:
115 * The revoke descriptor: used on disk to describe a series of blocks to
143 __be32 s_maxlen; /* total blocks in journal file */
169 __be32 s_max_transaction; /* Limit of journal blocks per trans.*/
170 __be32 s_max_trans_data; /* Limit of data blocks per trans. */
216 * Return the minimum number of blocks which must be free in the journal
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
| types.h | 235 typedef __blkcnt_t blkcnt_t; /* Type to count number of disk blocks. */
239 typedef __fsblkcnt_t fsblkcnt_t; /* Type to count file system blocks. */
248 typedef __blkcnt64_t blkcnt_t; /* Type to count number of disk blocks. */
252 typedef __fsblkcnt64_t fsblkcnt_t; /* Type to count file system blocks. */
262 typedef __blkcnt64_t blkcnt64_t; /* Type to count number of disk blocks. */
263 typedef __fsblkcnt64_t fsblkcnt64_t; /* Type to count file system blocks. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| jbd.h | 95 * Standard header for all descriptor blocks:
115 * The revoke descriptor: used on disk to describe a series of blocks to
143 __be32 s_maxlen; /* total blocks in journal file */
169 __be32 s_max_transaction; /* Limit of journal blocks per trans.*/
170 __be32 s_max_trans_data; /* Limit of data blocks per trans. */
216 * Return the minimum number of blocks which must be free in the journal
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
| types.h | 235 typedef __blkcnt_t blkcnt_t; /* Type to count number of disk blocks. */
239 typedef __fsblkcnt_t fsblkcnt_t; /* Type to count file system blocks. */
248 typedef __blkcnt64_t blkcnt_t; /* Type to count number of disk blocks. */
252 typedef __fsblkcnt64_t fsblkcnt_t; /* Type to count file system blocks. */
262 typedef __blkcnt64_t blkcnt64_t; /* Type to count number of disk blocks. */
263 typedef __fsblkcnt64_t fsblkcnt64_t; /* Type to count file system blocks. */
|
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator.h | 55 // in other words, the parameter blocks in E form an independent set
94 // [ 0 0 0 0 | z1 0 0 0 0] non chunk blocks
95 // [ 0 0 0 0 | 0 0 z3 z4 z5] non chunk blocks
135 // interact, i.e for y1 column blocks when transposed and multiplied
136 // with F, the only non-zero contribution comes from the blocks in
154 // blocks of S, it asks the RandomAccessBlockMatrix instance passed to
207 // templating is on the sizes of the row, e and f blocks sizes in the
209 // blocks are constant, in that case, its worth passing these
250 // non-zero z block, and the sum of these blocks across rows. A
252 // and the buffer_layout maps the indices of the z-blocks t
[all...] |
| /external/libvpx/libvpx/vp8/decoder/ |
| error_concealment.c | 108 /* Calculates the overlap area for all blocks in a macroblock at position
112 * first_blk_col) in blocks relative the upper-left corner of the image.
119 /* Find the blocks within this MB (defined by mb_row, mb_col) which are
121 * blocks. */
127 * can be < 0. We don't want to access blocks in previous MBs.
133 /* Calculate and assign overlaps for all blocks in this MB
136 /* Avoid calculating overlaps for blocks in later MBs */
142 * and if so we shouldn't check neighboring blocks
150 * and if so, we're overlapping fewer blocks in this MB.
203 /* overlapping block's position in blocks */
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-escape-analysis.cc | 65 int block_count = graph()->blocks()->length();
67 HBasicBlock* block = graph()->blocks()->at(i);
166 // over affected basic blocks. All non-escaping instructions are handled
170 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone());
172 // Iterate all blocks starting with the allocation block, since the
173 // allocation cannot dominate blocks that come before.
175 for (int i = start; i < graph()->blocks()->length(); i++) {
176 HBasicBlock* block = graph()->blocks()->at(i);
179 // Skip blocks that are not dominated by the captured allocation.
255 // Propagate the block state forward to all successor blocks
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 10 // This family of functions perform manipulations on basic blocks, and
11 // instructions contained within basic blocks.
102 /// false. Otherwise, split all edges between the two blocks and return true.
117 /// an edge between the two blocks. If P is specified, it updates the analyses
140 /// to a new block. The two blocks are joined by an unconditional branch and
161 /// OrigBB, by introducing two new basic blocks into the function. One of those
162 /// new basic blocks gets the predecessors listed in Preds. The other basic
164 /// OrigBB is clone into both of the new basic blocks. The new blocks are given
188 /// new block. The two blocks are connected by a conditional branc
[all...] |
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 10 // This family of functions performs analyses on basic blocks, and instructions
11 // contained within basic blocks.
141 // multiple blocks, the first instruction of the block is reachable, so we
142 // only need to determine reachability between whole blocks.
184 // regardless of whether there's a path between the two blocks.
188 // Limit the number of blocks we visit. The goal is to avoid run-away compile
214 // All blocks in a single loop are reachable from all other blocks. From
215 // any of these blocks, we can skip directly to the exits of the loop,
216 // ignoring any other blocks inside the loop body
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 77 /// checked for unique exit and exiting blocks, and that the code is in LCSSA
94 // Make sure all exiting blocks produce the same incoming value for the exit
96 // blocks, then it is impossible to statically determine which value should
203 // Update the dominator tree and remove the instructions and blocks that will
225 // Erase the instructions and the blocks without having to worry
233 // Finally, the blocks from loopinfo. This has to happen late because
236 SmallPtrSet<BasicBlock*, 8> blocks; local
237 blocks.insert(L->block_begin(), L->block_end());
238 for (SmallPtrSet<BasicBlock*,8>::iterator I = blocks.begin(),
239 E = blocks.end(); I != E; ++I
[all...] |
| SimplifyCFGPass.cpp | 13 // * Removes basic blocks with no predecessors.
16 // * Eliminates PHI nodes for basic blocks with a single predecessor.
41 STATISTIC(NumSimpl, "Number of blocks simplified");
189 /// removeUnreachableBlocksFromFn - Remove blocks that are not reachable, even
196 // If there are unreachable blocks in the CFG...
203 // Loop over all of the basic blocks that are not reachable, dropping all of
225 /// node) return blocks, merge them together to promote recursive block merging.
231 // Scan all the blocks in the function, looking for empty return blocks.
235 // Only look at return blocks
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 50 * blocks.
87 private final ByteBlockList blocks; field in class:Ropper
142 /** list of all blocks that jsr to this subroutine */
144 /** List of all blocks that return from this subroutine */
165 * @param retBlock one of the ret blocks (final blocks) of this
181 * Adds a label to the list of ret blocks (final blocks) for this
191 * Adds a label to the list of caller blocks for this subroutine.
200 * Generates a list of subroutine successors. Note: successor blocks
[all...] |
| /dalvik/vm/compiler/ |
| SSATransformation.cpp | 36 dvmGrowableListIteratorInit(&block->successorBlockList.blocks,
49 /* Sort the blocks by the Depth-First-Search pre-order */
128 /* Iterate through the dominated blocks first */
151 * blocks.
174 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
380 * Iterate through all successor blocks and propagate up the live-in sets.
399 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
447 /* Calculate the phi blocks for each Dalvik register */
467 * Iterate through the original blocks plus the new ones in
499 * predecessor blocks
[all...] |
| /external/e2fsprogs/e2fsck/ |
| e2fsck.8.in | 125 blocks. If any bad blocks are found, they are added to the bad block
184 Set the version of the extended attribute blocks which
194 During pass 1, print a detailed report of any discontiguous blocks for
214 option, any existing bad blocks in the bad blocks list are preserved,
215 and any new bad blocks found by running
217 will be added to the existing bad blocks list.
222 to the list of bad blocks. The format of this file is the same as the
238 Set the bad blocks list to be the list of blocks specified by
[all...] |
