| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| quotaio_v2.h | 27 * to blocks of these structures.
55 __le32 dqi_blocks; /* Number of blocks in file */
75 #define V2_DQTREEOFF 1 /* Offset of tree in file in blocks */
77 #define V2_DQSTRINBLK ((V2_DQBLKSIZE - sizeof(struct v2_disk_dqdbheader)) / sizeof(struct v2_disk_dqblk)) /* Number of entries in one blocks */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| quotaio_v2.h | 27 * to blocks of these structures.
55 __le32 dqi_blocks; /* Number of blocks in file */
75 #define V2_DQTREEOFF 1 /* Offset of tree in file in blocks */
77 #define V2_DQSTRINBLK ((V2_DQBLKSIZE - sizeof(struct v2_disk_dqdbheader)) / sizeof(struct v2_disk_dqblk)) /* Number of entries in one blocks */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| quotaio_v2.h | 27 * to blocks of these structures.
55 __le32 dqi_blocks; /* Number of blocks in file */
75 #define V2_DQTREEOFF 1 /* Offset of tree in file in blocks */
77 #define V2_DQSTRINBLK ((V2_DQBLKSIZE - sizeof(struct v2_disk_dqdbheader)) / sizeof(struct v2_disk_dqblk)) /* Number of entries in one blocks */
|
| /external/qemu/ |
| arch_init.c | 122 block = QLIST_FIRST(&ram_list.blocks);
165 block = QLIST_FIRST(&ram_list.blocks);
185 QLIST_FOREACH(block, &ram_list.blocks, next) {
213 QLIST_FOREACH(block, &ram_list.blocks, next)
233 RAMBlock *block, *nblock, **blocks; local
236 QLIST_FOREACH(block, &ram_list.blocks, next) {
239 blocks = qemu_malloc(n * sizeof *blocks);
241 QLIST_FOREACH_SAFE(block, &ram_list.blocks, next, nblock) {
242 blocks[n++] = block
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| ext2_fs.h | 31 * Define EXT2_PREALLOCATE to preallocate data blocks for expanding files
45 #define EXT2_BAD_INO 1 /* Bad blocks inode */
137 * Structure of a blocks group descriptor
141 __u32 bg_block_bitmap; /* Blocks bitmap block */
144 __u16 bg_free_blocks_count; /* Free blocks count */
155 __u32 bg_block_bitmap; /* Blocks bitmap block */
158 __u16 bg_free_blocks_count; /* Free blocks count */
165 __u32 bg_block_bitmap_hi; /* Blocks bitmap block MSB */
168 __u16 bg_free_blocks_count_hi;/* Free blocks count MSB */
232 /* limits imposed by 16-bit value gd_free_{blocks,inode}_count *
[all...] |
| jfs_dat.h | 21 * Standard header for all descriptor blocks:
56 __u32 s_maxlen; /* total blocks in journal file */
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 146 ArrayList<SsaBasicBlock> blocks = result.getBlocks(); local
149 * New blocks are added to the end of the block list during
152 for (int i = blocks.size() - 1; i >= 0; i-- ) {
153 SsaBasicBlock block = blocks.get(i);
187 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
190 * New blocks are added to the end of the block list during
193 for (int i = blocks.size() - 1; i >= 0; i-- ) {
194 SsaBasicBlock block = blocks.get(i);
208 SsaBasicBlock predecessor = blocks.get(j);
232 ArrayList<SsaBasicBlock> blocks = result.getBlocks() local
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaConverter.java | 147 ArrayList<SsaBasicBlock> blocks = result.getBlocks(); local
150 * New blocks are added to the end of the block list during
153 for (int i = blocks.size() - 1; i >= 0; i-- ) {
154 SsaBasicBlock block = blocks.get(i);
188 ArrayList<SsaBasicBlock> blocks = ssaMeth.getBlocks(); local
191 * New blocks are added to the end of the block list during
194 for (int i = blocks.size() - 1; i >= 0; i-- ) {
195 SsaBasicBlock block = blocks.get(i);
209 SsaBasicBlock predecessor = blocks.get(j);
233 ArrayList<SsaBasicBlock> blocks = result.getBlocks() local
[all...] |
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| BasicBlock.java | 41 public static BasicBlock find(BasicBlock[] blocks, int pos)
44 for (int i = 0; i < blocks.length; i++) {
45 int iPos = blocks[i].position;
46 if (iPos <= pos && pos < iPos + blocks[i].length)
47 return blocks[i];
312 ArrayList blocks = new ArrayList();
320 blocks.add(prev);
329 blocks.add(prev);
355 blocks.add(bb);
360 return (BasicBlock[])blocks.toArray(makeArray(blocks.size()))
[all...] |
| Liveness.java | 34 public void compute(CodeIterator ci, TypedBlock[] blocks, int maxLocals,
38 computeUsage(ci, blocks, maxLocals);
40 useAllArgs(blocks, args);
42 computeLiveness1(blocks[0]);
43 while (hasChanged(blocks))
44 computeLiveness2(blocks[0]);
47 private void useAllArgs(TypedBlock[] blocks, TypeData[] args) {
48 for (int k = 0; k < blocks.length; k++) {
49 byte[] usage = blocks[k].localsUsage;
192 private boolean hasChanged(TypedBlock[] blocks) {
[all...] |
| /external/chromium_org/gpu/command_buffer/client/ |
| fenced_allocator.cc | 45 // Free blocks pending tokens.
57 // blocks first (for direct usage), first-fit, then in the FREE_PENDING_TOKEN
58 // blocks, waiting for them. The current implementation isn't smart about
79 // No free block is available. Look for blocks pending tokens, and wait for
116 // Gets the max of the size of the blocks marked as free.
128 // Gets the size of the largest segment of blocks that are either FREE or
148 // - there are no contiguous FREE blocks (they should have been collapsed).
166 // Returns false if all blocks are actually FREE, in which
173 // structure is consistent, those are the only blocks eligible for collapse.
204 // Frees any blocks pending a token for which the token has been read
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-alloc.cc | 162 // Tests memory management in a CodeRange by allocating and freeing blocks,
195 List<Block> blocks(1000);
212 blocks.Add(Block(base, static_cast<int>(allocated)));
217 int index = Pseudorandom() % blocks.length();
218 code_range.FreeRawMemory(blocks[index].base, blocks[index].size);
219 current_allocated -= blocks[index].size;
220 if (index < blocks.length() - 1) {
221 blocks[index] = blocks.RemoveLast()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 1 //===--------- LoopIterator.h - Iterate over loop blocks --------*- C++ -*-===//
9 // This file defines iterators to visit the basic blocks within a loop.
11 // These iterators currently visit blocks within subloops as well.
15 // If you want to visit all blocks in a loop and don't need an ordered traveral,
19 // backedge has been deleted. The only prerequisite is that all blocks
34 /// Store the result of a depth first search within basic blocks contained by a
63 /// Traverse the loop blocks and store the DFS result.
66 /// Return true if postorder numbers are assigned to all loop blocks.
69 /// Iterate over the cached postorder blocks.
76 /// Reverse iterate over the cached postorder blocks
[all...] |
| /external/v8/test/cctest/ |
| test-alloc.cc | 178 // Tests memory management in a CodeRange by allocating and freeing blocks,
212 List<Block> blocks(1000);
227 blocks.Add(Block(base, static_cast<int>(allocated)));
232 int index = Pseudorandom() % blocks.length();
233 code_range->FreeRawMemory(blocks[index].base, blocks[index].size);
234 current_allocated -= blocks[index].size;
235 if (index < blocks.length() - 1) {
236 blocks[index] = blocks.RemoveLast()
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen.cc | 240 // boundaries of basic blocks.
352 // Textbook implementation of a basic block generator. All basic blocks
365 SANDBOX_DIE("Internal compiler error; cannot compute basic blocks");
418 // basic block and any blocks referenced by this block. This function can be
420 // blocks in STL containers; this gives an easy option to use STL to find
421 // shared tail sequences of basic blocks.
424 const TargetsToBlocks& blocks) {
432 // We compare the sequence of instructions in both basic blocks.
439 // both basic blocks, we know the relative ordering between the two blocks
[all...] |
| basicblock.h | 19 // identify common sequences of basic blocks. This would normally be
38 // Basic blocks are essentially nothing more than a set of instructions.
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| two_level_iterator.h | 15 // index iterator whose values point to a sequence of blocks where
18 // in the sequence of blocks. Takes ownership of "index_iter" and
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| arena.h | 41 // Array of new[] allocated memory blocks
44 // Bytes of memory in blocks allocated so far
|
| /external/clang/test/Sema/ |
| block-sentinel-attribute.c | 6 void (^bbad) (int arg, const char * format) __attribute__ ((__sentinel__)) ; // expected-warning {{'sentinel' attribute only supported for variadic blocks}}
7 bbad = ^void (int arg, const char * format) __attribute__ ((__sentinel__)) {} ; // expected-warning {{'sentinel' attribute only supported for variadic blocks}}
|
| /external/dropbear/libtomcrypt/src/modes/lrw/ |
| lrw_decrypt.c | 15 LRW_MODE implementation, Decrypt blocks, Tom St Denis
21 LRW decrypt blocks
|
| lrw_encrypt.c | 15 LRW_MODE implementation, Encrypt blocks, Tom St Denis
21 LRW encrypt blocks
|
| /external/e2fsprogs/e2fsck/ |
| extend.c | 3 * number of blocks.
43 fprintf(stderr, _("Illegal number of blocks!\n"));
|
| /external/e2fsprogs/tests/f_badprimary/ |
| expect.1 | 3 Pass 1: Checking inodes, blocks, and sizes
26 test_filesys: 11/32 files (0.0% non-contiguous), 22/100 blocks
|
| /external/e2fsprogs/tests/f_dup_de/ |
| expect-nohtree.1 | 1 Pass 1: Checking inodes, blocks, and sizes
30 test_filesys: 18/2048 files (5.6% non-contiguous), 324/330 blocks
|
| expect.1 | 1 Pass 1: Checking inodes, blocks, and sizes
27 test_filesys: 18/2048 files (5.6% non-contiguous), 324/330 blocks
|
