/haiku-buildtools/binutils/ld/testsuite/ld-scripts/ |
H A D | expr2.d | 1 # ld: -T expr2.t
|
H A D | expr.exp | 23 run_dump_test expr2
|
/haiku-buildtools/isl/include/isl/ |
H A D | ast.h | 74 __isl_take isl_ast_expr *expr2); 76 __isl_take isl_ast_expr *expr2); 78 __isl_take isl_ast_expr *expr2); 80 __isl_take isl_ast_expr *expr2); 82 __isl_take isl_ast_expr *expr2); 84 __isl_take isl_ast_expr *expr2);
|
/haiku-buildtools/gcc/gcc/fortran/ |
H A D | class.c | 1038 gfc_expr *expr, *expr2; local 1079 expr2 = gfc_build_intrinsic_call (sub_ns, GFC_ISYM_TRANSFER, "transfer", 1083 expr2->ts.type = BT_INTEGER; 1084 expr2->ts.kind = gfc_index_integer_kind; 1090 block->ext.actual->expr->value.op.op1 = expr2; 1118 gfc_expr *expr, *expr2; local 1124 block->expr2 = gfc_get_int_expr (gfc_index_integer_kind, NULL, 0); 1156 expr2 = gfc_get_expr (); 1157 expr2->expr_type = EXPR_OP; 1158 expr2 1319 gfc_expr *expr2; local [all...] |
H A D | trans-expr.c | 1324 gfc_trans_class_assign (gfc_expr *expr1, gfc_expr *expr2, gfc_exec_op op) argument 1342 && expr2->expr_type == EXPR_VARIABLE 1343 && expr2->symtree->n.sym->attr.flavor == FL_PROCEDURE 1347 if (expr2->ts.type != BT_CLASS) 1357 && expr2->expr_type == EXPR_NULL && expr2->ts.type == BT_UNKNOWN) 1359 rhs = gfc_get_null_expr (&expr2->where); 1363 if (expr2->expr_type == EXPR_NULL) 1366 vtab = gfc_find_vtab (&expr2->ts); 1381 else if (expr1->ts.type == BT_DERIVED && UNLIMITED_POLY (expr2)) 6817 alloc_scalar_allocatable_for_subcomponent_assignment(stmtblock_t *block, tree comp, gfc_component *cm, gfc_expr *expr2, gfc_symbol *sym) argument 7536 gfc_trans_pointer_assignment(gfc_expr * expr1, gfc_expr * expr2) argument 8138 arrayfunc_assign_needs_temporary(gfc_expr * expr1, gfc_expr * expr2) argument 8416 gfc_trans_arrayfunc_assign(gfc_expr * expr1, gfc_expr * expr2) argument 8576 gfc_trans_array_copy(gfc_expr * expr1, gfc_expr * expr2) argument 8624 gfc_trans_array_constructor_copy(gfc_expr * expr1, gfc_expr * expr2) argument 8765 alloc_scalar_allocatable_for_assignment(stmtblock_t *block, tree string_length, gfc_expr *expr1, gfc_expr *expr2) argument 8893 is_runtime_conformable(gfc_expr *expr1, gfc_expr *expr2) argument 8991 gfc_trans_assignment_1(gfc_expr * expr1, gfc_expr * expr2, bool init_flag, bool dealloc) argument 9326 gfc_trans_assignment(gfc_expr * expr1, gfc_expr * expr2, bool init_flag, bool dealloc) argument [all...] |
H A D | openmp.c | 1666 ns->code->expr2 = rvalue; 2795 copy->expr2 = gfc_copy_expr (ns->code->expr2); 3545 gfc_expr *expr2, *expr2_tmp; local 3571 expr2 = is_conversion (code->expr2, false); 3572 if (expr2 == NULL) 3575 expr2 = is_conversion (code->expr2, true); 3576 if (expr2 [all...] |
H A D | st.c | 87 if (p->expr2) 88 gfc_free_expr (p->expr2);
|
H A D | dependency.c | 1175 check_data_pointer_types (gfc_expr *expr1, gfc_expr *expr2) argument 1184 || expr2->expr_type != EXPR_VARIABLE) 1188 sym2 = expr2->symtree->n.sym; 1242 true if expr2 depends on expr1. expr1 should be a single term 1250 gfc_check_dependency (gfc_expr *expr1, gfc_expr *expr2, bool identical) argument 1258 switch (expr2->expr_type) 1261 n = gfc_check_dependency (expr1, expr2->value.op.op1, identical); 1264 if (expr2->value.op.op2) 1265 return gfc_check_dependency (expr1, expr2->value.op.op2, identical); 1270 if (expr1->symtree->n.sym != expr2 [all...] |
H A D | trans-stmt.c | 699 if (!code->expr2 && !code->expr4 && flag_coarray != GFC_FCOARRAY_LIB) 702 if (code->expr2) 704 gcc_assert (code->expr2->expr_type == EXPR_VARIABLE); 706 gfc_conv_expr_val (&argse, code->expr2); 880 if (code->expr2) 882 gcc_assert (code->expr2->expr_type == EXPR_VARIABLE); 884 gfc_conv_expr_val (&argse, code->expr2); 1043 if (!code->expr2 && !(gfc_option.rtcheck & GFC_RTCHECK_BOUNDS) 1057 if (code->expr2) 1059 gcc_assert (code->expr2 3472 generate_loop_for_rhs_to_temp(gfc_expr *expr2, tree tmp1, tree count3, tree count1, gfc_ss *lss, gfc_ss *rss, tree wheremask, bool invert) argument 3584 compute_inner_temp_size(gfc_expr *expr1, gfc_expr *expr2, stmtblock_t * pblock, gfc_ss **lss, gfc_ss **rss) argument 3786 gfc_trans_assign_need_temp(gfc_expr * expr1, gfc_expr * expr2, tree wheremask, bool invert, forall_info * nested_forall_info, stmtblock_t * block) argument 3879 gfc_trans_pointer_assign_need_temp(gfc_expr * expr1, gfc_expr * expr2, forall_info * nested_forall_info, stmtblock_t * block) argument 4578 gfc_trans_where_assign(gfc_expr *expr1, gfc_expr *expr2, tree mask, bool invert, tree count1, tree count2, gfc_code *cnext) argument 4797 gfc_expr *expr2; local [all...] |
H A D | trans-openmp.c | 1494 e2 = gfc_copy_expr (n->udr->initializer->expr2); 1557 e4 = gfc_copy_expr (n->udr->combiner->expr2); 2773 gfc_expr *expr2, *e; local 2791 expr2 = code->expr2; 2792 if (expr2->expr_type == EXPR_FUNCTION 2793 && expr2->value.function.isym->id == GFC_ISYM_CONVERSION) 2794 expr2 = expr2->value.function.actual->expr; 2802 gfc_conv_expr (&lse, expr2); [all...] |
H A D | trans.c | 1129 gfc_add_finalizer_call (stmtblock_t *block, gfc_expr *expr2) argument 1138 if (!expr2 || (expr2->ts.type != BT_DERIVED && expr2->ts.type != BT_CLASS)) 1141 if (expr2->ts.type == BT_DERIVED) 1143 gfc_is_finalizable (expr2->ts.u.derived, &final_expr); 1150 expr = gfc_copy_expr (expr2); 1175 if (!expr2->rank && !expr2->ref && CLASS_DATA (expr2 [all...] |
H A D | frontend-passes.c | 139 gfc_expr *expr1, *expr2; local 152 expr2 = gfc_discard_nops (co->expr2); 153 if (expr2->expr_type != EXPR_VARIABLE) 156 if (!gfc_check_dependency (expr1, expr2, true)) 162 n = create_var (expr2); 163 co->expr2 = n; 669 n->expr2 = e; 1064 n->expr2 = c->expr2; [all...] |
H A D | match.c | 1237 new_st.expr2 = rvalue; 1281 new_st.expr2 = rvalue; 2915 new_st.expr2 = stat; 3110 new_st.expr2 = stat; 3298 new_st.expr2 = stat; 3535 it in expr2 so we can distinguish then and produce the correct 3537 new_st.expr2 = expr; 3900 new_st.expr2 = errmsg; 3973 tail->expr2 = e; 3991 gfc_free_expr (new_st.expr2); 5513 gfc_expr *expr1, *expr2 = NULL; local [all...] |
H A D | resolve.c | 7072 init_st->expr2 = init_e; 7235 errmsg = code->expr2; 7661 is in code->expr1, but for a computed GOTO it is in code->expr2. All 7680 case_expr = code->expr2; 7688 case_expr from expr2 to expr so that we can handle computed 7690 code->expr1 = code->expr2; 7691 code->expr2 = NULL; 8089 && !(code->expr2 && code->expr2->ts.type == BT_CLASS)) 8099 if (code->expr2) 8842 resolve_where_shape(gfc_expr *expr1, gfc_expr *expr2) argument 9604 build_assignment(gfc_exec_op op, gfc_expr *expr1, gfc_expr *expr2, gfc_component *comp1, gfc_component *comp2, locus loc) argument [all...] |
H A D | trans-array.c | 8374 gfc_expr *expr2) 8407 expr2 accordingly. */ 8408 if (expr1->expr_type == EXPR_FUNCTION && expr2 == NULL) 8410 expr2 = expr1; 8423 || (expr2 && !expr2->rank)) 8444 if (expr2 && rss == gfc_ss_terminator) 8477 if (expr2 && expr2->expr_type == EXPR_FUNCTION 8478 && expr2 8372 gfc_alloc_allocatable_for_assignment(gfc_loopinfo *loop, gfc_expr *expr1, gfc_expr *expr2) argument [all...] |
H A D | check.c | 291 /* If expr2 is constant, then check that the value is less than 296 gfc_expr *expr2, bool or_equal) 300 if (expr2->expr_type == EXPR_CONSTANT) 302 gfc_extract_int (expr2, &i2); 315 &expr2->where, arg1); 326 arg2, &expr2->where, arg1); 335 arg2, &expr2->where, arg1); 370 /* If expr2 and expr3 are constants, then check that the value is less than 375 gfc_expr *expr2, const char *arg3, gfc_expr *expr3) 379 if (expr2 295 less_than_bitsize1(const char *arg1, gfc_expr *expr1, const char *arg2, gfc_expr *expr2, bool or_equal) argument 374 less_than_bitsize2(const char *arg1, gfc_expr *expr1, const char *arg2, gfc_expr *expr2, const char *arg3, gfc_expr *expr3) argument [all...] |
/haiku-buildtools/isl/ |
H A D | isl_ast_build_expr.c | 141 /* Create an expression representing the sum of "expr1" and "expr2", 145 __isl_take isl_ast_expr *expr2) 147 if (!expr1 || !expr2) 152 return expr2; 155 if (ast_expr_is_zero(expr2)) { 156 isl_ast_expr_free(expr2); 160 return isl_ast_expr_add(expr1, expr2); 163 isl_ast_expr_free(expr2); 167 /* Subtract expr2 from expr1. 169 * If expr2 i 144 ast_expr_add(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 178 ast_expr_sub(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument [all...] |
H A D | isl_ast.c | 448 * applied to "expr1" and "expr2". 451 __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) 456 if (!expr1 || !expr2) 465 expr->u.op.args[1] = expr2; 470 isl_ast_expr_free(expr2); 474 /* Create an expression representing the sum of "expr1" and "expr2". 477 __isl_take isl_ast_expr *expr2) 479 return isl_ast_expr_alloc_binary(isl_ast_op_add, expr1, expr2); 482 /* Create an expression representing the difference of "expr1" and "expr2". 485 __isl_take isl_ast_expr *expr2) 450 isl_ast_expr_alloc_binary(enum isl_ast_op_type type, __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 476 isl_ast_expr_add(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 484 isl_ast_expr_sub(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 492 isl_ast_expr_mul(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 500 isl_ast_expr_div(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 508 isl_ast_expr_and(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument 516 isl_ast_expr_or(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) argument [all...] |
H A D | isl_ast_private.h | 41 __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2);
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | rotate.go | 134 expr2 := fmt.Sprintf("%s>>%d %c %s<<%d", v, r, op, v, l) 152 fmt.Fprintf(b, "\tcheck_%s(%q, %s, %s(%s))\n", typ, expr2, expr2, typ, result)
|
/haiku-buildtools/legacy/gcc/gcc/f/ |
H A D | stt.h | 63 ffebld expr2; member in struct:_ffest_case_list_ 64 bool range; /* TRUE if "[expr1]:[expr2]", FALSE if
|
H A D | stt.c | 90 new->expr2 = case2; 113 new->expr2 = NULL; 140 if (next->expr2 != NULL) 141 ffebld_dump (next->expr2);
|
/haiku-buildtools/gcc/gcc/ |
H A D | sel-sched-ir.c | 2201 expr_t expr2; 2203 expr2 = av_set_lookup_other_equiv_expr (*avp, expr); 2204 if (expr2 != NULL) 2208 EXPR_TARGET_AVAILABLE (expr2) = -1; 2209 EXPR_USEFULNESS (expr2) = 0; 2211 merge_expr (expr2, expr, NULL); 2214 EXPR_USEFULNESS (expr2) = REG_BR_PROB_BASE; 2217 return expr2; 2266 expr_t expr2 = av_set_lookup (*fromp, EXPR_VINSN (expr1)); 2268 if (expr2) 2187 expr_t expr2; local 2252 expr_t expr2 = av_set_lookup (*fromp, EXPR_VINSN (expr1)); local 2277 expr_t expr2 = av_set_lookup_and_remove (fromp, EXPR_VINSN (expr1)); local 2401 expr_t expr, expr2; local [all...] |
H A D | tree-ssa-uninit.c | 1362 is_pred_expr_subset_of (pred_info expr1, pred_info expr2) argument 1366 if (pred_equal_p (expr1, expr2)) 1370 || (TREE_CODE (expr2.pred_rhs) != INTEGER_CST)) 1373 if (!operand_equal_p (expr1.pred_lhs, expr2.pred_lhs, 0)) 1379 code2 = expr2.cond_code; 1380 if (expr2.invert) 1386 wi::bit_and (expr1.pred_rhs, expr2.pred_rhs)); 1391 if (is_value_included_in (expr1.pred_rhs, expr2.pred_rhs, code2))
|
/haiku-buildtools/legacy/gcc/gcc/cp/ |
H A D | rtti.c | 615 tree result, td1, td2, td3, elems, expr2; 652 expr2 = build_headof (expr1); 669 (NULL_TREE, expr2, tree_cons 613 tree result, td1, td2, td3, elems, expr2; local
|