Searched refs:blocks (Results 276 - 300 of 415) sorted by relevance

<<11121314151617

/external/mesa3d/src/gallium/drivers/radeonsi/
H A Dradeonsi_pipe.h57 /* linked list of preallocated blocks */
58 struct list_head blocks; member in struct:r600_pipe_fences
/external/mesa3d/src/gallium/include/pipe/
H A Dp_video_state.h177 short *blocks; member in struct:pipe_mpeg12_macroblock
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_fs_copy_propagation.cpp143 fs_bblock *block = cfg.blocks[b];
H A Dbrw_fs_cse.cpp182 fs_bblock *block = cfg.blocks[b];
/external/openssl/crypto/modes/
H A Dmodes_lcl.h124 u64 blocks; member in struct:ccm128_context
/external/qemu/distrib/ext4_utils/src/
H A Dmake_ext4fs.c72 Allocating blocks in the same block group as the file inode
347 u32 blocks = DIV_ROUND_UP(info.len, info.block_size); local
348 u32 block_groups = DIV_ROUND_UP(blocks, info.blocks_per_group);
362 u32 blocks = DIV_ROUND_UP(info.len, info.block_size); local
363 u32 block_groups = DIV_ROUND_UP(blocks, info.blocks_per_group);
560 printf(" Journal blocks: %d\n", info.journal_blocks);
620 printf("Created filesystem with %d/%d inodes and %d/%d blocks\n",
/external/emma/core/java12/com/vladium/emma/instr/
H A DInstrVisitor.java941 // split 'code' into an ordered list of basic blocks [O(block count) loops]:
944 if (trace2) m_log.trace2 ("visit", "method contains " + blockCount + " basic blocks");
946 final BlockList blocks = new BlockList (blockCount);
979 blocks.m_blocks.add (block);
1034 final Block [] _blocks = (Block []) blocks.m_blocks.toArray (new Block [blockCount]);
1077 blocks.m_header = new clinitHeader (this, localVarIndex);
1080 blocks.m_header = new methodHeader (this, localVarIndex);
1082 int headerMaxStack = blocks.m_header.maxstack ();
1109 if ($assert.ENABLED) $assert.ASSERT (blocks.m_header != null, "header not set");
1113 // assemble all blocks int
1465 EmitCtx(final BlockList blocks, final ByteArrayOStream out) argument
[all...]
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DFlowControl.pxd50 cdef public set blocks
/external/jemalloc/include/jemalloc/internal/
H A Dtsd.h116 ql_head_initializer(blocks), \
408 ql_head(tsd_init_block_t) blocks; member in struct:tsd_init_head_s
/external/kernel-headers/original/uapi/linux/
H A Dfuse.h142 uint64_t blocks; member in struct:fuse_attr
159 uint64_t blocks; member in struct:fuse_kstatfs
/external/llvm/include/llvm/Analysis/
H A DRegionInfo.h242 /// verify that all reachable basic blocks are elements of the region.
562 /// @brief Returns a range view of the basic blocks in the region.
563 inline block_range blocks() { function in class:llvm::Region
567 /// @brief Returns a range view of the basic blocks in the region.
570 inline const_block_range blocks() const { function in class:llvm::Region
716 /// @brief Find the smallest region that contains two basic blocks.
731 /// @brief Find the smallest region that contains a set of basic blocks.
733 /// @param BBs A vector of basic blocks.
734 /// @return The smallest region that contains all basic blocks in BBS.
/external/valgrind/main/memcheck/tests/
H A Dbig_blocks_freed_list.stderr.exp44 in use at exit: 1,000,000 bytes in 100 blocks
/external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/
H A Dmux_client_for_testing.py152 blocks = []
176 blocks.append(block)
189 blocks.append(block)
197 blocks.append(block)
205 blocks.append(block)
210 return blocks
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DTextAutosizer.cpp251 // Some blocks are not autosized even if their parent cluster wants them to.
909 // the container of position:absolute/fixed blocks, and those cannot exist between a cluster and
933 // Note: At this point clusters may not have been created for these blocks so we cannot rely
1018 BlockSet* blocks = fingerprintIt->value.get(); local
1019 for (BlockSet::iterator blockIt = blocks->begin(); blockIt != blocks->end(); ++blockIt) {
1060 BlockSet& blocks = *blocksIter->value;
1061 blocks.remove(toRenderBlock(renderer));
1062 if (blocks.isEmpty())
/external/e2fsprogs/e2fsck/
H A Dpass5.c138 * We can discard only blocks containing only unused
199 unsigned int blocks = 0; local
355 * When the compare data blocks in block bitmap
367 blocks = fs->super->s_clusters_per_group - 1;
441 blocks ++;
442 if ((blocks == fs->super->s_clusters_per_group) ||
457 blocks = 0;
493 blocks = 0; free_blocks = 0; group_free = 0; group = 0;
H A Drehash.c24 * blocks. This pretty much requires an incremental approach, where
30 * yet available, blocks from the beginning part of the old directory
224 int blocks)
229 new_mem = realloc(outdir->buf, blocks * fs->blocksize);
234 blocks * sizeof(ext2_dirhash_t));
239 outdir->buf = malloc(blocks * fs->blocksize);
240 outdir->hashes = malloc(blocks * sizeof(ext2_dirhash_t));
243 outdir->max = blocks;
569 /* Write out the pointer blocks */
651 * In theory, we only release blocks fro
223 alloc_size_dir(ext2_filsys fs, struct out_dir *outdir, int blocks) argument
[all...]
/external/chromium_org/v8/src/compiler/
H A Dinstruction-selector.cc31 BasicBlockVector* blocks = schedule()->rpo_order(); local
32 for (BasicBlockVectorIter i = blocks->begin(); i != blocks->end(); ++i) {
51 for (BasicBlockVectorRIter i = blocks->rbegin(); i != blocks->rend(); ++i) {
56 for (BasicBlockVectorIter i = blocks->begin(); i != blocks->end(); ++i) {
/external/lldb/source/Symbol/
H A DSymbolContext.cpp270 std::vector<Block *> blocks; local
271 blocks.push_back (block);
276 blocks.push_back (parent_block);
280 std::vector<Block *>::reverse_iterator begin = blocks.rbegin();
281 std::vector<Block *>::reverse_iterator end = blocks.rend();
361 // Dump the block and pass it a negative depth to we print all the parent blocks
466 // this block or one of this blocks parents is an inlined function.
477 // If we get here we weren't able to find the return line entry using the nesting of the blocks and
/external/chromium_org/v8/src/
H A Dlithium.cc279 HBasicBlock* block = graph_->blocks()->at(block_id);
301 LPhase phase("L_Mark empty blocks", this);
302 for (int i = 0; i < graph()->blocks()->length(); ++i) {
303 HBasicBlock* block = graph()->blocks()->at(i);
/external/deqp/modules/gles3/functional/
H A Des3fTextureWrapTests.cpp228 // Create ASTC texture by picking from a set of pre-generated blocks.
231 static const deUint8 blocks[][BLOCK_SIZE] = local
233 // \note All of the following blocks are valid in LDR mode.
244 if (!isASTCSupported(m_renderCtxInfo)) // \note Any level of ASTC support is enough, since we're only using LDR blocks.
254 deMemcpy(&data[i*BLOCK_SIZE], &blocks[rnd.getInt(0, DE_LENGTH_OF_ARRAY(blocks)-1)][0], BLOCK_SIZE);
/external/valgrind/main/exp-sgcheck/
H A Dsg_main.c166 /* Hopefully the .base test hits most of the time. For the blocks
298 identical blocks are claimed to have different sizes. In which
317 /* This makes the blocks identical, at the size of the
322 stage will get rid of one of the blocks. This is
331 /* If there are any blocks which overlap and have the same
348 "overlapping stack blocks\n");
384 XArray* blocks = VG_(di_get_stack_blocks_at_ip)( ip, True/*arrays only*/ ); local
385 tl_assert(blocks);
386 return StackBlocks__find_and_dealloc__or_add( blocks );
559 overlapping stack blocks
1185 XArray* blocks; /* XArray* of StackBlock, or NULL if none */ member in struct:__anon32813
1486 calculate_StackBlock_EAs( XArray* blocks, Addr sp, Addr fp ) argument
[all...]
/external/valgrind/main/none/tests/
H A Dcmdline2.stdout.exp57 heap blocks (in bytes). [not used by this tool]
82 --vgdb-poll=<number> gdbserver poll max every <number> basic blocks [5000]
137 heap blocks allocated for Valgrind internal use (in bytes) [4]
/external/chromium_org/net/http/
H A Dhttp_stream_parser_unittest.cc762 std::vector<std::string> blocks; local
765 blocks.push_back(response.substr(i, length));
769 for (std::vector<std::string>::size_type i = 0; i < blocks.size(); ++i)
770 get_runner.AddRead(blocks[i]);
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/
H A Dr600_pipe.c91 LIST_ADD(&block->head, &rscreen->fences.blocks);
93 block = LIST_ENTRY(struct r600_fence_block, rscreen->fences.blocks.next, head);
690 LIST_FOR_EACH_ENTRY_SAFE(entry, tmp, &rscreen->fences.blocks, head) {
984 LIST_INITHEAD(&rscreen->fences.blocks);
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Ddebugallocation.cc121 "If greater than 0, keep freed blocks in a queue instead of "
123 "the total size of all blocks in the queue would otherwise exceed "
156 // A circular buffer to hold freed blocks of memory. MallocBlock::Deallocate
157 // (below) pushes blocks into this queue instead of returning them to the
190 // Maximum number of blocks kept in the free queue before being freed.
315 // A queue of freed blocks. Instead of releasing blocks to the allocator
317 // to keep the total size of all the freed blocks below the limit set by
321 static size_t free_queue_size_; // total size of blocks in free_queue_
557 // recently freed blocks
765 MemoryStats(int* blocks, size_t* total, int histogram[kMallocHistogramSize]) argument
1044 MallocMemoryStats(int* blocks, size_t* total, int histogram[kMallocHistogramSize]) argument
[all...]

Completed in 1617 milliseconds

<<11121314151617