| /external/e2fsprogs/lib/ext2fs/ |
| tst_getsize.c | 32 blk_t blocks; local
39 retval = ext2fs_get_device_size(argv[1], 1024, &blocks);
44 printf("%s is device has %u blocks.\n", argv[1], blocks);
|
| /external/llvm/test/CodeGen/SystemZ/Large/ |
| branch-range-02.py | 3 # RUN: python %s | llc -mtriple=s390x-linux-gnu -align-all-blocks=8 | FileCheck %s
19 # with N == 256 + 4. The -align-all-blocks=8 option ensures that all blocks
20 # are 256 bytes in size. The first 4 blocks and the last 4 blocks are then
39 # ...lots of other blocks...
59 blocks = 256 + 4 variable
67 for i in xrange(blocks):
70 next = 'b%d' % (i + 1) if i + 1 < blocks else 'end'
71 other = 'end' if 2 * i < blocks else 'b0
[all...] |
| /art/compiler/optimizing/ |
| linearize_test.cc | 79 const uint32_t blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; local
80 TestCode(data, blocks);
104 const uint32_t blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; local
105 TestCode(data, blocks);
131 const uint32_t blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; local
132 TestCode(data, blocks);
161 const uint32_t blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; local
162 TestCode(data, blocks);
191 const uint32_t blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; local
192 TestCode(data, blocks);
217 const uint32_t blocks[] = {0, 1, 2, 3, 4, 6, 9, 8, 5, 7}; local
245 const uint32_t blocks[] = {0, 1, 2, 3, 4, 9, 8, 6, 5, 7}; local
[all...] |
| find_loops_test.cc | 113 const BitVector& blocks = info->GetBlocks(); local
114 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks);
116 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i]));
175 // incoming blocks and one back edge.
|
| /external/harfbuzz_ng/src/ |
| gen-arabic-table.py | 7 print >>sys.stderr, "usage: ./gen-arabic-table.py ArabicShaping.txt UnicodeData.txt Blocks.txt"
17 blocks = {} variable
19 global blocks
40 blocks[u] = t
74 all_blocks = set([blocks[u] for u in uu])
97 block = blocks.get(u, last_block)
248 print " * ./gen-arabic-table.py ArabicShaping.txt UnicodeData.txt Blocks.txt"
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.h | 30 * cost of being unable to explicitly free one of the allocated blocks.
41 struct memory_block * blocks; member in struct:memory_pool
|
| /external/boringssl/src/crypto/fipsmodule/modes/ |
| ctr.c | 177 size_t blocks = len / 16; local
181 if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28)) {
182 blocks = (1U << 28);
187 // amount of blocks to the exact overflow point...
188 ctr32 += (uint32_t)blocks;
189 if (ctr32 < blocks) {
190 blocks -= ctr32;
193 (*func)(in, out, blocks, key, ivec);
200 blocks *= 16;
201 len -= blocks;
[all...] |
| polyval.c | 78 size_t blocks = todo / sizeof(polyval_block); local
79 for (size_t i = 0; i < blocks; i++) {
|
| /external/clang/test/CodeGenCXX/ |
| 2006-09-12-OpaqueStructCrash.cpp | 25 B<C<Ty> > blocks; member in struct:D
|
| /external/mesa3d/src/compiler/nir/ |
| nir_worklist.h | 39 /** Represents a double-ended queue of unique blocks
44 * caller must ensure that the blocks are properly indexed.
50 /* The number of blocks currently in the worklist */
53 /* The offset in the array of blocks at which the list starts */
56 /* A bitset of all of the blocks currently present in the worklist */
60 nir_block **blocks; member in struct:__anon29340
|
| /external/pdfium/third_party/bigint/ |
| BigIntegerUtils.hh | 58 BigInteger::Blk *blocks = new BigInteger::Blk[numBlocks]; local
68 blocks[blockNum] = curBlock;
72 BigInteger x(blocks, numBlocks, sign);
74 delete [] blocks;
|
| /external/syslinux/gpxe/src/include/gpxe/ |
| blockdev.h | 49 /** Total number of blocks */
50 uint64_t blocks; member in struct:block_device
|
| bitmap.h | 41 bitmap_block_t *blocks; member in struct:bitmap
58 free ( bitmap->blocks );
|
| /external/wpa_supplicant_8/src/crypto/ |
| aes-cbc.c | 29 int i, j, blocks; local
39 blocks = data_len / AES_BLOCK_SIZE;
40 for (i = 0; i < blocks; i++) {
65 int i, j, blocks; local
75 blocks = data_len / AES_BLOCK_SIZE;
76 for (i = 0; i < blocks; i++) {
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/testdata/ |
| flowgraph_generator1.go | 14 // The blocks of the flow graph are designated with letters A
17 // separated list of block successor words, for blocks ordered
26 // with J words (J+1 blocks), a J-1 bit serial number specifies
27 // which blocks (not including A and Z) include an increment of
90 // maxin:32, blocks:[]blo{
99 func blocks(spec string) (blocks []string, fnameBase string) { func
101 blocks = strings.Split(spec, ",")
106 func makeFunctionFromFlowGraph(blocks []blo, fname string) string {
109 for j := range blocks {
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/testdata/ |
| flowgraph_generator1.go | 14 // The blocks of the flow graph are designated with letters A
17 // separated list of block successor words, for blocks ordered
26 // with J words (J+1 blocks), a J-1 bit serial number specifies
27 // which blocks (not including A and Z) include an increment of
90 // maxin:32, blocks:[]blo{
99 func blocks(spec string) (blocks []string, fnameBase string) { func
101 blocks = strings.Split(spec, ",")
106 func makeFunctionFromFlowGraph(blocks []blo, fname string) string {
109 for j := range blocks {
[all...] |
| /system/chre/util/include/chre/util/ |
| memory_pool_impl.h | 32 blocks()[i].mNextFreeBlockIndex = i + 1;
44 mNextFreeBlockIndex = blocks()[blockIndex].mNextFreeBlockIndex;
47 return new (&blocks()[blockIndex].mElement)
54 uintptr_t baseAddress = reinterpret_cast<uintptr_t>(&blocks()[0].mElement);
57 blocks()[blockIndex].mElement.~ElementType();
58 blocks()[blockIndex].mNextFreeBlockIndex = mNextFreeBlockIndex;
70 *MemoryPool<ElementType, kSize>::blocks() { function in class:chre::MemoryPool
|
| /system/update_engine/payload_generator/ |
| extent_ranges.h | 29 // therefore blocks). Such an object may be modified by adding or subtracting
30 // blocks (think: set addition or set subtraction). Note that ExtentRanges
72 uint64_t blocks() const { return blocks_; } function in class:chromeos_update_engine::ExtentRanges
75 // Returns an ordered vector of extents for |count| blocks,
78 // the number of blocks in this extent set.
86 // Filters out from the passed list of extents |extents| all the blocks in the
87 // ExtentRanges set. Note that the order of the blocks in |extents| is preserved
88 // omitting blocks present in the ExtentRanges |ranges|.
|
| /bootable/recovery/tests/component/ |
| sideload_test.cpp | 40 // Too many blocks.
45 const std::vector<std::string> blocks = { local
51 const std::string content = android::base::Join(blocks, "");
56 vtab.read_block = [&blocks](uint32_t block, uint8_t* buffer, uint32_t fetch_size) {
58 blocks[block].copy(reinterpret_cast<char*>(buffer), fetch_size);
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_dense_alloc_test.cc | 34 IndexT blocks[N]; local
38 blocks[i] = idx;
45 IndexT idx = blocks[i];
|
| /external/fio/crc/ |
| murmur3.c | 52 const uint32_t *blocks = (const uint32_t *)(data + nblocks * 4); local
56 uint32_t k1 = blocks[i];
|
| /external/v8/src/crankshaft/ |
| hydrogen-mark-unreachable.cc | 16 const ZoneList<HBasicBlock*>* blocks = graph()->blocks(); local
19 for (int i = 0; i < blocks->length(); i++) {
20 HBasicBlock* block = blocks->at(i);
22 bool is_reachable = blocks->at(0) == block;
|
| /system/keymaster/km_openssl/ |
| ckdf.cpp | 46 const uint32_t blocks = div_round_up(output->key_material_size, AES_BLOCK_SIZE); local
72 for (uint32_t i = 1; i <= blocks; ++i) {
|
| /bootable/recovery/otautil/include/otautil/ |
| rangeset.h | 49 // bounds. For example, "3,5" contains blocks 3 and 4. So "3,5" and "5,7" are not overlapped.
52 // Returns a vector of RangeSets that contain the same set of blocks represented by the current
53 // RangeSet. The RangeSets in the vector contain similar number of blocks, with a maximum delta
54 // of 1-block between any two of them. For example, 14 blocks would be split into 4 + 4 + 3 + 3,
55 // as opposed to 4 + 4 + 4 + 2. If the total number of blocks (T) is less than groups, it
65 // Returns the total number of blocks in this RangeSet.
66 size_t blocks() const { function in class:RangeSet
129 // continuous RangeSet (i.e. RangeSet("0-99") for a 100 blocks file); and break it down into
|
| /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);
|
