20     var uintL need = 1+floor(len,intDsize*256); # > len/(intDsize*256) >=0  in DIGITS_to_I()  local
21     switch (base) { # need mit ceiling(256*log(base)/log(2)) multiplizieren:  in DIGITS_to_I()
22       case 2: need = 256*need; break;  in DIGITS_to_I()
23       case 3: need = 406*need; break;  in DIGITS_to_I()
24       case 4: need = 512*need; break;  in DIGITS_to_I()
25       case 5: need = 595*need; break;  in DIGITS_to_I()
26       case 6: need = 662*need; break;  in DIGITS_to_I()
27       case 7: need = 719*need; break;  in DIGITS_to_I()
28       case 8: need = 768*need; break;  in DIGITS_to_I()
29       case 9: need = 812*need; break;  in DIGITS_to_I()
30       case 10: need = 851*need; break;  in DIGITS_to_I()
31       case 11: need = 886*need; break;  in DIGITS_to_I()
32       case 12: need = 918*need; break;  in DIGITS_to_I()
33       case 13: need = 948*need; break;  in DIGITS_to_I()
34       case 14: need = 975*need; break;  in DIGITS_to_I()
35       case 15: need = 1001*need; break;  in DIGITS_to_I()
36       case 16: need = 1024*need; break;  in DIGITS_to_I()
37       case 17: need = 1047*need; break;  in DIGITS_to_I()
38       case 18: need = 1068*need; break;  in DIGITS_to_I()
39       case 19: need = 1088*need; break;  in DIGITS_to_I()
40       case 20: need = 1107*need; break;  in DIGITS_to_I()
41       case 21: need = 1125*need; break;  in DIGITS_to_I()
42       case 22: need = 1142*need; break;  in DIGITS_to_I()
43       case 23: need = 1159*need; break;  in DIGITS_to_I()
44       case 24: need = 1174*need; break;  in DIGITS_to_I()
45       case 25: need = 1189*need; break;  in DIGITS_to_I()
46       case 26: need = 1204*need; break;  in DIGITS_to_I()
47       case 27: need = 1218*need; break;  in DIGITS_to_I()
48       case 28: need = 1231*need; break;  in DIGITS_to_I()
49       case 29: need = 1244*need; break;  in DIGITS_to_I()
50       case 30: need = 1257*need; break;  in DIGITS_to_I()
51       case 31: need = 1269*need; break;  in DIGITS_to_I()
52       case 32: need = 1280*need; break;  in DIGITS_to_I()
53       case 33: need = 1292*need; break;  in DIGITS_to_I()
54       case 34: need = 1303*need; break;  in DIGITS_to_I()
55       case 35: need = 1314*need; break;  in DIGITS_to_I()
56       case 36: need = 1324*need; break;  in DIGITS_to_I()
59     # Nun gilt need >= len*log(base)/(intDsize*log(2)).  in DIGITS_to_I()
60     need += 1;  in DIGITS_to_I()
64     if ((intWCsize < 32) && (need > (uintL)(bitc(intWCsize+1))))  in DIGITS_to_I()
66     num_stack_need(need,_EMA_,erg_LSDptr=);  in DIGITS_to_I()
72         # erg_MSDptr/erg_len/erg_LSDptr ist eine NUDS, erg_len < need.  in DIGITS_to_I()