Home | History | Annotate | Download | only in gcc

Lines Matching defs:unlikely

110 /* The minimum, maximum, likely, and unlikely maximum number of bytes
121      cases MAX is the same as the worst case UNLIKELY result.  */
127   /* In rare cases (e.g., for multibyte characters) UNLIKELY gives
129      UNLIKELY == MAX.  UNLIKELY is used to control the return value
131   unsigned HOST_WIDE_INT unlikely;
397     range.unlikely = min;
411     range.unlikely = max;
521   /* Finally adjust the unlikely counter to be at least as large as
523   if (range.unlikely < range.max)
524     range.unlikely = range.max;
764   if (range.unlikely < HOST_WIDE_INT_MAX)
765     range.unlikely += n;
1350       res.range.unlikely = res.range.max;
1512   res.range.unlikely = res.range.max;
1582   /* Handle the unlikely (impossible?) error by returning more than
1695 	/* The unlikely maximum accounts for the longest multibyte
1697 	res.range.unlikely = res.range.max;
1699 	  res.range.unlikely += target_mb_len_max () - 1;
1720 	/* The unlikely maximum accounts for the longest multibyte
1724 	  res.range.unlikely = res.range.max + target_mb_len_max () -1;
1726 	  res.range.unlikely = res.range.max;
1757 	/* The unlikely maximum accounts for the longest multibyte
1761 	  res.range.unlikely = res.range.max + target_mb_len_max () - 1;
1800 	   the minimum because for %g that's 1 which is unlikely.  */
1813 	/* The unlikely maximum accounts for the longest multibyte
1815 	res.range.unlikely = res.range.max + target_mb_len_max () - 1;
1917       /* The unlikely maximum is "[-/+]infinity" or "[-/+][qs]nan".
1924 	 so the unlikely maximum reflects that.  */
1925       res.range.unlikely = sign + (real_isinf (rvp) ? 8 : 4);
1996      the likely output (for "0.0" since zero precision is unlikely).  */
2006   res.range.unlikely = res.range.max;
2015       res.range.unlikely += target_mb_len_max () - 1;
2071 	     is valid.  Set UNLIKELY to maximum in case MAX_SIZE refers
2073 	     TODO: This is overly conservative.  Set UNLIKELY to the size
2078 	  res.range.unlikely = HOST_WIDE_INT_MAX;
2152   res.range.unlikely = unbounded ? HOST_WIDE_INT_MAX : res.range.max;
2186 	      res.range.likely = res.range.unlikely = 1;
2198 		 in a single byte, and only unlikely in up to MB_LEN_MAX.  */
2201 	      res.range.unlikely = target_mb_len_max ();
2207 		 in up to two bytes, and only unlikely in up to MB_LEN_MAX.  */
2210 	      res.range.unlikely = res.range.max;
2221 	  res.range.unlikely = res.range.max;
2229       res.range.likely = res.range.unlikely = 1;
2541 	  res.range.unlikely = res.range.max;
2551 	      res.range.unlikely = dir.prec[1];
2580 	      res.range.unlikely = dir.prec[1];
2616 	    slen.range.unlikely *= target_mb_len_max ();
2639 	      res.range.unlikely = dir.prec[1];
2662 	  if ((unsigned HOST_WIDE_INT)dir.prec[1] < slen.range.unlikely)
2663 	    res.range.unlikely = dir.prec[1];
2673 	  res.range.unlikely = HOST_WIDE_INT_MAX;
3064       range.min = range.max = range.likely = range.unlikely = navail;
3080   range.unlikely = (res.range.unlikely < navail
3081 		    ? navail - res.range.unlikely : 0);
3200   /* Raise the total unlikely maximum by the larger of the maximum
3201      and the unlikely maximum.  */
3202   unsigned HOST_WIDE_INT save = res->range.unlikely;
3203   if (fmtres.range.max < fmtres.range.unlikely)
3204     res->range.unlikely += fmtres.range.unlikely;
3206     res->range.unlikely += fmtres.range.max;
3208   if (res->range.unlikely < save)
3209     res->range.unlikely = HOST_WIDE_INT_M1U;
3431 	       fmtres.range.max, fmtres.range.unlikely,
3433 	       res->range.max, res->range.unlikely);
3947       res->range.unlikely = HOST_WIDE_INT_M1U;
4122      RES.RANGE.UNLIKELY.  */
4124     = res.range.unlikely < res.range.max ? res.range.max : res.range.unlikely;