HomeSort by relevance Sort by last modified time
    Searched full:blocks (Results 501 - 525 of 10005) sorted by null

<<21222324252627282930>>

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
efs_fs_sb.h 39 __be32 fs_tfree; /* total free data blocks */
53 __u32 total_blocks; /* total number of blocks in filesystem */
54 __u32 group_size; /* # of blocks a group consists of */
55 __u32 data_free; /* # of free data blocks */
57 __u16 inode_blocks; /* # of blocks used for inodes in every grp */
  /system/bt/stack/include/
a2dp_sbc_constants.h 48 #define A2DP_SBC_IE_BLOCKS_MSK 0xF0 /* b7-b4 number of blocks */
49 #define A2DP_SBC_IE_BLOCKS_4 0x80 /* 4 blocks */
50 #define A2DP_SBC_IE_BLOCKS_8 0x40 /* 8 blocks */
51 #define A2DP_SBC_IE_BLOCKS_12 0x20 /* 12blocks */
52 #define A2DP_SBC_IE_BLOCKS_16 0x10 /* 16blocks */
  /external/toybox/www/
ext2.html 12 <h2>Blocks and Block Groups</h2>
14 <p>Every ext2 filesystem consists of blocks, which are divided into block
15 groups. Blocks can be 1k, 2k, or 4k in length.<super><a href="#1">[1]</a></super>
16 All ext2 disk layout is done in terms of these logical blocks, never in
17 terms of 512-byte logical blocks.</p>
19 <p>Each block group contains as many blocks as one block can hold a
20 bitmap for, so at a 1k block size a block group contains 8192 blocks (1024
21 bytes * 8 bits), and at 4k block size a block group contains 32768 blocks.
33 <li>Data blocks</li>
39 data blocks to hold actual file and directory data, see the superbloc
    [all...]
  /system/update_engine/payload_generator/
delta_diff_utils.h 34 // Create operations in |aops| to produce all the blocks in the |new_part|
37 // blocks in that partition (if available) to determine the best way to compress
40 // and soft chunk limits in number of blocks respectively. The soft chunk limit
42 // blocks, while the hard limit is used to split a file when generating other
52 // Create operations in |aops| for identical blocks that moved around in the old
53 // and new partition and also handle zeroed blocks. The old and new partition
56 // |chunk_blocks| blocks, or unlimited if |chunk_blocks| is -1. The blobs of the
59 // blocks already have operations reading or writing them and only operations
60 // for unvisited blocks are produced by this function updating both collections
61 // with the used blocks
    [all...]
  /external/clang/test/OpenMP/
parallel_for_linear_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 i{{[0-9]+}} 1212,
91 // BLOCKS-LABEL: @main
92 // BLOCKS: call void {{%.+}}(i8
94 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
95 // BLOCKS: call void {{.+}} @__kmpc_fork_call({{.+}}, i32 1, {{.+}}* [[OMP_REGION:@.+]] to {{.+}}, i32* [[G]])
98 // BLOCKS: define{{.*}} internal{{.*}} void [[OMP_REGION]](i32* noalias %{{.+}}, i32* noalias %{{.+}}, i32* dereferenceable(4) %{{.+}})
99 // BLOCKS: alloca i{{[0-9]+}},
100 // BLOCKS: [[G_START_ADDR:%.+]] = alloca i{{[0-9]+}}
    [all...]
parallel_private_codegen.cpp 5 // RUN: %clang_cc1 -verify -fopenmp -x c++ -fblocks -DBLOCKS -triple %itanium_abi_triple -emit-llvm %s -o - | FileCheck -check-prefix=BLOCKS %s
33 #elif defined(BLOCKS)
60 #elif defined(BLOCKS)
76 // BLOCKS: [[SS_TY:%.+]] = type { i{{[0-9]+}}, i8
171 #elif defined(BLOCKS)
172 // BLOCKS: [[G:@.+]] = global i{{[0-9]+}} 1212,
173 // BLOCKS-LABEL: @main
174 // BLOCKS: call
175 // BLOCKS: call{{.*}} void {{%.+}}(i8
177 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8
    [all...]
for_private_codegen.cpp 5 // RUN: %clang_cc1 -verify -fopenmp -x c++ -fblocks -DBLOCKS -triple %itanium_abi_triple -emit-llvm %s -o - | FileCheck -check-prefix=BLOCKS %s
95 #elif defined(BLOCKS)
96 // BLOCKS: [[G:@.+]] = global double
97 // BLOCKS-LABEL: @main
98 // BLOCKS: call {{.*}}void {{%.+}}(i8
101 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
102 // BLOCKS: call {{.*}}void {{.+}} @__kmpc_fork_call({{.+}}, i32 0, {{.+}}* [[OMP_REGION:@.+]] to {{.+}})
106 // BLOCKS: define{{.*}} internal{{.*}} void [[OMP_REGION]](i32* noalias %{{.+}}, i32* noalias %{{.+}})
107 // BLOCKS: [[G_PRIVATE_ADDR:%.+]] = alloca double,
108 // BLOCKS: [[SVAR_PRIVATE_ADDR:%.+]] = alloca i{{[0-9]+}}
    [all...]
  /external/valgrind/memcheck/tests/
leak-delta.stderr.exp 2 10 bytes in 1 blocks are still reachable in loss record ... of ...
9 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
14 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
20 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ...
27 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
33 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ...
38 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
44 0 (-10) bytes in 0 (-1) blocks are definitely lost in loss record ... of ...
49 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
55 32 (+32) bytes in 1 (+1) blocks are definitely lost in loss record ... of ..
    [all...]
  /external/e2fsprogs/e2fsck/
badblocks.c 2 * badblocks.c --- replace/append bad blocks to the bad block inode
40 * illegal blocks, clear them.
46 _("while sanity checking the bad blocks inode"));
51 * If we're appending to the bad blocks inode, read in the
52 * current bad blocks.
58 _("while reading the bad blocks inode"));
64 * Now read in the bad blocks from the file; if
94 _("while reading in list of bad blocks from file"));
99 * Finally, update the bad blocks from the bad_block_map
  /external/e2fsprogs/tests/
README 38 badbblocks.img Filesystem with illegal blocks in the bad block inode.
43 badtable.img Filesystem with blocks shared between the bitmaps and
44 inode table blocks and the bad block inode
45 bbfile.img Filesystem with files containing bad blocks
48 dup.img Filesystem with blocks claimed by two different files
49 dup2.img Filesystem with blocks claimed by three different files
50 dupfsblks.img Filesystem with blocks claimed by a file and
52 dupsuper.img Filesystem with blocks claimed by a file and
63 okgroup.img Filesystem that's exactly 8193 blocks long
  /external/markdown/markdown/
blockparser.py 38 """ Parse Markdown blocks into an ElementTree object.
67 blocks which will be split on blank lines, it could contain only one
77 def parseBlocks(self, parent, blocks):
78 """ Process blocks of markdown text and attach to given etree node.
80 Given a list of ``blocks``, each blockprocessor is stepped through
81 until there are no blocks left. While an extension could potentially
89 while blocks:
91 if processor.test(parent, blocks[0]):
92 processor.run(parent, blocks)
  /external/mesa3d/src/intel/vulkan/tests/
block_pool_no_free.c 36 uint32_t blocks[BLOCKS_PER_THREAD]; member in struct:job
51 job->blocks[i] = block;
61 block = job->blocks[i];
73 static void validate_monotonic(uint32_t **blocks)
88 if (thread_max < blocks[i][next[i]]) {
89 thread_max = blocks[i][next[i]];
101 assert(blocks[max_thread_idx][next[max_thread_idx]] > highest);
103 highest = blocks[max_thread_idx][next[max_thread_idx]];
128 block_ptrs[i] = jobs[i].blocks;
  /external/r8/src/main/java/com/android/tools/r8/ir/code/
IRCode.java 26 public LinkedList<BasicBlock> blocks; field in class:IRCode
35 LinkedList<BasicBlock> blocks,
39 this.blocks = blocks;
58 builder.append("blocks:\n");
59 for (BasicBlock block : blocks) {
67 for (BasicBlock block : blocks) {
86 blocks.removeAll(blocksToRemove);
93 * Compute quasi topologically sorted list of the basic blocks using depth first search.
105 int reachableBlocks = blocks.size() - blocksToIgnore.size()
330 BasicBlock[] blocks = topologicallySortedBlocks(); local
    [all...]
  /external/r8/src/test/java/com/android/tools/r8/ir/
SplitBlockTest.java 79 assertEquals(initialBlockCount, code.blocks.size());
81 BasicBlock block = code.blocks.get(0);
93 assertEquals(initialBlockCount + 1, code.blocks.size());
94 assertEquals(i + 1, code.blocks.get(0).getInstructions().size());
95 assertEquals(instructionCount - i, code.blocks.get(1).getInstructions().size());
96 assertSame(newBlock, code.blocks.get(1));
113 assertEquals(initialBlockCount, code.blocks.size());
115 BasicBlock block = code.blocks.get(0);
127 assertEquals(initialBlockCount + 2, code.blocks.size());
128 assertEquals(i + 1, code.blocks.get(0).getInstructions().size())
    [all...]
  /external/valgrind/gdbserver_tests/
mcleak.stderr.exp 3 10 bytes in 1 blocks are still reachable in loss record ... of ...
16 leaked: 32 bytes in 1 blocks
17 dubious: 0 bytes in 0 blocks
18 reachable: 64 bytes in 3 blocks
19 suppressed: 0 bytes in 0 blocks
20 10 bytes in 1 blocks are still reachable in loss record ... of ...
24 21 bytes in 1 blocks are still reachable in loss record ... of ...
28 32 bytes in 1 blocks are definitely lost in loss record ... of ...
32 33 bytes in 1 blocks are still reachable in loss record ... of ...
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
layout.go 7 // layout orders basic blocks in f with the goal of minimizing control flow instructions.
8 // After this phase returns, the order of f.Blocks matters and is the order
9 // in which those blocks will appear in the assembly output.
15 posdegree := f.newSparseSet(f.NumBlocks()) // blocks with positive remaining degree
17 zerodegree := f.newSparseSet(f.NumBlocks()) // blocks with zero remaining degree
21 for _, b := range f.Blocks {
38 if len(order) == len(f.Blocks) {
52 // Pick among the successor blocks that have not been scheduled yet.
102 f.Blocks = order
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
layout.go 7 // layout orders basic blocks in f with the goal of minimizing control flow instructions.
8 // After this phase returns, the order of f.Blocks matters and is the order
9 // in which those blocks will appear in the assembly output.
15 posdegree := f.newSparseSet(f.NumBlocks()) // blocks with positive remaining degree
17 zerodegree := f.newSparseSet(f.NumBlocks()) // blocks with zero remaining degree
21 for _, b := range f.Blocks {
38 if len(order) == len(f.Blocks) {
52 // Pick among the successor blocks that have not been scheduled yet.
102 f.Blocks = order
  /art/compiler/optimizing/
linearize_test.cc 75 const uint32_t blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; local
76 TestCode(data, blocks);
100 const uint32_t blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; local
101 TestCode(data, blocks);
127 const uint32_t blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; local
128 TestCode(data, blocks);
157 const uint32_t blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; local
158 TestCode(data, blocks);
187 const uint32_t blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; local
188 TestCode(data, blocks);
213 const uint32_t blocks[] = {0, 1, 2, 3, 4, 6, 9, 8, 5, 7}; local
241 const uint32_t blocks[] = {0, 1, 2, 3, 4, 9, 8, 6, 5, 7}; local
    [all...]
  /external/wpa_supplicant_8/src/crypto/
crypto_internal-cipher.c 106 size_t i, j, blocks; local
119 blocks = len / AES_BLOCK_SIZE;
120 for (i = 0; i < blocks; i++) {
133 blocks = len / 8;
134 for (i = 0; i < blocks; i++) {
147 blocks = len / 8;
148 for (i = 0; i < blocks; i++) {
169 size_t i, j, blocks; local
183 blocks = len / AES_BLOCK_SIZE;
184 for (i = 0; i < blocks; i++)
    [all...]
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++) {
  /external/clang/lib/Analysis/
ThreadSafetyTIL.cpp 164 // Sorts the CFGs blocks using a reverse post-order depth-first traversal.
165 // Each block will be written into the Blocks array in order, and its BlockID
167 // block, and ID should be the total number of blocks.
168 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {
172 ID = Block->topologicalSort(Blocks, ID);
174 // We may lose pointers to unreachable blocks.
177 Blocks[BlockID] = this;
183 // which guarantees that all blocks are serialized after their dominator and
189 // and no blocks are accessable via traversal of back-edges from the exit that
191 int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID)
    [all...]
  /external/e2fsprogs/contrib/
dir2fs 14 # the number of free inodes given the minimum number of blocks required.
47 blocks="$(dumpe2fs -h "${dev}" 2>&1 | grep 'Block count:' | awk '{print $3}')"
50 if [ "${new_blocks}" -eq "${blocks}" ]; then
53 blocks="${new_blocks}"
57 truncate -s "$((blocks * block_sz))" "${dev}" || (e2image -ar "${dev}" "${dev}.min"; mv "${dev}.min" "${dev}")
63 overhead="$((blocks - dir_blocks))"
  /external/e2fsprogs/tests/f_lotsbad/
expect.1 3 Pass 1: Checking inodes, blocks, and sizes
24 Too many illegal blocks in inode 12.
28 Pass 1: Checking inodes, blocks, and sizes
40 Free blocks count wrong for group #0 (9, counted=43).
43 Free blocks count wrong (9, counted=43).
60 test_filesys: 12/32 files (0.0% non-contiguous), 57/100 blocks
  /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:__anon27484
  /external/syslinux/gpxe/src/core/
bitmap.c 47 new_size = ( new_num_blocks * sizeof ( bitmap->blocks[0] ) );
48 new_blocks = realloc ( bitmap->blocks, new_size );
54 bitmap->blocks = new_blocks;
59 bitmap->blocks[old_num_blocks++] = 0;
79 return ( bitmap->blocks[index] & mask );
95 bitmap->blocks[index] |= mask;

Completed in 345 milliseconds

<<21222324252627282930>>