104   ae=dn->exponent+dn->digits-1;              /* [0 if special] */  in decimal64FromNumber()
105   if (dn->digits>DECIMAL64_Pmax              /* too many digits */  in decimal64FromNumber()
120       if ((*dn->lsu!=0 || dn->digits>1)             /* non-zero coefficient */  in decimal64FromNumber()
121        && (dn->digits<DECIMAL64_Pmax)) {            /* coefficient fits */  in decimal64FromNumber()
161           Int d=dn->digits;  in decimal64FromNumber()
166           if (dn->digits>6) {  in decimal64FromNumber()
618   Int  digits=dn->digits;     /* digit countdown */  in decDigitsToDPD()  local
637     source=dn->lsu+D2U(digits)-1;       /* where msu comes from */  in decDigitsToDPD()
638     target=uar+D2U(digits)-1+D2U(shift);/* where upper part of first cut goes */  in decDigitsToDPD()
644       first=uar+D2U(digits+shift)-1;    /* where msu will end up */  in decDigitsToDPD()
664     digits+=shift;               /* add count (shift) of zeros added */  in decDigitsToDPD()
676   for(n=0; digits>0; n++) {      /* each output bunch */  in decDigitsToDPD()
679       digits-=3;                 /* [may go negative] */  in decDigitsToDPD()
697           digits--;  in decDigitsToDPD()
698           if (digits==0) break;            /* [also protects *inu below] */  in decDigitsToDPD()
828   dn->digits=(last-dn->lsu)*DECDPUN+1;  /* floor of digits, plus */
832   dn->digits++;                         /* must be 2 at least */
835   dn->digits++;                         /* must be 3 at least */
838   dn->digits++;                         /* must be 4 at least */
840   for (pow=&DECPOWERS[4]; *last>=*pow; pow++) dn->digits++;