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

1 2

  /external/clang/test/CodeGen/
blockwithlocalstatic.c 10 void (^block1)(void) = ^ {
  /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/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...]
visibility_based_preconditioner.h 163 bool IsBlockPairInPreconditioner(int block1, int block2) const;
164 bool IsBlockPairOffDiagonal(int block1, int block2) const;
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...]
covariance_impl.cc 114 ParameterBlock* block1 = local
121 const int block1_size = block1->Size();
160 ParameterBlock* block1 = local
164 const LocalParameterization* local_param1 = block1->local_parameterization();
166 const int block1_size = block1->Size();
167 const int block1_local_size = block1->LocalSize();
  /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/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/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/
boolean_simplifier.cc 41 // Returns true if 'block1' and 'block2' are empty, merge into the same single
43 static bool BlocksDoMergeTogether(HBasicBlock* block1, HBasicBlock* block2) {
44 if (!block1->IsSingleGoto() || !block2->IsSingleGoto()) return false;
45 HBasicBlock* succ1 = block1->GetSuccessors().Get(0);
bounds_check_elimination_test.cc 61 HBasicBlock* block1 = new (&allocator) HBasicBlock(graph); local
62 graph->AddBlock(block1);
65 block1->AddInstruction(cmp);
66 block1->AddInstruction(if_inst);
67 entry->AddSuccessor(block1);
126 block1->AddSuccessor(block3); // True successor
127 block1->AddSuccessor(block2); // False successor
167 HBasicBlock* block1 = new (&allocator) HBasicBlock(graph); local
168 graph->AddBlock(block1);
171 block1->AddInstruction(cmp)
239 HBasicBlock* block1 = new (&allocator) HBasicBlock(graph); 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/dexmaker/src/dx/java/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();
  /art/compiler/dex/
ssa_transformation.cc 271 * last element of the intersection of block1 and block2 dominators.
273 int MIRGraph::FindCommonParent(int block1, int block2) {
274 while (block1 != block2) {
275 while (block1 < block2) {
276 block1 = i_dom_list_[block1];
277 DCHECK_NE(block1, NOTVISITED);
279 while (block2 < block1) {
284 return block1;
mir_graph.h     [all...]
  /external/boringssl/src/crypto/modes/
internal.h 178 block128_f block1, block2; member in struct:xts128_context
  /external/libvpx/libvpx/vp9/common/
vp9_reconinter.c 120 static MV mi_mv_pred_q2(const MODE_INFO *mi, int idx, int block0, int block1) {
122 mi->bmi[block1].as_mv[idx].as_mv.row),
124 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/valgrind/none/tests/arm64/
memory.c 305 static void show_block_xor ( UChar* block1, UChar* block2, Int n )
312 UInt diff = 0xFF & (UInt)(block1[i] - block2[i]);
    [all...]
  /external/elfutils/src/libdw/
known-dwarf.h 265 ONE_KNOWN_DW_FORM (block1, DW_FORM_block1) \
    [all...]
  /external/tremolo/Tremolo/
mdctLARM.s 598 @ block1

Completed in 824 milliseconds

1 2