/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | vrp60.c | 6 int cst; local 8 cst = -__INT_MAX__ - 1; 10 cst = -__INT_MAX__; 11 x = x | cst; 19 int cst; local 21 cst = __INT_MAX__; 23 cst = __INT_MAX__ - 1; 24 x = x & cst;
|
/haiku-buildtools/binutils/gas/testsuite/gas/arm/ |
H A D | group-reloc-ldc-encoding-bad.s | 7 .macro ldctest load store cst 9 \load 0, c0, [r0, #:pc_g0:(f + \cst)] 10 \load 0, c0, [r0, #:pc_g1:(f + \cst)] 11 \load 0, c0, [r0, #:pc_g2:(f + \cst)] 13 \load 0, c0, [r0, #:sb_g0:(f + \cst)] 14 \load 0, c0, [r0, #:sb_g1:(f + \cst)] 15 \load 0, c0, [r0, #:sb_g2:(f + \cst)] 17 \store 0, c0, [r0, #:pc_g0:(f + \cst)] 18 \store 0, c0, [r0, #:pc_g1:(f + \cst)] 19 \store 0, c0, [r0, #:pc_g2:(f + \cst)] [all...] |
/haiku-buildtools/gcc/gcc/cp/ |
H A D | expr.c | 43 cplus_expand_constant (tree cst) argument 45 switch (TREE_CODE (cst)) 49 tree type = TREE_TYPE (cst); 53 member = PTRMEM_CST_MEMBER (cst); 57 return cst; 62 cst = byte_position (member); 71 cst = size_binop (PLUS_EXPR, cst, byte_position (member)); 73 cst = fold (build_nop (type, cst)); [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | misaligned-expand-1.c | 17 #define cst (int) 0xdeadbeef macro 34 g.i[k] = cst; 37 if (i != cst)
|
H A D | misaligned-expand-2.c | 17 #define cst (int) 0xdeadbeef macro 35 foo (&g.i[k], cst); 36 if (g.i[k] != cst)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/dwarf2/ |
H A D | template-params-10.C | 6 template< int S::* cst> struct D {};
|
/haiku-buildtools/legacy/binutils/opcodes/ |
H A D | h8300-dis.c | 92 int *cst, 100 *cst = thisnib & 3; 116 *cst *= 2; 119 *cst *= 4; 130 *cst *= 2; 133 *cst *= 4; 141 *cst = data[0]; 146 *cst = (data[0] << 8) + data [1]; 149 *cst = (short) *cst; /* Sig 88 extract_immediate(FILE *stream, op_type looking_for, int thisnib, unsigned char *data, int *cst, int *len, const struct h8_opcode *q) argument 185 print_one_arg(disassemble_info *info, bfd_vma addr, op_type x, int cst, int cstlen, int rdisp_n, int rn, const char **pregnames, int len) argument 334 int cst[3] = { 0, 0, 0 }; local [all...] |
/haiku-buildtools/binutils/opcodes/ |
H A D | h8300-dis.c | 80 int *cst, 88 *cst = thisnib & 3; 104 *cst *= 2; 107 *cst *= 4; 118 *cst *= 2; 121 *cst *= 4; 129 *cst = data[0]; 134 *cst = (data[0] << 8) + data [1]; 137 *cst = (short) *cst; /* Sig 76 extract_immediate(FILE *stream, op_type looking_for, int thisnib, unsigned char *data, int *cst, int *len, const struct h8_opcode *q) argument 173 print_one_arg(disassemble_info *info, bfd_vma addr, op_type x, int cst, int cstlen, int rdisp_n, int rn, const char **pregnames, int len) argument 322 int cst[3] = { 0, 0, 0 }; local [all...] |
/haiku-buildtools/binutils/include/opcode/ |
H A D | tic6x-insn-formats.h | 100 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 103 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 106 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 109 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 112 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 115 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 118 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 121 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 124 COMPFLD(cst, BFLD2(BFLD(13, 3, 0), BFLD(11, 1, 3))))) 129 COMPFLD(cst, BFLD [all...] |
H A D | tic6x-opcode-table.h | 227 ENC5(ENC(s, fu, 0), ENC(x, xpath, 0), ENC(cst, scst_l3i, 0), 335 ENC3(ENC(s, fu, 0), ENC(cst, ucst, 1), ENC(dst, reg, 2))) 339 ENC2(ENC(s, fu, 0), ENC(cst, ucst, 1))) 356 ENC3(ENC(s, fu, 0), ENC(cst, scst, 0), ENC(dst, reg, 1))) 362 ENC3(ENC(s, fu, 0), ENC(cst, ucst, 0), ENC(dst, reg, 1))) 497 ENC2(ENC(s, fu, 0), ENC(cst, pcrel, 0))) 549 ENC2(ENC(s, fu, 0), ENC(cst, pcrel_half_unsigned, 0))) 554 ENC3(ENC(s, fu, 0), ENC(cst, pcrel_half, 0), ENC(n, ucst, 1))) 559 ENC2(ENC(s, fu, 0), ENC(cst, pcrel_half_unsigned, 0))) 564 ENC3(ENC(s, fu, 0), ENC(cst, pcrel_hal [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | tree-chkp-opt.c | 91 tree cst; member in struct:pol_item 180 chkp_extend_const (tree cst) argument 182 if (TYPE_PRECISION (TREE_TYPE (cst)) < TYPE_PRECISION (size_type_node)) 183 return build_int_cst_type (size_type_node, tree_to_shwi (cst)); 185 return cst; 190 chkp_add_addr_item (address_t &addr, tree cst, tree var) argument 194 cst = chkp_extend_const (cst); 199 item.cst = cst; 217 chkp_sub_addr_item(address_t &addr, tree cst, tree var) argument [all...] |
H A D | double-int.h | 60 static double_int from_uhwi (unsigned HOST_WIDE_INT cst); 61 static double_int from_shwi (HOST_WIDE_INT cst); 210 double_int::from_shwi (HOST_WIDE_INT cst) argument 213 r.low = (unsigned HOST_WIDE_INT) cst; 214 r.high = cst < 0 ? -1 : 0; 233 double_int::from_uhwi (unsigned HOST_WIDE_INT cst) 236 r.low = cst;
|
H A D | double-int.c | 738 const double_int &cst = *this; local 742 r.low = cst.low & mask.low; 743 r.high = cst.high & mask.high; 753 const double_int &cst = *this; local 759 snum = cst.low; 763 snum = (unsigned HOST_WIDE_INT) cst.high; 767 r.low = cst.low | ~mask.low; 768 r.high = cst.high | ~mask.high; 772 r.low = cst.low & mask.low; 773 r.high = cst 784 const double_int &cst = *this; local [all...] |
H A D | tree-affine.c | 70 wide_int_ext_for_comb (const widest_int &cst, aff_tree *comb) argument 72 return wi::sext (cst, TYPE_PRECISION (comb->type)); 92 aff_combination_const (aff_tree *comb, tree type, const widest_int &cst) argument 95 comb->offset = wide_int_ext_for_comb (cst, comb);; 225 aff_combination_add_cst (aff_tree *c, const widest_int &cst) argument 227 c->offset = wide_int_ext_for_comb (c->offset + cst, c); 293 tree cst, core, toffset; local 323 cst = TREE_OPERAND (expr, 1); 324 if (TREE_CODE (cst) != INTEGER_CST) 327 aff_combination_scale (comb, wi::to_widest (cst)); 801 widest_int rem, cst; local [all...] |
H A D | tree-vect-generic.c | 467 tree cst = VECTOR_CST_ELT (op1, i); local 470 if (TREE_CODE (cst) != INTEGER_CST || integer_zerop (cst)) 476 && (!integer_pow2p (cst) || tree_int_cst_sgn (cst) != 1)) 480 shifts[i] = tree_log2 (cst); 491 unsigned HOST_WIDE_INT d = TREE_INT_CST_LOW (cst) & mask; 561 HOST_WIDE_INT d = TREE_INT_CST_LOW (cst); 651 tree zero, cst, cond; local 660 cst 1044 tree *cst; local [all...] |
H A D | tree-switch-conversion.c | 1004 wide_int cst; 1009 cst = elt->value; 1016 if (sign >= 0 && cst == wi::zext (cst, prec)) 1018 if (sign == 0 && cst == wi::sext (cst, prec)) 1023 if (sign <= 0 && cst == wi::sext (cst, prec)) 1063 tree name, cst; 1073 cst 1001 wide_int cst; local 1060 tree name, cst; local [all...] |
H A D | tree-object-size.c | 1108 tree cst = gimple_assign_rhs2 (stmt); local 1110 gcc_assert (TREE_CODE (cst) == INTEGER_CST); 1113 depth + !integer_zerop (cst)); 1175 tree cst = gimple_assign_rhs2 (stmt); local 1177 gcc_assert (TREE_CODE (cst) == INTEGER_CST); 1179 if (integer_zerop (cst)) 1301 tree cst = build_int_cstu (type, bytes); local 1302 gimple g = gimple_build_assign (lhs, code, tem, cst);
|
H A D | tree-chrec.c | 65 is_not_constant_evolution (const_tree cst) argument 67 return (TREE_CODE (cst) == POLYNOMIAL_CHREC); 76 tree cst) 79 gcc_assert (cst); 81 gcc_checking_assert (!is_not_constant_evolution (cst)); 89 chrec_fold_plus (type, CHREC_LEFT (poly), cst), 95 chrec_fold_minus (type, CHREC_LEFT (poly), cst), 101 chrec_fold_multiply (type, CHREC_LEFT (poly), cst), 102 chrec_fold_multiply (type, CHREC_RIGHT (poly), cst)); 1571 Multiplications are restricted to constant scaling: "cst * 73 chrec_fold_poly_cst(enum tree_code code, tree type, tree poly, tree cst) argument [all...] |
H A D | tree-streamer-out.c | 1042 streamer_write_integer_cst (struct output_block *ob, tree cst, bool ref_p) argument 1045 int len = TREE_INT_CST_NUNITS (cst); 1046 gcc_assert (!TREE_OVERFLOW (cst)); 1048 stream_write_tree (ob, TREE_TYPE (cst), ref_p); 1055 streamer_write_hwi (ob, TREE_INT_CST_ELT (cst, i));
|
/haiku-buildtools/isl/ |
H A D | isl_polynomial.c | 109 struct isl_upoly_cst *cst; local 116 cst = isl_upoly_as_cst(up); 117 if (!cst) 120 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d); 125 struct isl_upoly_cst *cst; local 132 cst = isl_upoly_as_cst(up); 133 if (!cst) 136 return isl_int_sgn(cst->n); 141 struct isl_upoly_cst *cst; local 157 struct isl_upoly_cst *cst; local 173 struct isl_upoly_cst *cst; local 189 struct isl_upoly_cst *cst; local 205 struct isl_upoly_cst *cst; local 221 struct isl_upoly_cst *cst; local 240 struct isl_upoly_cst *cst; local 254 struct isl_upoly_cst *cst; local 268 struct isl_upoly_cst *cst; local 282 struct isl_upoly_cst *cst; local 296 struct isl_upoly_cst *cst; local 311 struct isl_upoly_cst *cst; local 443 upoly_free_cst(__isl_take struct isl_upoly_cst *cst) argument 468 struct isl_upoly_cst *cst; local 550 isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst) argument 610 struct isl_upoly *cst; local 718 struct isl_upoly_cst *cst; local 760 struct isl_upoly_cst *cst; local 810 struct isl_upoly_cst *cst; local 1133 struct isl_upoly_cst *cst; local 1678 struct isl_upoly_cst *cst; local 1696 struct isl_upoly_cst *cst; local 1721 struct isl_upoly_cst *cst; local 1792 update_coeff(__isl_keep isl_vec *aff, __isl_keep struct isl_upoly_cst *cst, int pos) argument 1815 struct isl_upoly_cst *cst; local 1822 struct isl_upoly_cst *cst; local 1895 struct isl_upoly_cst *cst; local 2269 struct isl_upoly_cst *cst; local 2291 struct isl_upoly_cst *cst; local 3803 struct isl_upoly_cst *cst; local 4302 struct isl_upoly *cst; local 4464 constant_on_domain( __isl_take isl_basic_set *bset, int cst) argument [all...] |
H A D | isl_equalities.c | 72 struct isl_mat *cst = NULL; local 103 cst = isl_mat_alloc(B->ctx, B->n_row, 0); 105 cst = isl_mat_sub_alloc(C, 1, B->n_row, 0, 1); 107 cst = isl_mat_product(T, cst); 111 return cst; 311 struct isl_mat *cst = NULL; local 318 cst = particular_solution(B, d); 319 if (!cst) 321 if (cst [all...] |
H A D | isl_tab_pip.c | 2667 struct isl_vec *cst; local 2671 cst = isl_vec_alloc(cgbr->tab->mat->ctx, bset->n_ineq); 2672 if (!cst) 2676 isl_int_set(cst->el[i], bset->ineq[i][0]); 2688 isl_int_set(bset->ineq[i][0], cst->el[i]); 2690 isl_vec_free(cst); 4318 * of the bounds in "cst", check whether we need to split the domain 4327 __isl_keep isl_mat *cst) 4333 pos = cst->n_col - 1; 4353 for (j = 0; j < cst 4326 need_split_basic_map(__isl_keep isl_basic_map *bmap, __isl_keep isl_mat *cst) argument 4371 need_split_basic_set(__isl_keep isl_basic_set *bset, __isl_keep isl_mat *cst) argument 4381 need_split_set(__isl_keep isl_set *set, __isl_keep isl_mat *cst) argument 4405 split(__isl_take isl_set *empty, __isl_take isl_set *min_expr, __isl_take isl_mat *cst) argument 4451 split_domain(__isl_take isl_map *opt, __isl_take isl_set *min_expr, __isl_take isl_mat *cst) argument 4509 basic_map_partial_lexopt_symm_map_core( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space) argument 4563 basic_map_partial_lexopt_symm( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second, __isl_give union isl_lex_res (*core)(__isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space)) argument 4578 isl_mat *cst = NULL; local 5491 split_domain_pma( __isl_take isl_pw_multi_aff *opt, __isl_take isl_pw_aff *min_expr_pa, __isl_take isl_set *min_expr, __isl_take isl_mat *cst) argument 5551 basic_map_partial_lexopt_symm_pma_core( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space) argument [all...] |
H A D | isl_flow.c | 1104 isl_vec *cst; member in struct:isl_sched_info 1111 isl_vec_free(info->cst); 1145 info->cst = isl_vec_alloc(ctx, n); 1146 if (n && (!info->is_cst || !info->cst)) 1157 info->cst = isl_vec_set_element_val(info->cst, i, v); 1262 n1 = isl_vec_size(info1->cst); 1263 n2 = isl_vec_size(info2->cst); 1276 cmp = isl_vec_cmp_element(info1->cst, info2->cst, [all...] |
/haiku-buildtools/legacy/gcc/gcc/cp/ |
H A D | expr.c | 43 cplus_expand_constant (cst) 44 tree cst; 46 switch (TREE_CODE (cst)) 50 tree type = TREE_TYPE (cst); 55 member = PTRMEM_CST_MEMBER (cst); 70 cst = cp_convert (type, offset); 79 expand_ptrmemfunc_cst (cst, &delta, &idx, &pfn, &delta2); 81 cst = build_ptrmemfunc1 (type, delta, idx, 92 return cst;
|
/haiku-buildtools/gcc/libcc1/ |
H A D | plugin.cc | 611 tree cst, decl, cons; 616 cst = build_int_cst (enum_type, value); 621 DECL_INITIAL (decl) = cst; 624 cons = tree_cons (DECL_NAME (decl), cst, TYPE_VALUES (enum_type)); 800 tree cst, decl; 803 cst = build_int_cst (type, value); 806 DECL_INITIAL (decl) = cst; 602 tree cst, decl, cons; local 791 tree cst, decl; local
|