dofmt.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. #include <u.h>
  10. #include <libc.h>
  11. #include "fmtdef.h"
  12. /* format the output into f->to and return the number of characters fmted */
  13. int
  14. dofmt(Fmt *f, char *fmt)
  15. {
  16. Rune rune, *rt, *rs;
  17. int r;
  18. char *t, *s;
  19. int n, nfmt;
  20. nfmt = f->nfmt;
  21. for(;;){
  22. if(f->runes){
  23. rt = f->to;
  24. rs = f->stop;
  25. while((r = *(uint8_t*)fmt) && r != '%'){
  26. if(r < Runeself)
  27. fmt++;
  28. else{
  29. fmt += chartorune(&rune, fmt);
  30. r = rune;
  31. }
  32. FMTRCHAR(f, rt, rs, r);
  33. }
  34. fmt++;
  35. f->nfmt += rt - (Rune *)f->to;
  36. f->to = rt;
  37. if(!r)
  38. return f->nfmt - nfmt;
  39. f->stop = rs;
  40. }else{
  41. t = f->to;
  42. s = f->stop;
  43. while((r = *(uint8_t*)fmt) && r != '%'){
  44. if(r < Runeself){
  45. FMTCHAR(f, t, s, r);
  46. fmt++;
  47. }else{
  48. n = chartorune(&rune, fmt);
  49. if(t + n > s){
  50. t = _fmtflush(f, t, n);
  51. if(t != nil)
  52. s = f->stop;
  53. else
  54. return -1;
  55. }
  56. while(n--)
  57. *t++ = *fmt++;
  58. }
  59. }
  60. fmt++;
  61. f->nfmt += t - (char *)f->to;
  62. f->to = t;
  63. if(!r)
  64. return f->nfmt - nfmt;
  65. f->stop = s;
  66. }
  67. fmt = _fmtdispatch(f, fmt, 0);
  68. if(fmt == nil)
  69. return -1;
  70. }
  71. }
  72. void *
  73. _fmtflush(Fmt *f, void *t, int len)
  74. {
  75. if(f->runes)
  76. f->nfmt += (Rune*)t - (Rune*)f->to;
  77. else
  78. f->nfmt += (char*)t - (char *)f->to;
  79. f->to = t;
  80. if(f->flush == 0 || (*f->flush)(f) == 0 || (char*)f->to + len > (char*)f->stop){
  81. f->stop = f->to;
  82. return nil;
  83. }
  84. return f->to;
  85. }
  86. /*
  87. * put a formatted block of memory sz bytes long of n runes into the output buffer,
  88. * left/right justified in a field of at least f->width charactes
  89. */
  90. int
  91. _fmtpad(Fmt *f, int n)
  92. {
  93. char *t, *s;
  94. int i;
  95. t = f->to;
  96. s = f->stop;
  97. for(i = 0; i < n; i++)
  98. FMTCHAR(f, t, s, ' ');
  99. f->nfmt += t - (char *)f->to;
  100. f->to = t;
  101. return 0;
  102. }
  103. int
  104. _rfmtpad(Fmt *f, int n)
  105. {
  106. Rune *t, *s;
  107. int i;
  108. t = f->to;
  109. s = f->stop;
  110. for(i = 0; i < n; i++)
  111. FMTRCHAR(f, t, s, ' ');
  112. f->nfmt += t - (Rune *)f->to;
  113. f->to = t;
  114. return 0;
  115. }
  116. int
  117. _fmtcpy(Fmt *f, void *vm, int n, int sz)
  118. {
  119. Rune *rt, *rs, r;
  120. char *t, *s, *m, *me;
  121. uint32_t fl;
  122. int nc, w;
  123. m = vm;
  124. me = m + sz;
  125. w = f->width;
  126. fl = f->flags;
  127. if((fl & FmtPrec) && n > f->prec)
  128. n = f->prec;
  129. if(f->runes){
  130. if(!(fl & FmtLeft) && _rfmtpad(f, w - n) < 0)
  131. return -1;
  132. rt = f->to;
  133. rs = f->stop;
  134. for(nc = n; nc > 0; nc--){
  135. r = *(uint8_t*)m;
  136. if(r < Runeself)
  137. m++;
  138. else if((me - m) >= UTFmax || fullrune(m, me-m))
  139. m += chartorune(&r, m);
  140. else
  141. break;
  142. FMTRCHAR(f, rt, rs, r);
  143. }
  144. f->nfmt += rt - (Rune *)f->to;
  145. f->to = rt;
  146. if(fl & FmtLeft && _rfmtpad(f, w - n) < 0)
  147. return -1;
  148. }else{
  149. if(!(fl & FmtLeft) && _fmtpad(f, w - n) < 0)
  150. return -1;
  151. t = f->to;
  152. s = f->stop;
  153. for(nc = n; nc > 0; nc--){
  154. r = *(uint8_t*)m;
  155. if(r < Runeself)
  156. m++;
  157. else if((me - m) >= UTFmax || fullrune(m, me-m))
  158. m += chartorune(&r, m);
  159. else
  160. break;
  161. FMTRUNE(f, t, s, r);
  162. }
  163. f->nfmt += t - (char *)f->to;
  164. f->to = t;
  165. if(fl & FmtLeft && _fmtpad(f, w - n) < 0)
  166. return -1;
  167. }
  168. return 0;
  169. }
  170. int
  171. _fmtrcpy(Fmt *f, void *vm, int n)
  172. {
  173. Rune r, *m, *me, *rt, *rs;
  174. char *t, *s;
  175. uint32_t fl;
  176. int w;
  177. m = vm;
  178. w = f->width;
  179. fl = f->flags;
  180. if((fl & FmtPrec) && n > f->prec)
  181. n = f->prec;
  182. if(f->runes){
  183. if(!(fl & FmtLeft) && _rfmtpad(f, w - n) < 0)
  184. return -1;
  185. rt = f->to;
  186. rs = f->stop;
  187. for(me = m + n; m < me; m++)
  188. FMTRCHAR(f, rt, rs, *m);
  189. f->nfmt += rt - (Rune *)f->to;
  190. f->to = rt;
  191. if(fl & FmtLeft && _rfmtpad(f, w - n) < 0)
  192. return -1;
  193. }else{
  194. if(!(fl & FmtLeft) && _fmtpad(f, w - n) < 0)
  195. return -1;
  196. t = f->to;
  197. s = f->stop;
  198. for(me = m + n; m < me; m++){
  199. r = *m;
  200. FMTRUNE(f, t, s, r);
  201. }
  202. f->nfmt += t - (char *)f->to;
  203. f->to = t;
  204. if(fl & FmtLeft && _fmtpad(f, w - n) < 0)
  205. return -1;
  206. }
  207. return 0;
  208. }
  209. /* fmt out one character */
  210. int
  211. _charfmt(Fmt *f)
  212. {
  213. char x[1];
  214. x[0] = va_arg(f->args, int);
  215. f->prec = 1;
  216. return _fmtcpy(f, x, 1, 1);
  217. }
  218. /* fmt out one rune */
  219. int
  220. _runefmt(Fmt *f)
  221. {
  222. Rune x[1];
  223. x[0] = va_arg(f->args, int);
  224. return _fmtrcpy(f, x, 1);
  225. }
  226. /* public helper routine: fmt out a null terminated string already in hand */
  227. int
  228. fmtstrcpy(Fmt *f, char *s)
  229. {
  230. int i, j;
  231. Rune r;
  232. if(!s)
  233. return _fmtcpy(f, "<nil>", 5, 5);
  234. /* if precision is specified, make sure we don't wander off the end */
  235. if(f->flags & FmtPrec){
  236. i = 0;
  237. for(j=0; j<f->prec && s[i]; j++)
  238. i += chartorune(&r, s+i);
  239. return _fmtcpy(f, s, j, i);
  240. }
  241. return _fmtcpy(f, s, utflen(s), strlen(s));
  242. }
  243. /* fmt out a null terminated utf string */
  244. int
  245. _strfmt(Fmt *f)
  246. {
  247. char *s;
  248. s = va_arg(f->args, char *);
  249. return fmtstrcpy(f, s);
  250. }
  251. /* public helper routine: fmt out a null terminated rune string already in hand */
  252. int
  253. fmtrunestrcpy(Fmt *f, Rune *s)
  254. {
  255. Rune *e;
  256. int n, p;
  257. if(!s)
  258. return _fmtcpy(f, "<nil>", 5, 5);
  259. /* if precision is specified, make sure we don't wander off the end */
  260. if(f->flags & FmtPrec){
  261. p = f->prec;
  262. for(n = 0; n < p; n++)
  263. if(s[n] == 0)
  264. break;
  265. }else{
  266. for(e = s; *e; e++)
  267. ;
  268. n = e - s;
  269. }
  270. return _fmtrcpy(f, s, n);
  271. }
  272. /* fmt out a null terminated rune string */
  273. int
  274. _runesfmt(Fmt *f)
  275. {
  276. Rune *s;
  277. s = va_arg(f->args, Rune *);
  278. return fmtrunestrcpy(f, s);
  279. }
  280. /* fmt a % */
  281. int
  282. _percentfmt(Fmt *f)
  283. {
  284. Rune x[1];
  285. x[0] = f->r;
  286. f->prec = 1;
  287. return _fmtrcpy(f, x, 1);
  288. }
  289. enum {
  290. /* %,#llb could emit a sign, "0b" and 64 digits with 21 commas */
  291. Maxintwidth = 1 + 2 + 64 + 64/3,
  292. };
  293. /* fmt an integer */
  294. int
  295. _ifmt(Fmt *f)
  296. {
  297. char buf[Maxintwidth + 1], *p, *conv;
  298. uint64_t vu;
  299. uint32_t u;
  300. uintptr pu;
  301. int neg, base, i, n, fl, w, isv;
  302. neg = 0;
  303. fl = f->flags;
  304. isv = 0;
  305. vu = 0;
  306. u = 0;
  307. if(f->r == 'p'){
  308. pu = va_arg(f->args, uintptr);
  309. if(sizeof(uintptr) == sizeof(uint64_t)){
  310. vu = pu;
  311. isv = 1;
  312. }else
  313. u = pu;
  314. f->r = 'x';
  315. fl |= FmtUnsigned;
  316. }else if(fl & FmtVLong){
  317. isv = 1;
  318. if(fl & FmtUnsigned)
  319. vu = va_arg(f->args, uint64_t);
  320. else
  321. vu = va_arg(f->args, int64_t);
  322. }else if(fl & FmtLong){
  323. if(fl & FmtUnsigned)
  324. u = va_arg(f->args, uint32_t);
  325. else
  326. u = va_arg(f->args, int32_t);
  327. }else if(fl & FmtByte){
  328. if(fl & FmtUnsigned)
  329. u = (uint8_t)va_arg(f->args, int);
  330. else
  331. u = (char)va_arg(f->args, int);
  332. }else if(fl & FmtShort){
  333. if(fl & FmtUnsigned)
  334. u = (uint16_t)va_arg(f->args, int);
  335. else
  336. u = (int16_t)va_arg(f->args, int);
  337. }else{
  338. if(fl & FmtUnsigned)
  339. u = va_arg(f->args, uint);
  340. else
  341. u = va_arg(f->args, int);
  342. }
  343. conv = "0123456789abcdef";
  344. switch(f->r){
  345. case 'd':
  346. base = 10;
  347. break;
  348. case 'u':
  349. base = 10;
  350. f->flags |= FmtUnsigned;
  351. break;
  352. case 'x':
  353. base = 16;
  354. f->flags |= FmtUnsigned;
  355. break;
  356. case 'X':
  357. base = 16;
  358. f->flags |= FmtUnsigned;
  359. conv = "0123456789ABCDEF";
  360. break;
  361. case 'b':
  362. base = 2;
  363. f->flags |= FmtUnsigned;
  364. break;
  365. case 'o':
  366. base = 8;
  367. f->flags |= FmtUnsigned;
  368. break;
  369. default:
  370. return -1;
  371. }
  372. if(!(fl & FmtUnsigned)){
  373. if(isv && (int64_t)vu < 0){
  374. vu = -(int64_t)vu;
  375. neg = 1;
  376. }else if(!isv && (int32_t)u < 0){
  377. u = -(int32_t)u;
  378. neg = 1;
  379. }
  380. }
  381. p = buf + sizeof buf - 1;
  382. n = 0;
  383. if(isv){
  384. while(vu){
  385. i = vu % base;
  386. vu /= base;
  387. if((fl & FmtComma) && n % 4 == 3){
  388. *p-- = ',';
  389. n++;
  390. }
  391. *p-- = conv[i];
  392. n++;
  393. }
  394. }else{
  395. while(u){
  396. i = u % base;
  397. u /= base;
  398. if((fl & FmtComma) && n % 4 == 3){
  399. *p-- = ',';
  400. n++;
  401. }
  402. *p-- = conv[i];
  403. n++;
  404. }
  405. }
  406. if(n == 0){
  407. *p-- = '0';
  408. n = 1;
  409. }
  410. for(w = f->prec; n < w && p > buf+3; n++)
  411. *p-- = '0';
  412. if(neg || (fl & (FmtSign|FmtSpace)))
  413. n++;
  414. if(fl & FmtSharp){
  415. if(base == 16)
  416. n += 2;
  417. else if(base == 8){
  418. if(p[1] == '0')
  419. fl &= ~FmtSharp;
  420. else
  421. n++;
  422. }
  423. }
  424. if((fl & FmtZero) && !(fl & (FmtLeft|FmtPrec))){
  425. for(w = f->width; n < w && p > buf+3; n++)
  426. *p-- = '0';
  427. f->width = 0;
  428. }
  429. if(fl & FmtSharp){
  430. if(base == 16)
  431. *p-- = f->r;
  432. if(base == 16 || base == 8)
  433. *p-- = '0';
  434. }
  435. if(neg)
  436. *p-- = '-';
  437. else if(fl & FmtSign)
  438. *p-- = '+';
  439. else if(fl & FmtSpace)
  440. *p-- = ' ';
  441. f->flags &= ~FmtPrec;
  442. return _fmtcpy(f, p + 1, n, n);
  443. }
  444. int
  445. _countfmt(Fmt *f)
  446. {
  447. void *p;
  448. uint32_t fl;
  449. fl = f->flags;
  450. p = va_arg(f->args, void*);
  451. if(fl & FmtVLong){
  452. *(int64_t*)p = f->nfmt;
  453. }else if(fl & FmtLong){
  454. *(int32_t*)p = f->nfmt;
  455. }else if(fl & FmtByte){
  456. *(char*)p = f->nfmt;
  457. }else if(fl & FmtShort){
  458. *(int16_t*)p = f->nfmt;
  459. }else{
  460. *(int*)p = f->nfmt;
  461. }
  462. return 0;
  463. }
  464. int
  465. _flagfmt(Fmt *f)
  466. {
  467. switch(f->r){
  468. case ',':
  469. f->flags |= FmtComma;
  470. break;
  471. case '-':
  472. f->flags |= FmtLeft;
  473. break;
  474. case '+':
  475. f->flags |= FmtSign;
  476. break;
  477. case '#':
  478. f->flags |= FmtSharp;
  479. break;
  480. case ' ':
  481. f->flags |= FmtSpace;
  482. break;
  483. case 'h':
  484. if(f->flags & FmtShort)
  485. f->flags |= FmtByte;
  486. f->flags |= FmtShort;
  487. break;
  488. case 'l':
  489. if(f->flags & FmtLong)
  490. f->flags |= FmtVLong;
  491. f->flags |= FmtLong;
  492. break;
  493. }
  494. return 1;
  495. }
  496. /* default error format */
  497. int
  498. _badfmt(Fmt *f)
  499. {
  500. Rune x[3];
  501. x[0] = '%';
  502. x[1] = f->r;
  503. x[2] = '%';
  504. f->prec = 3;
  505. _fmtrcpy(f, x, 3);
  506. return 0;
  507. }