| /external/e2fsprogs/tests/r_64to32bit/ |
| expect | 2 Creating filesystem with 524288 1k blocks and 65536 inodes
3 Superblock backups stored on blocks:
8 Creating journal (16384 blocks): done
9 Creating 477 huge file(s) with 1024 blocks each: done
12 Pass 1: Checking inodes, blocks, and sizes
21 The filesystem on test.img is now 524288 (1k) blocks long.
38 -Free blocks: 571
39 +Free blocks: 589
45 Reserved GDT blocks: 256
46 Blocks per group: 819
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 11 // algorithm. The idea is to put frequently executed blocks together at the
14 // function, this pass basically orders blocks in depth-first order
22 // placing the most frequently executed successor until we run out of blocks. I
39 STATISTIC(NumMoved, "Number of basic blocks moved");
72 /// PlaceBlocks - Recursively place the specified blocks and any unplaced
93 // Recursively place all blocks.
102 /// PlaceBlocks - Recursively place the specified blocks and any unplaced
113 Function::BasicBlockListType &Blocks = BB->getParent()->getBasicBlockList();
114 Blocks.splice(InsertPos, Blocks, BB)
[all...] |
| /external/webrtc/webrtc/modules/desktop_capture/ |
| differ.cc | 27 // Calc number of blocks (full and partial) required to cover entire image.
40 // Identify all the blocks that contain changed pixels.
43 // Now that we've identified the blocks that have changed, merge adjacent
44 // blocks to minimize the number of rects that we return.
52 // Calc number of full blocks.
56 // Calc size of partial blocks which may be present on right and bottom edge.
146 // We've found a modified block. Look at blocks to the right and below
154 // Group with blocks to the right.
163 // Group with blocks below.
164 // The entire width of blocks that we matched above much match fo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 36 /// blocks, and optionally, a set of live-in blocks.
51 /// \brief Give the IDF calculator the set of blocks in which the value is
52 /// defined. This is equivalent to the set of starting blocks it should be
56 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
57 DefBlocks = &Blocks;
60 /// \brief Give the IDF calculator the set of blocks in which the value is
62 /// not include blocks where any phi insertion would be dead.
66 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) {
67 LiveInBlocks = &Blocks;
[all...] |
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| MapMaker.java | 71 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, false);
73 mm.make(blocks, ca.getCode());
74 for (int i = 0; i < blocks.length; i++)
75 System.out.println(blocks[i]);
91 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, true);
92 if (blocks == null)
96 mm.make(blocks, ca.getCode());
97 return mm.toStackMap(blocks);
112 TypedBlock[] blocks = TypedBlock.makeBlocks(minfo, ca, true);
113 if (blocks == null
[all...] |
| /external/libjpeg-turbo/ |
| wrjpgcom.1 | 26 The JPEG standard allows "comment" (COM) blocks to occur within a JPEG file.
27 Although the standard doesn't actually define what COM blocks are for, they
30 them as text. COM blocks do not interfere with the image stored in the JPEG
36 Ordinarily, the COM block is added after any existing COM blocks; but you
37 can delete the old COM blocks if you wish.
42 Delete any existing COM blocks from the file.
69 \fB\-replace \-comment ""\fR can be used to delete all COM blocks from a file.
|
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| BasicBlockInstructionIterator.java | 176 List<BasicBlock> blocks = code.blocks; local
179 int blockNumber = blocks.size();
209 blocks.add(blocks.indexOf(block) + 1, newBlock);
244 // Iterate through the instructions in the inlined block and split into blocks with only
290 // Move back through the inlinee blocks added (they are now in the basic blocks list).
291 for (int i = 0; i < inlinee.blocks.size(); i++) {
294 assert inlineeBlock == inlinee.blocks.getFirst()
[all...] |
| /system/update_engine/payload_generator/ |
| filesystem_interface.h | 20 // This class is used to abstract a filesystem and iterate the blocks
23 // partition composed by fixed-size blocks, since that's the interface used in
56 // "/usr/bin/bash". For pseudo-files, like blocks associated to internal
60 // The list of all physical blocks holding the data of this file in
62 // between 0 and GetBlockCount() - 1. The blocks are encoded in extents,
63 // indicating the starting block, and the number of consecutive blocks.
72 // Returns the number of blocks in the filesystem.
|
| /test/vts/utils/python/coverage/ |
| function_summary.py | 19 """Summarizes a function and its blocks from .gcno file.
22 blocks: list of BlockSummary objects for each block in the function.
44 self.blocks = []
63 for block in self.blocks:
84 for block in self.blocks:
96 String representation of the functions and its blocks.
100 for b in self.blocks:
|
| function_summary_test.py | 31 """Creates a function summary and a chain of blocks.
33 Creates an arc between adjacent blocks. All arcs are left with default
40 self.function_summary.blocks = [block_summary.BlockSummary(i, 0)
44 arc = arc_summary.ArcSummary(self.function_summary.blocks[i - 1],
45 self.function_summary.blocks[i], 0)
46 self.function_summary.blocks[i - 1].exit_arcs.append(arc)
47 self.function_summary.blocks[i].entry_arcs.append(arc)
|
| /external/clang/test/OpenMP/ |
| for_firstprivate_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
131 #elif defined(BLOCKS)
132 // BLOCKS: [[G:@.+]] = global i{{[0-9]+}} 1212,
133 // BLOCKS-LABEL: @main
134 // BLOCKS: call void {{%.+}}(i8
136 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
137 // BLOCKS: call void {{.+}} @__kmpc_fork_call({{.+}}, i32 1, {{.+}}* [[OMP_REGION:@.+]] to {{.+}})
141 // BLOCKS: define{{.*}} internal{{.*}} void [[OMP_REGION]](i32* noalias %{{.+}}, i32* noalias %{{.+}}, i32* dereferenceable(4) [[SIVAR_REF:%.+]])
143 // BLOCKS: alloca i{{[0-9]+}},
144 // BLOCKS: alloca i{{[0-9]+}}
[all...] |
| sections_firstprivate_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
128 #elif defined(BLOCKS)
129 // BLOCKS: [[G:@.+]] = global i{{[0-9]+}} 1212,
130 // BLOCKS-LABEL: @main
131 // BLOCKS: call void {{%.+}}(i8
133 // BLOCKS: define{{.*}} internal{{.*}} void {{.+}}(i8*
134 // BLOCKS: call void {{.+}} @__kmpc_fork_call({{.+}}, i32 1, {{.+}}* [[OMP_REGION:@.+]] to {{.+}})
138 // BLOCKS: define{{.*}} internal{{.*}} void [[OMP_REGION]](i32* noalias %{{.+}}, i32* noalias %{{.+}}, i32* dereferenceable(4) [[SIVAR_REF:%.+]])
140 // BLOCKS: alloca i{{[0-9]+}},
141 // BLOCKS: alloca i{{[0-9]+}}
[all...] |
| for_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
27 #elif defined(BLOCKS)
50 #elif defined(BLOCKS)
83 #elif defined(BLOCKS)
106 #elif defined(BLOCKS)
137 // BLOCKS: [[SS_TY:%.+]] = type { i{{[0-9]+}}, i8
299 #elif defined(BLOCKS)
300 // BLOCKS: [[G:@.+]] = global i{{[0-9]+}} 1212,
301 // BLOCKS-LABEL: @main
302 // BLOCKS: cal
[all...] |
| /external/valgrind/gdbserver_tests/ |
| mcleak.stderrB.exp | 3 10 bytes in 1 blocks are still reachable in loss record ... of ...
7 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
11 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
15 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ...
19 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
23 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ...
27 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
31 0 (-10) bytes in 0 (-1) blocks are definitely lost in loss record ... of ...
35 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
39 32 (+32) bytes in 1 (+1) blocks are definitely lost in loss record ... of ..
[all...] |
| /external/markdown/markdown/ |
| blockprocessors.py | 5 This parser handles basic parsing of Markdown blocks. It doesn't concern itself
7 blocks, lists, quotes, etc.
11 as they need to alter how markdown blocks are parsed.
80 def run(self, parent, blocks):
95 the list of blocks.
100 * ``blocks``: A list of all remaining blocks of the document.
129 def run(self, parent, blocks):
130 block = blocks.pop(0)
187 """ Process code blocks. ""
[all...] |
| /external/syslinux/extlinux/ |
| ufs_fs.h | 67 * For filesystem fs, the offsets of the various blocks of interest
71 * [fs->fs_iblkno] Inode blocks
72 * [fs->fs_dblkno] Data blocks
134 __fs32 cs_nbfree; /* number of free blocks */
140 __fs64 cs_nbfree; /* number of free blocks */
149 __u64 cs_nbfree; /* number of free blocks */
167 __fs32 fs_iblkno; /* offset of inode-blocks in filesys */
172 __fs32 fs_size; /* number of blocks in fs */
173 __fs32 fs_dsize; /* number of data blocks in fs */
175 __fs32 fs_bsize; /* size of basic blocks in fs *
[all...] |
| /external/e2fsprogs/tests/j_ext_long_trans/ |
| expect | 1 Creating filesystem with 262144 1k blocks and 0 inodes
2 Superblock backups stored on blocks:
5 Creating filesystem with 262144 1k blocks and 16384 inodes
6 Superblock backups stored on blocks:
18 Pass 1: Checking inodes, blocks, and sizes
23 test_filesys: 11/16384 files (0.0% non-contiguous), 6239/262144 blocks
69 Pass 1: Checking inodes, blocks, and sizes
83 Free blocks count wrong for group #0 (5838, counted=5851).
86 Free blocks count wrong (255903, counted=255916).
103 test_filesys: 11/16384 files (0.0% non-contiguous), 6228/262144 blocks
[all...] |
