HomeSort by relevance Sort by last modified time
    Searched refs:block1 (Results 1 - 25 of 102) sorted by null

1 2 3 4 5

  /external/webrtc/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/CodeGen/
blockwithlocalstatic.c 10 void (^block1)(void) = ^ {
  /external/valgrind/none/tests/arm/
v8memory_a.c 50 static void show_block_xor ( UChar* block1, UChar* block2, Int n )
57 UInt diff = 0xFF & (UInt)(block1[i] - block2[i]);
89 UInt block1[5]; \
92 for (i = 0; i < 5; i++) block1[i] = block2[i] = randUInt(); \
93 block1[4] = block2[4] = (UInt)(&area1[N/2]); \
106 : : "r"(&block1[0]) : "r2", "r3", "r4", "r5", "r6", "r9", "r10", \
111 printf(" %08x r2 (xor, data intreg #1)\n", block1[0] ^ block2[0]); \
112 printf(" %08x r3 (xor, data intreg #2)\n", block1[1] ^ block2[1]); \
113 printf(" %08x r6 (xor, data intreg #3)\n", block1[2] ^ block2[2]); \
114 printf(" %08x r9 (xor, data intreg #4)\n", block1[3] ^ block2[3]);
    [all...]
v8memory_t.c 50 static void show_block_xor ( UChar* block1, UChar* block2, Int n )
57 UInt diff = 0xFF & (UInt)(block1[i] - block2[i]);
89 UInt block1[5]; \
92 for (i = 0; i < 5; i++) block1[i] = block2[i] = randUInt(); \
93 block1[4] = block2[4] = (UInt)(&area1[N/2]); \
106 : : "r"(&block1[0]) : "r2", "r3", "r4", "r5", "r6", "r9", "r10", \
111 printf(" %08x r2 (xor, data intreg #1)\n", block1[0] ^ block2[0]); \
112 printf(" %08x r3 (xor, data intreg #2)\n", block1[1] ^ block2[1]); \
113 printf(" %08x r6 (xor, data intreg #3)\n", block1[2] ^ block2[2]); \
114 printf(" %08x r9 (xor, data intreg #4)\n", block1[3] ^ block2[3]);
    [all...]
  /external/llvm/test/CodeGen/SystemZ/Large/
branch-range-07.py 47 block1 = 'entry' if i == branch_blocks - 1 else 'loop%d' % (i + 1)
50 ' [ %%nextcount%d, %%%s ]' % (i, i, block1, i, block2))
branch-range-08.py 48 block1 = 'entry' if i == branch_blocks - 1 else 'loop%d' % (i + 1)
51 ' [ %%nextcount%d, %%%s ]' % (i, i, block1, i, 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], true);
98 s2 = m->GetIfExistsAndLock((uptr)&block1[1], true)
    [all...]
  /external/valgrind/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/
common_dominator.h 30 static HBasicBlock* ForPair(HBasicBlock* block1, HBasicBlock* block2) {
31 CommonDominator finder(block1);
bounds_check_elimination_test.cc 82 HBasicBlock* block1 = new (&allocator_) HBasicBlock(graph_); local
83 graph_->AddBlock(block1);
86 block1->AddInstruction(cmp);
87 block1->AddInstruction(if_inst);
88 entry->AddSuccessor(block1);
147 block1->AddSuccessor(block3); // True successor
148 block1->AddSuccessor(block2); // False successor
180 HBasicBlock* block1 = new (&allocator_) HBasicBlock(graph_); local
181 graph_->AddBlock(block1);
184 block1->AddInstruction(cmp)
244 HBasicBlock* block1 = 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();
scheduler_test.cc 82 HBasicBlock* block1 = new (&allocator_) HBasicBlock(graph_); local
84 graph_->AddBlock(block1);
91 // block1:
132 block1->AddInstruction(instr);
  /external/ltp/testcases/kernel/fs/stream/
stream02.c 73 goto block1;
98 block1:
110 tst_resm(TPASS, "Test passed in block1.");
112 tst_resm(TFAIL, "Test failed in block1.");
  /external/boringssl/src/decrepit/xts/
xts.c 61 block128_f block1, block2; member in struct:xts128_context
91 (*ctx->block1)(scratch.c, scratch.c, ctx->key1);
121 (*ctx->block1)(scratch.c, scratch.c, ctx->key1);
145 (*ctx->block1)(scratch.c, scratch.c, ctx->key1);
156 (*ctx->block1)(scratch.c, scratch.c, ctx->key1);
189 xctx->xts.block1 = (block128_f) AES_encrypt;
192 xctx->xts.block1 = (block128_f) AES_decrypt;
  /external/libchrome/base/metrics/
persistent_memory_allocator_unittest.cc 110 Reference block1 = allocator_->Allocate(sizeof(TestObject1), 1); local
111 EXPECT_NE(0U, block1);
112 EXPECT_NE(nullptr, allocator_->GetAsObject<TestObject1>(block1, 1));
113 EXPECT_EQ(nullptr, allocator_->GetAsObject<TestObject2>(block1, 1));
114 EXPECT_LE(sizeof(TestObject1), allocator_->GetAllocSize(block1));
116 allocator_->GetAllocSize(block1));
126 allocator_->MakeIterable(block1);
127 EXPECT_EQ(block1, iter1a.GetNext(&type));
152 PersistentMemoryAllocator::Iterator iter1b(allocator_.get(), block1);
200 EXPECT_EQ(block1, iter2.GetNext(&type))
230 Reference block1 = allocator_->Allocate(TEST_MEMORY_PAGE \/ 2, 1); local
477 Reference block1 = allocator_->Allocate(sizeof(TestObject1), 1); local
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/rop/code/
BasicBlockList.java 255 * @param block1 {@code non-null;} one block to compare
260 public boolean catchesEqual(BasicBlock block1,
262 TypeList catches1 = block1.getExceptionHandlerTypes();
269 IntList succ1 = block1.getSuccessors();
273 int primary1 = block1.getPrimarySuccessor();
  /dalvik/dx/src/com/android/dx/rop/code/
BasicBlockList.java 254 * @param block1 {@code non-null;} one block to compare
259 public boolean catchesEqual(BasicBlock block1, BasicBlock block2) {
260 TypeList catches1 = block1.getExceptionHandlerTypes();
267 IntList succ1 = block1.getSuccessors();
271 int primary1 = block1.getPrimarySuccessor();
  /external/wycheproof/java/com/google/security/wycheproof/testcases/
DhiesTest.java 161 String block1 = TestUtil.bytesToHex(Arrays.copyOfRange(ciphertext, i, i + 16)); local
165 !block1.equals(block2));
EciesTest.java 251 String block1 = TestUtil.bytesToHex(Arrays.copyOfRange(ciphertext, 241, 257)); local
253 assertTrue("Ciphertext repeats:" + TestUtil.bytesToHex(ciphertext), !block1.equals(block2));
  /external/r8/src/main/java/com/android/tools/r8/ir/optimize/
PeepholeOptimizer.java 135 BasicBlock block0, BasicBlock block1, RegisterAllocator allocator) {
137 InstructionListIterator it1 = block1.listIterator(block1.getInstructions().size() - 1);
  /external/libvpx/libvpx/vp9/common/
vp9_reconinter.c 81 static MV mi_mv_pred_q2(const MODE_INFO *mi, int idx, int block0, int block1) {
83 mi->bmi[block1].as_mv[idx].as_mv.row),
85 mi->bmi[block1].as_mv[idx].as_mv.col) };
  /external/valgrind/callgrind/
sim.c 286 UWord block1 = a >> c->line_size_bits; local
288 UInt set1 = block1 & c->sets_min_1;
291 UWord tag1 = block1;
294 if (block1 == block2)
298 else if (block1 + 1 == block2) {
309 a, size, block1, block2);
    [all...]
  /external/flac/include/FLAC/
metadata.h     [all...]
  /external/swiftshader/src/OpenGL/libGLESv2/
Program.cpp     [all...]
Program.h 232 bool areMatchingUniformBlocks(const glsl::UniformBlock &block1, const glsl::UniformBlock &block2, const Shader *shader1, const Shader *shader2);

Completed in 3249 milliseconds

1 2 3 4 5