| /bionic/libc/kernel/tools/ |
| clean_header.py | 105 blocks = parser.parseFile(src_file)
115 blocks.replaceTokens(kernel_arch_token_replacements[arch])
117 blocks.optimizeMacros(macros)
118 blocks.optimizeIf01()
119 blocks.removeVarsAndFuncs(statics)
120 blocks.replaceTokens(kernel_token_replacements)
121 blocks.removeMacroDefines(kernel_ignored_macros)
125 blocks.write(out)
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/location/base/ |
| IGnssTestStateContainer.java | 47 * Starts an Activity and blocks until it completes, then it returns its result back to the
56 * Starts an Activity and blocks until it completes, then it returns its result back to the
|
| /external/autotest/server/site_tests/brillo_MemorySizeTest/ |
| brillo_MemorySizeTest.py | 23 @param min_total: Minimum total memory in 1K blocks.
24 @param min_free: Minimum free memory in 1K blocks.
|
| /external/autotest/server/site_tests/brillo_StorageWriteSpeedTest/ |
| brillo_StorageWriteSpeedTest.py | 28 @param block_size: The size of blocks to write in bytes.
29 @param num_blocks: The number of blocks to write.
|
| /external/clang/test/OpenMP/ |
| taskloop_lastprivate_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
96 #elif defined(BLOCKS)
97 // BLOCKS: [[G:@.+]] = global double
98 // BLOCKS-LABEL: @main
99 // BLOCKS: call void {{%.+}}(i8
101 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
102 // BLOCKS: [[RES:%.+]] = call i8* @__kmpc_omp_task_alloc(%{{[^ ]+}} @{{[^,]+}}, i32 %{{[^,]+}}, i32 1, i64 88, i64 16, i32 (i32, i8*)* bitcast (i32 (i32, %{{[^*]+}}*)* [[TASK_ENTRY:@[^ ]+]] to i32 (i32, i8*)*))
103 // BLOCKS: [[PRIVATES:%.+]] = getelementptr inbounds %{{.+}}, %{{.+}}* %{{.+}}, i{{.+}} 0, i{{.+}} 1
104 // BLOCKS: call void @__kmpc_taskloop(%{{.+}}* @{{.+}}, i32 %{{.+}}, i8* [[RES]], i32 1, i64* %{{.+}}, i64* %{{.+}}, i64 %{{.+}}, i32 0, i32 0, i64 0, i8* bitcast (void ([[KMP_TASK_MAIN_TY:%[^*]+]]*, [[KMP_TASK_MAIN_TY]]*, i32)* [[MAIN_DUP:@.+]] to i8*))
105 // BLOCKS: re
[all...] |
| taskloop_simd_lastprivate_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
96 #elif defined(BLOCKS)
97 // BLOCKS: [[G:@.+]] = global double
98 // BLOCKS-LABEL: @main
99 // BLOCKS: call void {{%.+}}(i8
101 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
102 // BLOCKS: [[RES:%.+]] = call i8* @__kmpc_omp_task_alloc(%{{[^ ]+}} @{{[^,]+}}, i32 %{{[^,]+}}, i32 1, i64 88, i64 16, i32 (i32, i8*)* bitcast (i32 (i32, %{{[^*]+}}*)* [[TASK_ENTRY:@[^ ]+]] to i32 (i32, i8*)*))
103 // BLOCKS: [[PRIVATES:%.+]] = getelementptr inbounds %{{.+}}, %{{.+}}* %{{.+}}, i{{.+}} 0, i{{.+}} 1
104 // BLOCKS: call void @__kmpc_taskloop(%{{.+}}* @{{.+}}, i32 %{{.+}}, i8* [[RES]], i32 1, i64* %{{.+}}, i64* %{{.+}}, i64 %{{.+}}, i32 0, i32 0, i64 0, i8* bitcast (void ([[KMP_TASK_MAIN_TY:%[^*]+]]*, [[KMP_TASK_MAIN_TY]]*, i32)* [[MAIN_DUP:@.+]] to i8*))
105 // BLOCKS: re
[all...] |
| /external/e2fsprogs/debugfs/ |
| ro_debug_cmds.ct | 45 request do_blocks, "Dump blocks used by an inode ",
46 blocks;
|
| /external/e2fsprogs/e2fsck/ |
| extend.c | 3 * number of blocks.
44 fprintf(stderr, _("Illegal number of blocks!\n"));
|
| /external/e2fsprogs/lib/ext2fs/ |
| ext2_ext_attr.h | 11 /* Magic value in attribute blocks */
21 __u32 h_blocks; /* number of disk blocks used */
|
| /external/e2fsprogs/misc/ |
| ext4.5.in | 33 Enables the file system to be larger than 2^32 blocks. This feature is set
36 blocks, even if it was smaller than that threshold when it was
43 allocation is a power of two number of blocks. That is, each bit in the
46 default composed of 16 blocks. This feature can decrease the time
76 This ext4 feature provides file-system level encryption of data blocks
95 particular inode to physical blocks on the storage device to be stored
182 .\" descriptor blocks, inode and block bitmaps, directories, and
183 .\" extent tree blocks). The checksum algorithm used for the metadata
184 .\" blocks is different than the one used for group descriptors with the
198 larger than 2^32 blocks. It is not recommended that this feature be se
[all...] |
| /external/e2fsprogs/resize/ |
| online.c | 95 * If the number of descriptor blocks is going to increase,
122 _("Not enough reserved gdt blocks for resizing"));
209 * bitmap blocks and inode tables. This means we don't get
220 printf(_("Performing an on-line resize of %s to %llu (%dk) blocks.\n"),
257 printf("new group has %u blocks\n", input.blocks_count);
258 printf("new group will reserve %d blocks\n",
260 printf("new group has %d free blocks\n",
262 printf("new group has %d free inodes (%d blocks)\n",
|
| /external/e2fsprogs/tests/f_dir_bad_csum/ |
| expect.1 | 1 Pass 1: Checking inodes, blocks, and sizes
55 test_filesys: 19/128 files (5.3% non-contiguous), 1098/2048 blocks
|
| /external/e2fsprogs/tests/f_inlinedata_repair/ |
| expect.1 | 1 Pass 1: Checking inodes, blocks, and sizes
57 test_filesys: 26/128 files (0.0% non-contiguous), 18/512 blocks
|
| /external/fec/ |
| rs_speedtest.c | 34 printf("Execution time for %d Reed-Solomon blocks using general decoder: %.2f sec\n",trials,extime);
49 printf("Execution time for %d Reed-Solomon blocks using CCSDS decoder: %.2f sec\n",trials,extime);
|
| /external/fio/crc/ |
| murmur3.c | 52 const uint32_t *blocks = (const uint32_t *)(data + nblocks * 4); local
56 uint32_t k1 = blocks[i];
|
| /external/gemmlowp/doc/ |
| design.md | 22 However, only small blocks can fit at a given time in registers, so at larger
23 scales one needs to repeatedly load blocks of matrices from memory, and these
29 This is achieved by subdividing the matrices into blocks sized to fit in L2
30 cache, and subdividing these blocks into sub-blocks sizes to fit in L1 cache,
33 In practice, it tends to pay off to "pack" input blocks for optimally efficient
73 1. Pack lhs/rhs blocks from the input matrices.
74 2. Compute the product of the packed blocks, using the kernel.
|
| design.txt | 26 However, only small blocks can fit at a given time in registers, so at larger
27 scales one needs to repeatedly load blocks of matrices from memory, and
33 This is achieved by subdividing the matrices into blocks sized to fit in L2
34 cache, and subdividing these blocks into sub-blocks sizes to fit in L1 cache,
37 In practice, it tends to pay off to "pack" input blocks for optimally
77 1. Pack lhs/rhs blocks from the input matrices.
78 2. Compute the product of the packed blocks, using the kernel.
|
| /external/libavc/decoder/ |
| ih264d_mem_request.h | 53 UWORD32 u4_num_memBlocks; /** Number of memory blocks */
66 WORD32 i4_num_pic_memBlocks; /** Number of memory blocks */
|
| /external/llvm/include/llvm/DebugInfo/PDB/Raw/ |
| IPDBStreamData.h | 22 /// stream blocks, and by looking in the array of stream lengths to get the
24 /// length and list of blocks are stored elsewhere. By abstracting the
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| Sink.h | 10 // This pass moves instructions into successor blocks, when possible, so that
23 /// Move instructions into successor blocks when possible.
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| UncondBranchToReturn.ll | 1 ; The unify-function-exit-nodes pass often makes basic blocks that just contain
21 ; as well, even if the return block is shared and the source blocks are
|
| /external/llvm/test/tools/llvm-cov/Inputs/ |
| test_-a_-b_-u.cpp.gcov | 15 function _ZN1A1BEv called 8589934592 returned 100% blocks executed 100%
20 function _Z7uselessv called 0 returned 0% blocks executed 0%
25 function _Z12more_uselessv called 0 returned 0% blocks executed 0%
32 function _Z3foov called 2 returned 100% blocks executed 100%
40 function _Z3barv called 0 returned 0% blocks executed 0%
48 function _Z6assignii called 8 returned 100% blocks executed 100%
55 function _Z15initialize_gridv called 2 returned 100% blocks executed 100%
82 function main called 2 returned 100% blocks executed 94%
|
| /external/mesa3d/docs/specs/ |
| enums.txt | 9 GL blocks allocated to Mesa:
13 EGL blocks allocated to Mesa:
|
| /external/python/cpython2/Modules/_ctypes/ |
| malloc_closure.c | 15 overhead, but allocate less blocks from the system. It may be that some
16 systems have a limit of how many mmap'd blocks can be open.
|
| /external/squashfs-tools/squashfs-tools/ |
| unsquash-2.c | 30 void read_block_list_2(unsigned int *block_list, char *block_ptr, int blocks)
32 TRACE("read_block_list: blocks %d\n", blocks);
35 unsigned int sblock_list[blocks];
36 memcpy(sblock_list, block_ptr, blocks * sizeof(unsigned int));
37 SQUASHFS_SWAP_INTS_3(block_list, sblock_list, blocks);
39 memcpy(block_list, block_ptr, blocks * sizeof(unsigned int));
213 i.blocks = inode->fragment == SQUASHFS_INVALID_FRAG ?
|
