| /external/markdown/markdown/extensions/ |
| def_list.py | 34 def run(self, parent, blocks):
35 block = blocks.pop(0)
74 blocks.insert(0, theRest)
|
| /bootable/recovery/mtdutils/ |
| mtdutils.h | 44 * skips bad blocks as best we can.
56 off_t mtd_erase_blocks(MtdWriteContext *, int blocks); /* 0 ok, -1 for all */
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_crs_matrix.h | 54 // blocks is an array of block sizes. block_pairs is a set of
57 BlockRandomAccessCRSMatrix(const vector<int>& blocks,
|
| block_random_access_sparse_matrix.h | 56 // blocks is an array of block sizes. block_pairs is a set of
59 BlockRandomAccessSparseMatrix(const vector<int>& blocks,
|
| compressed_row_sparse_matrix_test.cc | 179 vector<int> blocks; local
180 blocks.push_back(1);
181 blocks.push_back(2);
182 blocks.push_back(2);
191 diagonal.data(), blocks));
196 EXPECT_EQ(blocks, matrix->row_blocks());
197 EXPECT_EQ(blocks, matrix->col_blocks());
|
| implicit_schur_complement_test.cc | 77 vector<int> blocks(num_col_blocks - num_eliminate_blocks_, 0);
79 blocks[i - num_eliminate_blocks_] = bs->cols[i].size;
82 BlockRandomAccessDenseMatrix blhs(blocks);
|
| /external/chromium_org/third_party/mesa/src/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/chromium_org/third_party/tcmalloc/chromium/src/gperftools/ |
| malloc_extension_c.h | 64 PERFTOOLS_DLL_DECL int MallocExtension_MallocMemoryStats(int* blocks, size_t* total,
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/gperftools/ |
| malloc_extension_c.h | 64 PERFTOOLS_DLL_DECL int MallocExtension_MallocMemoryStats(int* blocks, size_t* total,
|
| /external/chromium_org/v8/src/ |
| hydrogen-infer-representation.cc | 127 for (int i = 0; i < graph()->blocks()->length(); ++i) {
128 HBasicBlock* block = graph()->blocks()->at(i);
149 for (int i = 0; i < graph()->blocks()->length(); ++i) {
150 HBasicBlock* block = graph()->blocks()->at(i);
|
| hydrogen-bch.cc | 78 // Utility methods to iterate over dominated blocks.
119 for (int i = 0; i < graph()->blocks()->length(); i++) {
201 elements_(graph->blocks()->length(), graph->zone()) {
202 for (int i = 0; i < graph->blocks()->length(); i++) {
204 element.set_block(graph->blocks()->at(i));
404 for (int i = 0; i < graph()->blocks()->length(); i++) {
405 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
|
| /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/skia/tools/copyright/ |
| main.py | 45 ReportWarning('cannot find any comment blocks in file %s' %
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| addressmap-inl.h | 54 // entries in a block (for non-empty blocks).
73 // the cluster. Empty blocks impose no extra space requirement.
152 // up the address-space into blocks and using a linked-list entry
168 // We further group a sequence of consecutive blocks into a cluster.
179 Entry* blocks[kClusterBlocks]; // Per-block linked-lists member in struct:AddressMap::Cluster
298 for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) {
314 for (Entry* e = c->blocks[block]; e != NULL; e = e->next) {
335 e->next = c->blocks[block];
336 c->blocks[block] = e;
344 for (Entry** p = &c->blocks[BlockID(num)]; *p != NULL; p = &(*p)->next)
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| addressmap-inl.h | 54 // entries in a block (for non-empty blocks).
73 // the cluster. Empty blocks impose no extra space requirement.
152 // up the address-space into blocks and using a linked-list entry
168 // We further group a sequence of consecutive blocks into a cluster.
179 Entry* blocks[kClusterBlocks]; // Per-block linked-lists member in struct:AddressMap::Cluster
298 for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) {
314 for (Entry* e = c->blocks[block]; e != NULL; e = e->next) {
335 e->next = c->blocks[block];
336 c->blocks[block] = e;
344 for (Entry** p = &c->blocks[BlockID(num)]; *p != NULL; p = &(*p)->next)
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| describe-block.stderr.exp | 9 in use at exit: ... bytes in ... blocks
|
| 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
|
| /external/chromium_org/third_party/jinja2/ |
| runtime.py | 50 def new_context(environment, template_name, blocks, vars=None,
67 return Context(environment, parent, template_name, blocks)
77 blocks = self.__context.blocks[name]
78 return BlockReference(name, self.__context, blocks, 0)
107 'name', 'blocks', '__weakref__')
109 def __init__(self, environment, parent, name, blocks):
117 # create the initial mapping of blocks. Whenever template inheritance
118 # takes place the runtime will update this mapping with the new blocks
120 self.blocks = dict((k, [v]) for k, v in blocks.iteritems()
[all...] |
| /external/lzma/C/ |
| XzEnc.c | 93 const CXzBlockSizes *block = &p->blocks[i];
126 if (p->blocks == 0 || p->numBlocksAllocated == p->numBlocks)
130 CXzBlockSizes *blocks;
local
133 blocks = alloc->Alloc(alloc, newSize);
134 if (blocks == 0)
138 memcpy(blocks, p->blocks, p->numBlocks * sizeof(CXzBlockSizes));
141 p->blocks = blocks;
145 CXzBlockSizes *block = &p->blocks[p->numBlocks++];
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 125 BasicBlockList blocks = method.getBlocks(); local
126 int bsz = blocks.size();
134 int maxInsns = (bsz * 3) + blocks.getInstructionCount();
150 this.regCount = blocks.getRegCount()
216 * original blocks.
219 BasicBlockList blocks = method.getBlocks(); local
223 // Process the blocks in output order.
227 outputBlock(blocks.labelToBlock(order[i]), nextLabel);
302 * Picks an order for the blocks by doing "trace" analysis.
305 BasicBlockList blocks = method.getBlocks() local
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 130 BasicBlockList blocks = method.getBlocks(); local
131 int bsz = blocks.size();
139 int maxInsns = (bsz * 3) + blocks.getInstructionCount();
155 this.regCount = blocks.getRegCount()
222 * original blocks.
225 BasicBlockList blocks = method.getBlocks(); local
229 // Process the blocks in output order.
233 outputBlock(blocks.labelToBlock(order[i]), nextLabel);
308 * Picks an order for the blocks by doing "trace" analysis.
311 BasicBlockList blocks = method.getBlocks() local
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| RopTranslator.java | 131 BasicBlockList blocks = method.getBlocks(); local
132 int bsz = blocks.size();
140 int maxInsns = (bsz * 3) + blocks.getInstructionCount();
156 this.regCount = blocks.getRegCount()
223 * original blocks.
226 BasicBlockList blocks = method.getBlocks(); local
230 // Process the blocks in output order.
234 outputBlock(blocks.labelToBlock(order[i]), nextLabel);
309 * Picks an order for the blocks by doing "trace" analysis.
312 BasicBlockList blocks = method.getBlocks() local
[all...] |
| /external/emma/core/java12/com/vladium/emma/report/ |
| MethodItem.java | 116 final int [] blocks = (int []) lineMap.get (lines [l]); local
118 int thisLineCoverageCount = 0; final int thisLineTotalCount = blocks.length;
123 final int b = blocks [bID];
|
| /external/openssh/ |
| cipher-aes.c | 80 int i, j, blocks = len / RIJNDAEL_BLOCKSIZE; local
94 for (i = 0; i < blocks; i++, plain+=RIJNDAEL_BLOCKSIZE,
107 for (i = blocks; i > 0; i--, cnow-=RIJNDAEL_BLOCKSIZE,
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| LocalVariableInfo.java | 61 List<SsaBasicBlock> blocks = method.getBlocks(); local
65 this.blockStarts = new RegisterSpecSet[blocks.size()];
|
