/dragonfly/sys/vfs/hammer2/ |
H A D | hammer2_ccms.c | 53 bzero(cst, sizeof(*cst)); in ccms_cst_init() 84 if (cst->count < 0 && cst->td == curthread) { in ccms_thread_lock() 95 while (cst->count < 0 || cst->upgrade) { in ccms_thread_lock() 97 ssleep(cst, &cst->spin, 0, "ccmslck", hz); in ccms_thread_lock() 102 while (cst->count != 0 || cst->upgrade) { in ccms_thread_lock() 104 ssleep(cst, &cst->spin, 0, "ccmslck", hz); in ccms_thread_lock() 122 if (cst->count < 0 && cst->td == curthread) { in ccms_thread_lock_nonblock() 130 if (cst->count < 0 || cst->upgrade) { in ccms_thread_lock_nonblock() 137 if (cst->count != 0 || cst->upgrade) { in ccms_thread_lock_nonblock() 197 ssleep(cst, &cst->spin, 0, "ccmsupg", hz); in ccms_thread_lock_upgrade() [all …]
|
H A D | hammer2_ccms.h | 178 void ccms_cst_init(ccms_cst_t *cst); 179 void ccms_cst_uninit(ccms_cst_t *cst); 181 void ccms_thread_lock(ccms_cst_t *cst, ccms_state_t state); 182 int ccms_thread_lock_nonblock(ccms_cst_t *cst, ccms_state_t state); 183 ccms_state_t ccms_thread_lock_temp_release(ccms_cst_t *cst); 185 ccms_state_t ccms_thread_lock_upgrade(ccms_cst_t *cst); 186 void ccms_thread_lock_downgrade(ccms_cst_t *cst, ccms_state_t ostate); 187 void ccms_thread_unlock(ccms_cst_t *cst); 188 void ccms_thread_unlock_upgraded(ccms_cst_t *cst, ccms_state_t ostate); 189 int ccms_thread_lock_owned(ccms_cst_t *cst); [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | double-int.h | 73 r.high = cst < 0 ? -1 : 0; in shwi_to_double_int() 94 r.low = cst; in uhwi_to_double_int() 104 double_int_to_shwi (double_int cst) in double_int_to_shwi() argument 106 return (HOST_WIDE_INT) cst.low; in double_int_to_shwi() 115 return cst.low; in double_int_to_uhwi() 126 return cst.high == 0; in double_int_fits_in_uhwi_p() 221 return cst.high < 0; in double_int_negative_p() 256 return cst.low == 0 && cst.high == 0; in double_int_zero_p() 262 double_int_one_p (double_int cst) in double_int_one_p() argument 264 return cst.low == 1 && cst.high == 0; in double_int_one_p() [all …]
|
H A D | double-int.c | 643 r.low = cst.low & mask.low; in double_int_zext() 644 r.high = cst.high & mask.high; in double_int_zext() 659 snum = cst.low; in double_int_sext() 672 r.low = cst.low & mask.low; in double_int_sext() 684 if (cst.high == 0) in double_int_fits_in_shwi_p() 686 else if (cst.high == -1) in double_int_fits_in_shwi_p() 1033 div_and_round_double (FLOOR_DIV_EXPR, true, cst->low, cst->high, base, 0, in double_int_split_digit() 1035 cst->high = resh; in double_int_split_digit() 1036 cst->low = resl; in double_int_split_digit() 1050 if (double_int_zero_p (cst)) in dump_double_int() [all …]
|
H A D | tree-affine.c | 35 double_int_ext_for_comb (double_int cst, aff_tree *comb) in double_int_ext_for_comb() argument 37 return double_int_sext (cst, TYPE_PRECISION (comb->type)); in double_int_ext_for_comb() 54 aff_combination_const (aff_tree *comb, tree type, double_int cst) in aff_combination_const() argument 57 comb->offset = double_int_ext_for_comb (cst, comb); in aff_combination_const() 193 aff_combination_add_cst (aff_tree *c, double_int cst) in aff_combination_add_cst() argument 262 tree cst, core, toffset; in tree_to_aff_combination() local 292 cst = TREE_OPERAND (expr, 1); in tree_to_aff_combination() 293 if (TREE_CODE (cst) != INTEGER_CST) in tree_to_aff_combination() 753 double_int rem, cst; in double_int_constant_multiple_p() local 765 if (*mult_set && !double_int_equal_p (*mult, cst)) in double_int_constant_multiple_p() [all …]
|
H A D | tree-switch-conversion.c | 533 double_int cst; in array_value_type() local 538 cst = TREE_INT_CST (elt->value); in array_value_type() 546 && double_int_equal_p (cst, double_int_zext (cst, prec))) in array_value_type() 549 && double_int_equal_p (cst, double_int_sext (cst, prec))) in array_value_type() 555 && double_int_equal_p (cst, double_int_sext (cst, prec))) in array_value_type() 595 tree name, cst; in build_one_array() local 605 cst = constructor_contains_same_values_p (info.constructors[num]); in build_one_array() 606 if (cst) in build_one_array() 607 load = gimple_build_assign (name, cst); in build_one_array()
|
H A D | tree-ssa-forwprop.c | 1847 if (integer_zerop (cst)) in simplify_bitwise_binary() 1862 gimple_assign_set_rhs2 (stmt, cst); in simplify_bitwise_binary() 1879 gimple_assign_set_rhs2 (stmt, cst); in simplify_bitwise_binary() 2032 if (cst && !TREE_OVERFLOW (cst)) in associate_plusminus() 2036 rhs1 = cst; in associate_plusminus() 2050 if (cst && !TREE_OVERFLOW (cst)) in associate_plusminus() 2056 rhs2 = cst; in associate_plusminus() 2133 if (cst && !TREE_OVERFLOW (cst)) in associate_plusminus() 2137 rhs1 = cst; in associate_plusminus() 2152 if (cst && !TREE_OVERFLOW (cst)) in associate_plusminus() [all …]
|
H A D | treestruct.def | 36 DEFTREESTRUCT(TS_INT_CST, "integer cst") 37 DEFTREESTRUCT(TS_REAL_CST, "real cst") 38 DEFTREESTRUCT(TS_FIXED_CST, "fixed cst")
|
H A D | tree-chrec.c | 43 is_not_constant_evolution (const_tree cst) in is_not_constant_evolution() argument 45 return (TREE_CODE (cst) == POLYNOMIAL_CHREC); in is_not_constant_evolution() 54 tree cst) in chrec_fold_poly_cst() argument 57 gcc_assert (cst); in chrec_fold_poly_cst() 59 gcc_assert (!is_not_constant_evolution (cst)); in chrec_fold_poly_cst() 67 chrec_fold_plus (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst() 73 chrec_fold_minus (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst() 79 chrec_fold_multiply (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst() 80 chrec_fold_multiply (type, CHREC_RIGHT (poly), cst)); in chrec_fold_poly_cst()
|
/dragonfly/contrib/gcc-4.7/gcc/cp/ |
H A D | expr.c | 35 cplus_expand_constant (tree cst) in cplus_expand_constant() argument 37 switch (TREE_CODE (cst)) in cplus_expand_constant() 41 tree type = TREE_TYPE (cst); in cplus_expand_constant() 45 member = PTRMEM_CST_MEMBER (cst); in cplus_expand_constant() 50 cst = byte_position (member); in cplus_expand_constant() 59 cst = size_binop (PLUS_EXPR, cst, byte_position (member)); in cplus_expand_constant() 61 cst = fold (build_nop (type, cst)); in cplus_expand_constant() 68 expand_ptrmemfunc_cst (cst, &delta, &pfn); in cplus_expand_constant() 69 cst = build_ptrmemfunc1 (type, delta, pfn); in cplus_expand_constant() 79 return cst; in cplus_expand_constant()
|
/dragonfly/contrib/gcc-8.0/gcc/cp/ |
H A D | expr.c | 30 cplus_expand_constant (tree cst) in cplus_expand_constant() argument 32 switch (TREE_CODE (cst)) in cplus_expand_constant() 36 tree type = TREE_TYPE (cst); in cplus_expand_constant() 40 member = PTRMEM_CST_MEMBER (cst); in cplus_expand_constant() 44 return cst; in cplus_expand_constant() 49 cst = byte_position (member); in cplus_expand_constant() 58 cst = size_binop (PLUS_EXPR, cst, byte_position (member)); in cplus_expand_constant() 60 cst = fold (build_nop (type, cst)); in cplus_expand_constant() 67 expand_ptrmemfunc_cst (cst, &delta, &pfn); in cplus_expand_constant() 68 cst = build_ptrmemfunc1 (type, delta, pfn); in cplus_expand_constant() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | tree-chkp-opt.c | 48 tree cst; member 142 return cst; in chkp_extend_const() 151 cst = chkp_extend_const (cst); in chkp_add_addr_item() 156 item.cst = cst; in chkp_add_addr_item() 164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item() 165 addr.pol[n].cst, cst); in chkp_add_addr_item() 178 cst = chkp_extend_const (cst); in chkp_sub_addr_item() 183 item.cst = fold_build2 (MINUS_EXPR, TREE_TYPE (cst), in chkp_sub_addr_item() 192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item() 193 addr.pol[n].cst, cst); in chkp_sub_addr_item() [all …]
|
H A D | double-int.c | 728 const double_int &cst = *this; in zext() local 732 r.low = cst.low & mask.low; in zext() 733 r.high = cst.high & mask.high; in zext() 749 snum = cst.low; in sext() 775 if (cst.high == 0) in fits_shwi() 777 else if (cst.high == -1) in fits_shwi() 1460 div_and_round_double (FLOOR_DIV_EXPR, true, cst->low, cst->high, base, 0, in double_int_split_digit() 1462 cst->high = resh; in double_int_split_digit() 1463 cst->low = resl; in double_int_split_digit() 1477 if (cst.is_zero ()) in dump_double_int() [all …]
|
H A D | vec-perm-indices.c | 231 tree_to_vec_perm_builder (vec_perm_builder *builder, tree cst) in tree_to_vec_perm_builder() argument 233 unsigned int encoded_nelts = vector_cst_encoded_nelts (cst); in tree_to_vec_perm_builder() 235 if (!tree_fits_poly_int64_p (VECTOR_CST_ENCODED_ELT (cst, i))) in tree_to_vec_perm_builder() 238 builder->new_vector (TYPE_VECTOR_SUBPARTS (TREE_TYPE (cst)), in tree_to_vec_perm_builder() 239 VECTOR_CST_NPATTERNS (cst), in tree_to_vec_perm_builder() 240 VECTOR_CST_NELTS_PER_PATTERN (cst)); in tree_to_vec_perm_builder() 242 builder->quick_push (tree_to_poly_int64 (VECTOR_CST_ENCODED_ELT (cst, i))); in tree_to_vec_perm_builder()
|
H A D | tree-affine.c | 38 wide_int_ext_for_comb (const widest_int &cst, tree type) in wide_int_ext_for_comb() argument 40 return wi::sext (cst, TYPE_PRECISION (type)); in wide_int_ext_for_comb() 48 return wi::sext (cst, TYPE_PRECISION (type)); in wide_int_ext_for_comb() 71 comb->offset = wide_int_ext_for_comb (cst, comb->type);; in aff_combination_const() 269 tree cst, core, toffset; in tree_to_aff_combination() local 295 cst = TREE_OPERAND (expr, 1); in tree_to_aff_combination() 296 if (TREE_CODE (cst) != INTEGER_CST) in tree_to_aff_combination() 816 poly_widest_int rem, cst; in wide_int_constant_multiple_p() local 830 if (!multiple_p (val, div, &cst)) in wide_int_constant_multiple_p() 833 if (*mult_set && maybe_ne (*mult, cst)) in wide_int_constant_multiple_p() [all …]
|
H A D | double-int.h | 58 static double_int from_uhwi (unsigned HOST_WIDE_INT cst); 59 static double_int from_shwi (HOST_WIDE_INT cst); 208 double_int::from_shwi (HOST_WIDE_INT cst) in from_shwi() argument 211 r.low = (unsigned HOST_WIDE_INT) cst; in from_shwi() 212 r.high = cst < 0 ? -1 : 0; in from_shwi() 231 double_int::from_uhwi (unsigned HOST_WIDE_INT cst) in from_uhwi() argument 234 r.low = cst; in from_uhwi()
|
H A D | treestruct.def | 36 DEFTREESTRUCT(TS_INT_CST, "integer cst") 38 DEFTREESTRUCT(TS_REAL_CST, "real cst") 39 DEFTREESTRUCT(TS_FIXED_CST, "fixed cst")
|
H A D | tree-vect-generic.c | 467 tree cst = VECTOR_CST_ELT (op1, i); in expand_vector_divmod() local 470 if (TREE_CODE (cst) != INTEGER_CST || integer_zerop (cst)) in expand_vector_divmod() 476 && (!integer_pow2p (cst) || tree_int_cst_sgn (cst) != 1)) in expand_vector_divmod() 480 shifts[i] = tree_log2 (cst); in expand_vector_divmod() 561 HOST_WIDE_INT d = TREE_INT_CST_LOW (cst); in expand_vector_divmod() 649 tree zero, cst, cond, mask_type; in expand_vector_divmod() local 660 cst = vec.build (); in expand_vector_divmod() 663 cst, zero); in expand_vector_divmod() 1122 tree_vector_builder cst (type, nelts, 1); in optimize_vector_constructor() 1138 cst.quick_push (elt); in optimize_vector_constructor() [all …]
|
H A D | tree-chrec.c | 47 is_not_constant_evolution (const_tree cst) in is_not_constant_evolution() argument 49 return (TREE_CODE (cst) == POLYNOMIAL_CHREC); in is_not_constant_evolution() 58 tree cst) in chrec_fold_poly_cst() argument 61 gcc_assert (cst); in chrec_fold_poly_cst() 63 gcc_checking_assert (!is_not_constant_evolution (cst)); in chrec_fold_poly_cst() 71 chrec_fold_plus (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst() 77 chrec_fold_minus (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst() 83 chrec_fold_multiply (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst() 84 chrec_fold_multiply (type, CHREC_RIGHT (poly), cst)); in chrec_fold_poly_cst()
|
/dragonfly/contrib/bmake/ |
H A D | dir.c | 420 struct cached_stat *cst; in cached_stats() local 428 *out_cst = *cst; in cached_stats() 441 if (cst == NULL) { in cached_stats() 442 cst = bmake_malloc(sizeof *cst); in cached_stats() 447 cst->cst_mode = sys_st.st_mode; in cached_stats() 449 *out_cst = *cst; in cached_stats() 986 struct cached_stat cst; in DirLookupSubdir() local 1351 struct cached_stat cst; in Dir_FindHereOrAbove() local 1471 struct cached_stat cst; in Dir_UpdateMTime() local 1493 cst.cst_mtime = 0; in Dir_UpdateMTime() [all …]
|
H A D | meta.c | 410 struct cached_stat cst; in meta_needed() local 441 if (cached_stat(dname, &cst) != 0) { in meta_needed() 1151 struct cached_stat cst; in meta_oodate() local 1412 if ((link_src != NULL && cached_lstat(p, &cst) < 0) || in meta_oodate() 1413 (link_src == NULL && cached_stat(p, &cst) < 0)) { in meta_oodate() 1473 if (cached_stat(*sdp, &cst) == 0) { in meta_oodate() 1483 if (!S_ISDIR(cst.cst_mode) && in meta_oodate() 1484 cst.cst_mtime > gn->mtime) { in meta_oodate() 1488 } else if (S_ISDIR(cst.cst_mode)) { in meta_oodate()
|
/dragonfly/sys/dev/sound/pci/ |
H A D | hdspe.h | 149 bus_space_tag_t cst; member 168 bus_space_read_1((sc)->cst, (sc)->csh, (regno)) 170 bus_space_read_2((sc)->cst, (sc)->csh, (regno)) 172 bus_space_read_4((sc)->cst, (sc)->csh, (regno)) 175 bus_space_write_1((sc)->cst, (sc)->csh, (regno), (data)) 177 bus_space_write_2((sc)->cst, (sc)->csh, (regno), (data)) 179 bus_space_write_4((sc)->cst, (sc)->csh, (regno), (data))
|
/dragonfly/contrib/gcc-8.0/gcc/c-family/ |
H A D | c-warn.c | 342 tree cst; in warn_tautological_bitwise_comparison() local 1197 if (cst) in warnings_for_convert_and_check() 1219 if (cst) in warnings_for_convert_and_check() 1236 if (cst) in warnings_for_convert_and_check() 1253 if (cst) in warnings_for_convert_and_check() 2334 tree f, cst; in maybe_warn_bool_compare() local 2337 cst = op0 = f; in maybe_warn_bool_compare() 2340 cst = op1 = f; in maybe_warn_bool_compare() 2344 if (!integer_zerop (cst) && !integer_onep (cst)) in maybe_warn_bool_compare() 2347 ? tree_int_cst_sgn (cst) : -tree_int_cst_sgn (cst)); in maybe_warn_bool_compare() [all …]
|
/dragonfly/crypto/libressl/crypto/ocsp/ |
H A D | ocsp_prn.c | 205 OCSP_CERTSTATUS *cst = NULL; in OCSP_RESPONSE_print() local 260 cst = single->certStatus; in OCSP_RESPONSE_print() 262 OCSP_cert_status_str(cst->type)) <= 0) in OCSP_RESPONSE_print() 264 if (cst->type == V_OCSP_CERTSTATUS_REVOKED) { in OCSP_RESPONSE_print() 265 rev = cst->value.revoked; in OCSP_RESPONSE_print()
|
H A D | ocsp_cl.c | 321 OCSP_CERTSTATUS *cst; in OCSP_single_get0_status() local 325 cst = single->certStatus; in OCSP_single_get0_status() 326 ret = cst->type; in OCSP_single_get0_status() 328 OCSP_REVOKEDINFO *rev = cst->value.revoked; in OCSP_single_get0_status()
|