Lines Matching defs:all

113 /*    jump).  Therefore all cleanup must be done first.  In general,  */
416 break; /* all done */
426 break; /* all done */
452 { /* "NaN" or "sNaN", maybe with all 0s */
464 break; /* not all digits */
529 /* Here when all inspected; syntax is good */
536 /* strip leading zeros/dot (leave final if all 0's) */
1083 workset = *set; /* copy all fields */
2041 /* if not a clean non-zero coefficient, that's all we have in a */
2062 cut = DECDPUN - 1; /* next Unit has all digits */
2192 *c = '\0'; /* terminate the string (all paths) */
2398 /* is all in one unit, no operand rounding is needed, and no carry, */
2609 /* zero, the sign of that sum shall be '+' in all rounding modes */
2641 /* This routine performs the calculations for all four division */
3081 /* here when all inspected or a difference seen */
3146 break; /* we have all we need */
3333 /* so if it was the rare case where it was full and all */
3336 Flag allnines = 0; /* 1 if quotient all nines */
4053 return 0; /* all units match */
4319 /* OK, all A and B processed; might still have carry or borrow */
4361 /* all is 1 to remove all trailing zeros, 0 for just fraction ones */
4369 decTrim (decNumber * dn, Flag all, Int * dropped)
4406 if (!all)
4408 /* [if exp>0 then all trailing 0s are significant for trim] */
4703 /* residue is all the number [NB could be all 0s] */
4732 break; /* full ones all checked */
4861 /* -- the coefficient was increased and is all nines (in which */
4865 /* -- the coefficient was decreased and becomes all nines (in which */
4976 /* is all nines. In this special case we set to 1000... and adjust */
4978 /* Similarly handle all-nines result if bumping down. */
4990 /* here if it, too, is all nines */
4993 *up = 0; /* others all to 0 */
5011 /* all other digits zero) */
5024 /* others all to all-nines, too */
5221 break; /* Infinity in all other cases */
5228 /* fill in all nines to set maximum value */
5576 /* all units were 0 */