| /external/webrtc/webrtc/modules/desktop_capture/ |
| differ_block_unittest.cc | 31 void PrepareBuffers(uint8_t* &block1, uint8_t* &block2) {
35 block2 = block1 + kSizeOfBlock;
36 memcpy(block2, block1, kSizeOfBlock);
41 uint8_t* block2; local
42 PrepareBuffers(block1, block2);
46 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel);
53 uint8_t* block2; local
54 PrepareBuffers(block1, block2);
55 block2[kSizeOfBlock-2] += 1;
58 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel)
65 uint8_t* block2; local
77 uint8_t* block2; local
[all...] |
| /external/llvm/test/Transforms/GVN/ |
| basic.ll | 6 br label %block2
7 block2:
|
| local-pre.ll | 6 br i1 %cmp, label %block2, label %block3
8 block2:
|
| rle-nonlocal.ll | 6 br i1 %cmp , label %block2, label %block3
8 block2:
19 %existingPHI = phi i32* [ %a, %block2 ], [ %b, %block3 ]
|
| rle-semidominated.ll | 7 br i1 %cmp, label %block2, label %block3
9 block2:
|
| pre-load.ll | 7 br i1 %C, label %block2, label %block3
9 block2:
11 ; CHECK: block2:
30 br i1 %C, label %block2, label %block3
32 block2:
34 ; CHECK: block2:
42 %P2 = phi i32* [%p, %block3], [%q, %block2]
57 br i1 %C, label %block2, label %block3
59 block2:
61 ; CHECK: block2
[all...] |
| /art/compiler/optimizing/ |
| common_dominator.h | 30 static HBasicBlock* ForPair(HBasicBlock* block1, HBasicBlock* block2) {
32 finder.Update(block2);
45 HBasicBlock* block2 = dominator_; local
46 DCHECK(block2 != nullptr);
47 if (block == block2) {
58 block2 = block2->GetDominator();
59 DCHECK(block2 != nullptr);
62 while (block != block2) {
66 block2 = block2->GetDominator()
[all...] |
| linearize_test.cc | 61 // Block2 ++++++
86 // Block2 ++++++
111 // Block2 ++++++
138 // Block2
168 // Block2
197 // Block2 ++++++++++++++
224 // Block2 ++++++++
|
| bounds_check_elimination_test.cc | 90 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_); local
91 graph_->AddBlock(block2);
98 block2->AddInstruction(null_check);
99 block2->AddInstruction(array_length);
100 block2->AddInstruction(bounds_check2);
101 block2->AddInstruction(array_set);
142 block2->AddSuccessor(exit);
148 block1->AddSuccessor(block2); // False successor
188 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_); local
189 graph_->AddBlock(block2);
256 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_); local
[all...] |
| /external/llvm/test/CodeGen/Hexagon/ |
| early-if-phi-i1.ll | 10 br i1 %c, label %block2, label %block1
13 br label %block2
14 block2:
|
| /external/llvm/test/Transforms/CodeGenPrepare/X86/ |
| extend-sink-hoist.ll | 5 ; The first cast should be sunk into block2, in order that the
14 br label %block2
16 ; CHECK-LABEL: block2:
20 block2:
35 br label %block2
37 ; CHECK-LABEL: block2:
40 block2:
54 br i1 undef, label %block2, label %block3
56 block2:
62 %res = phi i128 [ %v2, %block1 ], [ %v4, %block2 ]
[all...] |
| /external/clang/test/CodeGen/ |
| blockwithlocalstatic.c | 15 int (^block2)(void) = ^ {
|
| /external/clang/test/SemaObjC/ |
| NSString-type.m | 7 void (^block2)(void) = @"help"; // expected-error {{initializing 'void (^)(void)' with an expression of incompatible type 'NSString *'}}
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_sync_test.cc | 78 u64 block2[4] = {}; // fake malloc block local
85 m->MoveMemory((uptr)&block1[0], (uptr)&block2[0], 4 * sizeof(u64));
90 mb1 = m->GetBlock((uptr)&block2[0]);
93 mb2 = m->GetBlock((uptr)&block2[3]);
100 s1 = m->GetIfExistsAndLock((uptr)&block2[0]);
102 EXPECT_EQ(s1->addr, (uptr)&block2[0]);
104 s2 = m->GetIfExistsAndLock((uptr)&block2[1]);
106 EXPECT_EQ(s2->addr, (uptr)&block2[1]);
108 m->FreeRange(thr, 0, (uptr)&block2[0], 4 * sizeof(u64));
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| PR17073.ll | 26 br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label %exit, label %block2
28 block2:
32 %storemerge = phi i32* [ null, %entry ],[ null, %block2 ], [ select (i1 icmp eq (i64 urem (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), %block1 ]
46 br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label %exit, label %block2
48 block2:
52 %storemerge = phi i32* [ select (i1 icmp eq (i64 urem (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), %entry ],[ null, %block2 ], [ null, %block1 ]
65 br i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a), label %exit, label %block2
67 block2:
71 %storemerge = phi i32* [ null, %entry ],[ null, %block2 ], [ select (i1 icmp eq (i64 add (i64 2, i64 zext (i1 icmp eq (i32* bitcast (i8* @b to i32*), i32* @a) to i64)), i64 0), i32* null, i32* @a), %block1 ]
|
| /external/clang/test/CodeGenCXX/ |
| instantiate-blocks.cpp | 27 void (^block2)() = ^{};
|
| /external/clang/test/SemaObjCXX/ |
| NSString-type.mm | 7 void (^block2)(void) = @"help"; // expected-error {{cannot initialize a variable of type 'void (^)()' with an rvalue of type 'NSString *'}}
|
| /external/valgrind/cachegrind/ |
| cg_sim.c | 130 UWord block2 = (a+size-1) >> c->line_size_bits; local
143 if (block1 == block2)
147 else if (block1 + 1 == block2) {
148 UInt set2 = block2 & c->sets_min_1;
149 UWord tag2 = block2;
159 a, size, block1, block2);
226 UWord block1, block2; local
230 block2 = (a+size-1) >> I1.line_size_bits;
231 if (block1 != block2) return False;
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 298 set<int>::const_iterator block2 = block1; local
299 ++block2;
300 for (; block2 != f_blocks.end(); ++block2) {
301 if (IsBlockPairInPreconditioner(*block1, *block2)) {
302 block_pairs_.insert(make_pair(*block1, *block2));
315 const int block2 = row.cells[j].block_id - num_eliminate_blocks; local
316 if (block1 <= block2) {
317 if (IsBlockPairInPreconditioner(block1, block2)) {
318 block_pairs_.insert(make_pair(block1, block2));
406 const int block2 = it->second; local
[all...] |
| /external/deqp/data/gles3/shaders/ |
| declarations.test | 288 uniform Block2
291 } block2;
396 uniform Block2
456 uniform Block2
495 uniform Block2
|
| /external/freetype/src/base/ |
| ftutil.c | 150 FT_Pointer block2; local
155 block2 = memory->realloc( memory, cur_size, new_size, block );
156 if ( block2 == NULL )
159 block = block2;
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/ |
| ftutil.c | 150 FT_Pointer block2; local
155 block2 = memory->realloc( memory, cur_size, new_size, block );
156 if ( block2 == NULL )
159 block = block2;
|
| /external/llvm/test/Transforms/AddDiscriminators/ |
| first-only.ll | 76 ; CHECK: !DILexicalBlockFile(scope: ![[BLOCK2:[0-9]+]],{{.*}} discriminator: 1)
79 ; CHECK: ![[BLOCK2]] = distinct !DILexicalBlock(scope: ![[BLOCK1]],{{.*}} line: 3)
82 ; CHECK: ![[THEN]] = !DILocation(line: 4, scope: ![[BLOCK2]])
85 ; CHECK: ![[BR]] = !DILocation(line: 5, scope: ![[BLOCK2]])
|
| /external/pdfium/third_party/freetype/src/base/ |
| ftutil.c | 150 FT_Pointer block2; local
155 block2 = memory->realloc( memory, cur_size, new_size, block );
156 if ( block2 == NULL )
159 block = block2;
|
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 36 /// \brief Compare a pair of blocks: \p Block1 and \p Block2, which
38 /// Head2. \returns true if \p Block1 and \p Block2 contain identical
42 BasicBlock *Block1, BasicBlock *Block2);
308 /// Block1 is a block in the 1st if-region to compare. \param Block2 is a block
310 /// Block2 have identical instructions and do not have memory reference alias
315 BasicBlock *Block2) {
320 bool eq2 = (Block2 == Head2);
326 // Check whether instructions in Block1 and Block2 are identical
330 BasicBlock::iterator iter2 = Block2->begin();
331 BasicBlock::iterator end2 = Block2->getTerminator()->getIterator()
[all...] |
