| /external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
| differ_block_unittest.cc | 31 void PrepareBuffers(uint8_t* &block1, uint8_t* &block2) {
32 block1 = reinterpret_cast<uint8_t*>
34 GenerateData(block1, kSizeOfBlock);
35 block2 = block1 + kSizeOfBlock;
36 memcpy(block2, block1, kSizeOfBlock);
40 uint8_t* block1; local
42 PrepareBuffers(block1, block2);
46 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel);
52 uint8_t* block1; local
54 PrepareBuffers(block1, block2)
64 uint8_t* block1; local
76 uint8_t* block1; local
[all...] |
| /external/clang/test/Rewriter/ |
| objc-modern-implicit-cast.mm | 24 void(^block1)(void) = obj1;
26 return_id(block1);
30 return_block(block1);
|
| /external/llvm/test/Transforms/GVN/ |
| basic.ll | 4 block1:
|
| local-pre.ll | 4 block1:
|
| rle-semidominated.ll | 4 block1:
|
| rle-nonlocal.ll | 4 block1:
|
| /external/llvm/test/Transforms/CodeGenPrepare/X86/ |
| extend-sink-hoist.ll | 9 ; CHECK-LABEL: block1:
11 block1:
27 ; The first cast should be hoisted into block1, in order that the
30 ; CHECK-LABEL: block1:
33 block1:
51 block1:
62 %res = phi i128 [ %v2, %block1 ], [ %v4, %block2 ]
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_sync_test.cc | 77 u64 block1[4] = {}; // fake malloc block local
79 m->AllocBlock(thr, 0, (uptr)&block1[0], 3 * sizeof(u64));
80 m->AllocBlock(thr, 0, (uptr)&block1[3], 1 * sizeof(u64));
81 SyncVar *s1 = m->GetOrCreateAndLock(thr, 0, (uptr)&block1[0], true);
83 SyncVar *s2 = m->GetOrCreateAndLock(thr, 0, (uptr)&block1[1], true);
85 m->MoveMemory((uptr)&block1[0], (uptr)&block2[0], 4 * sizeof(u64));
86 MBlock *mb1 = m->GetBlock((uptr)&block1[0]);
88 MBlock *mb2 = m->GetBlock((uptr)&block1[3]);
96 s1 = m->GetIfExistsAndLock((uptr)&block1[0]);
98 s2 = m->GetIfExistsAndLock((uptr)&block1[1])
[all...] |
| /external/llvm/test/Transforms/SimplifyCFG/ |
| PR17073.ll | 4 ; The first test confirms that we don't do that when the trapping op is reached by the current BB (block1).
23 br i1 %tobool, label %exit, label %block1
25 block1:
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 ]
43 br i1 %tobool, label %exit, label %block1
45 block1:
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 ]
62 br i1 %tobool, label %exit, label %block1
64 block1:
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 ]
[all...] |
| /external/flac/libFLAC/ |
| metadata_object.c | 696 static FLAC__bool compare_block_data_streaminfo_(const FLAC__StreamMetadata_StreamInfo *block1, const FLAC__StreamMetadata_StreamInfo *block2)
698 if(block1->min_blocksize != block2->min_blocksize)
700 if(block1->max_blocksize != block2->max_blocksize)
702 if(block1->min_framesize != block2->min_framesize)
704 if(block1->max_framesize != block2->max_framesize)
706 if(block1->sample_rate != block2->sample_rate)
708 if(block1->channels != block2->channels)
710 if(block1->bits_per_sample != block2->bits_per_sample)
712 if(block1->total_samples != block2->total_samples)
714 if(0 != memcmp(block1->md5sum, block2->md5sum, 16)
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/web_request/ |
| upload_data_presenter_unittest.cc | 44 const char block1[] = "test"; local
45 const size_t block1_size = sizeof(block1) - 1;
52 base::BinaryValue::CreateWithCopiedBuffer(block1, block1_size));
71 raw_presenter.FeedNextBytes(block1, block1_size);
|
| /external/clang/test/CodeGen/ |
| blockwithlocalstatic.c | 10 void (^block1)(void) = ^ {
|
| /external/clang/test/SemaObjC/ |
| NSString-type.m | 6 void (^block1)(void) = pid;
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| value-ptr-bug.ll | 26 br i1 %cmp, label %block1, label %loop
28 block1:
37 %row_width.5 = phi i32 [ %sub267.lcssa, %block1 ], [ %dec, %do.body272 ]
38 %sp.4 = phi i8* [ %tmp30, %block1 ], [ %incdec.ptr273, %do.body272 ]
39 %dp.addr.4 = phi i8* [ %tmp29, %block1 ], [ %incdec.ptr274, %do.body272 ]
|
| /external/clang/test/SemaObjCXX/ |
| NSString-type.mm | 6 void (^block1)(void) = pid;
|
| /external/clang/test/Index/ |
| comment-c-decls.c | 103 int (^Block1) (int i, int j) = ^(int i, int j) { return i + j; };
104 // CHECK: <Declaration>int (^Block1)(int, int) = ^(int i, int j) {}</Declaration>
|
| format-comment-cdecls.c | 98 int (^Block1) (int i, int j) = ^(int i, int j) { return i + j; };
99 // CHECK: <Declaration>int (^Block1)(int, int) = ^(int i, int j) {}</Declaration>
|
| /external/chromium_org/sdch/open-vcdiff/src/ |
| blockhash.cc | 240 // at addresses block1 and block2. Returns true or false
243 inline bool CompareWholeWordValues(const char* block1,
245 return CompareWholeWordValues<1>(block1, block2) &&
246 CompareWholeWordValues<number_of_words - 1>(block1 + sizeof(uword_t),
271 inline bool BlockCompareWordsInline(const char* block1, const char* block2) {
273 return CompareWholeWordValues<kWordsPerBlock>(block1, block2);
276 bool BlockHash::BlockCompareWords(const char* block1, const char* block2) {
277 return BlockCompareWordsInline(block1, block2);
280 inline bool BlockContentsMatchInline(const char* block1, const char* block2) {
284 if (*block1 != *block2)
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_sim.c | 129 UWord block1 = a >> c->line_size_bits; local
131 UInt set1 = block1 & c->sets_min_1;
140 UWord tag1 = block1;
143 if (block1 == block2)
147 else if (block1 + 1 == block2) {
159 a, size, block1, block2);
226 UWord block1, block2; local
229 block1 = a >> I1.line_size_bits;
231 if (block1 != block2) return False;
|
| /art/compiler/optimizing/ |
| linearize_test.cc | 63 // Block1
88 // Block1
113 // Block1
140 // Block1
170 // Block1
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 295 for (set<int>::const_iterator block1 = f_blocks.begin();
296 block1 != f_blocks.end();
297 ++block1) {
298 set<int>::const_iterator block2 = block1;
301 if (IsBlockPairInPreconditioner(*block1, *block2)) {
302 block_pairs_.insert(make_pair(*block1, *block2));
313 const int block1 = row.cells[i].block_id - num_eliminate_blocks; local
316 if (block1 <= block2) {
317 if (IsBlockPairInPreconditioner(block1, block2)) {
318 block_pairs_.insert(make_pair(block1, block2))
405 const int block1 = it->first; local
[all...] |
| covariance_test.cc | 49 double* block1 = parameters; local
50 double* block2 = block1 + 1;
57 problem.AddParameterBlock(block1, 1);
89 covariance_blocks.push_back(make_pair(block1, block1));
94 covariance_blocks.push_back(make_pair(block4, block1)); // reversed
319 const double* block1 = covariance_blocks[i].first; local
321 // block1, block2
322 GetCovarianceBlockAndCompare(block1, block2, covariance, expected_covariance);
323 // block2, block1
[all...] |
| schur_eliminator_impl.h | 521 const int block1 = it1->first - num_eliminate_blocks_; local
534 CellInfo* cell_info = lhs->GetCell(block1, block2,
603 const int block1 = row.cells[i].block_id - num_eliminate_blocks_; local
604 DCHECK_GE(block1, 0);
608 CellInfo* cell_info = lhs->GetCell(block1, block1,
625 DCHECK_LT(block1, block2);
627 CellInfo* cell_info = lhs->GetCell(block1, block2,
656 const int block1 = row.cells[i].block_id - num_eliminate_blocks_; local
657 DCHECK_GE(block1, 0)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 37 /// \brief Compare a pair of blocks: \p Block1 and \p Block2, which
39 /// Head2. \returns true if \p Block1 and \p Block2 contain identical
43 BasicBlock *Block1, BasicBlock *Block2);
308 /// Block1 is a block in the 1st if-region to compare. \param Block2 is a block
309 // in the 2nd if-region to compare. \returns true if \param Block1 and \param
314 BasicBlock *Block1,
319 bool eq1 = (Block1 == Head1);
326 // Check whether instructions in Block1 and Block2 are identical
328 BasicBlock::iterator iter1 = Block1->begin();
329 BasicBlock::iterator end1 = Block1->getTerminator()
[all...] |
| /art/compiler/dex/ |
| ssa_transformation.cc | 296 * last element of the intersection of block1 and block2 dominators.
298 int MIRGraph::FindCommonParent(int block1, int block2) {
299 while (block1 != block2) {
300 while (block1 < block2) {
301 block1 = i_dom_list_[block1];
302 DCHECK_NE(block1, NOTVISITED);
304 while (block2 < block1) {
309 return block1;
|
