| /external/chromium_org/third_party/leveldatabase/src/include/leveldb/ |
| options.h | 19 // DB contents are stored in a set of blocks, each of which holds a
92 // Control over blocks (user data is stored in a set of blocks, and
95 // If non-NULL, use the specified cache for blocks.
115 // Compress blocks using the specified compression algorithm. This
|
| /external/harfbuzz_ng/src/ |
| gen-indic-table.py | 6 print >>sys.stderr, "usage: ./gen-indic-table.py IndicSyllabicCategory.txt IndicMatraCategory.txt Blocks.txt"
13 blocks = {} variable
41 blocks[t] = (start, end)
69 print " * ./gen-indic-table.py IndicSyllabicCategory.txt IndicMatraCategory.txt Blocks.txt"
158 (start, end) = blocks[block]
|
| /external/lzma/C/ |
| XzIn.c | 51 ADD_SIZE_CHECH(size, p->blocks[i].unpackSize);
60 ADD_SIZE_CHECH(size, (p->blocks[i].totalSize + 3) & ~(UInt64)3);
98 p->blocks = alloc->Alloc(alloc, sizeof(CXzBlockSizes) * numBlocks);
99 if (p->blocks == 0)
103 CXzBlockSizes *block = &p->blocks[i];
|
| /external/markdown/markdown/extensions/ |
| 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:
|
| /external/yaffs2/yaffs2/ |
| yaffs_checkptrw.c | 28 (TSTR("checkpt blocks available = %d" TENDSTR),
45 T(YAFFS_TRACE_CHECKPOINT,(TSTR("checking blocks %d to %d"TENDSTR),
89 T(YAFFS_TRACE_CHECKPOINT,(TSTR("out of checkpt blocks"TENDSTR)));
117 T(YAFFS_TRACE_CHECKPOINT,(TSTR("found no more checkpt blocks"TENDSTR)));
152 /* Erase all the blocks in the checkpoint area */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
| nfs_prot.x | 123 unsigned blocks; /* Kb of disk used by file */
283 unsigned blocks; /* total blocks in file system */
284 unsigned bfree; /* free blocks in fs */
285 unsigned bavail; /* free blocks avail to non-superuser */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/ |
| quota.h | 50 * Convert diskblocks to blocks and the other way around.
57 * Convert count of filesystem blocks to diskquota blocks, meant
157 u_int64_t dqb_bhardlimit; /* absolute limit on disk quota blocks alloc */
158 u_int64_t dqb_bsoftlimit; /* preferred limit on disk quota blocks */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| nfs_prot.x | 123 unsigned blocks; /* Kb of disk used by file */
283 unsigned blocks; /* total blocks in file system */
284 unsigned bfree; /* free blocks in fs */
285 unsigned bavail; /* free blocks avail to non-superuser */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
| quota.h | 50 * Convert diskblocks to blocks and the other way around.
57 * Convert count of filesystem blocks to diskquota blocks, meant
157 u_int64_t dqb_bhardlimit; /* absolute limit on disk quota blocks alloc */
158 u_int64_t dqb_bsoftlimit; /* preferred limit on disk quota blocks */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| nfs_prot.x | 123 unsigned blocks; /* Kb of disk used by file */
283 unsigned blocks; /* total blocks in file system */
284 unsigned bfree; /* free blocks in fs */
285 unsigned bavail; /* free blocks avail to non-superuser */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
| quota.h | 50 * Convert diskblocks to blocks and the other way around.
57 * Convert count of filesystem blocks to diskquota blocks, meant
157 u_int64_t dqb_bhardlimit; /* absolute limit on disk quota blocks alloc */
158 u_int64_t dqb_bsoftlimit; /* preferred limit on disk quota blocks */
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/ |
| heap.py | 50 # Inheirtable class which wraps an mmap, and from which blocks can be allocated
104 # list of pending blocks to free - see free() comment below
181 # Free all the blocks in the pending list - called with the lock held.
196 # immediately, the block is added to a list of blocks to be freed
203 # pending blocks to free
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/multiprocessing/ |
| heap.py | 50 # Inheirtable class which wraps an mmap, and from which blocks can be allocated
104 # list of pending blocks to free - see free() comment below
181 # Free all the blocks in the pending list - called with the lock held.
196 # immediately, the block is added to a list of blocks to be freed
203 # pending blocks to free
|
| /frameworks/base/core/java/android/nfc/tech/ |
| MifareClassic.java | 36 * blocks. Block size is always 16 bytes ({@link #BLOCK_SIZE}. Sector size varies.
38 * <li>MIFARE Classic Mini are 320 bytes ({@link #SIZE_MINI}), with 5 sectors each of 4 blocks.
39 * <li>MIFARE Classic 1k are 1024 bytes ({@link #SIZE_1K}), with 16 sectors each of 4 blocks.
40 * <li>MIFARE Classic 2k are 2048 bytes ({@link #SIZE_2K}), with 32 sectors each of 4 blocks.
41 * <li>MIFARE Classic 4k} are 4096 bytes ({@link #SIZE_4K}). The first 32 sectors contain 4 blocks
42 * and the last 8 sectors contain 16 blocks.
103 /** Tag contains 16 sectors, each with 4 blocks. */
105 /** Tag contains 32 sectors, each with 4 blocks. */
108 * Tag contains 40 sectors. The first 32 sectors contain 4 blocks and the last 8 sectors
109 * contain 16 blocks
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 154 // Remember the basic blocks which define new values for the alloca
229 /// blocks multiple times when promoting many allocas in the same block.
311 /// The set of basic blocks the renamer has already visited.
315 /// Contains a stable numbering of basic blocks to avoid non-determinstic
446 // If the load and store are in different blocks, use BB dominance to
515 // The trickiest case to handle is when we have large blocks. Because of this,
516 // this code is optimized assuming that large blocks happen. This does not
684 // the standard SSA construction algorithm. Determine which blocks need PHI
703 // Walks all basic blocks in the function performing the SSA rename algorithm
724 // unreachable basic blocks that were not processed by walking the dominato
[all...] |
| LoopSimplify.cpp | 18 // Loop exit-block insertion guarantees that all exit blocks from the loop
19 // (blocks which are outside of the loop that have predecessors inside of the
31 // Note that the simplifycfg pass will clean up blocks which are split out but
65 STATISTIC(NumInserted, "Number of pre-header or exit blocks inserted");
149 // Check to see that no blocks (other than the header) in this loop have
151 // loops, but can occur if the blocks are unreachable. Since they are
184 // If there are exiting blocks with branches on undef, resolve the undef in
221 // loop preheader/header will dominate the exit blocks. If the exit block has
339 // (spliting edges doesn't count). If blocks, CFG edges, or other values
415 /// blocks. This method is used to split exit blocks that have predecessor
[all...] |
| /dalvik/vm/analysis/ |
| VfyBasicBlock.cpp | 145 * Add ourselves to the predecessor list in all blocks we might transfer
240 * Dump the contents of the basic blocks.
248 ALOGI("Basic blocks for %s.%s:%s", vdata->method->clazz->descriptor,
291 * Generate a list of basic blocks and related information.
312 ALOGI("Basic blocks for %s.%s:%s",
336 * Not all methods have "try" blocks. If this one does, we init tryEnd
359 /* no more try blocks in this method */
437 * target. Note we've tagged exception catch blocks as such.
532 * Free the storage used by basic blocks.
|
| /external/chromium_org/third_party/libxml/src/ |
| genUnicode.py | 7 # NOTE: there is an 'alias' facility for blocks which are not present in
17 sources = "Blocks-4.0.1.txt UnicodeData-4.0.1.txt"
38 # Now process the "blocks" file, reducing it to a dictionary
44 blocks = open(blockfile, "r") variable
49 for line in blocks.readlines():
70 blocks.close()
71 print "Parsed %d blocks descriptions" % (len(BlockNames.keys()))
83 print "Alias %s: %s not in Blocks" % (alias[0], comp)
146 blocks.close()
|
| /external/e2fsprogs/po/ |
| e2fsprogs.pot | 84 msgid "while sanity checking the bad blocks inode"
88 msgid "while reading the bad blocks inode"
106 msgid "while reading in list of bad blocks from file"
166 msgid "Illegal number of blocks!\n"
366 msgid "<The bad blocks inode>"
518 msgid "reading indirect blocks of inode %u"
647 msgid "Clone multiply-claimed blocks"
727 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
788 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
789 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| zh_CN.po | 83 msgid "while sanity checking the bad blocks inode"
87 msgid "while reading the bad blocks inode"
105 msgid "while reading in list of bad blocks from file"
165 msgid "Illegal number of blocks!\n"
366 msgid "<The bad blocks inode>"
518 msgid "reading indirect blocks of inode %u"
648 msgid "Clone multiply-claimed blocks"
731 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
791 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
792 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| /external/llvm/include/llvm/IR/ |
| BasicBlock.h | 60 /// container of instructions that execute sequentially. Basic blocks are Values
67 /// TerminatorInst's may not occur in the middle of basic blocks, and must
68 /// terminate the blocks. The BasicBlock class allows malformed basic blocks to
70 /// modifying a program. However, the verifier will ensure that basic blocks
72 class BasicBlock : public Value, // Basic blocks are data objects also
248 /// \brief Split the basic block into two basic blocks at the specified
257 /// Note that this only works on well formed basic blocks (must have a
262 /// Also note that this doesn't preserve any passes. To split blocks while
|
| /system/extras/ext4_utils/ |
| make_ext4fs.c | 71 Allocating blocks in the same block group as the file inode
329 u32 blocks = DIV_ROUND_UP(info.len, info.block_size); local
330 u32 block_groups = DIV_ROUND_UP(blocks, info.blocks_per_group);
344 u32 blocks = DIV_ROUND_UP(info.len, info.block_size); local
345 u32 block_groups = DIV_ROUND_UP(blocks, info.blocks_per_group);
536 printf(" Blocks per group: %d\n", info.blocks_per_group);
539 printf(" Journal blocks: %d\n", info.journal_blocks);
544 printf(" Blocks: %llu\n", aux_info.len_blocks);
599 printf("Created filesystem with %d/%d inodes and %d/%d blocks\n",
|
| /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...] |
| /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...] |
