| /sdk/emulator/qtools/ |
| bbprof.cpp | 18 MyStaticRec **assign_inner_blocks(int num_blocks, MyStaticRec *blocks);
21 // blocks.
35 // of basic blocks.
49 // basic blocks.
75 // Allocate space for all of the static blocks
76 MyStaticRec *blocks = new MyStaticRec[num_static_bb]; local
78 // Read in all the static blocks
80 trace->ReadStatic(&blocks[ii].bb);
81 blocks[ii].is_thumb = blocks[ii].bb.bb_addr & 1
[all...] |
| post_trace.cpp | 28 // Count the number of static basic blocks and instructions.
48 // Allocate space for all of the static blocks
49 MyStaticRec *blocks = new MyStaticRec[num_static_bb]; local
51 // Read the static blocks again and save pointers to them
54 trace->ReadStatic(&blocks[ii].bb);
55 uint32_t num_insns = blocks[ii].bb.num_insns;
57 blocks[ii].insns = new uint32_t[num_insns];
58 trace->ReadStaticInsns(num_insns, blocks[ii].insns);
64 uint32_t num_insns = blocks[num_static_bb - 1].bb.num_insns;
65 uint32_t *insn_ptr = blocks[num_static_bb - 1].insns
[all...] |
| /external/genext2fs/ |
| test-mount.sh | 34 # Usage: dtest-mount file-size number-of-blocks
36 size=$1; blocks=$2
38 dgen $size $blocks
47 pass dtest $size $blocks
54 # Usage: ftest-mount spec-file number-of-blocks
56 fname=$1; blocks=$2
58 fgen $fname $blocks
75 pass ftest $fname $blocks
|
| test-gen.lib | 9 # Usage: dgen file-size number-of-blocks
11 size=$1; blocks=$2
23 ./genext2fs -N 17 -b $blocks -d test -f -q ext2.img
28 # Usage: fgen spec-file number-of-blocks
30 fname=$1; blocks=$2;
34 ./genext2fs -N 92 -b $blocks -D test/$fname -f ext2.img
|
| /external/webkit/Source/JavaScriptCore/heap/ |
| HandleStack.h | 85 const Vector<HandleSlot>& blocks = m_blockStack.blocks();
88 int i = blocks.size() - 1;
89 for ( ; blocks[i] + m_blockStack.blockLength != lastFrame.m_end; --i) {
91 blocks[i][j] = JSValue();
94 for (HandleSlot it = blocks[i] + m_blockStack.blockLength - 1; it != lastFrame.m_next - 1; --it)
|
| /external/valgrind/main/memcheck/tests/ |
| pointer-trace.stderr.exp | 1 1,000 bytes in 1 blocks are definitely lost in loss record ... of ...
|
| leak-cycle.stderr.exp | 1 leaked: 288 bytes in 18 blocks
2 dubious: 0 bytes in 0 blocks
3 reachable: 0 bytes in 0 blocks
4 suppressed: 0 bytes in 0 blocks
5 48 (16 direct, 32 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
11 48 (16 direct, 32 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
17 96 (16 direct, 80 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
23 96 (16 direct, 80 indirect) bytes in 1 blocks are definitely lost in loss record ... of ...
|
| leak-cases-full.stderr.exp | 1 leaked: 80 bytes in 5 blocks
2 dubious: 96 bytes in 6 blocks
3 reachable: 64 bytes in 4 blocks
4 suppressed: 0 bytes in 0 blocks
5 16 bytes in 1 blocks are possibly lost in loss record ... of ...
11 16 bytes in 1 blocks are possibly lost in loss record ... of ...
17 16 bytes in 1 blocks are possibly lost in loss record ... of ...
23 16 bytes in 1 blocks are possibly lost in loss record ... of ...
29 16 bytes in 1 blocks are possibly lost in loss record ... of ...
35 16 bytes in 1 blocks are possibly lost in loss record ... of ..
[all...] |
| trivialleak.stderr.exp | 1 1,000 bytes in 1,000 blocks are definitely lost in loss record ... of ...
|
| /external/clang/test/CodeGenCXX/ |
| 2006-09-12-OpaqueStructCrash.cpp | 24 B<C<Ty> > blocks; member in struct:D
|
| /external/markdown/markdown/ |
| blockparser.py | 38 """ Parse Markdown blocks into an ElementTree object.
67 blocks which will be split on blank lines, it could contain only one
77 def parseBlocks(self, parent, blocks):
78 """ Process blocks of markdown text and attach to given etree node.
80 Given a list of ``blocks``, each blockprocessor is stepped through
81 until there are no blocks left. While an extension could potentially
89 while blocks:
91 if processor.test(parent, blocks[0]):
92 processor.run(parent, blocks)
|
| blockprocessors.py | 5 This parser handles basic parsing of Markdown blocks. It doesn't concern itself
7 blocks, lists, quotes, etc.
11 as they need to alter how markdown blocks are parsed.
80 def run(self, parent, blocks):
95 the list of blocks.
100 * ``blocks``: A list of all remaining blocks of the document.
129 def run(self, parent, blocks):
130 block = blocks.pop(0)
187 """ Process code blocks. ""
[all...] |
| /bionic/libc/kernel/tools/ |
| clean_header.py | 60 blocks = cpp.BlockParser().parseFile(path)
61 if not blocks:
66 blocks.optimizeMacros( kernel_known_macros )
67 blocks.optimizeIf01()
68 blocks.removeVarsAndFuncs( statics )
69 blocks.replaceTokens( kernel_token_replacements )
70 blocks.removeComments()
71 blocks.removeMacroDefines( kernel_ignored_macros )
72 blocks.removeWhiteSpace()
76 blocks.writeWithWarning(out, kernel_warning, 4
[all...] |
| /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/dbus/dbus/ |
| dbus-mempool.c | 35 * blocks of small uniformly-sized objects. The main point is to avoid
84 * only saved so we can free all the blocks
104 DBusMemBlock *blocks; /**< blocks of memory from malloc() */ member in struct:DBusMemPool
188 block = pool->blocks;
234 block->next = pool->blocks;
235 pool->blocks = block;
268 if (pool->blocks == NULL ||
269 pool->blocks->used_so_far == pool->block_size)
313 block->next = pool->blocks;
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 32 * Searches for basic blocks that all have the same successor and insns
33 * but different predecessors. These blocks are then combined into a single
34 * block and the now-unused blocks are deleted. These identical blocks
35 * frequently are created when catch blocks are edge-split.
39 private final BasicBlockList blocks; field in class:IdenticalBlockCombiner
49 blocks = ropMethod.getBlocks();
50 newBlocks = blocks.getMutableCopy();
56 * compare blocks with the same hash.
61 int szBlocks = blocks.size()
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 31 private final BasicBlockList blocks; field in class:LocalVariableExtractor
36 /** {@code non-null;} work set indicating blocks needing to be processed */
60 BasicBlockList blocks = method.getBlocks(); local
61 int maxLabel = blocks.getMaxLabel();
64 this.blocks = blocks;
93 BasicBlock block = blocks.labelToBlock(label);
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 31 private final BasicBlockList blocks; field in class:LocalVariableExtractor
36 /** {@code non-null;} work set indicating blocks needing to be processed */
60 BasicBlockList blocks = method.getBlocks(); local
61 int maxLabel = blocks.getMaxLabel();
64 this.blocks = blocks;
93 BasicBlock block = blocks.labelToBlock(label);
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| MapMaker.java | 71 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, false);
73 mm.make(blocks, ca.getCode());
74 for (int i = 0; i < blocks.length; i++)
75 System.out.println(blocks[i]);
91 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, true);
92 if (blocks == null)
96 mm.make(blocks, ca.getCode());
97 return mm.toStackMap(blocks);
112 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, true);
113 if (blocks == null
[all...] |
| Liveness.java | 34 public void compute(CodeIterator ci, TypedBlock[] blocks, int maxLocals,
38 computeUsage(ci, blocks, maxLocals);
40 useAllArgs(blocks, args);
42 computeLiveness1(blocks[0]);
43 while (hasChanged(blocks))
44 computeLiveness2(blocks[0]);
47 private void useAllArgs(TypedBlock[] blocks, TypeData[] args) {
48 for (int k = 0; k < blocks.length; k++) {
49 byte[] usage = blocks[k].localsUsage;
192 private boolean hasChanged(TypedBlock[] blocks) {
[all...] |
| /external/bluetooth/bluez/sbc/ |
| sbcenc.c | 48 int dualchannel, int snr, int blocks)
137 sbc.blocks = blocks == 4 ? SBC_BLK_4 :
138 blocks == 8 ? SBC_BLK_8 :
139 blocks == 12 ? SBC_BLK_12 : SBC_BLK_16;
142 fprintf(stderr, "encoding %s with rate %d, %d blocks, "
145 filename, srate, blocks, subbands, bitpool,
223 "\t-B, --blocks Number of blocks (4, 8, 12 or 16)\n"
235 { "blocks", 1, 0, 'B' }
242 int snr = 0, blocks = 16; local
[all...] |
| /external/clang/tools/libclang/ |
| Index_Internal.h | 23 #if __has_feature(blocks)
28 // If we are compiled with a compiler that doesn't have native blocks support,
41 #endif // !__has_feature(blocks)
|
| /system/extras/ext4_utils/ |
| allocate.h | 47 int reserve_oob_blocks(struct block_allocation *alloc, int blocks);
48 int advance_blocks(struct block_allocation *alloc, int blocks);
49 int advance_oob_blocks(struct block_allocation *alloc, int blocks);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 147 ArrayList<SsaBasicBlock> blocks = result.getBlocks(); local
150 * New blocks are added to the end of the block list during
153 for (int i = blocks.size() - 1; i >= 0; i-- ) {
154 SsaBasicBlock block = blocks.get(i);
188 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
191 * New blocks are added to the end of the block list during
194 for (int i = blocks.size() - 1; i >= 0; i-- ) {
195 SsaBasicBlock block = blocks.get(i);
209 SsaBasicBlock predecessor = blocks.get(j);
233 ArrayList<SsaBasicBlock> blocks = result.getBlocks() local
[all...] |
