| /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/clang/test/CodeGen/ |
| blockwithlocalstatic.c | 15 int (^block2)(void) = ^ {
|
| /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...] |
| 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...] |
| select_generator.cc | 48 // Returns true if 'block1' and 'block2' are empty, merge into the same single
50 static bool BlocksMergeTogether(HBasicBlock* block1, HBasicBlock* block2) {
51 return block1->GetSingleSuccessor() == block2->GetSingleSuccessor();
|
| /external/llvm/test/CodeGen/SystemZ/Large/ |
| branch-range-07.py | 48 block2 = 'loop0' if i == 0 else 'after%d' % (i - 1)
50 ' [ %%nextcount%d, %%%s ]' % (i, i, block1, i, block2))
|
| branch-range-08.py | 49 block2 = 'loop0' if i == 0 else 'after%d' % (i - 1)
51 ' [ %%nextcount%d, %%%s ]' % (i, i, block1, i, block2))
|
| /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...] |
| visibility_based_preconditioner.h | 163 bool IsBlockPairInPreconditioner(int block1, int block2) const;
164 bool IsBlockPairOffDiagonal(int block1, int block2) const;
|
| covariance_test.cc | 50 double* block2 = block1 + 1; local
51 double* block3 = block2 + 2;
60 problem.AddParameterBlock(block2, 2);
91 covariance_blocks.push_back(make_pair(block2, block2));
93 covariance_blocks.push_back(make_pair(block2, block3));
320 const double* block2 = covariance_blocks[i].second; local
321 // block1, block2
322 GetCovarianceBlockAndCompare(block1, block2, covariance, expected_covariance);
323 // block2, block
[all...] |
| schur_eliminator_impl.h | 531 const int block2 = it2->first - num_eliminate_blocks_; local
534 CellInfo* cell_info = lhs->GetCell(block1, block2,
623 const int block2 = row.cells[j].block_id - num_eliminate_blocks_; local
624 DCHECK_GE(block2, 0);
625 DCHECK_LT(block1, block2);
627 CellInfo* cell_info = lhs->GetCell(block1, block2,
675 const int block2 = row.cells[j].block_id - num_eliminate_blocks_; local
676 DCHECK_GE(block2, 0);
677 DCHECK_LT(block1, block2);
680 CellInfo* cell_info = lhs->GetCell(block1, block2,
[all...] |
| covariance_impl.cc | 118 ParameterBlock* block2 = local
122 const int block2_size = block2->Size();
162 ParameterBlock* block2 = local
165 const LocalParameterization* local_param2 = block2->local_parameterization();
168 const int block2_size = block2->Size();
169 const int block2_local_size = block2->LocalSize();
|
| /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/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/clang/test/CodeGenCXX/ |
| instantiate-blocks.cpp | 27 void (^block2)() = ^{};
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlockList.java | 256 * @param block2 {@code non-null;} the other block to compare
261 BasicBlock block2) {
263 TypeList catches2 = block2.getExceptionHandlerTypes();
270 IntList succ2 = block2.getSuccessors();
274 int primary2 = block2.getPrimarySuccessor();
293 * It should be the case that block2's primary is at the
|