HomeSort by: relevance | last modified time | path
    Searched defs:block2 (Results 1 - 9 of 9) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/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], true);
102 EXPECT_EQ(s1->addr, (uptr)&block2[0]);
104 s2 = m->GetIfExistsAndLock((uptr)&block2[1], true);
106 EXPECT_EQ(s2->addr, (uptr)&block2[1]);
108 m->FreeRange(thr->proc(), (uptr)&block2[0], 4 * sizeof(u64));
  /src/external/bsd/pkg_install/dist/lib/
pkg_signature.c 226 static const char block2[] = "algorithm: SHA512\nblock size: "; local
248 if (strncmp(hash_file, block2, strlen(block2)) != 0)
250 hash_file += strlen(block2);
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-ter.cc 403 tree block1, block2; local
425 block2 = LOCATION_BLOCK (locus2);
430 || (block1 != NULL_TREE && block1 != block2)))
  /src/external/gpl3/gcc.old/dist/gcc/fortran/
class.cc 1357 gfc_code *block2; local
1525 block2 = finalization_get_offset (idx, idx2, offset, strides, sizes,
1531 block2->next = finalization_scalarizer (array, ptr,
1534 block2 = block2->next;
1535 block2->next = finalization_scalarizer (tmp_array, ptr2, offset2, sub_ns);
1536 block2 = block2->next;
1539 block2->next = gfc_get_code (EXEC_ASSIGN);
1540 block2 = block2->next
    [all...]
trans.cc 712 stmtblock_t block2; local
718 gfc_start_block (&block2);
728 gfc_add_modify (&block2, res,
747 gfc_add_expr_to_block (&block2, tmp);
750 malloc_result = gfc_finish_block (&block2);
1172 stmtblock_t block2; local
1180 gfc_init_block (&block2);
1228 gfc_add_block_to_block (&block2, &se.pre);
1252 gfc_add_expr_to_block (&block2, tmp);
1253 tmp = gfc_finish_block (&block2);
    [all...]
trans-decl.cc 6975 stmtblock_t block2; local
6999 gfc_init_block (&block2);
7006 gfc_add_modify (&block2, cond_var, cond);
7024 gfc_simple_for_loop (&block2, idx, build_int_cst (TREE_TYPE (idx), 1),
7027 tmp = build3_v (COND_EXPR, cond_var, gfc_finish_block (&block2),
7032 gfc_init_block (&block2);
7037 gfc_add_modify (&block2, size_var, tmp);
7045 gfc_simple_for_loop (&block2, idx, build_int_cst (TREE_TYPE (idx), 1),
7053 gfc_add_modify (&block2, data, fold_convert (TREE_TYPE (data), call));
7115 gfc_simple_for_loop (&block2, idx, build_zero_cst (TREE_TYPE (idx))
7138 stmtblock_t block2; local
    [all...]
trans-expr.cc 5540 stmtblock_t block, block2; local
5734 gfc_init_block (&block2);
5748 gfc_add_modify (&block2, tmp2, fold_convert (TREE_TYPE (tmp2), tmp));
5754 gfc_add_modify (&block2, tmp2, fold_convert (TREE_TYPE (tmp2), tmp));
5829 gfc_add_expr_to_block (&block2, tmp2);
5860 gfc_simple_for_loop (&block2, idx, build_int_cst (TREE_TYPE (idx), 0),
5872 gfc_add_modify (&block2, tmp, build_int_cst (TREE_TYPE (tmp), -1));
5881 tmp = build3_v (COND_EXPR, tmp, gfc_finish_block (&block2),
5886 gfc_add_block_to_block (&block, &block2);
5908 gfc_init_block (&block2);
    [all...]
trans-intrinsic.cc 6081 stmtblock_t block, block2; local
6278 gfc_init_block (&block2);
6281 gfc_add_modify (&block2, nonempty_var, logical_true_node);
6300 gfc_add_expr_to_block (&block2, tmp);
6309 gfc_add_modify (&block2, limit, tmp);
6314 tree elsebody = gfc_finish_block (&block2);
6337 gfc_add_block_to_block (&block, &block2);
7995 stmtblock_t block2; local
7996 gfc_init_block (&block2);
8005 /* 'block2' contains the arg2 absent case, 'block' the arg2 presen
    [all...]
  /src/external/bsd/pcc/dist/pcc/mip/
optim2.c 1864 struct basicblock *block2 = 0; local
1890 block2=cn->bblock ;
1892 if (i+1 < count && map[i+1].block == block2)
1895 if (block2) break ;
1899 if (block2)
1900 bb = block2 ;

Completed in 69 milliseconds