| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
| statvfs.h | 30 typedef __fsblkcnt_t fsblkcnt_t; /* Type to count file system blocks. */
39 typedef __fsblkcnt64_t fsblkcnt_t; /* Type to count file system blocks. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
| statvfs.h | 30 typedef __fsblkcnt_t fsblkcnt_t; /* Type to count file system blocks. */
39 typedef __fsblkcnt64_t fsblkcnt_t; /* Type to count file system blocks. */
|
| /system/core/libsparse/ |
| backed_block.c | 203 /* Blocks are of different types */
208 /* Blocks are not adjacent */
237 /* Blocks are compatible and adjacent, with a before b. Merge b into a,
262 /* Optimization: blocks are mostly queued in sequence, so save the
287 /* Queues a fill block of memory to be written to the specified data blocks */
305 /* Queues a block of memory to be written to the specified data blocks */
323 /* Queues a chunk of a file on disk to be written to the specified data blocks */
342 /* Queues a chunk of a fd to be written to the specified data blocks */
|
| /external/chromium_org/third_party/jinja2/ |
| runtime.py | 53 def new_context(environment, template_name, blocks, vars=None,
70 return Context(environment, parent, template_name, blocks)
80 blocks = self.__context.blocks[name]
81 return BlockReference(name, self.__context, blocks, 0)
110 'name', 'blocks', '__weakref__')
112 def __init__(self, environment, parent, name, blocks):
120 # create the initial mapping of blocks. Whenever template inheritance
121 # takes place the runtime will update this mapping with the new blocks
123 self.blocks = dict((k, [v]) for k, v in iteritems(blocks)
[all...] |
| /external/e2fsprogs/misc/ |
| tune2fs.8.in | 37 .I reserved-blocks-percentage
45 .I reserved-blocks-count
173 filesystem blocks. This is the number of blocks read or written to disk
183 filesystem blocks per stripe. This is typically be stride-size * N, where
240 Set the group which can use the reserved filesystem blocks.
312 megabytes. The size of the journal must be at least 1024 filesystem blocks
313 (i.e., 1MB if using 1k blocks, 4MB if using 4k blocks, etc.)
314 and may be no more than 102,400 filesystem blocks
[all...] |
| mke2fs.c | 116 "\t[-m reserved-blocks-percentage] [-o creator-os]\n"
117 "\t[-g blocks-per-group] [-L volume-label] "
120 "\t[-T fs-type] [-U UUID] [-jnqvFKSV] device [blocks-count]\n"),
178 * Reads the bad blocks list from a file
196 _("while reading in list of bad blocks from file"));
225 _("while processing list of bad blocks from program"));
254 fprintf(stderr, _("Blocks %u through %u must be good "
263 * See if any of the bad blocks are showing up in the backup
278 " bad blocks.\n\n"),
291 * Mark all the bad blocks as used..
2027 __u64 blocks; local
2256 unsigned long blocks = fs->super->s_blocks_count; local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 27 /// getExitingBlocks - Return all blocks inside the loop that have successors
28 /// outside of the loop. These are the blocks _inside of the current loop_
34 // Sort the blocks vector so that we can use binary search to do quick
62 /// getExitBlocks - Return all of the successor blocks of this loop. These
63 /// are the blocks _outside of the current loop_ which are branched to.
68 // Sort the blocks vector so that we can use binary search to do quick
98 // Sort the blocks vector so that we can use binary search to do quick
201 assert((Blocks.empty() || LIB[getHeader()] == this) &&
213 L->Blocks.push_back(NewBB);
239 assert(!Blocks.empty() && "Loop header is missing")
[all...] |
| /external/srec/portable/src/ |
| pmemfixed.c | 36 of free memory blocks of a fixed size. The memory pools are ordered in increasing block
37 size, eg. pool # 0 contains 4 byte memory blocks, pool # 1 contains 8, etc. Each memory
43 blocks large enough to satisfy the request. The memory manager removes a block from the
44 linked list and returns the address of the memory block body. If there are no blocks
45 available in the pool, then more blocks are created (if there is memory available); the
46 number created is configurable. If it is not possible to create more blocks, then the
53 (each contain the initial number defined in the code) and b) to create extra memory blocks
56 further requests to the system for more memory (to create more fixed memory blocks); this
58 that once memory blocks have been added to a memory pool they cannot be removed and reused
60 order to create smaller 4 byte blocks in the 4byte block pool
[all...] |
| /external/grub/stage2/ |
| fsys_reiserfs.c | 55 __u32 s_block_count; /* blocks count */
56 __u32 s_free_blocks; /* free blocks count */
61 __u32 s_journal_trans_max; /* max number of blocks in a transaction. */
63 __u32 s_journal_max_batch; /* max number of blocks to batch into a trans */
72 __u16 s_bmap_nr; /* amount of bitmap blocks needed to address each block of file system */
92 __u32 j_realblock[JOURNAL_TRANS_HALF]; /* real locations for the first blocks */
100 __u32 j_realblock[JOURNAL_TRANS_HALF]; /* real locations for the last blocks */
101 char j_digest[16]; /* md5 sum of all the blocks involved, including desc and commit. not used, kill it */
107 fully flushed means all the log blocks and all the real blocks ar
337 unsigned int blocks[MAX_HEIGHT]; member in struct:fsys_reiser_info
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda"
172 // Returns the length measured in 4-byte blocks that will be used to
244 // other blocks.
300 // set of blocks and a map of edges between blocks. This is the only GCOV
301 // object users can construct, the blocks and lines will be rooted here.
312 Blocks[BB] = new GCOVBlock(i++, os);
332 DeleteContainerSeconds(Blocks);
337 return *Blocks[BB];
345 // Emit count of blocks
[all...] |
| /external/valgrind/main/memcheck/ |
| mc_malloc_wrappers.c | 63 /*--- Tracking malloc'd and free'd blocks ---*/
68 /* Record malloc'd blocks. */
83 /* Records blocks after freeing. */
84 /* Blocks freed by the client are queued in one of two lists of
85 freed blocks not yet physically freed:
86 "big blocks" freed list.
87 "small blocks" freed list
88 The blocks with a size >= MC_(clo_freelist_big_blocks)
89 are linked in the big blocks freed list.
90 This allows a client to allocate and free big blocks
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 41 STATISTIC(NumDeadBlocks, "Number of dead blocks removed");
249 // Tail Merging of Blocks
302 /// ComputeCommonTailLength - Given two machine basic blocks, compute the number
518 /// ProfitableToMerge - Check if two machine basic blocks have a common tail
546 // If one of the blocks can be completely merged and happens to be in
549 // TODO: If the blocks are not adjacent, move one of them so that they are?
555 // If both blocks have an unconditional branch temporarily stripped out,
582 /// ComputeSameTails - Look through all the blocks in MergePotentials that have
585 /// in common of any pair of these blocks. SameTails entries contain an
590 /// those blocks appear in MergePotentials (where they are not necessaril
[all...] |
| /external/genext2fs/ |
| genext2fs.c | 22 // Bugfix: fill blocks with inodes
30 // 03 Aug 2000 Bugfix: ind. blocks endian swap
49 // number of blocks per group should be a
160 /* Percentage of blocks that are reserved.*/
166 /* The field i_blocks in the ext2 inode stores the number of data blocks
168 INOBLK is the number of such blocks in an actual disk block */
175 #define EXT2_BAD_INO 1 // Bad blocks inode
190 #define EXT2_NDIR_BLOCKS 11 // direct blocks
445 udecl32(s_blocks_count) /* Count of blocks in the filesystem */ \
446 udecl32(s_r_blocks_count) /* Count of the number of reserved blocks */ \
[all...] |
| /art/test/003-omnibus-opcodes/src/ |
| Switch.java | 3 * Test switch() blocks
|
| /build/target/board/vbox_x86/ |
| disk_layout.conf | 7 # 1008 blocks (1k each) (1032192 bytes) / cylinder
|
| /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...] |
| /dalvik/tests/003-omnibus-opcodes/src/ |
| Switch.java | 3 * Test switch() blocks
|
| /dalvik/vm/compiler/codegen/arm/ |
| README.txt | 10 /* Architectural independent building blocks */
|
| /development/apps/SettingInjectorSample/src/com/example/android/injector/ |
| FailingInjectorService.java | 31 * a "Unfortunately, My Setting Activity! has stopped" dialog to appear and also blocks the
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| scopes.rb | 225 example "parsing nested declaration blocks" do
246 example "parsing a deeply nested set of blocks with rule e" do
255 example "parsing a deeply nested set of blocks with rule f" do
264 example "parsing a 2-level nested set of blocks with rule f" do
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_matrix.h | 42 // matrix whose rows and columns are divided into blocks. For example
49 // has row blocks of size 5 and 4, and column blocks of size 3, 4 and
124 // all row blocks and column block sizes respectively.
|
| compressed_col_sparse_matrix_utils.h | 57 // Given a set of blocks and a permutation of these blocks, compute
59 // size sum(blocks).
60 void BlockOrderingToScalarOrdering(const vector<int>& blocks,
|
| problem_impl.h | 171 // The mapping from user pointers to parameter blocks.
174 // The actual parameter and residual blocks.
177 // When removing residual and parameter blocks, cost/loss functions and
180 // residual or parameter blocks, buffer them until destruction.
|
| program.h | 60 // The ordered parameter and residual blocks for the program.
71 // false and the state of the parameter blocks cannot be trusted.
114 // A human-readable dump of the parameter blocks for debugging.
115 // TODO(keir): If necessary, also dump the residual blocks.
|
