utprint.c revision 1.15
1 /****************************************************************************** 2 * 3 * Module Name: utprint - Formatted printing routines 4 * 5 *****************************************************************************/ 6 7 /****************************************************************************** 8 * 9 * 1. Copyright Notice 10 * 11 * Some or all of this work - Copyright (c) 1999 - 2023, Intel Corp. 12 * All rights reserved. 13 * 14 * 2. License 15 * 16 * 2.1. This is your license from Intel Corp. under its intellectual property 17 * rights. You may have additional license terms from the party that provided 18 * you this software, covering your right to use that party's intellectual 19 * property rights. 20 * 21 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 22 * copy of the source code appearing in this file ("Covered Code") an 23 * irrevocable, perpetual, worldwide license under Intel's copyrights in the 24 * base code distributed originally by Intel ("Original Intel Code") to copy, 25 * make derivatives, distribute, use and display any portion of the Covered 26 * Code in any form, with the right to sublicense such rights; and 27 * 28 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 29 * license (with the right to sublicense), under only those claims of Intel 30 * patents that are infringed by the Original Intel Code, to make, use, sell, 31 * offer to sell, and import the Covered Code and derivative works thereof 32 * solely to the minimum extent necessary to exercise the above copyright 33 * license, and in no event shall the patent license extend to any additions 34 * to or modifications of the Original Intel Code. No other license or right 35 * is granted directly or by implication, estoppel or otherwise; 36 * 37 * The above copyright and patent license is granted only if the following 38 * conditions are met: 39 * 40 * 3. Conditions 41 * 42 * 3.1. Redistribution of Source with Rights to Further Distribute Source. 43 * Redistribution of source code of any substantial portion of the Covered 44 * Code or modification with rights to further distribute source must include 45 * the above Copyright Notice, the above License, this list of Conditions, 46 * and the following Disclaimer and Export Compliance provision. In addition, 47 * Licensee must cause all Covered Code to which Licensee contributes to 48 * contain a file documenting the changes Licensee made to create that Covered 49 * Code and the date of any change. Licensee must include in that file the 50 * documentation of any changes made by any predecessor Licensee. Licensee 51 * must include a prominent statement that the modification is derived, 52 * directly or indirectly, from Original Intel Code. 53 * 54 * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 55 * Redistribution of source code of any substantial portion of the Covered 56 * Code or modification without rights to further distribute source must 57 * include the following Disclaimer and Export Compliance provision in the 58 * documentation and/or other materials provided with distribution. In 59 * addition, Licensee may not authorize further sublicense of source of any 60 * portion of the Covered Code, and must include terms to the effect that the 61 * license from Licensee to its licensee is limited to the intellectual 62 * property embodied in the software Licensee provides to its licensee, and 63 * not to intellectual property embodied in modifications its licensee may 64 * make. 65 * 66 * 3.3. Redistribution of Executable. Redistribution in executable form of any 67 * substantial portion of the Covered Code or modification must reproduce the 68 * above Copyright Notice, and the following Disclaimer and Export Compliance 69 * provision in the documentation and/or other materials provided with the 70 * distribution. 71 * 72 * 3.4. Intel retains all right, title, and interest in and to the Original 73 * Intel Code. 74 * 75 * 3.5. Neither the name Intel nor any other trademark owned or controlled by 76 * Intel shall be used in advertising or otherwise to promote the sale, use or 77 * other dealings in products derived from or relating to the Covered Code 78 * without prior written authorization from Intel. 79 * 80 * 4. Disclaimer and Export Compliance 81 * 82 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 83 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 84 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 85 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 86 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 87 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 88 * PARTICULAR PURPOSE. 89 * 90 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 91 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 92 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 93 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 94 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 95 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 96 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 97 * LIMITED REMEDY. 98 * 99 * 4.3. Licensee shall not export, either directly or indirectly, any of this 100 * software or system incorporating such software without first obtaining any 101 * required license or other approval from the U. S. Department of Commerce or 102 * any other agency or department of the United States Government. In the 103 * event Licensee exports any such software from the United States or 104 * re-exports any such software from a foreign destination, Licensee shall 105 * ensure that the distribution and export/re-export of the software is in 106 * compliance with all laws, regulations, orders, or other restrictions of the 107 * U.S. Export Administration Regulations. Licensee agrees that neither it nor 108 * any of its subsidiaries will export/re-export any technical data, process, 109 * software, or service, directly or indirectly, to any country for which the 110 * United States government or any agency thereof requires an export license, 111 * other governmental approval, or letter of assurance, without first obtaining 112 * such license, approval or letter. 113 * 114 ***************************************************************************** 115 * 116 * Alternatively, you may choose to be licensed under the terms of the 117 * following license: 118 * 119 * Redistribution and use in source and binary forms, with or without 120 * modification, are permitted provided that the following conditions 121 * are met: 122 * 1. Redistributions of source code must retain the above copyright 123 * notice, this list of conditions, and the following disclaimer, 124 * without modification. 125 * 2. Redistributions in binary form must reproduce at minimum a disclaimer 126 * substantially similar to the "NO WARRANTY" disclaimer below 127 * ("Disclaimer") and any redistribution must be conditioned upon 128 * including a substantially similar Disclaimer requirement for further 129 * binary redistribution. 130 * 3. Neither the names of the above-listed copyright holders nor the names 131 * of any contributors may be used to endorse or promote products derived 132 * from this software without specific prior written permission. 133 * 134 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 135 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 136 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 137 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 138 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 139 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 140 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 141 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 142 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 143 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 144 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 145 * 146 * Alternatively, you may choose to be licensed under the terms of the 147 * GNU General Public License ("GPL") version 2 as published by the Free 148 * Software Foundation. 149 * 150 *****************************************************************************/ 151 152 #include "acpi.h" 153 #include "accommon.h" 154 155 #define _COMPONENT ACPI_UTILITIES 156 ACPI_MODULE_NAME ("utprint") 157 158 159 #define ACPI_FORMAT_SIGN 0x01 160 #define ACPI_FORMAT_SIGN_PLUS 0x02 161 #define ACPI_FORMAT_SIGN_PLUS_SPACE 0x04 162 #define ACPI_FORMAT_ZERO 0x08 163 #define ACPI_FORMAT_LEFT 0x10 164 #define ACPI_FORMAT_UPPER 0x20 165 #define ACPI_FORMAT_PREFIX 0x40 166 167 168 /* Local prototypes */ 169 170 static ACPI_SIZE 171 AcpiUtBoundStringLength ( 172 const char *String, 173 ACPI_SIZE Count); 174 175 static char * 176 AcpiUtBoundStringOutput ( 177 char *String, 178 const char *End, 179 char c); 180 181 static char * 182 AcpiUtFormatNumber ( 183 char *String, 184 char *End, 185 UINT64 Number, 186 UINT8 Base, 187 INT32 Width, 188 INT32 Precision, 189 UINT8 Type); 190 191 static char * 192 AcpiUtPutNumber ( 193 char *String, 194 UINT64 Number, 195 UINT8 Base, 196 BOOLEAN Upper); 197 198 199 /******************************************************************************* 200 * 201 * FUNCTION: AcpiUtBoundStringLength 202 * 203 * PARAMETERS: String - String with boundary 204 * Count - Boundary of the string 205 * 206 * RETURN: Length of the string. Less than or equal to Count. 207 * 208 * DESCRIPTION: Calculate the length of a string with boundary. 209 * 210 ******************************************************************************/ 211 212 static ACPI_SIZE 213 AcpiUtBoundStringLength ( 214 const char *String, 215 ACPI_SIZE Count) 216 { 217 UINT32 Length = 0; 218 219 220 while (*String && Count) 221 { 222 Length++; 223 String++; 224 Count--; 225 } 226 227 return (Length); 228 } 229 230 231 /******************************************************************************* 232 * 233 * FUNCTION: AcpiUtBoundStringOutput 234 * 235 * PARAMETERS: String - String with boundary 236 * End - Boundary of the string 237 * c - Character to be output to the string 238 * 239 * RETURN: Updated position for next valid character 240 * 241 * DESCRIPTION: Output a character into a string with boundary check. 242 * 243 ******************************************************************************/ 244 245 static char * 246 AcpiUtBoundStringOutput ( 247 char *String, 248 const char *End, 249 char c) 250 { 251 252 if (String < End) 253 { 254 *String = c; 255 } 256 257 ++String; 258 return (String); 259 } 260 261 262 /******************************************************************************* 263 * 264 * FUNCTION: AcpiUtPutNumber 265 * 266 * PARAMETERS: String - Buffer to hold reverse-ordered string 267 * Number - Integer to be converted 268 * Base - Base of the integer 269 * Upper - Whether or not using upper cased digits 270 * 271 * RETURN: Updated position for next valid character 272 * 273 * DESCRIPTION: Convert an integer into a string, note that, the string holds a 274 * reversed ordered number without the trailing zero. 275 * 276 ******************************************************************************/ 277 278 static char * 279 AcpiUtPutNumber ( 280 char *String, 281 UINT64 Number, 282 UINT8 Base, 283 BOOLEAN Upper) 284 { 285 const char *Digits; 286 UINT64 DigitIndex; 287 char *Pos; 288 289 290 Pos = String; 291 Digits = Upper ? AcpiGbl_UpperHexDigits : AcpiGbl_LowerHexDigits; 292 293 if (Number == 0) 294 { 295 *(Pos++) = '0'; 296 } 297 else 298 { 299 while (Number) 300 { 301 (void) AcpiUtDivide (Number, Base, &Number, &DigitIndex); 302 *(Pos++) = Digits[DigitIndex]; 303 } 304 } 305 306 /* *(Pos++) = '0'; */ 307 return (Pos); 308 } 309 310 311 /******************************************************************************* 312 * 313 * FUNCTION: AcpiUtScanNumber 314 * 315 * PARAMETERS: String - String buffer 316 * NumberPtr - Where the number is returned 317 * 318 * RETURN: Updated position for next valid character 319 * 320 * DESCRIPTION: Scan a string for a decimal integer. 321 * 322 ******************************************************************************/ 323 324 const char * 325 AcpiUtScanNumber ( 326 const char *String, 327 UINT64 *NumberPtr) 328 { 329 UINT64 Number = 0; 330 331 332 while (isdigit ((int) *String)) 333 { 334 AcpiUtShortMultiply (Number, 10, &Number); 335 Number += *(String++) - '0'; 336 } 337 338 *NumberPtr = Number; 339 return (String); 340 } 341 342 343 /******************************************************************************* 344 * 345 * FUNCTION: AcpiUtPrintNumber 346 * 347 * PARAMETERS: String - String buffer 348 * Number - The number to be converted 349 * 350 * RETURN: Updated position for next valid character 351 * 352 * DESCRIPTION: Print a decimal integer into a string. 353 * 354 ******************************************************************************/ 355 356 const char * 357 AcpiUtPrintNumber ( 358 char *String, 359 UINT64 Number) 360 { 361 char AsciiString[20]; 362 const char *Pos1; 363 char *Pos2; 364 365 366 Pos1 = AcpiUtPutNumber (AsciiString, Number, 10, FALSE); 367 Pos2 = String; 368 369 while (Pos1 != AsciiString) 370 { 371 *(Pos2++) = *(--Pos1); 372 } 373 374 *Pos2 = 0; 375 return (String); 376 } 377 378 379 /******************************************************************************* 380 * 381 * FUNCTION: AcpiUtFormatNumber 382 * 383 * PARAMETERS: String - String buffer with boundary 384 * End - Boundary of the string 385 * Number - The number to be converted 386 * Base - Base of the integer 387 * Width - Field width 388 * Precision - Precision of the integer 389 * Type - Special printing flags 390 * 391 * RETURN: Updated position for next valid character 392 * 393 * DESCRIPTION: Print an integer into a string with any base and any precision. 394 * 395 ******************************************************************************/ 396 397 static char * 398 AcpiUtFormatNumber ( 399 char *String, 400 char *End, 401 UINT64 Number, 402 UINT8 Base, 403 INT32 Width, 404 INT32 Precision, 405 UINT8 Type) 406 { 407 char *Pos; 408 char Sign; 409 char Zero; 410 BOOLEAN NeedPrefix; 411 BOOLEAN Upper; 412 INT32 i; 413 char ReversedString[66]; 414 415 416 /* Parameter validation */ 417 418 if (Base < 2 || Base > 16) 419 { 420 return (NULL); 421 } 422 423 if (Type & ACPI_FORMAT_LEFT) 424 { 425 Type &= ~ACPI_FORMAT_ZERO; 426 } 427 428 NeedPrefix = ((Type & ACPI_FORMAT_PREFIX) && Base != 10) ? TRUE : FALSE; 429 Upper = (Type & ACPI_FORMAT_UPPER) ? TRUE : FALSE; 430 Zero = (Type & ACPI_FORMAT_ZERO) ? '0' : ' '; 431 432 /* Calculate size according to sign and prefix */ 433 434 Sign = '\0'; 435 if (Type & ACPI_FORMAT_SIGN) 436 { 437 if ((INT64) Number < 0) 438 { 439 Sign = '-'; 440 Number = - (INT64) Number; 441 Width--; 442 } 443 else if (Type & ACPI_FORMAT_SIGN_PLUS) 444 { 445 Sign = '+'; 446 Width--; 447 } 448 else if (Type & ACPI_FORMAT_SIGN_PLUS_SPACE) 449 { 450 Sign = ' '; 451 Width--; 452 } 453 } 454 if (NeedPrefix) 455 { 456 Width--; 457 if (Base == 16) 458 { 459 Width--; 460 } 461 } 462 463 /* Generate full string in reverse order */ 464 465 Pos = AcpiUtPutNumber (ReversedString, Number, Base, Upper); 466 i = (INT32) ACPI_PTR_DIFF (Pos, ReversedString); 467 468 /* Printing 100 using %2d gives "100", not "00" */ 469 470 if (i > Precision) 471 { 472 Precision = i; 473 } 474 475 Width -= Precision; 476 477 /* Output the string */ 478 479 if (!(Type & (ACPI_FORMAT_ZERO | ACPI_FORMAT_LEFT))) 480 { 481 while (--Width >= 0) 482 { 483 String = AcpiUtBoundStringOutput (String, End, ' '); 484 } 485 } 486 if (Sign) 487 { 488 String = AcpiUtBoundStringOutput (String, End, Sign); 489 } 490 if (NeedPrefix) 491 { 492 String = AcpiUtBoundStringOutput (String, End, '0'); 493 if (Base == 16) 494 { 495 String = AcpiUtBoundStringOutput ( 496 String, End, Upper ? 'X' : 'x'); 497 } 498 } 499 if (!(Type & ACPI_FORMAT_LEFT)) 500 { 501 while (--Width >= 0) 502 { 503 String = AcpiUtBoundStringOutput (String, End, Zero); 504 } 505 } 506 507 while (i <= --Precision) 508 { 509 String = AcpiUtBoundStringOutput (String, End, '0'); 510 } 511 while (--i >= 0) 512 { 513 String = AcpiUtBoundStringOutput (String, End, 514 ReversedString[i]); 515 } 516 while (--Width >= 0) 517 { 518 String = AcpiUtBoundStringOutput (String, End, ' '); 519 } 520 521 return (String); 522 } 523 524 #undef sprintf 525 #undef snprintf 526 #undef vsnprintf 527 /******************************************************************************* 528 * 529 * FUNCTION: vsnprintf 530 * 531 * PARAMETERS: String - String with boundary 532 * Size - Boundary of the string 533 * Format - Standard printf format 534 * Args - Argument list 535 * 536 * RETURN: Number of bytes actually written. 537 * 538 * DESCRIPTION: Formatted output to a string using argument list pointer. 539 * 540 ******************************************************************************/ 541 542 int 543 vsnprintf ( 544 char *String, 545 ACPI_SIZE Size, 546 const char *Format, 547 va_list Args) 548 { 549 UINT8 Base; 550 UINT8 Type; 551 INT32 Width; 552 INT32 Precision; 553 char Qualifier; 554 UINT64 Number; 555 char *Pos; 556 char *End; 557 char c; 558 const char *s; 559 const void *p; 560 INT32 Length; 561 int i; 562 563 564 Pos = String; 565 566 Size = ACPI_MIN(Size, ACPI_PTR_DIFF(ACPI_MAX_PTR, String)); 567 End = String + Size; 568 569 for (; *Format; ++Format) 570 { 571 if (*Format != '%') 572 { 573 Pos = AcpiUtBoundStringOutput (Pos, End, *Format); 574 continue; 575 } 576 577 Type = 0; 578 Base = 10; 579 580 /* Process sign */ 581 582 do 583 { 584 ++Format; 585 if (*Format == '#') 586 { 587 Type |= ACPI_FORMAT_PREFIX; 588 } 589 else if (*Format == '0') 590 { 591 Type |= ACPI_FORMAT_ZERO; 592 } 593 else if (*Format == '+') 594 { 595 Type |= ACPI_FORMAT_SIGN_PLUS; 596 } 597 else if (*Format == ' ') 598 { 599 Type |= ACPI_FORMAT_SIGN_PLUS_SPACE; 600 } 601 else if (*Format == '-') 602 { 603 Type |= ACPI_FORMAT_LEFT; 604 } 605 else 606 { 607 break; 608 } 609 610 } while (1); 611 612 /* Process width */ 613 614 Width = -1; 615 if (isdigit ((int) *Format)) 616 { 617 Format = AcpiUtScanNumber (Format, &Number); 618 Width = (INT32) Number; 619 } 620 else if (*Format == '*') 621 { 622 ++Format; 623 Width = va_arg (Args, int); 624 if (Width < 0) 625 { 626 Width = -Width; 627 Type |= ACPI_FORMAT_LEFT; 628 } 629 } 630 631 /* Process precision */ 632 633 Precision = -1; 634 if (*Format == '.') 635 { 636 ++Format; 637 if (isdigit ((int) *Format)) 638 { 639 Format = AcpiUtScanNumber (Format, &Number); 640 Precision = (INT32) Number; 641 } 642 else if (*Format == '*') 643 { 644 ++Format; 645 Precision = va_arg (Args, int); 646 } 647 648 if (Precision < 0) 649 { 650 Precision = 0; 651 } 652 } 653 654 /* Process qualifier */ 655 656 Qualifier = -1; 657 if (*Format == 'h' || *Format == 'l' || *Format == 'L') 658 { 659 Qualifier = *Format; 660 ++Format; 661 662 if (Qualifier == 'l' && *Format == 'l') 663 { 664 Qualifier = 'L'; 665 ++Format; 666 } 667 } 668 669 switch (*Format) 670 { 671 case '%': 672 673 Pos = AcpiUtBoundStringOutput (Pos, End, '%'); 674 continue; 675 676 case 'c': 677 678 if (!(Type & ACPI_FORMAT_LEFT)) 679 { 680 while (--Width > 0) 681 { 682 Pos = AcpiUtBoundStringOutput (Pos, End, ' '); 683 } 684 } 685 686 c = (char) va_arg (Args, int); 687 Pos = AcpiUtBoundStringOutput (Pos, End, c); 688 689 while (--Width > 0) 690 { 691 Pos = AcpiUtBoundStringOutput (Pos, End, ' '); 692 } 693 continue; 694 695 case 's': 696 697 s = va_arg (Args, char *); 698 if (!s) 699 { 700 s = "<NULL>"; 701 } 702 Length = (INT32) AcpiUtBoundStringLength (s, Precision); 703 if (!(Type & ACPI_FORMAT_LEFT)) 704 { 705 while (Length < Width--) 706 { 707 Pos = AcpiUtBoundStringOutput (Pos, End, ' '); 708 } 709 } 710 711 for (i = 0; i < Length; ++i) 712 { 713 Pos = AcpiUtBoundStringOutput (Pos, End, *s); 714 ++s; 715 } 716 717 while (Length < Width--) 718 { 719 Pos = AcpiUtBoundStringOutput (Pos, End, ' '); 720 } 721 continue; 722 723 case 'o': 724 725 Base = 8; 726 break; 727 728 case 'X': 729 730 Type |= ACPI_FORMAT_UPPER; 731 ACPI_FALLTHROUGH; 732 733 case 'x': 734 735 Base = 16; 736 break; 737 738 case 'd': 739 case 'i': 740 741 Type |= ACPI_FORMAT_SIGN; 742 743 case 'u': 744 745 break; 746 747 case 'p': 748 749 if (Width == -1) 750 { 751 Width = 2 * sizeof (void *); 752 Type |= ACPI_FORMAT_ZERO; 753 } 754 755 p = va_arg (Args, void *); 756 Pos = AcpiUtFormatNumber ( 757 Pos, End, ACPI_TO_INTEGER (p), 16, Width, Precision, Type); 758 continue; 759 760 default: 761 762 Pos = AcpiUtBoundStringOutput (Pos, End, '%'); 763 if (*Format) 764 { 765 Pos = AcpiUtBoundStringOutput (Pos, End, *Format); 766 } 767 else 768 { 769 --Format; 770 } 771 continue; 772 } 773 774 if (Qualifier == 'L') 775 { 776 Number = va_arg (Args, UINT64); 777 if (Type & ACPI_FORMAT_SIGN) 778 { 779 Number = (INT64) Number; 780 } 781 } 782 else if (Qualifier == 'l') 783 { 784 Number = va_arg (Args, unsigned long); 785 if (Type & ACPI_FORMAT_SIGN) 786 { 787 Number = (INT32) Number; 788 } 789 } 790 else if (Qualifier == 'h') 791 { 792 Number = (UINT16) va_arg (Args, int); 793 if (Type & ACPI_FORMAT_SIGN) 794 { 795 Number = (INT16) Number; 796 } 797 } 798 else 799 { 800 Number = va_arg (Args, unsigned int); 801 if (Type & ACPI_FORMAT_SIGN) 802 { 803 Number = (signed int) Number; 804 } 805 } 806 807 Pos = AcpiUtFormatNumber (Pos, End, Number, Base, 808 Width, Precision, Type); 809 } 810 811 if (Size > 0) 812 { 813 if (Pos < End) 814 { 815 *Pos = '\0'; 816 } 817 else 818 { 819 End[-1] = '\0'; 820 } 821 } 822 823 return ((int) ACPI_PTR_DIFF (Pos, String)); 824 } 825 826 827 /******************************************************************************* 828 * 829 * FUNCTION: snprintf 830 * 831 * PARAMETERS: String - String with boundary 832 * Size - Boundary of the string 833 * Format, ... - Standard printf format 834 * 835 * RETURN: Number of bytes actually written. 836 * 837 * DESCRIPTION: Formatted output to a string. 838 * 839 ******************************************************************************/ 840 841 int 842 snprintf ( 843 char *String, 844 ACPI_SIZE Size, 845 const char *Format, 846 ...) 847 { 848 va_list Args; 849 int Length; 850 851 852 va_start (Args, Format); 853 Length = vsnprintf (String, Size, Format, Args); 854 va_end (Args); 855 856 return (Length); 857 } 858 859 860 /******************************************************************************* 861 * 862 * FUNCTION: sprintf 863 * 864 * PARAMETERS: String - String with boundary 865 * Format, ... - Standard printf format 866 * 867 * RETURN: Number of bytes actually written. 868 * 869 * DESCRIPTION: Formatted output to a string. 870 * 871 ******************************************************************************/ 872 873 int 874 sprintf ( 875 char *String, 876 const char *Format, 877 ...) 878 { 879 va_list Args; 880 int Length; 881 882 883 va_start (Args, Format); 884 Length = vsnprintf (String, ACPI_UINT32_MAX, Format, Args); 885 va_end (Args); 886 887 return (Length); 888 } 889 890 891 #ifdef ACPI_APPLICATION 892 /******************************************************************************* 893 * 894 * FUNCTION: vprintf 895 * 896 * PARAMETERS: Format - Standard printf format 897 * Args - Argument list 898 * 899 * RETURN: Number of bytes actually written. 900 * 901 * DESCRIPTION: Formatted output to stdout using argument list pointer. 902 * 903 ******************************************************************************/ 904 905 int 906 vprintf ( 907 const char *Format, 908 va_list Args) 909 { 910 ACPI_CPU_FLAGS Flags; 911 int Length; 912 913 914 Flags = AcpiOsAcquireLock (AcpiGbl_PrintLock); 915 Length = vsnprintf (AcpiGbl_PrintBuffer, 916 sizeof (AcpiGbl_PrintBuffer), Format, Args); 917 918 (void) fwrite (AcpiGbl_PrintBuffer, Length, 1, ACPI_FILE_OUT); 919 AcpiOsReleaseLock (AcpiGbl_PrintLock, Flags); 920 921 return (Length); 922 } 923 924 925 /******************************************************************************* 926 * 927 * FUNCTION: printf 928 * 929 * PARAMETERS: Format, ... - Standard printf format 930 * 931 * RETURN: Number of bytes actually written. 932 * 933 * DESCRIPTION: Formatted output to stdout. 934 * 935 ******************************************************************************/ 936 937 int 938 printf ( 939 const char *Format, 940 ...) 941 { 942 va_list Args; 943 int Length; 944 945 946 va_start (Args, Format); 947 Length = vprintf (Format, Args); 948 va_end (Args); 949 950 return (Length); 951 } 952 953 954 /******************************************************************************* 955 * 956 * FUNCTION: vfprintf 957 * 958 * PARAMETERS: File - File descriptor 959 * Format - Standard printf format 960 * Args - Argument list 961 * 962 * RETURN: Number of bytes actually written. 963 * 964 * DESCRIPTION: Formatted output to a file using argument list pointer. 965 * 966 ******************************************************************************/ 967 968 int 969 vfprintf ( 970 FILE *File, 971 const char *Format, 972 va_list Args) 973 { 974 ACPI_CPU_FLAGS Flags; 975 int Length; 976 977 978 Flags = AcpiOsAcquireLock (AcpiGbl_PrintLock); 979 Length = vsnprintf (AcpiGbl_PrintBuffer, 980 sizeof (AcpiGbl_PrintBuffer), Format, Args); 981 982 (void) fwrite (AcpiGbl_PrintBuffer, Length, 1, File); 983 AcpiOsReleaseLock (AcpiGbl_PrintLock, Flags); 984 985 return (Length); 986 } 987 988 989 /******************************************************************************* 990 * 991 * FUNCTION: fprintf 992 * 993 * PARAMETERS: File - File descriptor 994 * Format, ... - Standard printf format 995 * 996 * RETURN: Number of bytes actually written. 997 * 998 * DESCRIPTION: Formatted output to a file. 999 * 1000 ******************************************************************************/ 1001 1002 int 1003 fprintf ( 1004 FILE *File, 1005 const char *Format, 1006 ...) 1007 { 1008 va_list Args; 1009 int Length; 1010 1011 1012 va_start (Args, Format); 1013 Length = vfprintf (File, Format, Args); 1014 va_end (Args); 1015 1016 return (Length); 1017 } 1018 #endif 1019
Indexes created Sat Sep 27 22:09:54 GMT 2025