/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
H A D | toy.ml | 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
H A D | toy.ml | 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
H A D | toy.ml | 45 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
/external/markdown/markdown/extensions/ |
H A D | codehilite.py | 7 Adds code/syntax highlighting to standard Python-Markdown code blocks. 179 """ Hilight source code in code blocks. """ 182 """ Find code blocks and store in htmlStash. """ 183 blocks = root.getiterator('pre') 184 for block in blocks:
|
H A D | imagelinks.py | 46 blocks = []
|
/external/valgrind/main/memcheck/tests/ |
H A D | badjump.stderr.exp | 19 in use at exit: ... bytes in ... blocks
|
H A D | noisy_child.stderr.exp | 17 in use at exit: ... bytes in ... blocks
|
H A D | partial_load_ok.stderr.exp | 22 in use at exit: ... bytes in ... blocks
|
/external/valgrind/main/memcheck/tests/darwin/ |
H A D | aio.stderr.exp | 16 in use at exit: ... bytes in ... blocks
|
/external/ceres-solver/internal/ceres/ |
H A D | compressed_row_sparse_matrix.h | 132 const vector<int>& blocks);
|
H A D | schur_eliminator_test.cc | 132 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0); 134 blocks[i - num_eliminate_blocks] = bs->cols[i].size; 137 BlockRandomAccessDenseMatrix lhs(blocks);
|
H A D | compressed_row_sparse_matrix_test.cc | 140 // Clear the row and column blocks as these are purely scalar tests. 151 // Clear the row and column blocks as these are purely scalar tests. 238 vector<int> blocks; local 239 blocks.push_back(1); 240 blocks.push_back(2); 241 blocks.push_back(2); 250 diagonal.data(), blocks)); 255 EXPECT_EQ(blocks, matrix->row_blocks()); 256 EXPECT_EQ(blocks, matrix->col_blocks()); 520 VLOG(2) << "num row blocks [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-richards.js | 90 * priorities. Scheduling is done by maintaining a list of task control blocks 97 this.blocks = new Array(NUMBER_OF_IDS); 177 this.blocks[id] = this.currentTcb; 200 var tcb = this.blocks[id]; 237 var t = this.blocks[packet.id];
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-richards.js | 90 * priorities. Scheduling is done by maintaining a list of task control blocks 97 this.blocks = new Array(NUMBER_OF_IDS); 177 this.blocks[id] = this.currentTcb; 200 var tcb = this.blocks[id]; 237 var t = this.blocks[packet.id];
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-richards.js | 90 * priorities. Scheduling is done by maintaining a list of task control blocks 97 this.blocks = new Array(NUMBER_OF_IDS); 177 this.blocks[id] = this.currentTcb; 200 var tcb = this.blocks[id]; 237 var t = this.blocks[packet.id];
|
/external/chromium_org/v8/benchmarks/ |
H A D | richards.js | 95 * priorities. Scheduling is done by maintaining a list of task control blocks 102 this.blocks = new Array(NUMBER_OF_IDS); 182 this.blocks[id] = this.currentTcb; 205 var tcb = this.blocks[id]; 242 var t = this.blocks[packet.id];
|
/external/kernel-headers/original/uapi/linux/ |
H A D | v4l2-subdev.h | 154 __u32 blocks; member in struct:v4l2_subdev_edid
|
/external/chromium_org/v8/src/ |
H A D | hydrogen-environment-liveness.cc | 16 block_count_(graph->blocks()->length()), 163 // blocks in reverse order and walk backwards through each block. We 178 HBasicBlock* block = graph()->blocks()->at(block_id); 210 HBasicBlock* block = graph()->blocks()->at(block_id);
|
H A D | hydrogen-escape-analysis.cc | 42 int block_count = graph()->blocks()->length(); 44 HBasicBlock* block = graph()->blocks()->at(i); 160 // over affected basic blocks. All non-escaping instructions are handled 164 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone()); 166 // Iterate all blocks starting with the allocation block, since the 167 // allocation cannot dominate blocks that come before. 169 for (int i = start; i < graph()->blocks()->length(); i++) { 170 HBasicBlock* block = graph()->blocks()->at(i); 173 // Skip blocks that are not dominated by the captured allocation. 250 // Propagate the block state forward to all successor blocks [all...] |
/external/emma/core/java12/com/vladium/emma/data/ |
H A D | MethodDescriptor.java | 32 // blocks for block coverage reporting 219 final int [] blocks = (int []) m_lineMap.get (lines [l]); 220 for (int bl = 0; bl < blocks.length; ++ bl) 223 s.append (blocks [bl]);
|
/external/qemu/distrib/ext4_utils/src/ |
H A D | allocate.c | 205 /* Marks a the first num_blocks blocks in a block group as used, and accounts 253 /* Reduces an existing allocation by len blocks by return the last blocks 254 to the free pool in their block group. Assumes that the blocks being 312 error("failed to reserve %u blocks in block group %u\n", bg->header_blocks, i); 351 error("failed to reserve %u blocks in block group %u\n", len, bg_num); 395 error("failed to allocate %d blocks in block group %d", allocate_len, found_bg); 406 error("failed to allocate %u blocks, out of space?", len); 438 /* Allocate len blocks. The blocks ma 591 reserve_oob_blocks(struct block_allocation *alloc, int blocks) argument 609 advance_list_ptr(struct region_list *list, int blocks) argument 631 advance_blocks(struct block_allocation *alloc, int blocks) argument 636 advance_oob_blocks(struct block_allocation *alloc, int blocks) argument [all...] |
/external/libpcap/ |
H A D | optimize.c | 123 struct block **blocks; variable in typeref:struct:block 1607 blocks[i]->in_edges = 0; 1768 blocks[i]->link = 0; 1773 if (!isMarked(blocks[i])) 1776 if (!isMarked(blocks[j])) 1778 if (eq_blk(blocks[i], blocks[j])) { 1779 blocks[i]->link = blocks[j]->link ? 1780 blocks[ [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/x86/ |
H A D | idctllm_sse2.asm | 82 ; store blocks back out 115 ; special case when 2 blocks have 0 or 1 coeffs 311 ; Load up predict blocks 338 ; store blocks back out 370 ; special case when 2 blocks have 0 or 1 coeffs 385 ; Load up predict blocks 417 ; store blocks back out 447 ; special case when 2 blocks have 0 or 1 coeffs 648 ; Load up predict blocks 681 ; store blocks bac [all...] |
/external/libvpx/libvpx/vp8/common/x86/ |
H A D | idctllm_sse2.asm | 82 ; store blocks back out 115 ; special case when 2 blocks have 0 or 1 coeffs 311 ; Load up predict blocks 338 ; store blocks back out 370 ; special case when 2 blocks have 0 or 1 coeffs 385 ; Load up predict blocks 417 ; store blocks back out 447 ; special case when 2 blocks have 0 or 1 coeffs 648 ; Load up predict blocks 681 ; store blocks bac [all...] |
/external/deqp/modules/gles31/functional/ |
H A D | es31fSSBOLayoutCase.cpp | 207 std::vector<BlockLayoutEntry> blocks; member in class:deqp::gles31::bb::BufferLayout 228 for (int ndx = 0; ndx < (int)blocks.size(); ndx++) 230 if (blocks[ndx].name == name) 320 for (int ndx = 0; ndx < (int)layout.blocks.size(); ndx++) 322 if (layout.blocks[ndx].name == name) 472 // choosen only for blocks that have std140 layout. 696 int activeBlockNdx = (int)layout.blocks.size(); 713 layout.blocks.push_back(BlockLayoutEntry()); 714 BlockLayoutEntry& blockEntry = layout.blocks.back(); 784 const int numBlocks = (int)layout.blocks [all...] |