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

  /src/external/gpl3/gcc/dist/gcc/
gimple-range-trace.h 43 static const unsigned bump = 2; member in class:range_tracer
gimple-ssa-strength-reduction.cc 2138 replace_mult_candidate (slsr_cand_t c, tree basis_name, offset_int bump)
2157 if (wi::neg_p (bump))
2160 bump = -bump;
2163 /* It is possible that the resulting bump doesn't fit in target_type.
2166 if (bump != wi::ext (bump, TYPE_PRECISION (target_type),
2170 bump_tree = wide_int_to_tree (target_type, bump);
2183 if (bump == 0)
2246 folded value ((i - i') * S) is referred to here as the "bump." *
2250 offset_int bump = cand_increment (c) * wi::to_offset (c->stride); local
2304 offset_int bump = increment * wi::to_offset (c->stride); local
2530 offset_int bump = c->index * wi::to_offset (c->stride); local
    [all...]
tree-vect-stmts.cc 2893 tree bump local
2897 *dataref_bump = cse_and_gimplify_to_preheader (loop_vinfo, bump);
2952 tree bump = make_temp_ssa_name (len_type, NULL, "ivtmp"); local
2953 gassign *assign = gimple_build_assign (bump, tmp);
2955 return bump;
7956 tree bump = vect_get_data_ptr_increment (vinfo, gsi, dr_info,
7978 dataref_offset = int_const_binop (PLUS_EXPR, dataref_offset, bump);
8084 dataref_offset = int_const_binop (PLUS_EXPR, dataref_offset, bump);
8742 tree bump;
8747 bump = NULL_TREE
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-range-trace.h 43 static const unsigned bump = 2; member in class:range_tracer
gimple-ssa-strength-reduction.cc 2138 replace_mult_candidate (slsr_cand_t c, tree basis_name, widest_int bump)
2157 if (wi::neg_p (bump))
2160 bump = -bump;
2163 /* It is possible that the resulting bump doesn't fit in target_type.
2166 if (bump != wi::ext (bump, TYPE_PRECISION (target_type),
2170 bump_tree = wide_int_to_tree (target_type, bump);
2183 if (bump == 0)
2246 folded value ((i - i') * S) is referred to here as the "bump." *
2250 widest_int bump = cand_increment (c) * wi::to_widest (c->stride); local
2304 widest_int bump = increment * wi::to_widest (c->stride); local
2530 widest_int bump = c->index * wi::to_widest (c->stride); local
    [all...]
tree-vect-stmts.cc 3088 tree bump = size_binop (MULT_EXPR, local
3091 *dataref_bump = cse_and_gimplify_to_preheader (loop_vinfo, bump);
7319 tree bump = vect_get_data_ptr_increment (vinfo, dr_info, local
7341 dataref_offset = int_const_binop (PLUS_EXPR, dataref_offset, bump);
7447 dataref_offset = int_const_binop (PLUS_EXPR, dataref_offset, bump);
8200 tree bump; local
8205 bump = NULL_TREE;
8211 &bump, &vec_offset);
8219 bump = vect_get_data_ptr_increment (vinfo, dr_info, aggr_type,
8342 simd_lane_access_p, bump);
9577 tree bump; local
10014 tree ptr, bump; local
10164 tree bump = wide_int_to_tree (sizetype, bump_val); local
10180 tree bump = wide_int_to_tree (sizetype, bump_val); local
    [all...]
  /src/external/bsd/pdisk/dist/
file_media.c 461 int bump; local
504 bump = 0;
515 bump = -1;
522 bump = -1;
529 bump = -1;
533 if (bump != 0) {
536 bump = 1;
542 bump = -1;
544 bump = 1;
548 if (bump) {
    [all...]
  /src/external/gpl3/gcc/dist/libdecnumber/
decCommon.c 331 uInt bump=0; local
340 if (reround>5) bump=1; /* >0.5 goes up */
342 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
349 if (reround>5) bump=1;
352 if (reround>=5) bump=1;
355 if (reround>0) bump=1;
359 if (!num->sign && reround>0) bump=1;
364 if (num->sign && reround>0) bump=1;
368 /* bump iff lsd=0 or 5; this cannot carry so it could be */
369 /* effected immediately with no bump -- but the code *
    [all...]
decBasic.c 643 uInt bump=0; local
645 if (reround>5) bump=1; /* >0.5 goes up */
647 bump=*(num.lsd) & 0x01; /* .. up iff [new] lsd is odd */
648 if (bump!=0) { /* need increment */
655 } /* bump needed */
3013 uInt bump=0; local
3018 if (reround>5) bump=1; /* >0.5 goes up */
3020 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
3027 if (reround>5) bump=1;
3030 if (reround>=5) bump=1
    [all...]
decNumber.c 7066 Int bump; /* 1 if coefficient needs to be incremented */ local
7071 bump=0; /* assume a smooth ride */
7082 if (residue<0 && lsd5!=1) bump=-1;
7083 else if (residue>0 && lsd5==0) bump=1;
7084 /* [bump==1 could be applied directly; use common path for clarity] */
7089 if (residue<0) bump=-1;
7093 if (residue>5) bump=1;
7097 if (residue>5) bump=1; /* >0.5 goes up */
7100 if (*dn->lsu & 0x01) bump=1;
7105 if (residue>=5) bump=1
    [all...]
  /src/external/gpl3/gcc.old/dist/libdecnumber/
decCommon.c 331 uInt bump=0; local
340 if (reround>5) bump=1; /* >0.5 goes up */
342 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
349 if (reround>5) bump=1;
352 if (reround>=5) bump=1;
355 if (reround>0) bump=1;
359 if (!num->sign && reround>0) bump=1;
364 if (num->sign && reround>0) bump=1;
368 /* bump iff lsd=0 or 5; this cannot carry so it could be */
369 /* effected immediately with no bump -- but the code *
    [all...]
decBasic.c 643 uInt bump=0; local
645 if (reround>5) bump=1; /* >0.5 goes up */
647 bump=*(num.lsd) & 0x01; /* .. up iff [new] lsd is odd */
648 if (bump!=0) { /* need increment */
655 } /* bump needed */
3013 uInt bump=0; local
3018 if (reround>5) bump=1; /* >0.5 goes up */
3020 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
3027 if (reround>5) bump=1;
3030 if (reround>=5) bump=1
    [all...]
decNumber.c 7066 Int bump; /* 1 if coefficient needs to be incremented */ local
7071 bump=0; /* assume a smooth ride */
7082 if (residue<0 && lsd5!=1) bump=-1;
7083 else if (residue>0 && lsd5==0) bump=1;
7084 /* [bump==1 could be applied directly; use common path for clarity] */
7089 if (residue<0) bump=-1;
7093 if (residue>5) bump=1;
7097 if (residue>5) bump=1; /* >0.5 goes up */
7100 if (*dn->lsu & 0x01) bump=1;
7105 if (residue>=5) bump=1
    [all...]
  /src/external/gpl3/gdb/dist/libdecnumber/
decCommon.c 331 uInt bump=0; local
340 if (reround>5) bump=1; /* >0.5 goes up */
342 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
349 if (reround>5) bump=1;
352 if (reround>=5) bump=1;
355 if (reround>0) bump=1;
359 if (!num->sign && reround>0) bump=1;
364 if (num->sign && reround>0) bump=1;
368 /* bump iff lsd=0 or 5; this cannot carry so it could be */
369 /* effected immediately with no bump -- but the code *
    [all...]
decBasic.c 643 uInt bump=0; local
645 if (reround>5) bump=1; /* >0.5 goes up */
647 bump=*(num.lsd) & 0x01; /* .. up iff [new] lsd is odd */
648 if (bump!=0) { /* need increment */
655 } /* bump needed */
3013 uInt bump=0; local
3018 if (reround>5) bump=1; /* >0.5 goes up */
3020 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
3027 if (reround>5) bump=1;
3030 if (reround>=5) bump=1
    [all...]
decNumber.c 7066 Int bump; /* 1 if coefficient needs to be incremented */ local
7071 bump=0; /* assume a smooth ride */
7082 if (residue<0 && lsd5!=1) bump=-1;
7083 else if (residue>0 && lsd5==0) bump=1;
7084 /* [bump==1 could be applied directly; use common path for clarity] */
7089 if (residue<0) bump=-1;
7093 if (residue>5) bump=1;
7097 if (residue>5) bump=1; /* >0.5 goes up */
7100 if (*dn->lsu & 0x01) bump=1;
7105 if (residue>=5) bump=1
    [all...]
  /src/external/gpl3/gdb.old/dist/libdecnumber/
decCommon.c 331 uInt bump=0; local
340 if (reround>5) bump=1; /* >0.5 goes up */
342 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
349 if (reround>5) bump=1;
352 if (reround>=5) bump=1;
355 if (reround>0) bump=1;
359 if (!num->sign && reround>0) bump=1;
364 if (num->sign && reround>0) bump=1;
368 /* bump iff lsd=0 or 5; this cannot carry so it could be */
369 /* effected immediately with no bump -- but the code *
    [all...]
decBasic.c 643 uInt bump=0; local
645 if (reround>5) bump=1; /* >0.5 goes up */
647 bump=*(num.lsd) & 0x01; /* .. up iff [new] lsd is odd */
648 if (bump!=0) { /* need increment */
655 } /* bump needed */
3013 uInt bump=0; local
3018 if (reround>5) bump=1; /* >0.5 goes up */
3020 bump=*ulsd & 0x01; /* .. up iff [new] lsd is odd */
3027 if (reround>5) bump=1;
3030 if (reround>=5) bump=1
    [all...]
decNumber.c 7066 Int bump; /* 1 if coefficient needs to be incremented */ local
7071 bump=0; /* assume a smooth ride */
7082 if (residue<0 && lsd5!=1) bump=-1;
7083 else if (residue>0 && lsd5==0) bump=1;
7084 /* [bump==1 could be applied directly; use common path for clarity] */
7089 if (residue<0) bump=-1;
7093 if (residue>5) bump=1;
7097 if (residue>5) bump=1; /* >0.5 goes up */
7100 if (*dn->lsu & 0x01) bump=1;
7105 if (residue>=5) bump=1
    [all...]
  /src/external/mpl/bind/dist/lib/dns/
qp_p.h 138 * allocator" is also known as a "bump allocator", so in `struct dns_qp`
139 * (see below) the allocation chunk is called `bump`.
271 * because the old bump chunk must remain mutable between write
438 * Allocations are made sequentially in the `bump` chunk. A sequence
439 * of lightweight write transactions can use the same `bump` chunk, so
487 dns_qpchunk_t bump; member in struct:dns_qp
488 /*% nodes in the `bump` chunk below `fender` are read only [MT] */
  /src/external/gpl3/binutils/dist/ld/
ldlang.c 6621 bfd_vma start, end, bump;
6626 bump = desired_end - end;
6627 /* We'd like to increase START by BUMP, but we must heed
6629 start += bump;
6618 bfd_vma start, end, bump; local
  /src/external/gpl3/binutils.old/dist/ld/
ldlang.c 6638 bfd_vma start, end, bump;
6643 bump = desired_end - end;
6644 /* We'd like to increase START by BUMP, but we must heed
6646 start += bump;
6635 bfd_vma start, end, bump; local

Completed in 81 milliseconds