dofmt.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557
  1. /*
  2. * The authors of this software are Rob Pike and Ken Thompson.
  3. * Copyright (c) 2002 by Lucent Technologies.
  4. * Permission to use, copy, modify, and distribute this software for any
  5. * purpose without fee is hereby granted, provided that this entire notice
  6. * is included in all copies of any software which is or includes a copy
  7. * or modification of this software and in all copies of the supporting
  8. * documentation for such software.
  9. * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
  10. * WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
  11. * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
  12. * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
  13. */
  14. #include <stdarg.h>
  15. #include <string.h>
  16. #include "utf.h"
  17. #include "fmt.h"
  18. #include "fmtdef.h"
  19. /* format the output into f->to and return the number of characters fmted */
  20. int
  21. dofmt(Fmt *f, char *fmt)
  22. {
  23. Rune rune, *rt, *rs;
  24. int r;
  25. char *t, *s;
  26. int n, nfmt;
  27. nfmt = f->nfmt;
  28. for(;;){
  29. if(f->runes){
  30. rt = (Rune*)f->to;
  31. rs = (Rune*)f->stop;
  32. while((r = *(uchar*)fmt) && r != '%'){
  33. if(r < Runeself)
  34. fmt++;
  35. else{
  36. fmt += chartorune(&rune, fmt);
  37. r = rune;
  38. }
  39. FMTRCHAR(f, rt, rs, r);
  40. }
  41. fmt++;
  42. f->nfmt += rt - (Rune *)f->to;
  43. f->to = rt;
  44. if(!r)
  45. return f->nfmt - nfmt;
  46. f->stop = rs;
  47. }else{
  48. t = (char*)f->to;
  49. s = (char*)f->stop;
  50. while((r = *(uchar*)fmt) && r != '%'){
  51. if(r < Runeself){
  52. FMTCHAR(f, t, s, r);
  53. fmt++;
  54. }else{
  55. n = chartorune(&rune, fmt);
  56. if(t + n > s){
  57. t = (char*)__fmtflush(f, t, n);
  58. if(t != nil)
  59. s = (char*)f->stop;
  60. else
  61. return -1;
  62. }
  63. while(n--)
  64. *t++ = *fmt++;
  65. }
  66. }
  67. fmt++;
  68. f->nfmt += t - (char *)f->to;
  69. f->to = t;
  70. if(!r)
  71. return f->nfmt - nfmt;
  72. f->stop = s;
  73. }
  74. fmt = (char*)__fmtdispatch(f, fmt, 0);
  75. if(fmt == nil)
  76. return -1;
  77. }
  78. }
  79. void *
  80. __fmtflush(Fmt *f, void *t, int len)
  81. {
  82. if(f->runes)
  83. f->nfmt += (Rune*)t - (Rune*)f->to;
  84. else
  85. f->nfmt += (char*)t - (char *)f->to;
  86. f->to = t;
  87. if(f->flush == 0 || (*f->flush)(f) == 0 || (char*)f->to + len > (char*)f->stop){
  88. f->stop = f->to;
  89. return nil;
  90. }
  91. return f->to;
  92. }
  93. /*
  94. * put a formatted block of memory sz bytes long of n runes into the output buffer,
  95. * left/right justified in a field of at least f->width charactes
  96. */
  97. int
  98. __fmtpad(Fmt *f, int n)
  99. {
  100. char *t, *s;
  101. int i;
  102. t = (char*)f->to;
  103. s = (char*)f->stop;
  104. for(i = 0; i < n; i++)
  105. FMTCHAR(f, t, s, ' ');
  106. f->nfmt += t - (char *)f->to;
  107. f->to = t;
  108. return 0;
  109. }
  110. int
  111. __rfmtpad(Fmt *f, int n)
  112. {
  113. Rune *t, *s;
  114. int i;
  115. t = (Rune*)f->to;
  116. s = (Rune*)f->stop;
  117. for(i = 0; i < n; i++)
  118. FMTRCHAR(f, t, s, ' ');
  119. f->nfmt += t - (Rune *)f->to;
  120. f->to = t;
  121. return 0;
  122. }
  123. int
  124. __fmtcpy(Fmt *f, const void *vm, int n, int sz)
  125. {
  126. Rune *rt, *rs, r;
  127. char *t, *s, *m, *me;
  128. ulong fl;
  129. int nc, w;
  130. m = (char*)vm;
  131. me = m + sz;
  132. w = f->width;
  133. fl = f->flags;
  134. if((fl & FmtPrec) && n > f->prec)
  135. n = f->prec;
  136. if(f->runes){
  137. if(!(fl & FmtLeft) && __rfmtpad(f, w - n) < 0)
  138. return -1;
  139. rt = (Rune*)f->to;
  140. rs = (Rune*)f->stop;
  141. for(nc = n; nc > 0; nc--){
  142. r = *(uchar*)m;
  143. if(r < Runeself)
  144. m++;
  145. else if((me - m) >= UTFmax || fullrune(m, me-m))
  146. m += chartorune(&r, m);
  147. else
  148. break;
  149. FMTRCHAR(f, rt, rs, r);
  150. }
  151. f->nfmt += rt - (Rune *)f->to;
  152. f->to = rt;
  153. if(m < me)
  154. return -1;
  155. if(fl & FmtLeft && __rfmtpad(f, w - n) < 0)
  156. return -1;
  157. }else{
  158. if(!(fl & FmtLeft) && __fmtpad(f, w - n) < 0)
  159. return -1;
  160. t = (char*)f->to;
  161. s = (char*)f->stop;
  162. for(nc = n; nc > 0; nc--){
  163. r = *(uchar*)m;
  164. if(r < Runeself)
  165. m++;
  166. else if((me - m) >= UTFmax || fullrune(m, me-m))
  167. m += chartorune(&r, m);
  168. else
  169. break;
  170. FMTRUNE(f, t, s, r);
  171. }
  172. f->nfmt += t - (char *)f->to;
  173. f->to = t;
  174. if(fl & FmtLeft && __fmtpad(f, w - n) < 0)
  175. return -1;
  176. }
  177. return 0;
  178. }
  179. int
  180. __fmtrcpy(Fmt *f, const void *vm, int n)
  181. {
  182. Rune r, *m, *me, *rt, *rs;
  183. char *t, *s;
  184. ulong fl;
  185. int w;
  186. m = (Rune*)vm;
  187. w = f->width;
  188. fl = f->flags;
  189. if((fl & FmtPrec) && n > f->prec)
  190. n = f->prec;
  191. if(f->runes){
  192. if(!(fl & FmtLeft) && __rfmtpad(f, w - n) < 0)
  193. return -1;
  194. rt = (Rune*)f->to;
  195. rs = (Rune*)f->stop;
  196. for(me = m + n; m < me; m++)
  197. FMTRCHAR(f, rt, rs, *m);
  198. f->nfmt += rt - (Rune *)f->to;
  199. f->to = rt;
  200. if(fl & FmtLeft && __rfmtpad(f, w - n) < 0)
  201. return -1;
  202. }else{
  203. if(!(fl & FmtLeft) && __fmtpad(f, w - n) < 0)
  204. return -1;
  205. t = (char*)f->to;
  206. s = (char*)f->stop;
  207. for(me = m + n; m < me; m++){
  208. r = *m;
  209. FMTRUNE(f, t, s, r);
  210. }
  211. f->nfmt += t - (char *)f->to;
  212. f->to = t;
  213. if(fl & FmtLeft && __fmtpad(f, w - n) < 0)
  214. return -1;
  215. }
  216. return 0;
  217. }
  218. /* fmt out one character */
  219. int
  220. __charfmt(Fmt *f)
  221. {
  222. char x[1];
  223. x[0] = va_arg(f->args, int);
  224. f->prec = 1;
  225. return __fmtcpy(f, (const char*)x, 1, 1);
  226. }
  227. /* fmt out one rune */
  228. int
  229. __runefmt(Fmt *f)
  230. {
  231. Rune x[1];
  232. x[0] = va_arg(f->args, int);
  233. return __fmtrcpy(f, (const void*)x, 1);
  234. }
  235. /* public helper routine: fmt out a null terminated string already in hand */
  236. int
  237. fmtstrcpy(Fmt *f, char *s)
  238. {
  239. int p, i;
  240. if(!s)
  241. return __fmtcpy(f, "<nil>", 5, 5);
  242. /* if precision is specified, make sure we don't wander off the end */
  243. if(f->flags & FmtPrec){
  244. p = f->prec;
  245. for(i = 0; i < p; i++)
  246. if(s[i] == 0)
  247. break;
  248. return __fmtcpy(f, s, utfnlen(s, i), i); /* BUG?: won't print a partial rune at end */
  249. }
  250. return __fmtcpy(f, s, utflen(s), strlen(s));
  251. }
  252. /* fmt out a null terminated utf string */
  253. int
  254. __strfmt(Fmt *f)
  255. {
  256. char *s;
  257. s = va_arg(f->args, char *);
  258. return fmtstrcpy(f, s);
  259. }
  260. /* public helper routine: fmt out a null terminated rune string already in hand */
  261. int
  262. fmtrunestrcpy(Fmt *f, Rune *s)
  263. {
  264. Rune *e;
  265. int n, p;
  266. if(!s)
  267. return __fmtcpy(f, "<nil>", 5, 5);
  268. /* if precision is specified, make sure we don't wander off the end */
  269. if(f->flags & FmtPrec){
  270. p = f->prec;
  271. for(n = 0; n < p; n++)
  272. if(s[n] == 0)
  273. break;
  274. }else{
  275. for(e = s; *e; e++)
  276. ;
  277. n = e - s;
  278. }
  279. return __fmtrcpy(f, s, n);
  280. }
  281. /* fmt out a null terminated rune string */
  282. int
  283. __runesfmt(Fmt *f)
  284. {
  285. Rune *s;
  286. s = va_arg(f->args, Rune *);
  287. return fmtrunestrcpy(f, s);
  288. }
  289. /* fmt a % */
  290. int
  291. __percentfmt(Fmt *f)
  292. {
  293. Rune x[1];
  294. x[0] = f->r;
  295. f->prec = 1;
  296. return __fmtrcpy(f, (const void*)x, 1);
  297. }
  298. /* fmt an integer */
  299. int
  300. __ifmt(Fmt *f)
  301. {
  302. char buf[70], *p, *conv;
  303. uvlong vu;
  304. ulong u;
  305. int neg, base, i, n, fl, w, isv;
  306. neg = 0;
  307. fl = f->flags;
  308. isv = 0;
  309. vu = 0;
  310. u = 0;
  311. /*
  312. * Unsigned verbs
  313. */
  314. switch(f->r){
  315. case 'o':
  316. case 'u':
  317. case 'x':
  318. case 'X':
  319. fl |= FmtUnsigned;
  320. break;
  321. }
  322. if(f->r == 'p'){
  323. u = (ulong)va_arg(f->args, void*);
  324. f->r = 'x';
  325. fl |= FmtUnsigned;
  326. }else if(fl & FmtVLong){
  327. isv = 1;
  328. if(fl & FmtUnsigned)
  329. vu = va_arg(f->args, uvlong);
  330. else
  331. vu = va_arg(f->args, vlong);
  332. }else if(fl & FmtLong){
  333. if(fl & FmtUnsigned)
  334. u = va_arg(f->args, ulong);
  335. else
  336. u = va_arg(f->args, long);
  337. }else if(fl & FmtByte){
  338. if(fl & FmtUnsigned)
  339. u = (uchar)va_arg(f->args, int);
  340. else
  341. u = (char)va_arg(f->args, int);
  342. }else if(fl & FmtShort){
  343. if(fl & FmtUnsigned)
  344. u = (ushort)va_arg(f->args, int);
  345. else
  346. u = (short)va_arg(f->args, int);
  347. }else{
  348. if(fl & FmtUnsigned)
  349. u = va_arg(f->args, uint);
  350. else
  351. u = va_arg(f->args, int);
  352. }
  353. conv = "0123456789abcdef";
  354. switch(f->r){
  355. case 'd':
  356. case 'i':
  357. base = 10;
  358. break;
  359. case 'u':
  360. base = 10;
  361. break;
  362. case 'x':
  363. base = 16;
  364. break;
  365. case 'X':
  366. base = 16;
  367. conv = "0123456789ABCDEF";
  368. break;
  369. case 'b':
  370. base = 2;
  371. break;
  372. case 'o':
  373. base = 8;
  374. break;
  375. default:
  376. return -1;
  377. }
  378. if(!(fl & FmtUnsigned)){
  379. if(isv && (vlong)vu < 0){
  380. vu = -(vlong)vu;
  381. neg = 1;
  382. }else if(!isv && (long)u < 0){
  383. u = -(long)u;
  384. neg = 1;
  385. }
  386. }else{
  387. fl &= ~(FmtSign|FmtSpace); /* no + for unsigned conversions */
  388. }
  389. p = buf + sizeof buf - 1;
  390. n = 0;
  391. if(isv){
  392. while(vu){
  393. i = vu % base;
  394. vu /= base;
  395. if((fl & FmtComma) && n % 4 == 3){
  396. *p-- = ',';
  397. n++;
  398. }
  399. *p-- = conv[i];
  400. n++;
  401. }
  402. }else{
  403. while(u){
  404. i = u % base;
  405. u /= base;
  406. if((fl & FmtComma) && n % 4 == 3){
  407. *p-- = ',';
  408. n++;
  409. }
  410. *p-- = conv[i];
  411. n++;
  412. }
  413. }
  414. if(n == 0){
  415. if(!(fl & FmtPrec) || f->prec != 0){
  416. *p-- = '0';
  417. n = 1;
  418. }
  419. fl &= ~FmtSharp;
  420. }
  421. for(w = f->prec; n < w && p > buf+3; n++)
  422. *p-- = '0';
  423. if(neg || (fl & (FmtSign|FmtSpace)))
  424. n++;
  425. if(fl & FmtSharp){
  426. if(base == 16)
  427. n += 2;
  428. else if(base == 8){
  429. if(p[1] == '0')
  430. fl &= ~FmtSharp;
  431. else
  432. n++;
  433. }
  434. }
  435. if((fl & FmtZero) && !(fl & (FmtLeft|FmtPrec))){
  436. for(w = f->width; n < w && p > buf+3; n++)
  437. *p-- = '0';
  438. f->width = 0;
  439. }
  440. if(fl & FmtSharp){
  441. if(base == 16)
  442. *p-- = f->r;
  443. if(base == 16 || base == 8)
  444. *p-- = '0';
  445. }
  446. if(neg)
  447. *p-- = '-';
  448. else if(fl & FmtSign)
  449. *p-- = '+';
  450. else if(fl & FmtSpace)
  451. *p-- = ' ';
  452. f->flags &= ~FmtPrec;
  453. return __fmtcpy(f, p + 1, n, n);
  454. }
  455. int
  456. __countfmt(Fmt *f)
  457. {
  458. void *p;
  459. ulong fl;
  460. fl = f->flags;
  461. p = va_arg(f->args, void*);
  462. if(fl & FmtVLong){
  463. *(vlong*)p = f->nfmt;
  464. }else if(fl & FmtLong){
  465. *(long*)p = f->nfmt;
  466. }else if(fl & FmtByte){
  467. *(char*)p = f->nfmt;
  468. }else if(fl & FmtShort){
  469. *(short*)p = f->nfmt;
  470. }else{
  471. *(int*)p = f->nfmt;
  472. }
  473. return 0;
  474. }
  475. int
  476. __flagfmt(Fmt *f)
  477. {
  478. switch(f->r){
  479. case ',':
  480. f->flags |= FmtComma;
  481. break;
  482. case '-':
  483. f->flags |= FmtLeft;
  484. break;
  485. case '+':
  486. f->flags |= FmtSign;
  487. break;
  488. case '#':
  489. f->flags |= FmtSharp;
  490. break;
  491. case ' ':
  492. f->flags |= FmtSpace;
  493. break;
  494. case 'u':
  495. f->flags |= FmtUnsigned;
  496. break;
  497. case 'h':
  498. if(f->flags & FmtShort)
  499. f->flags |= FmtByte;
  500. f->flags |= FmtShort;
  501. break;
  502. case 'L':
  503. f->flags |= FmtLDouble;
  504. break;
  505. case 'l':
  506. if(f->flags & FmtLong)
  507. f->flags |= FmtVLong;
  508. f->flags |= FmtLong;
  509. break;
  510. }
  511. return 1;
  512. }
  513. /* default error format */
  514. int
  515. __badfmt(Fmt *f)
  516. {
  517. char x[3];
  518. x[0] = '%';
  519. x[1] = f->r;
  520. x[2] = '%';
  521. f->prec = 3;
  522. __fmtcpy(f, (const void*)x, 3, 3);
  523. return 0;
  524. }