| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
64 /// This method is for tracking visited blocks in the main threadsafety
73 std::vector<const CFGBlock*> Blocks;
84 iterator begin() { return Blocks.rbegin(); }
85 iterator end() { return Blocks.rend(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
88 const_iterator end() const { return Blocks.rend(); }
|
| /system/update_engine/payload_generator/ |
| block_mapping.h | 31 // BlockMapping allows to map data blocks (brillo::Blobs of block_size size)
33 // hash function in that two blocks with the same data will have the same id but
34 // also two blocks with the same id will have the same data. This is only valid
52 // This is a helper method to add |num_blocks| contiguous blocks reading them
54 // Returns whether it succeeded to add all the disk blocks and stores in
55 // |block_ids| the block id for each one of the added blocks.
96 // Maps the blocks of the old and new partitions |old_part| and |new_part| whose
97 // size in bytes are |old_size| and |new_size| into block ids where two blocks
|
| delta_diff_utils_unittest.cc | 43 // Writes the |data| in the blocks specified by |extents| on the partition
44 // |part_path|. The |data| size could be smaller than the size of the blocks
81 // Writes to the |partition| path blocks such they are all different and they
203 // utilize all sub-cases of such chunks: blocks 21--22 induce a split (src)
204 // and complete removal (dst), whereas blocks 24--25 induce trimming of the
225 // The size of the data should match the total number of blocks. Each block
478 // Test the simple case where all the blocks are different and no new blocks are
487 EXPECT_EQ(0U, old_visited_blocks_.blocks());
488 EXPECT_EQ(0U, new_visited_blocks_.blocks());
[all...] |
| ext2_filesystem_unittest.cc | 52 // Checks that all the blocks in |extents| are in the range [0, total_blocks).
146 "/sparse_empty-2blocks",
147 "/sparse-10000blocks",
151 "<inode-blocks>",
159 // Small symlinks don't actually have data blocks.
163 // Hard-links report the same list of blocks.
168 // The number of blocks in these files doesn't depend on the
174 EXPECT_TRUE(map_files["/sparse_empty-2blocks"].extents.empty());
|
| mapfile_filesystem.cc | 37 // The .map file is defined in terms of 4K blocks.
99 string blocks = local
101 size_t dash = blocks.find('-', 0);
103 if (dash == string::npos && base::StringToUint64(blocks, &block_start)) {
106 base::StringToUint64(blocks.substr(0, dash), &block_start) &&
107 base::StringToUint64(blocks.substr(dash + 1), &block_end)) {
118 << " blocks" << std::endl
131 // We parsed the blocks from the end of the line, so we need to reverse
|
| /external/e2fsprogs/tests/f_ind_inode_collision/ |
| expect.1 | 1 Pass 1: Checking inodes, blocks, and sizes
12 Running additional passes to resolve blocks claimed by more than one inode...
13 Pass 1B: Rescanning for multiply-claimed blocks
50 Error while iterating over blocks in inode 12 (pass1b): Illegal indirect block found
51 Pass 1C: Scanning directories for inodes with multiply-claimed blocks
52 Pass 1D: Reconciling multiply-claimed blocks
53 (There are 3 inodes containing multiply-claimed blocks.)
58 Clone multiply-claimed blocks? yes
63 Clone multiply-claimed blocks? yes
71 Clone multiply-claimed blocks? ye
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop.
24 // * the successor blocks of the loop
73 // The list of blocks in this loop. First entry is the header node.
74 std::vector<BlockT*> Blocks;
93 /// for consistency with loop depth values used for basic blocks, where depth
94 /// 0 is used for blocks not inside any loops.
102 BlockT *getHeader() const { return Blocks.front(); }
138 /// Get a list of the basic blocks which make up this loop.
139 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
141 block_iterator block_begin() const { return Blocks.begin();
143 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /art/runtime/gc/space/ |
| bump_pointer_space-walk-inl.h | 50 // If we have 0 blocks then we need to update the main header since we have bump pointer style
57 // We don't have any other blocks, this means someone else may be allocating into the main
58 // block. In this case, we don't want to try and visit the other blocks after the main block
70 // since there is guaranteed to be not other blocks.
77 // Walk the other blocks (currently only TLABs).
|
| /external/e2fsprogs/tests/d_dumpe2fs_group_only/ |
| expect | 1 Creating filesystem with 1048576 4k blocks and 262144 inodes
2 Superblock backups stored on blocks:
7 Creating journal (16384 blocks): done
10 Pass 1: Checking inodes, blocks, and sizes
15 test_filesys: 11/262144 files (0.0% non-contiguous), 34894/1048576 blocks
|
| /external/swiftshader/third_party/LLVM/tools/llvm-objdump/ |
| MCFunction.h | 75 MapTy Blocks;
87 iterator begin() const { return Blocks.begin(); }
88 iterator end() const { return Blocks.end(); }
93 Blocks.push_back(std::make_pair(Address, BB));
94 return Blocks.back().second;
|
| /external/v8/src/compiler/ |
| scheduler.h | 27 // Computes a schedule from a graph, placing nodes into basic blocks and
28 // ordering the basic blocks in the special RPO order.
39 // Compute the RPO of blocks in an existing schedule.
72 CFGBuilder* control_flow_builder_; // Builds basic blocks for controls.
73 SpecialRPONumberer* special_rpo_; // Special RPO numbering of blocks.
|
| /external/v8/src/crankshaft/ |
| hydrogen-dce.cc | 51 for (int i = 0; i < graph()->blocks()->length(); ++i) {
52 HBasicBlock* block = graph()->blocks()->at(i);
68 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone());
71 for (int i = 0; i < graph()->blocks()->length(); ++i) {
72 HBasicBlock* block = graph()->blocks()->at(i);
|
| /external/zopfli/src/zopfli/ |
| deflate.h | 37 This function will usually output multiple deflate blocks. If final is 1, then
42 -0: non compressed blocks (00)
43 -1: blocks with fixed tree (01)
44 -2: blocks with dynamic tree (10)
51 because deflate appends blocks as bit-based data, rather than on byte
|
| /frameworks/base/core/java/android/os/ |
| StatFs.java | 91 * The total number of blocks on the file system. This corresponds to the
107 * The total number of blocks that are free on the file system, including
108 * reserved blocks (that are not available to normal applications). This
118 * blocks (that are not available to normal applications). Most applications
134 * The number of blocks that are free on the file system and available to
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| nilcheck_test.go | 93 for _, b := range fun.f.Blocks {
94 if b == fun.blocks["secondCheck"] && isNilCheck(b) {
130 for _, b := range fun.f.Blocks {
131 if b == fun.blocks["secondCheck"] && isNilCheck(b) {
163 for _, b := range fun.f.Blocks {
164 if b == fun.blocks["checkPtr"] && isNilCheck(b) {
197 for _, b := range fun.f.Blocks {
198 if b == fun.blocks["checkPtr"] && isNilCheck(b) {
241 for _, b := range fun.f.Blocks {
242 if b == fun.blocks["checkPtr"] && isNilCheck(b)
[all...] |
| /prebuilts/go/darwin-x86/test/chan/ |
| select3.go | 38 // Calls f and empirically verifies that f always/never blocks depending on signal.
61 // sending/receiving from a nil channel blocks
85 // sending to an async channel with free buffer space never blocks
91 // receiving from a closed channel never blocks
109 // receiving from a non-ready channel always blocks
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| nilcheck_test.go | 93 for _, b := range fun.f.Blocks {
94 if b == fun.blocks["secondCheck"] && isNilCheck(b) {
130 for _, b := range fun.f.Blocks {
131 if b == fun.blocks["secondCheck"] && isNilCheck(b) {
163 for _, b := range fun.f.Blocks {
164 if b == fun.blocks["checkPtr"] && isNilCheck(b) {
197 for _, b := range fun.f.Blocks {
198 if b == fun.blocks["checkPtr"] && isNilCheck(b) {
241 for _, b := range fun.f.Blocks {
242 if b == fun.blocks["checkPtr"] && isNilCheck(b)
[all...] |
| /prebuilts/go/linux-x86/test/chan/ |
| select3.go | 38 // Calls f and empirically verifies that f always/never blocks depending on signal.
61 // sending/receiving from a nil channel blocks
85 // sending to an async channel with free buffer space never blocks
91 // receiving from a closed channel never blocks
109 // receiving from a non-ready channel always blocks
|
