| /bionic/libc/kernel/tools/ |
| clean_header.py | 60 blocks = cpp.BlockParser().parseFile(path)
61 if not blocks:
70 blocks.replaceTokens( kernel_arch_token_replacements[arch] )
72 blocks.optimizeMacros( macros )
73 blocks.optimizeIf01()
74 blocks.removeVarsAndFuncs( statics )
75 blocks.replaceTokens( kernel_token_replacements )
76 blocks.removeComments()
77 blocks.removeMacroDefines( kernel_ignored_macros )
78 blocks.removeWhiteSpace(
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 11 // algorithm. The idea is to put frequently executed blocks together at the
14 // function, this pass basically orders blocks in depth-first order
22 // placing the most frequently executed successor until we run out of blocks. I
39 STATISTIC(NumMoved, "Number of basic blocks moved");
72 /// PlaceBlocks - Recursively place the specified blocks and any unplaced
93 // Recursively place all blocks.
102 /// PlaceBlocks - Recursively place the specified blocks and any unplaced
113 Function::BasicBlockListType &Blocks = BB->getParent()->getBasicBlockList();
114 Blocks.splice(InsertPos, Blocks, BB)
[all...] |
| /external/valgrind/main/gdbserver_tests/ |
| mcleak.stderrB.exp | 3 10 bytes in 1 blocks are still reachable in loss record ... of ...
8 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
13 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
18 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ...
23 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
28 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ...
33 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
38 0 (-10) bytes in 0 (-1) blocks are definitely lost in loss record ... of ...
43 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
48 32 (+32) bytes in 1 (+1) blocks are definitely lost in loss record ... of ..
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| Random.h | 74 uint32_t * blocks = reinterpret_cast<uint32_t*>(blob); local
78 blocks[0] = rand_u32();
79 blocks++;
83 uint8_t * tail = reinterpret_cast<uint8_t*>(blocks);
101 uint32_t * blocks = (uint32_t*)blob; local
105 *blocks++ = rand_u32();
109 uint8_t * tail = (uint8_t*)blocks;
|
| /external/chromium_org/v8/src/ |
| hydrogen-canonicalize.cc | 35 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
39 for (int i = 0; i < blocks->length(); ++i) {
40 for (HInstructionIterator it(blocks->at(i)); !it.Done(); it.Advance()) {
64 for (int i = 0; i < blocks->length(); ++i) {
68 redundant_phi_eliminator.ProcessBlock(blocks->at(i));
70 for (HInstructionIterator it(blocks->at(i)); !it.Done(); it.Advance()) {
|
| /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...] |
| /external/jpeg/ |
| wrjpgcom.1 | 26 The JPEG standard allows "comment" (COM) blocks to occur within a JPEG file.
27 Although the standard doesn't actually define what COM blocks are for, they
30 them as text. COM blocks do not interfere with the image stored in the JPEG
36 Ordinarily, the COM block is added after any existing COM blocks; but you
37 can delete the old COM blocks if you wish.
42 Delete any existing COM blocks from the file.
69 \fB\-replace \-comment ""\fR can be used to delete all COM blocks from a file.
|
| /external/qemu/distrib/jpeg-6b/ |
| wrjpgcom.1 | 26 The JPEG standard allows "comment" (COM) blocks to occur within a JPEG file.
27 Although the standard doesn't actually define what COM blocks are for, they
30 them as text. COM blocks do not interfere with the image stored in the JPEG
36 Ordinarily, the COM block is added after any existing COM blocks; but you
37 can delete the old COM blocks if you wish.
42 Delete any existing COM blocks from the file.
69 \fB\-replace \-comment ""\fR can be used to delete all COM blocks from a file.
|
| /system/core/toolbox/ |
| dd.h | 56 uint64_t offset; /* # of blocks to skip */
60 uint64_t in_full; /* # of full input blocks */
61 uint64_t in_part; /* # of partial input blocks */
62 uint64_t out_full; /* # of full output blocks */
63 uint64_t out_part; /* # of partial output blocks */
65 uint64_t swab; /* # of odd-length swab blocks */
66 uint64_t sparse; /* # of sparse output blocks */
|
| /frameworks/base/docs/html/design/ |
| design_toc.cs | 52 <div class="nav-section-header"><a href="<?cs var:toroot ?>design/building-blocks/index.html">Building Blocks</a></div>
54 <li><a href="<?cs var:toroot ?>design/building-blocks/tabs.html">Tabs</a></li>
55 <li><a href="<?cs var:toroot ?>design/building-blocks/lists.html">Lists</a></li>
56 <li><a href="<?cs var:toroot ?>design/building-blocks/grid-lists.html">Grid Lists</a></li>
57 <li><a href="<?cs var:toroot ?>design/building-blocks/scrolling.html">Scrolling</a></li>
58 <li><a href="<?cs var:toroot ?>design/building-blocks/spinners.html">Spinners</a></li>
59 <li><a href="<?cs var:toroot ?>design/building-blocks/buttons.html">Buttons</a></li>
60 <li><a href="<?cs var:toroot ?>design/building-blocks/text-fields.html">Text Fields</a></li>
61 <li><a href="<?cs var:toroot ?>design/building-blocks/seek-bars.html">Seek Bars</a></li
[all...] |
| /external/markdown/markdown/ |
| 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...] |
| /external/chromium/net/disk_cache/ |
| disk_format.h | 10 // be stored as a series of blocks on a block-file. In any case, CacheAddr
18 // designed to store blocks of data of a given size. It is able to store data
19 // that spans from one to four consecutive "blocks", and it grows as needed to
20 // store up to approximately 65000 blocks. It has a fixed size header used for
21 // book keeping such as tracking free of blocks on the file. For example, a
22 // block-file for 1KB blocks will grow from 8KB when totally empty to about 64MB
23 // when completely full. At that point, data blocks of 1KB will be stored on a
24 // second block file that will store the next set of 65000 blocks. The first
32 // data_3), each one dedicated to store blocks of a given size. The number at
35 // There are two "special" types of blocks: an entry and a rankings node. A
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCFunction.h | 84 BasicBlockListTy Blocks;
99 /// \name Access to the function's basic blocks. No ordering is enforced.
108 const_iterator begin() const { return Blocks.begin(); }
109 iterator begin() { return Blocks.begin(); }
110 const_iterator end() const { return Blocks.end(); }
111 iterator end() { return Blocks.end(); }
113 const MCBasicBlock* front() const { return Blocks.front(); }
114 MCBasicBlock* front() { return Blocks.front(); }
115 const MCBasicBlock* back() const { return Blocks.back(); }
116 MCBasicBlock* back() { return Blocks.back();
[all...] |
| /external/ceres-solver/internal/ceres/ |
| solver_impl.h | 86 // Create the transformed Program, which has all the fixed blocks
88 // ordering, has the E blocks first in the resulting program, with
91 // If fixed_cost is not NULL, the residual blocks that are removed
102 // blocks is zero after removing fixed blocks.
108 // parameter blocks) occur together. This is a necessary condition
122 // Remove the fixed or unused parameter blocks and residuals
125 // at which the eliminated blocks is valid. If fixed_cost is not
126 // NULL, the residual blocks that are removed are evaluated and the
165 // Reorder the parameter blocks in program using the orderin
[all...] |
| schur_ordering.h | 48 // blocks of a problem so that it is suitable for use with Schur
50 // ordering of the parameter blocks and the return value is size of
59 // fixed blocks]
64 // Builds a graph on the parameter blocks of a Problem, whose
67 // parameter blocks that are marked constant. An edge connects two
68 // parameter blocks, if they co-occur in a residual block.
|
| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 1 //===-- UnreachableBlockElim.cpp - Remove unreachable blocks for codegen --===//
11 // job is to delete LLVM basic blocks that are not reachable from the entry
17 // blocks. Until LLVM has a more systematic way of defining instruction
59 "Remove unreachable blocks from the CFG", false, false)
68 // Mark all reachable blocks.
71 /* Mark all reachable blocks */;
73 // Loop over all dead blocks, remembering them and deleting all instructions
89 // Actually remove the blocks now.
113 "Remove unreachable machine basic blocks", false, false)
131 // Mark all reachable blocks
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 68 /// \brief Build a set of blocks to extract if the input blocks are viable.
76 // Loop over the blocks, adding them to our set-vector, and aborting with an
77 // empty set if we encounter invalid blocks.
80 llvm_unreachable("Repeated basic blocks in extraction input");
95 "No blocks in this region may have entries from outside the region"
122 Blocks(buildExtractionBlockSet(BB)), NumExitBlocks(~0U) {}
127 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {}
131 Blocks(buildExtractionBlockSet(L.getBlocks())), NumExitBlocks(~0U) {}
136 Blocks(buildExtractionBlockSet(RN)), NumExitBlocks(~0U) {
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| SsaToRop.java | 131 * Removes all blocks containing only GOTOs from the control flow.
135 * blocks containing the real return or throw statements must be
139 final ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
151 SsaBasicBlock pb = blocks.get(i);
166 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
168 for (SsaBasicBlock block : blocks) {
169 // Add moves in all the pred blocks for each phi insn.
170 block.forEachPhiInsn(new PhiVisitor(blocks));
180 for (SsaBasicBlock block : blocks) {
190 private final ArrayList<SsaBasicBlock> blocks; field in class:SsaToRop.PhiVisitor
242 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/evp/ |
| e_rc4_hmac_md5.c | 81 MD5_CTX *ctx,const void *inp,size_t blocks);
123 blocks; local
137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) &&
143 &key->md,in+md5_off,blocks);
144 blocks *= MD5_CBLOCK;
145 rc4_off += blocks;
146 md5_off += blocks;
147 key->md.Nh += blocks>>29;
148 key->md.Nl += blocks<<=3;
149 if (key->md.Nl<(unsigned int)blocks) key->md.Nh++
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| SsaToRop.java | 132 * Removes all blocks containing only GOTOs from the control flow.
136 * blocks containing the real return or throw statements must be
140 final ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
152 SsaBasicBlock pb = blocks.get(i);
167 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
169 for (SsaBasicBlock block : blocks) {
170 // Add moves in all the pred blocks for each phi insn.
171 block.forEachPhiInsn(new PhiVisitor(blocks));
181 for (SsaBasicBlock block : blocks) {
191 private final ArrayList<SsaBasicBlock> blocks; field in class:SsaToRop.PhiVisitor
243 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
[all...] |
| /external/openssl/crypto/evp/ |
| e_rc4_hmac_md5.c | 81 MD5_CTX *ctx,const void *inp,size_t blocks);
123 blocks; local
137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) &&
143 &key->md,in+md5_off,blocks);
144 blocks *= MD5_CBLOCK;
145 rc4_off += blocks;
146 md5_off += blocks;
147 key->md.Nh += blocks>>29;
148 key->md.Nl += blocks<<=3;
149 if (key->md.Nl<(unsigned int)blocks) key->md.Nh++
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| ufs_fs.h | 66 * For filesystem fs, the offsets of the various blocks of interest
70 * [fs->fs_iblkno] Inode blocks
71 * [fs->fs_dblkno] Data blocks
181 * blocks which may be free. If the freelist drops below this level
182 * only the superuser may continue to allocate blocks. This may
183 * be set to 0 if no reserve of free blocks is deemed necessary,
196 * This maps file system blocks to device size blocks.
291 __fs32 cs_nbfree; /* number of free blocks */
297 __fs64 cs_nbfree; /* number of free blocks */
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| ufs_fs.h | 66 * For filesystem fs, the offsets of the various blocks of interest
70 * [fs->fs_iblkno] Inode blocks
71 * [fs->fs_dblkno] Data blocks
181 * blocks which may be free. If the freelist drops below this level
182 * only the superuser may continue to allocate blocks. This may
183 * be set to 0 if no reserve of free blocks is deemed necessary,
196 * This maps file system blocks to device size blocks.
291 __fs32 cs_nbfree; /* number of free blocks */
297 __fs64 cs_nbfree; /* number of free blocks */
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| ufs_fs.h | 66 * For filesystem fs, the offsets of the various blocks of interest
70 * [fs->fs_iblkno] Inode blocks
71 * [fs->fs_dblkno] Data blocks
181 * blocks which may be free. If the freelist drops below this level
182 * only the superuser may continue to allocate blocks. This may
183 * be set to 0 if no reserve of free blocks is deemed necessary,
196 * This maps file system blocks to device size blocks.
291 __fs32 cs_nbfree; /* number of free blocks */
297 __fs64 cs_nbfree; /* number of free blocks */
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
83 iterator begin() { return Blocks.rbegin(); }
84 iterator end() { return Blocks.rend(); }
|
