/system/core/sdcard/ |
fuse.h | 89 __u64 blocks; member in struct:fuse_attr 106 __u64 blocks; member in struct:fuse_kstatfs
|
/external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/ |
mux_client_for_testing.py | 152 blocks = [] 176 blocks.append(block) 189 blocks.append(block) 197 blocks.append(block) 205 blocks.append(block) 210 return blocks
|
/external/e2fsprogs/e2fsck/ |
rehash.c | 24 * 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 */
|
/external/wpa_supplicant_8/src/eap_common/ |
ikev2_common.c | 198 size_t i, blocks; local 208 blocks = len / 8; 210 for (i = 0; i < blocks; i++) { 257 size_t i, blocks; local 271 blocks = len / 8; 272 for (i = 0; i < blocks; i++) {
|
/art/compiler/dex/ |
mir_graph.cc | 176 GrowableArray<SuccessorBlockInfo*>::Iterator iterator(bottom_block->successor_block_list.blocks); 244 /* Identify code range in try blocks and set up the empty catch blocks */ 263 // Iterate over each of the handlers to enqueue the empty Catch blocks 322 * blocks. However, this 395 cur_block->successor_block_list.blocks = 408 cur_block->successor_block_list.blocks->Insert(successor_block_info); 436 cur_block->successor_block_list.blocks = 450 cur_block->successor_block_list.blocks->Insert(successor_block_info); 525 // If this is the first method, set up default entry and exit blocks [all...] |
/external/v8/src/ |
handles.cc | 51 int n = impl->blocks()->length(); 54 (isolate->handle_scope_data()->next - impl->blocks()->last())); 76 if (!impl->blocks()->is_empty()) { 77 Object** limit = &impl->blocks()->last()[kHandleBlockSize]; 89 // Add the extension to the global list of blocks, but count the 91 impl->blocks()->Add(result); [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
pyassem.py | 15 self.blocks = misc.Set() 16 self.blocks.add(self.entry) 17 self.blocks.add(self.exit) 47 # for unreachable blocks. That doesn't appear to be very common 55 self.blocks.add(b) 77 """Return the blocks in reverse postorder 85 return self.blocks.elements() 99 """Order blocks so that they are emitted in the right order""" 104 # - all reachable blocks must be emitted 107 # Find all the blocks to be emitted [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
pyassem.py | 15 self.blocks = misc.Set() 16 self.blocks.add(self.entry) 17 self.blocks.add(self.exit) 47 # for unreachable blocks. That doesn't appear to be very common 55 self.blocks.add(b) 77 """Return the blocks in reverse postorder 85 return self.blocks.elements() 99 """Order blocks so that they are emitted in the right order""" 104 # - all reachable blocks must be emitted 107 # Find all the blocks to be emitted [all...] |
/dalvik/vm/compiler/ |
SSATransformation.cpp | 36 dvmGrowableListIteratorInit(&block->successorBlockList.blocks, 49 /* Sort the blocks by the Depth-First-Search pre-order */ 128 /* Iterate through the dominated blocks first */ 151 * blocks. 174 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks, 380 * Iterate through all successor blocks and propagate up the live-in sets. 399 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks, 447 /* Calculate the phi blocks for each Dalvik register */ 467 * Iterate through the original blocks plus the new ones in 499 * predecessor blocks [all...] |
Frontend.cpp | 561 dvmGrowableListIteratorInit(&bottomBlock->successorBlockList.blocks, 727 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks, 757 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks, 814 dvmGrowableListIteratorInit(&predBB->successorBlockList.blocks, 841 /* Identify code range in try blocks and set up the empty catch blocks */ 857 /* Mark all the insn offsets in Try blocks */ 869 /* Iterate over each of the handlers to enqueue the empty Catch blocks */ 885 * Create dummy catch blocks first. Since these are created before 886 * other blocks are processed, "split" is specified as false [all...] |
CompilerIR.h | 160 const Method *containingMethod; // For blocks from the callee 162 bool needFallThroughBranch; // For blocks ended due to length limit 176 GrowableList blocks; member in struct:BasicBlock::__anon869 181 * The "blocks" field in "successorBlockList" points to an array of 183 * For catch blocks, key is type index for the exception. 184 * For swtich blocks, key is the case value.
|
/external/ceres-solver/internal/ceres/ |
problem_impl.cc | 114 // other parameter blocks. 143 // For dynamic problems, add the list of dependent residual blocks, which is 176 // references to it inside the problem (e.g. by any residual blocks). 232 << "Number of blocks input is different than the number of blocks " 235 // Check for duplicate parameter blocks. 242 string blocks; local 244 blocks += StringPrintf(" %p ", parameter_blocks[i]); 247 LOG(FATAL) << "Duplicate parameter blocks in a residual parameter " 249 << blocks << "]"; [all...] |
/external/libvpx/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
markdown.php | 26 # Define the width of a tab for code blocks. 319 # Turn block-level HTML blocks into hash entries 389 # Hashify HTML blocks: 444 # First, look for nested blocks, e.g.: 578 # begining in the Markdown function since hashed blocks can be part of 579 # list items and could have been indented. Indented blocks would have 588 # Run block gamut tranformations, without hashing HTML blocks. This is 589 # useful when HTML blocks are known to be already hashed, like in the first 596 # Finally form paragraph and restore hashed blocks. 1611 $blocks = explode("\\t", $line); variable [all...] |
/external/valgrind/main/exp-sgcheck/ |
sg_main.c | 166 /* 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:__anon29923 [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
tarfile.py | 68 BLOCKSIZE = 512 # length of processing blocks 270 blocks, remainder = divmod(length, BUFSIZE) 271 for b in xrange(blocks): 551 blocks, remainder = divmod(pos - self.pos, self.bufsize) 552 for i in xrange(blocks): 989 """Return a tar header as a string of 512 byte blocks. [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
tarfile.py | 68 BLOCKSIZE = 512 # length of processing blocks 270 blocks, remainder = divmod(length, BUFSIZE) 271 for b in xrange(blocks): 551 blocks, remainder = divmod(pos - self.pos, self.bufsize) 552 for i in xrange(blocks): 989 """Return a tar header as a string of 512 byte blocks. [all...] |
/dalvik/dx/src/com/android/dx/cf/code/ |
Ropper.java | 50 * blocks. 87 private final ByteBlockList blocks; field in class:Ropper 142 /** list of all blocks that jsr to this subroutine */ 144 /** List of all blocks that return from this subroutine */ 165 * @param retBlock one of the ret blocks (final blocks) of this 181 * Adds a label to the list of ret blocks (final blocks) for this 191 * Adds a label to the list of caller blocks for this subroutine. 200 * Generates a list of subroutine successors. Note: successor blocks [all...] |
/external/valgrind/main/none/tests/ |
cmdline2.stdout.exp | 55 heap blocks (in bytes). [not used by this tool] 72 --vgdb-poll=<number> gdbserver poll max every <number> basic blocks [5000] 114 heap blocks allocated for Valgrind internal use (in bytes) [4]
|
/bionic/libc/kernel/common/linux/ |
nfs_xdr.h | 50 __u32 blocks; member in struct:nfs_fattr::__anon486::__anon487 107 __u32 blocks; member in struct:nfs2_fsstat
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
nfs_prot.h | 87 u_int blocks; member in struct:fattr 248 u_int blocks; member in struct:statfsokres
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
nfs_prot.h | 87 u_int blocks; member in struct:fattr 248 u_int blocks; member in struct:statfsokres
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
nfs_prot.h | 87 u_int blocks; member in struct:fattr 248 u_int blocks; member in struct:statfsokres
|
/art/compiler/sea_ir/ir/ |
sea.cc | 205 // Pass: Find the start instruction of basic blocks 291 // The map @block maps registers to the blocks in which they are defined. 292 std::map<int, std::set<Region*> > blocks; local 314 blocks.insert(std::pair<int, std::set<Region*> >(reg_def, std::set<Region*>())); 315 std::set<Region*>* reg_def_blocks = &(blocks.find(reg_def)->second); 325 std::set<Region*> worklist((*(blocks.find(global))).second);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
r600_pipe.c | 91 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/ |
debugallocation.cc | 121 "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. Free only enough blocks to keep fro [all...] |