1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856
|
/*
Copyright (c) 2019-2019, David Anderson
All rights reserved.
Redistribution and use in source and binary forms, with
or without modification, are permitted provided that the
following conditions are met:
Redistributions of source code must retain the above
copyright notice, this list of conditions and the following
disclaimer.
Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials
provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* A lighly generalized data buffer.
Works for more than just strings,
but has features (such as ensuring
data always has a NUL byte following
the data area used) most useful for C strings.
All these return either TRUE (the values altered)
or FALSE (something went wrong, quite likely
the caller presented a bad format string for the
value).
*/
#include "config.h"
#include <stdio.h> /* for malloc */
#ifdef HAVE_STDLIB_H
#include <stdlib.h> /* for malloc */
#endif /* HAVE_STDLIB_H */
#ifdef HAVE_STRING_H
#include <string.h> /* for strlen */
#endif /* HAVE_STRING_H */
#ifdef HAVE_MALLOC_H
/* Useful include for some Windows compilers. */
#include <malloc.h>
#endif /* HAVE_MALLOC_H */
#include "dwarfstring.h"
#ifndef TRUE
#define TRUE 1
#endif /* TRUE */
#ifndef FALSE
#define FALSE 0
#endif /* FALSE */
#ifdef HAVE_UNUSED_ATTRIBUTE
#define UNUSEDARG __attribute__ ((unused))
#else
#define UNUSEDARG
#endif
static unsigned long minimumnewlen = 30;
/*
struct dwarfstring_s {
char * s_data;
unsigned long s_size;
unsigned long s_avail;
unsigned char s_malloc;
};
*/
int
dwarfstring_constructor(struct dwarfstring_s *g)
{
g->s_data = "";
g->s_size = 0;
g->s_avail = 0;
g->s_malloc = FALSE;
return TRUE;
}
static int
dwarfstring_resize_to(struct dwarfstring_s *g,unsigned long newlen)
{
char *b = 0;
unsigned long lastpos =
g->s_size - g->s_avail;
unsigned long malloclen = newlen+1;
if (malloclen < minimumnewlen) {
malloclen = minimumnewlen;
}
b = malloc(malloclen);
if (!b) {
return FALSE;
}
if (lastpos > 0) {
memcpy(b,g->s_data,lastpos);
}
if (g->s_malloc) {
free(g->s_data);
g->s_data = 0;
}
g->s_data = b;
g->s_data[lastpos] = 0;
g->s_size = newlen;
g->s_avail = newlen - lastpos;
g->s_malloc = TRUE;
return TRUE;
}
int
dwarfstring_reset(struct dwarfstring_s *g)
{
if (!g->s_size) {
/* In initial condition, nothing to do. */
return TRUE;
}
g->s_avail = g->s_size;
g->s_data[0] = 0;
return TRUE;
}
int
dwarfstring_constructor_fixed(struct dwarfstring_s *g,
unsigned long len)
{
int r = FALSE;
dwarfstring_constructor(g);
if (len == 0) {
return TRUE;
}
r = dwarfstring_resize_to(g,len);
if (!r) {
return FALSE;
}
return TRUE;
}
int
dwarfstring_constructor_static(struct dwarfstring_s *g,
char * space,
unsigned long len)
{
dwarfstring_constructor(g);
g->s_data = space;
g->s_data[0] = 0;
g->s_size = len;
g->s_avail = len;
g->s_malloc = FALSE;
return TRUE;
}
void
dwarfstring_destructor(struct dwarfstring_s *g)
{
if (g->s_malloc) {
free(g->s_data);
g->s_data = 0;
g->s_malloc = 0;
}
dwarfstring_constructor(g);
}
/* For the case where one wants just the first 'len'
characters of 'str'. NUL terminator provided
for you in s_data.
*/
int
dwarfstring_append_length(struct dwarfstring_s *g,char *str,
unsigned long slen)
{
unsigned long lastpos = g->s_size - g->s_avail;
int r = 0;
if (!str || slen ==0) {
return TRUE;
}
if (slen >= g->s_avail) {
unsigned long newlen = 0;
newlen = g->s_size + slen+2;
r = dwarfstring_resize_to(g,newlen);
if (!r) {
return FALSE;
}
}
memcpy(g->s_data + lastpos,str,slen);
g->s_avail -= slen;
g->s_data[g->s_size - g->s_avail] = 0;
return TRUE;
}
int
dwarfstring_append(struct dwarfstring_s *g,char *str)
{
unsigned long dlen = 0;
if (!str) {
return TRUE;
}
dlen = strlen(str);
return dwarfstring_append_length(g,str,dlen);
}
char *
dwarfstring_string(struct dwarfstring_s *g)
{
return g->s_data;
}
unsigned long
dwarfstring_strlen(struct dwarfstring_s *g)
{
return g->s_size - g->s_avail;
}
static int
_dwarfstring_append_spaces(dwarfstring *data,
size_t count)
{
int res = 0;
char spacebuf[] = {" "};
size_t charct = sizeof(spacebuf)-1;
size_t l = count;
while (l > charct) {
res = dwarfstring_append_length(data,spacebuf,charct);
l -= charct;
if (res != TRUE) {
return res;
}
}
/* ASSERT: l > 0 */
res = dwarfstring_append_length(data,spacebuf,l);
return res;
}
static int
_dwarfstring_append_zeros(dwarfstring *data, size_t l)
{
int res = 0;
static char zeros[] = {
"0000000000000000000000000000000000000000"};
size_t charct = sizeof(zeros)-1;
while (l > charct) {
res = dwarfstring_append_length(data,zeros,charct);
l -= charct;
if (res != TRUE) {
return res;
}
}
/* ASSERT: l > 0 */
dwarfstring_append_length(data,zeros,l);
return res;
}
int dwarfstring_append_printf_s(dwarfstring *data,
char *format,char *s)
{
size_t stringlen = 0;
size_t next = 0;
long val = 0;
char *endptr = 0;
const char *numptr = 0;
/* was %[-]fixedlen. Zero means no len provided. */
size_t fixedlen = 0;
/* was %-, nonzero means left-justify */
long leftjustify = 0;
size_t prefixlen = 0;
int res = 0;
if (!s) {
s="<ERROR: null string pointer to "
"dwarfstring_append_printf_s>";
}
stringlen = strlen(s);
if (!format) {
format="<ERROR: null format pointer to "
"dwarfstring_append_printf_s>";
}
while (format[next] && format[next] != '%') {
++next;
++prefixlen;
}
if (prefixlen) {
dwarfstring_append_length(data,format,prefixlen);
}
if (!format[next]) {
return TRUE;
}
next++;
if (format[next] == '-') {
leftjustify++;
next++;
}
numptr = format+next;
val = strtol(numptr,&endptr,10);
if ( endptr != numptr) {
fixedlen = val;
}
next = (endptr - format);
if (format[next] != 's') {
return FALSE;
}
next++;
if (fixedlen && (stringlen >= fixedlen)) {
/* Ignore leftjustify (if any) and the stringlen
as the actual string overrides those. */
leftjustify = 0;
}
if (leftjustify) {
dwarfstring_append_length(data,s,stringlen);
if (fixedlen) {
size_t trailingspaces = fixedlen - stringlen;
_dwarfstring_append_spaces(data,trailingspaces);
}
} else {
if (fixedlen && fixedlen < stringlen) {
/* This lets us have fixedlen < stringlen by
taking all the chars from s*/
dwarfstring_append_length(data,s,stringlen);
} else {
if (fixedlen) {
size_t leadingspaces = fixedlen - stringlen;
size_t k = 0;
for ( ; k < leadingspaces; ++k) {
dwarfstring_append_length(data," ",1);
}
}
dwarfstring_append_length(data,s,stringlen);
}
}
if (!format[next]) {
return TRUE;
}
{
char * startpt = format+next;
size_t suffixlen = strlen(startpt);
res = dwarfstring_append_length(data,startpt,suffixlen);
}
return res;
}
static char v32m[] = {"-2147483648"};
static char v64m[] = {"-9223372036854775808"};
static char dtable[10] = {
'0','1','2','3','4','5','6','7','8','9'
};
static char xtable[16] = {
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'
};
static char Xtable[16] = {
'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'
};
/* We deal with formats like:
%d %5d %05d %+d %+5d %-5d (and ld and lld too). */
int dwarfstring_append_printf_i(dwarfstring *data,
char *format,
dwarfstring_i v)
{
int res = TRUE;
size_t next = 0;
long val = 0;
char *endptr = 0;
const char *numptr = 0;
size_t fixedlen = 0;
int leadingzero = 0;
int minuscount = 0; /*left justify */
int pluscount = 0;
int lcount = 0;
int ucount = 0;
int dcount = 0;
int xcount = 0;
int Xcount = 0;
char *ctable = dtable;
size_t prefixlen = 0;
int done = 0;
if (!format) {
format="<ERROR: null format pointer to "
"dwarfstring_append_printf_i>";
}
while (format[next] && format[next] != '%') {
++next;
++prefixlen;
}
dwarfstring_append_length(data,format,prefixlen);
if (format[next] != '%') {
/* No % operator found, we are done */
return TRUE;
}
next++;
if (format[next] == '-') {
minuscount++;
next++;
}
if (format[next] == '+') {
pluscount++;
next++;
}
if (format[next] == '-') {
minuscount++;
next++;
}
if (format[next] == '0') {
leadingzero = 1;
next++;
}
numptr = format+next;
val = strtol(numptr,&endptr,10);
if ( endptr != numptr) {
fixedlen = val;
}
next = (endptr - format);
/* Following is lx lu or u or llx llu , we take
all this to mean 64 bits, */
#if defined(_WIN32) && defined(HAVE_NONSTANDARD_PRINTF_64_FORMAT)
if (format[next] == 'I') {
/*lcount++;*/
next++;
}
if (format[next] == '6') {
/*lcount++;*/
next++;
}
if (format[next] == '4') {
/*lcount++;*/
next++;
}
#endif /* HAVE_NONSTANDARD_PRINTF_64_FORMAT */
if (format[next] == 'l') {
lcount++;
next++;
}
if (format[next] == 'l') {
lcount++;
next++;
}
if (format[next] == 'l') {
lcount++;
next++;
}
if (format[next] == 'u') {
ucount++;
next++;
}
if (format[next] == 'd') {
dcount++;
next++;
}
if (format[next] == 'x') {
xcount++;
next++;
}
if (format[next] == 'X') {
Xcount++;
next++;
}
if (format[next] == 's') {
/* ESBERR("ESBERR_pct_scount_in_i"); */
dwarfstring_append(data,
"<ERROR: format %s passed to "
"dwarfstring_append_printf_i>");
return FALSE;
}
if (xcount || Xcount) {
/* Use the printf_u for %x and the like
just copying the entire format makes
it easier for coders to understand
nothing much was done */
dwarfstring_append(data,
"<ERROR: format %x or %X passed to "
"dwarfstring_append_printf_i>");
dwarfstring_append(data,format+prefixlen);
return FALSE;
}
if (!dcount || (lcount >2) ||
(Xcount+xcount+dcount+ucount) > 1) {
/* error */
dwarfstring_append(data,
"<ERROR: format has too many %x/d/u/l passed to "
"dwarfstring_append_printf_i>");
/* ESBERR("ESBERR_xcount_etc_i"); */
return FALSE;
}
if (pluscount && minuscount) {
/* We don't allow format +- */
dwarfstring_append(data,
"<ERROR: format disallowed. +- passed to "
"dwarfstring_append_printf_i>");
return FALSE;
}
{
char digbuf[36];
char *digptr = digbuf+sizeof(digbuf) -1;
size_t digcharlen = 0;
dwarfstring_i remaining = v;
int vissigned = 0;
dwarfstring_i divisor = 10;
*digptr = 0;
--digptr;
if (v < 0) {
vissigned = 1;
/* This test is for twos-complement
machines and would be better done via
configure with a compile-time check
so we do not need a size test at runtime. */
if (sizeof(v) == 8) {
dwarfstring_u vm = 0x7fffffffffffffffULL;
if (vm == (dwarfstring_u)~v) {
memcpy(digbuf,v64m,sizeof(v64m));
digcharlen = sizeof(v64m)-1;
digptr = digbuf;
done = 1;
} else {
remaining = -v;
}
} else if (sizeof(v) == 4) {
dwarfstring_u vm = 0x7fffffffL;
if (vm == (dwarfstring_u)~v) {
memcpy(digbuf,v32m,sizeof(v32m));
digcharlen = sizeof(v32m)-1;
digptr = digbuf;
done = 1;
} else {
remaining = -v;
}
}else {
dwarfstring_append(data,
"<ERROR: v passed to "
"dwarfstring_append_printf_i "
"cannot be handled:integer size>");
/* ESBERR("ESBERR_sizeof_v_i"); */
/* error */
return FALSE;
}
}
if (!done) {
for ( ;; ) {
dwarfstring_u dig = 0;
dig = remaining % divisor;
remaining /= divisor;
*digptr = ctable[dig];
digcharlen++;
if (!remaining) {
break;
}
--digptr;
}
if (vissigned) { /* could check minuscount instead */
--digptr;
digcharlen++;
*digptr = '-';
} else if (pluscount) {
--digptr;
digcharlen++;
*digptr = '+';
}
}
if (fixedlen > 0) {
if (fixedlen <= digcharlen) {
dwarfstring_append_length(data,digptr,digcharlen);
} else {
size_t prefixcount = fixedlen - digcharlen;
if (!leadingzero) {
_dwarfstring_append_spaces(data,prefixcount);
dwarfstring_append_length(data,digptr,digcharlen);
} else {
if (*digptr == '-') {
dwarfstring_append_length(data,"-",1);
_dwarfstring_append_zeros(data,prefixcount);
digptr++;
dwarfstring_append_length(data,digptr,
digcharlen-1);
} else if (*digptr == '+') {
dwarfstring_append_length(data,"+",1);
_dwarfstring_append_zeros(data,prefixcount);
digptr++;
dwarfstring_append_length(data,digptr,
digcharlen-1);
} else {
_dwarfstring_append_zeros(data,prefixcount);
dwarfstring_append_length(data,digptr,
digcharlen);
}
}
}
} else {
res = dwarfstring_append_length(data,digptr,digcharlen);
}
}
if (format[next]) {
size_t trailinglen = strlen(format+next);
res = dwarfstring_append_length(data,format+next,trailinglen);
}
return res;
}
#if 0
/* Counts hex chars. divide by two to get bytes from input
integer. */
static unsigned
trimleadingzeros(char *ptr,unsigned digits,unsigned keepcount)
{
char *cp = ptr;
unsigned leadzeroscount = 0;
unsigned trimoff = 0;
for (; *cp; ++cp) {
if (*cp == '0') {
leadzeroscount++;
continue;
}
}
trimoff = keepcount - digits;
if (trimoff&1) {
trimoff--;
}
return trimoff;
}
#endif /* 0 */
/* With gcc version 5.4.0 20160609 a version using
const char *formatp instead of format[next]
and deleting the 'next' variable
is a few hundredths of a second slower, repeatably.
We deal with formats like:
%u %5u %05u (and ld and lld too).
%x %5x %05x (and ld and lld too). */
int dwarfstring_append_printf_u(dwarfstring *data,
char *format,
dwarfstring_u v)
{
size_t next = 0;
long val = 0;
char *endptr = 0;
const char *numptr = 0;
size_t fixedlen = 0;
int leadingzero = 0;
int lcount = 0;
int ucount = 0;
int dcount = 0;
int xcount = 0;
int Xcount = 0;
char *ctable = 0;
size_t divisor = 0;
size_t prefixlen = 0;
if (!format) {
format="<ERROR: null format pointer to "
"dwarfstring_append_printf_u>";
}
while (format[next] && format[next] != '%') {
++next;
++prefixlen;
}
dwarfstring_append_length(data,format,prefixlen);
if (format[next] != '%') {
/* No % operator found, we are done */
return TRUE;
}
next++;
if (format[next] == '-') {
dwarfstring_append(data,
"<ERROR: format - passed to "
"dwarfstring_append_printf_u "
"cannot be handled>");
/*ESBERR("ESBERR_printf_u - format not supported"); */
return FALSE;
}
if (format[next] == '0') {
leadingzero = 1;
next++;
}
numptr = format+next;
val = strtol(numptr,&endptr,10);
if ( endptr != numptr) {
fixedlen = val;
}
next = (endptr - format);
/* Following is lx lu or u or llx llu , we take
all this to mean 64 bits, */
#if defined(_WIN32) && defined(HAVE_NONSTANDARD_PRINTF_64_FORMAT)
if (format[next] == 'I') {
/*lcount++;*/
next++;
}
if (format[next] == '6') {
/*lcount++;*/
next++;
}
if (format[next] == '4') {
/*lcount++;*/
next++;
}
#endif /* HAVE_NONSTANDARD_PRINTF_64_FORMAT */
if (format[next] == 'l') {
lcount++;
next++;
}
if (format[next] == 'l') {
lcount++;
next++;
}
if (format[next] == 'l') {
lcount++;
next++;
}
if (format[next] == 'u') {
ucount++;
next++;
}
if (format[next] == 'd') {
dcount++;
next++;
}
if (format[next] == 'x') {
xcount++;
next++;
}
if (format[next] == 'X') {
Xcount++;
next++;
}
if (format[next] == 's') {
dwarfstring_append(data,
"<ERROR: format %s passed to "
"dwarfstring_append_printf_u "
"cannot be handled>");
/* ESBERR("ESBERR_pct_scount_in_u"); */
return FALSE;
}
if ( (Xcount +xcount+dcount+ucount) > 1) {
dwarfstring_append(data,
"<ERROR: format %x X d u repeats to "
"dwarfstring_append_printf_u "
"cannot be handled>");
/* ESBERR("ESBERR_pct_xcount_etc_u"); */
return FALSE;
}
if ( (Xcount +xcount+dcount+ucount) == 0) {
dwarfstring_append(data,
"<ERROR: format %x X d u missing to "
"dwarfstring_append_printf_u "
"cannot be handled>");
/* ESBERR("ESBERR_pct_xcount_etc_u"); */
return FALSE;
}
if (lcount > 2) {
dwarfstring_append(data,
"<ERROR: format % lll to "
"dwarfstring_append_printf_u "
"cannot be handled>");
/* ESBERR("ESBERR_pct_lcount_error_u"); */
/* error */
return FALSE;
}
if (dcount > 0) {
dwarfstring_append(data,
"<ERROR: format %d to "
"dwarfstring_append_printf_u "
"cannot be handled>");
/*ESBERR("ESBERR_pct_dcount_error_u");*/
/* error */
return FALSE;
}
if (ucount) {
divisor = 10;
ctable = dtable;
} else {
divisor = 16;
if (xcount) {
ctable = xtable;
} else {
ctable = Xtable;
}
}
{
char digbuf[36];
char *digptr = 0;
unsigned digcharlen = 0;
dwarfstring_u remaining = v;
if (divisor == 16) {
digptr = digbuf+sizeof(digbuf) -1;
for ( ;; ) {
dwarfstring_u dig;
dig = remaining & 0xf;
remaining = remaining >> 4;
*digptr = ctable[dig];
++digcharlen;
if (!remaining) {
break;
}
--digptr;
}
} else {
digptr = digbuf+sizeof(digbuf) -1;
*digptr = 0;
--digptr;
for ( ;; ) {
dwarfstring_u dig;
dig = remaining % divisor;
remaining /= divisor;
*digptr = ctable[dig];
++digcharlen;
if (!remaining) {
break;
}
--digptr;
}
}
if (fixedlen <= digcharlen) {
dwarfstring_append_length(data,digptr,digcharlen);
} else {
if (!leadingzero) {
size_t justcount = fixedlen - digcharlen;
_dwarfstring_append_spaces(data,justcount);
dwarfstring_append_length(data,digptr,digcharlen);
} else {
size_t prefixcount = fixedlen - digcharlen;
_dwarfstring_append_zeros(data,prefixcount);
dwarfstring_append_length(data,digptr,digcharlen);
}
}
}
if (format[next]) {
size_t trailinglen = strlen(format+next);
dwarfstring_append_length(data,format+next,trailinglen);
}
return FALSE;
}
|