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 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932
|
/*********************************************************
* Copyright (C) 1998 VMware, Inc. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation version 2.1 and no later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the Lesser GNU General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
*********************************************************/
/*
* strutil.c --
*
* String utility functions.
*/
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#if !defined(_WIN32) && !defined(N_PLAT_NLM)
#include <strings.h> /* For strncasecmp */
#endif
#include "vmware.h"
#include "strutil.h"
#include "str.h"
/*
*-----------------------------------------------------------------------------
*
* StrUtil_GetNextToken --
*
* Get the next token from a string after a given index w/o modifying the
* original string.
*
* Results:
* An allocated, NUL-terminated string containing the token. 'index' is
* updated to point after the returned token
* NULL if no tokens are left
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
char *
StrUtil_GetNextToken(unsigned int *index, // IN/OUT: Index to start at
const char *str, // IN : String to parse
const char *delimiters) // IN : Chars separating tokens
{
unsigned int startIndex;
unsigned int length;
char *token;
ASSERT(index);
ASSERT(str);
ASSERT(delimiters);
ASSERT(*index <= strlen(str));
#define NOT_DELIMITER (Str_Strchr(delimiters, str[*index]) == NULL)
/* Skip leading delimiters. */
for (; ; (*index)++) {
if (str[*index] == '\0') {
return NULL;
}
if (NOT_DELIMITER) {
break;
}
}
startIndex = *index;
/*
* Walk the string until we reach the end of it, or we find a
* delimiter.
*/
for ((*index)++; str[*index] != '\0' && NOT_DELIMITER; (*index)++) {
}
#undef NOT_DELIMITER
length = *index - startIndex;
ASSERT(length);
token = (char *)malloc(length + 1 /* NUL */);
ASSERT_MEM_ALLOC(token);
memcpy(token, str + startIndex, length);
token[length] = '\0';
return token;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_GetNextIntToken --
*
* Acts like StrUtil_GetNextToken except it returns an int32.
*
* Results:
* TRUE if a valid int was parsed and 'out' contains the parsed int.
* FALSE otherwise. Contents of 'out' are undefined.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_GetNextIntToken(int32 *out, // OUT : parsed int
unsigned int *index, // IN/OUT: Index to start at
const char *str, // IN : String to parse
const char *delimiters) // IN : Chars separating tokens
{
char *resultStr;
Bool valid = FALSE;
ASSERT(out);
ASSERT(index);
ASSERT(str);
ASSERT(delimiters);
resultStr = StrUtil_GetNextToken(index, str, delimiters);
if (resultStr == NULL) {
return FALSE;
}
valid = StrUtil_StrToInt(out, resultStr);
free(resultStr);
return valid;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_GetNextUintToken --
*
* Acts like StrUtil_GetNextIntToken except it returns an uint32.
*
* Results:
* TRUE if a valid int was parsed and 'out' contains the parsed int.
* FALSE otherwise. Contents of 'out' are undefined.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_GetNextUintToken(uint32 *out, // OUT : parsed int
unsigned int *index, // IN/OUT: Index to start at
const char *str, // IN : String to parse
const char *delimiters) // IN : Chars separating tokens
{
char *resultStr;
Bool valid = FALSE;
ASSERT(out);
ASSERT(index);
ASSERT(str);
ASSERT(delimiters);
resultStr = StrUtil_GetNextToken(index, str, delimiters);
if (resultStr == NULL) {
return FALSE;
}
valid = StrUtil_StrToUint(out, resultStr);
free(resultStr);
return valid;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_GetNextInt64Token --
*
* Acts like StrUtil_GetNextToken except it returns an int64.
*
* Results:
* TRUE on a successful retrieval. FALSE otherwise.
* Token is stored in 'out', which is left undefined in the FALSE case.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_GetNextInt64Token(int64 *out, // OUT: The output value
unsigned int *index, // IN/OUT: Index to start at
const char *str, // IN : String to parse
const char *delimiters) // IN : Chars separating tokens
{
char *resultStr;
Bool result;
ASSERT(out);
ASSERT(index);
ASSERT(str);
ASSERT(delimiters);
resultStr = StrUtil_GetNextToken(index, str, delimiters);
result = resultStr ? StrUtil_StrToInt64(out, resultStr) : FALSE;
free(resultStr);
return result;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_DecimalStrToUint --
*
* Convert a string into an integer.
*
* Results:
* TRUE if the conversion was successful, and 'out' contains the converted
* result, and 'str' is updated to point to new place after last processed
* digit.
* FALSE otherwise.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_DecimalStrToUint(unsigned int *out, // OUT
const char **str) // IN/OUT : String to parse
{
unsigned long val;
char *ptr;
ASSERT(out);
ASSERT(str);
errno = 0;
val = strtoul(*str, &ptr, 10);
if (ptr == *str || errno == ERANGE || val != (unsigned int)val) {
return FALSE;
}
*str = ptr;
*out = (unsigned int)val;
return TRUE;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_StrToInt --
*
* Convert a string into an integer.
*
* Results:
* TRUE if the conversion was successful and 'out' contains the converted
* result.
* FALSE otherwise. 'out' is undefined.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_StrToInt(int32 *out, // OUT
const char *str) // IN : String to parse
{
char *ptr;
long val;
ASSERT(out);
ASSERT(str);
errno = 0;
val = strtol(str, &ptr, 0);
*out = (int32)val;
/*
* Input must be complete, no overflow, and value read must fit into 32 bits -
* both signed and unsigned values are accepted.
*/
return *ptr == '\0' && errno != ERANGE && (val == (int32)val || val == (uint32)val);
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_StrToUint --
*
* Convert a string into unsigned integer.
*
* Results:
* TRUE if the conversion succeeded and 'out' contains the result.
* FALSE otherwise. 'out' is undefined.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_StrToUint(uint32 *out, // OUT
const char *str) // IN : String to parse
{
char *ptr;
unsigned long val;
ASSERT(out);
ASSERT(str);
errno = 0;
val = strtoul(str, &ptr, 0);
*out = (uint32)val;
/*
* Input must be complete, no overflow, and value read must fit into 32 bits -
* both signed and unsigned values are accepted.
*/
return *ptr == '\0' && errno != ERANGE && (val == (uint32)val || val == (int32)val);
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_StrToInt64 --
*
* Convert a string into a 64bit integer.
*
* Results:
* TRUE if conversion was successful, FALSE otherwise.
* Value is stored in 'out', which is left undefined in the FALSE case.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_StrToInt64(int64 *out, // OUT: The output value
const char *str) // IN : String to parse
{
char *ptr;
ASSERT(out);
ASSERT(str);
errno = 0;
#if defined(_WIN32)
*out = _strtoi64(str, &ptr, 0);
#elif defined(__FreeBSD__)
*out = strtoq(str, &ptr, 0);
#elif defined(N_PLAT_NLM)
/* Works for small values of str... */
*out = (int64)strtol(str, &ptr, 0);
#else
*out = strtoll(str, &ptr, 0);
#endif
return ptr[0] == '\0' && errno != ERANGE;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_StrToSizet --
*
* Convert a string into an unsigned integer that is either 32-bits or
* 64-bits long, depending on the underlying architecture.
*
* Results:
* TRUE if conversion was successful, FALSE otherwise.
* Value is stored in 'out', which is left undefined in the FALSE case.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_StrToSizet(size_t *out, // OUT: The output value
const char *str) // IN : String to parse
{
char *ptr;
ASSERT(out);
ASSERT(str);
errno = 0;
#if defined VM_X86_64
ASSERT_ON_COMPILE(sizeof *out == sizeof(uint64));
# if defined(_WIN32)
*out = _strtoui64(str, &ptr, 0);
# elif defined(__FreeBSD__)
*out = strtouq(str, &ptr, 0);
# elif defined(N_PLAT_NLM)
/* Works for small values of str... */
*out = strtoul(str, &ptr, 0);
# else
*out = strtoull(str, &ptr, 0);
# endif
#else
ASSERT_ON_COMPILE(sizeof *out == sizeof(uint32));
*out = strtoul(str, &ptr, 0);
#endif
return *ptr == '\0' && errno != ERANGE;
}
#ifndef N_PLAT_NLM // NetWare Tools ask for unresolved _GLOBAL_OFFSET_TABLE...
/*
*-----------------------------------------------------------------------------
*
* StrUtil_CapacityToSectorType --
*
* Converts a string containing a measure of disk capacity (such as
* "100MB" or "1.5k") into an unadorned and primitive quantity of sector
* capacity. The comment before the switch statement describes the kinds
* of disk capacity expressible.
*
* Results:
* TRUE if conversion was successful, FALSE otherwise.
* Value is stored in 'out', which is left undefined in the FALSE case.
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_CapacityToSectorType(SectorType *out, // OUT: The output value
const char *str, // IN: String to parse
unsigned int bytes) // IN: Bytes per unit in an
// unadorned string
{
double quantity;
char *rest;
ASSERT(out);
ASSERT(str);
errno = 0;
quantity = strtod(str, &rest);
if (errno == ERANGE) {
return FALSE;
}
/* Skip over any whitespace in the suffix. */
while (*rest == ' ' || *rest == '\t') {
rest++;
}
if (*rest != '\0') {
uint64 shift;
Bool suffixOK = TRUE;
/*
* [kK], [mM], [gG], and [tT] represent kilo, mega, giga, and tera
* byte quantities respectively. [bB] represents a singular byte
* quantity. [sS] represents a sector quantity.
*
* For kilo, mega, giga, and tera we're OK with an additional byte
* suffix. Otherwise, the presence of an additional suffix is an error.
*/
switch (*rest) {
case 'b': case 'B': shift = 0; suffixOK = FALSE; break;
case 's': case 'S': shift = 9; suffixOK = FALSE; break;
case 'k': case 'K': shift = 10; break;
case 'm': case 'M': shift = 20; break;
case 'g': case 'G': shift = 30; break;
case 't': case 'T': shift = 40; break;
default : return FALSE;
}
switch(*++rest) {
case '\0':
break;
case 'b': case 'B':
if (suffixOK && !*++rest) {
break;
}
/* FALLTHRU */
default:
return FALSE;
}
quantity *= CONST64U(1) << shift;
} else {
/*
* No suffix, so multiply by the number of bytes per unit as specified
* by the caller.
*/
quantity *= bytes;
}
/*
* Convert from "number of bytes" to "number of sectors", rounding up or
* down appropriately.
*
* XXX: We should use DISKLIB_SECTOR_SIZE, but do we really want the
* disklib header dependencies in this file?
*
*/
*out = (SectorType)((quantity + 256) / 512);
return TRUE;
}
#endif
/*
*-----------------------------------------------------------------------------
*
* StrUtil_FormatSizeInBytes --
*
* Format a size (in bytes) to a string in a user-friendly way.
*
* Example: 160041885696 -> "149.1 GB"
*
* Results:
* The allocated, NUL-terminated string (not localized).
*
* Side effects:
* None
*
*-----------------------------------------------------------------------------
*/
char *
StrUtil_FormatSizeInBytesUnlocalized(uint64 size) // IN
{
/*
* XXX TODO, BUG 199661:
* This is a direct copy of Msg_FormatSizeInBytes without localization.
* These two functions should ideally share the basic functionality, and just
* differ in the string localization
*/
char const *fmt;
double sizeInSelectedUnit;
unsigned int precision;
char *sizeFormat;
char *sizeString;
char *result;
static const double epsilon = 0.01;
double delta;
if (size >= CONST64U(1) << 40 /* 1 TB */) {
fmt = "%s TB";
sizeInSelectedUnit = (double)size / (CONST64U(1) << 40);
precision = 1;
} else if (size >= CONST64U(1) << 30 /* 1 GB */) {
fmt = "%s GB";
sizeInSelectedUnit = (double)size / (CONST64U(1) << 30);
precision = 1;
} else if (size >= CONST64U(1) << 20 /* 1 MB */) {
fmt = "%s MB";
sizeInSelectedUnit = (double)size / (CONST64U(1) << 20);
precision = 1;
} else if (size >= CONST64U(1) << 10 /* 1 KB */) {
fmt = "%s KB";
sizeInSelectedUnit = (double)size / (CONST64U(1) << 10);
precision = 1;
} else if (size >= CONST64U(2) /* 2 bytes */) {
fmt = "%s bytes";
sizeInSelectedUnit = (double)size;
precision = 0; // No fractional byte.
} else if (size >= CONST64U(1) /* 1 byte */) {
fmt = "%s byte";
sizeInSelectedUnit = (double)size;
precision = 0; // No fractional byte.
} else {
ASSERT(size == CONST64U(0) /* 0 bytes */);
fmt = "%s bytes";
sizeInSelectedUnit = (double)size;
precision = 0; // No fractional byte.
}
/*
* We cast to uint32 instead of uint64 here because of a problem with the
* NetWare Tools build. However, it's safe to cast to uint32 since we have
* already reduced the range of sizeInSelectedUnit above.
*/
// If it would display with .0, round it off and display the integer value.
delta = (uint32)(sizeInSelectedUnit + 0.5) - sizeInSelectedUnit;
if (delta < 0) {
delta = -delta;
}
if (delta <= epsilon) {
precision = 0;
sizeInSelectedUnit = (double)(uint32)(sizeInSelectedUnit + 0.5);
}
sizeFormat = Str_Asprintf(NULL, "%%.%uf", precision);
sizeString = Str_Asprintf(NULL, sizeFormat, sizeInSelectedUnit);
result = Str_Asprintf(NULL, fmt, sizeString);
free(sizeFormat);
free(sizeString);
return result;
}
/*
*----------------------------------------------------------------------
*
* StrUtil_GetLongestLineLength --
*
* Given a buffer with one or more lines
* this function computes the length of the
* longest line in a buffer. Input buffer is an array of
* arbitrary bytes (including NUL character), line separator
* is '\n', and is counted in line length. Like:
* "", 0 => 0
* "\n", 1 => 1
* "X", 1 => 1
* "XX\n", 3 => 3
* "X\nY", 3 => 2
* "\n\n", 2 => 1
*
* Results:
* Returns the length of the longest line in the 'buf'.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
size_t
StrUtil_GetLongestLineLength(const char *buf, //IN
size_t bufLength) //IN
{
size_t longest = 0;
while (bufLength) {
const char* next;
size_t len;
next = memchr(buf, '\n', bufLength);
if (next) {
next++;
len = next - buf;
} else {
len = bufLength;
}
if (len > longest) {
longest = len;
}
bufLength -= len;
buf = next;
}
return longest;
}
/*
*----------------------------------------------------------------------
*
* StrUtil_StartsWith --
*
* Determines if a string starts with another string.
*
* Results:
* TRUE if 's' starts with 'prefix', FALSE otherwise.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
Bool
StrUtil_StartsWith(const char *s, // IN
const char *prefix) // IN
{
ASSERT(s != NULL);
ASSERT(prefix != NULL);
return Str_Strncmp(s, prefix, strlen(prefix)) == 0;
}
/*
*----------------------------------------------------------------------
*
* StrUtil_CaselessStartsWith --
*
* A case-insensitive version of StrUtil_StartsWith.
*
* Results:
* TRUE if 's' starts with 'prefix', FALSE otherwise.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------
*/
Bool
StrUtil_CaselessStartsWith(const char *s, // IN
const char *prefix) // IN
{
ASSERT(s != NULL);
ASSERT(prefix != NULL);
return Str_Strncasecmp(s, prefix, strlen(prefix)) == 0;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_EndsWith --
*
* Detects if a string ends with another string.
*
* Results:
* TRUE if string 'suffix' is found at the end of string 's', FALSE otherwise.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_EndsWith(const char *s, // IN
const char *suffix) // IN
{
size_t slen;
size_t suffixlen;
ASSERT(s);
ASSERT(suffix);
slen = strlen(s);
suffixlen = strlen(suffix);
if (suffixlen > slen) {
return FALSE;
}
return strcmp(s + slen - suffixlen, suffix) == 0;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_VDynBufPrintf --
*
* This is a vprintf() variant which appends directly into a
* dynbuf. The dynbuf is not NUL-terminated: The printf() result
* is written immediately after the last byte in the DynBuf.
*
* This function does not use any temporary buffer. The printf()
* result can be arbitrarily large. This function automatically
* grows the DynBuf as necessary.
*
* Results:
* TRUE on success, FALSE on memory allocation failure.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_VDynBufPrintf(DynBuf *b, // IN/OUT
const char *fmt, // IN
va_list args) // IN
{
/*
* Arbitrary lower-limit on buffer size allocation, to avoid doing
* many tiny enlarge operations.
*/
const size_t minAllocSize = 128;
while (1) {
int i;
size_t size = DynBuf_GetSize(b);
size_t allocSize = DynBuf_GetAllocatedSize(b);
/* Make sure the buffer isn't still unallocated */
if (allocSize < minAllocSize) {
Bool success = DynBuf_Enlarge(b, minAllocSize);
if (!success) {
return FALSE;
}
continue;
}
/*
* Is there any allocated-but-not-occupied space? If so, try the printf.
* If there was no space to begin with, or Str_Vsnprintf() ran out of
* space, this will fail.
*/
if (allocSize - size > 0) {
va_list tmpArgs;
va_copy(tmpArgs, args);
i = Str_Vsnprintf((char *) DynBuf_Get(b) + size, allocSize - size,
fmt, tmpArgs);
va_end(tmpArgs);
} else {
i = -1;
}
if (i >= 0) {
/*
* Success. Enlarge the buffer.
*
* The ASSERT here is to verify that printf() isn't lying
* about the length of the string it wrote. This actually
* happens, believe it or not. See bug 253674.
*/
ASSERT(i + size == allocSize || ((char*)DynBuf_Get(b))[i + size] == '\0');
DynBuf_SetSize(b, size + i);
break;
} else {
/*
* Failure. We must grow the buffer first. Note that this is
* just a minimum size- dynbuf will probably decide to double
* the actual reallocated buffer size.
*/
Bool success = DynBuf_Enlarge(b, size + minAllocSize);
if (!success) {
return FALSE;
}
}
}
return TRUE;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_DynBufPrintf --
*
* A StrUtil_VDynBufPrintf() wrapper which takes a variadic argument list.
*
* Results:
* TRUE on success, FALSE on memory allocation failure.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
Bool
StrUtil_DynBufPrintf(DynBuf *b, // IN/OUT
const char *fmt, // IN
...) // IN
{
va_list args;
Bool success;
va_start(args, fmt);
success = StrUtil_VDynBufPrintf(b, fmt, args);
va_end(args);
return success;
}
/*
*-----------------------------------------------------------------------------
*
* StrUtil_SafeDynBufPrintf --
*
* A 'safe' variant of StrUtil_SafeDynBufPrintf(), which catches
* memory allocation failures and panics.
*
* Results:
* None.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
void
StrUtil_SafeDynBufPrintf(DynBuf *b, // IN/OUT
const char *fmt, // IN
...) // IN
{
va_list args;
Bool success;
va_start(args, fmt);
success = StrUtil_VDynBufPrintf(b, fmt, args);
va_end(args);
ASSERT_MEM_ALLOC(success);
}
|