| /system/update_engine/payload_generator/ |
| mapfile_filesystem.h | 19 // be generated at the same time with the list of files and the 4K-blocks where
57 // The number of blocks in the filesystem.
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| BlockAddresses.java | 27 * the blocks of a particular method. Each block has a corresponding
50 BasicBlockList blocks = method.getBlocks(); local
51 int maxLabel = blocks.getMaxLabel();
127 BasicBlockList blocks = method.getBlocks(); local
128 int sz = blocks.size();
131 BasicBlock one = blocks.get(i);
|
| /external/clang/test/OpenMP/ |
| task_private_codegen.cpp | 5 // RUN: %clang_cc1 -verify -fopenmp -x c++ -fblocks -DBLOCKS -triple x86_64-apple-darwin10 -emit-llvm %s -o - | FileCheck -check-prefix=BLOCKS %s
89 #elif defined(BLOCKS)
90 // BLOCKS: [[G:@.+]] = global double
91 // BLOCKS-LABEL: @main
92 // BLOCKS: call void {{%.+}}(i8
94 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
95 // BLOCKS: [[RES:%.+]] = call i8* @__kmpc_omp_task_alloc(%{{[^ ]+}} @{{[^,]+}}, i32 %{{[^,]+}}, i32 1, i64 56, i64 1, i32 (i32, i8*)* bitcast (i32 (i32, %{{[^*]+}}*)* [[TASK_ENTRY:@[^ ]+]] to i32 (i32, i8*)*))
96 // BLOCKS: [[PRIVATES:%.+]] = getelementptr inbounds %{{.+}}, %{{.+}}* %{{.+}}, i{{.+}} 0, i{{.+}} 1
97 // BLOCKS: call i32 @__kmpc_omp_task(%{{.+}}* @{{.+}}, i32 %{{.+}}, i8* [[RES]])
98 // BLOCKS: re
[all...] |
| taskloop_private_codegen.cpp | 5 // RUN: %clang_cc1 -verify -fopenmp -x c++ -fblocks -DBLOCKS -triple x86_64-apple-darwin10 -emit-llvm %s -o - | FileCheck -check-prefix=BLOCKS %s
89 #elif defined(BLOCKS)
90 // BLOCKS: [[G:@.+]] = global double
91 // BLOCKS-LABEL: @main
92 // BLOCKS: call void {{%.+}}(i8
94 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
95 // BLOCKS: [[RES:%.+]] = call i8* @__kmpc_omp_task_alloc(%{{[^ ]+}} @{{[^,]+}}, i32 %{{[^,]+}}, i32 1, i64 88, i64 1, i32 (i32, i8*)* bitcast (i32 (i32, %{{[^*]+}}*)* [[TASK_ENTRY:@[^ ]+]] to i32 (i32, i8*)*))
96 // BLOCKS: [[PRIVATES:%.+]] = getelementptr inbounds %{{.+}}, %{{.+}}* %{{.+}}, i{{.+}} 0, i{{.+}} 1
97 // BLOCKS: call void @__kmpc_taskloop(%{{.+}}* @{{.+}}, i32 %{{.+}}, i8* [[RES]], i32 1, i64* %{{.+}}, i64* %{{.+}}, i64 %{{.+}}, i32 0, i32 0, i64 0, i8* null)
98 // BLOCKS: re
[all...] |
| taskloop_simd_private_codegen.cpp | 5 // RUN: %clang_cc1 -verify -fopenmp -x c++ -fblocks -DBLOCKS -triple x86_64-apple-darwin10 -emit-llvm %s -o - | FileCheck -check-prefix=BLOCKS %s
89 #elif defined(BLOCKS)
90 // BLOCKS: [[G:@.+]] = global double
91 // BLOCKS-LABEL: @main
92 // BLOCKS: call void {{%.+}}(i8
94 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
95 // BLOCKS: [[RES:%.+]] = call i8* @__kmpc_omp_task_alloc(%{{[^ ]+}} @{{[^,]+}}, i32 %{{[^,]+}}, i32 1, i64 88, i64 1, i32 (i32, i8*)* bitcast (i32 (i32, %{{[^*]+}}*)* [[TASK_ENTRY:@[^ ]+]] to i32 (i32, i8*)*))
96 // BLOCKS: [[PRIVATES:%.+]] = getelementptr inbounds %{{.+}}, %{{.+}}* %{{.+}}, i{{.+}} 0, i{{.+}} 1
97 // BLOCKS: call void @__kmpc_taskloop(%{{.+}}* @{{.+}}, i32 %{{.+}}, i8* [[RES]], i32 1, i64* %{{.+}}, i64* %{{.+}}, i64 %{{.+}}, i32 0, i32 0, i64 0, i8* null)
98 // BLOCKS: re
[all...] |
| /external/e2fsprogs/debugfs/ |
| debug_cmds.ct | 52 request do_blocks, "Dump blocks used by an inode ",
53 blocks;
73 request do_kill_file, "Deallocate an inode and its blocks",
163 request do_fallocate, "Allocate uninitialized blocks to an inode",
166 request do_punch, "Punch (or truncate) blocks from an inode by deallocating them",
175 request do_dump_unused, "Dump unused blocks",
|
| debugfs.8.in | 93 should be used when reading blocks not found in the ext2 image file.
94 This includes data, directory, and indirect blocks.
182 .BI blocks " filespace"
183 Print the blocks used by the inode
287 (Please note that the length and range of blocks for the last extent in
324 Allocate and map uninitialized blocks into \fIfilespec\fR between
327 of free disk blocks or the maximum file size is reached. Existing
359 free blocks, starting from
384 blocks starting at block number
415 Print a listing of the inodes which use the one or more blocks specifie
[all...] |
| /external/e2fsprogs/e2fsck/ |
| mtrace.h | 99 /* The allocator divides the heap into blocks of fixed size; large
100 requests receive one or more whole blocks, and small requests
113 /* Number of contiguous free blocks allowed to build up at the end of
133 /* Size (in blocks) of a large cluster. */
141 size_t size; /* Size (in blocks) of a free cluster. */
173 /* List of blocks allocated with `memalign' (or `valloc'). */
|
| readahead.c | 144 blk_t blocks; local
168 &new_gdt, &blocks);
181 blocks);
210 blocks = fs->inode_blocks_per_group -
213 err = mark_bmap_range(ra_map, super, blocks);
242 * worth of inode table blocks seems to yield the largest reductions
|
| /external/e2fsprogs/lib/ext2fs/ |
| ext3_extents.h | 38 __le16 ee_len; /* number of blocks covered by extent */
48 __le32 ei_block; /* index covers logical blocks from 'block' */
62 __le16 eh_depth; /* has tree real underlaying blocks? */
83 * EXT_INIT_MAX_LEN is the maximum number of blocks we can have in an
88 * EXT_UNINIT_MAX_LEN is the maximum number of blocks we can have in an
96 * Hence, the maximum number of blocks we can have in an *initialized*
|
| /external/e2fsprogs/misc/ |
| util.c | 222 "1024 and 10240000 filesystem blocks.\n\n"), stderr);
230 * Determine the number of journal blocks to use, either via
234 * Find a reasonable journal file size (in blocks) given the number of blocks
252 "size is %d blocks; it must be\n"
253 "between 1024 and 10240000 blocks. "
|
| /external/gemmlowp/internal/ |
| allocator.h | 29 // 1. Reserve blocks by calling Reserve(), which returns a Handle.
105 // Alignment of allocated blocks.
158 assert(!committed_ && "can't reserve blocks while committed");
160 "didn't expect to allocate this many blocks");
206 // The number of blocks that have been reserved by Reserve().
210 // The offsets of reserved blocks into the storage buffer.
|
| block_params.h | 28 // into large blocks that should fit in last-level cache (what we call L2 here)
29 // and then another subdivision into smaller blocks that should fit in
33 // L1 block parameters determine the size of small blocks that should
39 // L2 block parameters determine the size of larger blocks that should
148 // L1 block parameters determine the size of small blocks that should
153 // L2 block parameters determine the size of larger blocks that should
|
| /external/libavc/encoder/ |
| ih264e_core_coding.h | 116 * First cf4 is done on all 16 4x4 blocks of the 16x16 input block.
132 * The blocks will be in raster scan order
225 * and 32-17 will correspond to the ac blocks in raster scan order
227 * For AC blocks a bit equaling zero will mean that all 15 AC coffs of the block is nonzero
256 * First cf4 is done on all 16 4x4 blocks of the 8x8input block
275 * The blocks will be in raster scan order
277 * After all the AC blocks of U plane AC blocks of V plane will follow in exact
306 * Then Ac blocks will follow
335 * U plane, next 4 will contain DC coeffs of V plane, then AC blocks of U plan
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopSimplifyCFG.cpp | 41 // Copy blocks into a temporary array to avoid iterator invalidation issues
43 SmallVector<WeakVH, 16> Blocks(L.blocks());
45 for (auto &Block : Blocks) {
46 // Attempt to merge blocks in the trivial case. Don't modify blocks which
|
| /external/llvm/lib/Transforms/Utils/ |
| UnifyFunctionExitNodes.cpp | 48 // Loop over all of the blocks in a function, tracking all of the blocks that
59 // Then unreachable blocks.
75 // Now handle return blocks.
78 return false; // No blocks return
102 // Loop over all of the blocks, replacing the return instruction with an
|
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| DominatorTree.java | 75 * Use the dominator tree to find the dominating block that is closest to a set of blocks.
77 * @param blocks the block for which to find a dominator
78 * @return the closest dominator for the collection of blocks
80 public BasicBlock closestDominator(Collection<BasicBlock> blocks) {
81 if (blocks.size() == 0) {
84 Iterator<BasicBlock> it = blocks.iterator();
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| InterferenceCache.h | 37 /// of PhysReg in all basic blocks.
67 /// Blocks - Interference for each block in the function.
68 SmallVector<BlockInterference, 8> Blocks;
70 /// update - Recompute Blocks[MBBNum]
102 if (Blocks[MBBNum].Tag != Tag)
104 return &Blocks[MBBNum];
|
| /external/syslinux/core/fs/xfs/ |
| xfs_ag.h | 66 uint32_t agf_length; /* size in blocks of a.g. */
70 uint32_t agf_roots[XFS_BTNUM_AGF]; /* root blocks */
76 uint32_t agf_flcount; /* count of blocks in freelist */
77 uint32_t agf_freeblks; /* total free blocks */
79 uint32_t agf_btreeblks; /* # of blocks held in AGF btrees */
148 * of block pointers to blocks owned by the allocation btree code.
|
| /external/valgrind/include/ |
| pub_tool_mallocfree.h | 54 // VG_(perm_malloc) is for allocating small blocks which are
55 // never released. The overhead for such blocks is minimal.
59 // No other function can be used on these permanently allocated blocks.
61 // Technically, these blocks will be returned from big superblocks
62 // only containing such permanently allocated blocks.
63 // Note that there is no cc cost centre : all such blocks will be
|
| /external/valgrind/memcheck/tests/ |
| addressable.stderr.exp | 4 in use at exit: ... bytes in ... blocks
33 in use at exit: ... bytes in ... blocks
42 in use at exit: ... bytes in ... blocks
56 in use at exit: ... bytes in ... blocks
75 in use at exit: ... bytes in ... blocks
85 in use at exit: ... bytes in ... blocks
|
| /external/valgrind/perf/ |
| many-loss-records.c | 22 /* for each call stack, allocate malloc_fan blocks */
33 /* every n top blocks, 1 block and all its children will be freed instead of
76 *mem = 0; // lose the pointer without free-ing the blocks
210 printf ("total blocks malloc-ed: %d\n", blocknr);
211 printf ("total blocks free-ed: %d\n", blockfreed);
212 printf ("total blocks leak-ed: %d\n", blockleaked);
|
| /external/webrtc/webrtc/common_audio/ |
| blocker.h | 50 // - windowing blocks before sending them to Process()
51 // - windowing processed blocks, and overlap-adding them together before
91 // multiple of chunk_size_, so blocks won't line up at the start of the
95 // Since blocks nearly always overlap, there are certain blocks that require
114 // The amount of frames between the start of contiguous blocks. For example,
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 57 SetVector<BasicBlock *> Blocks;
65 /// Blocks containing EHPads, allocas, invokes, or vastarts are not valid.
76 /// \brief Create a code extractor for a sequence of blocks.
78 /// Given a sequence of basic blocks where the first block in the sequence
110 /// Based on the blocks used when constructing the code extractor,
112 bool isEligible() const { return !Blocks.empty(); }
|
