gonzui


Format: Advanced Search

SearchGoogle itResults 1 - 1 of 1 for funcall:PRINT (0.00 seconds)
t2ex
bsd_source/lib/libc/src_bsd/stdio/vfprintf.c - 58.5KB - 1,551 lines
371:                 while (n > PADSIZE) { \
372:                         PRINT(with, PADSIZE); \
373:                         n -= PADSIZE; \
374:                 } \
375:                 PRINT(with, n); \
376:         } \
382: if (n2 > 0) \ 383: PRINT((p), n2); \ 384: PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
506: goto overflow; 507: PRINT(cp, m); 508: ret += m;
1005: if (sign) 1006: PRINT(&sign, 1); 1007: if (ox[1]) { /* ox[1] is either x, X, or \0 */ 1008: ox[0] = '0'; 1009: PRINT(ox, 2); 1010: }
1021: if ((flags & FPT) == 0) { 1022: PRINT(cp, size); 1023: } else { /* glue together f_p fragments */
1025: if (expt <= 0) { 1026: PRINT(zeroes, 1); 1027: if (prec || flags & ALT) 1028: PRINT(decimal_point, 1); 1029: PAD(-expt, zeroes);
1035: if (prec || flags & ALT) 1036: PRINT(decimal_point, 1); 1037: }
1042: buf[1] = *decimal_point; 1043: PRINT(buf, 2); 1044: PRINT(cp, ndig-1); 1045: PAD(prec - ndig, zeroes); 1046: } else { /* XeYYY */ 1047: PRINT(cp, 1); 1048: } 1049: PRINT(expstr, expsize); 1050: }
1052: #else 1053: PRINT(cp, size); 1054: #endif