Libc
Libc
Short Contents
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
2 Error Reporting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
3 Virtual Memory Allocation And Paging . . . . . . . . . . . . . . . . . . . 44
4 Character Handling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
5 String and Array Utilities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
6 Character Set Handling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
7 Locales and Internationalization . . . . . . . . . . . . . . . . . . . . . . . . 186
8 Message Translation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206
9 Searching and Sorting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
10 Pattern Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243
11 Input/Output Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
12 Input/Output on Streams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270
13 Low-Level Input/Output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347
14 File System Interface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
15 Pipes and FIFOs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 459
16 Sockets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 464
17 Low-Level Terminal Interface . . . . . . . . . . . . . . . . . . . . . . . . . . . 513
18 Syslog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 542
19 Mathematics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
20 Arithmetic Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 644
21 Bit Manipulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 692
22 Date and Time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 696
23 Resource Usage And Limitation . . . . . . . . . . . . . . . . . . . . . . . . . 736
24 Non-Local Exits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 757
25 Signal Handling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 766
26 The Basic Program/System Interface . . . . . . . . . . . . . . . . . . . . 811
27 Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 855
28 Inter-Process Communication . . . . . . . . . . . . . . . . . . . . . . . . . . . 868
29 Job Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 870
30 System Databases and Name Service Switch . . . . . . . . . . . . . . . 888
31 Users and Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 898
32 System Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928
33 System Configuration Parameters . . . . . . . . . . . . . . . . . . . . . . . 943
ii
Table of Contents
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Getting Started . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Standards and Portability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2.1 ISO C . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2.2 POSIX (The Portable Operating System Interface) . . . . . . . . . . 2
1.2.2.1 POSIX Safety Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2.2.2 Unsafe Features . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.2.2.3 Conditionally Safe Features . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.2.4 Other Safety Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.2.3 Berkeley Unix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
1.2.4 SVID (The System V Interface Description) . . . . . . . . . . . . . . . . 11
1.2.5 XPG (The X/Open Portability Guide) . . . . . . . . . . . . . . . . . . . . . 12
1.2.6 Linux (The Linux Kernel) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3 Using the Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3.1 Header Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3.2 Macro Definitions of Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
1.3.3 Reserved Names . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.3.4 Feature Test Macros . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.4 Roadmap to the Manual . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2 Error Reporting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.1 Checking for Errors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.2 Error Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
2.3 Error Messages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
4 Character Handling . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
4.1 Classification of Characters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
4.2 Case Conversion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
4.3 Character class determination for wide characters . . . . . . . . . . . . . . . 91
4.4 Notes on using the wide character classes . . . . . . . . . . . . . . . . . . . . . . . 95
4.5 Mapping of wide characters. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
16 Sockets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 464
16.1 Socket Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 464
16.2 Communication Styles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465
16.3 Socket Addresses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 466
16.3.1 Address Formats . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 466
16.3.2 Setting the Address of a Socket . . . . . . . . . . . . . . . . . . . . . . . . . . 468
16.3.3 Reading the Address of a Socket . . . . . . . . . . . . . . . . . . . . . . . . . 468
16.4 Interface Naming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469
16.5 The Local Namespace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 470
16.5.1 Local Namespace Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 470
16.5.2 Details of Local Namespace. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 470
16.5.3 Example of Local-Namespace Sockets . . . . . . . . . . . . . . . . . . . . 471
16.6 The Internet Namespace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 472
16.6.1 Internet Socket Address Formats . . . . . . . . . . . . . . . . . . . . . . . . 473
16.6.2 Host Addresses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 474
16.6.2.1 Internet Host Addresses . . . . . . . . . . . . . . . . . . . . . . . . . . . . 474
16.6.2.2 Host Address Data Type . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
16.6.2.3 Host Address Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 477
16.6.2.4 Host Names . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 478
16.6.3 Internet Ports . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483
16.6.4 The Services Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483
16.6.5 Byte Order Conversion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 485
16.6.6 Protocols Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 486
16.6.7 Internet Socket Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 487
16.7 Other Namespaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 488
16.8 Opening and Closing Sockets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 489
16.8.1 Creating a Socket . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 489
16.8.2 Closing a Socket. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 489
16.8.3 Socket Pairs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 490
16.9 Using Sockets with Connections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 491
16.9.1 Making a Connection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 491
16.9.2 Listening for Connections. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 492
xi
18 Syslog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 542
18.1 Overview of Syslog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 542
18.2 Submitting Syslog Messages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543
18.2.1 openlog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543
18.2.2 syslog, vsyslog. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
18.2.3 closelog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547
18.2.4 setlogmask . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 548
18.2.5 Syslog Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 548
19 Mathematics. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
19.1 Predefined Mathematical Constants . . . . . . . . . . . . . . . . . . . . . . . . . . 550
19.2 Trigonometric Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
19.3 Inverse Trigonometric Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 553
19.4 Exponentiation and Logarithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 555
19.5 Hyperbolic Functions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 562
19.6 Special Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565
19.7 Known Maximum Errors in Math Functions . . . . . . . . . . . . . . . . . . 568
19.8 Pseudo-Random Numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 633
19.8.1 ISO C Random Number Functions. . . . . . . . . . . . . . . . . . . . . . . 634
19.8.2 BSD Random Number Functions . . . . . . . . . . . . . . . . . . . . . . . . 635
19.8.3 SVID Random Number Function . . . . . . . . . . . . . . . . . . . . . . . . 637
19.8.4 High Quality Random Number Functions . . . . . . . . . . . . . . . . 642
19.9 Is Fast Code or Small Code preferred? . . . . . . . . . . . . . . . . . . . . . . . . 642
27 Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 855
27.1 Running a Command . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 855
27.2 Process Creation Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 856
27.3 Process Identification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 856
27.4 Creating a Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 857
27.5 Querying a Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 859
27.6 Executing a File . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 859
27.7 Process Completion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 862
27.8 Process Completion Status . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 865
27.9 BSD Process Wait Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 866
27.10 Process Creation Example. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 866
36 Threads . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 970
36.1 ISO C Threads . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 970
36.1.1 Return Values . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 970
36.1.2 Creation and Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 970
36.1.3 Call Once . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 972
36.1.4 Mutexes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 972
36.1.5 Condition Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 975
36.1.6 Thread-local Storage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 976
36.2 POSIX Threads . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 977
36.2.1 Thread-specific Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 977
36.2.2 Non-POSIX Extensions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 978
36.2.2.1 Setting Process-wide defaults for thread attributes . . 978
36.2.2.2 Controlling the Initial Signal Mask of a New Thread . 978
36.2.2.3 Functions for Waiting According to a Specific Clock . 979
36.2.2.4 Detecting Single-Threaded Execution . . . . . . . . . . . . . . . 981
36.2.2.5 Restartable Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 982
39 Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1005
39.1 Tunable names . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1006
39.2 Memory Allocation Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1006
39.3 Dynamic Linking Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1009
39.4 Elision Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1010
39.5 POSIX Thread Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1011
39.6 Hardware Capability Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1012
39.7 Memory Related Tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1014
39.8 gmon Tunables. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1015
xx
1 Introduction
The C language provides no built-in facilities for performing such common operations as
input/output, memory management, string manipulation, and the like. Instead, these fa-
cilities are defined in a standard library, which you compile and link with your programs.
The GNU C Library, described in this document, defines all of the library functions that
are specified by the ISO C standard, as well as additional features specific to POSIX and
other derivatives of the Unix operating system, and extensions specific to GNU systems.
The purpose of this manual is to tell you how to use the facilities of the GNU C Library.
We have mentioned which features belong to which standards to help you identify things
that are potentially non-portable to other systems. But the emphasis in this manual is not
on strict portability.
1.2.1 ISO C
The GNU C Library is compatible with the C standard adopted by the American Na-
tional Standards Institute (ANSI): American National Standard X3.159-1989—“ANSI C”
and later by the International Standardization Organization (ISO): ISO/IEC 9899:1990,
“Programming languages—C”. We here refer to the standard as ISO C since this is the
more general standard in respect of ratification. The header files and library facilities that
make up the GNU C Library are a superset of those specified by the ISO C standard.
If you are concerned about strict adherence to the ISO C standard, you should use the
‘-ansi’ option when you compile your programs with the GNU C compiler. This tells
the compiler to define only ISO standard features from the library header files, unless you
explicitly ask for additional features. See Section 1.3.4 [Feature Test Macros], page 16, for
information on how to do this.
Being able to restrict the library to include only ISO C features is important because
ISO C puts limitations on what names can be defined by the library implementation, and
the GNU extensions don’t fit these limitations. See Section 1.3.3 [Reserved Names], page 14,
for more information about these restrictions.
This manual does not attempt to give you complete details on the differences between
ISO C and older dialects. It gives advice on how to write programs to work portably under
multiple C dialects, but does not aim for completeness.
Such preliminary properties are the result of an assessment of the properties of our
current implementation, rather than of what is mandated and permitted by current
and future standards.
Although we strive to abide by the standards, in some cases our implementation is safe
even when the standard does not demand safety, and in other cases our implementation
does not meet the standard safety requirements. The latter are most likely bugs; the
former, when marked as Preliminary, should not be counted on: future standards may
require changes that are not compatible with the additional safety properties afforded
by the current implementation.
Furthermore, the POSIX standard does not offer a detailed definition of safety. We
assume that, by “safe to call”, POSIX means that, as long as the program does not
invoke undefined behavior, the “safe to call” function behaves as specified, and does
not cause other functions to deviate from their specified behavior. We have chosen to
use its loose definitions of safety, not because they are the best definitions to use, but
because choosing them harmonizes this manual with POSIX.
Please keep in mind that these are preliminary definitions and annotations, and certain
aspects of the definitions are still under discussion and might be subject to clarification
or change.
Over time, we envision evolving the preliminary safety notes into stable commitments,
as stable as those of our interfaces. As we do, we will remove the Preliminary keyword
from safety notes. As long as the keyword remains, however, they are not to be regarded
as a promise of future behavior.
Other keywords that appear in safety notes are defined in subsequent sections.
Functions marked with corrupt as an AC-Unsafe feature may leave data structures in a
corrupt, partially updated state. Subsequent uses of the data structure may misbehave.
• heap
Functions marked with heap may call heap memory management functions from the
malloc/free family of functions and are only as safe as those functions. This note is
thus equivalent to:
| AS-Unsafe lock | AC-Unsafe lock fd mem |
• dlopen
Functions marked with dlopen use the dynamic loader to load shared libraries into
the current execution image. This involves opening files, mapping them into memory,
allocating additional memory, resolving symbols, applying relocations and more, all of
this while holding internal dynamic loader locks.
The locks are enough for these functions to be AS- and AC-Unsafe, but other issues
may arise. At present this is a placeholder for all potential safety issues raised by
dlopen.
• plugin
Functions annotated with plugin may run code from plugins that may be external to
the GNU C Library. Such plugin functions are assumed to be MT-Safe, AS-Unsafe
and AC-Unsafe. Examples of such plugins are stack unwinding libraries, name service
switch (NSS) and character set conversion (iconv) back-ends.
Although the plugins mentioned as examples are all brought in by means of dlopen,
the plugin keyword does not imply any direct involvement of the dynamic loader or
the libdl interfaces, those are covered by dlopen. For example, if one function loads a
module and finds the addresses of some of its functions, while another just calls those
already-resolved functions, the former will be marked with dlopen, whereas the latter
will get the plugin. When a single function takes all of these actions, then it gets both
marks.
• i18n
Functions marked with i18n may call internationalization functions of the gettext
family and will be only as safe as those functions. This note is thus equivalent to:
| MT-Safe env | AS-Unsafe corrupt heap dlopen | AC-Unsafe corrupt |
• timer
Functions marked with timer use the alarm function or similar to set a time-out for a
system call or a long-running operation. In a multi-threaded program, there is a risk
that the time-out signal will be delivered to a different thread, thus failing to interrupt
the intended thread. Besides being MT-Unsafe, such functions are always AS-Unsafe,
because calling them in signal handlers may interfere with timers set in the interrupted
code, and AC-Unsafe, because there is no safe way to guarantee an earlier timer will
be reset in case of asynchronous cancellation.
the whole program needs to be constrained in order to remove the safety problem indicated
by the keyword. Only when all the reasons that make a function unsafe are observed and
addressed, by applying the documented constraints, does the function become safe to call
in a context.
• init
Functions marked with init as an MT-Unsafe feature perform MT-Unsafe initialization
when they are first called.
Calling such a function at least once in single-threaded mode removes this specific cause
for the function to be regarded as MT-Unsafe. If no other cause for that remains, the
function can then be safely called after other threads are started.
Functions marked with init as an AS- or AC-Unsafe feature use the internal libc_
once machinery or similar to initialize internal data structures.
If a signal handler interrupts such an initializer, and calls any function that also per-
forms libc_once initialization, it will deadlock if the thread library has been loaded.
Furthermore, if an initializer is partially complete before it is canceled or interrupted
by a signal whose handler requires the same initialization, some or all of the initializa-
tion may be performed more than once, leaking resources or even resulting in corrupt
internal data.
Applications that need to call functions marked with init as an AS- or AC-Unsafe
feature should ensure the initialization is performed before configuring signal handlers
or enabling cancellation, so that the AS- and AC-Safety issues related with libc_once
do not arise.
• race
Functions annotated with race as an MT-Safety issue operate on objects in ways that
may cause data races or similar forms of destructive interference out of concurrent
execution. In some cases, the objects are passed to the functions by users; in others,
they are used by the functions to return values to users; in others, they are not even
exposed to users.
We consider access to objects passed as (indirect) arguments to functions to be data
race free. The assurance of data race free objects is the caller’s responsibility. We
will not mark a function as MT-Unsafe or AS-Unsafe if it misbehaves when users fail
to take the measures required by POSIX to avoid data races when dealing with such
objects. As a general rule, if a function is documented as reading from an object
passed (by reference) to it, or modifying it, users ought to use memory synchronization
primitives to avoid data races just as they would should they perform the accesses
themselves rather than by calling the library function. FILE streams are the exception
to the general rule, in that POSIX mandates the library to guard against data races
in many functions that manipulate objects of this specific opaque type. We regard
this as a convenience provided to users, rather than as a general requirement whose
expectations should extend to other types.
In order to remind users that guarding certain arguments is their responsibility, we will
annotate functions that take objects of certain types as arguments. We draw the line
for objects passed by users as follows: objects whose types are exposed to users, and
that users are expected to access directly, such as memory buffers, strings, and various
Chapter 1: Introduction 7
user-visible struct types, do not give reason for functions to be annotated with race.
It would be noisy and redundant with the general requirement, and not many would
be surprised by the library’s lack of internal guards when accessing objects that can be
accessed directly by users.
As for objects that are opaque or opaque-like, in that they are to be manipulated only
by passing them to library functions (e.g., FILE, DIR, obstack, iconv_t), there might
be additional expectations as to internal coordination of access by the library. We will
annotate, with race followed by a colon and the argument name, functions that take
such objects but that do not take care of synchronizing access to them by default. For
example, FILE stream unlocked functions will be annotated, but those that perform
implicit locking on FILE streams by default will not, even though the implicit locking
may be disabled on a per-stream basis.
In either case, we will not regard as MT-Unsafe functions that may access user-supplied
objects in unsafe ways should users fail to ensure the accesses are well defined. The
notion prevails that users are expected to safeguard against data races any user-supplied
objects that the library accesses on their behalf.
This user responsibility does not apply, however, to objects controlled by the library
itself, such as internal objects and static buffers used to return values from certain
calls. When the library doesn’t guard them against concurrent uses, these cases are
regarded as MT-Unsafe and AS-Unsafe (although the race mark under AS-Unsafe will
be omitted as redundant with the one under MT-Unsafe). As in the case of user-
exposed objects, the mark may be followed by a colon and an identifier. The identifier
groups all functions that operate on a certain unguarded object; users may avoid the
MT-Safety issues related with unguarded concurrent access to such internal objects
by creating a non-recursive mutex related with the identifier, and always holding the
mutex when calling any function marked as racy on that identifier, as they would have
to should the identifier be an object under user control. The non-recursive mutex
avoids the MT-Safety issue, but it trades one AS-Safety issue for another, so use in
asynchronous signals remains undefined.
When the identifier relates to a static buffer used to hold return values, the mutex
must be held for as long as the buffer remains in use by the caller. Many functions
that return pointers to static buffers offer reentrant variants that store return values in
caller-supplied buffers instead. In some cases, such as tmpname, the variant is chosen
not by calling an alternate entry point, but by passing a non-NULL pointer to the buffer
in which the returned values are to be stored. These variants are generally preferable
in multi-threaded programs, although some of them are not MT-Safe because of other
internal buffers, also documented with race notes.
• const
Functions marked with const as an MT-Safety issue non-atomically modify internal
objects that are better regarded as constant, because a substantial portion of the
GNU C Library accesses them without synchronization. Unlike race, that causes both
readers and writers of internal objects to be regarded as MT-Unsafe and AS-Unsafe, this
mark is applied to writers only. Writers remain equally MT- and AS-Unsafe to call, but
the then-mandatory constness of objects they modify enables readers to be regarded as
MT-Safe and AS-Safe (as long as no other reasons for them to be unsafe remain), since
the lack of synchronization is not a problem when the objects are effectively constant.
Chapter 1: Introduction 8
The identifier that follows the const mark will appear by itself as a safety note in
readers. Programs that wish to work around this safety issue, so as to call writers,
may use a non-recursve rwlock associated with the identifier, and guard all calls to
functions marked with const followed by the identifier with a write lock, and all calls to
functions marked with the identifier by itself with a read lock. The non-recursive locking
removes the MT-Safety problem, but it trades one AS-Safety problem for another, so
use in asynchronous signals remains undefined.
• sig
Functions marked with sig as a MT-Safety issue (that implies an identical AS-Safety is-
sue, omitted for brevity) may temporarily install a signal handler for internal purposes,
which may interfere with other uses of the signal, identified after a colon.
This safety problem can be worked around by ensuring that no other uses of the signal
will take place for the duration of the call. Holding a non-recursive mutex while calling
all functions that use the same temporary signal; blocking that signal before the call
and resetting its handler afterwards is recommended.
There is no safe way to guarantee the original signal handler is restored in case of
asynchronous cancellation, therefore so-marked functions are also AC-Unsafe.
Besides the measures recommended to work around the MT- and AS-Safety problem,
in order to avert the cancellation problem, disabling asynchronous cancellation and
installing a cleanup handler to restore the signal to the desired state and to release the
mutex are recommended.
• term
Functions marked with term as an MT-Safety issue may change the terminal settings
in the recommended way, namely: call tcgetattr, modify some flags, and then call
tcsetattr; this creates a window in which changes made by other threads are lost.
Thus, functions marked with term are MT-Unsafe. The same window enables changes
made by asynchronous signals to be lost. These functions are also AS-Unsafe, but the
corresponding mark is omitted as redundant.
It is thus advisable for applications using the terminal to avoid concurrent and reen-
trant interactions with it, by not using it in signal handlers or blocking signals that
might use it, and holding a lock while calling these functions and interacting with the
terminal. This lock should also be used for mutual exclusion with functions marked
with race:tcattr(fd), where fd is a file descriptor for the controlling terminal. The
caller may use a single mutex for simplicity, or use one mutex per terminal, even if
referenced by different file descriptors.
Functions marked with term as an AC-Safety issue are supposed to restore terminal
settings to their original state, after temporarily changing them, but they may fail to
do so if cancelled.
Besides the measures recommended to work around the MT- and AS-Safety problem,
in order to avert the cancellation problem, disabling asynchronous cancellation and
installing a cleanup handler to restore the terminal settings to the original state and
to release the mutex are recommended.
Chapter 1: Introduction 9
Functions that allocate or deallocate file descriptors will generally be marked as such.
Even if they attempted to protect the file descriptor allocation and deallocation with
cleanup regions, allocating a new descriptor and storing its number where the cleanup
region could release it cannot be performed as a single atomic operation. Similarly,
releasing the descriptor and taking it out of the data structure normally responsible for
releasing it cannot be performed atomically. There will always be a window in which
the descriptor cannot be released because it was not stored in the cleanup handler
argument yet, or it was already taken out before releasing it. It cannot be taken out
after release: an open descriptor could mean either that the descriptor still has to be
closed, or that it already did so but the descriptor was reallocated by another thread
or signal handler.
Such leaks could be internally avoided, with some performance penalty, by temporarily
disabling asynchronous thread cancellation. However, since callers of allocation or
deallocation functions would have to do this themselves, to avoid the same sort of leak
in their own layer, it makes more sense for the library to assume they are taking care of
it than to impose a performance penalty that is redundant when the problem is solved
in upper layers, and insufficient when it is not.
This remark by itself does not cause a function to be regarded as AC-Unsafe. However,
cumulative effects of such leaks may pose a problem for some programs. If this is the
case, suspending asynchronous cancellation for the duration of calls to such functions
is recommended.
• mem
Functions annotated with mem as an AC-Safety issue may leak memory if asynchronous
thread cancellation interrupts their execution.
The problem is similar to that of file descriptors: there is no atomic interface to allocate
memory and store its address in the argument to a cleanup handler, or to release it
and remove its address from that argument, without at least temporarily disabling
asynchronous cancellation, which these functions do not do.
This remark does not by itself cause a function to be regarded as generally AC-Unsafe.
However, cumulative effects of such leaks may be severe enough for some programs that
disabling asynchronous cancellation for the duration of calls to such functions may be
required.
• cwd
Functions marked with cwd as an MT-Safety issue may temporarily change the cur-
rent working directory during their execution, which may cause relative pathnames
to be resolved in unexpected ways in other threads or within asynchronous signal or
cancellation handlers.
This is not enough of a reason to mark so-marked functions as MT- or AS-Unsafe, but
when this behavior is optional (e.g., nftw with FTW_CHDIR), avoiding the option may
be a good alternative to using full pathnames or file descriptor-relative (e.g. openat)
system calls.
• !posix
This remark, as an MT-, AS- or AC-Safety note to a function, indicates the safety status
of the function is known to differ from the specified status in the POSIX standard. For
Chapter 1: Introduction 11
example, POSIX does not require a function to be Safe, but our implementation is, or
vice-versa.
For the time being, the absence of this remark does not imply the safety properties we
documented are identical to those mandated by POSIX for the corresponding functions.
• :identifier
Annotations may sometimes be followed by identifiers, intended to group several func-
tions that e.g. access the data structures in an unsafe way, as in race and const, or to
provide more specific information, such as naming a signal in a function marked with
sig. It is envisioned that it may be applied to lock and corrupt as well in the future.
In most cases, the identifier will name a set of functions, but it may name global objects
or function arguments, or identifiable properties or logical components associated with
them, with a notation such as e.g. :buf(arg) to denote a buffer associated with the
argument arg, or :tcattr(fd) to denote the terminal attributes of a file descriptor fd.
The most common use for identifiers is to provide logical groups of functions and
arguments that need to be protected by the same synchronization primitive in order
to ensure safe operation in a given context.
• /condition
Some safety annotations may be conditional, in that they only apply if a boolean
expression involving arguments, global variables or even the underlying kernel evaluates
to true. Such conditions as /hurd or /!linux!bsd indicate the preceding marker only
applies when the underlying kernel is the HURD, or when it is neither Linux nor a
BSD kernel, respectively. /!ps and /one_per_line indicate the preceding marker
only applies when argument ps is NULL, or global variable one per line is nonzero.
When all marks that render a function unsafe are adorned with such conditions, and
none of the named conditions hold, then the function can be regarded as safe.
more obscure and less generally useful facilities required by the SVID are not included. (In
fact, Unix System V itself does not provide them all.)
The supported facilities from System V include the methods for inter-process commu-
nication and shared memory, the hsearch and drand48 families of functions, fmtmsg and
several of the mathematical functions.
has been compiled, the linker resolves these references to the actual definitions provided in
the archive file.
Header files are included into a program source file by the ‘#include’ preprocessor
directive. The C language supports two forms of this directive; the first,
#include "header"
is typically used to include a header file header that you write yourself; this would contain
definitions and declarations describing the interfaces between the different parts of your
particular application. By contrast,
#include <file.h>
is typically used to include a header file file.h that contains definitions and declarations
for a standard library. This file would normally be installed in a standard place by your
system administrator. You should use this second form for the C library header files.
Typically, ‘#include’ directives are placed at the top of the C source file, before any
other code. If you begin your source files with some comments explaining what the code in
the file does (a good idea), put the ‘#include’ directives immediately afterwards, following
the feature test macro definition (see Section 1.3.4 [Feature Test Macros], page 16).
For more information about the use of header files and ‘#include’ directives, see Section
“Header Files” in The GNU C Preprocessor Manual.
The GNU C Library provides several header files, each of which contains the type and
macro definitions and variable and function declarations for a group of related facilities.
This means that your programs may need to include several header files, depending on
exactly which facilities you are using.
Some library header files include other library header files automatically. However, as a
matter of programming style, you should not rely on this; it is better to explicitly include all
the header files required for the library facilities you are using. The GNU C Library header
files have been written in such a way that it doesn’t matter if a header file is accidentally
included more than once; including a header file a second time has no effect. Likewise, if
your program needs to include multiple header files, the order in which they are included
doesn’t matter.
Compatibility Note: Inclusion of standard header files in any order and any number of
times works in any ISO C implementation. However, this has traditionally not been the
case in many older C implementations.
Strictly speaking, you don’t have to include a header file to use a function it declares;
you could declare the function explicitly yourself, according to the specifications in this
manual. But it is usually better to include the header file because it may define types and
macros that are not otherwise available and because it may define more efficient macro
replacements for some functions. It is also a sure way to have the correct declaration.
Taking the address of a library function works even if it is also defined as a macro. This
is because, in this context, the name of the function isn’t followed by the left parenthesis
that is syntactically necessary to recognize a macro call.
You might occasionally want to avoid using the macro definition of a function—perhaps
to make your program easier to debug. There are two ways you can do this:
• You can avoid a macro definition in a specific use by enclosing the name of the function
in parentheses. This works because the name of the function doesn’t appear in a
syntactic context where it is recognizable as a macro call.
• You can suppress any macro definition for a whole source file by using the ‘#undef’
preprocessor directive, unless otherwise stated explicitly in the description of that fa-
cility.
For example, suppose the header file stdlib.h declares a function named abs with
extern int abs (int);
and also provides a macro definition for abs. Then, in:
#include <stdlib.h>
int f (int *i) { return abs (++*i); }
the reference to abs might refer to either a macro or a function. On the other hand, in each
of the following examples the reference is to a function and not a macro.
#include <stdlib.h>
int g (int *i) { return (abs) (++*i); }
#undef abs
int h (int *i) { return abs (++*i); }
Since macro definitions that double for a function behave in exactly the same way as the
actual function version, there is usually no need for any of these methods. In fact, removing
macro definitions usually just makes your program slower.
In addition to the names documented in this manual, reserved names include all external
identifiers (global functions and variables) that begin with an underscore (‘_’) and all iden-
tifiers regardless of use that begin with either two underscores or an underscore followed by
a capital letter are reserved names. This is so that the library and header files can define
functions, variables, and macros for internal purposes without risk of conflict with names
in user programs.
Some additional classes of identifier names are reserved for future extensions to the C
language or the POSIX.1 environment. While using these names for your own purposes
right now might not cause a problem, they do raise the possibility of conflict with future
versions of the C or POSIX standards, so you should avoid these names.
• Names beginning with a capital ‘E’ followed a digit or uppercase letter may be used for
additional error code names. See Chapter 2 [Error Reporting], page 24.
• Names that begin with either ‘is’ or ‘to’ followed by a lowercase letter may be used
for additional character testing and conversion functions. See Chapter 4 [Character
Handling], page 88.
• Names that begin with ‘LC_’ followed by an uppercase letter may be used for additional
macros specifying locale attributes. See Chapter 7 [Locales and Internationalization],
page 186.
• Names of all existing mathematics functions (see Chapter 19 [Mathematics], page 550)
suffixed with ‘f’ or ‘l’ are reserved for corresponding functions that operate on float
and long double arguments, respectively.
• Names that begin with ‘SIG’ followed by an uppercase letter are reserved for additional
signal names. See Section 25.2 [Standard Signals], page 768.
• Names that begin with ‘SIG_’ followed by an uppercase letter are reserved for additional
signal actions. See Section 25.3.1 [Basic Signal Handling], page 777.
• Names beginning with ‘str’, ‘mem’, or ‘wcs’ followed by a lowercase letter are reserved
for additional string and array functions. See Chapter 5 [String and Array Utilities],
page 98.
• Names that end with ‘_t’ are reserved for additional type names.
In addition, some individual header files reserve names beyond those that they actually
define. You only need to worry about these restrictions if your program includes that
particular header file.
• The header file dirent.h reserves names prefixed with ‘d_’.
• The header file fcntl.h reserves names prefixed with ‘l_’, ‘F_’, ‘O_’, and ‘S_’.
• The header file grp.h reserves names prefixed with ‘gr_’.
• The header file limits.h reserves names suffixed with ‘_MAX’.
• The header file pwd.h reserves names prefixed with ‘pw_’.
• The header file signal.h reserves names prefixed with ‘sa_’ and ‘SA_’.
• The header file sys/stat.h reserves names prefixed with ‘st_’ and ‘S_’.
• The header file sys/times.h reserves names prefixed with ‘tms_’.
• The header file termios.h reserves names prefixed with ‘c_’, ‘V’, ‘I’, ‘O’, and ‘TC’; and
names prefixed with ‘B’ followed by a digit.
Chapter 1: Introduction 16
_POSIX_SOURCE [Macro]
If you define this macro, then the functionality from the POSIX.1 standard (IEEE
Standard 1003.1) is available, as well as all of the ISO C facilities.
The state of _POSIX_SOURCE is irrelevant if you define the macro _POSIX_C_SOURCE
to a positive integer.
_POSIX_C_SOURCE [Macro]
Define this macro to a positive integer to control which POSIX functionality is made
available. The greater the value of this macro, the more functionality is made avail-
able.
If you define this macro to a value greater than or equal to 1, then the functionality
from the 1990 edition of the POSIX.1 standard (IEEE Standard 1003.1-1990) is made
available.
If you define this macro to a value greater than or equal to 2, then the functionality
from the 1992 edition of the POSIX.2 standard (IEEE Standard 1003.2-1992) is made
available.
If you define this macro to a value greater than or equal to 199309L, then the function-
ality from the 1993 edition of the POSIX.1b standard (IEEE Standard 1003.1b-1993)
is made available.
If you define this macro to a value greater than or equal to 199506L, then the function-
ality from the 1995 edition of the POSIX.1c standard (IEEE Standard 1003.1c-1995)
is made available.
Chapter 1: Introduction 17
If you define this macro to a value greater than or equal to 200112L, then the func-
tionality from the 2001 edition of the POSIX standard (IEEE Standard 1003.1-2001)
is made available.
If you define this macro to a value greater than or equal to 200809L, then the func-
tionality from the 2008 edition of the POSIX standard (IEEE Standard 1003.1-2008)
is made available.
Greater values for _POSIX_C_SOURCE will enable future extensions. The POSIX stan-
dards process will define these values as necessary, and the GNU C Library should sup-
port them some time after they become standardized. The 1996 edition of POSIX.1
(ISO/IEC 9945-1: 1996) states that if you define _POSIX_C_SOURCE to a value greater
than or equal to 199506L, then the functionality from the 1996 edition is made avail-
able. In general, in the GNU C Library, bugfixes to the standards are included when
specifying the base version; e.g., POSIX.1-2004 will always be included with a value
of 200112L.
_XOPEN_SOURCE [Macro]
_XOPEN_SOURCE_EXTENDED [Macro]
If you define this macro, functionality described in the X/Open Portability Guide is
included. This is a superset of the POSIX.1 and POSIX.2 functionality and in fact
_POSIX_SOURCE and _POSIX_C_SOURCE are automatically defined.
As the unification of all Unices, functionality only available in BSD and SVID is also
included.
If the macro _XOPEN_SOURCE_EXTENDED is also defined, even more functionality is
available. The extra functions will make all functions available which are necessary
for the X/Open Unix brand.
If the macro _XOPEN_SOURCE has the value 500 this includes all functionality described
so far plus some new definitions from the Single Unix Specification, version 2. The
value 600 (corresponding to the sixth revision) includes definitions from SUSv3, and
using 700 (the seventh revision) includes definitions from SUSv4.
_LARGEFILE_SOURCE [Macro]
If this macro is defined some extra functions are available which rectify a few short-
comings in all previous standards. Specifically, the functions fseeko and ftello are
available. Without these functions the difference between the ISO C interface (fseek,
ftell) and the low-level POSIX interface (lseek) would lead to problems.
This macro was introduced as part of the Large File Support extension (LFS).
_LARGEFILE64_SOURCE [Macro]
If you define this macro an additional set of functions is made available which enables
32 bit systems to use files of sizes beyond the usual limit of 2GB. This interface is
not available if the system does not support files that large. On systems where the
natural file size limit is greater than 2GB (i.e., on 64 bit systems) the new functions
are identical to the replaced functions.
The new functionality is made available by a new set of types and functions which
replace the existing ones. The names of these new objects contain 64 to indicate the
intention, e.g., off_t vs. off64_t and fseeko vs. fseeko64.
Chapter 1: Introduction 18
This macro was introduced as part of the Large File Support extension (LFS). It is
a transition interface for the period when 64 bit offsets are not generally used (see
_FILE_OFFSET_BITS).
_FILE_OFFSET_BITS [Macro]
This macro determines which file system interface shall be used, one replacing the
other. Whereas _LARGEFILE64_SOURCE makes the 64 bit interface available as an
additional interface, _FILE_OFFSET_BITS allows the 64 bit interface to replace the
old interface.
If _FILE_OFFSET_BITS is defined to the value 32, the 32 bit interface is used and
types like off_t have a size of 32 bits on 32 bit systems.
If the macro is defined to the value 64, the large file interface replaces the old inter-
face. I.e., the functions are not made available under different names (as they are
with _LARGEFILE64_SOURCE). Instead the old function names now reference the new
functions, e.g., a call to fseeko now indeed calls fseeko64.
If the macro is not defined it currently defaults to 32, but this default is planned to
change due to a need to update time_t for Y2038 safety, and applications should not
rely on the default.
This macro should only be selected if the system provides mechanisms for handling
large files. On 64 bit systems this macro has no effect since the *64 functions are
identical to the normal functions.
This macro was introduced as part of the Large File Support extension (LFS).
_TIME_BITS [Macro]
Define this macro to control the bit size of time_t, and therefore the bit size of all
time_t-derived types and the prototypes of all related functions.
1. If _TIME_BITS is undefined, the bit size of time_t is architecture dependent.
Currently it defaults to 64 bits on most architectures. Although it defaults to
32 bits on some traditional architectures (i686, ARM), this is planned to change
and applications should not rely on this.
2. If _TIME_BITS is defined to be 64, time_t is defined to be a 64-bit integer. On
platforms where time_t was traditionally 32 bits, calls to proper syscalls depend
on the Linux kernel version on which the system is running. For Linux kernel
version above 5.1 syscalls supporting 64-bit time are used. Otherwise, a fallback
code is used with legacy (i.e. 32-bit) syscalls.
On such platforms, the GNU C Library will also define __USE_TIME64_REDIRECTS
to indicate whether the declarations are expanded to different ones (either by
redefiniding the symbol name or using symbol aliais). For instance, if the symbol
clock_gettime expands to __glock_gettime64.
3. If _TIME_BITS is defined to be 32, time_t is defined to be a 32-bit integer where
that is supported. This is not recommended, as 32-bit time_t stops working in
the year 2038.
4. For any other use case a compile-time error is emitted.
_TIME_BITS=64 can be defined only when _FILE_OFFSET_BITS=64 is also defined.
By using this macro certain ports gain support for 64-bit time and as a result become
immune to the Y2038 problem.
Chapter 1: Introduction 19
_ISOC99_SOURCE [Macro]
If this macro is defined, features from ISO C99 are included. Since these features are
included by default, this macro is mostly relevant when the compiler uses an earlier
language version.
_ISOC11_SOURCE [Macro]
If this macro is defined, ISO C11 extensions to ISO C99 are included.
_ISOC23_SOURCE [Macro]
If this macro is defined, ISO C23 extensions to ISO C11 are included. Only some
features from this draft standard are supported by the GNU C Library. The older
name _ISOC2X_SOURCE is also supported.
__STDC_WANT_LIB_EXT2__ [Macro]
If you define this macro to the value 1, features from ISO/IEC TR 24731-2:2010
(Dynamic Allocation Functions) are enabled. Only some of the features from this TR
are supported by the GNU C Library.
__STDC_WANT_IEC_60559_BFP_EXT__ [Macro]
If you define this macro, features from ISO/IEC TS 18661-1:2014 (Floating-point
extensions for C: Binary floating-point arithmetic) are enabled. Only some of the
features from this TS are supported by the GNU C Library.
__STDC_WANT_IEC_60559_FUNCS_EXT__ [Macro]
If you define this macro, features from ISO/IEC TS 18661-4:2015 (Floating-point
extensions for C: Supplementary functions) are enabled. Only some of the features
from this TS are supported by the GNU C Library.
__STDC_WANT_IEC_60559_TYPES_EXT__ [Macro]
If you define this macro, features from ISO/IEC TS 18661-3:2015 (Floating-point
extensions for C: Interchange and extended types) are enabled. Only some of the
features from this TS are supported by the GNU C Library.
__STDC_WANT_IEC_60559_EXT__ [Macro]
If you define this macro, ISO C23 features defined in Annex F of that standard are
enabled. This affects declarations of the totalorder functions and functions related
to NaN payloads.
_GNU_SOURCE [Macro]
If you define this macro, everything is included: ISO C89, ISO C99, POSIX.1,
POSIX.2, BSD, SVID, X/Open, LFS, and GNU extensions. In the cases where
POSIX.1 conflicts with BSD, the POSIX definitions take precedence.
_DEFAULT_SOURCE [Macro]
If you define this macro, most features are included apart from X/Open, LFS and
GNU extensions: the effect is to enable features from the 2008 edition of POSIX,
as well as certain BSD and SVID features without a separate feature test macro to
control them.
Chapter 1: Introduction 20
_ATFILE_SOURCE [Macro]
If this macro is defined, additional *at interfaces are included.
_FORTIFY_SOURCE [Macro]
If this macro is defined to 1, security hardening is added to various library functions. If
defined to 2, even stricter checks are applied. If defined to 3, the GNU C Library may
also use checks that may have an additional performance overhead. See Section D.2
[Fortification of function calls], page 1177.
_DYNAMIC_STACK_SIZE_SOURCE [Macro]
If this macro is defined, correct (but non compile-time constant) MINSIGSTKSZ,
SIGSTKSZ and PTHREAD STACK MIN are defined.
_REENTRANT [Macro]
_THREAD_SAFE [Macro]
These macros are obsolete. They have the same effect as defining _POSIX_C_SOURCE
with the value 199506L.
Some very old C libraries required one of these macros to be defined for basic func-
tionality (e.g. getchar) to be thread-safe.
We recommend you use _GNU_SOURCE in new programs. If you don’t specify the ‘-ansi’
option to GCC, or other conformance options such as -std=c99, and don’t define any of
these macros explicitly, the effect is the same as defining _DEFAULT_SOURCE to 1.
When you define a feature test macro to request a larger class of features, it is harmless
to define in addition a feature test macro for a subset of those features. For example, if you
define _POSIX_C_SOURCE, then defining _POSIX_SOURCE as well has no effect. Likewise, if
you define _GNU_SOURCE, then defining either _POSIX_SOURCE or _POSIX_C_SOURCE as well
has no effect.
• Chapter 5 [String and Array Utilities], page 98, has descriptions of functions for ma-
nipulating strings (null-terminated character arrays) and general byte arrays, including
operations such as copying and comparison.
• Chapter 6 [Character Set Handling], page 143, contains information about manipulating
characters and strings using character sets larger than will fit in the usual char data
type.
• Chapter 7 [Locales and Internationalization], page 186, describes how selecting a par-
ticular country or language affects the behavior of the library. For example, the locale
affects collation sequences for strings and how monetary values are formatted.
• Chapter 9 [Searching and Sorting], page 231, contains information about functions for
searching and sorting arrays. You can use these functions on any kind of array by
providing an appropriate comparison function.
• Chapter 10 [Pattern Matching], page 243, presents functions for matching regular ex-
pressions and shell file name patterns, and for expanding words as the shell does.
• Chapter 11 [Input/Output Overview], page 265, gives an overall look at the input and
output facilities in the library, and contains information about basic concepts such as
file names.
• Chapter 12 [Input/Output on Streams], page 270, describes I/O operations involving
streams (or FILE * objects). These are the normal C library functions from stdio.h.
• Chapter 13 [Low-Level Input/Output], page 347, contains information about I/O op-
erations on file descriptors. File descriptors are a lower-level mechanism specific to the
Unix family of operating systems.
• Chapter 14 [File System Interface], page 411, has descriptions of operations on entire
files, such as functions for deleting and renaming them and for creating new directories.
This chapter also contains information about how you can access the attributes of a
file, such as its owner and file protection modes.
• Chapter 15 [Pipes and FIFOs], page 459, contains information about simple inter-
process communication mechanisms. Pipes allow communication between two related
processes (such as between a parent and child), while FIFOs allow communication
between processes sharing a common file system on the same machine.
• Chapter 16 [Sockets], page 464, describes a more complicated interprocess communi-
cation mechanism that allows processes running on different machines to communicate
over a network. This chapter also contains information about Internet host addressing
and how to use the system network databases.
• Chapter 17 [Low-Level Terminal Interface], page 513, describes how you can change
the attributes of a terminal device. If you want to disable echo of characters typed by
the user, for example, read this chapter.
• Chapter 19 [Mathematics], page 550, contains information about the math library func-
tions. These include things like random-number generators and remainder functions on
integers as well as the usual trigonometric and exponential functions on floating-point
numbers.
• Chapter 20 [Low-Level Arithmetic Functions], page 644, describes functions for simple
arithmetic, analysis of floating-point values, and reading numbers from strings.
Chapter 1: Introduction 22
• Chapter 22 [Date and Time], page 696, describes functions for measuring both calendar
time and CPU time, as well as functions for setting alarms and timers.
• Chapter 24 [Non-Local Exits], page 757, contains descriptions of the setjmp and
longjmp functions. These functions provide a facility for goto-like jumps which can
jump from one function to another.
• Chapter 25 [Signal Handling], page 766, tells you all about signals—what they are, how
to establish a handler that is called when a particular kind of signal is delivered, and
how to prevent signals from arriving during critical sections of your program.
• Chapter 26 [The Basic Program/System Interface], page 811, tells how your programs
can access their command-line arguments and environment variables.
• Chapter 27 [Processes], page 855, contains information about how to start new processes
and run programs.
• Chapter 29 [Job Control], page 870, describes functions for manipulating process groups
and the controlling terminal. This material is probably only of interest if you are writing
a shell or other program which handles job control specially.
• Chapter 30 [System Databases and Name Service Switch], page 888, describes the ser-
vices which are available for looking up names in the system databases, how to deter-
mine which service is used for which database, and how these services are implemented
so that contributors can design their own services.
• Section 31.13 [User Database], page 917, and Section 31.14 [Group Database], page 921,
tell you how to access the system user and group databases.
• Chapter 32 [System Management], page 928, describes functions for controlling and
getting information about the hardware and software configuration your program is
executing under.
• Chapter 33 [System Configuration Parameters], page 943, tells you how you can get
information about various operating system limits. Most of these parameters are pro-
vided for compatibility with POSIX.
• Appendix A [C Language Facilities in the Library], page 1016, contains information
about library support for standard parts of the C language, including things like the
sizeof operator and the symbolic constant NULL, how to write functions accepting
variable numbers of arguments, and constants describing the ranges and other proper-
ties of the numerical types. There is also a simple debugging mechanism which allows
you to put assertions in your code, and have diagnostic messages printed if the tests
fail.
• Appendix B [Summary of Library Facilities], page 1032, gives a summary of all the
functions, variables, and macros in the library, with complete data types and function
prototypes, and says what standard or system each is derived from.
• Appendix C [Installing the GNU C Library], page 1163, explains how to build and
install the GNU C Library on your system, and how to report any bugs you might find.
• Appendix D [Library Maintenance], page 1175, explains how to add new functions or
port the library to a new system.
If you already know the name of the facility you are interested in, you can look it up in
Appendix B [Summary of Library Facilities], page 1032. This gives you a summary of its
syntax and a pointer to where you can find a more detailed description. This appendix is
Chapter 1: Introduction 23
particularly useful if you just want to verify the order and type of arguments to a function,
for example. It also tells you what standard or system each function, variable, or macro is
derived from.
24
2 Error Reporting
Many functions in the GNU C Library detect and report error conditions, and sometimes
your programs need to check for these error conditions. For example, when you open an
input file, you should verify that the file was actually opened correctly, and print an error
message or take other appropriate action if the call to the library function failed.
This chapter describes how the error reporting facility works. Your program should
include the header file errno.h to use this facility.
All the error codes have symbolic names; they are macros defined in errno.h. The
names start with ‘E’ and an upper-case letter or digit; you should consider names of this
form to be reserved names. See Section 1.3.3 [Reserved Names], page 14.
Chapter 2: Error Reporting 25
The error code values are all positive integers and are all distinct, with one exception:
EWOULDBLOCK and EAGAIN are the same. Since the values are distinct, you can use them
as labels in a switch statement; just don’t use both EWOULDBLOCK and EAGAIN. Your
program should not make any other assumptions about the specific values of these symbolic
constants.
The value of errno doesn’t necessarily have to correspond to any of these macros, since
some library functions might return other error codes of their own for other situations. The
only values that are guaranteed to be meaningful for a particular library function are the
ones that this manual lists for that function.
Except on GNU/Hurd systems, almost any system call can return EFAULT if it is given
an invalid pointer as an argument. Since this could only happen as a result of a bug in your
program, and since it will not happen on GNU/Hurd systems, we have saved space by not
mentioning EFAULT in the descriptions of individual functions.
In some Unix systems, many system calls can also return EFAULT if given as an argument a
pointer into the stack, and the kernel for some obscure reason fails in its attempt to extend
the stack. If this ever happens, you should probably try using statically or dynamically
allocated memory instead of stack memory on that system.
For functions that operate on some object given in a parameter, such as a file de-
scriptor or a port, it might instead mean that only that specific object (file descriptor,
port, etc.) is unable to support the other parameters given; different file descriptors
might support different ranges of parameter values.
If the entire function is not available at all in the implementation, it returns ENOSYS
instead.
int EILSEQ [Macro]
“Invalid or incomplete multibyte or wide character.” While decoding a multibyte
character the function came along an invalid or an incomplete sequence of bytes or
the given wide character is invalid.
int EBACKGROUND [Macro]
“Inappropriate operation for background process.” On GNU/Hurd systems, servers
supporting the term protocol return this error for certain operations when the caller
is not in the foreground process group of the terminal. Users do not usually see
this error because functions such as read and write translate it into a SIGTTIN or
SIGTTOU signal. See Chapter 29 [Job Control], page 870, for information on process
groups and these signals.
int EDIED [Macro]
“Translator died.” On GNU/Hurd systems, opening a file returns this error when
the file is translated by a program and the translator program dies while starting up,
before it has connected to the file.
int ED [Macro]
“?.” The experienced user will know what is wrong.
int EGREGIOUS [Macro]
“You really blew it this time.” You did what?
int EIEIO [Macro]
“Computer bought the farm.” Go home and have a glass of warm, dairy-fresh milk.
int EGRATUITOUS [Macro]
“Gratuitous error.” This error code has no purpose.
int EBADMSG [Macro]
“Bad message.”
int EIDRM [Macro]
“Identifier removed.”
int EMULTIHOP [Macro]
“Multihop attempted.”
int ENODATA [Macro]
“No data available.”
int ENOLINK [Macro]
“Link has been severed.”
Chapter 2: Error Reporting 34
or not depends on the errnum argument. If the result string is not stored in buf, the
string will not change for the remaining execution of the program.
The function strerror_r as described above is a GNU extension and it is declared
in string.h. There is a POSIX variant of this function, described next.
fopen library function returns a null pointer if it couldn’t open the file for some reason. In
that situation, open_sesame constructs an appropriate error message using the strerror
function, and terminates the program. If we were going to make some other library calls
before passing the error code to strerror, we’d have to save it in a local variable instead,
because those other library functions might overwrite errno in the meantime.
#define _GNU_SOURCE
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
FILE *
open_sesame (char *name)
{
FILE *stream;
errno = 0;
stream = fopen (name, "r");
if (stream == NULL)
{
fprintf (stderr, "%s: Couldn't open file %s; %s\n",
program_invocation_short_name, name, strerror (errno));
exit (EXIT_FAILURE);
}
else
return stream;
}
Using perror has the advantage that the function is portable and available on all systems
implementing ISO C. But often the text perror generates is not what is wanted and there
is no way to extend or change what perror does. The GNU coding standard, for instance,
requires error messages to be preceded by the program name and programs which read some
input files should provide information about the input file name and the line number in case
an error is encountered while reading the file. For these occasions there are two functions
available which are widely used throughout the GNU project. These functions are declared
in error.h.
void error (int status, int errnum, const char *format, [Function]
...)
Preliminary: | MT-Safe locale | AS-Unsafe corrupt heap i18n | AC-Safe | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The error function can be used to report general problems during program execution.
The format argument is a format string just like those given to the printf family of
functions. The arguments required for the format can follow the format parameter.
Just like perror, error also can report an error code in textual form. But unlike
perror the error value is explicitly passed to the function in the errnum parameter.
This eliminates the problem mentioned above that the error reporting function must
be called immediately after the function causing the error since otherwise errno might
have a different value.
error prints first the program name. If the application defined a global variable
error_print_progname and points it to a function this function will be called to
Chapter 2: Error Reporting 41
print the program name. Otherwise the string from the global variable program_
name is used. The program name is followed by a colon and a space which in turn
is followed by the output produced by the format string. If the errnum parameter is
non-zero the format string output is followed by a colon and a space, followed by the
error message for the error code errnum. In any case is the output terminated with a
newline.
The output is directed to the stderr stream. If the stderr wasn’t oriented before
the call it will be narrow-oriented afterwards.
The function will return unless the status parameter has a non-zero value. In this case
the function will call exit with the status value for its parameter and therefore never
return. If error returns, the global variable error_message_count is incremented
by one to keep track of the number of errors reported.
void error_at_line (int status, int errnum, const char [Function]
*fname, unsigned int lineno, const char *format, ...)
Preliminary: | MT-Unsafe race:error at line/error one per line locale | AS-Unsafe
corrupt heap i18n | AC-Unsafe corrupt/error one per line | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The error_at_line function is very similar to the error function. The only dif-
ferences are the additional parameters fname and lineno. The handling of the other
parameters is identical to that of error except that between the program name and
the string generated by the format string additional text is inserted.
Directly following the program name a colon, followed by the file name pointed to by
fname, another colon, and the value of lineno is printed.
This additional output of course is meant to be used to locate an error in an input
file (like a programming language source code file etc).
If the global variable error_one_per_line is set to a non-zero value error_at_line
will avoid printing consecutive messages for the same file and line. Repetition which
are not directly following each other are not caught.
Just like error this function only returns if status is zero. Otherwise exit is called
with the non-zero value. If error returns, the global variable error_message_count
is incremented by one to keep track of the number of errors reported.
As mentioned above, the error and error_at_line functions can be customized by
defining a variable named error_print_progname.
void (*error_print_progname) (void) [Variable]
If the error_print_progname variable is defined to a non-zero value the function
pointed to is called by error or error_at_line. It is expected to print the program
name or do something similarly useful.
The function is expected to print to the stderr stream and must be able to handle
whatever orientation the stream has.
The variable is global and shared by all threads.
unsigned int error_message_count [Variable]
The error_message_count variable is incremented whenever one of the functions
error or error_at_line returns. The variable is global and shared by all threads.
Chapter 2: Error Reporting 42
A program which read some input file and reports errors in it could look like this:
{
char *line = NULL;
size_t len = 0;
unsigned int lineno = 0;
error_message_count = 0;
while (! feof_unlocked (fp))
{
ssize_t n = getline (&line, &len, fp);
if (n <= 0)
/* End of file or error. */
break;
++lineno;
if (error_message_count != 0)
error (EXIT_FAILURE, 0, "%u errors found", error_message_count);
}
error and error_at_line are clearly the functions of choice and enable the programmer
to write applications which follow the GNU coding standard. The GNU C Library addi-
tionally contains functions which are used in BSD for the same purpose. These functions
are declared in err.h. It is generally advised to not use these functions. They are included
only for compatibility.
void verr (int status, const char *format, va_list ap) [Function]
Preliminary: | MT-Safe locale | AS-Unsafe corrupt heap i18n | AC-Unsafe corrupt
lock mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The verr function is just like err except that the parameters for the handling of the
format string format are passed in as a value of type va_list.
void verrx (int status, const char *format, va_list ap) [Function]
Preliminary: | MT-Safe locale | AS-Unsafe corrupt heap | AC-Unsafe corrupt lock
mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The verrx function is just like errx except that the parameters for the handling of
the format string format are passed in as a value of type va_list.
44
Processes allocate memory in two major ways: by exec and programmatically. Actually,
forking is a third way, but it’s not very interesting. See Section 27.4 [Creating a Process],
page 857.
Exec is the operation of creating a virtual address space for a process, loading its basic
program into it, and executing the program. It is done by the “exec” family of functions
(e.g. execl). The operation takes a program file (an executable), it allocates space to
load all the data in the executable, loads it, and transfers control to it. That data is most
notably the instructions of the program (the text), but also literals and constants in the
program and even some variables: C variables with the static storage class (see Section 3.2.1
[Memory Allocation in C Programs], page 46).
Once that program begins to execute, it uses programmatic allocation to gain additional
memory. In a C program with the GNU C Library, there are two kinds of programmatic
allocation: automatic and dynamic. See Section 3.2.1 [Memory Allocation in C Programs],
page 46.
Memory-mapped I/O is another form of dynamic virtual memory allocation. Mapping
memory to a file means declaring that the contents of certain range of a process’ addresses
shall be identical to the contents of a specified regular file. The system makes the virtual
memory initially contain the contents of the file, and if you modify the memory, the system
writes the same modification to the file. Note that due to the magic of virtual memory and
page faults, there is no reason for the system to do I/O to read the file, or allocate real
memory for its contents, until the program accesses the virtual memory. See Section 13.8
[Memory-mapped I/O], page 366.
Just as it programmatically allocates memory, the program can programmatically deal-
locate (free) it. You can’t free the memory that was allocated by exec. When the program
exits or execs, you might say that all its memory gets freed, but since in both cases the ad-
dress space ceases to exist, the point is really moot. See Section 26.7 [Program Termination],
page 851.
A process’ virtual address space is divided into segments. A segment is a contiguous
range of virtual addresses. Three important segments are:
•
The text segment contains a program’s instructions and literals and static constants.
It is allocated by exec and stays the same size for the life of the virtual address space.
• The data segment is working storage for the program. It can be preallocated and
preloaded by exec and the process can extend or shrink it by calling functions as
described in See Section 3.3 [Resizing the Data Segment], page 77. Its lower end is
fixed.
• The stack segment contains a program stack. It grows as the stack grows, but doesn’t
shrink when the stack shrinks.
The contents of the block are undefined; you must initialize it yourself (or use calloc
instead; see Section 3.2.3.5 [Allocating Cleared Space], page 51). Normally you would
convert the value to a pointer to the kind of object that you want to store in the block.
Here we show an example of doing so, and of initializing the space with zeros using the
library function memset (see Section 5.4 [Copying Strings and Arrays], page 102):
struct foo *ptr = malloc (sizeof *ptr);
if (ptr == 0) abort ();
memset (ptr, 0, sizeof (struct foo));
You can store the result of malloc into any pointer variable without a cast, because
ISO C automatically converts the type void * to another type of pointer when necessary.
However, a cast is necessary if the type is needed but not specified by context.
Remember that when allocating space for a string, the argument to malloc must be one
plus the length of the string. This is because a string is terminated with a null character
that doesn’t count in the “length” of the string but does need space. For example:
char *ptr = malloc (length + 1);
See Section 5.1 [Representation of Strings], page 98, for more information about this.
page boundary) necessary; for those cases, use aligned_alloc or posix_memalign (see
Section 3.2.3.6 [Allocating Aligned Memory Blocks], page 52).
Note that the memory located after the end of the block is likely to be in use for something
else; perhaps a block already allocated by another call to malloc. If you attempt to treat
the block as longer than you asked for it to be, you are liable to destroy the data that
malloc uses to keep track of its blocks, or you may destroy the contents of another block.
If you have already allocated a block and discover you want it to be bigger, use realloc
(see Section 3.2.3.4 [Changing the Size of a Block], page 50).
Portability Notes:
• In the GNU C Library, a successful malloc (0) returns a non-null pointer to a newly
allocated size-zero block; other implementations may return NULL instead. POSIX and
the ISO C standard allow both behaviors.
• In the GNU C Library, a failed malloc call sets errno, but ISO C does not require
this and non-POSIX implementations need not set errno when failing.
• In the GNU C Library, malloc always fails when size exceeds PTRDIFF_MAX, to avoid
problems with programs that subtract pointers or use signed indexes. Other imple-
mentations may succeed in this case, leading to undefined behavior later.
void
free_chain (struct chain *chain)
{
while (chain != 0)
{
struct chain *next = chain->next;
free (chain->name);
free (chain);
chain = next;
}
}
Occasionally, free can actually return memory to the operating system and make the
process smaller. Usually, all it can do is allow a later call to malloc to reuse the space. In
Chapter 3: Virtual Memory Allocation And Paging 50
the meantime, the space remains in your program as part of a free-list used internally by
malloc.
The free function preserves the value of errno, so that cleanup code need not worry
about saving and restoring errno around a call to free. Although neither ISO C nor
POSIX.1-2017 requires free to preserve errno, a future version of POSIX is planned to
require it.
There is no point in freeing blocks at the end of a program, because all of the program’s
space is given back to the system when the process terminates.
In most cases it makes no difference what happens to the original block when realloc
fails, because the application program cannot continue when it is out of memory, and the
only thing to do is to give a fatal error message. Often it is convenient to write and use
subroutines, conventionally called xrealloc and xreallocarray, that take care of the error
message as xmalloc does for malloc:
void *
xreallocarray (void *ptr, size_t nmemb, size_t size)
{
void *value = reallocarray (ptr, nmemb, size);
if (value == 0)
fatal ("Virtual memory exhausted");
return value;
}
void *
xrealloc (void *ptr, size_t size)
{
return xreallocarray (ptr, 1, size);
}
You can also use realloc or reallocarray to make a block smaller. The reason you
would do this is to avoid tying up a lot of memory space when only a little is needed. In
several allocation implementations, making a block smaller sometimes necessitates copying
it, so it can fail if no other space is available.
Portability Notes:
• Portable programs should not attempt to reallocate blocks to be size zero. On other
implementations if ptr is non-null, realloc (ptr, 0) might free the block and return
a non-null pointer to a size-zero object, or it might fail and return NULL without freeing
the block. The ISO C17 standard allows these variations.
• In the GNU C Library, reallocation fails if the resulting block would exceed PTRDIFF_
MAX in size, to avoid problems with programs that subtract pointers or use signed
indexes. Other implementations may succeed, leading to undefined behavior later.
• In the GNU C Library, if the new size is the same as the old, realloc and reallocarray
are guaranteed to change nothing and return the same address that you gave. However,
POSIX and ISO C allow the functions to relocate the object or fail in this situation.
if (value != 0)
memset (value, 0, count * eltsize);
return value;
}
But in general, it is not guaranteed that calloc calls reallocarray and memset inter-
nally. For example, if the calloc implementation knows for other reasons that the new
memory block is zero, it need not zero out the block again with memset. Also, if an ap-
plication provides its own reallocarray outside the C library, calloc might not use that
redefinition. See Section 3.2.5 [Replacing malloc], page 63.
M_MMAP_THRESHOLD
All chunks larger than this value are allocated outside the normal heap,
using the mmap system call. This way it is guaranteed that the memory for
these chunks can be returned to the system on free. Note that requests
smaller than this threshold might still be allocated via mmap.
If this parameter is not set, the default value is set as 128 KiB and the
threshold is adjusted dynamically to suit the allocation patterns of the
program. If the parameter is set, the dynamic adjustment is disabled and
the value is set statically to the input value.
This parameter can also be set for the process at startup by setting the
environment variable MALLOC_MMAP_THRESHOLD_ to the desired value.
M_PERTURB
If non-zero, memory blocks are filled with values depending on some low
order bits of this parameter when they are allocated (except when al-
located by calloc) and freed. This can be used to debug the use of
uninitialized or freed heap memory. Note that this option does not guar-
antee that the freed block will have any specific values. It only guarantees
that the content the block had before it was freed will be overwritten.
The default value of this parameter is 0.
This parameter can also be set for the process at startup by setting the
environment variable MALLOC_PERTURB_ to the desired value.
M_TOP_PAD
This parameter determines the amount of extra memory to obtain from
the system when an arena needs to be extended. It also specifies the
number of bytes to retain when shrinking an arena. This provides the
necessary hysteresis in heap size such that excessive amounts of system
calls can be avoided.
The default value of this parameter is 0.
This parameter can also be set for the process at startup by setting the
environment variable MALLOC_TOP_PAD_ to the desired value.
M_TRIM_THRESHOLD
This is the minimum size (in bytes) of the top-most, releasable chunk
that will trigger a system call in order to return memory to the system.
If this parameter is not set, the default value is set as 128 KiB and the
threshold is adjusted dynamically to suit the allocation patterns of the
program. If the parameter is set, the dynamic adjustment is disabled and
the value is set statically to the provided input.
This parameter can also be set for the process at startup by setting the
environment variable MALLOC_TRIM_THRESHOLD_ to the desired value.
M_ARENA_TEST
This parameter specifies the number of arenas that can be created before
the test on the limit to the number of arenas is conducted. The value is
ignored if M_ARENA_MAX is set.
Chapter 3: Virtual Memory Allocation And Paging 55
>end
(gdb) ...
This will however only work if no initialization function of any object involved calls
any of the malloc functions since mcheck must be called before the first such function.
Another possibility to check for and guard against bugs in the use of malloc, realloc
and free is to set the environment variable MALLOC_CHECK_. When MALLOC_CHECK_ is set
to a non-zero value less than 4, a special (less efficient) implementation is used which is
designed to be tolerant against simple errors, such as double calls of free with the same
argument, or overruns of a single byte (off-by-one bugs). Not all such errors can be protected
against, however, and memory leaks can result. Like in the case of mcheck, one would need
to preload the libc_malloc_debug library to enable MALLOC_CHECK_ functionality. Without
this preloaded library, setting MALLOC_CHECK_ will have no effect.
Any detected heap corruption results in immediate termination of the process.
There is one problem with MALLOC_CHECK_: in SUID or SGID binaries it could possibly
be exploited since diverging from the normal programs behavior it now writes something to
Chapter 3: Virtual Memory Allocation And Paging 57
the standard error descriptor. Therefore the use of MALLOC_CHECK_ is disabled by default
for SUID and SGID binaries.
So, what’s the difference between using MALLOC_CHECK_ and linking with ‘-lmcheck’?
MALLOC_CHECK_ is orthogonal with respect to ‘-lmcheck’. ‘-lmcheck’ has been added for
backward compatibility. Both MALLOC_CHECK_ and ‘-lmcheck’ should uncover the same
bugs - but using MALLOC_CHECK_ you don’t need to recompile your application.
int
main (int argc, char *argv[])
{
#ifdef DEBUGGING
mtrace ();
#endif
...
}
This is all that is needed if you want to trace the calls during the whole runtime of the
program. Alternatively you can stop the tracing at any time with a call to muntrace. It
is even possible to restart the tracing again with a new call to mtrace. But this can cause
unreliable results since there may be calls of the functions which are not called. Please
note that not only the application uses the traced functions, also libraries (including the C
library itself) use these functions.
This last point is also why it is not a good idea to call muntrace before the program
terminates. The libraries are informed about the termination of the program only after the
program returns from main or calls exit and so cannot free the memory they use before
this time.
So the best thing one can do is to call mtrace as the very first function in the program
and never call muntrace. So the program traces almost all uses of the malloc functions
(except those calls which are executed by constructors of the program or used libraries).
static void
enable (int sig)
{
mtrace ();
signal (SIGUSR1, enable);
Chapter 3: Virtual Memory Allocation And Paging 61
static void
disable (int sig)
{
muntrace ();
signal (SIGUSR2, disable);
}
int
main (int argc, char *argv[])
{
...
...
}
I.e., the user can start the memory debugger any time s/he wants if the program was
started with MALLOC_TRACE set in the environment. The output will of course not show the
allocations which happened before the first signal but if there is a memory leak this will
show up nevertheless.
In this case the program tst-mtrace was run and it produced a trace file log. The
message printed by mtrace shows there are no problems with the code, all allocated memory
was freed afterwards.
If we call mtrace on the example trace given above we would get a different output:
We have called mtrace with only one argument and so the script has no chance to find
out what is meant with the addresses given in the trace. We can do better:
Suddenly the output makes much more sense and the user can see immediately where
the function calls causing the trouble can be found.
Interpreting this output is not complicated. There are at most two different situations
being detected. First, free was called for pointers which were never returned by one of the
allocation functions. This is usually a very bad problem and what this looks like is shown
in the first three lines of the output. Situations like this are quite rare and if they appear
they show up very drastically: the program normally crashes.
The other situation which is much harder to detect are memory leaks. As you can see in
the output the mtrace function collects all this information and so can say that the program
calls an allocation function from line 33 in the source file /home/drepper/tst-mtrace.c
four times without freeing this memory before the program terminates. Whether this is a
real problem remains to be investigated.
Chapter 3: Virtual Memory Allocation And Paging 63
There are other functions (reallocarray, strdup, etc.) in the GNU C Library that
are not listed above but return newly allocated memory to callers. Replacement of these
functions is not supported and may produce incorrect results. The GNU C Library imple-
mentations of these functions call the replacement allocator functions whenever available,
so they will work correctly with malloc replacement.
3.2.6 Obstacks
An obstack is a pool of memory containing a stack of objects. You can create any number of
separate obstacks, and then allocate objects in specified obstacks. Within each obstack, the
last object allocated must always be the first one freed, but distinct obstacks are independent
of each other.
Aside from this one constraint of order of freeing, obstacks are totally general: an obstack
can contain any number of objects of any size. They are implemented with macros, so
allocation is usually very fast as long as the objects are usually small. And the only space
overhead per object is the padding needed to start each object on a suitable boundary.
You can declare variables of type struct obstack and use them as obstacks, or you can
allocate obstacks dynamically like any other kind of object. Dynamic allocation of obstacks
allows your program to have a variable number of different stacks. (You can even allocate
an obstack structure in another obstack, but this is rarely useful.)
All the functions that work with obstacks require you to specify which obstack to use.
You do this with a pointer of type struct obstack *. In the following, we often say “an
obstack” when strictly speaking the object at hand is such a pointer.
The objects in the obstack are packed into large blocks called chunks. The struct
obstack structure points to a chain of the chunks currently in use.
The obstack library obtains a new chunk whenever you allocate an object that won’t
fit in the previous chunk. Since the obstack library manages chunks automatically, you
don’t need to pay much attention to them, but you do need to supply a function which the
obstack library should use to get a chunk. Usually you supply a function which uses malloc
directly or indirectly. You must also supply a function to free a chunk. These matters are
described in the following section.
Also, if the source file uses the macro obstack_init, it must declare or define two
functions or macros that will be called by the obstack library. One, obstack_chunk_alloc,
is used to allocate the chunks of memory into which objects are packed. The other, obstack_
chunk_free, is used to return chunks when the objects in them are freed. These macros
should appear before any use of obstacks in the source file.
Usually these are defined to use malloc via the intermediary xmalloc (see Section 3.2.3
[Unconstrained Allocation], page 47). This is done with the following pair of macro defini-
tions:
#define obstack_chunk_alloc xmalloc
#define obstack_chunk_free free
Though the memory you get using obstacks really comes from malloc, using obstacks is
faster because malloc is called less often, for larger blocks of memory. See Section 3.2.6.10
[Obstack Chunks], page 73, for full details.
At run time, before the program can use a struct obstack object as an obstack, it must
initialize the obstack by calling obstack_init.
Here are two examples of how to allocate the space for an obstack and initialize it. First,
an obstack that is a static variable:
static struct obstack myobstack;
...
obstack_init (&myobstack);
obstack_init (myobstack_ptr);
obstack_alloc_failed_handler [Variable]
The value of this variable is a pointer to a function that obstack uses when obstack_
chunk_alloc fails to allocate memory. The default action is to print a message and
abort. You should supply a function that either calls exit (see Section 26.7 [Program
Termination], page 851) or longjmp (see Chapter 24 [Non-Local Exits], page 757) and
doesn’t return.
void my_obstack_alloc_failed (void)
...
obstack_alloc_failed_handler = &my_obstack_alloc_failed;
Chapter 3: Virtual Memory Allocation And Paging 66
For example, here is a function that allocates a copy of a string str in a specific obstack,
which is in the variable string_obstack:
struct obstack string_obstack;
char *
copystring (char *string)
{
size_t len = strlen (string) + 1;
char *s = (char *) obstack_alloc (&string_obstack, len);
memcpy (s, string, len);
return s;
}
To allocate a block with specified contents, use the function obstack_copy, declared like
this:
Note that if object is a null pointer, the result is an uninitialized obstack. To free all
memory in an obstack but leave it valid for further allocation, call obstack_free with the
address of the first object allocated on the obstack:
obstack_free (obstack_ptr, first_object_allocated_ptr);
Recall that the objects in an obstack are grouped into chunks. When all the objects in
a chunk become free, the obstack library automatically frees the chunk (see Section 3.2.6.2
[Preparing for Using Obstacks], page 64). Then other obstacks, or non-obstack allocation,
can reuse the space of the chunk.
ordinary call uses the macro definition by default, but you can request the function definition
instead by writing the function name in parentheses, as shown here:
char *x;
void *(*funcp) ();
/* Use the macro. */
x = (char *) obstack_alloc (obptr, size);
/* Call the function. */
x = (char *) (obstack_alloc) (obptr, size);
/* Take the address of the function. */
funcp = obstack_alloc;
This is the same situation that exists in ISO C for the standard library functions. See
Section 1.3.2 [Macro Definitions of Functions], page 13.
Warning: When you do use the macros, you must observe the precaution of avoiding
side effects in the first operand, even in ISO C.
If you use the GNU C compiler, this precaution is not necessary, because various language
extensions in GNU C permit defining the macros so as to compute each argument only once.
If you have started growing an object and wish to cancel it, you should finish it and then
free it, like this:
obstack_free (obstack_ptr, obstack_finish (obstack_ptr));
While you know there is room, you can use these fast growth functions for adding data
to a growing object:
When you check for space using obstack_room and there is not enough room for what
you want to add, the fast growth functions are not safe. In this case, simply use the
corresponding ordinary growth function instead. Very soon this will copy the object to a
new chunk; then there will be lots of room available again.
So, each time you use an ordinary growth function, check afterward for sufficient space
using obstack_room. Once the object is copied to a new chunk, there will be plenty of
space again, so the program will start using the fast growth functions again.
Here is an example:
void
add_string (struct obstack *obstack, const char *ptr, int len)
{
while (len > 0)
{
int room = obstack_room (obstack);
if (room == 0)
{
/* Not enough room. Add one character slowly,
which may copy to a new chunk and make room. */
obstack_1grow (obstack, *ptr++);
len--;
}
else
{
if (room > len)
room = len;
/* Add fast as much as we have room for. */
len -= room;
while (room-- > 0)
obstack_1grow_fast (obstack, *ptr++);
}
}
}
Note that a change in alignment mask does not take effect until after the next time an
object is allocated or finished in the obstack. If you are not growing an object, you can
make the new alignment mask take effect immediately by calling obstack_finish. This
will finish a zero-length object and then do proper alignment for the next object.
Do not use alloca inside the arguments of a function call—you will get unpredictable
results, because the stack space for the alloca would appear on the stack in the middle
of the space for the function arguments. An example of what to avoid is foo (x, alloca
(4), y).
• Some non-GNU systems fail to support alloca, so it is less portable. However, a slower
emulation of alloca written in C is available for use on systems with this deficiency.
The return value is zero on success. On failure, the return value is -1 and errno is
set accordingly. The following errno values are specific to this function:
ENOMEM The request would cause the data segment to overlap another segment or
exceed the process’ data storage limit.
ENOMEM The system was not able to allocate resources to fulfill the request. This
can happen if there is not enough physical memory in the system for the
allocation of backing storage. The error can also occur if the new protec-
tion flags would cause the memory region to be split from its neighbors,
and the process limit for the number of such distinct memory regions
would be exceeded.
EINVAL address is not properly aligned to a page boundary for the mapping, or
length (after rounding up to the system page size) is not a multiple of
the applicable page size for the mapping, or the combination of flags in
protection is not valid.
EACCES The file for a file-based mapping was not opened with open flags which
are compatible with protection.
EPERM The system security policy does not allow a mapping with the specified
flags. For example, mappings which are both PROT_EXEC and PROT_WRITE
at the same time might not be allowed.
New threads and subprocesses inherit the access rights of the current thread. If a pro-
tection key is allocated subsequently, existing threads (except the current) will use an
unspecified system default for the access rights associated with newly allocated keys.
Upon entering a signal handler, the system resets the access rights of the current thread
so that pages with the default key can be accessed, but the access rights for other protection
keys are unspecified.
Applications are expected to allocate a key once using pkey_alloc, and apply the key
to memory regions which need special protection with pkey_mprotect:
int key = pkey_alloc (0, PKEY_DISABLE_ACCESS);
if (key < 0)
/* Perform error checking, including fallback for lack of support. */
...;
If the key allocation fails due to lack of support for memory protection keys, the pkey_
mprotect call can usually be skipped. In this case, the region will not be protected by
default. It is also possible to call pkey_mprotect with a key value of −1, in which case it
will behave in the same way as mprotect.
After key allocation assignment to memory pages, pkey_set can be used to temporarily
acquire access to the memory region and relinquish it again:
if (key >= 0 && pkey_set (key, 0) < 0)
...; /* Perform error checking (generally fatal). */
/* At this point, the current thread has read-write access to the
memory region. */
...
/* Revoke access again. */
if (key >= 0 && pkey_set (key, PKEY_DISABLE_ACCESS) < 0)
...; /* Perform error checking (generally fatal). */
Chapter 3: Virtual Memory Allocation And Paging 81
In this example, a negative key value indicates that no key had been allocated, which
means that the system lacks support for memory protection keys and it is not necessary to
change the the access rights of the current thread (because it always has access).
Compared to using mprotect to change the page protection flags, this approach has
two advantages: It is thread-safe in the sense that the access rights are only changed for
the current thread, so another thread which changes its own access rights concurrently to
gain access to the mapping will not suddenly see its access rights revoked. And pkey_set
typically does not involve a call into the kernel and a context switch, so it is more efficient.
Some systems use memory protection keys to emulate certain combinations of pro-
tection flags. Under such circumstances, specifying an explicit protection key may
behave as if additional flags have been specified in protection, even though this does
not happen with the default protection key. For example, some systems can support
PROT_EXEC-only mappings only with a default protection key, and memory with a key
which was allocated using pkey_alloc will still be readable if PROT_EXEC is specified
without PROT_READ.
If key is −1, the default protection key is applied to the mapping, just as if mprotect
had been called.
The pkey_mprotect function returns 0 on success and −1 on failure. The same errno
error conditions as for mprotect are defined for this function, with the following
addition:
EINVAL The key argument is not −1 or a valid memory protection key allocated
using pkey_alloc.
ENOSYS The system does not implement memory protection keys, and key is not
−1.
Return the access rights of the current thread for memory pages with protection key
key. The return value is zero or a combination of the PKEY_DISABLE_* flags; see the
pkey_set function.
Calling the pkey_get function with a protection key which was not allocated by
pkey_alloc results in undefined behavior. This means that calling this function on
systems which do not support memory protection keys is undefined.
Be aware that when you lock a page, that’s one fewer page frame that can be used to
back other virtual memory (by the same or other processes), which can mean more page
faults, which means the system runs more slowly. In fact, if you lock enough memory, some
programs may not be able to run at all for lack of real memory.
A memory lock persists until the process that owns the memory explicitly unlocks it.
(But process termination and exec cause the virtual memory to cease to exist, which you
might say means it isn’t locked any more).
Memory locks are not inherited by child processes. (But note that on a modern Unix
system, immediately after a fork, the parent’s and the child’s virtual address space are
backed by the same real page frames, so the child enjoys the parent’s locks). See Section 27.4
[Creating a Process], page 857.
Because of its ability to impact other processes, only the superuser can lock a page. Any
process can unlock its own page.
The system sets limits on the amount of memory a process can have locked and the
amount of real memory it can have dedicated to it. See Section 23.2 [Limiting Resource
Usage], page 737.
In Linux, locked pages aren’t as locked as you might think. Two virtual pages that are
not shared memory can nonetheless be backed by the same real frame. The kernel does this
in the name of efficiency when it knows both virtual pages contain identical data, and does
it even if one or both of the virtual pages are locked.
But when a process modifies one of those pages, the kernel must get it a separate frame
and fill it with the page’s data. This is known as a copy-on-write page fault. It takes a
small amount of time and in a pathological case, getting that frame may require I/O.
To make sure this doesn’t happen to your program, don’t just lock the pages. Write
to them as well, unless you know you won’t write to them ever. And to make sure you
have pre-allocated frames for your stack, enter a scope that declares a C automatic variable
larger than the maximum stack size you will need, set it to something, then return from its
scope.
When the function fails, it does not affect the lock status of any pages.
The return value is zero if the function succeeds. Otherwise, it is -1 and errno is set
accordingly. errno values specific to this function are:
ENOMEM
• At least some of the specified address range does not exist in the
calling process’ virtual address space.
• The locking would cause the process to exceed its locked page limit.
EPERM The calling process is not superuser.
EINVAL len is not positive.
ENOSYS The kernel does not provide mlock capability.
int mlock2 (const void *addr, size_t len, unsigned int [Function]
flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to mlock. If flags is zero, a call to mlock2 behaves exactly as
the equivalent call to mlock.
The flags argument must be a combination of zero or more of the following flags:
MLOCK_ONFAULT
Only those pages in the specified address range which are already in
memory are locked immediately. Additional pages in the range are auto-
matically locked in case of a page fault and allocation of memory.
Like mlock, mlock2 returns zero on success and -1 on failure, setting errno accord-
ingly. Additional errno values defined for mlock2 are:
EINVAL The specified (non-zero) flags argument is not supported by this system.
You can lock all a process’ memory with mlockall. You unlock memory with munlock
or munlockall.
To avoid all page faults in a C program, you have to use mlockall, because some of the
memory a program uses is hidden from the C code, e.g. the stack and automatic variables,
and you wouldn’t know what address to tell mlock.
mlockall locks all the pages in a process’ virtual memory address space, and/or any
that are added to it in the future. This includes the pages of the code, data and
stack segment, as well as shared libraries, user space kernel data, shared memory, and
memory mapped files.
flags is a string of single bit flags represented by the following macros. They tell
mlockall which of its functions you want. All other bits must be zero.
MCL_CURRENT
Lock all pages which currently exist in the calling process’ virtual address
space.
MCL_FUTURE
Set a mode such that any pages added to the process’ virtual address
space in the future will be locked from birth. This mode does not affect
future address spaces owned by the same process so exec, which replaces
a process’ address space, wipes out MCL_FUTURE. See Section 27.6 [Exe-
cuting a File], page 859.
When the function returns successfully, and you specified MCL_CURRENT, all of the
process’ pages are backed by (connected to) real frames (they are resident) and are
marked to stay that way. This means the function may cause page-ins and have to
wait for them.
When the process is in MCL_FUTURE mode because it successfully executed this func-
tion and specified MCL_CURRENT, any system call by the process that requires space
be added to its virtual address space fails with errno = ENOMEM if locking the addi-
tional space would cause the process to exceed its locked page limit. In the case that
the address space addition that can’t be accommodated is stack expansion, the stack
expansion fails and the kernel sends a SIGSEGV signal to the process.
When the function fails, it does not affect the lock status of any pages or the future
locking mode.
The return value is zero if the function succeeds. Otherwise, it is -1 and errno is set
accordingly. errno values specific to this function are:
ENOMEM
• At least some of the specified address range does not exist in the
calling process’ virtual address space.
• The locking would cause the process to exceed its locked page limit.
EPERM The calling process is not superuser.
EINVAL Undefined bits in flags are not zero.
ENOSYS The kernel does not provide mlockall capability.
You can lock just specific pages with mlock. You unlock pages with munlockall and
munlock.
munlockall unlocks every page in the calling process’ virtual address space and turns
off MCL_FUTURE future locking mode.
The return value is zero if the function succeeds. Otherwise, it is -1 and errno is
set accordingly. The only way this function can fail is for generic reasons that all
functions and system calls can fail, so there are no specific errno values.
88
4 Character Handling
Programs that work with characters and strings often need to classify a character—is it
alphabetic, is it a digit, is it whitespace, and so on—and perform case conversion operations
on characters. The functions in the header file ctype.h are provided for this purpose.
Since the choice of locale and character set can alter the classifications of particular
character codes, all of these functions are affected by the current locale. (More precisely,
they are affected by the locale currently selected for character classification—the LC_CTYPE
category; see Section 7.3 [Locale Categories], page 187.)
The ISO C standard specifies two different sets of functions. The one set works on char
type characters, the other one on wchar_t wide characters (see Section 6.1 [Introduction to
Extended Characters], page 143).
To test the membership of a character to one of the non-standard classes the ISO C
standard defines a completely new function.
To make it easier to use the commonly-used classification functions, they are defined in
the C library. There is no need to use wctype if the property string is one of the known
character classes. In some situations it is desirable to construct the property strings, and
then it is important that wctype can also handle the standard classes.
It is declared in wctype.h.
It is declared in wctype.h.
Chapter 4: Character Handling 94
The GNU C Library also provides a function which is not defined in the ISO C standard
but which is available as a version for single byte characters as well.
Now, with the wctype and iswctype you can avoid the if cascades, but rewriting the
code as follows is wrong:
int
is_in_class (int c, const char *class)
{
wctype_t desc = wctype (class);
return desc ? iswctype ((wint_t) c, desc) : 0;
}
The problem is that it is not guaranteed that the wide character representation of a
single-byte character can be found using casting. In fact, usually this fails miserably. The
correct solution to this problem is to write the code as follows:
int
is_in_class (int c, const char *class)
{
wctype_t desc = wctype (class);
return desc ? iswctype (btowc (c), desc) : 0;
}
See Section 6.3.3 [Converting Single Characters], page 149, for more information on
btowc. Note that this change probably does not improve the performance of the program
a lot since the wctype function still has to make the string comparisons. It gets really
interesting if the is_in_class function is called more than once for the same class name.
In this case the variable desc could be computed once and reused for all the calls. Therefore
the above form of the function is probably not the final one.
For the generally available mappings, the ISO C standard defines convenient shortcuts
so that it is not necessary to call wctrans for them.
The same warnings given in the last section for the use of the wide character classification
functions apply here. It is not possible to simply cast a char type value to a wint_t and
use it as an argument to towctrans calls.
98
Arrays that are declared const cannot be modified either. It’s generally good style to
declare non-modifiable string pointers to be of type const char *, since this often allows
the C compiler to detect accidental modifications as well as providing some amount of
documentation about what your program intends to do with the string.
The amount of memory allocated for a byte array may extend past the null byte that
marks the end of the string that the array contains. In this document, the term allocated
size is always used to refer to the total amount of memory allocated for an array, while the
term length refers to the number of bytes up to (but not including) the terminating null
byte. Wide strings are similar, except their sizes and lengths count wide characters, not
bytes.
A notorious source of program bugs is trying to put more bytes into a string than fit
in its allocated size. When writing code that extends strings or moves bytes into a pre-
allocated array, you should be very careful to keep track of the length of the string and
make explicit checks for overflowing the array. Many of the library functions do not do this
for you! Remember also that you need to allocate an extra byte to hold the null byte that
marks the end of the string.
Originally strings were sequences of bytes where each byte represented a single character.
This is still true today if the strings are encoded using a single-byte character encoding.
Things are different if the strings are encoded using a multibyte encoding (for more informa-
tion on encodings see Section 6.1 [Introduction to Extended Characters], page 143). There
is no difference in the programming interface for these two kind of strings; the programmer
has to be aware of this and interpret the byte sequences accordingly.
But since there is no separate interface taking care of these differences the byte-based
string functions are sometimes hard to use. Since the count parameters of these functions
specify bytes a call to memcpy could cut a multibyte character in the middle and put an
incomplete (and therefore unusable) byte sequence in the target buffer.
To avoid these problems later versions of the ISO C standard introduce a second set of
functions which are operating on wide characters (see Section 6.1 [Introduction to Extended
Characters], page 143). These functions don’t have the problems the single-byte versions
have since every wide character is a legal, interpretable value. This does not mean that
cutting wide strings at arbitrary points is without problems. It normally is for alphabet-
based languages (except for non-normalized text) but languages based on syllables still have
the problem that more than one wide character is necessary to complete a logical unit. This
is a higher level problem which the C library functions are not designed to solve. But it is
at least good that no invalid byte sequences can be created. Also, the higher level functions
can also much more easily operate on wide characters than on multibyte characters so that
a common strategy is to use wide characters internally whenever text is more than simply
copied.
The remaining of this chapter will discuss the functions for handling wide strings in
parallel with the discussion of strings since there is almost always an exact equivalent
available.
Functions that operate on arbitrary blocks of memory have names beginning with ‘mem’
and ‘wmem’ (such as memcpy and wmemcpy) and invariably take an argument which specifies
the size (in bytes and wide characters respectively) of the block of memory to operate on.
The array arguments and return values for these functions have type void * or wchar_t *.
As a matter of style, the elements of the arrays used with the ‘mem’ functions are referred to
as “bytes”. You can pass any kind of pointer to these functions, and the sizeof operator
is useful in computing the value for the size argument. Parameters to the ‘wmem’ functions
must be of type wchar_t *. These functions are not really usable with anything but arrays
of this type.
In contrast, functions that operate specifically on strings and wide strings have names
beginning with ‘str’ and ‘wcs’ respectively (such as strcpy and wcscpy) and look for a
terminating null byte or null wide character instead of requiring an explicit size argument to
be passed. (Some of these functions accept a specified maximum length, but they also check
for premature termination.) The array arguments and return values for these functions have
type char * and wchar_t * respectively, and the array elements are referred to as “bytes”
and “wide characters”.
In many cases, there are both ‘mem’ and ‘str’/‘wcs’ versions of a function. The one that
is more appropriate to use depends on the exact situation. When your program is manipu-
lating arbitrary arrays or blocks of storage, then you should always use the ‘mem’ functions.
On the other hand, when you are manipulating strings it is usually more convenient to use
the ‘str’/‘wcs’ functions, unless you already know the length of the string in advance. The
‘wmem’ functions should be used for wide character arrays with known size.
Some of the memory and string functions take single characters as arguments. Since
a value of type char is automatically promoted into a value of type int when used as a
parameter, the functions are declared with int as the type of the parameter in question. In
case of the wide character functions the situation is similar: the parameter type for a single
wide character is wint_t and not wchar_t. This would for many implementations not be
necessary since wchar_t is large enough to not be automatically promoted, but since the
ISO C standard does not require such a choice of types the wint_t type is used.
sizeof (string)
⇒ 32
strlen (string)
⇒ 12
But beware, this will not work unless string is the array itself, not a pointer to it.
For example:
char string[32] = "hello, world";
char *ptr = string;
sizeof (string)
⇒ 32
sizeof (ptr)
⇒ 4 /* (on a machine with 4 byte pointers) */
This is an easy mistake to make when you are working with functions that take string
arguments; those arguments are always pointers, not arrays.
It must also be noted that for multibyte encoded strings the return value does not
have to correspond to the number of characters in the string. To get this value the
string can be converted to wide characters and wcslen can be used or something like
the following code can be used:
/* The input is in string.
The length is expected in n. */
{
mbstate_t t;
char *scopy = string;
/* In initial state. */
memset (&t, '\0', sizeof (t));
/* Determine number of characters. */
n = mbsrtowcs (NULL, &scopy, strlen (scopy), &t);
}
This is cumbersome to do so if the number of characters (as opposed to bytes) is
needed often it is better to work with wide characters.
to (strlen (s) < maxlen ? strlen (s) : maxlen) but it is more efficient and works
even if s is not null-terminated so long as maxlen does not exceed the size of s’s array.
char string[32] = "hello, world";
strnlen (string, 32)
⇒ 12
strnlen (string, 5)
⇒ 5
This function is part of POSIX.1-2008 and later editions, but was available in the
GNU C Library and other systems as an extension long before it was standardized.
It is declared in string.h.
Here is an example of how you might use memcpy to copy the contents of an array:
struct foo *oldarray, *newarray;
int arraysize;
...
memcpy (new, old, arraysize * sizeof (struct foo));
wto. But instead of returning the value of wto it returns a pointer to the wide
character following the last written wide character in the object beginning at wto.
I.e., the value is wto + size.
This function is useful in situations where a number of objects shall be copied to
consecutive memory positions.
The following is a possible implementation of wmemcpy but there are more optimiza-
tions possible.
wchar_t *
wmempcpy (wchar_t *restrict wto, const wchar_t *restrict wfrom,
size_t size)
{
return (wchar_t *) mempcpy (wto, wfrom, size * sizeof (wchar_t));
}
This function is a GNU extension.
void * memmove (void *to, const void *from, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
memmove copies the size bytes at from into the size bytes at to, even if those two
blocks of space overlap. In the case of overlap, memmove is careful to copy the original
values of the bytes in the block at from, including those bytes which also belong to
the block at to.
The value returned by memmove is the value of to.
This function copies no more than size bytes from from to to, stopping if a byte
matching c is found. The return value is a pointer into to one byte past where c was
copied, or a null pointer if no byte matching c appeared in the first size bytes of from.
void * memset (void *block, int c, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function copies the value of c (converted to an unsigned char) into each of the
first size bytes of the object beginning at block. It returns the value of block.
wchar_t * wmemset (wchar_t *block, wchar_t wc, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function copies the value of wc into each of the first size wide characters of the
object beginning at block. It returns the value of block.
char * strcpy (char *restrict to, const char *restrict [Function]
from)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This copies bytes from the string from (up to and including the terminating null
byte) into the string to. Like memcpy, this function has undefined results if the strings
overlap. The return value is the value of to.
wchar_t * wcscpy (wchar_t *restrict wto, const wchar_t [Function]
*restrict wfrom)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This copies wide characters from the wide string wfrom (up to and including the
terminating null wide character) into the string wto. Like wmemcpy, this function has
undefined results if the strings overlap. The return value is the value of wto.
char * strdup (const char *s) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This function copies the string s into a newly allocated string. The string is allocated
using malloc; see Section 3.2.3 [Unconstrained Allocation], page 47. If malloc cannot
allocate space for the new string, strdup returns a null pointer. Otherwise it returns
a pointer to the new string.
wchar_t * wcsdup (const wchar_t *ws) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This function copies the wide string ws into a newly allocated string. The string is al-
located using malloc; see Section 3.2.3 [Unconstrained Allocation], page 47. If malloc
cannot allocate space for the new string, wcsdup returns a null pointer. Otherwise it
returns a pointer to the new wide string.
This function is a GNU extension.
Chapter 5: String and Array Utilities 106
#include <string.h>
#include <stdio.h>
int
main (void)
{
char buffer[10];
char *to = buffer;
to = stpcpy (to, "foo");
to = stpcpy (to, "bar");
puts (buffer);
return 0;
}
This function is part of POSIX.1-2008 and later editions, but was available in the
GNU C Library and other systems as an extension long before it was standardized.
Its behavior is undefined if the strings overlap. The function is declared in string.h.
For obvious reasons strdupa is implemented only as a macro; you cannot get the
address of this function. Despite this limitation it is a useful function. The following
code shows a situation where using malloc would be a lot more expensive.
#include <paths.h>
#include <string.h>
#include <stdio.h>
int
main (void)
{
char *wr_path = strdupa (path);
char *cp = strtok (wr_path, ":");
void bcopy (const void *from, void *to, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This is a partially obsolete alternative for memmove, derived from BSD. Note that it
is not quite equivalent to memmove, because the arguments are not in the same order
and there is no return value.
size_t total = 1;
va_end (ap);
va_end (ap2);
return result;
}
This looks quite simple, especially the second loop where the strings are actually copied.
But these innocent lines hide a major performance penalty. Just imagine that ten strings
of 100 bytes each have to be concatenated. For the second string we search the already
stored 100 bytes for the end of the string so that we can append the next string. For all
strings in total the comparisons necessary to find the end of the intermediate results sums
up to 5500! If we combine the copying with the search for the allocation we can write this
function more efficiently:
char *
concat (const char *str, ...)
{
size_t allocated = 100;
char *result = malloc (allocated);
if (result != NULL)
{
va_list ap;
size_t resultlen = 0;
char *newp;
for (const char *s = str; s != NULL; s = va_arg (ap, const char *))
{
size_t len = strlen (s);
if (newp == NULL)
{
free (result);
return NULL;
}
result = newp;
}
va_end (ap);
}
return result;
}
With a bit more knowledge about the input strings one could fine-tune the memory
allocation. The difference we are pointing to here is that we don’t use strcat anymore. We
always keep track of the length of the current intermediate result so we can save ourselves
the search for the end of the string and use mempcpy. Please note that we also don’t use
stpcpy which might seem more natural since we are handling strings. But this is not
necessary since we already know the length of the string and therefore can use the faster
memory copying function. The example would work for wide characters the same way.
Whenever a programmer feels the need to use strcat she or he should think twice and
look through the program to see whether the code cannot be rewritten to take advantage of
already calculated results. The related functions strlcat, strncat, wcscat and wcsncat
are almost always unnecessary, too. Again: it is almost always unnecessary to use functions
like strcat.
This function is similar to strcpy but always copies exactly size bytes into to.
If from does not contain a null byte in its first size bytes, strncpy copies just the first
size bytes. In this case no null terminator is written into to.
Otherwise from must be a string with length less than size. In this case strncpy
copies all of from, followed by enough null bytes to add up to size bytes in all.
The behavior of strncpy is undefined if the strings overlap.
This function was designed for now-rarely-used arrays consisting of non-null bytes
followed by zero or more null bytes. It needs to set all size bytes of the destination,
even when size is much greater than the length of from. As noted below, this function
is generally a poor choice for processing strings.
wchar_t * wcsncpy (wchar_t *restrict wto, const wchar_t [Function]
*restrict wfrom, size_t size)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to wcscpy but always copies exactly size wide characters into
wto.
If wfrom does not contain a null wide character in its first size wide characters, then
wcsncpy copies just the first size wide characters. In this case no null terminator is
written into wto.
Otherwise wfrom must be a wide string with length less than size. In this case wcsncpy
copies all of wfrom, followed by enough null wide characters to add up to size wide
characters in all.
The behavior of wcsncpy is undefined if the strings overlap.
This function is the wide-character counterpart of strncpy and suffers from most
of the problems that strncpy does. For example, as noted below, this function is
generally a poor choice for processing strings.
char * strndup (const char *s, size_t size) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This function is similar to strdup but always copies at most size bytes into the newly
allocated string.
If the length of s is more than size, then strndup copies just the first size bytes and
adds a closing null byte. Otherwise all bytes are copied and the string is terminated.
This function differs from strncpy in that it always terminates the destination string.
As noted below, this function is generally a poor choice for processing strings.
strndup is a GNU extension.
char * strndupa (const char *s, size_t size) [Macro]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to strndup but like strdupa it allocates the new string using
alloca see Section 3.2.7 [Automatic Storage with Variable Size], page 75. The same
advantages and limitations of strdupa are valid for strndupa, too.
Chapter 5: String and Array Utilities 112
This function is implemented only as a macro, just like strdupa. Just as strdupa
this macro also must not be used inside the parameter list in a function call.
As noted below, this function is generally a poor choice for processing strings.
strndupa is only available if GNU CC is used.
This function copies the string from to the destination array to, limiting the result’s
size (including the null terminator) to size. The caller should ensure that size includes
room for the result’s terminating null byte.
If size is greater than the length of the string from, this function copies the non-null
bytes of the string from to the destination array to, and terminates the copy with
a null byte. Like other string functions such as strcpy, but unlike strncpy, any
remaining bytes in the destination array remain unchanged.
If size is nonzero and less than or equal to the the length of the string from, this
function copies only the first ‘size - 1’ bytes to the destination array to, and writes
a terminating null byte to the last byte of the array.
This function returns the length of the string from. This means that truncation occurs
if and only if the returned value is greater than or equal to size.
The behavior is undefined if to or from is a null pointer, or if the destination array’s
size is less than size, or if the string from overlaps the first size bytes of the destination
array.
As noted below, this function is generally a poor choice for processing strings. Also,
this function has a performance issue, as its time cost is proportional to the length of
from even when size is small.
This function is derived from OpenBSD 2.4.
As noted below, this function is generally a poor choice for processing strings. Also,
this function has significant performance issues. See Section 5.5 [Concatenating
Strings], page 107.
This function is derived from OpenBSD 2.4.
size_t wcslcat (wchar_t *restrict to, const wchar_t [Function]
*restrict from, size_t size)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is a variant of strlcat for wide strings. The size argument counts the
length of the destination buffer in wide characters (and not bytes).
This function is derived from BSD.
Because these functions can abruptly truncate strings or wide strings, they are generally
poor choices for processing them. When copying or concatening multibyte strings, they
can truncate within a multibyte character so that the result is not a valid multibyte string.
When combining or concatenating multibyte or wide strings, they may truncate the output
after a combining character, resulting in a corrupted grapheme. They can cause bugs even
when processing single-byte strings: for example, when calculating an ASCII-only user
name, a truncated name can identify the wrong user.
Although some buffer overruns can be prevented by manually replacing calls to copying
functions with calls to truncation functions, there are often easier and safer automatic
techniques, such as fortification (see Section D.2 [Fortification of function calls], page 1177)
and AddressSanitizer (see Section “Program Instrumentation Options” in Using GCC).
Because truncation functions can mask application bugs that would otherwise be caught
by the automatic techniques, these functions should be used only when the application’s
underlying logic requires truncation.
Note: GNU programs should not truncate strings or wide strings to fit arbitrary size
limits. See Section “Writing Robust Programs” in The GNU Coding Standards. Instead
of string-truncation functions, it is usually better to use dynamic memory allocation (see
Section 3.2.3 [Unconstrained Allocation], page 47) and functions such as strdup or asprintf
to construct strings.
int memcmp (const void *a1, const void *a2, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The function memcmp compares the size bytes of memory beginning at a1 against
the size bytes of memory beginning at a2. The value returned has the same sign as
the difference between the first differing pair of bytes (interpreted as unsigned char
objects, then promoted to int).
If the contents of the two blocks are equal, memcmp returns 0.
int wmemcmp (const wchar_t *a1, const wchar_t *a2, size_t [Function]
size)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The function wmemcmp compares the size wide characters beginning at a1 against the
size wide characters beginning at a2. The value returned is smaller than or larger
than zero depending on whether the first differing wide character is a1 is smaller or
larger than the corresponding wide character in a2.
If the contents of the two blocks are equal, wmemcmp returns 0.
On arbitrary arrays, the memcmp function is mostly useful for testing equality. It usually
isn’t meaningful to do byte-wise ordering comparisons on arrays of things other than bytes.
For example, a byte-wise comparison on the bytes that make up floating-point numbers isn’t
likely to tell you anything about the relationship between the values of the floating-point
numbers.
wmemcmp is really only useful to compare arrays of type wchar_t since the function looks
at sizeof (wchar_t) bytes at a time and this number of bytes is system dependent.
You should also be careful about using memcmp to compare objects that can contain
“holes”, such as the padding inserted into structure objects to enforce alignment require-
ments, extra space at the end of unions, and extra bytes at the ends of strings whose
length is less than their allocated size. The contents of these “holes” are indeterminate and
may cause strange behavior when performing byte-wise comparisons. For more predictable
results, perform an explicit component-wise comparison.
For example, given a structure type definition like:
struct foo
{
unsigned char tag;
union
{
double f;
long i;
char *p;
} value;
};
you are better off writing a specialized comparison function to compare struct foo objects
instead of comparing them with memcmp.
int strcmp (const char *s1, const char *s2) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 5: String and Array Utilities 117
The strcmp function compares the string s1 against s2, returning a value that has
the same sign as the difference between the first differing pair of bytes (interpreted
as unsigned char objects, then promoted to int).
If the two strings are equal, strcmp returns 0.
A consequence of the ordering used by strcmp is that if s1 is an initial substring of
s2, then s1 is considered to be “less than” s2.
strcmp does not take sorting conventions of the language the strings are written in
into account. To get that one has to use strcoll.
int wcscmp (const wchar_t *ws1, const wchar_t *ws2) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The wcscmp function compares the wide string ws1 against ws2. The value returned
is smaller than or larger than zero depending on whether the first differing wide
character is ws1 is smaller or larger than the corresponding wide character in ws2.
If the two strings are equal, wcscmp returns 0.
A consequence of the ordering used by wcscmp is that if ws1 is an initial substring of
ws2, then ws1 is considered to be “less than” ws2.
wcscmp does not take sorting conventions of the language the strings are written in
into account. To get that one has to use wcscoll.
int strcasecmp (const char *s1, const char *s2) [Function]
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
This function is like strcmp, except that differences in case are ignored, and its
arguments must be multibyte strings. How uppercase and lowercase characters are
related is determined by the currently selected locale. In the standard "C" locale the
characters Ä and ä do not match but in a locale which regards these characters as
parts of the alphabet they do match.
strcasecmp is derived from BSD.
int wcscasecmp (const wchar_t *ws1, const wchar_t *ws2) [Function]
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
This function is like wcscmp, except that differences in case are ignored. How up-
percase and lowercase characters are related is determined by the currently selected
locale. In the standard "C" locale the characters Ä and ä do not match but in a locale
which regards these characters as parts of the alphabet they do match.
wcscasecmp is a GNU extension.
int strncmp (const char *s1, const char *s2, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is the similar to strcmp, except that no more than size bytes are
compared. In other words, if the two strings are the same in their first size bytes, the
return value is zero.
Chapter 5: String and Array Utilities 118
int strncasecmp (const char *s1, const char *s2, size_t n) [Function]
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
This function is like strncmp, except that differences in case are ignored, and the
compared parts of the arguments should consist of valid multibyte characters. Like
strcasecmp, it is locale dependent how uppercase and lowercase characters are re-
lated.
strncasecmp is a GNU extension.
Here are some examples showing the use of strcmp and strncmp (equivalent examples
can be constructed for the wide character functions). These examples assume the use of
the ASCII character set. (If some other character set—say, EBCDIC—is used instead, then
the glyphs are associated with different numeric codes, and the return values and ordering
may differ.)
strcmp ("hello", "hello")
⇒ 0 /* These two strings are the same. */
strcmp ("hello", "Hello")
⇒ 32 /* Comparisons are case-sensitive. */
strcmp ("hello", "world")
⇒ -15 /* The byte 'h' comes before 'w'. */
strcmp ("hello", "hello, world")
⇒ -44 /* Comparing a null byte against a comma. */
strncmp ("hello", "hello, world", 5)
⇒ 0 /* The initial 5 bytes are the same. */
strncmp ("hello, world", "hello, stupid world!!!", 5)
⇒ 0 /* The initial 5 bytes are the same. */
The treatment of leading zeros and the tie-breaking extension characters (which in ef-
fect propagate across non-digit/digit sequence boundaries) differs from other version-
comparison algorithms.
strverscmp ("no digit", "no digit")
⇒ 0 /* same behavior as strcmp. */
strverscmp ("item#99", "item#100")
⇒ <0 /* same prefix, but 99 < 100. */
strverscmp ("alpha1", "alpha001")
⇒ >0 /* different number of leading zeros (0 and 2). */
strverscmp ("part1_f012", "part1_f01")
⇒ >0 /* lexicographical comparison with leading zeros. */
strverscmp ("foo.009", "foo.0")
⇒ <0 /* different number of leading zeros (2 and 1). */
int bcmp (const void *a1, const void *a2, size_t size) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This is an obsolete alias for memcmp, derived from BSD.
Here is an example of sorting an array of strings, using strcoll to compare them. The
actual sort algorithm is not written here; it comes from qsort (see Section 9.3 [Array Sort
Function], page 232). The job of the code shown here is to say how to compare the strings
Chapter 5: String and Array Utilities 121
while sorting them. (Later on in this section, we will show a way to do this more efficiently
using strxfrm.)
/* This is the comparison function used with qsort. */
int
compare_elements (const void *v1, const void *v2)
{
char * const *p1 = v1;
char * const *p2 = v2;
void
sort_strings (char **array, int nstrings)
{
/* Sort temp_array by comparing the strings. */
qsort (array, nstrings,
sizeof (char *), compare_elements);
}
The function wcsxfrm transforms wide string wfrom using the collation transforma-
tion determined by the locale currently selected for collation, and stores the trans-
formed string in the array wto. Up to size wide characters (including a terminating
null wide character) are stored.
The behavior is undefined if the strings wto and wfrom overlap; see Section 5.4
[Copying Strings and Arrays], page 102.
The return value is the length of the entire transformed wide string. This value is
not affected by the value of size, but if it is greater or equal than size, it means that
the transformed wide string did not entirely fit in the array wto. In this case, only
as much of the wide string as actually fits was stored. To get the whole transformed
wide string, call wcsxfrm again with a bigger output array.
The transformed wide string may be longer than the original wide string, and it may
also be shorter.
If size is zero, no wide characters are stored in to. In this case, wcsxfrm simply
returns the number of wide characters that would be the length of the transformed
wide string. This is useful for determining what size the allocated array should be
(remember to multiply with sizeof (wchar_t)). It does not matter what wto is if
size is zero; wto may even be a null pointer.
Here is an example of how you can use strxfrm when you plan to do many comparisons.
It does the same thing as the previous example, but much faster, because it has to transform
each string only once, no matter how many times it is compared with other strings. Even
the time needed to allocate and free storage is much less than the time we save, when there
are many strings.
struct sorter { char *input; char *transformed; };
int
compare_elements (const void *v1, const void *v2)
{
const struct sorter *p1 = v1;
const struct sorter *p2 = v2;
void
sort_strings_fast (char **array, int nstrings)
{
struct sorter temp_array[nstrings];
int i;
char *transformed;
size_t transformed_length;
temp_array[i].input = array[i];
/* Transform array[i]. */
transformed_length = strxfrm (transformed, array[i], length);
temp_array[i].transformed = transformed;
}
sizeof *transformed);
wcschrnul is the same as wcschr except that if it does not find the wide character,
it returns a pointer to the wide string’s terminating null wide character rather than
a null pointer.
This function is a GNU extension.
One useful, but unusual, use of the strchr function is when one wants to have a pointer
pointing to the null byte terminating a string. This is often written in this way:
s += strlen (s);
This is almost optimal but the addition operation duplicated a bit of the work already done
in the strlen function. A better solution is this:
s = strchr (s, '\0');
There is no restriction on the second parameter of strchr so it could very well also be
zero. Those readers thinking very hard about this might now point out that the strchr
function is more expensive than the strlen function since we have two abort criteria. This
is right. But in the GNU C Library the implementation of strchr is optimized in a special
way so that strchr actually is faster.
The wcspbrk (“wide character string pointer break”) function is related to wcscspn,
except that it returns a pointer to the first wide character in wstring that is a member
of the set stopset instead of the length of the initial substring. It returns a null pointer
if no such wide character from stopset is found.
On the next call to strtok, the searching begins at the next byte beyond the one
that marked the end of the previous token. Note that the set of delimiters delimiters
do not have to be the same on every call in a series of calls to strtok.
If the end of the string newstring is reached, or if the remainder of string consists
only of delimiter bytes, strtok returns a null pointer.
In a multibyte string, characters consisting of more than one byte are not treated as
single entities. Each byte is treated separately. The function is not locale-dependent.
wchar_t * wcstok (wchar_t *newstring, const wchar_t [Function]
*delimiters, wchar_t **save_ptr)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
A string can be split into tokens by making a series of calls to the function wcstok.
The string to be split up is passed as the newstring argument on the first call only.
The wcstok function uses this to set up some internal state information. Subsequent
calls to get additional tokens from the same wide string are indicated by passing a
null pointer as the newstring argument, which causes the pointer previously stored
in save ptr to be used instead.
The delimiters argument is a wide string that specifies a set of delimiters that may
surround the token being extracted. All the initial wide characters that are members
of this set are discarded. The first wide character that is not a member of this set of
delimiters marks the beginning of the next token. The end of the token is found by
looking for the next wide character that is a member of the delimiter set. This wide
character in the original wide string newstring is overwritten by a null wide character,
the pointer past the overwritten wide character is saved in save ptr, and the pointer
to the beginning of the token in newstring is returned.
On the next call to wcstok, the searching begins at the next wide character beyond
the one that marked the end of the previous token. Note that the set of delimiters
delimiters do not have to be the same on every call in a series of calls to wcstok.
If the end of the wide string newstring is reached, or if the remainder of string consists
only of delimiter wide characters, wcstok returns a null pointer.
Warning: Since strtok and wcstok alter the string they is parsing, you should always
copy the string to a temporary buffer before parsing it with strtok/wcstok (see Section 5.4
[Copying Strings and Arrays], page 102). If you allow strtok or wcstok to modify a string
that came from another part of your program, you are asking for trouble; that string might
be used for other purposes after strtok or wcstok has modified it, and it would not have
the expected value.
The string that you are operating on might even be a constant. Then when strtok
or wcstok tries to modify it, your program will get a fatal signal for writing in read-only
memory. See Section 25.2.1 [Program Error Signals], page 768. Even if the operation of
strtok or wcstok would not require a modification of the string (e.g., if there is exactly
one token) the string can (and in the GNU C Library case will) be modified.
This is a special case of a general principle: if a part of a program does not have as its
purpose the modification of a certain data structure, then it is error-prone to modify the
data structure temporarily.
Chapter 5: String and Array Utilities 131
The function strtok is not reentrant, whereas wcstok is. See Section 25.4.6 [Signal Han-
dling and Nonreentrant Functions], page 789, for a discussion of where and why reentrancy
is important.
Here is a simple example showing the use of strtok.
#include <string.h>
#include <stddef.h>
...
...
of bytes from delimiter. This means that a program normally should test for strsep
returning an empty string before processing it.
This function was introduced in 4.3BSD and therefore is widely available.
Here is how the above example looks like when strsep is used.
#include <string.h>
#include <stddef.h>
...
...
int
main (int argc, char *argv[])
{
char *prog = basename (argv[0]);
if (argc < 2)
{
fprintf (stderr, "Usage %s <arg>\n", prog);
exit (1);
}
...
Chapter 5: String and Array Utilities 133
}
Portability Note: This function may produce different results on different systems.
int
main (int argc, char *argv[])
{
char *prog;
char *path = strdupa (argv[0]);
if (argc < 2)
{
fprintf (stderr, "Usage %s <arg>\n", prog);
exit (1);
}
...
#include <string.h>
Portability Note: This function first appeared in OpenBSD 5.5 and has not been
standardized. Other systems may provide the same functionality under a different
name, such as explicit_memset, memset_s, or SecureZeroMemory.
The GNU C Library declares this function in string.h, but on other systems it may
be in strings.h instead.
memfrob a second time on the same data returns it to its original state.
Portability Note: This function is unique to the GNU C Library. It is declared in
string.h.
n = (n << 8) | *in++;
len -= 4;
p = stpcpy (cp, l64a (htonl (n)));
cp = mempcpy (p, "......", 6 - (p - cp));
}
if (len > 0)
{
unsigned long int n = *in++;
if (--len > 0)
{
n = (n << 8) | *in++;
if (--len > 0)
n = (n << 8) | *in;
}
cp = stpcpy (cp, l64a (htonl (n)));
}
*cp = '\0';
return out;
}
It is strange that the library does not provide the complete functionality needed but
so be it.
To decode data produced with l64a the following function should be used.
The l64a and a64l functions use a base 64 encoding, in which each byte of an encoded
string represents six bits of an input word. These symbols are used for the base 64 digits:
0 1 2 3 4 5 6 7
0 . / 0 1 2 3 4 5
8 6 7 8 9 A B C D
16 E F G H I J K L
24 M N O P Q R S T
32 U V W X Y Z a b
40 c d e f g h i j
48 k l m n o p q r
56 s t u v w x y z
This encoding scheme is not standard. There are some other encoding methods which
are much more widely used (UU encoding, MIME encoding). Generally, it is better to use
one of these encodings.
Chapter 5: String and Array Utilities 138
The argz_extract function converts the argz vector argz and argz len into a Unix-
style argument vector stored in argv, by putting pointers to every element in argz into
successive positions in argv, followed by a terminator of 0. Argv must be pre-allocated
with enough space to hold all the elements in argz plus the terminating (char *)0
((argz_count (argz, argz_len) + 1) * sizeof (char *) bytes should be enough).
Note that the string pointers stored into argv point into argz—they are not copies—
and so argz must be copied if it will be changed while argv is still active. This
function is useful for passing the elements in argz to an exec function (see Section 27.6
[Executing a File], page 859).
void argz_stringify (char *argz, size_t len, int sep) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The argz_stringify converts argz into a normal string with the elements separated
by the byte sep, by replacing each '\0' inside argz (except the last one, which
terminates the string) with sep. This is handy for printing argz in a readable manner.
error_t argz_add (char **argz, size_t *argz_len, const [Function]
char *str)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The argz_add function adds the string str to the end of the argz vector *argz, and
updates *argz and *argz_len accordingly.
error_t argz_add_sep (char **argz, size_t *argz_len, const [Function]
char *str, int delim)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The argz_add_sep function is similar to argz_add, but str is split into separate
elements in the result at occurrences of the byte delim. This is useful, for instance,
for adding the components of a Unix search path to an argz vector, by using a value
of ':' for delim.
error_t argz_append (char **argz, size_t *argz_len, const [Function]
char *buf, size_t buf_len)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The argz_append function appends buf len bytes starting at buf to the argz vector
*argz, reallocating *argz to accommodate it, and adding buf len to *argz_len.
void argz_delete (char **argz, size_t *argz_len, char [Function]
*entry)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
If entry points to the beginning of one of the elements in the argz vector *argz, the
argz_delete function will remove this entry and reallocate *argz, modifying *argz
and *argz_len accordingly. Note that as destructive argz functions usually reallocate
their argz argument, pointers into argz vectors such as entry will then become invalid.
Chapter 5: String and Array Utilities 140
If no '=' bytes are present in an element, that element is considered the name of a
“null” entry, as distinct from an entry with an empty value: envz_get will return 0 if given
the name of null entry, whereas an entry with an empty value would result in a value of
""; envz_entry will still find such entries, however. Null entries can be removed with the
envz_strip function.
As with argz functions, envz functions that may allocate memory (and thus fail) have a
return type of error_t, and return either 0 or ENOMEM.
These functions are declared in the standard include file envz.h.
char * envz_entry (const char *envz, size_t envz_len, [Function]
const char *name)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The envz_entry function finds the entry in envz with the name name, and returns a
pointer to the whole entry—that is, the argz element which begins with name followed
by a '=' byte. If there is no entry with that name, 0 is returned.
char * envz_get (const char *envz, size_t envz_len, const [Function]
char *name)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The envz_get function finds the entry in envz with the name name (like envz_entry),
and returns a pointer to the value portion of that entry (following the '='). If there
is no entry with that name (or only a null entry), 0 is returned.
error_t envz_add (char **envz, size_t *envz_len, const [Function]
char *name, const char *value)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The envz_add function adds an entry to *envz (updating *envz and *envz_len)
with the name name, and value value. If an entry with the same name already exists
in envz, it is removed first. If value is 0, then the new entry will be the special null
type of entry (mentioned above).
error_t envz_merge (char **envz, size_t *envz_len, const [Function]
char *envz2, size_t envz2_len, int override)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The envz_merge function adds each entry in envz2 to envz, as if with envz_add,
updating *envz and *envz_len. If override is true, then values in envz2 will supersede
those with the same name in envz, otherwise not.
Null entries are treated just like other entries in this respect, so a null entry in envz
can prevent an entry of the same name in envz2 from being added to envz, if override
is false.
void envz_strip (char **envz, size_t *envz_len) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 5: String and Array Utilities 142
The envz_strip function removes any null entries from envz, updating *envz and
*envz_len.
To represent wide characters the char type is not suitable. For this reason the ISO C
standard introduces a new type that is designed to keep one character of a wide character
string. To maintain the similarity there is also a type corresponding to int for those
functions that take a single wide character.
As there are for the char data type macros are available for specifying the minimum
and maximum value representable in an object of type wchar_t.
WEOF need not be the same value as EOF and unlike EOF it also need not be negative.
In other words, sloppy code like
{
int c;
...
while ((c = getc (fp)) < 0)
...
}
has to be rewritten to use WEOF explicitly when wide characters are used:
{
wint_t c;
...
while ((c = getwc (fp)) != WEOF)
...
}
This macro was introduced in Amendment 1 to ISO C90 and is defined in wchar.h.
These internal representations present problems when it comes to storage and transmit-
tal. Because each single wide character consists of more than one byte, they are affected by
byte-ordering. Thus, machines with different endianesses would see different values when
accessing the same data. This byte ordering concern also applies for communication pro-
tocols that are all byte-based and therefore require that the sender has to decide about
splitting the wide character in bytes. A last (but not least important) point is that wide
characters often require more storage space than a customized byte-oriented character set.
For all the above reasons, an external encoding that is different from the internal encoding
is often used if the latter is UCS-2 or UCS-4. The external encoding is byte-based and can
be chosen appropriately for the environment and for the texts to be handled. A variety of
different character sets can be used for this external encoding (information that will not
be exhaustively presented here–instead, a description of the major groups will suffice). All
of the ASCII-based character sets fulfill one requirement: they are "filesystem safe." This
means that the character '/' is used in the encoding only to represent itself. Things are a
bit different for character sets like EBCDIC (Extended Binary Coded Decimal Interchange
Code, a character set family used by IBM), but if the operating system does not understand
EBCDIC directly the parameters-to-system calls have to be converted first anyhow.
• The simplest character sets are single-byte character sets. There can be only up to
256 characters (for 8 bit character sets), which is not sufficient to cover all languages
but might be sufficient to handle a specific text. Handling of a 8 bit character sets is
simple. This is not true for other kinds presented later, and therefore, the application
one uses might require the use of 8 bit character sets.
• The ISO 2022 standard defines a mechanism for extended character sets where one
character can be represented by more than one byte. This is achieved by associating a
state with the text. Characters that can be used to change the state can be embedded
in the text. Each byte in the text might have a different interpretation in each state.
The state might even influence whether a given byte stands for a character on its own
or whether it has to be combined with some more bytes.
In most uses of ISO 2022 the defined character sets do not allow state changes that
cover more than the next character. This has the big advantage that whenever one
can identify the beginning of the byte sequence of a character one can interpret a text
Chapter 6: Character Set Handling 146
correctly. Examples of character sets using this policy are the various EUC character
sets (used by Sun’s operating systems, EUC-JP, EUC-KR, EUC-TW, and EUC-CN)
or Shift JIS (SJIS, a Japanese encoding).
But there are also character sets using a state that is valid for more than one character
and has to be changed by another byte sequence. Examples for this are ISO-2022-JP,
ISO-2022-KR, and ISO-2022-CN.
• Early attempts to fix 8 bit character sets for other languages using the Roman alphabet
lead to character sets like ISO 6937. Here bytes representing characters like the acute
accent do not produce output themselves: one has to combine them with other charac-
ters to get the desired result. For example, the byte sequence 0xc2 0x61 (non-spacing
acute accent, followed by lower-case ‘a’) to get the “small a with acute” character. To
get the acute accent character on its own, one has to write 0xc2 0x20 (the non-spacing
acute followed by a space).
Character sets like ISO 6937 are used in some embedded systems such as teletex.
• Instead of converting the Unicode or ISO 10646 text used internally, it is often also
sufficient to simply use an encoding different than UCS-2/UCS-4. The Unicode and
ISO 10646 standards even specify such an encoding: UTF-8. This encoding is able to
represent all of ISO 10646 31 bits in a byte string of length one to six.
There were a few other attempts to encode ISO 10646 such as UTF-7, but UTF-8 is
today the only encoding that should be used. In fact, with any luck UTF-8 will soon be
the only external encoding that has to be supported. It proves to be universally usable
and its only disadvantage is that it favors Roman languages by making the byte string
representation of other scripts (Cyrillic, Greek, Asian scripts) longer than necessary if
using a specific character set for these scripts. Methods like the Unicode compression
scheme can alleviate these problems.
The question remaining is: how to select the character set or encoding to use. The
answer: you cannot decide about it yourself, it is decided by the developers of the system
or the majority of the users. Since the goal is interoperability one has to use whatever the
other people one works with use. If there are no constraints, the selection is based on the
requirements the expected circle of users will have. In other words, if a project is expected
to be used in only, say, Russia it is fine to use KOI8-R or a similar character set. But if
at the same time people from, say, Greece are participating one should use a character set
that allows all people to collaborate.
The most widely useful solution seems to be: go with the most general character set,
namely ISO 10646. Use UTF-8 as the external encoding and problems about users not
being able to use their own language adequately are a thing of the past.
One final comment about the choice of the wide character representation is necessary
at this point. We have said above that the natural choice is using Unicode or ISO 10646.
This is not required, but at least encouraged, by the ISO C standard. The standard defines
at least a macro __STDC_ISO_10646__ that is only defined on systems where the wchar_t
type encodes ISO 10646 characters. If this symbol is not defined one should avoid making
assumptions about the wide character representation. If the programmer uses only the
functions provided by the C library to handle wide character strings there should be no
compatibility problems with other systems.
Chapter 6: Character Set Handling 147
The second family of functions got introduced in the early Unix standards (XPG2) and
is still part of the latest and greatest Unix standard: Unix 98. It is also the most powerful
and useful set of functions. But we will start with the functions defined in Amendment 1
to ISO C90.
• The character set assumed for the multibyte encoding is not specified as an argument
to the functions. Instead the character set specified by the LC_CTYPE category of the
current locale is used; see Section 7.3 [Locale Categories], page 187.
• The functions handling more than one character at a time require NUL terminated
strings as the argument (i.e., converting blocks of text does not work unless one can
add a NUL byte at an appropriate place). The GNU C Library contains some extensions
to the standard that allow specifying a size, but basically they also expect terminated
strings.
Despite these limitations the ISO C functions can be used in many contexts. In graphical
user interfaces, for instance, it is not uncommon to have functions that require text to be
displayed in a wide character string if the text is not simple ASCII. The text itself might
come from a file with translations and the user should decide about the current locale,
which determines the translation and therefore also the external encoding used. In such a
situation (and many others) the functions described here are perfect. If more freedom while
performing the conversion is necessary take a look at the iconv functions (see Section 6.5
[Generic Charset Conversion], page 165).
A characteristic of each multibyte character set is the maximum number of bytes that
can be necessary to represent one character. This information is quite important when
writing code that uses the conversion functions (as shown in the examples below). The
ISO C standard defines two macros that provide this information.
Chapter 6: Character Set Handling 148
Two different macros are necessary since strictly ISO C90 compilers do not allow variable
length array definitions, but still it is desirable to avoid dynamic allocation. This incomplete
piece of code shows the problem:
{
char buf[MB_LEN_MAX];
ssize_t len = 0;
To use objects of type mbstate_t the programmer has to define such objects (normally
as local variables on the stack) and pass a pointer to the object to the conversion functions.
This way the conversion function can update the object if the current multibyte character
set is stateful.
Chapter 6: Character Set Handling 149
There is no specific function or initializer to put the state object in any specific state.
The rules are that the object should always represent the initial state before the first use,
and this is achieved by clearing the whole variable with code such as follows:
{
mbstate_t state;
memset (&state, '\0', sizeof (state));
/* from now on state can be used. */
...
}
When using the conversion functions to generate output it is often necessary to test
whether the current state corresponds to the initial state. This is necessary, for example,
to decide whether to emit escape sequences to set the state to the initial state at certain
sequence points. Communication protocols often require this.
character set. In such a scenario, each ASCII character stands for itself, and all other
characters have at least a first byte that is beyond the range 0 to 127.
Despite the limitation that the single byte value is always interpreted in the initial state,
this function is actually useful most of the time. Most characters are either entirely single-
byte character sets or they are extensions to ASCII. But then it is possible to write code
like this (not that this specific example is very useful):
wchar_t *
itow (unsigned long int val)
{
static wchar_t buf[30];
wchar_t *wcp = &buf[29];
*wcp = L'\0';
while (val != 0)
{
*--wcp = btowc ('0' + val % 10);
val /= 10;
}
if (wcp == &buf[29])
*--wcp = L'0';
return wcp;
}
Why is it necessary to use such a complicated implementation and not simply cast '0'
+ val % 10 to a wide character? The answer is that there is no guarantee that one can
perform this kind of arithmetic on the character of the character set used for wchar_t
representation. In other situations the bytes are not constant at compile time and so the
compiler cannot do the work. In situations like this, using btowc is required.
There is also a function for the conversion in the other direction.
exactly one byte long, the return value of this function is this character. Otherwise
the return value is EOF.
wctob was introduced in Amendment 1 to ISO C90 and is declared in wchar.h.
There are more general functions to convert single characters from multibyte represen-
tation to wide characters and vice versa. These functions pose no limit on the length of the
multibyte representation and they also do not require it to be in the initial state.
size_t mbrtowc (wchar_t *restrict pwc, const char [Function]
*restrict s, size_t n, mbstate_t *restrict ps)
Preliminary: | MT-Unsafe race:mbrtowc/!ps | AS-Unsafe corrupt heap lock dlopen
| AC-Unsafe corrupt lock mem fd | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
The mbrtowc function (“multibyte restartable to wide character”) converts the next
multibyte character in the string pointed to by s into a wide character and stores it in
the location pointed to by pwc. The conversion is performed according to the locale
currently selected for the LC_CTYPE category. If the conversion for the character set
used in the locale requires a state, the multibyte string is interpreted in the state
represented by the object pointed to by ps. If ps is a null pointer, a static, internal
state variable used only by the mbrtowc function is used.
If the next multibyte character corresponds to the null wide character, the return
value of the function is 0 and the state object is afterwards in the initial state. If
the next n or fewer bytes form a correct multibyte character, the return value is the
number of bytes starting from s that form the multibyte character. The conversion
state is updated according to the bytes consumed in the conversion. In both cases
the wide character (either the L'\0' or the one found in the conversion) is stored in
the string pointed to by pwc if pwc is not null.
If the first n bytes of the multibyte string possibly form a valid multibyte character
but there are more than n bytes needed to complete it, the return value of the function
is (size_t) -2 and no value is stored in *pwc. The conversion state is updated and
all n input bytes are consumed and should not be submitted again. Please note that
this can happen even if n has a value greater than or equal to MB_CUR_MAX since the
input might contain redundant shift sequences.
If the first n bytes of the multibyte string cannot possibly form a valid multibyte
character, no value is stored, the global variable errno is set to the value EILSEQ,
and the function returns (size_t) -1. The conversion state is afterwards undefined.
As specified, the mbrtowc function could deal with multibyte sequences which contain
embedded null bytes (which happens in Unicode encodings such as UTF-16), but the
GNU C Library does not support such multibyte encodings. When encountering a null
input byte, the function will either return zero, or return (size_t) -1) and report
a EILSEQ error. The iconv function can be used for converting between arbitrary
encodings. See Section 6.5.1 [Generic Character Set Conversion Interface], page 165.
mbrtowc was introduced in Amendment 1 to ISO C90 and is declared in wchar.h.
A function that copies a multibyte string into a wide character string while at the same
time converting all lowercase characters into uppercase could look like this:
wchar_t *
Chapter 6: Character Set Handling 152
while (true)
{
wchar_t wc;
size_t nbytes = mbrtowc (&wc, s, len, &state);
if (nbytes == 0)
{
/* Terminate the result string. */
*wcp = L'\0';
break;
}
else if (nbytes == (size_t) -2)
{
/* Truncated input string. */
errno = EILSEQ;
free (result);
return NULL;
}
else if (nbytes == (size_t) -1)
{
/* Some other error (including EILSEQ). */
free (result);
return NULL;
}
else
{
/* A character was converted. */
*wcp++ = towupper (wc);
len -= nbytes;
s += nbytes;
}
}
return result;
}
In the inner loop, a single wide character is stored in wc, and the number of consumed
bytes is stored in the variable nbytes. If the conversion is successful, the uppercase variant
of the wide character is stored in the result array and the pointer to the input string and
the number of available bytes is adjusted. If the mbrtowc function returns zero, the null
input byte has not been converted, so it must be stored explicitly in the result.
The above code uses the fact that there can never be more wide characters in the
converted result than there are bytes in the multibyte input string. This method yields a
pessimistic guess about the size of the result, and if many wide character strings have to be
constructed this way or if the strings are long, the extra memory required to be allocated
because the input string contains multibyte characters might be significant. The allocated
Chapter 6: Character Set Handling 153
memory block can be resized to the correct size before returning it, but a better solution
might be to allocate just the right amount of space for the result right away. Unfortunately
there is no function to compute the length of the wide character string directly from the
multibyte string. There is, however, a function that does part of the work.
size_t mbrlen (const char *restrict s, size_t n, mbstate_t [Function]
*ps)
Preliminary: | MT-Unsafe race:mbrlen/!ps | AS-Unsafe corrupt heap lock dlopen
| AC-Unsafe corrupt lock mem fd | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
The mbrlen function (“multibyte restartable length”) computes the number of at most
n bytes starting at s, which form the next valid and complete multibyte character.
If the next multibyte character corresponds to the NUL wide character, the return
value is 0. If the next n bytes form a valid multibyte character, the number of bytes
belonging to this multibyte character byte sequence is returned.
If the first n bytes possibly form a valid multibyte character but the character is
incomplete, the return value is (size_t) -2. Otherwise the multibyte character se-
quence is invalid and the return value is (size_t) -1.
The multibyte sequence is interpreted in the state represented by the object pointed
to by ps. If ps is a null pointer, a state object local to mbrlen is used.
mbrlen was introduced in Amendment 1 to ISO C90 and is declared in wchar.h.
The attentive reader now will note that mbrlen can be implemented as
mbrtowc (NULL, s, n, ps != NULL ? ps : &internal)
This is true and in fact is mentioned in the official specification. How can this function be
used to determine the length of the wide character string created from a multibyte character
string? It is not directly usable, but we can define a function mbslen using it:
size_t
mbslen (const char *s)
{
mbstate_t state;
size_t result = 0;
size_t nbytes;
memset (&state, '\0', sizeof (state));
while ((nbytes = mbrlen (s, MB_LEN_MAX, &state)) > 0)
{
if (nbytes >= (size_t) -2)
/* Something is wrong. */
return (size_t) -1;
s += nbytes;
++result;
}
return result;
}
This function simply calls mbrlen for each multibyte character in the string and counts
the number of function calls. Please note that we here use MB_LEN_MAX as the size argument
in the mbrlen call. This is acceptable since a) this value is larger than the length of the
longest multibyte character sequence and b) we know that the string s ends with a NUL byte,
which cannot be part of any other multibyte character sequence but the one representing
the NUL wide character. Therefore, the mbrlen function will never read invalid memory.
Chapter 6: Character Set Handling 154
Now that this function is available (just to make this clear, this function is not part of
the GNU C Library) we can compute the number of wide characters required to store the
converted multibyte character string s using
wcs_bytes = (mbslen (s) + 1) * sizeof (wchar_t);
Please note that the mbslen function is quite inefficient. The implementation of
mbstouwcs with mbslen would have to perform the conversion of the multibyte character
input string twice, and this conversion might be quite expensive. So it is necessary to
think about the consequences of using the easier but imprecise method before doing the
work twice.
size_t wcrtomb (char *restrict s, wchar_t wc, mbstate_t [Function]
*restrict ps)
Preliminary: | MT-Unsafe race:wcrtomb/!ps | AS-Unsafe corrupt heap lock dlopen
| AC-Unsafe corrupt lock mem fd | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
The wcrtomb function (“wide character restartable to multibyte”) converts a single
wide character into a multibyte string corresponding to that wide character.
If s is a null pointer, the function resets the state stored in the object pointed to by
ps (or the internal mbstate_t object) to the initial state. This can also be achieved
by a call like this:
wcrtombs (temp_buf, L'\0', ps)
since, if s is a null pointer, wcrtomb performs as if it writes into an internal buffer,
which is guaranteed to be large enough.
If wc is the NUL wide character, wcrtomb emits, if necessary, a shift sequence to get
the state ps into the initial state followed by a single NUL byte, which is stored in
the string s.
Otherwise a byte sequence (possibly including shift sequences) is written into the
string s. This only happens if wc is a valid wide character (i.e., it has a multibyte
representation in the character set selected by locale of the LC_CTYPE category). If wc
is no valid wide character, nothing is stored in the strings s, errno is set to EILSEQ,
the conversion state in ps is undefined and the return value is (size_t) -1.
If no error occurred the function returns the number of bytes stored in the string s.
This includes all bytes representing shift sequences.
One word about the interface of the function: there is no parameter specifying the
length of the array s, so the caller has to make sure that there is enough space
available, otherwise buffer overruns can occur. This version of the GNU C Library
does not assume that s is at least MB CUR MAX bytes long, but programs that
need to run on GNU C Library versions that have this assumption documented in
the manual must comply with this limit.
wcrtomb was introduced in Amendment 1 to ISO C90 and is declared in wchar.h.
Using wcrtomb is as easy as using mbrtowc. The following example appends a wide
character string to a multibyte character string. Again, the code is not really useful (or
correct), it is simply here to demonstrate the use and some problems.
char *
mbscatwcs (char *s, size_t len, const wchar_t *ws)
Chapter 6: Character Set Handling 155
{
mbstate_t state;
/* Find the end of the existing string. */
char *wp = strchr (s, '\0');
len -= wp - s;
memset (&state, '\0', sizeof (state));
do
{
size_t nbytes;
if (len < MB_CUR_LEN)
{
/* We cannot guarantee that the next
character fits into the buffer, so
return an error. */
errno = E2BIG;
return NULL;
}
nbytes = wcrtomb (wp, *ws, &state);
if (nbytes == (size_t) -1)
/* Error in the conversion. */
return NULL;
len -= nbytes;
wp += nbytes;
}
while (*ws++ != L'\0');
return s;
}
First the function has to find the end of the string currently in the array s. The strchr
call does this very efficiently since a requirement for multibyte character representations is
that the NUL byte is never used except to represent itself (and in this context, the end of
the string).
After initializing the state object the loop is entered where the first task is to make sure
there is enough room in the array s. We abort if there are not at least MB_CUR_LEN bytes
available. This is not always optimal but we have no other choice. We might have less than
MB_CUR_LEN bytes available but the next multibyte character might also be only one byte
long. At the time the wcrtomb call returns it is too late to decide whether the buffer was
large enough. If this solution is unsuitable, there is a very slow but more accurate solution.
...
if (len < MB_CUR_LEN)
{
mbstate_t temp_state;
memcpy (&temp_state, &state, sizeof (state));
if (wcrtomb (NULL, *ws, &temp_state) > len)
{
/* We cannot guarantee that the next
character fits into the buffer, so
return an error. */
errno = E2BIG;
return NULL;
}
}
...
Here we perform the conversion that might overflow the buffer so that we are afterwards
in the position to make an exact decision about the buffer size. Please note the NULL
Chapter 6: Character Set Handling 156
argument for the destination buffer in the new wcrtomb call; since we are not interested in
the converted text at this point, this is a nice way to express this. The most unusual thing
about this piece of code certainly is the duplication of the conversion state object, but if a
change of the state is necessary to emit the next multibyte character, we want to have the
same shift state change performed in the real conversion. Therefore, we have to preserve
the initial shift state information.
There are certainly many more and even better solutions to this problem. This example
is only provided for educational purposes.
with text. A buffer is not normally a collection of NUL-terminated strings but instead a
continuous collection of lines, separated by newline characters. Now assume that a function
to convert one line from a buffer is needed. Since the line is not NUL-terminated, the source
pointer cannot directly point into the unmodified text buffer. This means, either one inserts
the NUL byte at the appropriate place for the time of the mbsrtowcs function call (which is
not doable for a read-only buffer or in a multi-threaded application) or one copies the line
in an extra buffer where it can be terminated by a NUL byte. Note that it is not in general
possible to limit the number of characters to convert by setting the parameter len to any
specific value. Since it is not known how many bytes each multibyte character sequence is
in length, one can only guess.
There is still a problem with the method of NUL-terminating a line right after the
newline character, which could lead to very strange results. As said in the description of
the mbsrtowcs function above, the conversion state is guaranteed to be in the initial shift
state after processing the NUL byte at the end of the input string. But this NUL byte is
not really part of the text (i.e., the conversion state after the newline in the original text
could be something different than the initial shift state and therefore the first character
of the next line is encoded using this state). But the state in question is never accessible
to the user since the conversion stops after the NUL byte (which resets the state). Most
stateful character sets in use today require that the shift state after a newline be the initial
state–but this is not a strict guarantee. Therefore, simply NUL-terminating a piece of a
running text is not always an adequate solution and, therefore, should never be used in
generally used code.
The generic conversion interface (see Section 6.5 [Generic Charset Conversion], page 165)
does not have this limitation (it simply works on buffers, not strings), and the GNU C
Library contains a set of functions that take additional parameters specifying the maxi-
mal number of bytes that are consumed from the input string. This way the problem of
mbsrtowcs’s example above could be solved by determining the line length and passing this
length to the function.
Another reason for a premature stop is if dst is not a null pointer and the next
converted character would require more than len bytes in total to the array dst. In
this case (and if dst is not a null pointer) the pointer pointed to by src is assigned a
value pointing to the wide character right after the last one successfully converted.
Except in the case of an encoding error the return value of the wcsrtombs function
is the number of bytes in all the multibyte character sequences which were or would
have been (if dst was not a null) stored in dst. Before returning, the state in the
object pointed to by ps (or the internal object in case ps is a null pointer) is updated
to reflect the state after the last conversion. The state is the initial shift state in case
the terminating NUL wide character was converted.
The wcsrtombs function was introduced in Amendment 1 to ISO C90 and is declared
in wchar.h.
The restriction mentioned above for the mbsrtowcs function applies here also. There is
no possibility of directly controlling the number of input characters. One has to place the
NUL wide character at the correct place or control the consumed input indirectly via the
available output array size (the len parameter).
A function to convert a multibyte string into a wide character string and display it could
be written like this (this is not a really useful example):
void
showmbs (const char *src, FILE *fp)
{
mbstate_t state;
int cnt = 0;
memset (&state, '\0', sizeof (state));
while (1)
{
Chapter 6: Character Set Handling 159
wchar_t linebuf[100];
const char *endp = strchr (src, '\n');
size_t n;
while (!eof)
{
ssize_t nread;
Chapter 6: Character Set Handling 160
ssize_t nwrite;
char *inp = buffer;
wchar_t outbuf[BUFSIZ];
wchar_t *outp = outbuf;
return 1;
}
Similar to mbrlen there is also a non-reentrant function that computes the length of a
multibyte character. It can be defined in terms of mbtowc.
character if there is room. The conversion of characters begins in the initial shift
state.
The terminating null character counts towards the size, so if size is less than or equal
to the number of bytes needed in wstring, no terminating null character is stored.
If a code that does not correspond to a valid multibyte character is found, the
wcstombs function returns a value of −1. Otherwise, the return value is the number
of bytes stored in the array string. This number does not include the terminating
null character, which is present if the number is less than size.
while (1)
{
int thischar = mblen (s, length);
/* Deal with end of string and invalid characters. */
if (thischar == 0)
break;
if (thischar == -1)
{
error ("invalid multibyte character");
break;
}
/* Advance past this character. */
Chapter 6: Character Set Handling 165
s += thischar;
length -= thischar;
}
}
The functions mblen, mbtowc and wctomb are not reentrant when using a multibyte code
that uses a shift state. However, no other library functions call these functions, so you don’t
have to worry that the shift state will be changed mysteriously.
Before the interfaces are described it is necessary to introduce a data type. Just like
other open–use–close interfaces the functions introduced here work using handles and the
iconv.h header defines a special type for the handles used.
only the system directory is considered and this normally is prefix/lib/gconv. The
GCONV_PATH environment variable is examined exactly once at the first call of the
iconv_open function. Later modifications of the variable have no effect.
The iconv_open function was introduced early in the X/Open Portability Guide,
version 2. It is supported by all commercial Unices as it is required for the Unix
branding. However, the quality and completeness of the implementation varies widely.
The iconv_open function is declared in iconv.h.
The iconv implementation can associate large data structure with the handle returned
by iconv_open. Therefore, it is crucial to free all the resources once all conversions are
carried out and the conversion is not needed anymore.
int iconv_close (iconv_t cd) [Function]
Preliminary: | MT-Safe | AS-Unsafe corrupt heap lock dlopen | AC-Unsafe corrupt
lock mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The iconv_close function frees all resources associated with the handle cd, which
must have been returned by a successful call to the iconv_open function.
If the function call was successful the return value is 0. Otherwise it is −1 and errno
is set appropriately. Defined errors are:
EBADF The conversion descriptor is invalid.
The iconv_close function was introduced together with the rest of the iconv func-
tions in XPG2 and is declared in iconv.h.
The standard defines only one actual conversion function. This has, therefore, the most
general interface: it allows conversion from one buffer to another. Conversion from a file to
a buffer, vice versa, or even file to file can be implemented on top of it.
size_t iconv (iconv_t cd, char **inbuf, size_t [Function]
*inbytesleft, char **outbuf, size_t *outbytesleft)
Preliminary: | MT-Safe race:cd | AS-Safe | AC-Unsafe corrupt | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The iconv function converts the text in the input buffer according to the rules associ-
ated with the descriptor cd and stores the result in the output buffer. It is possible to
call the function for the same text several times in a row since for stateful character
sets the necessary state information is kept in the data structures associated with the
descriptor.
The input buffer is specified by *inbuf and it contains *inbytesleft bytes. The
extra indirection is necessary for communicating the used input back to the caller
(see below). It is important to note that the buffer pointer is of type char and the
length is measured in bytes even if the input text is encoded in wide characters.
The output buffer is specified in a similar way. *outbuf points to the beginning of
the buffer with at least *outbytesleft bytes room for the result. The buffer pointer
again is of type char and the length is measured in bytes. If outbuf or *outbuf is a
null pointer, the conversion is performed but no output is available.
If inbuf is a null pointer, the iconv function performs the necessary action to put the
state of the conversion into the initial state. This is obviously a no-op for non-stateful
Chapter 6: Character Set Handling 168
encodings, but if the encoding has a state, such a function call might put some byte
sequences in the output buffer, which perform the necessary state changes. The next
call with inbuf not being a null pointer then simply goes on from the initial state.
It is important that the programmer never makes any assumption as to whether the
conversion has to deal with states. Even if the input and output character sets are
not stateful, the implementation might still have to keep states. This is due to the
implementation chosen for the GNU C Library as it is described below. Therefore
an iconv call to reset the state should always be performed if some protocol requires
this for the output text.
The conversion stops for one of three reasons. The first is that all characters from
the input buffer are converted. This actually can mean two things: either all bytes
from the input buffer are consumed or there are some bytes at the end of the buffer
that possibly can form a complete character but the input is incomplete. The second
reason for a stop is that the output buffer is full. And the third reason is that the
input contains invalid characters.
In all of these cases the buffer pointers after the last successful conversion, for the
input and output buffers, are stored in inbuf and outbuf, and the available room in
each buffer is stored in inbytesleft and outbytesleft.
Since the character sets selected in the iconv_open call can be almost arbitrary,
there can be situations where the input buffer contains valid characters, which have
no identical representation in the output character set. The behavior in this situation
is undefined. The current behavior of the GNU C Library in this situation is to
return with an error immediately. This certainly is not the most desirable solution;
therefore, future versions will provide better ones, but they are not yet finished.
If all input from the input buffer is successfully converted and stored in the output
buffer, the function returns the number of non-reversible conversions performed. In
all other cases the return value is (size_t) -1 and errno is set appropriately. In
such cases the value pointed to by inbytesleft is nonzero.
EILSEQ The conversion stopped because of an invalid byte sequence in the input.
After the call, *inbuf points at the first byte of the invalid byte sequence.
E2BIG The conversion stopped because it ran out of space in the output buffer.
EINVAL The conversion stopped because of an incomplete byte sequence at the
end of the input buffer.
EBADF The cd argument is invalid.
The iconv function was introduced in the XPG2 standard and is declared in the
iconv.h header.
The definition of the iconv function is quite good overall. It provides quite flexible
functionality. The only problems lie in the boundary cases, which are incomplete byte
sequences at the end of the input buffer and invalid input. A third problem, which is not
really a design problem, is the way conversions are selected. The standard does not say
anything about the legitimate names, a minimal set of available conversions. We will see
how this negatively impacts other implementations, as demonstrated below.
Chapter 6: Character Set Handling 169
return -1;
}
break;
}
insize += nread;
/* Do the conversion. */
nconv = iconv (cd, &inptr, &insize, &wrptr, &avail);
if (nconv == (size_t) -1)
Chapter 6: Character Set Handling 170
{
/* Not everything went right. It might only be
an unfinished byte sequence at the end of the
buffer. Or it is a real problem. */
if (errno == EINVAL)
/* This is harmless. Simply move the unused
bytes to the beginning of the buffer so that
they can be used in the next round. */
memmove (inbuf, inptr, insize);
else
{
/* It is a real problem. Maybe we ran out of
space in the output buffer or we have invalid
input. In any case back the file pointer to
the position of the last processed byte. */
lseek (fd, -insize, SEEK_CUR);
result = -1;
break;
}
}
}
if (iconv_close (cd) != 0)
perror ("iconv_close");
when writing generic functions where one does not know what type of character set one
uses and, therefore, treats text as a sequence of bytes, it might become tricky.
This directly leads to a third and probably the most problematic point. The way the
iconv conversion functions are implemented on all known Unix systems and the availability
of the conversion functions from character set A to B and the conversion from B to C does
not imply that the conversion from A to C is available.
This might not seem unreasonable and problematic at first, but it is a quite big problem
as one will notice shortly after hitting it. To show the problem we assume to write a program
that has to convert from A to C. A call like
cd = iconv_open ("C", "A");
fails according to the assumption above. But what does the program do now? The conver-
sion is necessary; therefore, simply giving up is not an option.
This is a nuisance. The iconv function should take care of this. But how should the
program proceed from here on? If it tries to convert to character set B, first the two
iconv_open calls
cd1 = iconv_open ("B", "A");
and
cd2 = iconv_open ("C", "B");
will succeed, but how to find B?
Unfortunately, the answer is: there is no general solution. On some systems guessing
might help. On those systems most character sets can convert to and from UTF-8 encoded
ISO 10646 or Unicode text. Besides this only some very system-specific methods can help.
Since the conversion functions come from loadable modules and these modules must be
stored somewhere in the filesystem, one could try to find them and determine from the
available file which conversions are available and whether there is an indirect route from A
to C.
This example shows one of the design errors of iconv mentioned above. It should at
least be possible to determine the list of available conversions programmatically so that
if iconv_open says there is no such conversion, one could make sure this also is true for
indirect routes.
The second mentioned problem is the number of supported conversions. Currently, the
GNU C Library supports more than 150 character sets. The way the implementation is
designed the number of supported conversions is greater than 22350 (150 times 149). If any
conversion from or to a character set is missing, it can be added easily.
Particularly impressive as it may be, this high number is due to the fact that the GNU
C Library implementation of iconv does not have the third problem mentioned above (i.e.,
whenever there is a conversion from a character set A to B and from B to C it is always
possible to convert from A to C directly). If the iconv_open returns an error and sets errno
to EINVAL, there is no known way, directly or indirectly, to perform the wanted conversion.
Triangulation is achieved by providing for each character set a conversion from and to
UCS-4 encoded ISO 10646. Using ISO 10646 as an intermediate representation it is possible
to triangulate (i.e., convert with an intermediate representation).
There is no inherent requirement to provide a conversion to ISO 10646 for a new char-
acter set, and it is also possible to provide other conversions where neither source nor
destination character set is ISO 10646. The existing set of conversions is simply meant to
cover all conversions that might be of interest.
All currently available conversions use the triangulation method above, making conver-
sion run unnecessarily slow. If, for example, somebody often needs the conversion from
ISO-2022-JP to EUC-JP, a quicker solution would involve direct conversion between the
two character sets, skipping the input to ISO 10646 first. The two character sets of interest
are much more similar to each other than to ISO 10646.
In such a situation one easily can write a new conversion and provide it as a better
alternative. The GNU C Library iconv implementation would automatically use the module
implementing the conversion if it is specified to be more efficient.
The first word specifies the source character set, the second word the destination char-
acter set of conversion implemented in this module, and the third word is the name
of the loadable module. The filename is constructed by appending the usual shared
object suffix (normally .so) and this file is then supposed to be found in the same
directory the gconv-modules file is in. The last word on the line, which is optional, is
a numeric value representing the cost of the conversion. If this word is missing, a cost
of 1 is assumed. The numeric value itself does not matter that much; what counts are
the relative values of the sums of costs for all possible conversion paths. Below is a
more precise description of the use of the cost value.
Returning to the example above where one has written a module to directly convert
from ISO-2022-JP to EUC-JP and back. All that has to be done is to put the new module,
let its name be ISO2022JP-EUCJP.so, in a directory and add a file gconv-modules with
the following content in the same directory:
module ISO-2022-JP// EUC-JP// ISO2022JP-EUCJP 1
module EUC-JP// ISO-2022-JP// ISO2022JP-EUCJP 1
To see why this is sufficient, it is necessary to understand how the conversion used by
iconv (and described in the descriptor) is selected. The approach to this problem is quite
simple.
At the first call of the iconv_open function the program reads all available gconv-
modules files and builds up two tables: one containing all the known aliases and another
that contains the information about the conversions and which shared object implements
them.
chosen name it should have become clear that this is the name for the representation used
in the intermediate step of the triangulation. We have said that this is UCS-4 but actually
that is not quite right. The UCS-4 specification also includes the specification of the byte
ordering used. Since a UCS-4 value consists of four bytes, a stored value is affected by byte
ordering. The internal representation is not the same as UCS-4 in case the byte ordering
of the processor (or at least the running process) is not the same as the one required for
UCS-4. This is done for performance reasons as one does not want to perform unnecessary
byte-swapping operations if one is not interested in actually seeing the result in UCS-4. To
avoid trouble with endianness, the internal representation consistently is named INTERNAL
even on big-endian systems where the representations are identical.
to be carried out since one module might implement conversions for more
than one character set and/or direction.
gconv_fct __fct
gconv_init_fct __init_fct
gconv_end_fct __end_fct
These elements contain pointers to the functions in the loadable module.
The interface will be explained below.
int __min_needed_from
int __max_needed_from
int __min_needed_to
int __max_needed_to;
These values have to be supplied in the init function of the module. The
__min_needed_from value specifies how many bytes a character of the
source character set at least needs. The __max_needed_from specifies
the maximum value that also includes possible shift sequences.
The __min_needed_to and __max_needed_to values serve the same pur-
pose as __min_needed_from and __max_needed_from but this time for
the destination character set.
It is crucial that these values be accurate since otherwise the conversion
functions will have problems or not work at all.
int __stateful
This element must also be initialized by the init function. int
__stateful is nonzero if the source character set is stateful. Otherwise
it is zero.
void *__data
This element can be used freely by the conversion functions in the module.
void *__data can be used to communicate extra information from one
call to another. void *__data need not be initialized if not needed at all.
If void *__data element is assigned a pointer to dynamically allocated
memory (presumably in the init function) it has to be made sure that the
end function deallocates the memory. Otherwise the application will leak
memory.
It is important to be aware that this data structure is shared by all users
of this specification conversion and therefore the __data element must
not contain data specific to one specific use of the conversion function.
function must not assume anything about the size of the buffer but it can
be safely assumed there is room for at least one complete character in the
output buffer.
Once the conversion is finished, if the conversion is the last step, the __
outbuf element must be modified to point after the last byte written into
the buffer to signal how much output is available. If this conversion step
is not the last one, the element must not be modified. The __outbufend
element must not be modified.
int __is_last
This element is nonzero if this conversion step is the last one. This infor-
mation is necessary for the recursion. See the description of the conversion
function internals below. This element must never be modified.
int __invocation_counter
The conversion function can use this element to see how many calls of
the conversion function already happened. Some character sets require a
certain prolog when generating output, and by comparing this value with
zero, one can find out whether it is the first call and whether, therefore,
the prolog should be emitted. This element must never be modified.
int __internal_use
This element is another one rarely used but needed in certain situations.
It is assigned a nonzero value in case the conversion functions are used to
implement mbsrtowcs et.al. (i.e., the function is not used directly through
the iconv interface).
This sometimes makes a difference as it is expected that the iconv func-
tions are used to translate entire texts while the mbsrtowcs functions are
normally used only to convert single strings and might be used multiple
times to convert entire texts.
But in this situation we would have problem complying with some rules
of the character set specification. Some character sets require a pro-
log, which must appear exactly once for an entire text. If a number of
mbsrtowcs calls are used to convert the text, only the first call must add
the prolog. However, because there is no communication between the
different calls of mbsrtowcs, the conversion functions have no possibility
to find this out. The situation is different for sequences of iconv calls
since the handle allows access to the needed information.
The int __internal_use element is mostly used together with
__invocation_counter as follows:
if (!data->__internal_use
&& data->__invocation_counter == 0)
/* Emit prolog. */
...
This element must never be modified.
mbstate_t *__statep
The __statep element points to an object of type mbstate_t (see Sec-
tion 6.3.2 [Representing the state of the conversion], page 148). The
Chapter 6: Character Set Handling 178
int
gconv_init (struct __gconv_step *step)
{
/* Determine which direction. */
struct iso2022jp_data *new_data;
enum direction dir = illegal_dir;
enum variant var = illegal_var;
int result;
result = __GCONV_NOCONV;
Chapter 6: Character Set Handling 180
if (dir != illegal_dir)
{
new_data = (struct iso2022jp_data *)
malloc (sizeof (struct iso2022jp_data));
result = __GCONV_NOMEM;
if (new_data != NULL)
{
new_data->dir = dir;
new_data->var = var;
step->__data = new_data;
if (dir == from_iso2022jp)
{
step->__min_needed_from = MIN_NEEDED_FROM;
step->__max_needed_from = MAX_NEEDED_FROM;
step->__min_needed_to = MIN_NEEDED_TO;
step->__max_needed_to = MAX_NEEDED_TO;
}
else
{
step->__min_needed_from = MIN_NEEDED_TO;
step->__max_needed_from = MAX_NEEDED_TO;
step->__min_needed_to = MIN_NEEDED_FROM;
step->__max_needed_to = MAX_NEEDED_FROM + 2;
}
result = __GCONV_OK;
}
}
return result;
}
The function first checks which conversion is wanted. The module from which this
function is taken implements four different conversions; which one is selected can be
determined by comparing the names. The comparison should always be done without
paying attention to the case.
Next, a data structure, which contains the necessary information about which conver-
sion is selected, is allocated. The data structure struct iso2022jp_data is locally
defined since, outside the module, this data is not used at all. Please note that if all
four conversions this module supports are requested there are four data blocks.
One interesting thing is the initialization of the __min_ and __max_ elements of the
step data object. A single ISO-2022-JP character can consist of one to four bytes.
Therefore the MIN_NEEDED_FROM and MAX_NEEDED_FROM macros are defined this way.
The output is always the INTERNAL character set (aka UCS-4) and therefore each
character consists of exactly four bytes. For the conversion from INTERNAL to ISO-
2022-JP we have to take into account that escape sequences might be necessary to
switch the character sets. Therefore the __max_needed_to element for this direction
gets assigned MAX_NEEDED_FROM + 2. This takes into account the two bytes needed for
the escape sequences to signal the switching. The asymmetry in the maximum values
Chapter 6: Character Set Handling 181
for the two directions can be explained easily: when reading ISO-2022-JP text, escape
sequences can be handled alone (i.e., it is not necessary to process a real character
since the effect of the escape sequence can be recorded in the state information).
The situation is different for the other direction. Since it is in general not known
which character comes next, one cannot emit escape sequences to change the state in
advance. This means the escape sequences have to be emitted together with the next
character. Therefore one needs more room than only for the character itself.
The possible return values of the initialization function are:
__GCONV_OK
The initialization succeeded
__GCONV_NOCONV
The requested conversion is not supported in the module. This can hap-
pen if the gconv-modules file has errors.
__GCONV_NOMEM
Memory required to store additional information could not be allocated.
The function called before the module is unloaded is significantly easier. It often has
nothing at all to do; in which case it can be left out completely.
The most important function is the conversion function itself, which can get quite com-
plicated for complex character sets. But since this is not of interest here, we will only
describe a possible skeleton for the conversion function.
happened the other conversion modules in the chain of conversions have to get the
same chance. Whether another step follows can be determined from the __is_last
element of the step data structure to which the first parameter points.
The more interesting mode is when actual text has to be converted. The first step in
this case is to convert as much text as possible from the input buffer and store the
result in the output buffer. The start of the input buffer is determined by the third
argument, which is a pointer to a pointer variable referencing the beginning of the
buffer. The fourth argument is a pointer to the byte right after the last byte in the
buffer.
The conversion has to be performed according to the current state if the character
set is stateful. The state is stored in an object pointed to by the __statep element of
the step data (second argument). Once either the input buffer is empty or the output
buffer is full the conversion stops. At this point, the pointer variable referenced by
the third parameter must point to the byte following the last processed byte (i.e., if
all of the input is consumed, this pointer and the fourth parameter have the same
value).
What now happens depends on whether this step is the last one. If it is the last
step, the only thing that has to be done is to update the __outbuf element of the
step data structure to point after the last written byte. This update gives the caller
the information on how much text is available in the output buffer. In addition,
the variable pointed to by the fifth parameter, which is of type size_t, must be
incremented by the number of characters (not bytes) that were converted in a non-
reversible way. Then, the function can return.
In case the step is not the last one, the later conversion functions have to get a chance
to do their work. Therefore, the appropriate conversion function has to be called. The
information about the functions is stored in the conversion data structures, passed as
the first parameter. This information and the step data are stored in arrays, so the
next element in both cases can be found by simple pointer arithmetic:
int
gconv (struct __gconv_step *step, struct __gconv_step_data *data,
const char **inbuf, const char *inbufend, size_t *written,
int do_flush)
{
struct __gconv_step *next_step = step + 1;
struct __gconv_step_data *next_data = data + 1;
...
The next_step pointer references the next step information and next_data the next
data record. The call of the next function therefore will look similar to this:
next_step->__fct (next_step, next_data, &outerr, outbuf,
written, 0)
But this is not yet all. Once the function call returns the conversion function might
have some more to do. If the return value of the function is __GCONV_EMPTY_INPUT,
more room is available in the output buffer. Unless the input buffer is empty, the
conversion functions start all over again and process the rest of the input buffer. If
the return value is not __GCONV_EMPTY_INPUT, something went wrong and we have
to recover from this.
Chapter 6: Character Set Handling 183
A requirement for the conversion function is that the input buffer pointer (the third
argument) always point to the last character that was put in converted form into the
output buffer. This is trivially true after the conversion performed in the current step,
but if the conversion functions deeper downstream stop prematurely, not all characters
from the output buffer are consumed and, therefore, the input buffer pointers must
be backed off to the right position.
Correcting the input buffers is easy to do if the input and output character sets
have a fixed width for all characters. In this situation we can compute how many
characters are left in the output buffer and, therefore, can correct the input buffer
pointer appropriately with a similar computation. Things are getting tricky if either
character set has characters represented with variable length byte sequences, and it
gets even more complicated if the conversion has to take care of the state. In these
cases the conversion has to be performed once again, from the known state before
the initial conversion (i.e., if necessary the state of the conversion has to be reset and
the conversion loop has to be executed again). The difference now is that it is known
how much input must be created, and the conversion can stop before converting the
first unused character. Once this is done the input buffer pointers must be updated
again and the function can return.
One final thing should be mentioned. If it is necessary for the conversion to know
whether it is the first invocation (in case a prolog has to be emitted), the conver-
sion function should increment the __invocation_counter element of the step data
structure just before returning to the caller. See the description of the struct __
gconv_step_data structure above for more information on how this can be used.
The return value must be one of the following values:
__GCONV_EMPTY_INPUT
All input was consumed and there is room left in the output buffer.
__GCONV_FULL_OUTPUT
No more room in the output buffer. In case this is not the last step this
value is propagated down from the call of the next conversion function in
the chain.
__GCONV_INCOMPLETE_INPUT
The input buffer is not entirely empty since it contains an incomplete
character sequence.
The following example provides a framework for a conversion function. In case a new
conversion has to be written the holes in this implementation have to be filled and
that is it.
int
gconv (struct __gconv_step *step, struct __gconv_step_data *data,
const char **inbuf, const char *inbufend, size_t *written,
int do_flush)
{
struct __gconv_step *next_step = step + 1;
struct __gconv_step_data *next_data = data + 1;
gconv_fct fct = next_step->__fct;
int status;
Chapter 6: Character Set Handling 184
/* Call the steps down the chain if there are any but only
if we successfully emitted the escape sequence. */
if (status == __GCONV_OK && ! data->__is_last)
status = fct (next_step, next_data, NULL, NULL,
written, 1);
}
else
{
/* We preserve the initial values of the pointer variables. */
const char *inptr = *inbuf;
char *outbuf = data->__outbuf;
char *outend = data->__outbufend;
char *outptr;
do
{
/* Remember the start value for this round. */
inptr = *inbuf;
/* The outbuf buffer is empty. */
outptr = outbuf;
break;
}
if (result != __GCONV_EMPTY_INPUT)
{
if (outerr != outbuf)
{
/* Reset the input buffer pointer. We
document here the complex case. */
size_t nstatus;
return status;
}
This information should be sufficient to write new modules. Anybody doing so should
also take a look at the available source code in the GNU C Library sources. It contains
many examples of working and optimized modules.
186
LC_MESSAGES
This category applies to selecting the language used in the user interface for mes-
sage translation (see Section 8.2 [The Uniforum approach to Message Transla-
tion], page 215; see Section 8.1 [X/Open Message Catalog Handling], page 206)
and contains regular expressions for affirmative and negative responses.
LC_ALL This is not a category; it is only a macro that you can use with setlocale to
set a single locale for all purposes. Setting this environment variable overwrites
all selections by the other LC_* variables or LANG.
LANG If this environment variable is defined, its value specifies the locale to use for
all purposes except as overridden by the variables above.
When developing the message translation functions it was felt that the functionality
provided by the variables above is not sufficient. For example, it should be possible to
specify more than one locale name. Take a Swedish user who better speaks German than
English, and a program whose messages are output in English by default. It should be
possible to specify that the first choice of language is Swedish, the second German, and
if this also fails to use English. This is possible with the variable LANGUAGE. For further
description of this GNU extension see Section 8.2.1.6 [User influence on gettext], page 227.
page 102) if you want to save it past any further calls to setlocale. (The standard
library is guaranteed never to call setlocale itself.)
You should not modify the string returned by setlocale. It might be the same string
that was passed as an argument in a previous call to setlocale. One requirement is
that the category must be the same in the call the string was returned and the one
when the string is passed in as locale parameter.
When you read the current locale for category LC_ALL, the value encodes the entire
combination of selected locales for all categories. If you specify the same “locale name”
with LC_ALL in a subsequent call to setlocale, it restores the same combination of
locale selections.
To be sure you can use the returned string encoding the currently selected locale at a
later time, you must make a copy of the string. It is not guaranteed that the returned
pointer remains valid over time.
When the locale argument is not a null pointer, the string returned by setlocale
reflects the newly-modified locale.
If you specify an empty string for locale, this means to read the appropriate environ-
ment variable and use its value to select the locale for category.
If a nonempty string is given for locale, then the locale of that name is used if possible.
The effective locale name (either the second argument to setlocale, or if the argu-
ment is an empty string, the name obtained from the process environment) must be
a valid locale name. See Section 7.6 [Locale Names], page 190.
If you specify an invalid locale name, setlocale returns a null pointer and leaves the
current locale unchanged.
Here is an example showing how you might use setlocale to temporarily switch to a
new locale.
#include <stddef.h>
#include <locale.h>
#include <stdlib.h>
#include <string.h>
void
with_other_locale (char *new_locale,
void (*subroutine) (int),
int argument)
{
char *old_locale, *saved_locale;
has a brain-damaged interface. The second is part of the Unix interface and is portable in
as far as the system follows the Unix standards.
char *int_curr_symbol
The international currency symbol for the selected locale.
The value of int_curr_symbol should normally consist of a three-letter ab-
breviation determined by the international standard ISO 4217 Codes for the
Representation of Currency and Funds, followed by a one-character separator
(often a space).
In the standard ‘C’ locale, this member has a value of "" (the empty string),
meaning “unspecified”. We recommend you simply print the empty string as
you would print any other string pointed to by this variable.
char p_cs_precedes
char n_cs_precedes
char int_p_cs_precedes
char int_n_cs_precedes
These members are 1 if the currency_symbol or int_curr_symbol strings
should precede the value of a monetary amount, or 0 if the strings should
follow the value. The p_cs_precedes and int_p_cs_precedes members apply
to positive amounts (or zero), and the n_cs_precedes and int_n_cs_precedes
members apply to negative amounts.
In the standard ‘C’ locale, all of these members have a value of CHAR_MAX,
meaning “unspecified”. The ISO standard doesn’t say what to do when you
find this value. We recommend printing the currency symbol before the amount,
which is right for most countries. In other words, treat all nonzero values alike
in these members.
The members with the int_ prefix apply to the int_curr_symbol while the
other two apply to currency_symbol.
char p_sep_by_space
char n_sep_by_space
char int_p_sep_by_space
char int_n_sep_by_space
These members are 1 if a space should appear between the currency_symbol or
int_curr_symbol strings and the amount, or 0 if no space should appear. The
p_sep_by_space and int_p_sep_by_space members apply to positive amounts
(or zero), and the n_sep_by_space and int_n_sep_by_space members apply
to negative amounts.
In the standard ‘C’ locale, all of these members have a value of CHAR_MAX,
meaning “unspecified”. The ISO standard doesn’t say what you should do
when you find this value; we suggest you treat it as 1 (print a space). In other
words, treat all nonzero values alike in these members.
The members with the int_ prefix apply to the int_curr_symbol while the
other two apply to currency_symbol. There is one specialty with the int_
curr_symbol, though. Since all legal values contain a space at the end of
the string one either prints this space (if the currency symbol must appear in
front and must be separated) or one has to avoid printing this character at all
(especially when at the end of the string).
Chapter 7: Locales and Internationalization 195
char *positive_sign
char *negative_sign
These are strings used to indicate positive (or zero) and negative monetary
quantities, respectively.
In the standard ‘C’ locale, both of these members have a value of "" (the empty
string), meaning “unspecified”.
The ISO standard doesn’t say what to do when you find this value; we recom-
mend printing positive_sign as you find it, even if it is empty. For a negative
value, print negative_sign as you find it unless both it and positive_sign
are empty, in which case print ‘-’ instead. (Failing to indicate the sign at all
seems rather unreasonable.)
char p_sign_posn
char n_sign_posn
char int_p_sign_posn
char int_n_sign_posn
These members are small integers that indicate how to position the sign for
nonnegative and negative monetary quantities, respectively. (The string used
for the sign is what was specified with positive_sign or negative_sign.) The
possible values are as follows:
0 The currency symbol and quantity should be surrounded by paren-
theses.
1 Print the sign string before the quantity and currency symbol.
2 Print the sign string after the quantity and currency symbol.
3 Print the sign string right before the currency symbol.
4 Print the sign string right after the currency symbol.
CHAR_MAX “Unspecified”. Both members have this value in the standard ‘C’
locale.
The ISO standard doesn’t say what you should do when the value is CHAR_MAX.
We recommend you print the sign after the currency symbol.
The members with the int_ prefix apply to the int_curr_symbol while the
other two apply to currency_symbol.
CODESET nl_langinfo returns a string with the name of the coded character set
used in the selected locale.
ABDAY_1
ABDAY_2
ABDAY_3
ABDAY_4
ABDAY_5
ABDAY_6
ABDAY_7 nl_langinfo returns the abbreviated weekday name. ABDAY_1 corre-
sponds to Sunday.
DAY_1
DAY_2
DAY_3
DAY_4
DAY_5
DAY_6
DAY_7 Similar to ABDAY_1, etc., but here the return value is the unabbreviated
weekday name.
ABMON_1
ABMON_2
ABMON_3
ABMON_4
ABMON_5
ABMON_6
ABMON_7
ABMON_8
ABMON_9
ABMON_10
ABMON_11
ABMON_12 The return value is the abbreviated name of the month, in the grammat-
ical form used when the month forms part of a complete date. ABMON_1
corresponds to January.
Chapter 7: Locales and Internationalization 197
MON_1
MON_2
MON_3
MON_4
MON_5
MON_6
MON_7
MON_8
MON_9
MON_10
MON_11
MON_12 Similar to ABMON_1, etc., but here the month names are not abbreviated.
Here the first value MON_1 also corresponds to January.
ALTMON_1
ALTMON_2
ALTMON_3
ALTMON_4
ALTMON_5
ALTMON_6
ALTMON_7
ALTMON_8
ALTMON_9
ALTMON_10
ALTMON_11
ALTMON_12
Similar to MON_1, etc., but here the month names are in the grammatical
form used when the month is named by itself. The strftime functions
use these month names for the conversion specifier %OB (see Section 22.5.4
[Formatting Calendar Time], page 713).
Note that not all languages need two different forms of the month names,
so the strings returned for MON_... and ALTMON_... may or may not be
the same, depending on the locale.
NB: ABALTMON_... constants corresponding to the %Ob conversion speci-
fier are not currently provided, but are expected to be in a future release.
In the meantime, it is possible to use _NL_ABALTMON_....
AM_STR
PM_STR The return values are strings which can be used in the representation of
time as an hour from 1 to 12 plus an am/pm specifier.
Note that in locales which do not use this time representation these strings
might be empty, in which case the am/pm format cannot be used at all.
D_T_FMT The return value can be used as a format string for strftime to represent
time and date in a locale-specific way.
D_FMT The return value can be used as a format string for strftime to represent
a date in a locale-specific way.
Chapter 7: Locales and Internationalization 198
T_FMT The return value can be used as a format string for strftime to represent
time in a locale-specific way.
T_FMT_AMPM
The return value can be used as a format string for strftime to represent
time in the am/pm format.
Note that if the am/pm format does not make any sense for the selected
locale, the return value might be the same as the one for T_FMT.
ERA The return value represents the era used in the current locale.
Most locales do not define this value. An example of a locale which
does define this value is the Japanese one. In Japan, the traditional
representation of dates includes the name of the era corresponding to the
then-emperor’s reign.
Normally it should not be necessary to use this value directly. Specifying
the E modifier in their format strings causes the strftime functions to
use this information. The format of the returned string is not specified,
and therefore you should not assume knowledge of it on different systems.
ERA_YEAR The return value gives the year in the relevant era of the locale. As for
ERA it should not be necessary to use this value directly.
ERA_D_T_FMT
This return value can be used as a format string for strftime to represent
dates and times in a locale-specific era-based way.
ERA_D_FMT
This return value can be used as a format string for strftime to represent
a date in a locale-specific era-based way.
ERA_T_FMT
This return value can be used as a format string for strftime to represent
time in a locale-specific era-based way.
ALT_DIGITS
The return value is a representation of up to 100 values used to represent
the values 0 to 99. As for ERA this value is not intended to be used
directly, but instead indirectly through the strftime function. When
the modifier O is used in a format which would otherwise use numerals
to represent hours, minutes, seconds, weekdays, months, or weeks, the
appropriate value for the locale is used instead.
INT_CURR_SYMBOL
The same as the value returned by localeconv in the int_curr_symbol
element of the struct lconv.
CURRENCY_SYMBOL
CRNCYSTR The same as the value returned by localeconv in the currency_symbol
element of the struct lconv.
CRNCYSTR is a deprecated alias still required by Unix98.
Chapter 7: Locales and Internationalization 199
MON_DECIMAL_POINT
The same as the value returned by localeconv in the mon_decimal_
point element of the struct lconv.
MON_THOUSANDS_SEP
The same as the value returned by localeconv in the mon_thousands_
sep element of the struct lconv.
MON_GROUPING
The same as the value returned by localeconv in the mon_grouping
element of the struct lconv.
POSITIVE_SIGN
The same as the value returned by localeconv in the positive_sign
element of the struct lconv.
NEGATIVE_SIGN
The same as the value returned by localeconv in the negative_sign
element of the struct lconv.
INT_FRAC_DIGITS
The same as the value returned by localeconv in the int_frac_digits
element of the struct lconv.
FRAC_DIGITS
The same as the value returned by localeconv in the frac_digits ele-
ment of the struct lconv.
P_CS_PRECEDES
The same as the value returned by localeconv in the p_cs_precedes
element of the struct lconv.
P_SEP_BY_SPACE
The same as the value returned by localeconv in the p_sep_by_space
element of the struct lconv.
N_CS_PRECEDES
The same as the value returned by localeconv in the n_cs_precedes
element of the struct lconv.
N_SEP_BY_SPACE
The same as the value returned by localeconv in the n_sep_by_space
element of the struct lconv.
P_SIGN_POSN
The same as the value returned by localeconv in the p_sign_posn ele-
ment of the struct lconv.
N_SIGN_POSN
The same as the value returned by localeconv in the n_sign_posn ele-
ment of the struct lconv.
INT_P_CS_PRECEDES
The same as the value returned by localeconv in the int_p_cs_
precedes element of the struct lconv.
Chapter 7: Locales and Internationalization 200
INT_P_SEP_BY_SPACE
The same as the value returned by localeconv in the int_p_sep_by_
space element of the struct lconv.
INT_N_CS_PRECEDES
The same as the value returned by localeconv in the int_n_cs_
precedes element of the struct lconv.
INT_N_SEP_BY_SPACE
The same as the value returned by localeconv in the int_n_sep_by_
space element of the struct lconv.
INT_P_SIGN_POSN
The same as the value returned by localeconv in the int_p_sign_posn
element of the struct lconv.
INT_N_SIGN_POSN
The same as the value returned by localeconv in the int_n_sign_posn
element of the struct lconv.
DECIMAL_POINT
RADIXCHAR
The same as the value returned by localeconv in the decimal_point
element of the struct lconv.
The name RADIXCHAR is a deprecated alias still used in Unix98.
THOUSANDS_SEP
THOUSEP The same as the value returned by localeconv in the thousands_sep
element of the struct lconv.
The name THOUSEP is a deprecated alias still used in Unix98.
GROUPING The same as the value returned by localeconv in the grouping element
of the struct lconv.
YESEXPR The return value is a regular expression which can be used with the
regex function to recognize a positive response to a yes/no question.
The GNU C Library provides the rpmatch function for easier handling
in applications.
NOEXPR The return value is a regular expression which can be used with the regex
function to recognize a negative response to a yes/no question.
YESSTR The return value is a locale-specific translation of the positive response
to a yes/no question.
Using this value is deprecated since it is a very special case of message
translation, and is better handled by the message translation functions
(see Chapter 8 [Message Translation], page 206).
The use of this symbol is deprecated. Instead message translation should
be used.
NOSTR The return value is a locale-specific translation of the negative response
to a yes/no question. What is said for YESSTR is also true here.
Chapter 7: Locales and Internationalization 201
by the format string. Like strftime, the function also returns the number of bytes
written into the buffer.
There are two differences: strfmon can take more than one argument, and, of course,
the format specification is different. Like strftime, the format string consists of
normal text, which is output as is, and format specifiers, which are indicated by a
‘%’. Immediately after the ‘%’, you can optionally specify various flags and formatting
information before the main formatting character, in a similar way to printf:
• Immediately following the ‘%’ there can be one or more of the following flags:
‘=f’ The single byte character f is used for this field as the numeric fill
character. By default this character is a space character. Filling with
this character is only performed if a left precision is specified. It is
not just to fill to the given field width.
‘^’ The number is printed without grouping the digits according to the
rules of the current locale. By default grouping is enabled.
‘+’, ‘(’ At most one of these flags can be used. They select which format
to represent the sign of a currency amount. By default, and if ‘+’ is
given, the locale equivalent of +/− is used. If ‘(’ is given, negative
amounts are enclosed in parentheses. The exact format is determined
by the values of the LC_MONETARY category of the locale selected at
program runtime.
‘!’ The output will not contain the currency symbol.
‘-’ The output will be formatted left-justified instead of right-justified
if it does not fill the entire field width.
The next part of the specification is an optional field width. If no width is specified 0
is taken. During output, the function first determines how much space is required. If
it requires at least as many characters as given by the field width, it is output using
as much space as necessary. Otherwise, it is extended to use the full width by filling
with the space character. The presence or absence of the ‘-’ flag determines the side
at which such padding occurs. If present, the spaces are added at the right making
the output left-justified, and vice versa.
So far the format looks familiar, being similar to the printf and strftime formats.
However, the next two optional fields introduce something new. The first one is a ‘#’
character followed by a decimal digit string. The value of the digit string specifies
the number of digit positions to the left of the decimal point (or equivalent). This
does not include the grouping character when the ‘^’ flag is not given. If the space
needed to print the number does not fill the whole width, the field is padded at the
left side with the fill character, which can be selected using the ‘=’ flag and by default
is a space. For example, if the field width is selected as 6 and the number is 123, the
fill character is ‘*’ the result will be ‘***123’.
The second optional field starts with a ‘.’ (period) and consists of another decimal
digit string. Its value describes the number of characters printed after the decimal
point. The default is selected from the current locale (frac_digits, int_frac_
digits, see see Section 7.7.1.1 [Generic Numeric Formatting Parameters], page 192).
Chapter 7: Locales and Internationalization 203
If the exact representation needs more digits than given by the field width, the dis-
played value is rounded. If the number of fractional digits is selected to be zero, no
decimal point is printed.
As a GNU extension, the strfmon implementation in the GNU C Library allows an
optional ‘L’ next as a format modifier. If this modifier is given, the argument is
expected to be a long double instead of a double value.
Finally, the last component is a format specifier. There are three specifiers defined:
‘i’ Use the locale’s rules for formatting an international currency value.
‘n’ Use the locale’s rules for formatting a national currency value.
‘%’ Place a ‘%’ in the output. There must be no flag, width specifier or
modifier given, only ‘%%’ is allowed.
As for printf, the function reads the format string from left to right and uses the
values passed to the function following the format string. The values are expected to
be either of type double or long double, depending on the presence of the modifier
‘L’. The result is stored in the buffer pointed to by s. At most maxsize characters
are stored.
The return value of the function is the number of characters stored in s, including the
terminating NULL byte. If the number of characters stored would exceed maxsize, the
function returns −1 and the content of the buffer s is unspecified. In this case errno
is set to E2BIG.
A few examples should make clear how the function works. It is assumed that all the
following pieces of code are executed in a program which uses the USA locale (en_US). The
simplest form of the format is this:
strfmon (buf, 100, "@%n@%n@%n@", 123.45, -567.89, 12345.678);
The output produced is
"@$123.45@-$567.89@$12,345.68@"
We can notice several things here. First, the widths of the output numbers are different.
We have not specified a width in the format string, and so this is no wonder. Second, the
third number is printed using thousands separators. The thousands separator for the en_US
locale is a comma. The number is also rounded. .678 is rounded to .68 since the format
does not specify a precision and the default value in the locale is 2. Finally, note that the
national currency symbol is printed since ‘%n’ was used, not ‘i’. The next example shows
how we can align the output.
strfmon (buf, 100, "@%=*11n@%=*11n@%=*11n@", 123.45, -567.89, 12345.678);
The output this time is:
"@ $123.45@ -$567.89@ $12,345.68@"
Two things stand out. Firstly, all fields have the same width (eleven characters) since
this is the width given in the format and since no number required more characters to be
printed. The second important point is that the fill character is not used. This is correct
since the white space was not used to achieve a precision given by a ‘#’ modifier, but
instead to fill to the given width. The difference becomes obvious if we now add a width
specification.
strfmon (buf, 100, "@%=*11#5n@%=*11#5n@%=*11#5n@",
Chapter 7: Locales and Internationalization 204
8 Message Translation
The program’s interface with the user should be designed to ease the user’s task. One way
to ease the user’s task is to use messages in whatever language the user prefers.
Printing messages in different languages can be implemented in different ways. One could
add all the different languages in the source code and choose among the variants every time
a message has to be printed. This is certainly not a good solution since extending the set of
languages is cumbersome (the code must be changed) and the code itself can become really
big with dozens of message sets.
A better solution is to keep the message sets for each language in separate files which
are loaded at runtime depending on the language selection of the user.
The GNU C Library provides two different sets of functions to support message trans-
lation. The problem is that neither of the interfaces is officially defined by the POSIX
standard. The catgets family of functions is defined in the X/Open standard but this is
derived from industry decisions and therefore not necessarily based on reasonable decisions.
As mentioned above, the message catalog handling provides easy extendability by using
external data files which contain the message translations. I.e., these files contain for each
of the messages used in the program a translation for the appropriate language. So the
tasks of the message handling functions are
• locate the external data file with the appropriate translations
• load the data and make it possible to address the messages
• map a given key to the translated message
The two approaches mainly differ in the implementation of this last step. Decisions made
in the last step influence the rest of the design.
The catopen function tries to locate the message data file named cat name and loads
it when found. The return value is of an opaque type and can be used in calls to the
other functions to refer to this loaded catalog.
The return value is (nl_catd) -1 in case the function failed and no catalog was
loaded. The global variable errno contains a code for the error causing the failure.
But even if the function call succeeded this does not mean that all messages can be
translated.
Locating the catalog file must happen in a way which lets the user of the program
influence the decision. It is up to the user to decide about the language to use and
sometimes it is useful to use alternate catalog files. All this can be specified by the
user by setting some environment variables.
The first problem is to find out where all the message catalogs are stored. Every
program could have its own place to keep all the different files but usually the catalog
files are grouped by languages and the catalogs for all programs are kept in the same
place.
To tell the catopen function where the catalog for the program can be found the user
can set the environment variable NLSPATH to a value which describes her/his choice.
Since this value must be usable for different languages and locales it cannot be a
simple string. Instead it is a format string (similar to printf’s). An example is
/usr/share/locale/%L/%N:/usr/share/locale/%L/LC_MESSAGES/%N
First one can see that more than one directory can be specified (with the usual syntax
of separating them by colons). The next things to observe are the format string, %L
and %N in this case. The catopen function knows about several of them and the
replacement for all of them is of course different.
%N This format element is substituted with the name of the catalog file. This
is the value of the cat name argument given to catgets.
%L This format element is substituted with the name of the currently selected
locale for translating messages. How this is determined is explained be-
low.
%l (This is the lowercase ell.) This format element is substituted with the
language element of the locale name. The string describing the selected
locale is expected to have the form lang[_terr[.codeset]] and this
format uses the first part lang.
%t This format element is substituted by the territory part terr of the name
of the currently selected locale. See the explanation of the format above.
%c This format element is substituted by the codeset part codeset of the
name of the currently selected locale. See the explanation of the format
above.
%% Since % is used as a meta character there must be a way to express the
% character in the result itself. Using %% does this just like it works for
printf.
Chapter 8: Message Translation 208
Using NLSPATH allows arbitrary directories to be searched for message catalogs while
still allowing different languages to be used. If the NLSPATH environment variable is
not set, the default value is
prefix/share/locale/%L/%N:prefix/share/locale/%L/LC_MESSAGES/%N
where prefix is given to configure while installing the GNU C Library (this value is
in many cases /usr or the empty string).
The remaining problem is to decide which must be used. The value decides about
the substitution of the format elements mentioned above. First of all the user can
specify a path in the message catalog name (i.e., the name contains a slash character).
In this situation the NLSPATH environment variable is not used. The catalog must
exist as specified in the program, perhaps relative to the current working directory.
This situation in not desirable and catalogs names never should be written this way.
Beside this, this behavior is not portable to all other platforms providing the catgets
interface.
Otherwise the values of environment variables from the standard environment are
examined (see Section 26.4.2 [Standard Environment Variables], page 847). Which
variables are examined is decided by the flag parameter of catopen. If the value is
NL_CAT_LOCALE (which is defined in nl_types.h) then the catopen function uses the
name of the locale currently selected for the LC_MESSAGES category.
If flag is zero the LANG environment variable is examined. This is a left-over from
the early days when the concept of locales had not even reached the level of POSIX
locales.
The environment variable and the locale name should have a value of the form lang[_
terr[.codeset]] as explained above. If no environment variable is set the "C" locale
is used which prevents any translation.
The return value of the function is in any case a valid string. Either it is a translation
from a message catalog or it is the same as the string parameter. So a piece of code
to decide whether a translation actually happened must look like this:
{
char *trans = catgets (desc, set, msg, input_string);
if (trans == input_string)
{
/* Something went wrong. */
}
}
When an error occurs the global variable errno is set to
EBADF The catalog does not exist.
ENOMSG The set/message tuple does not name an existing element in the message
catalog.
While it sometimes can be useful to test for errors programs normally will avoid any
test. If the translation is not available it is no big problem if the original, untranslated
message is printed. Either the user understands this as well or s/he will look for the
reason why the messages are not translated.
Please note that the currently selected locale does not depend on a call to the setlocale
function. It is not necessary that the locale data files for this locale exist and calling
Chapter 8: Message Translation 209
setlocale succeeds. The catopen function directly reads the values of the environment
variables.
entries which associate the set/message tuple with a specific translation. This file format is
specified in the X/Open standard and is as follows:
• Lines containing only whitespace characters or empty lines are ignored.
• Lines which contain as the first non-whitespace character a $ followed by a whitespace
character are comment and are also ignored.
• If a line contains as the first non-whitespace characters the sequence $set followed by
a whitespace character an additional argument is required to follow. This argument
can either be:
− a number. In this case the value of this number determines the set to which the
following messages are added.
− an identifier consisting of alphanumeric characters plus the underscore character.
In this case the set get automatically a number assigned. This value is one added
to the largest set number which so far appeared.
How to use the symbolic names is explained in section Section 8.1.4 [How to use
the catgets interface], page 213.
It is an error if a symbol name appears more than once. All following messages
are placed in a set with this number.
• If a line contains as the first non-whitespace characters the sequence $delset followed
by a whitespace character an additional argument is required to follow. This argument
can either be:
− a number. In this case the value of this number determines the set which will be
deleted.
− an identifier consisting of alphanumeric characters plus the underscore character.
This symbolic identifier must match a name for a set which previously was defined.
It is an error if the name is unknown.
In both cases all messages in the specified set will be removed. They will not appear in
the output. But if this set is later again selected with a $set command again messages
could be added and these messages will appear in the output.
• If a line contains after leading whitespaces the sequence $quote, the quoting character
used for this input file is changed to the first non-whitespace character following $quote.
If no non-whitespace character is present before the line ends quoting is disabled.
By default no quoting character is used. In this mode strings are terminated with the
first unescaped line break. If there is a $quote sequence present newline need not be
escaped. Instead a string is terminated with the first unescaped appearance of the
quote character.
A common usage of this feature would be to set the quote character to ". Then any
appearance of the " in the strings must be escaped using the backslash (i.e., \" must
be written).
• Any other line must start with a number or an alphanumeric identifier (with the under-
score character included). The following characters (starting after the first whitespace
character) will form the string which gets associated with the currently selected set and
the message number represented by the number and identifier respectively.
If the start of the line is a number the message number is obvious. It is an error if the
same message number already appeared for this set.
Chapter 8: Message Translation 211
If the leading token was an identifier the message number gets automatically assigned.
The value is the current maximum message number for this set plus one. It is an error if
the identifier was already used for a message in this set. It is OK to reuse the identifier
for a message in another thread. How to use the symbolic identifiers will be explained
below (see Section 8.1.4 [How to use the catgets interface], page 213). There is one
limitation with the identifier: it must not be Set. The reason will be explained below.
The text of the messages can contain escape characters. The usual bunch of characters
known from the ISO C language are recognized (\n, \t, \v, \b, \r, \f, \\, and \nnn,
where nnn is the octal coding of a character code).
Important: The handling of identifiers instead of numbers for the set and messages is
a GNU extension. Systems strictly following the X/Open specification do not have this
feature. An example for a message catalog file is this:
$ This is a leading comment.
$quote "
$set SetOne
1 Message with ID 1.
two " Message with ID \"two\", which gets the value 2 assigned"
$set SetTwo
$ Since the last set got the number 1 assigned this set has number 2.
4000 "The numbers can be arbitrary, they need not start at one."
This small example shows various aspects:
• Lines 1 and 9 are comments since they start with $ followed by a whitespace.
• The quoting character is set to ". Otherwise the quotes in the message definition would
have to be omitted and in this case the message with the identifier two would lose its
leading whitespace.
• Mixing numbered messages with messages having symbolic names is no problem and
the numbering happens automatically.
While this file format is pretty easy it is not the best possible for use in a running
program. The catopen function would have to parse the file and handle syntactic errors
gracefully. This is not so easy and the whole process is pretty slow. Therefore the catgets
functions expect the data in another more compact and ready-to-use file format. There is
a special program gencat which is explained in detail in the next section.
Files in this other format are not human readable. To be easy to use by programs it is a
binary file. But the format is byte order independent so translation files can be shared by
systems of arbitrary architecture (as long as they use the GNU C Library).
Details about the binary file format are not important to know since these files are always
created by the gencat program. The sources of the GNU C Library also provide the sources
for the gencat program and so the interested reader can look through these source files to
learn about the file format.
extension are implemented which help to work in a more reasonable way with the catgets
functions.
The gencat program can be invoked in two ways:
`gencat [Option ...] [Output-File [Input-File ...]]`
This is the interface defined in the X/Open standard. If no Input-File parameter is
given, input will be read from standard input. Multiple input files will be read as if they
were concatenated. If Output-File is also missing, the output will be written to standard
output. To provide the interface one is used to from other programs a second interface is
provided.
`gencat [Option ...] -o Output-File [Input-File ...]`
The option ‘-o’ is used to specify the output file and all file arguments are used as input
files.
Beside this one can use - or /dev/stdin for Input-File to denote the standard input.
Corresponding one can use - and /dev/stdout for Output-File to denote standard output.
Using - as a file name is allowed in X/Open while using the device names is a GNU extension.
The gencat program works by concatenating all input files and then merging the result-
ing collection of message sets with a possibly existing output file. This is done by removing
all messages with set/message number tuples matching any of the generated messages from
the output file and then adding all the new messages. To regenerate a catalog file while ig-
noring the old contents therefore requires removing the output file if it exists. If the output
is written to standard output no merging takes place.
The following table shows the options understood by the gencat program. The X/Open
standard does not specify any options for the program so all of these are GNU extensions.
‘-V’
‘--version’
Print the version information and exit.
‘-h’
‘--help’ Print a usage message listing all available options, then exit successfully.
‘--new’ Do not merge the new messages from the input files with the old content of the
output file. The old content of the output file is discarded.
‘-H’
‘--header=name’
This option is used to emit the symbolic names given to sets and messages in
the input files for use in the program. Details about how to use this are given in
the next section. The name parameter to this option specifies the name of the
output file. It will contain a number of C preprocessor #defines to associate a
name with a number.
Please note that the generated file only contains the symbols from the input
files. If the output is merged with the previous content of the output file the
possibly existing symbols from the file(s) which generated the old output files
are not in the generated header file.
Chapter 8: Message Translation 213
even in these situations the functions will behave reasonable. They simply will be return a
translation.
What remains unspecified here are the constants SetMainSet and SetMainHello. These
are the symbolic names describing the message. To get the actual definitions which match
the information in the catalog file we have to create the message catalog source file and
process it using the gencat program.
$ Messages for the famous greeting program.
$quote "
$set Main
Hello "Hallo, Welt!\n"
Now we can start building the program (assume the message catalog source file is named
hello.msg and the program source file hello.c):
% gencat -H msgnrs.h -o hello.cat hello.msg
% cat msgnrs.h
#define MainSet 0x1 /* hello.msg:4 */
#define MainHello 0x1 /* hello.msg:5 */
% gcc -o hello hello.c -I.
% cp hello.cat /usr/share/locale/de/LC_MESSAGES
% echo $LC_ALL
de
% ./hello
Hallo, Welt!
%
The call of the gencat program creates the missing header file msgnrs.h as well as the
message catalog binary. The former is used in the compilation of hello.c while the later is
placed in a directory in which the catopen function will try to locate it. Please check the
LC_ALL environment variable and the default path for catopen presented in the description
above.
necessary since for a user who speaks the language the program was developed in, the
message does not need any translation.
The remaining two functions to access the message catalog add some functionality to
select a message catalog which is not the default one. This is important if parts of the
program are developed independently. Every part can have its own message catalog and all
of them can be used at the same time. The C library itself is an example: internally it uses
the gettext functions but since it must not depend on a currently selected default message
catalog it must specify all ambiguous information.
When using the three functions above in a program it is a frequent case that the msgid
argument is a constant string. So it is worthwhile to optimize this case. Thinking shortly
about this one will realize that as long as no new message catalog is loaded the translation
of a message will not change. This optimization is actually implemented by the gettext,
dgettext and dcgettext functions.
many domains at the same time. E.g., the GNU C Library itself uses a domain named libc
while the program using the C Library could use a domain named foo. The important
point is that at any time exactly one domain is active. This is controlled with the following
function.
char * textdomain (const char *domainname) [Function]
Preliminary: | MT-Safe | AS-Unsafe lock heap | AC-Unsafe lock mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The textdomain function sets the default domain, which is used in all future gettext
calls, to domainname. Please note that dgettext and dcgettext calls are not influ-
enced if the domainname parameter of these functions is not the null pointer.
Before the first call to textdomain the default domain is messages. This is the name
specified in the specification of the gettext API. This name is as good as any other
name. No program should ever really use a domain with this name since this can
only lead to problems.
The function returns the value which is from now on taken as the default domain. If
the system went out of memory the returned value is NULL and the global variable
errno is set to ENOMEM. Despite the return value type being char * the return string
must not be changed. It is allocated internally by the textdomain function.
If the domainname parameter is the null pointer no new default domain is set. Instead
the currently selected default domain is returned.
If the domainname parameter is the empty string the default domain is reset to its
initial value, the domain with the name messages. This possibility is questionable to
use since the domain messages really never should be used.
char * bindtextdomain (const char *domainname, const char [Function]
*dirname)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The bindtextdomain function can be used to specify the directory which contains
the message catalogs for domain domainname for the different languages. To be
correct, this is the directory where the hierarchy of directories is expected. Details
are explained below.
For the programmer it is important to note that the translations which come with the
program have to be placed in a directory hierarchy starting at, say, /foo/bar. Then
the program should make a bindtextdomain call to bind the domain for the current
program to this directory. So it is made sure the catalogs are found. A correctly
running program does not depend on the user setting an environment variable.
The bindtextdomain function can be used several times and if the domainname
argument is different the previously bound domains will not be overwritten.
If the program which wish to use bindtextdomain at some point of time use the chdir
function to change the current working directory it is important that the dirname
strings ought to be an absolute pathname. Otherwise the addressed directory might
vary with the time.
If the dirname parameter is the null pointer bindtextdomain returns the currently
selected directory for the domain with the name domainname.
Chapter 8: Message Translation 220
limitation but since the GNU C Library (as well as the GNU gettext package) is written
as part of the GNU package and the coding standards for the GNU project require programs
to be written in English, this solution nevertheless fulfills its purpose.
char * ngettext (const char *msgid1, const char *msgid2, [Function]
unsigned long int n)
Preliminary: | MT-Safe env | AS-Unsafe corrupt heap lock dlopen | AC-Unsafe
corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The ngettext function is similar to the gettext function as it finds the message
catalogs in the same way. But it takes two extra arguments. The msgid1 parameter
must contain the singular form of the string to be converted. It is also used as the
key for the search in the catalog. The msgid2 parameter is the plural form. The
parameter n is used to determine the plural form. If no message catalog is found
msgid1 is returned if n == 1, otherwise msgid2.
An example for the use of this function is:
printf (ngettext ("%d file removed", "%d files removed", n), n);
Please note that the numeric value n has to be passed to the printf function as well.
It is not sufficient to pass it only to ngettext.
char * dngettext (const char *domain, const char *msgid1, [Function]
const char *msgid2, unsigned long int n)
Preliminary: | MT-Safe env | AS-Unsafe corrupt heap lock dlopen | AC-Unsafe
corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The dngettext is similar to the dgettext function in the way the message catalog is
selected. The difference is that it takes two extra parameters to provide the correct
plural form. These two parameters are handled in the same way ngettext handles
them.
char * dcngettext (const char *domain, const char *msgid1, [Function]
const char *msgid2, unsigned long int n, int category)
Preliminary: | MT-Safe env | AS-Unsafe corrupt heap lock dlopen | AC-Unsafe
corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The dcngettext is similar to the dcgettext function in the way the message catalog
is selected. The difference is that it takes two extra parameters to provide the correct
plural form. These two parameters are handled in the same way ngettext handles
them.
The information about the plural form selection has to be stored in the header entry
(the one with the empty msgid string). It looks like this:
Plural-Forms: nplurals=2; plural=n == 1 ? 0 : 1;
The nplurals value must be a decimal number which specifies how many different
plural forms exist for this language. The string following plural is an expression using the
C language syntax. Exceptions are that no negative numbers are allowed, numbers must be
decimal, and the only variable allowed is n. This expression will be evaluated whenever one
of the functions ngettext, dngettext, or dcngettext is called. The numeric value passed
to these functions is then substituted for all uses of the variable n in the expression. The
resulting value then must be greater or equal to zero and smaller than the value given as
the value of nplurals.
The following rules are known at this point. The language with families are listed. But this
does not necessarily mean the information can be generalized for the whole family (as can
be easily seen in the table below).1
Only one form:
Some languages only require one single form. There is no distinction between
the singular and plural form. An appropriate header entry would look like this:
Plural-Forms: nplurals=1; plural=0;
Languages with this property include:
Finno-Ugric family
Hungarian
Asian family
Japanese, Korean
Turkic/Altaic family
Turkish
Two forms, singular used for one only
This is the form used in most existing programs since it is what English uses.
A header entry would look like this:
Plural-Forms: nplurals=2; plural=n != 1;
(Note: this uses the feature of C expressions that boolean expressions have to
value zero or one.)
Languages with this property include:
Germanic family
Danish, Dutch, English, German, Norwegian, Swedish
Finno-Ugric family
Estonian, Finnish
Latin/Greek family
Greek
Semitic family
Hebrew
1
Additions are welcome. Send appropriate information to bug-glibc-manual@gnu.org.
Chapter 8: Message Translation 223
Romance family
Italian, Portuguese, Spanish
Artificial Esperanto
Two forms, singular used for zero and one
Exceptional case in the language family. The header entry would be:
Plural-Forms: nplurals=2; plural=n>1;
Languages with this property include:
Romanic family
French, Brazilian Portuguese
Three forms, special case for zero
The header entry would be:
Plural-Forms: nplurals=3; plural=n%10==1 && n%100!=11 ? 0 : n != 0 ? 1 : 2;
Languages with this property include:
Baltic family
Latvian
Three forms, special cases for one and two
The header entry would be:
Plural-Forms: nplurals=3; plural=n==1 ? 0 : n==2 ? 1 : 2;
Languages with this property include:
Celtic Gaeilge (Irish)
Three forms, special case for numbers ending in 1[2-9]
The header entry would look like this:
Plural-Forms: nplurals=3; \
plural=n%10==1 && n%100!=11 ? 0 : \
n%10>=2 && (n%100<10 || n%100>=20) ? 1 : 2;
Languages with this property include:
Baltic family
Lithuanian
Three forms, special cases for numbers ending in 1 and 2, 3, 4, except those ending in
1[1-4]
The header entry would look like this:
Plural-Forms: nplurals=3; \
plural=n%100/10==1 ? 2 : n%10==1 ? 0 : (n+9)%10>3 ? 2 : 1;
Languages with this property include:
Slavic family
Croatian, Czech, Russian, Ukrainian
Three forms, special cases for 1 and 2, 3, 4
The header entry would look like this:
Plural-Forms: nplurals=3; \
plural=(n==1) ? 1 : (n>=2 && n<=4) ? 2 : 0;
Chapter 8: Message Translation 224
What this little function does is to recognize the case when no translation is available.
This can be done very efficiently by a pointer comparison since the return value is the input
value. If there is no translation we know that the input string is in the format we used
for the Menu entries and therefore contains a | character. We simply search for the last
occurrence of this character and return a pointer to the character following it. That’s it!
If one now consistently uses the extended string form and replaces the gettext calls with
calls to sgettext (this is normally limited to very few places in the GUI implementation)
then it is possible to produce a program which can be internationalized.
With advanced compilers (such as GNU C) one can write the sgettext functions as an
inline function or as a macro like this:
#define sgettext(msgid) \
({ const char *__msgid = (msgid); \
char *__msgstr = gettext (__msgid); \
if (__msgval == __msgid) \
__msgval = strrchr (__msgid, '|') + 1; \
__msgval; })
The other gettext functions (dgettext, dcgettext and the ngettext equivalents) can
and should have corresponding functions as well which look almost identical, except for the
parameters and the call to the underlying function.
Now there is of course the question why such functions do not exist in the GNU C
Library? There are two parts of the answer to this question.
• They are easy to write and therefore can be provided by the project they are used in.
This is not an answer by itself and must be seen together with the second part which
is:
• There is no way the C library can contain a version which can work everywhere. The
problem is the selection of the character to separate the prefix from the actual string in
the extended string. The examples above used | which is a quite good choice because
it resembles a notation frequently used in this context and it also is a character not
often used in message strings.
But what if the character is used in message strings. Or if the chose character is not
available in the character set on the machine one compiles (e.g., | is not required to exist
for ISO C; this is why the iso646.h file exists in ISO C programming environments).
There is only one more comment to make left. The wrapper function above requires
that the translations strings are not extended themselves. This is only logical. There is no
need to disambiguate the strings (since they are never used as keys for a search) and one
also saves quite some memory and disk space by doing this.
Chapter 8: Message Translation 227
While for the LC_xxx variables the value should consist of exactly one specification of a
locale the LANGUAGE variable’s value can consist of a colon separated list of locale names.
The attentive reader will realize that this is the way we manage to implement one of our
additional demands above: we want to be able to specify an ordered list of languages.
Back to the constructed filename we have only one component missing. The
domain name part is the name which was either registered using the textdomain function
or which was given to dgettext or dcgettext as the first parameter. Now it becomes
obvious that a good choice for the domain name in the program code is a string which is
closely related to the program/package name. E.g., for the GNU C Library the domain
name is libc.
A limited piece of example code should show how the program is supposed to work:
{
setlocale (LC_ALL, "");
textdomain ("test-package");
bindtextdomain ("test-package", "/usr/local/share/locale");
puts (gettext ("Hello, world!"));
}
At the program start the default domain is messages, and the default locale is "C".
The setlocale call sets the locale according to the user’s environment variables; remember
that correct functioning of gettext relies on the correct setting of the LC_MESSAGES locale
(for looking up the message catalog) and of the LC_CTYPE locale (for the character set
conversion). The textdomain call changes the default domain to test-package. The
bindtextdomain call specifies that the message catalogs for the domain test-package can
be found below the directory /usr/local/share/locale.
If the user sets in her/his environment the variable LANGUAGE to de the gettext function
will try to use the translations from the file
/usr/local/share/locale/de/LC_MESSAGES/test-package.mo
From the above descriptions it should be clear which component of this filename is
determined by which source.
In the above example we assumed the LANGUAGE environment variable to be de. This
might be an appropriate selection but what happens if the user wants to use LC_ALL be-
cause of the wider usability and here the required value is de_DE.ISO-8859-1? We already
mentioned above that a situation like this is not infrequent. E.g., a person might prefer
reading a dialect and if this is not available fall back on the standard language.
The gettext functions know about situations like this and can handle them gracefully.
The functions recognize the format of the value of the environment variable. It can split the
value is different pieces and by leaving out the only or the other part it can construct new
values. This happens of course in a predictable way. To understand this one must know
the format of the environment variable value. There is one more or less standardized form,
originally from the X/Open specification:
language[_territory[.codeset]][@modifier]
Less specific locale names will be stripped in the order of the following list:
1. codeset
2. normalized codeset
3. territory
Chapter 8: Message Translation 229
4. modifier
The language field will never be dropped for obvious reasons.
The only new thing is the normalized codeset entry. This is another goodie which is
introduced to help reduce the chaos which derives from the inability of people to stan-
dardize the names of character sets. Instead of ISO-8859-1 one can often see 8859-1,
88591, iso8859-1, or iso 8859-1. The normalized codeset value is generated from the
user-provided character set name by applying the following rules:
1. Remove all characters besides numbers and letters.
2. Fold letters to lowercase.
3. If the same only contains digits prepend the string "iso".
So all of the above names will be normalized to iso88591. This allows the program user
much more freedom in choosing the locale name.
Even this extended functionality still does not help to solve the problem that completely
different names can be used to denote the same locale (e.g., de and german). To be of
help in this situation the locale implementation and also the gettext functions know about
aliases.
The file /usr/share/locale/locale.alias (replace /usr with whatever prefix you used
for configuring the C library) contains a mapping of alternative names to more regular
names. The system manager is free to add new entries to fill her/his own needs. The
selected locale from the environment is compared with the entries in the first column of this
file ignoring the case. If they match, the value of the second column is used instead for the
further handling.
In the description of the format of the environment variables we already mentioned the
character set as a factor in the selection of the message catalog. In fact, only catalogs which
contain text written using the character set of the system/program can be used (directly;
there will come a solution for this some day). This means for the user that s/he will always
have to take care of this. If in the collection of the message catalogs there are files for the
same language but coded using different character sets the user has to be careful.
Other programs help to manage the development cycle when new messages appear in
the source files or when a new translation of the messages appears. Here it should only
be noted that using all the tools in GNU gettext it is possible to completely automate the
handling of message catalogs. Besides marking the translatable strings in the source code
and generating the translations the developers do not have anything to do themselves.
231
often get added to or deleted from the array in which case it might not be useful to
sort the array before searching.
To search a sorted or partially sorted array for an element matching the key, use the
bsearch function. The prototype for this function is in the header file stdlib.h.
void * bsearch (const void *key, const void *array, size_t [Function]
count, size_t size, comparison_fn_t compare)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The bsearch function searches array for an element that is equivalent to key. The
array contains count elements, each of which is of size size bytes.
The compare function is used to perform the comparison. This function is called with
arguments that point to the key and to an array element, in that order, and should
return an integer less than, equal to, or greater than zero corresponding to whether
the key is considered less than, equal to, or greater than the array element. The
function should not alter the array’s contents, and the same array element should
always compare the same way with the key.
Although the array need not be completely sorted, it should be partially sorted with
respect to key. That is, the array should begin with elements that compare less than
key, followed by elements that compare equal to key, and ending with elements that
compare greater than key. Any or all of these element sequences can be empty.
The return value is a pointer to a matching array element, or a null pointer if no
match is found. If the array contains more than one element that matches, the one
that is returned is unspecified.
This function derives its name from the fact that it is implemented using the binary
search algorithm.
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
struct critter
{
const char *name;
const char *species;
};
int
critter_cmp (const void *v1, const void *v2)
{
const struct critter *c1 = v1;
const struct critter *c2 = v2;
void
print_critter (const struct critter *c)
{
printf ("%s, the %s\n", c->name, c->species);
}
Chapter 9: Searching and Sorting 235
void
find_critter (const char *name)
{
struct critter target, *result;
target.name = name;
result = bsearch (&target, muppets, count, sizeof (struct critter),
critter_cmp);
if (result)
print_critter (result);
else
printf ("Couldn't find %s.\n", name);
}
/* Main program. */
int
main (void)
{
int i;
find_critter ("Kermit");
find_critter ("Gonzo");
find_critter ("Janice");
return 0;
}
The output from this program looks like:
Kermit, the frog
Piggy, the pig
Gonzo, the whatever
Fozzie, the bear
Sam, the eagle
Robin, the frog
Animal, the animal
Camilla, the chicken
Sweetums, the monster
Dr. Strangepork, the pig
Link Hogthrob, the pig
Zoot, the human
Dr. Bunsen Honeydew, the human
Beaker, the human
Swedish Chef, the human
The hdestroy function can be used to free all the resources allocated in a previous
call of hcreate. After a call to this function it is again possible to call hcreate and
allocate a new table with possibly different size.
It is important to remember that the elements contained in the hashing table at the
time hdestroy is called are not freed by this function. It is the responsibility of
the program code to free those strings (if necessary at all). Freeing all the element
memory is not possible without extra, separately kept information since there is no
function to iterate through all available elements in the hashing table. If it is really
necessary to free a table and all elements the programmer has to keep a list of all
table elements and before calling hdestroy s/he has to free all element’s data using
this list. This is a very unpleasant mechanism and it also shows that this kind of
hashing table is mainly meant for tables which are created once and used until the
end of the program run.
Entries of the hashing table and keys for the search are defined using this type:
ENTRY [Data type]
char *key Pointer to a zero-terminated string of characters describing the key for
the search or the element in the hashing table.
This is a limiting restriction of the functionality of the hsearch functions:
They can only be used for data sets which use the NUL character always
and solely to terminate keys. It is not possible to handle general binary
data for keys.
void *data
Generic pointer for use by the application. The hashing table implemen-
tation preserves this pointer in entries, but does not use it in any way
otherwise.
struct entry [Data type]
The underlying type of ENTRY.
ENTRY * hsearch (ENTRY item, ACTION action) [Function]
Preliminary: | MT-Unsafe race:hsearch | AS-Unsafe | AC-Unsafe cor-
rupt/action==ENTER | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
To search in a hashing table created using hcreate the hsearch function must be
used. This function can perform a simple search for an element (if action has the value
FIND) or it can alternatively insert the key element into the hashing table. Entries
are never replaced.
The key is denoted by a pointer to an object of type ENTRY. For locating the cor-
responding position in the hashing table only the key element of the structure is
used.
If an entry with a matching key is found the action parameter is irrelevant. The found
entry is returned. If no matching entry is found and the action parameter has the
value FIND the function returns a NULL pointer. If no entry is found and the action
parameter has the value ENTER a new entry is added to the hashing table which is
initialized with the parameter item. A pointer to the newly added entry is returned.
Chapter 9: Searching and Sorting 238
As mentioned before, the hashing table used by the functions described so far is global
and there can be at any time at most one hashing table in the program. A solution is to
use the following functions which are a GNU extension. All have in common that they
operate on a hashing table which is described by the content of an object of the type
struct hsearch_data. This type should be treated as opaque, none of its members should
be changed directly.
ENOMEM The table is filled and hsearch_r was called with a so far unknown key
and action set to ENTER.
ESRCH The action parameter is FIND and no corresponding element is found in
the table.
Chapter 9: Searching and Sorting 239
Another advantage of the tsearch functions in contrast to the hsearch functions is that
there is an easy way to remove elements.
In addition to the functions to create and destroy the tree data structure, there is another
function which allows you to apply a function to all elements of the tree. The function must
have this type:
void __action_fn_t (const void *nodep, VISIT value, int level);
The nodep is the data value of the current node (once given as the key argument to
tsearch). level is a numeric value which corresponds to the depth of the current node in
the tree. The root node has the depth 0 and its children have a depth of 1 and so on. The
VISIT type is an enumeration type.
endorder The current node is an internal node and the function is called after the
second child was processed.
leaf The current node is a leaf.
void twalk (const void *root, __action_fn_t action) [Function]
Preliminary: | MT-Safe race:root | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
For each node in the tree with a node pointed to by root, the twalk function calls
the function provided by the parameter action. For leaf nodes the function is called
exactly once with value set to leaf. For internal nodes the function is called three
times, setting the value parameter or action to the appropriate value. The level
argument for the action function is computed while descending the tree by increasing
the value by one for each descent to a child, starting with the value 0 for the root
node.
Since the functions used for the action parameter to twalk must not modify the tree
data, it is safe to run twalk in more than one thread at the same time, working on
the same tree. It is also safe to call tfind in parallel. Functions which modify the
tree must not be used, otherwise the behavior is undefined. However, it is difficult
to pass data external to the tree to the callback function without resorting to global
variables (and thread safety issues), so see the twalk_r function below.
void twalk_r (const void *root, void (*action) (const void [Function]
*key, VISIT which, void *closure), void *closure)
Preliminary: | MT-Safe race:root | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
For each node in the tree with a node pointed to by root, the twalk_r function calls
the function provided by the parameter action. For leaf nodes the function is called
exactly once with which set to leaf. For internal nodes the function is called three
times, setting the which parameter of action to the appropriate value. The closure
parameter is passed down to each call of the action function, unmodified.
It is possible to implement the twalk function on top of the twalk_r function, which
is why there is no separate level parameter.
#include <search.h>
struct twalk_with_twalk_r_closure
{
void (*action) (const void *, VISIT, int);
int depth;
};
static void
twalk_with_twalk_r_action (const void *nodep, VISIT which, void *closure0)
{
struct twalk_with_twalk_r_closure *closure = closure0;
switch (which)
{
case leaf:
closure->action (nodep, which, closure->depth);
Chapter 9: Searching and Sorting 242
break;
case preorder:
closure->action (nodep, which, closure->depth);
++closure->depth;
break;
case postorder:
/* The preorder action incremented the depth. */
closure->action (nodep, which, closure->depth - 1);
break;
case endorder:
--closure->depth;
closure->action (nodep, which, closure->depth);
break;
}
}
void
twalk (const void *root, void (*action) (const void *, VISIT, int))
{
struct twalk_with_twalk_r_closure closure = { action, 0 };
twalk_r (root, twalk_with_twalk_r_action, &closure);
}
243
10 Pattern Matching
The GNU C Library provides pattern matching facilities for two kinds of patterns: regular
expressions and file-name wildcards. The library also provides a facility for expanding
variable and command references and parsing text into words in the way the shell does.
FNM_LEADING_DIR
Ignore a trailing sequence of characters starting with a ‘/’ in string; that is to
say, test whether string starts with a directory name that pattern matches.
If this flag is set, either ‘foo*’ or ‘foobar’ as a pattern would match the string
‘foobar/frobozz’.
FNM_CASEFOLD
Ignore case in comparing string to pattern.
FNM_EXTMATCH
Besides the normal patterns, also recognize the extended patterns introduced
in ksh. The patterns are written in the form explained in the following table
where pattern-list is a | separated list of patterns.
?(pattern-list)
The pattern matches if zero or one occurrences of any of the pat-
terns in the pattern-list allow matching the input string.
*(pattern-list)
The pattern matches if zero or more occurrences of any of the pat-
terns in the pattern-list allow matching the input string.
+(pattern-list)
The pattern matches if one or more occurrences of any of the pat-
terns in the pattern-list allow matching the input string.
@(pattern-list)
The pattern matches if exactly one occurrence of any of the patterns
in the pattern-list allows matching the input string.
!(pattern-list)
The pattern matches if the input string cannot be matched with
any of the patterns in the pattern-list.
10.2 Globbing
The archetypal use of wildcards is for matching against the files in a directory, and making
a list of all the matches. This is called globbing.
You could do this using fnmatch, by reading the directory entries one by one and testing
each one with fnmatch. But that would be slow (and complex, since you would have to
handle subdirectories by hand).
The library provides a function glob to make this particular use of wildcards convenient.
glob and the other symbols in this section are declared in glob.h.
#include <dirent.h>
Chapter 10: Pattern Matching 246
#include <errno.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
struct dirent *
mkdirent (const char *name)
{
size_t dirent_size = offsetof (struct dirent, d_name) + 1;
size_t name_length = strlen (name);
size_t total_size = dirent_size + name_length;
if (total_size < dirent_size)
{
errno = ENOMEM;
return NULL;
}
struct dirent *result = malloc (total_size);
if (result == NULL)
return NULL;
result->d_type = DT_UNKNOWN;
result->d_ino = 1; /* Do not skip this entry. */
memcpy (result->d_name, name, name_length + 1);
return result;
}
The glob function reads the struct dirent members listed above and
makes a copy of the file name in the d_name member immediately after
the gl_readdir callback function returns. Future invocations of any of
the callback functions may deallocate or reuse the buffer. It is the respon-
sibility of the caller of the glob function to allocate and deallocate the
buffer, around the call to glob or using the callback functions. For exam-
ple, an application could allocate the buffer in the gl_readdir callback
function, and deallocate it in the gl_closedir callback function.
The gl_readdir member is a GNU extension.
gl_opendir
The address of an alternative implementation of the opendir function.
It is used if the GLOB_ALTDIRFUNC bit is set in the flag parameter. The
type of this field is void *(*) (const char *).
This is a GNU extension.
gl_flags The flags used when glob was called. In addition, GLOB_MAGCHAR might
be set. See Section 10.2.2 [Flags for Globbing], page 249, for more details.
This is a GNU extension.
For use in the glob64 function glob.h contains another definition for a very similar type.
glob64_t differs from glob_t only in the types of the members gl_readdir, gl_stat, and
gl_lstat.
glob64_t [Data Type]
This data type holds a pointer to a word vector. More precisely, it records both the
address of the word vector and its size. The GNU implementation contains some
more fields which are non-standard extensions.
gl_pathc The number of elements in the vector, excluding the initial null entries if
the GLOB DOOFFS flag is used (see gl offs below).
gl_pathv The address of the vector. This field has type char **.
gl_offs The offset of the first real element of the vector, from its nominal address
in the gl_pathv field. Unlike the other fields, this is always an input to
glob, rather than an output from it.
If you use a nonzero offset, then that many elements at the beginning
of the vector are left empty. (The glob function fills them with null
pointers.)
The gl_offs field is meaningful only if you use the GLOB_DOOFFS flag.
Otherwise, the offset is always zero regardless of what is in this field, and
the first real element comes at the beginning of the vector.
gl_closedir
The address of an alternative implementation of the closedir function.
It is used if the GLOB_ALTDIRFUNC bit is set in the flag parameter. The
type of this field is void (*) (void *).
This is a GNU extension.
gl_readdir
The address of an alternative implementation of the readdir64 func-
tion used to read the contents of a directory. It is used if the GLOB_
ALTDIRFUNC bit is set in the flag parameter. The type of this field is
struct dirent64 *(*) (void *).
This is a GNU extension.
gl_opendir
The address of an alternative implementation of the opendir function.
It is used if the GLOB_ALTDIRFUNC bit is set in the flag parameter. The
type of this field is void *(*) (const char *).
This is a GNU extension.
gl_stat The address of an alternative implementation of the stat64 function to
get information about an object in the filesystem. It is used if the GLOB_
ALTDIRFUNC bit is set in the flag parameter. The type of this field is
int (*) (const char *, struct stat64 *).
Chapter 10: Pattern Matching 248
int glob (const char *pattern, int flags, int (*errfunc) [Function]
(const char *filename, int error-code), glob_t *vector-ptr)
Preliminary: | MT-Unsafe race:utent env sig:ALRM timer locale | AS-Unsafe dlopen
plugin corrupt heap lock | AC-Unsafe corrupt lock fd mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The function glob does globbing using the pattern pattern in the current directory.
It puts the result in a newly allocated vector, and stores the size and address of
this vector into *vector-ptr. The argument flags is a combination of bit flags; see
Section 10.2.2 [Flags for Globbing], page 249, for details of the flags.
The result of globbing is a sequence of file names. The function glob allocates a string
for each resulting word, then allocates a vector of type char ** to store the addresses
of these strings. The last element of the vector is a null pointer. This vector is called
the word vector.
To return this vector, glob stores both its address and its length (number of elements,
not counting the terminating null pointer) into *vector-ptr.
Normally, glob sorts the file names alphabetically before returning them. You can
turn this off with the flag GLOB_NOSORT if you want to get the information as fast
as possible. Usually it’s a good idea to let glob sort them—if you process the files
in alphabetical order, the users will have a feel for the rate of progress that your
application is making.
If glob succeeds, it returns 0. Otherwise, it returns one of these error codes:
GLOB_ABORTED
There was an error opening a directory, and you used the flag GLOB_ERR
or your specified errfunc returned a nonzero value. See below for an
explanation of the GLOB_ERR flag and errfunc.
GLOB_NOMATCH
The pattern didn’t match any existing files. If you use the GLOB_NOCHECK
flag, then you never get this error code, because that flag tells glob to
pretend that the pattern matched at least one file.
GLOB_NOSPACE
It was impossible to allocate memory to hold the result.
In the event of an error, glob stores information in *vector-ptr about all the matches
it has found so far.
Chapter 10: Pattern Matching 249
It is important to notice that the glob function will not fail if it encounters directories
or files which cannot be handled without the LFS interfaces. The implementation of
glob is supposed to use these functions internally. This at least is the assumption
made by the Unix standard. The GNU extension of allowing the user to provide their
own directory handling and stat functions complicates things a bit. If these callback
functions are used and a large file or directory is encountered glob can fail.
int glob64 (const char *pattern, int flags, int (*errfunc) [Function]
(const char *filename, int error-code), glob64_t *vector-ptr)
Preliminary: | MT-Unsafe race:utent env sig:ALRM timer locale | AS-Unsafe dlopen
corrupt heap lock | AC-Unsafe corrupt lock fd mem | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
The glob64 function was added as part of the Large File Summit extensions but is not
part of the original LFS proposal. The reason for this is simple: it is not necessary.
The necessity for a glob64 function is added by the extensions of the GNU glob
implementation which allows the user to provide their own directory handling and
stat functions. The readdir and stat functions do depend on the choice of _FILE_
OFFSET_BITS since the definition of the types struct dirent and struct stat will
change depending on the choice.
Besides this difference, glob64 works just like glob in all aspects.
This function is a GNU extension.
might include a directory in which you don’t have the requisite access. Nor-
mally, glob tries its best to keep on going despite any errors, reading whatever
directories it can.
You can exercise even more control than this by specifying an error-handler
function errfunc when you call glob. If errfunc is not a null pointer, then
glob doesn’t give up right away when it can’t read a directory; instead, it calls
errfunc with two arguments, like this:
(*errfunc) (filename, error-code)
The argument filename is the name of the directory that glob couldn’t open
or couldn’t read, and error-code is the errno value that was reported to glob.
If the error handler function returns nonzero, then glob gives up right away.
Otherwise, it continues.
GLOB_MARK
If the pattern matches the name of a directory, append ‘/’ to the directory’s
name when returning it.
GLOB_NOCHECK
If the pattern doesn’t match any file names, return the pattern itself as if it
were a file name that had been matched. (Normally, when the pattern doesn’t
match anything, glob returns that there were no matches.)
GLOB_NOESCAPE
Don’t treat the ‘\’ character specially in patterns. Normally, ‘\’ quotes the
following character, turning off its special meaning (if any) so that it matches
only itself. When quoting is enabled, the pattern ‘\?’ matches only the string
‘?’, because the question mark in the pattern acts like an ordinary character.
If you use GLOB_NOESCAPE, then ‘\’ is an ordinary character.
glob does its work by calling the function fnmatch repeatedly. It handles the
flag GLOB_NOESCAPE by turning on the FNM_NOESCAPE flag in calls to fnmatch.
GLOB_NOSORT
Don’t sort the file names; return them in no particular order. (In practice, the
order will depend on the order of the entries in the directory.) The only reason
not to sort is to save time.
GLOB_ALTDIRFUNC
Instead of using the normal functions for accessing the filesystem the glob im-
plementation uses the user-supplied functions specified in the structure pointed
to by pglob parameter. For more information about the functions refer to
the sections about directory handling see Section 14.2 [Accessing Directories],
page 413, and Section 14.9.2 [Reading the Attributes of a File], page 438.
GLOB_BRACE
If this flag is given, the handling of braces in the pattern is changed. It is
now required that braces appear correctly grouped. I.e., for each opening brace
there must be a closing one. Braces can be used recursively. So it is possible
to define one brace expression in another one. It is important to note that
the range of each brace expression is completely contained in the outer brace
expression (if there is one).
The string between the matching braces is separated into single expressions
by splitting at , (comma) characters. The commas themselves are discarded.
Please note what we said above about recursive brace expressions. The commas
used to separate the subexpressions must be at the same level. Commas in brace
subexpressions are not matched. They are used during expansion of the brace
expression of the deeper level. The example below shows this
glob ("{foo/{,bar,biz},baz}", GLOB_BRACE, NULL, &result)
is equivalent to the sequence
glob ("foo/", GLOB_BRACE, NULL, &result)
glob ("foo/bar", GLOB_BRACE|GLOB_APPEND, NULL, &result)
glob ("foo/biz", GLOB_BRACE|GLOB_APPEND, NULL, &result)
glob ("baz", GLOB_BRACE|GLOB_APPEND, NULL, &result)
if we leave aside error handling.
GLOB_NOMAGIC
If the pattern contains no wildcard constructs (it is a literal file name), return
it as the sole “matching” word, even if no file exists by that name.
GLOB_TILDE
If this flag is used the character ~ (tilde) is handled specially if it appears at the
beginning of the pattern. Instead of being taken verbatim it is used to represent
the home directory of a known user.
If ~ is the only character in pattern or it is followed by a / (slash), the home
directory of the process owner is substituted. Using getlogin and getpwnam
the information is read from the system databases. As an example take user
bart with his home directory at /home/bart. For him a call like
glob ("~/bin/*", GLOB_TILDE, NULL, &result)
would return the contents of the directory /home/bart/bin. Instead of referring
to the own home directory it is also possible to name the home directory of other
users. To do so one has to append the user name after the tilde character. So
the contents of user homer’s bin directory can be retrieved by
glob ("~homer/bin/*", GLOB_TILDE, NULL, &result)
If the user name is not valid or the home directory cannot be determined
for some reason the pattern is left untouched and itself used as the result.
Chapter 10: Pattern Matching 252
I.e., if in the last example home is not available the tilde expansion yields to
"~homer/bin/*" and glob is not looking for a directory named ~homer.
This functionality is equivalent to what is available in C-shells if the nonomatch
flag is set.
GLOB_TILDE_CHECK
If this flag is used glob behaves as if GLOB_TILDE is given. The only difference
is that if the user name is not available or the home directory cannot be deter-
mined for other reasons this leads to an error. glob will return GLOB_NOMATCH
instead of using the pattern itself as the name.
This functionality is equivalent to what is available in C-shells if the nonomatch
flag is not set.
GLOB_ONLYDIR
If this flag is used the globbing function takes this as a hint that the caller is
only interested in directories matching the pattern. If the information about
the type of the file is easily available non-directories will be rejected but no
extra work will be done to determine the information for each file. I.e., the
caller must still be able to filter directories out.
This functionality is only available with the GNU glob implementation. It is
mainly used internally to increase the performance but might be useful for a
user as well and therefore is documented here.
Calling glob will in most cases allocate resources which are used to represent the result
of the function call. If the same object of type glob_t is used in multiple call to glob the
resources are freed or reused so that no leaks appear. But this does not include the time
when all glob calls are done.
After you create a regex_t object, you can compile a regular expression into it by calling
regcomp.
Here are the possible nonzero values that regcomp can return:
REG_BADBR
There was an invalid ‘\{...\}’ construct in the regular expression. A valid
‘\{...\}’ construct must contain either a single number, or two numbers in
increasing order separated by a comma.
REG_BADPAT
There was a syntax error in the regular expression.
REG_BADRPT
A repetition operator such as ‘?’ or ‘*’ appeared in a bad position (with no
preceding subexpression to act on).
REG_ECOLLATE
The regular expression referred to an invalid collating element (one not defined
in the current locale for string collation). See Section 7.3 [Locale Categories],
page 187.
REG_ECTYPE
The regular expression referred to an invalid character class name.
REG_EESCAPE
The regular expression ended with ‘\’.
REG_ESUBREG
There was an invalid number in the ‘\digit’ construct.
REG_EBRACK
There were unbalanced square brackets in the regular expression.
REG_EPAREN
An extended regular expression had unbalanced parentheses, or a basic regular
expression had unbalanced ‘\(’ and ‘\)’.
REG_EBRACE
The regular expression had unbalanced ‘\{’ and ‘\}’.
REG_ERANGE
One of the endpoints in a range expression was invalid.
REG_ESPACE
regcomp ran out of memory.
REG_NOSUB
Don’t bother storing the contents of the matchptr array.
REG_NEWLINE
Treat a newline in string as dividing string into multiple lines, so that ‘$’ can
match before the newline and ‘^’ can match after. Also, don’t permit ‘.’ to
match a newline, and don’t permit ‘[^...]’ to match a newline.
Otherwise, newline acts like any other ordinary character.
But the last match is not always the one that is chosen. It’s more accurate to say that
the last opportunity to match is the one that takes precedence. What this means is that
when one subexpression appears within another, then the results reported for the inner
subexpression reflect whatever happened on the last match of the outer subexpression. For
an example, consider ‘\(ba\(na\)*s \)*’ matching the string ‘bananas bas ’. The last
time the inner expression actually matches is near the end of the first word. But it is
considered again in the second word, and fails to match there. regexec reports nonuse of
the “na” subexpression.
Another place where this rule applies is when the regular expression
\(ba\(na\)*s \|nefer\(ti\)* \)*
matches ‘bananas nefertiti’. The “na” subexpression does match in the first word, but it
doesn’t match in the second word because the other alternative is used there. Once again,
the second repetition of the outer subexpression overrides the first, and within that second
repetition, the “na” subexpression is not used. So regexec reports nonuse of the “na”
subexpression.
Here is a function which uses regerror, but always dynamically allocates a buffer for
the error message:
char *get_regerror (int errcode, regex_t *compiled)
{
size_t length = regerror (errcode, compiled, NULL, 0);
char *buffer = xmalloc (length);
(void) regerror (errcode, compiled, buffer, length);
return buffer;
}
For the details of these transformations, and how to write the constructs that use them,
see The BASH Manual (to appear).
Chapter 10: Pattern Matching 259
WRDE_BADCHAR
The input string words contains an unquoted invalid character such as
‘|’.
WRDE_BADVAL
The input string refers to an undefined shell variable, and you used the
flag WRDE_UNDEF to forbid such references.
WRDE_CMDSUB
The input string uses command substitution, and you used the flag WRDE_
NOCMD to forbid command substitution.
WRDE_NOSPACE
It was impossible to allocate memory to hold the result. In this case,
wordexp can store part of the results—as much as it could allocate room
for.
WRDE_SYNTAX
There was a syntax error in the input string. For example, an unmatched
quoting character is a syntax error. This error code is also used to signal
division by zero and overflow in arithmetic expansion.
WRDE_APPEND
Append the words from this expansion to the vector of words produced by
previous calls to wordexp. This way you can effectively expand several words
as if they were concatenated with spaces between them.
In order for appending to work, you must not modify the contents of the word
vector structure between calls to wordexp. And, if you set WRDE_DOOFFS in the
first call to wordexp, you must also set it when you append to the results.
WRDE_DOOFFS
Leave blank slots at the beginning of the vector of words. The we_offs field
says how many slots to leave. The blank slots contain null pointers.
WRDE_NOCMD
Don’t do command substitution; if the input requests command substitution,
report an error.
Chapter 10: Pattern Matching 261
WRDE_REUSE
Reuse a word vector made by a previous call to wordexp. Instead of allocating
a new vector of words, this call to wordexp will use the vector that already
exists (making it larger if necessary).
Note that the vector may move, so it is not safe to save an old pointer and use
it again after calling wordexp. You must fetch we_pathv anew after each call.
WRDE_SHOWERR
Do show any error messages printed by commands run by command substi-
tution. More precisely, allow these commands to inherit the standard error
output stream of the current process. By default, wordexp gives these com-
mands a standard error stream that discards all output.
WRDE_UNDEF
If the input refers to a shell variable that is not defined, report an error.
exit (EXIT_FAILURE);
}
else if (pid < 0)
/* The fork failed. Report failure. */
status = -1;
else
/* This is the parent process. Wait for the child to complete. */
if (waitpid (pid, &status, 0) != pid)
status = -1;
wordfree (&result);
return status;
}
${variable:=default}
Substitute the value of variable, but if that is empty or undefined, use default
instead and set the variable to default.
${variable:?message}
If variable is defined and not empty, substitute its value.
Otherwise, print message as an error message on the standard error stream,
and consider word expansion a failure.
${variable:+replacement}
Substitute replacement, but only if variable is defined and nonempty. Other-
wise, substitute nothing for this construct.
${#variable}
Substitute a numeral which expresses in base ten the number of characters
in the value of variable. ‘${#foo}’ stands for ‘7’, because ‘tractor’ is seven
characters.
These variants of variable substitution let you remove part of the variable’s value before
substituting it. The prefix and suffix are not mere strings; they are wildcard patterns, just
like the patterns that you use to match multiple file names. But in this context, they match
against parts of the variable value rather than against file names.
${variable%%suffix}
Substitute the value of variable, but first discard from that variable any portion
at the end that matches the pattern suffix.
If there is more than one alternative for how to match against suffix, this con-
struct uses the longest possible match.
Thus, ‘${foo%%r*}’ substitutes ‘t’, because the largest match for ‘r*’ at the
end of ‘tractor’ is ‘ractor’.
${variable%suffix}
Substitute the value of variable, but first discard from that variable any portion
at the end that matches the pattern suffix.
If there is more than one alternative for how to match against suffix, this con-
struct uses the shortest possible alternative.
Thus, ‘${foo%r*}’ substitutes ‘tracto’, because the shortest match for ‘r*’ at
the end of ‘tractor’ is just ‘r’.
${variable##prefix}
Substitute the value of variable, but first discard from that variable any portion
at the beginning that matches the pattern prefix.
If there is more than one alternative for how to match against prefix, this
construct uses the longest possible match.
Thus, ‘${foo##*t}’ substitutes ‘or’, because the largest match for ‘*t’ at the
beginning of ‘tractor’ is ‘tract’.
${variable#prefix}
Substitute the value of variable, but first discard from that variable any portion
at the beginning that matches the pattern prefix.
Chapter 10: Pattern Matching 264
If there is more than one alternative for how to match against prefix, this
construct uses the shortest possible alternative.
Thus, ‘${foo#*t}’ substitutes ‘ractor’, because the shortest match for ‘*t’ at
the beginning of ‘tractor’ is just ‘t’.
265
11 Input/Output Overview
Most programs need to do either input (reading data) or output (writing data), or most
frequently both, in order to do anything useful. The GNU C Library provides such a large
selection of input and output functions that the hardest part is often deciding which function
is most appropriate!
This chapter introduces concepts and terminology relating to input and output. Other
chapters relating to the GNU I/O facilities are:
• Chapter 12 [Input/Output on Streams], page 270, which covers the high-level functions
that operate on streams, including formatted input and output.
• Chapter 13 [Low-Level Input/Output], page 347, which covers the basic I/O and control
functions on file descriptors.
• Chapter 14 [File System Interface], page 411, which covers functions for operating on
directories and for manipulating file attributes such as access modes and ownership.
• Chapter 15 [Pipes and FIFOs], page 459, which includes information on the basic
interprocess communication facilities.
• Chapter 16 [Sockets], page 464, which covers a more complicated interprocess commu-
nication facility with support for networking.
• Chapter 17 [Low-Level Terminal Interface], page 513, which covers functions for chang-
ing how input and output to terminals or other serial devices are processed.
use file descriptors if your program needs to do input or output in special modes, such as
nonblocking (or polled) input (see Section 13.15 [File Status Flags], page 395).
Streams provide a higher-level interface, layered on top of the primitive file descriptor
facilities. The stream interface treats all kinds of files pretty much alike—the sole exception
being the three styles of buffering that you can choose (see Section 12.20 [Stream Buffering],
page 333).
The main advantage of using the stream interface is that the set of functions for per-
forming actual input and output operations (as opposed to control operations) on streams is
much richer and more powerful than the corresponding facilities for file descriptors. The file
descriptor interface provides only simple functions for transferring blocks of characters, but
the stream interface also provides powerful formatted input and output functions (printf
and scanf) as well as functions for character- and line-oriented input and output.
Since streams are implemented in terms of file descriptors, you can extract the file de-
scriptor from a stream and perform low-level operations directly on the file descriptor. You
can also initially open a connection as a file descriptor and then make a stream associated
with that file descriptor.
In general, you should stick with using streams rather than file descriptors, unless there
is some specific operation you want to do that can only be done on a file descriptor. If
you are a beginning programmer and aren’t sure what functions to use, we suggest that
you concentrate on the formatted input functions (see Section 12.14 [Formatted Input],
page 315) and formatted output functions (see Section 12.12 [Formatted Output], page 292).
If you are concerned about portability of your programs to systems other than GNU, you
should also be aware that file descriptors are not as portable as streams. You can expect
any system running ISO C to support streams, but non-GNU systems may not support file
descriptors at all, or may only implement a subset of the GNU functions that operate on
file descriptors. Most of the file descriptor functions in the GNU C Library are included in
the POSIX.1 standard, however.
of the file position. However, the file position is still used to control where in the file reading
is done.
If you think about it, you’ll realize that several programs can read a given file at the same
time. In order for each program to be able to read the file at its own pace, each program
must have its own file pointer, which is not affected by anything the other programs do.
In fact, each opening of a file creates a separate file position. Thus, if you open a file
twice even in the same program, you get two streams or descriptors with independent file
positions.
By contrast, if you open a descriptor and then duplicate it to get another descriptor,
these two descriptors share the same file position: changing the file position of one descriptor
will affect the other.
11.2.1 Directories
In order to understand the syntax of file names, you need to understand how the file system
is organized into a hierarchy of directories.
A directory is a file that contains information to associate other files with names; these
associations are called links or directory entries. Sometimes, people speak of “files in a
directory”, but in reality, a directory only contains pointers to files, not the files themselves.
The name of a file contained in a directory entry is called a file name component. In
general, a file name consists of a sequence of one or more such components, separated by
the slash character (‘/’). A file name which is just one component names a file with respect
to its directory. A file name with multiple components names a directory, and then a file
in that directory, and so on.
Some other documents, such as the POSIX standard, use the term pathname for what
we call a file name, and either filename or pathname component for what this manual
calls a file name component. We don’t use this terminology because a “path” is something
completely different (a list of directories to search), and we think that “pathname” used for
something else will confuse users. We always use “file name” and “file name component”
(or sometimes just “component”, where the context is obvious) in GNU documentation.
Some macros use the POSIX terminology in their names, such as PATH_MAX. These macros
are defined by the POSIX standard, so we cannot change their names.
You can find more detailed information about operations on directories in Chapter 14
[File System Interface], page 411.
Chapter 11: Input/Output Overview 268
EACCES The process does not have search permission for a directory component of the
file name.
ENAMETOOLONG
This error is used when either the total length of a file name is greater than
PATH_MAX, or when an individual file name component has a length greater than
NAME_MAX. See Section 33.6 [Limits on File System Capacity], page 956.
On GNU/Hurd systems, there is no imposed limit on overall file name length,
but some file systems may place limits on the length of a component.
ENOENT This error is reported when a file referenced as a directory component in the
file name doesn’t exist, or when a component is a symbolic link whose target
file does not exist. See Section 14.5 [Symbolic Links], page 428.
ENOTDIR A file that is referenced as a directory component in the file name exists, but
it isn’t a directory.
ELOOP Too many symbolic links were resolved while trying to look up the file name.
The system has an arbitrary limit on the number of symbolic links that may
be resolved in looking up a single file name, as a primitive way to detect loops.
See Section 14.5 [Symbolic Links], page 428.
12 Input/Output on Streams
This chapter describes the functions for creating streams and performing input and output
operations on them. As discussed in Chapter 11 [Input/Output Overview], page 265, a
stream is a fairly abstract, high-level concept representing a communications channel to a
file, device, or process.
12.1 Streams
For historical reasons, the type of the C data structure that represents a stream is called
FILE rather than “stream”. Since most of the library functions deal with objects of type
FILE *, sometimes the term file pointer is also used to mean “stream”. This leads to
unfortunate confusion over terminology in many books on C. This manual, however, is
careful to use the terms “file” and “stream” only in the technical sense.
The FILE type is declared in the header file stdio.h.
FILE objects are allocated and managed internally by the input/output library functions.
Don’t try to create your own objects of type FILE; let the library do it. Your programs
should deal only with pointers to these objects (that is, FILE * values) rather than the
objects themselves.
On GNU systems, you can specify what files or processes correspond to these streams
using the pipe and redirection facilities provided by the shell. (The primitives shells use to
implement these facilities are described in Chapter 14 [File System Interface], page 411.)
Chapter 12: Input/Output on Streams 271
Most other operating systems provide similar mechanisms, but the details of how to use
them can vary.
In the GNU C Library, stdin, stdout, and stderr are normal variables which you can
set just like any others. For example, to redirect the standard output to a file, you could
do:
fclose (stdout);
stdout = fopen ("standard-output-file", "w");
Note however, that in other systems stdin, stdout, and stderr are macros that you
cannot assign to in the normal way. But you can use freopen to get the effect of closing
one and reopening it. See Section 12.3 [Opening Streams], page 271.
The three streams stdin, stdout, and stderr are not unoriented at program start (see
Section 12.6 [Streams in Internationalized Applications], page 279).
As you can see, ‘+’ requests a stream that can do both input and output. When using
such a stream, you must call fflush (see Section 12.20 [Stream Buffering], page 333)
or a file positioning function such as fseek (see Section 12.18 [File Positioning],
page 328) when switching from reading to writing or vice versa. Otherwise, internal
buffers might not be emptied properly.
Additional characters may appear after these to specify flags for the call. Always
put the mode (‘r’, ‘w+’, etc.) first; that is the only part you are guaranteed will be
understood by all systems.
The GNU C Library defines additional characters for use in opentype:
‘c’ The file is opened with cancellation in the I/O functions disabled.
‘e’ The underlying file descriptor will be closed if you use any of the exec...
functions (see Section 27.6 [Executing a File], page 859). (This is equiva-
lent to having set FD_CLOEXEC on that descriptor. See Section 13.14 [File
Descriptor Flags], page 394.)
‘m’ The file is opened and accessed using mmap. This is only supported with
files opened for reading.
‘x’ Insist on creating a new file—if a file filename already exists, fopen fails
rather than opening it. If you use ‘x’ you are guaranteed that you will not
clobber an existing file. This is equivalent to the O_EXCL option to the
open function (see Section 13.1 [Opening and Closing Files], page 347).
The ‘x’ modifier is part of ISO C11, which says the file is created with
exclusive access; in the GNU C Library this means the equivalent of O_
EXCL.
The character ‘b’ in opentype has a standard meaning; it requests a binary stream
rather than a text stream. But this makes no difference in POSIX systems (including
GNU systems). If both ‘+’ and ‘b’ are specified, they can appear in either order. See
Section 12.17 [Text and Binary Streams], page 328.
If the opentype string contains the sequence ,ccs=STRING then STRING is taken as
the name of a coded character set and fopen will mark the stream as wide-oriented
with appropriate conversion functions in place to convert from and to the character
set STRING. Any other stream is opened initially unoriented and the orientation is
decided with the first file operation. If the first operation is a wide character operation,
the stream is not only marked as wide-oriented, also the conversion functions to
convert to the coded character set used for the current locale are loaded. This will
not change anymore from this point on even if the locale selected for the LC_CTYPE
category is changed.
Any other characters in opentype are simply ignored. They may be meaningful in
other systems.
If the open fails, fopen returns a null pointer.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32 bit machine
this function is in fact fopen64 since the LFS interface replaces transparently the old
interface.
Chapter 12: Input/Output on Streams 273
You can have multiple streams (or file descriptors) pointing to the same file open at the
same time. If you do only input, this works straightforwardly, but you must be careful if any
output streams are included. See Section 13.5 [Dangers of Mixing Streams and Descriptors],
page 359. This is equally true whether the streams are in one program (not usual) or in
several programs (which can easily happen). It may be advantageous to use the file locking
facilities to avoid simultaneous access. See Section 13.16 [File Locks], page 401.
freopen has traditionally been used to connect a standard stream such as stdin with
a file of your own choice. This is useful in programs in which use of a standard stream
for certain purposes is hard-coded. In the GNU C Library, you can simply close the
standard streams and open new ones with fopen. But other systems lack this ability,
so using freopen is more portable.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32 bit machine
this function is in fact freopen64 since the LFS interface replaces transparently the
old interface.
FILE * freopen64 (const char *filename, const char [Function]
*opentype, FILE *stream)
Preliminary: | MT-Safe | AS-Unsafe corrupt | AC-Unsafe corrupt fd | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to freopen. The only difference is that on 32 bit machine the
stream returned is able to read beyond the 231 bytes limits imposed by the normal
interface. It should be noted that the stream pointed to by stream need not be opened
using fopen64 or freopen64 since its mode is not important for this function.
If the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32 bits machine this
function is available under the name freopen and so transparently replaces the old
interface.
In some situations it is useful to know whether a given stream is available for reading
or writing. This information is normally not available and would have to be remembered
separately. Solaris introduced a few functions to get this information from the stream
descriptor and these functions are also available in the GNU C Library.
int __freadable (FILE *stream) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The __freadable function determines whether the stream stream was opened to
allow reading. In this case the return value is nonzero. For write-only streams the
function returns zero.
This function is declared in stdio_ext.h.
int __fwritable (FILE *stream) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The __fwritable function determines whether the stream stream was opened to
allow writing. In this case the return value is nonzero. For read-only streams the
function returns zero.
This function is declared in stdio_ext.h.
For slightly different kinds of problems there are two more functions. They provide even
finer-grained information.
int __freading (FILE *stream) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 12: Input/Output on Streams 275
The __freading function determines whether the stream stream was last read from
or whether it is opened read-only. In this case the return value is nonzero, otherwise it
is zero. Determining whether a stream opened for reading and writing was last used
for writing allows to draw conclusions about the content about the buffer, among
other things.
This function is declared in stdio_ext.h.
To close all streams currently available the GNU C Library provides another function.
separately so that problems with individual streams can be identified. It is also prob-
lematic since the standard streams (see Section 12.2 [Standard Streams], page 270)
will also be closed.
The function fcloseall is declared in stdio.h.
If the main function to your program returns, or if you call the exit function (see Sec-
tion 26.7.1 [Normal Termination], page 851), all open streams are automatically closed prop-
erly. If your program terminates in any other manner, such as by calling the abort function
(see Section 26.7.4 [Aborting a Program], page 853) or from a fatal signal (see Chapter 25
[Signal Handling], page 766), open streams might not be closed properly. Buffered output
might not be flushed and files may be incomplete. For more information on buffering of
streams, see Section 12.20 [Stream Buffering], page 333.
does not block if the lock is not available. ftrylockfile returns zero if the lock was
successfully acquired. Otherwise the stream is locked by another thread.
The following example shows how the functions above can be used to generate an output
line atomically even in multi-threaded applications (yes, the same job could be done with
one fprintf call but it is sometimes not possible):
FILE *fp;
{
...
flockfile (fp);
fputs ("This is test number ", fp);
fprintf (fp, "%d\n", test);
funlockfile (fp)
}
Without the explicit locking it would be possible for another thread to use the stream fp
after the fputs call returns and before fprintf was called with the result that the number
does not follow the word ‘number’.
From this description it might already be clear that the locking objects in streams are
no simple mutexes. Since locking the same stream twice in the same thread is allowed the
locking objects must be equivalent to recursive mutexes. These mutexes keep track of the
owner and the number of times the lock is acquired. The same number of funlockfile
calls by the same threads is necessary to unlock the stream completely. For instance:
void
foo (FILE *fp)
{
ftrylockfile (fp);
fputs ("in foo\n", fp);
/* This is very wrong!!! */
funlockfile (fp);
}
It is important here that the funlockfile function is only called if the ftrylockfile
function succeeded in locking the stream. It is therefore always wrong to ignore the result
of ftrylockfile. And it makes no sense since otherwise one would use flockfile. The
result of code like that above is that either funlockfile tries to free a stream that hasn’t
been locked by the current thread or it frees the stream prematurely. The code should look
like this:
void
foo (FILE *fp)
{
if (ftrylockfile (fp) == 0)
{
Chapter 12: Input/Output on Streams 278
Now that we covered why it is necessary to have locking it is necessary to talk about
situations when locking is unwanted and what can be done. The locking operations (explicit
or implicit) don’t come for free. Even if a lock is not taken the cost is not zero. The
operations which have to be performed require memory operations that are safe in multi-
processor environments. With the many local caches involved in such systems this is quite
costly. So it is best to avoid the locking completely if it is not needed – because the code in
question is never used in a context where two or more threads may use a stream at a time.
This can be determined most of the time for application code; for library code which can
be used in many contexts one should default to be conservative and use locking.
There are two basic mechanisms to avoid locking. The first is to use the _unlocked
variants of the stream operations. The POSIX standard defines quite a few of those and
the GNU C Library adds a few more. These variants of the functions behave just like
the functions with the name without the suffix except that they do not lock the stream.
Using these functions is very desirable since they are potentially much faster. This is
not only because the locking operation itself is avoided. More importantly, functions like
putc and getc are very simple and traditionally (before the introduction of threads) were
implemented as macros which are very fast if the buffer is not empty. With the addition of
locking requirements these functions are no longer implemented as macros since they would
expand to too much code. But these macros are still available with the same functionality
under the new names putc_unlocked and getc_unlocked. This possibly huge difference
of speed also suggests the use of the _unlocked functions even if locking is required. The
difference is that the locking then has to be performed in the program:
void
foo (FILE *fp, char *buf)
{
flockfile (fp);
while (*buf != '/')
putc_unlocked (*buf++, fp);
funlockfile (fp);
}
If in this example the putc function would be used and the explicit locking would be
missing the putc function would have to acquire the lock in every call, potentially many
times depending on when the loop terminates. Writing it the way illustrated above allows
the putc_unlocked macro to be used which means no locking and direct manipulation of
the buffer of the stream.
A second way to avoid locking is by using a non-standard function which was introduced
in Solaris and is available in the GNU C Library as well.
it can be disabled and reinstated using this function. There are three values defined
for the type parameter.
FSETLOCKING_INTERNAL
The stream stream will from now on use the default internal locking.
Every stream operation with exception of the _unlocked variants will
implicitly lock the stream.
FSETLOCKING_BYCALLER
After the __fsetlocking function returns, the user is responsible for
locking the stream. None of the stream operations will implicitly do this
anymore until the state is set back to FSETLOCKING_INTERNAL.
FSETLOCKING_QUERY
__fsetlocking only queries the current locking state of the stream. The
return value will be FSETLOCKING_INTERNAL or FSETLOCKING_BYCALLER
depending on the state.
The return value of __fsetlocking is either FSETLOCKING_INTERNAL or
FSETLOCKING_BYCALLER depending on the state of the stream before the call.
This function and the values for the type parameter are declared in stdio_ext.h.
This function is especially useful when program code has to be used which is written
without knowledge about the _unlocked functions (or if the programmer was too lazy to
use them).
Being able to use the same stream for wide and normal operations comes with a re-
striction: a stream can be used either for wide operations or for normal operations. Once
it is decided there is no way back. Only a call to freopen or freopen64 can reset the
orientation. The orientation can be decided in three ways:
• If any of the normal character functions are used (this includes the fread and fwrite
functions) the stream is marked as not wide oriented.
• If any of the wide character functions are used the stream is marked as wide oriented.
• The fwide function can be used to set the orientation either way.
It is important to never mix the use of wide and not wide operations on a stream. There
are no diagnostics issued. The application behavior will simply be strange or the application
will simply crash. The fwide function can help avoid this.
int fwide (FILE *stream, int mode) [Function]
Preliminary: | MT-Safe | AS-Unsafe corrupt | AC-Unsafe lock | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The fwide function can be used to set and query the state of the orientation of the
stream stream. If the mode parameter has a positive value the streams get wide
oriented, for negative values narrow oriented. It is not possible to overwrite previous
orientations with fwide. I.e., if the stream stream was already oriented before the
call nothing is done.
If mode is zero the current orientation state is queried and nothing is changed.
The fwide function returns a negative value, zero, or a positive value if the stream is
narrow, not at all, or wide oriented respectively.
This function was introduced in Amendment 1 to ISO C90 and is declared in wchar.h.
It is generally a good idea to orient a stream as early as possible. This can prevent
surprise especially for the standard streams stdin, stdout, and stderr. If some library
function in some situations uses one of these streams and this use orients the stream in a
different way the rest of the application expects it one might end up with hard to reproduce
errors. Remember that no errors are signal if the streams are used incorrectly. Leaving
a stream unoriented after creation is normally only necessary for library functions which
create streams which can be used in different contexts.
When writing code which uses streams and which can be used in different contexts it
is important to query the orientation of the stream before using it (unless the rules of the
library interface demand a specific orientation). The following little, silly function illustrates
this.
void
print_f (FILE *fp)
{
if (fwide (fp, 0) > 0)
/* Positive return value means wide orientation. */
fputwc (L'f', fp);
else
fputc ('f', fp);
}
Note that in this case the function print_f decides about the orientation of the stream
if it was unoriented before (will not happen if the advice above is followed).
Chapter 12: Input/Output on Streams 281
The encoding used for the wchar_t values is unspecified and the user must not make any
assumptions about it. For I/O of wchar_t values this means that it is impossible to write
these values directly to the stream. This is not what follows from the ISO C locale model
either. What happens instead is that the bytes read from or written to the underlying media
are first converted into the internal encoding chosen by the implementation for wchar_t.
The external encoding is determined by the LC_CTYPE category of the current locale or by
the ‘ccs’ part of the mode specification given to fopen, fopen64, freopen, or freopen64.
How and when the conversion happens is unspecified and it happens invisibly to the user.
Since a stream is created in the unoriented state it has at that point no conversion
associated with it. The conversion which will be used is determined by the LC_CTYPE
category selected at the time the stream is oriented. If the locales are changed at the runtime
this might produce surprising results unless one pays attention. This is just another good
reason to orient the stream explicitly as soon as possible, perhaps with a call to fwide.
The puts function writes the string s to the stream stdout followed by a newline.
The terminating null character of the string is not written. (Note that fputs does
not write a newline as this function does.)
puts is the most convenient function for printing simple messages. For example:
puts ("This is a message.");
outputs the text ‘This is a message.’ followed by a newline.
Here is an example of a function that does input using fgetc. It would work just as well
using getc instead, or using getchar () instead of fgetc (stdin). The code would also
work the same for the wide character stream functions.
int
y_or_n_p (const char *question)
{
fputs (question, stdout);
while (1)
{
int c, answer;
/* Write a space to separate answer from question. */
fputc (' ', stdout);
/* Read the first character of the line.
This should be the answer character, but might not be. */
c = tolower (fgetc (stdin));
answer = c;
/* Discard rest of input line. */
while (c != '\n' && c != EOF)
c = fgetc (stdin);
/* Obey the answer if it was valid. */
if (answer == 'y')
return 1;
if (answer == 'n')
return 0;
/* Answer was invalid: ask for valid answer. */
fputs ("Please answer y or n:", stdout);
}
}
12.10 Unreading
In parser programs it is often useful to examine the next character in the input stream
without removing it from the stream. This is called “peeking ahead” at the input because
your program gets a glimpse of the input it will read next.
Using stream I/O, you can peek ahead at input by first reading it and then unreading
it (also called pushing it back on the stream). Unreading a character makes it available to
be input again from the stream, by the next call to fgetc or other input function on that
stream.
|
9--
^
so that the next input characters will be ‘9’ and ‘b’.
Here is an example showing the use of getc and ungetc to skip over whitespace charac-
ters. When this function reaches a non-whitespace character, it unreads that character to
be seen again on the next read operation on the stream.
#include <stdio.h>
#include <ctype.h>
void
skip_whitespace (FILE *stream)
Chapter 12: Input/Output on Streams 291
{
int c;
do
/* No need to check for EOF because it is not
isspace, and ungetc ignores EOF. */
c = getc (stream);
while (isspace (c));
ungetc (c, stream);
}
size_t fread (void *data, size_t size, size_t count, FILE [Function]
*stream)
Preliminary: | MT-Safe | AS-Unsafe corrupt | AC-Unsafe lock corrupt | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function reads up to count objects of size size into the array data, from the
stream stream. It returns the number of objects actually read, which might be less
than count if a read error occurs or the end of the file is reached. This function
returns a value of zero (and doesn’t read anything) if either size or count is zero.
If fread encounters end of file in the middle of an object, it returns the number of
complete objects read, and discards the partial object. Therefore, the stream remains
at the actual end of the file.
Floating-point numbers can be printed in normal, fixed-point notation using the ‘%f’
conversion or in exponential notation using the ‘%e’ conversion. The ‘%g’ conversion uses
either ‘%e’ or ‘%f’ format, depending on what is more appropriate for the magnitude of the
particular number.
You can control formatting more precisely by writing modifiers between the ‘%’ and
the character that indicates which conversion to apply. These slightly alter the ordinary
behavior of the conversion. For example, most conversion specifications permit you to
specify a minimum field width and a flag indicating whether you want the result left- or
right-justified within the field.
The specific flags and modifiers that are permitted and their interpretation vary de-
pending on the particular conversion. They’re all described in more detail in the following
sections. Don’t worry if this all seems excessively complicated at first; you can almost
always get reasonable free-format output without using any of the modifiers at all. The
modifiers are mostly used to make the output look “prettier” in tables.
NL_ARGMAX [Macro]
The value of NL_ARGMAX is the maximum value allowed for the specification of
a positional parameter in a printf call. The actual value in effect at runtime
can be retrieved by using sysconf using the _SC_NL_ARGMAX parameter see Sec-
tion 33.4.1 [Definition of sysconf], page 946.
Chapter 12: Input/Output on Streams 294
Some systems have a quite low limit such as 9 for System V systems. The GNU
C Library has no real limit.
If any of the formats has a specification for the parameter position all of them in the
format string shall have one. Otherwise the behavior is undefined.
• Zero or more flag characters that modify the normal behavior of the conversion speci-
fication.
• An optional decimal integer specifying the minimum field width. If the normal conver-
sion produces fewer characters than this, the field is padded with spaces to the specified
width. This is a minimum value; if the normal conversion produces more characters
than this, the field is not truncated. Normally, the output is right-justified within the
field.
You can also specify a field width of ‘*’. This means that the next argument in the
argument list (before the actual value to be printed) is used as the field width. The
value must be an int. If the value is negative, this means to set the ‘-’ flag (see below)
and to use the absolute value as the field width.
• An optional precision to specify the number of digits to be written for the numeric
conversions. If the precision is specified, it consists of a period (‘.’) followed optionally
by a decimal integer (which defaults to zero if omitted).
You can also specify a precision of ‘*’. This means that the next argument in the
argument list (before the actual value to be printed) is used as the precision. The value
must be an int, and is ignored if it is negative. If you specify ‘*’ for both the field
width and precision, the field width argument precedes the precision argument. Other
C library versions may not recognize this syntax.
• An optional type modifier character, which is used to specify the data type of the
corresponding argument if it differs from the default type. (For example, the integer
conversions assume a type of int, but you can specify ‘h’, ‘l’, or ‘L’ for other integer
types.)
• A character that specifies the conversion to be applied.
The exact options that are permitted and how they are interpreted vary between the
different conversion specifiers. See the descriptions of the individual conversions for infor-
mation about the particular options that they use.
With the ‘-Wformat’ option, the GNU C compiler checks calls to printf and related
functions. It examines the format string and verifies that the correct number and types
of arguments are supplied. There is also a GNU C syntax to tell the compiler that a
function you write uses a printf-style format string. See Section “Declaring Attributes of
Functions” in Using GNU CC, for more information.
‘%b’, ‘%B’ Print an integer as an unsigned binary number. ‘%b’ uses lower-case ‘b’ with
the ‘#’ flag and ‘%B’ uses upper-case. ‘%b’ is an ISO C23 feature; ‘%B’ is an
optional ISO C23 feature. See Section 12.12.4 [Integer Conversions], page 296,
for details.
‘%o’ Print an integer as an unsigned octal number. See Section 12.12.4 [Integer
Conversions], page 296, for details.
‘%u’ Print an integer as an unsigned decimal number. See Section 12.12.4 [Integer
Conversions], page 296, for details.
‘%x’, ‘%X’ Print an integer as an unsigned hexadecimal number. ‘%x’ uses lower-case letters
and ‘%X’ uses upper-case. See Section 12.12.4 [Integer Conversions], page 296,
for details.
‘%f’, ‘%F’ Print a floating-point number in normal (fixed-point) notation. ‘%f’ uses lower-
case letters and ‘%F’ uses upper-case. See Section 12.12.5 [Floating-Point Con-
versions], page 298, for details.
‘%e’, ‘%E’ Print a floating-point number in exponential notation. ‘%e’ uses lower-case let-
ters and ‘%E’ uses upper-case. See Section 12.12.5 [Floating-Point Conversions],
page 298, for details.
‘%g’, ‘%G’ Print a floating-point number in either normal or exponential notation, which-
ever is more appropriate for its magnitude. ‘%g’ uses lower-case letters and ‘%G’
uses upper-case. See Section 12.12.5 [Floating-Point Conversions], page 298, for
details.
‘%a’, ‘%A’ Print a floating-point number in a hexadecimal fractional notation with the
exponent to base 2 represented in decimal digits. ‘%a’ uses lower-case letters
and ‘%A’ uses upper-case. See Section 12.12.5 [Floating-Point Conversions],
page 298, for details.
‘%c’ Print a single character. See Section 12.12.6 [Other Output Conversions],
page 300.
‘%C’ This is an alias for ‘%lc’ which is supported for compatibility with the Unix
standard.
‘%s’ Print a string. See Section 12.12.6 [Other Output Conversions], page 300.
‘%S’ This is an alias for ‘%ls’ which is supported for compatibility with the Unix
standard.
‘%p’ Print the value of a pointer. See Section 12.12.6 [Other Output Conversions],
page 300.
‘%n’ Get the number of characters printed so far. See Section 12.12.6 [Other Output
Conversions], page 300. Note that this conversion specification never produces
any output.
‘%m’ Print the string corresponding to the value of errno. (This is a GNU extension.)
See Section 12.12.6 [Other Output Conversions], page 300.
‘%%’ Print a literal ‘%’ character. See Section 12.12.6 [Other Output Conversions],
page 300.
Chapter 12: Input/Output on Streams 296
short arguments are automatically converted to int by the default argument promotions.
For arguments of other integer types, you can use these modifiers:
‘hh’ Specifies that the argument is a signed char or unsigned char, as appropri-
ate. A char argument is converted to an int or unsigned int by the default
argument promotions anyway, but the ‘hh’ modifier says to convert it back to
a char again.
This modifier was introduced in ISO C99.
‘h’ Specifies that the argument is a short int or unsigned short int, as appro-
priate. A short argument is converted to an int or unsigned int by the
default argument promotions anyway, but the ‘h’ modifier says to convert it
back to a short again.
‘j’ Specifies that the argument is a intmax_t or uintmax_t, as appropriate.
This modifier was introduced in ISO C99.
‘l’ Specifies that the argument is a long int or unsigned long int, as appropri-
ate. Two ‘l’ characters are like the ‘L’ modifier, below.
If used with ‘%c’ or ‘%s’ the corresponding parameter is considered as a wide
character or wide character string respectively. This use of ‘l’ was introduced
in Amendment 1 to ISO C90.
‘L’
‘ll’
‘q’ Specifies that the argument is a long long int. (This type is an extension
supported by the GNU C compiler. On systems that don’t support extra-long
integers, this is the same as long int.)
The ‘q’ modifier is another name for the same thing, which comes from 4.4
BSD; a long long int is sometimes called a “quad” int.
‘t’ Specifies that the argument is a ptrdiff_t.
This modifier was introduced in ISO C99.
‘wn’ Specifies that the argument is a intn_t or int_leastn_t (which are the same
type), for conversions taking signed integers, or uintn_t or uint_leastn_t
(which are the same type), for conversions taking unsigned integers. If the type
is narrower than int, the promoted argument is converted back to the specified
type.
This modifier was introduced in ISO C23.
‘wfn’ Specifies that the argument is a int_fastn_t or uint_fastn_t, as appropriate.
If the type is narrower than int, the promoted argument is converted back to
the specified type.
This modifier was introduced in ISO C23.
‘z’
‘Z’ Specifies that the argument is a size_t.
‘z’ was introduced in ISO C99. ‘Z’ is a GNU extension predating this addition
and should not be used in new code.
Chapter 12: Input/Output on Streams 298
If the value to be printed represents infinity or a NaN, the output is [-]inf or nan
respectively if the conversion specifier is ‘%a’, ‘%e’, ‘%f’, or ‘%g’ and it is [-]INF or NAN
respectively if the conversion is ‘%A’, ‘%E’, ‘%F’ or ‘%G’. On some implementations, a NaN
may result in longer output with information about the payload of the NaN; ISO C23 defines
a macro _PRINTF_NAN_LEN_MAX giving the maximum length of such output.
The following flags can be used to modify the behavior:
‘-’ Left-justify the result in the field. Normally the result is right-justified.
‘+’ Always include a plus or minus sign in the result.
‘’ If the result doesn’t start with a plus or minus sign, prefix it with a space
instead. Since the ‘+’ flag ensures that the result includes a sign, this flag is
ignored if you supply both of them.
‘#’ Specifies that the result should always include a decimal point, even if no digits
follow it. For the ‘%g’ and ‘%G’ conversions, this also forces trailing zeros after
the decimal point to be left in place where they would otherwise be removed.
‘'’ Separate the digits of the integer part of the result into groups as specified by
the locale specified for the LC_NUMERIC category; see Section 7.7.1.1 [Generic
Numeric Formatting Parameters], page 192. This flag is a GNU extension.
‘0’ Pad the field with zeros instead of spaces; the zeros are placed after any sign.
This flag is ignored if the ‘-’ flag is also specified.
The precision specifies how many digits follow the decimal-point character for the ‘%f’,
‘%F’, ‘%e’, and ‘%E’ conversions. For these conversions, the default precision is 6. If the
precision is explicitly 0, this suppresses the decimal point character entirely. For the ‘%g’
and ‘%G’ conversions, the precision specifies how many significant digits to print. Significant
digits are the first digit before the decimal point, and all the digits after it. If the precision
is 0 or not specified for ‘%g’ or ‘%G’, it is treated like a value of 1. If the value being printed
cannot be expressed accurately in the specified number of digits, the value is rounded to
the nearest number that fits.
Without a type modifier, the floating-point conversions use an argument of type double.
(By the default argument promotions, any float arguments are automatically converted
to double.) The following type modifier is supported:
‘L’ An uppercase ‘L’ specifies that the argument is a long double.
Here are some examples showing how numbers print using the various floating-point
conversions. All of the numbers were printed using this template string:
"|%13.4a|%13.4f|%13.4e|%13.4g|\n"
Here is the output:
| 0x0.0000p+0| 0.0000| 0.0000e+00| 0|
| 0x1.0000p-1| 0.5000| 5.0000e-01| 0.5|
| 0x1.0000p+0| 1.0000| 1.0000e+00| 1|
| -0x1.0000p+0| -1.0000| -1.0000e+00| -1|
| 0x1.9000p+6| 100.0000| 1.0000e+02| 100|
| 0x1.f400p+9| 1000.0000| 1.0000e+03| 1000|
| 0x1.3880p+13| 10000.0000| 1.0000e+04| 1e+04|
| 0x1.81c8p+13| 12345.0000| 1.2345e+04| 1.234e+04|
| 0x1.86a0p+16| 100000.0000| 1.0000e+05| 1e+05|
Chapter 12: Input/Output on Streams 300
prints ‘0x’ followed by a hexadecimal number—the address of the string constant "testing".
It does not print the word ‘testing’.
You can supply the ‘-’ flag with the ‘%p’ conversion to specify left-justification, but no
other flags, precision, or type modifiers are defined.
The ‘%n’ conversion is unlike any of the other output conversions. It uses an argument
which must be a pointer to an int, but instead of printing anything it stores the number
of characters printed so far by this call at that location. The ‘h’ and ‘l’ type modifiers are
permitted to specify that the argument is of type short int * or long int * instead of int
*, but no flags, field width, or precision are permitted.
For example,
int nchar;
printf ("%d %s%n\n", 3, "bears", &nchar);
prints:
3 bears
and sets nchar to 7, because ‘3 bears’ is seven characters.
The ‘%%’ conversion prints a literal ‘%’ character. This conversion doesn’t use an argu-
ment, and no flags, field width, precision, or type modifiers are permitted.
This function is just like wprintf, except that the output is written to the stream
stream instead of stdout.
int snprintf (char *s, size_t size, const char *template, [Function]
...)
Preliminary: | MT-Safe locale | AS-Unsafe heap | AC-Unsafe mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The snprintf function is similar to sprintf, except that the size argument specifies
the maximum number of characters to produce. The trailing null character is counted
towards this limit, so you should allocate at least size characters for the string s. If
Chapter 12: Input/Output on Streams 303
size is zero, nothing, not even the null byte, shall be written and s may be a null
pointer.
The return value is the number of characters which would be generated for the given
input, excluding the trailing null. If this value is greater than or equal to size, not
all characters from the result have been stored in s. If this happens, you should be
wary of using the truncated result as that could lead to security, encoding, or other
bugs in your program (see Section 5.6 [Truncating Strings while Copying], page 110).
Instead, you should try again with a bigger output string. Here is an example of
doing this:
/* Construct a message describing the value of a variable
whose name is name and whose value is value. */
char *
make_message (char *name, char *value)
{
/* Guess we need no more than 100 bytes of space. */
size_t size = 100;
char *buffer = xmalloc (size);
/* Try to print in the allocated space. */
int buflen = snprintf (buffer, size, "value of %s is %s",
name, value);
if (! (0 <= buflen && buflen < SIZE_MAX))
fatal ("integer overflow");
if (buflen >= size)
{
/* Reallocate buffer now that we know
how much space is needed. */
size = buflen;
size++;
buffer = xrealloc (buffer, size);
/* Try again. */
snprintf (buffer, size, "value of %s is %s",
name, value);
}
/* The last call worked, return the string. */
return buffer;
}
In practice, it is often easier just to use asprintf, below.
Attention: In versions of the GNU C Library prior to 2.1 the return value is the
number of characters stored, not including the terminating null; unless there was not
enough space in s to store the result in which case -1 is returned. This was changed
in order to comply with the ISO C99 standard.
output, instead of putting the output in a buffer you allocate in advance. The ptr
argument should be the address of a char * object, and a successful call to asprintf
stores a pointer to the newly allocated string at that location.
The return value is the number of characters allocated for the buffer, or less than zero
if an error occurred. Usually this means that the buffer could not be allocated.
Here is how to use asprintf to get the same result as the snprintf example, but
more easily:
/* Construct a message describing the value of a variable
whose name is name and whose value is value. */
char *
make_message (char *name, char *value)
{
char *result;
if (asprintf (&result, "value of %s is %s", name, value) < 0)
return NULL;
return result;
}
arguments. Then you can call va_arg to fetch the arguments that you want to handle
yourself. This advances the pointer past those arguments.
Once your va_list pointer is pointing at the argument of your choice, you are ready
to call vprintf. That argument and all subsequent arguments that were passed to your
function are used by vprintf along with the template that you specified separately.
Portability Note: The value of the va_list pointer is undetermined after the call to
vprintf, so you must not use va_arg after you call vprintf. Instead, you should call
va_end to retire the pointer from service. You can call va_start again and begin fetching
the arguments from the start of the variable argument list. (Alternatively, you can use
va_copy to make a copy of the va_list pointer before calling vfprintf.) Calling vprintf
does not destroy the argument list of your function, merely the particular pointer that you
passed to it.
Prototypes for these functions are declared in stdio.h.
int vsprintf (char *s, const char *template, va_list ap) [Function]
Preliminary: | MT-Safe locale | AS-Unsafe heap | AC-Unsafe mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This is the equivalent of sprintf with the variable argument list specified directly as
for vprintf.
Chapter 12: Input/Output on Streams 306
void
eprintf (const char *template, ...)
{
va_list ap;
extern char *program_invocation_short_name;
arguments in each call to the function, and warn you when they do not match the format
string. For example, take this declaration of eprintf:
void eprintf (const char *template, ...)
__attribute__ ((format (printf, 1, 2)));
This tells the compiler that eprintf uses a format string like printf (as opposed to scanf;
see Section 12.14 [Formatted Input], page 315); the format string appears as the first argu-
ment; and the arguments to satisfy the format begin with the second. See Section “Declaring
Attributes of Functions” in Using GNU CC, for more information.
The argument types are encoded as a combination of a basic type and modifier flag bits.
Here are symbolic constants that represent the basic types; they stand for integer values.
PA_INT This specifies that the base type is int.
PA_CHAR This specifies that the base type is int, cast to char.
PA_STRING
This specifies that the base type is char *, a null-terminated string.
PA_POINTER
This specifies that the base type is void *, an arbitrary pointer.
Chapter 12: Input/Output on Streams 308
Here are the flag bits that modify a basic type. They are combined with the code for
the basic type using inclusive-or.
PA_FLAG_PTR
If this bit is set, it indicates that the encoded type is a pointer to the base
type, rather than an immediate value. For example, ‘PA_INT|PA_FLAG_PTR’
represents the type ‘int *’.
PA_FLAG_SHORT
If this bit is set, it indicates that the base type is modified with short. (This
corresponds to the ‘h’ type modifier.)
PA_FLAG_LONG
If this bit is set, it indicates that the base type is modified with long. (This
corresponds to the ‘l’ type modifier.)
PA_FLAG_LONG_LONG
If this bit is set, it indicates that the base type is modified with long long.
(This corresponds to the ‘L’ type modifier.)
PA_FLAG_LONG_DOUBLE
This is a synonym for PA_FLAG_LONG_LONG, used by convention with a base
type of PA_DOUBLE to indicate a type of long double.
int
validate_args (char *format, int nargs, OBJECT *args)
{
int *argtypes;
int nwanted;
The way you do this is by registering the conversion with the function register_printf_
function; see Section 12.13.1 [Registering New Conversions], page 310. One of the argu-
ments you pass to this function is a pointer to a handler function that produces the actual
Chapter 12: Input/Output on Streams 310
output; see Section 12.13.3 [Defining the Output Handler], page 312, for information on
how to write this function.
You can also install a function that just returns information about the number and type
of arguments expected by the conversion specifier. See Section 12.12.10 [Parsing a Template
String], page 307, for information about this.
The facilities of this section are declared in the header file printf.h.
Portability Note: The ability to extend the syntax of printf template strings is a GNU
extension. ISO standard C has nothing similar. When using the GNU C compiler or any
other compiler that interprets calls to standard I/O functions according to the rules of
the language standard it is necessary to disable such handling by the appropriate compiler
option. Otherwise the behavior of a program that relies on the extension is undefined.
If you are going to use parse_printf_format in your application, you must also define
a function to pass as the arginfo-function argument for each new conversion you install with
register_printf_function.
You have to define these functions with a prototype like:
int function (const struct printf_info *info,
size_t n, int *argtypes)
Chapter 12: Input/Output on Streams 313
The return value from the function should be the number of arguments the conversion
expects. The function should also fill in no more than n elements of the argtypes array
with information about the types of each of these arguments. This information is encoded
using the various ‘PA_’ macros. (You will notice that this is the same calling convention
parse_printf_format itself uses.)
printf_arginfo_function [Data Type]
This type is used to describe functions that return information about the number and
type of arguments used by a conversion specifier.
#include <stdio.h>
#include <stdlib.h>
#include <printf.h>
typedef struct
{
char *name;
}
Widget;
int
print_widget (FILE *stream,
const struct printf_info *info,
const void *const *args)
{
const Widget *w;
char *buffer;
int len;
int
print_widget_arginfo (const struct printf_info *info, size_t n,
Chapter 12: Input/Output on Streams 314
int *argtypes)
{
/* We always take exactly one argument and this is a pointer to the
structure.. */
if (n > 0)
argtypes[0] = PA_POINTER;
return 1;
}
int
main (void)
{
/* Make a widget to print. */
Widget mywidget;
mywidget.name = "mywidget";
return 0;
}
Print a given floating point number as for the format %f except that there is a postfix
character indicating the divisor for the number to make this less than 1000. There are
two possible divisors: powers of 1024 or powers of 1000. Which one is used depends
on the format character specified while registered this handler. If the character is of
lower case, 1024 is used. For upper case characters, 1000 is used.
The postfix tag corresponds to bytes, kilobytes, megabytes, gigabytes, etc. The full
table is:
Chapter 12: Input/Output on Streams 315
To use these functions both functions must be registered with a call like
register_printf_function ('B', printf_size, printf_size_info);
Here we register the functions to print numbers as powers of 1000 since the format
character 'B' is an upper-case character. If we would additionally use 'b' in a line like
register_printf_function ('b', printf_size, printf_size_info);
we could also print using a power of 1024. Please note that all that is different in these two
lines is the format specifier. The printf_size function knows about the difference between
lower and upper case format specifiers.
The use of 'B' and 'b' is no coincidence. Rather it is the preferred way to use this
functionality since it is available on some other systems which also use format specifiers.
of precision for the numeric input conversions as there is for the corresponding output
conversions. Ordinarily, non-whitespace characters in the template are expected to match
characters in the input stream exactly, but a matching failure is distinct from an input error
on the stream.
Another area of difference between scanf and printf is that you must remember to
supply pointers rather than immediate values as the optional arguments to scanf; the
values that are read are stored in the objects that the pointers point to. Even experienced
programmers tend to forget this occasionally, so if your program is getting strange errors
that seem to be related to scanf, you might want to double-check this.
When a matching failure occurs, scanf returns immediately, leaving the first non-
matching character as the next character to be read from the stream. The normal re-
turn value from scanf is the number of values that were assigned, so you can use this to
determine if a matching error happened before all the expected values were read.
The scanf function is typically used for things like reading in the contents of tables. For
example, here is a function that uses scanf to initialize an array of double:
void
readarray (double *array, int n)
{
int i;
for (i=0; i<n; i++)
if (scanf (" %lf", &(array[i])) != 1)
invalid_input_error ();
}
The formatted input functions are not used as frequently as the formatted output func-
tions. Partly, this is because it takes some care to use them properly. Another reason is
that it is difficult to recover from a matching error.
If you are trying to read input that doesn’t match a single, fixed pattern, you may be
better off using a tool such as Flex to generate a lexical scanner, or Bison to generate a
parser, rather than using scanf. For more information about these tools, see Flex: The
Lexical Scanner Generator, and The Bison Reference Manual.
In more detail, an input conversion specification consists of an initial ‘%’ character fol-
lowed in sequence by:
• An optional flag character ‘*’, which says to ignore the text read for this specification.
When scanf finds a conversion specification that uses this flag, it reads input as directed
by the rest of the conversion specification, but it discards this input, does not use a
pointer argument, and does not increment the count of successful assignments.
• An optional flag character ‘a’ (valid with string conversions only) which requests allo-
cation of a buffer long enough to store the string in. (This is a GNU extension.) See
Section 12.14.6 [Dynamically Allocating String Conversions], page 322.
• An optional decimal integer that specifies the maximum field width. Reading of char-
acters from the input stream stops either when this maximum is reached or when a
non-matching character is found, whichever happens first. Most conversions discard
initial whitespace characters (those that don’t are explicitly documented), and these
discarded characters don’t count towards the maximum field width. String input con-
versions store a null character to mark the end of the input; the maximum field width
does not include this terminator.
• An optional type modifier character. For example, you can specify a type modifier of
‘l’ with integer conversions such as ‘%d’ to specify that the argument is a pointer to a
long int rather than a pointer to an int.
• A character that specifies the conversion to be applied.
The exact options that are permitted and how they are interpreted vary between the
different conversion specifiers. See the descriptions of the individual conversions for infor-
mation about the particular options that they allow.
With the ‘-Wformat’ option, the GNU C compiler checks calls to scanf and related
functions. It examines the format string and verifies that the correct number and types of
arguments are supplied. There is also a GNU C syntax to tell the compiler that a function
you write uses a scanf-style format string. See Section “Declaring Attributes of Functions”
in Using GNU CC, for more information.
‘%x’, ‘%X’ Matches an unsigned integer written in hexadecimal radix. See Section 12.14.4
[Numeric Input Conversions], page 319.
‘%e’, ‘%f’, ‘%g’, ‘%E’, ‘%F’, ‘%G’
Matches an optionally signed floating-point number. See Section 12.14.4 [Nu-
meric Input Conversions], page 319.
‘%s’
Matches a string containing only non-whitespace characters. See Section 12.14.5
[String Input Conversions], page 320. The presence of the ‘l’ modifier deter-
mines whether the output is stored as a wide character string or a multibyte
string. If ‘%s’ is used in a wide character function the string is converted as
with multiple calls to wcrtomb into a multibyte string. This means that the
buffer must provide room for MB_CUR_MAX bytes for each wide character read.
In case ‘%ls’ is used in a multibyte function the result is converted into wide
characters as with multiple calls of mbrtowc before being stored in the user
provided buffer.
‘%S’ This is an alias for ‘%ls’ which is supported for compatibility with the Unix
standard.
‘%[’ Matches a string of characters that belong to a specified set. See Section 12.14.5
[String Input Conversions], page 320. The presence of the ‘l’ modifier deter-
mines whether the output is stored as a wide character string or a multibyte
string. If ‘%[’ is used in a wide character function the string is converted as
with multiple calls to wcrtomb into a multibyte string. This means that the
buffer must provide room for MB_CUR_MAX bytes for each wide character read.
In case ‘%l[’ is used in a multibyte function the result is converted into wide
characters as with multiple calls of mbrtowc before being stored in the user
provided buffer.
‘%c’ Matches a string of one or more characters; the number of characters read
is controlled by the maximum field width given for the conversion. See Sec-
tion 12.14.5 [String Input Conversions], page 320.
If ‘%c’ is used in a wide stream function the read value is converted from a
wide character to the corresponding multibyte character before storing it. Note
that this conversion can produce more than one byte of output and therefore
the provided buffer must be large enough for up to MB_CUR_MAX bytes for each
character. If ‘%lc’ is used in a multibyte function the input is treated as a
multibyte sequence (and not bytes) and the result is converted as with calls to
mbrtowc.
‘%C’ This is an alias for ‘%lc’ which is supported for compatibility with the Unix
standard.
‘%p’ Matches a pointer value in the same implementation-defined format used by
the ‘%p’ output conversion for printf. See Section 12.14.7 [Other Input Con-
versions], page 323.
‘%n’ This conversion doesn’t read any characters; it records the number of characters
read so far by this call. See Section 12.14.7 [Other Input Conversions], page 323.
Chapter 12: Input/Output on Streams 319
‘%%’ This matches a literal ‘%’ character in the input stream. No corresponding
argument is used. See Section 12.14.7 [Other Input Conversions], page 323.
If the syntax of a conversion specification is invalid, the behavior is undefined. If there
aren’t enough function arguments provided to supply addresses for all the conversion spec-
ifications in the template strings that perform assignments, or if the arguments are not of
the correct types, the behavior is also undefined. On the other hand, extra arguments are
simply ignored.
‘ll’
‘L’
‘q’ Specifies that the argument is a long long int * or unsigned long long int
*. (The long long type is an extension supported by the GNU C compiler. For
systems that don’t provide extra-long integers, this is the same as long int.)
The ‘q’ modifier is another name for the same thing, which comes from 4.4
BSD; a long long int is sometimes called a “quad” int.
‘t’ Specifies that the argument is a ptrdiff_t *.
This modifier was introduced in ISO C99.
‘wn’ Specifies that the argument is an intn_t * or int_leastn_t * (which are the
same type), or uintn_t * or uint_leastn_t * (which are the same type).
This modifier was introduced in ISO C23.
‘wfn’ Specifies that the argument is an int_fastn_t * or uint_fastn_t *.
This modifier was introduced in ISO C23.
‘z’ Specifies that the argument is a size_t *.
This modifier was introduced in ISO C99.
All of the ‘%e’, ‘%f’, ‘%g’, ‘%E’, ‘%F’ and ‘%G’ input conversions are interchangeable. They
all match an optionally signed floating point number, in the same syntax as for the strtod
function (see Section 20.11.2 [Parsing of Floats], page 686).
For the floating-point input conversions, the default argument type is float *. (This
is different from the corresponding output conversions, where the default type is double;
remember that float arguments to printf are converted to double by the default argument
promotions, but float * arguments are not promoted to double *.) You can specify other
sizes of float using these type modifiers:
‘l’ Specifies that the argument is of type double *.
‘L’ Specifies that the argument is of type long double *.
For all the above number parsing formats there is an additional optional flag ‘'’. When
this flag is given the scanf function expects the number represented in the input string to be
formatted according to the grouping rules of the currently selected locale (see Section 7.7.1.1
[Generic Numeric Formatting Parameters], page 192).
If the "C" or "POSIX" locale is selected there is no difference. But for a locale which
specifies values for the appropriate fields in the locale the input must have the correct form
in the input. Otherwise the longest prefix with a correct form is processed.
Warning: To make a robust program, you must make sure that the input (plus its
terminating null) cannot possibly exceed the size of the buffer you provide. In general,
the only way to do this is to specify a maximum field width one less than the buffer size.
If you provide the buffer, always specify a maximum field width to prevent overflow.
• Ask scanf to allocate a big enough buffer, by specifying the ‘a’ flag character. This is
a GNU extension. You should provide an argument of type char ** for the buffer ad-
dress to be stored in. See Section 12.14.6 [Dynamically Allocating String Conversions],
page 322.
The ‘%c’ conversion is the simplest: it matches a fixed number of characters, always. The
maximum field width says how many characters to read; if you don’t specify the maximum,
the default is 1. This conversion doesn’t append a null character to the end of the text it
reads. It also does not skip over initial whitespace characters. It reads precisely the next
n characters, and fails if it cannot get that many. Since there is always a maximum field
width with ‘%c’ (whether specified, or 1 by default), you can always prevent overflow by
making the buffer long enough.
If the format is ‘%lc’ or ‘%C’ the function stores wide characters which are converted
using the conversion determined at the time the stream was opened from the external byte
stream. The number of bytes read from the medium is limited by MB_CUR_LEN * n but at
most n wide characters get stored in the output string.
The ‘%s’ conversion matches a string of non-whitespace characters. It skips and dis-
cards initial whitespace, but stops when it encounters more whitespace after having read
something. It stores a null character at the end of the text that it reads.
For example, reading the input:
hello, world
with the conversion ‘%10c’ produces " hello, wo", but reading the same input with the
conversion ‘%10s’ produces "hello,".
Warning: If you do not specify a field width for ‘%s’, then the number of characters
read is limited only by where the next whitespace character appears. This almost certainly
means that invalid input can make your program crash—which is a bug.
The ‘%ls’ and ‘%S’ format are handled just like ‘%s’ except that the external byte sequence
is converted using the conversion associated with the stream to wide characters with their
own encoding. A width or precision specified with the format do not directly determine how
many bytes are read from the stream since they measure wide characters. But an upper
limit can be computed by multiplying the value of the width or precision by MB_CUR_MAX.
To read in characters that belong to an arbitrary set of your choice, use the ‘%[’ conver-
sion. You specify the set between the ‘[’ character and a following ‘]’ character, using the
same syntax used in regular expressions for explicit sets of characters. As special cases:
• A literal ‘]’ character can be specified as the first character of the set.
• An embedded ‘-’ character (that is, one that is not the first or last character of the
set) is used to specify a range of characters.
• If a caret character ‘^’ immediately follows the initial ‘[’, then the set of allowed input
characters is everything except the characters listed.
The ‘%[’ conversion does not skip over initial whitespace characters.
Chapter 12: Input/Output on Streams 322
Note that the character class syntax available in character sets that appear inside regular
expressions (such as ‘[:alpha:]’) is not available in the ‘%[’ conversion.
Here are some examples of ‘%[’ conversions and what they mean:
‘%25[1234567890]’
Matches a string of up to 25 digits.
‘%25[^ \f\n\r\t\v]’
Matches a string up to 25 characters long that doesn’t contain any of the stan-
dard whitespace characters. This is slightly different from ‘%s’, because if the
input begins with a whitespace character, ‘%[’ reports a matching failure while
‘%s’ simply discards the initial whitespace.
‘%25[a-z]’
Matches up to 25 lowercase characters.
As for ‘%c’ and ‘%s’ the ‘%[’ format is also modified to produce wide characters if the ‘l’
modifier is present. All what is said about ‘%ls’ above is true for ‘%l[’.
One more reminder: the ‘%s’ and ‘%[’ conversions are dangerous if you don’t specify a
maximum width or use the ‘a’ flag, because input too long would overflow whatever buffer
you have provided for it. No matter how long your buffer is, a user could supply input
that is longer. A well-written program reports invalid input with a comprehensible error
message, not with a crash.
...
}
Chapter 12: Input/Output on Streams 323
int sscanf (const char *s, const char *template, ...) [Function]
Preliminary: | MT-Safe locale | AS-Unsafe heap | AC-Unsafe mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This is like scanf, except that the characters are taken from the null-terminated
string s instead of from a stream. Reaching the end of the string is treated as an
end-of-file condition.
The behavior of this function is undefined if copying takes place between objects that
overlap—for example, if s is also given as an argument to receive a string read under
control of the ‘%s’, ‘%S’, or ‘%[’ conversion.
This function is similar to scanf, but instead of taking a variable number of arguments
directly, it takes an argument list pointer ap of type va_list (see Section A.2 [Variadic
Functions], page 1017).
int vsscanf (const char *s, const char *template, va_list [Function]
ap)
Preliminary: | MT-Safe locale | AS-Unsafe heap | AC-Unsafe mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This is the equivalent of sscanf with the variable argument list specified directly as
for vscanf.
In GNU C, there is a special construct you can use to let the compiler know that a
function uses a scanf-style format string. Then it can check the number and types of
arguments in each call to the function, and warn you when they do not match the format
string. For details, see Section “Declaring Attributes of Functions” in Using GNU CC.
Chapter 12: Input/Output on Streams 326
In addition to setting the error indicator associated with the stream, the functions that
operate on streams also set errno in the same way as the corresponding low-level functions
that operate on file descriptors. For example, all of the functions that perform output
to a stream—such as fputc, printf, and fflush—are implemented in terms of write,
and all of the errno error conditions defined for write are meaningful for these functions.
For more information about the descriptor-level I/O functions, see Chapter 13 [Low-Level
Input/Output], page 347.
Note that it is not correct to just clear the error flag and retry a failed stream operation.
After a failed write, any number of characters since the last buffer flush may have been
committed to the file, while some buffered data may have been discarded. Merely retrying
can thus cause lost or repeated data.
A failed read may leave the file pointer in an inappropriate position for a second try. In
both cases, you should seek to a known position before retrying.
Most errors that can happen are not recoverable — a second try will always fail again
in the same way. So usually it is best to give up and report the error to the user, rather
than install complicated recovery logic.
One important exception is EINTR (see Section 25.5 [Primitives Interrupted by Signals],
page 793). Many stream I/O implementations will treat it as an ordinary error, which can be
quite inconvenient. You can avoid this hassle by installing all signals with the SA_RESTART
flag.
For similar reasons, setting nonblocking I/O on a stream’s file descriptor is not usually
advisable.
Chapter 12: Input/Output on Streams 328
fseek either flushes any buffered output before setting the file position or else re-
members it so it will be written later in its proper place in the file.
int fseeko (FILE *stream, off_t offset, int whence) [Function]
Preliminary: | MT-Safe | AS-Unsafe corrupt | AC-Unsafe lock corrupt | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to fseek but it corrects a problem with fseek in a system
with POSIX types. Using a value of type long int for the offset is not compatible
with POSIX. fseeko uses the correct type off_t for the offset parameter.
For this reason it is a good idea to prefer ftello whenever it is available since its
functionality is (if different at all) closer the underlying definition.
The functionality and return value are the same as for fseek.
The function is an extension defined in the Unix Single Specification version 2.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32 bit system
this function is in fact fseeko64. I.e., the LFS interface transparently replaces the
old interface.
int fseeko64 (FILE *stream, off64_t offset, int whence) [Function]
Preliminary: | MT-Safe | AS-Unsafe corrupt | AC-Unsafe lock corrupt | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to fseeko with the only difference that the offset parameter
is of type off64_t. This also requires that the stream stream was opened using either
fopen64, freopen64, or tmpfile64 since otherwise the underlying file operations to
position the file pointer beyond the 231 bytes limit might fail.
If the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32 bits machine this
function is available under the name fseeko and so transparently replaces the old
interface.
Portability Note: In non-POSIX systems, ftell, ftello, fseek and fseeko might work
reliably only on binary streams. See Section 12.17 [Text and Binary Streams], page 328.
The following symbolic constants are defined for use as the whence argument to fseek.
They are also used with the lseek function (see Section 13.2 [Input and Output Primitives],
page 351) and to specify offsets for file locks (see Section 13.12 [Control Operations on Files],
page 391).
int SEEK_SET [Macro]
This is an integer constant which, when used as the whence argument to the fseek
or fseeko functions, specifies that the offset provided is relative to the beginning of
the file.
int SEEK_CUR [Macro]
This is an integer constant which, when used as the whence argument to the fseek
or fseeko functions, specifies that the offset provided is relative to the current file
position.
int SEEK_END [Macro]
This is an integer constant which, when used as the whence argument to the fseek
or fseeko functions, specifies that the offset provided is relative to the end of the file.
Chapter 12: Input/Output on Streams 331
The use of line buffering for interactive devices implies that output messages ending in
a newline will appear immediately—which is usually what you want. Output that doesn’t
end in a newline might or might not show up immediately, so if you want them to ap-
pear immediately, you should flush buffered output explicitly with fflush, as described in
Section 12.20.2 [Flushing Buffers], page 334.
The fflush function can be used to flush all streams currently opened. While this
is useful in some situations it does often more than necessary since it might be done in
situations when terminal input is required and the program wants to be sure that all output
is visible on the terminal. But this means that only line buffered streams have to be flushed.
Solaris introduced a function especially for this. It was always available in the GNU C
Library in some form but never officially exported.
The facilities listed in this section are declared in the header file stdio.h.
int setvbuf (FILE *stream, char *buf, int mode, size_t [Function]
size)
Preliminary: | MT-Safe | AS-Unsafe corrupt | AC-Unsafe lock corrupt | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is used to specify that the stream stream should have the buffering mode
mode, which can be either _IOFBF (for full buffering), _IOLBF (for line buffering), or
_IONBF (for unbuffered input/output).
If you specify a null pointer as the buf argument, then setvbuf allocates a buffer
itself using malloc. This buffer will be freed when you close the stream.
Otherwise, buf should be a character array that can hold at least size characters. You
should not free the space for this array as long as the stream remains open and this
array remains its buffer. You should usually either allocate it statically, or malloc
(see Section 3.2.3 [Unconstrained Allocation], page 47) the buffer. Using an automatic
array is not a good idea unless you close the file before exiting the block that declares
the array.
While the array remains a stream buffer, the stream I/O functions will use the buffer
for their internal purposes. You shouldn’t try to access the values in the array directly
while the stream is using it for buffering.
The setvbuf function returns zero on success, or a nonzero value if the value of mode
is not valid or if the request could not be honored.
Chapter 12: Input/Output on Streams 336
This function makes stream be line buffered, and allocates the buffer for you.
This function is provided for compatibility with old BSD code. Use setvbuf instead.
It is possible to query whether a given stream is line buffered or not using a non-standard
function introduced in Solaris and available in the GNU C Library.
Two more extensions allow to determine the size of the buffer and how much of it is
used. These functions were also introduced in Solaris.
Here is an example of using fmemopen to create a stream for reading from a string:
#include <stdio.h>
int
main (void)
{
int ch;
FILE *stream;
return 0;
}
Chapter 12: Input/Output on Streams 339
#include <stdio.h>
int
main (void)
{
char *bp;
size_t size;
FILE *stream;
return 0;
}
This program produces the following output:
buf = `hello', size = 5
buf = `hello, world', size = 12
Chapter 12: Input/Output on Streams 340
This function actually creates the stream for communicating with the cookie using
the functions in the io-functions argument. The opentype argument is interpreted as
for fopen; see Section 12.3 [Opening Streams], page 271. (But note that the “truncate
on open” option is ignored.) The new stream is fully buffered.
The fopencookie function returns the newly created stream, or a null pointer in case
of an error.
the error and the tag parameter is a reference to the online documentation where
more information can be found. It should contain the label value and a unique iden-
tification number.
Each of the parameters can be a special value which means this value is to be omitted.
The symbolic names for these values are:
MM_NULLLBL
Ignore label parameter.
MM_NULLSEV
Ignore severity parameter.
MM_NULLMC
Ignore classification parameter. This implies that nothing is actually
printed.
MM_NULLTXT
Ignore text parameter.
MM_NULLACT
Ignore action parameter.
MM_NULLTAG
Ignore tag parameter.
There is another way certain fields can be omitted from the output to standard error.
This is described below in the description of environment variables influencing the
behavior.
The severity parameter can have one of the values in the following table:
MM_NOSEV Nothing is printed, this value is the same as MM_NULLSEV.
MM_HALT This value is printed as HALT.
MM_ERROR This value is printed as ERROR.
MM_WARNING
This value is printed as WARNING.
MM_INFO This value is printed as INFO.
The numeric value of these five macros are between 0 and 4. Using the environment
variable SEV_LEVEL or using the addseverity function one can add more severity
levels with their corresponding string to print. This is described below (see Sec-
tion 12.22.2 [Adding Severity Classes], page 344).
If no parameter is ignored the output looks like this:
label: severity-string: text
TO FIX: action tag
The colons, new line characters and the TO FIX string are inserted if necessary, i.e., if
the corresponding parameter is not ignored.
This function is specified in the X/Open Portability Guide. It is also available on all
systems derived from System V.
Chapter 12: Input/Output on Streams 344
The function returns the value MM_OK if no error occurred. If only the printing to
standard error failed, it returns MM_NOMSG. If printing to the console fails, it returns
MM_NOCON. If nothing is printed MM_NOTOK is returned. Among situations where all
outputs fail this last value is also returned if a parameter value is incorrect.
There are two environment variables which influence the behavior of fmtmsg. The first
is MSGVERB. It is used to control the output actually happening on standard error (not the
console output). Each of the five fields can explicitly be enabled. To do this the user has to
put the MSGVERB variable with a format like the following in the environment before calling
the fmtmsg function the first time:
MSGVERB=keyword[:keyword[:...]]
Valid keywords are label, severity, text, action, and tag. If the environment variable
is not given or is the empty string, a not supported keyword is given or the value is somehow
else invalid, no part of the message is masked out.
The second environment variable which influences the behavior of fmtmsg is SEV_LEVEL.
This variable and the change in the behavior of fmtmsg is not specified in the X/Open
Portability Guide. It is available in System V systems, though. It can be used to introduce
new severity levels. By default, only the five severity levels described above are available.
Any other numeric value would make fmtmsg print nothing.
If the user puts SEV_LEVEL with a format like
SEV_LEVEL=[description[:description[:...]]]
in the environment of the process before the first call to fmtmsg, where description has a
value of the form
severity-keyword,level,printstring
The severity-keyword part is not used by fmtmsg but it has to be present. The level
part is a string representation of a number. The numeric value must be a number greater
than 4. This value must be used in the severity parameter of fmtmsg to select this class.
It is not possible to overwrite any of the predefined classes. The printstring is the string
printed when a message of this class is processed by fmtmsg (see above, fmtsmg does not
print the numeric value but instead the string representation).
If string is NULL the severity class with the numeric value according to severity is
removed.
It is not possible to overwrite or remove one of the default severity classes. All calls
to addseverity with severity set to one of the values for the default classes will fail.
The return value is MM_OK if the task was successfully performed. If the return value is
MM_NOTOK something went wrong. This could mean that no more memory is available
or a class is not available when it has to be removed.
This function is not specified in the X/Open Portability Guide although the fmtsmg
function is. It is available on System V systems.
#include <fmtmsg.h>
int
main (void)
{
addseverity (5, "NOTE2");
fmtmsg (MM_PRINT, "only1field", MM_INFO, "text2", "action2", "tag2");
fmtmsg (MM_PRINT, "UX:cat", 5, "invalid syntax", "refer to manual",
"UX:cat:001");
fmtmsg (MM_PRINT, "label:foo", 6, "text", "action", "tag");
return 0;
}
The second call to fmtmsg illustrates a use of this function as it usually occurs on System
V systems, which heavily use this function. It seems worthwhile to give a short explanation
here of how this system works on System V. The value of the label field (UX:cat) says that
the error occurred in the Unix program cat. The explanation of the error follows and the
value for the action parameter is "refer to manual". One could be more specific here, if
necessary. The tag field contains, as proposed above, the value of the string given for the
label parameter, and additionally a unique ID (001 in this case). For a GNU environment
this string could contain a reference to the corresponding node in the Info page for the
program.
Running this program without specifying the MSGVERB and SEV_LEVEL function produces
the following output:
UX:cat: NOTE2: invalid syntax
TO FIX: refer to manual UX:cat:001
We see the different fields of the message and how the extra glue (the colons and the TO
FIX string) is printed. But only one of the three calls to fmtmsg produced output. The first
call does not print anything because the label parameter is not in the correct form. The
string must contain two fields, separated by a colon (see Section 12.22.1 [Printing Formatted
Messages], page 342). The third fmtmsg call produced no output since the class with the
numeric value 6 is not defined. Although a class with numeric value 5 is also not defined
by default, the call to addseverity introduces it and the second call to fmtmsg produces
the above output.
Chapter 12: Input/Output on Streams 346
13 Low-Level Input/Output
This chapter describes functions for performing low-level input/output operations on file de-
scriptors. These functions include the primitives for the higher-level I/O functions described
in Chapter 12 [Input/Output on Streams], page 270, as well as functions for performing
low-level control operations for which there are no equivalents on streams.
Stream-level I/O is more flexible and usually more convenient; therefore, programmers
generally use the descriptor-level functions only when necessary. These are some of the
usual reasons:
• For reading binary files in large chunks.
• For reading an entire file into core before parsing it.
• To perform operations other than data transfer, which can only be done with a de-
scriptor. (You can use fileno to get the descriptor corresponding to a stream.)
• To pass descriptors to a child process. (The child can create its own stream to use a
descriptor that it inherits, but cannot inherit a stream directly.)
int open (const char *filename, int flags[, mode_t mode]) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe fd | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The open function creates and returns a new file descriptor for the file named by
filename. Initially, the file position indicator for the file is at the beginning of the
file. The argument mode (see Section 14.9.5 [The Mode Bits for Access Permission],
page 443) is used only when a file is created, but it doesn’t hurt to supply the argument
in any case.
The flags argument controls how the file is to be opened. This is a bit mask; you create
the value by the bitwise OR of the appropriate parameters (using the ‘|’ operator in
C). See Section 13.15 [File Status Flags], page 395, for the parameters available.
The normal return value from open is a non-negative integer file descriptor. In the
case of an error, a value of −1 is returned instead. In addition to the usual file name
errors (see Section 11.2.3 [File Name Errors], page 268), the following errno error
conditions are defined for this function:
EACCES The file exists but is not readable/writable as requested by the flags
argument, or the file does not exist and the directory is unwritable so it
cannot be created.
EEXIST Both O_CREAT and O_EXCL are set, and the named file already exists.
EINTR The open operation was interrupted by a signal. See Section 25.5 [Prim-
itives Interrupted by Signals], page 793.
EISDIR The flags argument specified write access, and the file is a directory.
Chapter 13: Low-Level Input/Output 348
EMFILE The process has too many files open. The maximum number of file
descriptors is controlled by the RLIMIT_NOFILE resource limit; see Sec-
tion 23.2 [Limiting Resource Usage], page 737.
ENFILE The entire system, or perhaps the file system which contains the directory,
cannot support any additional open files at the moment. (This problem
cannot happen on GNU/Hurd systems.)
ENOENT The named file does not exist, and O_CREAT is not specified.
ENOSPC The directory or file system that would contain the new file cannot be
extended, because there is no disk space left.
ENXIO O_NONBLOCK and O_WRONLY are both set in the flags argument, the
file named by filename is a FIFO (see Chapter 15 [Pipes and FIFOs],
page 459), and no process has the file open for reading.
EROFS The file resides on a read-only file system and any of O_WRONLY, O_RDWR,
and O_TRUNC are set in the flags argument, or O_CREAT is set and the file
does not already exist.
If on a 32 bit machine the sources are translated with _FILE_OFFSET_BITS == 64 the
function open returns a file descriptor opened in the large file mode which enables
the file handling functions to use files up to 263 bytes in size and offset from −263 to
263 . This happens transparently for the user since all of the low-level file handling
functions are equally replaced.
This function is a cancellation point in multi-threaded programs. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time open is called. If the thread gets canceled these resources stay
allocated until the program ends. To avoid this calls to open should be protected
using cancellation handlers.
The open function is the underlying primitive for the fopen and freopen functions,
that create streams.
int open64 (const char *filename, int flags[, mode_t mode]) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe fd | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to open. It returns a file descriptor which can be used to
access the file named by filename. The only difference is that on 32 bit systems the
file is opened in the large file mode. I.e., file length and file offsets can exceed 31 bits.
When the sources are translated with _FILE_OFFSET_BITS == 64 this function is ac-
tually available under the name open. I.e., the new, extended API using 64 bit file
sizes and offsets transparently replaces the old API.
is equivalent to:
open (filename, O_WRONLY | O_CREAT | O_TRUNC, mode)
ENOSPC
EIO
EDQUOT When the file is accessed by NFS, these errors from write can some-
times not be detected until close. See Section 13.2 [Input and Output
Primitives], page 351, for details on their meaning.
Please note that there is no separate close64 function. This is not necessary since
this function does not determine nor depend on the mode of the file. The kernel which
performs the close operation knows which mode the descriptor is used for and can
handle this situation.
To close a stream, call fclose (see Section 12.4 [Closing Streams], page 275) instead of
trying to close its underlying file descriptor with close. This flushes any buffered output
and updates the stream object to indicate that it is closed.
The function closefrom closes all file descriptors greater than or equal to lowfd. This
function is similar to calling close for all open file descriptors not less than lowfd.
Already closed file descriptors are ignored.
Any condition that could result in EAGAIN can instead result in a success-
ful read which returns fewer bytes than requested. Calling read again
immediately would result in EAGAIN.
EBADF The filedes argument is not a valid file descriptor, or is not open for
reading.
EINTR read was interrupted by a signal while it was waiting for input. See
Section 25.5 [Primitives Interrupted by Signals], page 793. A signal will
not necessarily cause read to return EINTR; it may instead result in a
successful read which returns fewer bytes than requested.
EIO For many devices, and for disk files, this error code indicates a hardware
error.
EIO also occurs when a background process tries to read from the control-
ling terminal, and the normal action of stopping the process by sending
it a SIGTTIN signal isn’t working. This might happen if the signal is
being blocked or ignored, or because the process group is orphaned. See
Chapter 29 [Job Control], page 870, for more information about job con-
trol, and Chapter 25 [Signal Handling], page 766, for information about
signals.
EINVAL In some systems, when reading from a character or block device, position
and size offsets must be aligned to a particular block size. This error
indicates that the offsets were not properly aligned.
Please note that there is no function named read64. This is not necessary since this
function does not directly modify or handle the possibly wide file offset. Since the
kernel handles this state internally, the read function can be used for all cases.
This function is a cancellation point in multi-threaded programs. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time read is called. If the thread gets canceled these resources stay
allocated until the program ends. To avoid this, calls to read should be protected
using cancellation handlers.
The read function is the underlying primitive for all of the functions that read from
streams, such as fgetc.
ssize_t pread (int filedes, void *buffer, size_t size, [Function]
off_t offset)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The pread function is similar to the read function. The first three arguments are
identical, and the return values and error codes also correspond.
The difference is the fourth argument and its handling. The data block is not read
from the current position of the file descriptor filedes. Instead the data is read
from the file starting at position offset. The position of the file descriptor itself is not
affected by the operation. The value is the same as before the call.
When the source file is compiled with _FILE_OFFSET_BITS == 64 the pread function
is in fact pread64 and the type off_t has 64 bits, which makes it possible to handle
files up to 263 bytes in length.
Chapter 13: Low-Level Input/Output 353
The return value of pread describes the number of bytes read. In the error case it
returns −1 like read does and the error codes are also the same, with these additions:
EINVAL The value given for offset is negative and therefore illegal.
ESPIPE The file descriptor filedes is associated with a pipe or a FIFO and this
device does not allow positioning of the file pointer.
The function is an extension defined in the Unix Single Specification version 2.
and reports this error. An example of a situation that might cause the
process to block on output is writing to a terminal device that supports
flow control, where output has been suspended by receipt of a STOP
character.
Compatibility Note: Most versions of BSD Unix use a different error code
for this: EWOULDBLOCK. In the GNU C Library, EWOULDBLOCK is an alias
for EAGAIN, so it doesn’t matter which name you use.
On some systems, writing a large amount of data from a character special
file can also fail with EAGAIN if the kernel cannot find enough physical
memory to lock down the user’s pages. This is limited to devices that
transfer with direct memory access into the user’s memory, which means
it does not include terminals, since they always use separate buffers inside
the kernel. This problem does not arise on GNU/Hurd systems.
EBADF The filedes argument is not a valid file descriptor, or is not open for
writing.
EFBIG The size of the file would become larger than the implementation can
support.
EINTR The write operation was interrupted by a signal while it was blocked
waiting for completion. A signal will not necessarily cause write to return
EINTR; it may instead result in a successful write which writes fewer bytes
than requested. See Section 25.5 [Primitives Interrupted by Signals],
page 793.
EIO For many devices, and for disk files, this error code indicates a hardware
error.
ENOSPC The device containing the file is full.
EPIPE This error is returned when you try to write to a pipe or FIFO that isn’t
open for reading by any process. When this happens, a SIGPIPE signal
is also sent to the process; see Chapter 25 [Signal Handling], page 766.
EINVAL In some systems, when writing to a character or block device, position
and size offsets must be aligned to a particular block size. This error
indicates that the offsets were not properly aligned.
Unless you have arranged to prevent EINTR failures, you should check errno after
each failing call to write, and if the error was EINTR, you should simply repeat the
call. See Section 25.5 [Primitives Interrupted by Signals], page 793. The easy way to
do this is with the macro TEMP_FAILURE_RETRY, as follows:
nbytes = TEMP_FAILURE_RETRY (write (desc, buffer, count));
Please note that there is no function named write64. This is not necessary since this
function does not directly modify or handle the possibly wide file offset. Since the
kernel handles this state internally the write function can be used for all cases.
This function is a cancellation point in multi-threaded programs. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time write is called. If the thread gets canceled these resources stay
Chapter 13: Low-Level Input/Output 355
allocated until the program ends. To avoid this, calls to write should be protected
using cancellation handlers.
The write function is the underlying primitive for all of the functions that write to
streams, such as fputc.
operation. See Section 12.18 [File Positioning], page 328, for more information on the file
position and what it means.
To read the current file position value from a descriptor, use lseek (desc, 0, SEEK_
CUR).
off_t lseek (int filedes, off_t offset, int whence) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The lseek function is used to change the file position of the file with descriptor filedes.
The whence argument specifies how the offset should be interpreted, in the same way
as for the fseek function, and it must be one of the symbolic constants SEEK_SET,
SEEK_CUR, or SEEK_END.
SEEK_SET Specifies that offset is a count of characters from the beginning of the file.
SEEK_CUR Specifies that offset is a count of characters from the current file position.
This count may be positive or negative.
SEEK_END Specifies that offset is a count of characters from the end of the file. A
negative count specifies a position within the current extent of the file;
a positive count specifies a position past the current end. If you set the
position past the current end, and actually write data, you will extend
the file with zeros up to that position.
The return value from lseek is normally the resulting file position, measured in bytes
from the beginning of the file. You can use this feature together with SEEK_CUR to
read the current file position.
If you want to append to the file, setting the file position to the current end of file
with SEEK_END is not sufficient. Another process may write more data after you seek
but before you write, extending the file so the position you write onto clobbers their
data. Instead, use the O_APPEND operating mode; see Section 13.15.3 [I/O Operating
Modes], page 399.
You can set the file position past the current end of the file. This does not by itself
make the file longer; lseek never changes the file. But subsequent output at that
position will extend the file. Characters between the previous end of file and the new
position are filled with zeros. Extending the file in this way can create a “hole”: the
blocks of zeros are not actually allocated on disk, so the file takes up less space than
it appears to; it is then called a “sparse file”.
If the file position cannot be changed, or the operation is in some way invalid, lseek
returns a value of −1. The following errno error conditions are defined for this
function:
EBADF The filedes is not a valid file descriptor.
EINVAL The whence argument value is not valid, or the resulting file offset is not
valid. A file offset is invalid.
ESPIPE The filedes corresponds to an object that cannot be positioned, such as
a pipe, FIFO or terminal device. (POSIX.1 specifies this error only for
pipes and FIFOs, but on GNU systems, you always get ESPIPE if the
object is not seekable.)
Chapter 13: Low-Level Input/Output 357
When the source file is compiled with _FILE_OFFSET_BITS == 64 the lseek function
is in fact lseek64 and the type off_t has 64 bits which makes it possible to handle
files up to 263 bytes in length.
This function is a cancellation point in multi-threaded programs. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time lseek is called. If the thread gets canceled these resources stay
allocated until the program ends. To avoid this calls to lseek should be protected
using cancellation handlers.
The lseek function is the underlying primitive for the fseek, fseeko, ftell, ftello
and rewind functions, which operate on streams instead of file descriptors.
You can have multiple descriptors for the same file if you open the file more than once,
or if you duplicate a descriptor with dup. Descriptors that come from separate calls to open
have independent file positions; using lseek on one descriptor has no effect on the other.
For example,
{
int d1, d2;
char buf[4];
d1 = open ("foo", O_RDONLY);
d2 = open ("foo", O_RDONLY);
lseek (d1, 1024, SEEK_SET);
read (d2, buf, 4);
}
will read the first four characters of the file foo. (The error-checking code necessary for a
real program has been omitted here for brevity.)
By contrast, descriptors made by duplication share a common file position with the
original descriptor that was duplicated. Anything which alters the file position of one of the
duplicates, including reading or writing data, affects all of them alike. Thus, for example,
{
int d1, d2, d3;
char buf1[4], buf2[4];
d1 = open ("foo", O_RDONLY);
d2 = dup (d1);
d3 = dup (d2);
lseek (d3, 1024, SEEK_SET);
read (d1, buf1, 4);
read (d2, buf2, 4);
Chapter 13: Low-Level Input/Output 358
}
will read four characters starting with the 1024’th character of foo, and then four more
characters starting with the 1028’th character.
These aliases for the ‘SEEK_...’ constants exist for the sake of compatibility with older
BSD systems. They are defined in two different header files: fcntl.h and sys/file.h.
L_SET An alias for SEEK_SET.
L_INCR An alias for SEEK_CUR.
L_XTND An alias for SEEK_END.
For an example showing the use of the fdopen function, see Section 15.1 [Creating a
Pipe], page 459.
There are also symbolic constants defined in unistd.h for the file descriptors belonging
to the standard streams stdin, stdout, and stderr; see Section 12.2 [Standard Streams],
page 270.
STDIN_FILENO
This macro has value 0, which is the file descriptor for standard input.
STDOUT_FILENO
This macro has value 1, which is the file descriptor for standard output.
STDERR_FILENO
This macro has value 2, which is the file descriptor for standard error output.
If you have been using a stream for I/O (or have just opened the stream), and you
want to do I/O using another channel (either a stream or a descriptor) that is linked to it,
you must first clean up the stream that you have been using. See Section 13.5.3 [Cleaning
Streams], page 360.
Terminating a process, or executing a new program in the process, destroys all the
streams in the process. If descriptors linked to these streams persist in other processes,
their file positions become undefined as a result. To prevent this, you must clean up the
streams before destroying them.
stream, but leaves the file pointer at an unpredictable place; you must set the file pointer
before doing any further I/O.
Closing an output-only stream also does fflush, so this is a valid way of cleaning an
output stream.
You need not clean a stream before using its descriptor for control operations such as
setting terminal modes; these operations don’t affect the file position and are not affected
by it. You can use any descriptor for these operations, and all channels are affected simulta-
neously. However, text already “output” to a stream but still buffered by the stream will be
subject to the new terminal modes when subsequently flushed. To make sure “past” output
is covered by the terminal settings that were in effect at the time, flush the output streams
for that terminal before setting the modes. See Section 17.4 [Terminal Modes], page 515.
The writev function gathers data from the buffers described in vector, which is taken
to be count structures long, and writes them to filedes. As each buffer is written,
it moves on to the next.
Like readv, writev may stop midstream under the same conditions write would.
The return value is a count of bytes written, or −1 indicating an error. The possible
errors are the same as in write.
ssize_t preadv (int fd, const struct iovec *iov, int [Function]
iovcnt, off_t offset)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the readv function, with the difference it adds an extra
offset parameter of type off_t similar to pread. The data is read from the file
starting at position offset. The position of the file descriptor itself is not affected by
the operation. The value is the same as before the call.
When the source file is compiled with _FILE_OFFSET_BITS == 64 the preadv function
is in fact preadv64 and the type off_t has 64 bits, which makes it possible to handle
files up to 263 bytes in length.
The return value is a count of bytes (not buffers) read, 0 indicating end-of-file, or −1
indicating an error. The possible errors are the same as in readv and pread.
ssize_t preadv64 (int fd, const struct iovec *iov, int [Function]
iovcnt, off64_t offset)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the preadv function with the difference is that the offset
parameter is of type off64_t instead of off_t. It makes it possible on 32 bit machines
to address files larger than 231 bytes and up to 263 bytes. The file descriptor filedes
must be opened using open64 since otherwise the large offsets possible with off64_t
will lead to errors with a descriptor in small file mode.
When the source file is compiled using _FILE_OFFSET_BITS == 64 on a 32 bit ma-
chine this function is actually available under the name preadv and so transparently
replaces the 32 bit interface.
ssize_t pwritev (int fd, const struct iovec *iov, int [Function]
iovcnt, off_t offset)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the writev function, with the difference it adds an extra
offset parameter of type off_t similar to pwrite. The data is written to the file
starting at position offset. The position of the file descriptor itself is not affected by
the operation. The value is the same as before the call.
However, on Linux, if a file is opened with O_APPEND, pwrite appends data to the
end of the file, regardless of the value of offset.
Chapter 13: Low-Level Input/Output 363
When the source file is compiled with _FILE_OFFSET_BITS == 64 the pwritev func-
tion is in fact pwritev64 and the type off_t has 64 bits, which makes it possible to
handle files up to 263 bytes in length.
The return value is a count of bytes (not buffers) written, 0 indicating end-of-file, or
−1 indicating an error. The possible errors are the same as in writev and pwrite.
ssize_t pwritev64 (int fd, const struct iovec *iov, int [Function]
iovcnt, off64_t offset)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the pwritev function with the difference is that the offset
parameter is of type off64_t instead of off_t. It makes it possible on 32 bit machines
to address files larger than 231 bytes and up to 263 bytes. The file descriptor filedes
must be opened using open64 since otherwise the large offsets possible with off64_t
will lead to errors with a descriptor in small file mode.
When the source file is compiled using _FILE_OFFSET_BITS == 64 on a 32 bit ma-
chine this function is actually available under the name pwritev and so transparently
replaces the 32 bit interface.
ssize_t preadv2 (int fd, const struct iovec *iov, int [Function]
iovcnt, off_t offset, int flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the preadv function, with the difference it adds an extra
flags parameter of type int. Additionally, if offset is −1, the current file position is
used and updated (like the readv function).
The supported flags are dependent of the underlying system. For Linux it supports:
RWF_HIPRI
High priority request. This adds a flag that tells the file system that this
is a high priority request for which it is worth to poll the hardware. The
flag is purely advisory and can be ignored if not supported. The fd must
be opened using O_DIRECT.
RWF_DSYNC
Per-IO synchronization as if the file was opened with O_DSYNC flag.
RWF_SYNC Per-IO synchronization as if the file was opened with O_SYNC flag.
RWF_NOWAIT
Use nonblocking mode for this operation; that is, this call to preadv2 will
fail and set errno to EAGAIN if the operation would block.
RWF_APPEND
Per-IO synchronization as if the file was opened with O_APPEND flag.
RWF_NOAPPEND
This flag allows an offset to be honored, even if the file was opened with
O_APPEND flag.
Chapter 13: Low-Level Input/Output 364
When the source file is compiled with _FILE_OFFSET_BITS == 64 the preadv2 func-
tion is in fact preadv64v2 and the type off_t has 64 bits, which makes it possible
to handle files up to 263 bytes in length.
The return value is a count of bytes (not buffers) read, 0 indicating end-of-file, or −1
indicating an error. The possible errors are the same as in preadv with the addition
of:
EOPNOTSUPP
An unsupported flags was used.
ssize_t preadv64v2 (int fd, const struct iovec *iov, int [Function]
iovcnt, off64_t offset, int flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the preadv2 function with the difference is that the offset
parameter is of type off64_t instead of off_t. It makes it possible on 32 bit machines
to address files larger than 231 bytes and up to 263 bytes. The file descriptor filedes
must be opened using open64 since otherwise the large offsets possible with off64_t
will lead to errors with a descriptor in small file mode.
When the source file is compiled using _FILE_OFFSET_BITS == 64 on a 32 bit ma-
chine this function is actually available under the name preadv2 and so transparently
replaces the 32 bit interface.
ssize_t pwritev2 (int fd, const struct iovec *iov, int [Function]
iovcnt, off_t offset, int flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the pwritev function, with the difference it adds an extra
flags parameter of type int. Additionally, if offset is −1, the current file position
should is used and updated (like the writev function).
The supported flags are dependent of the underlying system. For Linux, the supported
flags are the same as those for preadv2.
When the source file is compiled with _FILE_OFFSET_BITS == 64 the pwritev2 func-
tion is in fact pwritev64v2 and the type off_t has 64 bits, which makes it possible
to handle files up to 263 bytes in length.
The return value is a count of bytes (not buffers) write, 0 indicating end-of-file, or
−1 indicating an error. The possible errors are the same as in preadv2.
ssize_t pwritev64v2 (int fd, const struct iovec *iov, int [Function]
iovcnt, off64_t offset, int flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to the pwritev2 function with the difference is that the offset
parameter is of type off64_t instead of off_t. It makes it possible on 32 bit machines
to address files larger than 231 bytes and up to 263 bytes. The file descriptor filedes
must be opened using open64 since otherwise the large offsets possible with off64_t
will lead to errors with a descriptor in small file mode.
Chapter 13: Low-Level Input/Output 365
was not opened with large file support (LFS) on 32-bit machines, and the
copy operation would create a file which is larger than what off_t could
represent.
EBADF The argument inputfd is not a valid file descriptor open for reading.
The argument outputfd is not a valid file descriptor open for writing, or
outputfd has been opened with O_APPEND.
In addition, copy_file_range can fail with the error codes which are used by read,
pread, write, and pwrite.
The copy_file_range function is a cancellation point. In case of cancellation, the
input location (the file position or the value at *inputpos) is indeterminate.
protect contains flags that control what kind of access is permitted. They include
PROT_READ, PROT_WRITE, and PROT_EXEC. The special flag PROT_NONE reserves a
region of address space for future use. The mprotect function can be used to change
the protection flags. See Section 3.4 [Memory Protection], page 78.
The flags parameter contains flags that control the nature of the map. One of MAP_
SHARED, MAP_SHARED_VALIDATE, or MAP_PRIVATE must be specified. Additional flags
may be bitwise OR’d to further define the mapping.
Note that, aside from MAP_PRIVATE and MAP_SHARED, not all flags are supported on
all versions of all operating systems. Consult the kernel-specific documentation for
details. The flags include:
MAP_PRIVATE
This specifies that writes to the region should never be written back to
the attached file. Instead, a copy is made for the process, and the region
will be swapped normally if memory runs low. No other process will see
the changes.
Since private mappings effectively revert to ordinary memory when writ-
ten to, you must have enough virtual memory for a copy of the entire
mmapped region if you use this mode with PROT_WRITE.
MAP_SHARED
This specifies that writes to the region will be written back to the file.
Changes made will be shared immediately with other processes mmaping
the same file.
Note that actual writing may take place at any time. You need to use
msync, described below, if it is important that other processes using con-
ventional I/O get a consistent view of the file.
MAP_SHARED_VALIDATE
Similar to MAP_SHARED except that additional flags will be validated by
the kernel, and the call will fail if an unrecognized flag is provided. With
MAP_SHARED using a flag on a kernel that doesn’t support it causes the flag
to be ignored. MAP_SHARED_VALIDATE should be used when the behavior
of all flags is required.
MAP_FIXED
This forces the system to use the exact mapping address specified in ad-
dress and fail if it can’t. Note that if the new mapping would overlap
an existing mapping, the overlapping portion of the existing map is un-
mapped.
MAP_ANONYMOUS
MAP_ANON This flag tells the system to create an anonymous mapping, not connected
to a file. filedes and offset are ignored, and the region is initialized with
zeros.
Anonymous maps are used as the basic primitive to extend the heap on
some systems. They are also useful to share data between multiple tasks
without creating a file.
Chapter 13: Low-Level Input/Output 368
MAP_HUGETLB
This requests that the system uses an alternative page size which is larger
than the default page size for the mapping. For some workloads, increas-
ing the page size for large mappings improves performance because the
system needs to handle far fewer pages. For other workloads which re-
quire frequent transfer of pages between storage or different nodes, the
decreased page granularity may cause performance problems due to the
increased page size and larger transfers.
In order to create the mapping, the system needs physically contiguous
memory of the size of the increased page size. As a result, MAP_HUGETLB
mappings are affected by memory fragmentation, and their creation can
fail even if plenty of memory is available in the system.
Not all file systems support mappings with an increased page size.
The MAP_HUGETLB flag is specific to Linux.
MAP_32BIT
Require addresses that can be accessed with a signed 32 bit pointer, i.e.,
within the first 2 GiB. Ignored if MAP FIXED is specified.
MAP_DENYWRITE
MAP_EXECUTABLE
MAP_FILE
Provided for compatibility. Ignored by the Linux kernel.
MAP_FIXED_NOREPLACE
Similar to MAP_FIXED except the call will fail with EEXIST if the new
mapping would overwrite an existing mapping. To test for support for this
flag, specify MAP FIXED NOREPLACE without MAP FIXED, and (if
the call was successful) check the actual address returned. If it does not
match the address passed, then this flag is not supported.
MAP_GROWSDOWN
This flag is used to make stacks, and is typically only needed inside the
program loader to set up the main stack for the running process. The
mapping is created according to the other flags, except an additional
page just prior to the mapping is marked as a “guard page”. If a write is
attempted inside this guard page, that page is mapped, the mapping is
extended, and a new guard page is created. Thus, the mapping continues
to grow towards lower addresses until it encounters some other mapping.
Note that accessing memory beyond the guard page will not trigger this
feature. In gcc, use -fstack-clash-protection to ensure the guard
page is always touched.
Chapter 13: Low-Level Input/Output 369
MAP_LOCKED
A hint that requests that mapped pages are locked in memory (i.e. not
paged out). Note that this is a request and not a requirement; use mlock
if locking is required.
MAP_POPULATE
MAP_NONBLOCK
MAP_POPULATE is a hint that requests that the kernel read-ahead a file-
backed mapping, causing pages to be mapped before they’re needed. MAP_
NONBLOCK is a hint that requests that the kernel not attempt such except
for pages are already in memory. Note that neither of these hints affects
future paging activity, use mlock if such needs to be controlled.
MAP_NORESERVE
Asks the kernel to not reserve physical backing (i.e. space in a swap
device) for a mapping. This would be useful for, for example, a very large
but sparsely used mapping which need not be limited in total length by
available RAM, but with very few mapped pages. Note that writes to
such a mapping may cause a SIGSEGV if the system is unable to map a
page due to lack of resources.
On Linux, this flag’s behavior may be overwridden by
/proc/sys/vm/overcommit_memory as documented in the
proc(5) man page.
MAP_STACK
Ensures that the resulting mapping is suitable for use as a program stack.
For example, the use of huge pages might be precluded.
MAP_SYNC This is a special flag for DAX devices, which tells the kernel to write dirty
metadata out whenever dirty data is written out. Unlike most other flags,
this one will fail unless MAP_SHARED_VALIDATE is also given.
mmap returns the address of the new mapping, or MAP_FAILED for an error.
Possible errors include:
EACCES
filedes was not open for the type of access specified in protect.
EAGAIN
The system has temporarily run out of resources.
EBADF
The fd passed is invalid, and a valid file descriptor is required (i.e.
MAP ANONYMOUS was not specified).
EEXIST
MAP_FIXED_NOREPLACE was specified and an existing mapping was found
overlapping the requested address range.
EINVAL
Chapter 13: Low-Level Input/Output 370
only entire pages can be removed. If length is not an even number of pages, it will
be rounded up.
It returns 0 for success and −1 for an error.
One error is possible:
EINVAL The memory range given was outside the user mmap range or wasn’t page
aligned.
EAGAIN The region has pages locked, and if extended it would exceed the process’s
resource limit for locked pages. See Section 23.2 [Limiting Resource Us-
age], page 737.
ENOMEM The region is private writable, and insufficient virtual memory is available
to extend it. Also, this error will occur if MREMAP_MAYMOVE is not given
and the extension would collide with another mapped region.
This function is only available on a few systems. Except for performing optional opti-
mizations one should not rely on this function.
Not all file descriptors may be mapped. Sockets, pipes, and most devices only allow
sequential access and do not fit into the mapping abstraction. In addition, some regular
files may not be mmapable, and older kernels may not support mapping at all. Thus,
programs using mmap should have a fallback method to use should it fail. See Section
“Mmap” in GNU Coding Standards.
int madvise (void *addr, size_t length, int advice) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function can be used to provide the system with advice about the intended usage
patterns of the memory region starting at addr and extending length bytes.
The valid BSD values for advice are:
MADV_NORMAL
The region should receive no further special treatment.
MADV_RANDOM
The region will be accessed via random page references. The kernel should
page-in the minimal number of pages for each page fault.
MADV_SEQUENTIAL
The region will be accessed via sequential page references. This may
cause the kernel to aggressively read-ahead, expecting further sequential
references after any page fault within this region.
MADV_WILLNEED
The region will be needed. The pages within this region may be pre-
faulted in by the kernel.
MADV_DONTNEED
The region is no longer needed. The kernel may free these pages, causing
any changes to the pages to be lost, as well as swapped out pages to be
discarded.
MADV_HUGEPAGE
Indicate that it is beneficial to increase the page size for this mapping.
This can improve performance for larger mappings because the system
needs to handle far fewer pages. However, if parts of the mapping are
frequently transferred between storage or different nodes, performance
may suffer because individual transfers can become substantially larger
due to the increased page size.
Chapter 13: Low-Level Input/Output 373
int shm_open (const char *name, int oflag, mode_t mode) [Function]
Preliminary: | MT-Safe locale | AS-Unsafe init heap lock | AC-Unsafe lock mem fd
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function returns a file descriptor that can be used to allocate shared memory
via mmap. Unrelated processes can use same name to create or open existing shared
memory objects.
A name argument specifies the shared memory object to be opened. In the GNU C
Library it must be a string smaller than NAME_MAX bytes starting with an optional
slash but containing no other slashes.
The semantics of oflag and mode arguments is same as in open.
shm_open returns the file descriptor on success or −1 on error. On failure errno is
set.
The memfd_create function returns a file descriptor which can be used to create
memory mappings using the mmap function. It is similar to the shm_open function in
the sense that these mappings are not backed by actual files. However, the descriptor
returned by memfd_create does not correspond to a named object; the name argu-
ment is used for debugging purposes only (e.g., will appear in /proc), and separate
invocations of memfd_create with the same name will not return descriptors for the
same region of memory. The descriptor can also be used to create alias mappings
within the same process.
The descriptor initially refers to a zero-length file. Before mappings can be created
which are backed by memory, the file size needs to be increased with the ftruncate
function. See Section 14.9.10 [File Size], page 451.
The flags argument can be a combination of the following flags:
MFD_CLOEXEC
The descriptor is created with the O_CLOEXEC flag.
MFD_ALLOW_SEALING
The descriptor supports the addition of seals using the fcntl function.
MFD_HUGETLB
This requests that mappings created using the returned file descriptor use
a larger page size. See MAP_HUGETLB above for details.
This flag is incompatible with MFD_ALLOW_SEALING.
memfd_create returns a file descriptor on success, and −1 on failure.
The following errno error conditions are defined for this function:
EINVAL An invalid combination is specified in flags, or name is too long.
EFAULT The name argument does not point to a string.
EMFILE The operation would exceed the file descriptor limit for this process.
ENFILE The operation would exceed the system-wide file descriptor limit.
ENOMEM There is not enough memory for the operation.
In the case of a server socket (see Section 16.9.2 [Listening for Connections], page 492),
we say that “input” is available when there are pending connections that could be accepted
(see Section 16.9.3 [Accepting Connections], page 493). accept for server sockets blocks
and interacts with select just as read does for normal input.
The file descriptor sets for the select function are specified as fd_set objects. Here is
the description of the data type and some macros for manipulating these objects.
#include <errno.h>
#include <stdio.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/time.h>
int
input_timeout (int filedes, unsigned int seconds)
{
fd_set set;
struct timeval timeout;
int
main (void)
{
fprintf (stderr, "select returned %d.\n",
input_timeout (STDIN_FILENO, 5));
return 0;
}
There is another example showing the use of select to multiplex input from multiple
sockets in Section 16.9.7 [Byte Stream Connection Server Example], page 498.
For an alternate interface to this functionality, see poll (see Section 13.21 [Other low-
level-I/O-related functions], page 410).
Programs more often want to ensure that data written to a given file is committed,
rather than all data in the system. For this, sync is overkill.
Sometimes it is not even necessary to write all data associated with a file descriptor. E.g.,
in database files which do not change in size it is enough to write all the file content data to
the device. Meta-information, like the modification time etc., are not that important and
leaving such information uncommitted does not prevent a successful recovery of the file in
case of a problem.
The return value of the function is zero if no error occurred. Otherwise it is −1 and
the global variable errno is set to the following values:
EBADF The descriptor fildes is not valid.
EINVAL No synchronization is possible since the system does not implement this.
int aio_reqprio
If the platform has defined _POSIX_PRIORITIZED_IO and _POSIX_
PRIORITY_SCHEDULING, the AIO requests are processed based on the
current scheduling priority. The aio_reqprio element can then be used
to lower the priority of the AIO operation.
struct sigevent aio_sigevent
This element specifies how the calling process is notified once the opera-
tion terminates. If the sigev_notify element is SIGEV_NONE, no notifica-
tion is sent. If it is SIGEV_SIGNAL, the signal determined by sigev_signo
is sent. Otherwise, sigev_notify must be SIGEV_THREAD. In this case,
a thread is created which starts executing the function pointed to by
sigev_notify_function.
int aio_lio_opcode
This element is only used by the lio_listio and lio_listio64 func-
tions. Since these functions allow an arbitrary number of operations to
start at once, and each operation can be input or output (or nothing),
the information must be stored in the control block. The possible values
are:
LIO_READ Start a read operation. Read from the file at position aio_
offset and store the next aio_nbytes bytes in the buffer
pointed to by aio_buf.
LIO_WRITE
Start a write operation. Write aio_nbytes bytes starting at
aio_buf into the file starting at position aio_offset.
LIO_NOP Do nothing for this control block. This value is useful some-
times when an array of struct aiocb values contains holes,
i.e., some of the values must not be handled although the
whole array is presented to the lio_listio function.
When the sources are compiled using _FILE_OFFSET_BITS == 64 on a 32 bit machine,
this type is in fact struct aiocb64, since the LFS interface transparently replaces
the struct aiocb definition.
For use with the AIO functions defined in the LFS, there is a similar type defined which
replaces the types of the appropriate members with larger types but otherwise is equivalent
to struct aiocb. Particularly, all member names are the same.
off64_t aio_offset
This element specifies at which offset in the file the operation (input or
output) is performed. Since the operation are carried in arbitrary order
and more than one operation for one file descriptor can be started, one
cannot expect a current read/write position of the file descriptor.
volatile void *aio_buf
This is a pointer to the buffer with the data to be written or the place
where the read data is stored.
size_t aio_nbytes
This element specifies the length of the buffer pointed to by aio_buf.
int aio_reqprio
If for the platform _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_
SCHEDULING are defined the AIO requests are processed based on the
current scheduling priority. The aio_reqprio element can then be used
to lower the priority of the AIO operation.
struct sigevent aio_sigevent
This element specifies how the calling process is notified once the opera-
tion terminates. If the sigev_notify element is SIGEV_NONE no notifica-
tion is sent. If it is SIGEV_SIGNAL, the signal determined by sigev_signo
is sent. Otherwise, sigev_notify must be SIGEV_THREAD in which case
a thread is created which starts executing the function pointed to by
sigev_notify_function.
int aio_lio_opcode
This element is only used by the lio_listio and lio_listio64 func-
tions. Since these functions allow an arbitrary number of operations
to start at once, and since each operation can be input or output (or
nothing), the information must be stored in the control block. See the
description of struct aiocb for a description of the possible values.
When the sources are compiled using _FILE_OFFSET_BITS == 64 on a 32 bit machine,
this type is available under the name struct aiocb64, since the LFS transparently
replaces the old interface.
The calling process is notified about the termination of the read request according to
the aiocbp->aio_sigevent value.
When aio_read returns, the return value is zero if no error occurred that can be
found before the process is enqueued. If such an early error is found, the function
returns −1 and sets errno to one of the following values:
EAGAIN The request was not enqueued due to (temporarily) exceeded resource
limitations.
ENOSYS The aio_read function is not implemented.
EBADF The aiocbp->aio_fildes descriptor is not valid. This condition need
not be recognized before enqueueing the request and so this error might
also be signaled asynchronously.
EINVAL The aiocbp->aio_offset or aiocbp->aio_reqpiro value is invalid.
This condition need not be recognized before enqueueing the request
and so this error might also be signaled asynchronously.
If aio_read returns zero, the current status of the request can be queried using aio_
error and aio_return functions. As long as the value returned by aio_error is
EINPROGRESS the operation has not yet completed. If aio_error returns zero, the
operation successfully terminated, otherwise the value is to be interpreted as an error
code. If the function terminated, the result of the operation can be obtained using
a call to aio_return. The returned value is the same as an equivalent call to read
would have returned. Possible error codes returned by aio_error are:
EBADF The aiocbp->aio_fildes descriptor is not valid.
ECANCELED
The operation was canceled before the operation was finished (see Sec-
tion 13.11.4 [Cancellation of AIO Operations], page 389)
EINVAL The aiocbp->aio_offset value is invalid.
When the sources are compiled with _FILE_OFFSET_BITS == 64 this function is in
fact aio_read64 since the LFS interface transparently replaces the normal imple-
mentation.
int aio_read64 (struct aiocb64 *aiocbp) [Function]
Preliminary: | MT-Safe | AS-Unsafe lock heap | AC-Unsafe lock mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to the aio_read function. The only difference is that on 32 bit
machines, the file descriptor should be opened in the large file mode. Internally, aio_
read64 uses functionality equivalent to lseek64 (see Section 13.3 [Setting the File
Position of a Descriptor], page 355) to position the file descriptor correctly for the
reading, as opposed to the lseek functionality used in aio_read.
When the sources are compiled with _FILE_OFFSET_BITS == 64, this function is avail-
able under the name aio_read and so transparently replaces the interface for small
files on 32 bit machines.
To write data asynchronously to a file, there exists an equivalent pair of functions with
a very similar interface.
Chapter 13: Low-Level Input/Output 383
Besides these functions with the more or less traditional interface, POSIX.1b also defines
a function which can initiate more than one operation at a time, and which can handle
freely mixed read and write operations. It is therefore similar to a combination of readv
and writev.
int lio_listio (int mode, struct aiocb *const list[], int [Function]
nent, struct sigevent *sig)
Preliminary: | MT-Safe | AS-Unsafe lock heap | AC-Unsafe lock mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The lio_listio function can be used to enqueue an arbitrary number of read and
write requests at one time. The requests can all be meant for the same file, all for
different files or every solution in between.
lio_listio gets the nent requests from the array pointed to by list. The operation
to be performed is determined by the aio_lio_opcode member in each element of
list. If this field is LIO_READ a read operation is enqueued, similar to a call of aio_
read for this element of the array (except that the way the termination is signalled is
different, as we will see below). If the aio_lio_opcode member is LIO_WRITE a write
operation is enqueued. Otherwise the aio_lio_opcode must be LIO_NOP in which
case this element of list is simply ignored. This “operation” is useful in situations
where one has a fixed array of struct aiocb elements from which only a few need to
be handled at a time. Another situation is where the lio_listio call was canceled
before all requests are processed (see Section 13.11.4 [Cancellation of AIO Operations],
page 389) and the remaining requests have to be reissued.
The other members of each element of the array pointed to by list must have values
suitable for the operation as described in the documentation for aio_read and aio_
write above.
The mode argument determines how lio_listio behaves after having enqueued all
the requests. If mode is LIO_WAIT it waits until all requests terminated. Otherwise
mode must be LIO_NOWAIT and in this case the function returns immediately after
having enqueued all the requests. In this case the caller gets a notification of the
termination of all requests according to the sig parameter. If sig is NULL no notification
is sent. Otherwise a signal is sent or a thread is started, just as described in the
description for aio_read or aio_write.
Chapter 13: Low-Level Input/Output 385
If mode is LIO_WAIT, the return value of lio_listio is 0 when all requests completed
successfully. Otherwise the function returns −1 and errno is set accordingly. To find
out which request or requests failed one has to use the aio_error function on all the
elements of the array list.
In case mode is LIO_NOWAIT, the function returns 0 if all requests were enqueued
correctly. The current state of the requests can be found using aio_error and aio_
return as described above. If lio_listio returns −1 in this mode, the global variable
errno is set accordingly. If a request did not yet terminate, a call to aio_error returns
EINPROGRESS. If the value is different, the request is finished and the error value (or
0) is returned and the result of the operation can be retrieved using aio_return.
Possible values for errno are:
EAGAIN The resources necessary to queue all the requests are not available at the
moment. The error status for each element of list must be checked to
determine which request failed.
Another reason could be that the system wide limit of AIO requests
is exceeded. This cannot be the case for the implementation on GNU
systems since no arbitrary limits exist.
EINVAL The mode parameter is invalid or nent is larger than AIO_LISTIO_MAX.
EIO One or more of the request’s I/O operations failed. The error status of
each request should be checked to determine which one failed.
ENOSYS The lio_listio function is not supported.
If the mode parameter is LIO_NOWAIT and the caller cancels a request, the error status
for this request returned by aio_error is ECANCELED.
When the sources are compiled with _FILE_OFFSET_BITS == 64, this function is in
fact lio_listio64 since the LFS interface transparently replaces the normal imple-
mentation.
performed truly asynchronously (as with aio_read and aio_write and with lio_listio
when the mode is LIO_NOWAIT), one sometimes needs to know whether a specific request
already terminated and if so, what the result was. The following two functions allow you
to get this kind of information.
is NULL) weren’t successfully canceled. If all requests already terminated at the time
aio_cancel is called the return value is AIO_ALLDONE.
If an error occurred during the execution of aio_cancel the function returns −1 and
sets errno to one of the following values.
EBADF The file descriptor fildes is not valid.
ENOSYS aio_cancel is not implemented.
When the sources are compiled with _FILE_OFFSET_BITS == 64, this function is in
fact aio_cancel64 since the LFS interface transparently replaces the normal imple-
mentation.
int aio_cancel64 (int fildes, struct aiocb64 *aiocbp) [Function]
Preliminary: | MT-Safe | AS-Unsafe lock heap | AC-Unsafe lock mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to aio_cancel with the only difference that the argument is
a reference to a variable of type struct aiocb64.
When the sources are compiled with _FILE_OFFSET_BITS == 64, this function is avail-
able under the name aio_cancel and so transparently replaces the interface for small
files on 32 bit machines.
int aio_numusers
Unused.
int aio_reserved[2]
Unused.
F_SETFL Set flags associated with the open file. See Section 13.15 [File Status
Flags], page 395.
F_GETLK Test a file lock. See Section 13.16 [File Locks], page 401.
F_SETLK Set or clear a file lock. See Section 13.16 [File Locks], page 401.
F_SETLKW Like F_SETLK, but wait for completion. See Section 13.16 [File Locks],
page 401.
F_OFD_GETLK
Test an open file description lock. See Section 13.17 [Open File Descrip-
tion Locks], page 404. Specific to Linux.
F_OFD_SETLK
Set or clear an open file description lock. See Section 13.17 [Open File
Description Locks], page 404. Specific to Linux.
F_OFD_SETLKW
Like F_OFD_SETLK, but block until lock is acquired. See Section 13.17
[Open File Description Locks], page 404. Specific to Linux.
F_GETOWN Get process or process group ID to receive SIGIO signals. See Sec-
tion 13.19 [Interrupt-Driven Input], page 408.
F_SETOWN Set process or process group ID to receive SIGIO signals. See Section 13.19
[Interrupt-Driven Input], page 408.
This function is a cancellation point in multi-threaded programs for the commands F_
SETLKW (and the LFS analogous F_SETLKW64) and F_OFD_SETLKW. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time fcntl is called. If the thread gets canceled these resources stay
allocated until the program ends. To avoid this calls to fcntl should be protected
using cancellation handlers.
program in a child process. When the new program is executed, it creates and initializes
the standard streams to point to the corresponding file descriptors, before its main function
is invoked.
So, to redirect standard input to a file, the shell could do something like:
pid = fork ();
if (pid == 0)
{
char *filename;
char *program;
int file;
...
file = TEMP_FAILURE_RETRY (open (filename, O_RDONLY));
dup2 (file, STDIN_FILENO);
TEMP_FAILURE_RETRY (close (file));
execv (program, NULL);
}
There is also a more detailed example showing how to implement redirection in the
context of a pipeline of processes in Section 29.5.3 [Launching Jobs], page 875.
The following macro is defined for use as a file descriptor flag with the fcntl function.
The value is an integer constant usable as a bit mask value.
If you want to modify the file descriptor flags, you should get the current flags with
F_GETFD and modify the value. Don’t assume that the flags listed here are the only ones
that are implemented; your program may be run years from now and more flags may exist
then. For example, here is a function to set or clear the flag FD_CLOEXEC without altering
any other flags:
/* Set the FD_CLOEXEC flag of desc if value is nonzero,
or clear the flag if value is 0.
Return 0 on success, or -1 on error with errno set. */
int
set_cloexec_flag (int desc, int value)
{
int oldflags = fcntl (desc, F_GETFD, 0);
/* If reading the flags failed, return error indication now. */
if (oldflags < 0)
return oldflags;
/* Set just the flag we want to set. */
if (value != 0)
oldflags |= FD_CLOEXEC;
else
oldflags &= ~FD_CLOEXEC;
/* Store modified flag word in the descriptor. */
return fcntl (desc, F_SETFD, oldflags);
}
The portable file access modes O_RDONLY, O_WRONLY, and O_RDWR may not correspond to
individual bits. To determine the file access mode with fcntl, you must extract the access
mode bits from the retrieved file status flags, using the O_ACCMODE mask.
If a non-standard file access mode is used (such as O_PATH or O_EXEC), masking with
O_ACCMODE may give incorrect results. These non-standard access modes are identified by
individual bits and have to be checked directly (without masking with O_ACCMODE first).
On GNU/Hurd systems (but not on other systems), O_RDONLY and O_WRONLY are inde-
pendent bits that can be bitwise-ORed together, and it is valid for either bit to be set or
clear. This means that O_RDWR is the same as O_RDONLY|O_WRONLY. A file access mode of
zero is permissible; it allows no operations that do input or output to the file, but does allow
other operations such as fchmod. On GNU/Hurd systems, since “read-only” or “write-only”
is a misnomer, fcntl.h defines additional names for the file access modes.
O_TRUNC flag existed in Unix before ftruncate was invented, and is retained for
backward compatibility.
The remaining operating modes are BSD extensions. They exist only on some systems.
On other systems, these macros are not defined.
int O_SHLOCK [Macro]
Acquire a shared lock on the file, as with flock. See Section 13.16 [File Locks],
page 401.
If O_CREAT is specified, the locking is done atomically when creating the file. You are
guaranteed that no other process will get the lock on the new file first.
int O_EXLOCK [Macro]
Acquire an exclusive lock on the file, as with flock. See Section 13.16 [File Locks],
page 401. This is atomic like O_SHLOCK.
If you want to modify the file status flags, you should get the current flags with F_GETFL
and modify the value. Don’t assume that the flags listed here are the only ones that are
implemented; your program may be run years from now and more flags may exist then. For
example, here is a function to set or clear the flag O_NONBLOCK without altering any other
flags:
Chapter 13: Low-Level Input/Output 401
int
set_nonblock_flag (int desc, int value)
{
int oldflags = fcntl (desc, F_GETFL, 0);
/* If reading the flags failed, return error indication now. */
if (oldflags == -1)
return -1;
/* Set just the flag we want to set. */
if (value != 0)
oldflags |= O_NONBLOCK;
else
oldflags &= ~O_NONBLOCK;
/* Store modified flag word in the descriptor. */
return fcntl (desc, F_SETFL, oldflags);
}
The following macros are defined for use as values for the l_type member of the flock
structure. The values are integer constants.
F_RDLCK This macro is used to specify a read (or shared) lock.
F_WRLCK This macro is used to specify a write (or exclusive) lock.
F_UNLCK This macro is used to specify that the region is unlocked.
As an example of a situation where file locking is useful, consider a program that can
be run simultaneously by several different users, that logs status information to a common
file. One example of such a program might be a game that uses a file to keep track of high
scores. Another example might be a program that records usage or accounting information
for billing purposes.
Having multiple copies of the program simultaneously writing to the file could cause
the contents of the file to become mixed up. But you can prevent this kind of problem by
setting a write lock on the file before actually writing to the file.
If the program also needs to read the file and wants to make sure that the contents of
the file are in a consistent state, then it can also use a read lock. While the read lock is set,
no other process can lock that part of the file for writing.
Remember that file locks are only an advisory protocol for controlling access to a file.
There is still potential for access to the file by programs that don’t use the lock protocol.
Open file description locks use the same struct flock as process-associated locks as an
argument (see Section 13.16 [File Locks], page 401) and the macros for the command values
are also declared in the header file fcntl.h. To use them, the macro _GNU_SOURCE must be
defined prior to including any header file.
In contrast to process-associated locks, any struct flock used as an argument to open
file description lock commands must have the l_pid value set to 0. Also, when returning
information about an open file description lock in a F_GETLK or F_OFD_GETLK request, the
l_pid field in struct flock will be set to −1 to indicate that the lock is not associated
with a process.
When the same struct flock is reused as an argument to a F_OFD_SETLK or F_OFD_
SETLKW request after being used for an F_OFD_GETLK request, it is necessary to inspect and
reset the l_pid field to 0.
int F_OFD_GETLK [Macro]
This macro is used as the command argument to fcntl, to specify that it should
get information about a lock. This command requires a third argument of type
struct flock * to be passed to fcntl, so that the form of the call is:
fcntl (filedes, F_OFD_GETLK, lockp)
If there is a lock already in place that would block the lock described by the lockp
argument, information about that lock is written to *lockp. Existing locks are not
reported if they are compatible with making a new lock as specified. Thus, you should
specify a lock type of F_WRLCK if you want to find out about both read and write locks,
or F_RDLCK if you want to find out about write locks only.
There might be more than one lock affecting the region specified by the lockp argu-
ment, but fcntl only returns information about one of them. Which lock is returned
in this situation is undefined.
The l_whence member of the lockp structure are set to SEEK_SET and the l_start
and l_len fields are set to identify the locked region.
If no conflicting lock exists, the only change to the lockp structure is to update the
l_type field to the value F_UNLCK.
The normal return value from fcntl with this command is either 0 on success or −1,
which indicates an error. The following errno error conditions are defined for this
command:
EBADF The filedes argument is invalid.
EINVAL Either the lockp argument doesn’t specify valid lock information, the
operating system kernel doesn’t support open file description locks, or
the file associated with filedes doesn’t support locks.
int F_OFD_SETLK [Macro]
This macro is used as the command argument to fcntl, to specify that it should set
or clear a lock. This command requires a third argument of type struct flock * to
be passed to fcntl, so that the form of the call is:
fcntl (filedes, F_OFD_SETLK, lockp)
If the open file already has a lock on any part of the region, the old lock on that part
is replaced with the new lock. You can remove a lock by specifying a lock type of
F_UNLCK.
Chapter 13: Low-Level Input/Output 406
If the lock cannot be set, fcntl returns immediately with a value of −1. This com-
mand does not wait for other tasks to release locks. If fcntl succeeds, it returns
0.
The following errno error conditions are defined for this command:
EAGAIN The lock cannot be set because it is blocked by an existing lock on the
file.
EBADF Either: the filedes argument is invalid; you requested a read lock but the
filedes is not open for read access; or, you requested a write lock but the
filedes is not open for write access.
EINVAL Either the lockp argument doesn’t specify valid lock information, the
operating system kernel doesn’t support open file description locks, or
the file associated with filedes doesn’t support locks.
ENOLCK The system has run out of file lock resources; there are already too many
file locks in place.
Well-designed file systems never report this error, because they have no
limitation on the number of locks. However, you must still take account
of the possibility of this error, as it could result from network access to a
file system on another machine.
EINTR The function was interrupted by a signal while it was waiting. See Sec-
tion 25.5 [Primitives Interrupted by Signals], page 793.
Open file description locks are useful in the same sorts of situations as process-associated
locks. They can also be used to synchronize file access between threads within the same
process by having each thread perform its own open of the file, to obtain its own open file
description.
Because open file description locks are automatically freed only upon closing the last
file descriptor that refers to the open file description, this locking mechanism avoids the
possibility that locks are inadvertently released due to a library routine opening and closing
a file without the application being aware.
As with process-associated locks, open file description locks are advisory.
Chapter 13: Low-Level Input/Output 407
#define _GNU_SOURCE
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <fcntl.h>
#include <pthread.h>
void *
thread_start (void *arg)
{
int i, fd, len;
long tid = (long) arg;
char buf[256];
struct flock lck = {
.l_whence = SEEK_SET,
.l_start = 0,
.l_len = 1,
};
lck.l_type = F_UNLCK;
fcntl (fd, F_OFD_SETLK, &lck);
int
main (int argc, char **argv)
{
Chapter 13: Low-Level Input/Output 408
long i;
pthread_t threads[NUM_THREADS];
pthread_exit (NULL);
return 0;
}
This example creates three threads each of which loops five times, appending to the file.
Access to the file is serialized via open file description locks. If we compile and run the
above program, we’ll end up with /tmp/foo that has 15 lines in it.
If we, however, were to replace the F_OFD_SETLK and F_OFD_SETLKW commands with
their process-associated lock equivalents, the locking essentially becomes a noop since it is
all done within the context of the same process. That leads to data corruption (typically
manifested as missing lines) as some threads race in and overwrite the data written by
others.
The pid argument should be a process ID. You can also pass a negative number whose
absolute value is a process group ID.
The return value from fcntl with this command is −1 in case of error and some
other value if successful. The following errno error conditions are defined for this
command:
Although some such objects such as sockets and terminals1 have special functions of
their own, it would not be practical to create functions for all these cases.
Instead these minor operations, known as IOCTLs, are assigned code numbers and multi-
plexed through the ioctl function, defined in sys/ioctl.h. The code numbers themselves
are defined in many different headers.
On some systems, IOCTLs used by different devices share the same numbers. Thus,
although use of an inappropriate IOCTL usually only produces an error, you should not
attempt to use device-specific IOCTLs on an unknown device.
Most IOCTLs are OS-specific and/or only used in special system utilities, and are thus
beyond the scope of this document. For an example of the use of an IOCTL, see Sec-
tion 16.9.8 [Out-of-Band Data], page 500.
1
Actually, the terminal-specific functions are implemented with IOCTLs on many platforms.
Chapter 13: Low-Level Input/Output 410
You could implement the behavior of GNU’s getcwd (NULL, 0) using only the standard
behavior of getcwd:
char *
Chapter 14: File System Interface 412
gnu_getcwd ()
{
size_t size = 100;
while (1)
{
char *buffer = (char *) xmalloc (size);
if (getcwd (buffer, size) == buffer)
return buffer;
free (buffer);
if (errno != ERANGE)
return 0;
size *= 2;
}
}
See Section 3.2.3.2 [Examples of malloc], page 48, for information about xmalloc, which
is not a library function but is a customary name used in most GNU software.
File attributes such as size, modification times etc., are part of the file itself, not of
any particular directory entry. See Section 14.9 [File Attributes], page 434.
file descriptor. This file descriptor is then used in subsequent uses of the returned
directory stream object.
The caller must make sure the file descriptor is associated with a directory and it
allows reading.
If the fdopendir call returns successfully the file descriptor is now under the control
of the system. It can be used in the same way the descriptor implicitly created by
opendir can be used but the program must not close the descriptor.
In case the function is unsuccessful it returns a null pointer and the file descriptor
remains to be usable by the program. The following errno error conditions are defined
for this function:
EBADF The file descriptor is not valid.
ENOTDIR The file descriptor is not associated with a directory.
EINVAL The descriptor does not allow reading the directory content.
ENOMEM Not enough memory available.
In some situations it can be desirable to get hold of the file descriptor which is created
by the opendir call. For instance, to switch the current working directory to the directory
just read the fchdir function could be used. Historically the DIR type was exposed and
programs could access the fields. This does not happen in the GNU C Library. Instead a
separate function is provided to allow access.
If there are no more entries in the directory or an error is detected, readdir returns
a null pointer. The following errno error conditions are defined for this function:
EBADF The dirstream argument is not valid.
To distinguish between an end-of-directory condition or an error, you must set errno
to zero before calling readdir. To avoid entering an infinite loop, you should stop
reading from the directory after the first error.
Caution: The pointer returned by readdir points to a buffer within the DIR object.
The data in that buffer will be overwritten by the next call to readdir. You must
take care, for instance, to copy the d_name string if you need it later.
Because of this, it is not safe to share a DIR object among multiple threads, unless you
use your own locking to ensure that no thread calls readdir while another thread
is still using the data from the previous call. In the GNU C Library, it is safe to
call readdir from multiple threads as long as each thread uses its own DIR object.
POSIX.1-2008 does not require this to be safe, but we are not aware of any operating
systems where it does not work.
readdir_r allows you to provide your own buffer for the struct dirent, but it is
less portable than readdir, and has problems with very long filenames (see below).
We recommend you use readdir, but do not share DIR objects.
int readdir_r (DIR *dirstream, struct dirent *entry, [Function]
struct dirent **result)
Preliminary: | MT-Safe | AS-Unsafe lock | AC-Unsafe lock | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This function is a version of readdir which performs internal locking. Like readdir it
returns the next entry from the directory. To prevent conflicts between simultaneously
running threads the result is stored inside the entry object.
Portability Note: readdir_r is deprecated. It is recommended to use readdir instead
of readdir_r for the following reasons:
• On systems which do not define NAME_MAX, it may not be possible to use readdir_
r safely because the caller does not specify the length of the buffer for the direc-
tory entry.
• On some systems, readdir_r cannot read directory entries with very long names.
If such a name is encountered, the GNU C Library implementation of readdir_r
returns with an error code of ENAMETOOLONG after the final directory entry has
been read. On other systems, readdir_r may return successfully, but the d_name
member may not be NUL-terminated or may be truncated.
• POSIX-1.2008 does not guarantee that readdir is thread-safe, even when access
to the same dirstream is serialized. But in current implementations (including the
GNU C Library), it is safe to call readdir concurrently on different dirstreams,
so there is no need to use readdir_r in most multi-threaded programs. In the
rare case that multiple threads need to read from the same dirstream, it is still
better to use readdir and external synchronization.
• It is expected that future versions of POSIX will obsolete readdir_r and mandate
the level of thread safety for readdir which is provided by the GNU C Library
and other implementations today.
Chapter 14: File System Interface 418
Normally readdir_r returns zero and sets *result to entry. If there are no more
entries in the directory or an error is detected, readdir_r sets *result to a null
pointer and returns a nonzero error code, also stored in errno, as described for
readdir.
It is also important to look at the definition of the struct dirent type. Simply
passing a pointer to an object of this type for the second parameter of readdir_r
might not be enough. Some systems don’t define the d_name element sufficiently long.
In this case the user has to provide additional space. There must be room for at least
NAME_MAX + 1 characters in the d_name array. Code to call readdir_r could look like
this:
union
{
struct dirent d;
char b[offsetof (struct dirent, d_name) + NAME_MAX + 1];
} u;
To support large filesystems on 32-bit machines there are LFS variants of the last two
functions.
#include <stdio.h>
#include <sys/types.h>
#include <dirent.h>
int
main (void)
{
DIR *dp;
struct dirent *ep;
dp = opendir ("./");
if (dp != NULL)
{
while (ep = readdir (dp))
puts (ep->d_name);
(void) closedir (dp);
}
else
perror ("Couldn't open the directory");
return 0;
}
The order in which files appear in a directory tends to be fairly random. A more useful
program would sort the entries (perhaps by alphabetizing them) before printing them; see
Section 14.2.6 [Scanning the Content of a Directory], page 420, and Section 9.3 [Array Sort
Function], page 232.
The seekdir function sets the file position of the directory stream dirstream to pos.
The value pos must be the result of a previous call to telldir on this particular
stream; closing and reopening the directory can invalidate values returned by telldir.
As described above, the fourth argument to the scandir function must be a pointer to
a sorting function. For the convenience of the programmer the GNU C Library contains
implementations of functions which are very helpful for this purpose.
The versionsort function is like alphasort except that it uses the strverscmp
function internally.
If the filesystem supports large files we cannot use the scandir anymore since the dirent
structure might not able to contain all the information. The LFS provides the new type
struct dirent64. To use this we need a new function.
As cmp is now a function of a different type, the functions alphasort and versionsort
cannot be supplied for that argument. Instead we provide the two replacement functions
below.
It is important not to mix the use of scandir and the 64-bit comparison functions or
vice versa. There are systems on which this works but on others it will fail miserably.
functions which work directly with the directory contents. After the call the returned
entries are available for direct use.
#include <stdio.h>
#include <dirent.h>
static int
one (const struct dirent *unused)
{
return 1;
}
int
main (void)
{
struct dirent **eps;
int n;
return 0;
}
Note the simple selector function in this example. Since we want to see all directory
entries we always return 1.
NAME_MAX bytes (e.g., because they support up to 255 Unicode characters), so a buffer
size of at least 1024 is recommended.
This function is specific to Linux.
For the LFS interface and for use in the function ftw64, the header ftw.h defines another
function type.
This type is used just like __ftw_func_t for the callback function, but this time is
called from ftw64. The second parameter to the function is a pointer to a variable of
type struct stat64 which is able to represent the larger values.
For the LFS interface there is also a variant of this data type available which has to be
used with the nftw64 function.
The function follows symbolic links if necessary but does not process an item twice.
If filename is not a directory then it itself is the only object returned to the callback
function.
The file name passed to the callback function is constructed by taking the filename
parameter and appending the names of all passed directories and then the local file
name. So the callback function can use this parameter to access the file. ftw also
calls stat for the file and passes that information on to the callback function. If this
stat call is not successful the failure is indicated by setting the third argument of the
callback function to FTW_NS. Otherwise it is set according to the description given in
the account of __ftw_func_t above.
The callback function is expected to return 0 to indicate that no error occurred and
that processing should continue. If an error occurred in the callback function or
it wants ftw to return immediately, the callback function can return a value other
than 0. This is the only correct way to stop the function. The program must not
use setjmp or similar techniques to continue from another place. This would leave
resources allocated by the ftw function unfreed.
The descriptors parameter to ftw specifies how many file descriptors it is allowed to
consume. The function runs faster the more descriptors it can use. For each level in
the directory hierarchy at most one descriptor is used, but for very deep ones any limit
on open file descriptors for the process or the system may be exceeded. Moreover,
file descriptor limits in a multi-threaded program apply to all the threads as a group,
and therefore it is a good idea to supply a reasonable limit to the number of open
descriptors.
The return value of the ftw function is 0 if all callback function calls returned 0 and
all actions performed by the ftw succeeded. If a function call failed (other than calling
stat on an item) the function returns −1. If a callback function returns a value other
than 0 this value is returned as the return value of ftw.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32-bit system
this function is in fact ftw64, i.e., the LFS interface transparently replaces the old
interface.
The nftw function works like the ftw functions. They call the callback function func
for all items found in the directory filename and below. At most descriptors file
descriptors are consumed during the nftw call.
One difference is that the callback function is of a different type. It is of type
struct FTW * and provides the callback function with the extra information described
above.
A second difference is that nftw takes a fourth argument, which is 0 or a bitwise-OR
combination of any of the following values.
FTW_PHYS While traversing the directory symbolic links are not followed. Instead
symbolic links are reported using the FTW_SL value for the type parameter
to the callback function. If the file referenced by a symbolic link does not
exist FTW_SLN is returned instead.
FTW_MOUNT
The callback function is only called for items which are on the same
mounted filesystem as the directory given by the filename parameter to
nftw.
FTW_CHDIR
If this flag is given the current working directory is changed to the direc-
tory of the reported object before the callback function is called. When
ntfw finally returns the current directory is restored to its original value.
FTW_DEPTH
If this option is specified then all subdirectories and files within them
are processed before processing the top directory itself (depth-first pro-
cessing). This also means the type flag given to the callback function is
FTW_DP and not FTW_D.
FTW_ACTIONRETVAL
If this option is specified then return values from callbacks are handled
differently. If the callback returns FTW_CONTINUE, walking continues nor-
mally. FTW_STOP means walking stops and FTW_STOP is returned to the
caller. If FTW_SKIP_SUBTREE is returned by the callback with FTW_D ar-
gument, the subtree is skipped and walking continues with next sibling
of the directory. If FTW_SKIP_SIBLINGS is returned by the callback, all
siblings of the current entry are skipped and walking continues in its par-
ent. No other return values should be returned from the callbacks if this
option is set. This option is a GNU extension.
The return value is computed in the same way as for ftw. nftw returns 0 if no
failures occurred and all callback functions returned 0. In case of internal errors,
such as memory problems, the return value is −1 and errno is set accordingly. If the
return value of a callback invocation was non-zero then that value is returned.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32-bit system
this function is in fact nftw64, i.e., the LFS interface transparently replaces the old
interface.
Chapter 14: File System Interface 427
ENOSPC The directory or file system that would contain the new link is full and
cannot be extended.
EPERM On GNU/Linux and GNU/Hurd systems and some others, you cannot
make links to directories. Many systems allow only privileged users to do
so. This error is used to report the problem.
EROFS The directory containing the new link can’t be modified because it’s on
a read-only file system.
EXDEV The directory specified in newname is on a different file system than the
existing file.
EIO A hardware error occurred while trying to read or write the to filesystem.
int linkat (int oldfd, const char *oldname, int newfd, [Function]
const char *newname, int flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The linkat function is analogous to the link function, except that it identifies its
source and target using a combination of a file descriptor (referring to a directory) and
a pathname. If a pathnames is not absolute, it is resolved relative to the corresponding
file descriptor. The special file descriptor AT_FDCWD denotes the current directory.
The flags argument is a combination of the following flags:
AT_SYMLINK_FOLLOW
If the source path identified by oldfd and oldname is a symbolic link,
linkat follows the symbolic link and creates a link to its target. If the
flag is not set, a link for the symbolic link itself is created; this is not
supported by all file systems and linkat can fail in this case.
AT_EMPTY_PATH
If this flag is specified, oldname can be an empty string. In this case,
a new link to the file denoted by the descriptor oldfd is created, which
may have been opened with O_PATH or O_TMPFILE. This flag is a GNU
extension.
By contrast, other operations such as deleting or renaming the file operate on the link
itself. The functions readlink and lstat also refrain from following symbolic links, because
their purpose is to obtain information about the link. link, the function that makes a hard
link, does too. It makes a hard link to the symbolic link, which one rarely wants.
Some systems have, for some functions operating on files, a limit on how many symbolic
links are followed when resolving a path name. The limit if it exists is published in the
sys/param.h header file.
Prototypes for most of the functions listed in this section are in unistd.h.
while (1)
{
buffer = xreallocarray (buffer, size, 2);
size *= 2;
ssize_t nchars = readlink (filename, buffer, size);
if (nchars < 0)
{
free (buffer);
return NULL;
}
if (nchars < size)
return buffer;
}
}
A value of -1 is returned in case of error. In addition to the usual file name errors (see
Section 11.2.3 [File Name Errors], page 268), the following errno error conditions are
defined for this function:
EINVAL The named file is not a symbolic link.
EIO A hardware error occurred while reading or writing data on the disk.
In some situations it is desirable to resolve all the symbolic links to get the real name of
a file where no prefix names a symbolic link which is followed and no filename in the path
is . or ... This is for instance desirable if files have to be compared in which case different
names can refer to the same inode.
char * canonicalize_file_name (const char *name) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem fd | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
The canonicalize_file_name function returns the absolute name of the file named
by name which contains no ., .. components nor any repeated path separators (/) or
symlinks. The result is passed back as the return value of the function in a block of
memory allocated with malloc. If the result is not used anymore the memory should
be freed with a call to free.
If any of the path components are missing the function returns a NULL pointer.
This is also what is returned if the length of the path reaches or exceeds PATH_MAX
characters. In any case errno is set accordingly.
ENAMETOOLONG
The resulting path is too long. This error only occurs on systems which
have a limit on the file name length.
EACCES At least one of the path components is not readable.
ENOENT The input file name is empty.
ENOENT At least one of the path components does not exist.
ELOOP More than MAXSYMLINKS many symlinks have been followed.
This function is a GNU extension and is declared in stdlib.h.
The Unix standard includes a similar function which differs from canonicalize_file_
name in that the user has to provide the buffer where the result is placed in.
Chapter 14: File System Interface 431
The advantage of using this function is that it is more widely available. The drawback
is that it reports failures for long paths on systems which have no limits on the file name
length.
EPERM On some systems unlink cannot be used to delete the name of a directory,
or at least can only be used this way by a privileged user. To avoid
such problems, use rmdir to delete directories. (On GNU/Linux and
GNU/Hurd systems unlink can never delete the name of a directory.)
EROFS The directory containing the file name to be deleted is on a read-only file
system and can’t be modified.
If oldname is a directory, then either newname must not exist or it must name a
directory that is empty. In the latter case, the existing directory named newname is
deleted first. The name newname must not specify a subdirectory of the directory
oldname which is being renamed.
One useful feature of rename is that the meaning of newname changes “atomically”
from any previously existing file by that name to its new meaning (i.e., the file that
was called oldname). There is no instant at which newname is non-existent “in
between” the old meaning and the new meaning. If there is a system crash during
the operation, it is possible for both names to still exist; but newname will always be
intact if it exists at all.
If rename fails, it returns -1. In addition to the usual file name errors (see Sec-
tion 11.2.3 [File Name Errors], page 268), the following errno error conditions are
defined for this function:
EACCES One of the directories containing newname or oldname refuses write per-
mission; or newname and oldname are directories and write permission
is refused for one of them.
EBUSY A directory named by oldname or newname is being used by the system in
a way that prevents the renaming from working. This includes directories
that are mount points for filesystems, and directories that are the current
working directories of processes.
ENOTEMPTY
EEXIST The directory newname isn’t empty. GNU/Linux and GNU/Hurd sys-
tems always return ENOTEMPTY for this, but some other systems return
EEXIST.
EINVAL oldname is a directory that contains newname.
EISDIR newname is a directory but the oldname isn’t.
EMLINK The parent directory of newname would have too many links (entries).
ENOENT The file oldname doesn’t exist.
ENOSPC The directory that would contain newname has no room for another entry,
and there is no space left in the file system to expand it.
EROFS The operation would involve writing to a directory on a read-only file
system.
EXDEV The two file names newname and oldname are on different file systems.
The argument mode specifies the file permissions for the new directory file. See
Section 14.9.5 [The Mode Bits for Access Permission], page 443, for more information
about this.
A return value of 0 indicates successful completion, and -1 indicates failure. In
addition to the usual file name syntax errors (see Section 11.2.3 [File Name Errors],
page 268), the following errno error conditions are defined for this function:
EACCES Write permission is denied for the parent directory in which the new
directory is to be added.
EEXIST A file named filename already exists.
EMLINK The parent directory has too many links (entries).
Well-designed file systems never report this error, because they permit
more links than your disk could possibly hold. However, you must still
take account of the possibility of this error, as it could result from network
access to a file system on another machine.
ENOSPC The file system doesn’t have enough room to create the new directory.
EROFS The parent directory of the directory being created is on a read-only file
system and cannot be modified.
To use this function, your program should include the header file sys/stat.h.
ino_t st_ino
The file serial number, which distinguishes this file from all other files on
the same device.
dev_t st_dev
Identifies the device containing the file. The st_ino and st_dev, taken
together, uniquely identify the file. The st_dev value is not necessarily
consistent across reboots or system crashes, however.
nlink_t st_nlink
The number of hard links to the file. This count keeps track of how many
directories have entries for this file. If the count is ever decremented to
zero, then the file itself is discarded as soon as no process still holds it
open. Symbolic links are not counted in the total.
uid_t st_uid
The user ID of the file’s owner. See Section 14.9.4 [File Owner], page 442.
gid_t st_gid
The group ID of the file. See Section 14.9.4 [File Owner], page 442.
off_t st_size
This specifies the size of a regular file in bytes. For files that are really
devices this field isn’t usually meaningful. For symbolic links this specifies
the length of the file name the link refers to.
time_t st_atime
This is the last access time for the file. See Section 14.9.9 [File Times],
page 448.
unsigned long int st_atime_usec
This is the fractional part of the last access time for the file. See Sec-
tion 14.9.9 [File Times], page 448.
time_t st_mtime
This is the time of the last modification to the contents of the file. See
Section 14.9.9 [File Times], page 448.
unsigned long int st_mtime_usec
This is the fractional part of the time of the last modification to the
contents of the file. See Section 14.9.9 [File Times], page 448.
time_t st_ctime
This is the time of the last modification to the attributes of the file. See
Section 14.9.9 [File Times], page 448.
unsigned long int st_ctime_usec
This is the fractional part of the time of the last modification to the
attributes of the file. See Section 14.9.9 [File Times], page 448.
blkcnt_t st_blocks
This is the amount of disk space that the file occupies, measured in units
of 512-byte blocks.
Chapter 14: File System Interface 436
The number of disk blocks is not strictly proportional to the size of the
file, for two reasons: the file system may use some blocks for internal
record keeping; and the file may be sparse—it may have “holes” which
contain zeros but do not actually take up space on the disk.
You can tell (approximately) whether a file is sparse by comparing this
value with st_size, like this:
(st.st_blocks * 512 < st.st_size)
This test is not perfect because a file that is just slightly sparse might
not be detected as sparse at all. For practical applications, this is not a
problem.
unsigned int st_blksize
The optimal block size for reading or writing this file, in bytes. You might
use this size for allocating the buffer space for reading or writing the file.
(This is unrelated to st_blocks.)
The extensions for the Large File Support (LFS) require, even on 32-bit machines, types
which can handle file sizes up to 263 . Therefore a new definition of struct stat is necessary.
off64_t st_size
This specifies the size of a regular file in bytes. For files that are really
devices this field isn’t usually meaningful. For symbolic links this specifies
the length of the file name the link refers to.
time_t st_atime
This is the last access time for the file. See Section 14.9.9 [File Times],
page 448.
unsigned long int st_atime_usec
This is the fractional part of the last access time for the file. See Sec-
tion 14.9.9 [File Times], page 448.
time_t st_mtime
This is the time of the last modification to the contents of the file. See
Section 14.9.9 [File Times], page 448.
unsigned long int st_mtime_usec
This is the fractional part of the time of the last modification to the
contents of the file. See Section 14.9.9 [File Times], page 448.
time_t st_ctime
This is the time of the last modification to the attributes of the file. See
Section 14.9.9 [File Times], page 448.
unsigned long int st_ctime_usec
This is the fractional part of the time of the last modification to the
attributes of the file. See Section 14.9.9 [File Times], page 448.
blkcnt64_t st_blocks
This is the amount of disk space that the file occupies, measured in units
of 512-byte blocks.
unsigned int st_blksize
The optimal block size for reading of writing this file, in bytes. You might
use this size for allocating the buffer space for reading of writing the file.
(This is unrelated to st_blocks.)
Some of the file attributes have special data type names which exist specifically for those
attributes. (They are all aliases for well-known integer types that you know and love.) These
typedef names are defined in the header file sys/types.h as well as in sys/stat.h. Here
is a list of them.
mode_t [Data Type]
This is an integer data type used to represent file modes. In the GNU C Library, this
is an unsigned type no narrower than unsigned int.
ino_t [Data Type]
This is an unsigned integer type used to represent file serial numbers. (In Unix jargon,
these are sometimes called inode numbers.) In the GNU C Library, this type is no
narrower than unsigned int.
If the source is compiled with _FILE_OFFSET_BITS == 64 this type is transparently
replaced by ino64_t.
Chapter 14: File System Interface 438
This function is similar to lstat but it is also able to work on files larger than 231
bytes on 32-bit systems. To be able to do this the result is stored in a variable of
type struct stat64 to which buf must point.
When the sources are compiled with _FILE_OFFSET_BITS == 64 this function is avail-
able under the name lstat and so transparently replaces the interface for small files
on 32-bit machines.
An alternate non-POSIX method of testing the file type is supported for compatibility
with BSD. The mode can be bitwise AND-ed with S_IFMT to extract the file type code, and
compared to the appropriate constant. For example,
S_ISCHR (mode)
is equivalent to:
((mode & S_IFMT) == S_IFCHR)
These are the symbolic names for the different file type codes:
S_IFDIR This is the file type constant of a directory file.
S_IFCHR This is the file type constant of a character-oriented device file.
S_IFBLK This is the file type constant of a block-oriented device file.
S_IFREG This is the file type constant of a regular file.
S_IFLNK This is the file type constant of a symbolic link.
S_IFSOCK This is the file type constant of a socket.
S_IFIFO This is the file type constant of a FIFO or pipe.
The POSIX.1b standard introduced a few more objects which possibly can be imple-
mented as objects in the filesystem. These are message queues, semaphores, and shared
memory objects. To allow differentiating these objects from other files the POSIX standard
introduced three new test macros. But unlike the other macros they do not take the value
of the st_mode field as the parameter. Instead they expect a pointer to the whole struct
stat structure.
usage the sticky bit also implies that the filesystem may fail to record the file’s
modification time onto disk reliably (the idea being that no-one cares for a swap
file).
This bit is only available on BSD systems (and those derived from them).
Therefore one has to use the _GNU_SOURCE feature select macro, or not define
any feature test macros, to get the definition (see Section 1.3.4 [Feature Test
Macros], page 16).
The actual bit values of the symbols are listed in the table above so you can decode file
mode values when debugging your programs. These bit values are correct for most systems,
but they are not guaranteed.
Warning: Writing explicit numbers for file permissions is bad practice. Not only is it
not portable, it also requires everyone who reads your program to remember what the bits
mean. To make your program clean use the symbolic names.
In normal use, the file creation mask is initialized by the user’s login shell (using the
umask shell command), and inherited by all subprocesses. Application programs normally
don’t need to worry about the file creation mask. It will automatically do what it is supposed
to do.
When your program needs to create a file and bypass the umask for its access permissions,
the easiest way to do this is to use fchmod after opening the file, rather than changing the
umask. In fact, changing the umask is usually done only by shells. They use the umask
function.
The functions in this section are declared in sys/stat.h.
mode_t umask (mode_t mask) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The umask function sets the file creation mask of the current process to mask, and
returns the previous value of the file creation mask.
Here is an example showing how to read the mask with umask without changing it
permanently:
mode_t
read_umask (void)
{
mode_t mask = umask (0);
umask (mask);
return mask;
}
However, on GNU/Hurd systems it is better to use getumask if you just want to read
the mask value, because it is reentrant.
mode_t getumask (void) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Return the current value of the file creation mask for the current process. This
function is a GNU extension and is only available on GNU/Hurd systems.
int chmod (const char *filename, mode_t mode) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The chmod function sets the access permission bits for the file named by filename to
mode.
If filename is a symbolic link, chmod changes the permissions of the file pointed to by
the link, not those of the link itself.
This function returns 0 if successful and -1 if not. In addition to the usual file name
errors (see Section 11.2.3 [File Name Errors], page 268), the following errno error
conditions are defined for this function:
ENOENT The named file doesn’t exist.
EPERM This process does not have permission to change the access permissions
of this file. Only the file’s owner (as judged by the effective user ID of
the process) or a privileged user can change them.
Chapter 14: File System Interface 447
try to keep track of the diverse features that different systems have. Using access is simple
and automatically does whatever is appropriate for the system you are using.
access is only appropriate to use in setuid programs. A non-setuid program will always
use the effective ID rather than the real ID.
The symbols in this section are declared in unistd.h.
int access (const char *filename, int how) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The access function checks to see whether the file named by filename can be accessed
in the way specified by the how argument. The how argument either can be the
bitwise OR of the flags R_OK, W_OK, X_OK, or the existence test F_OK.
This function uses the real user and group IDs of the calling process, rather than the
effective IDs, to check for access permission. As a result, if you use the function from
a setuid or setgid program (see Section 31.4 [How an Application Can Change
Persona], page 899), it gives information relative to the user who actually ran the
program.
The return value is 0 if the access is permitted, and -1 otherwise. (In other words,
treated as a predicate function, access returns true if the requested access is denied.)
In addition to the usual file name errors (see Section 11.2.3 [File Name Errors],
page 268), the following errno error conditions are defined for this function:
EACCES The access specified by how is denied.
ENOENT The file doesn’t exist.
EROFS Write permission was requested for a file on a read-only file system.
These macros are defined in the header file unistd.h for use as the how argument to
the access function. The values are integer constants.
int R_OK [Macro]
Flag meaning test for read permission.
int W_OK [Macro]
Flag meaning test for write permission.
int X_OK [Macro]
Flag meaning test for execute/search permission.
int F_OK [Macro]
Flag meaning test for existence of the file.
Reading from a file updates its access time attribute, and writing updates its modification
time. When a file is created, all three time stamps for that file are set to the current time.
In addition, the attribute change time and modification time fields of the directory that
contains the new entry are updated.
Adding a new name for a file with the link function updates the attribute change time
field of the file being linked, and both the attribute change time and modification time
fields of the directory containing the new name. These same fields are affected if a file name
is deleted with unlink, remove or rmdir. Renaming a file with rename affects only the
attribute change time and modification time fields of the two parent directories involved,
and not the times for the file being renamed.
Changing the attributes of a file (for example, with chmod) updates its attribute change
time field.
You can also change some of the time stamps of a file explicitly using the utime
function—all except the attribute change time. You need to include the header file utime.h
to use this facility.
struct utimbuf [Data Type]
The utimbuf structure is used with the utime function to specify new access and
modification times for a file. It contains the following members:
time_t actime
This is the access time for the file.
time_t modtime
This is the modification time for the file.
int utime (const char *filename, const struct utimbuf [Function]
*times)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is used to modify the file times associated with the file named filename.
If times is a null pointer, then the access and modification times of the file are set to
the current time. Otherwise, they are set to the values from the actime and modtime
members (respectively) of the utimbuf structure pointed to by times.
The attribute modification time for the file is set to the current time in either case
(since changing the time stamps is itself a modification of the file attributes).
The utime function returns 0 if successful and -1 on failure. In addition to the usual
file name errors (see Section 11.2.3 [File Name Errors], page 268), the following errno
error conditions are defined for this function:
EACCES There is a permission problem in the case where a null pointer was passed
as the times argument. In order to update the time stamp on the file,
you must either be the owner of the file, have write permission for the
file, or be a privileged user.
ENOENT The file doesn’t exist.
EPERM If the times argument is not a null pointer, you must either be the owner
of the file or be a privileged user.
Chapter 14: File System Interface 450
EPERM If the times argument is not a null pointer, you must either be the owner
of the file or be a privileged user.
EROFS The file lives on a read-only file system.
This function is similar to the truncate function. The difference is that the length
argument is 64 bits wide even on 32 bits machines, which allows the handling of files
with sizes up to 263 bytes.
When the source file is compiled with _FILE_OFFSET_BITS == 64 on a 32 bits machine
this function is actually available under the name truncate and so transparently
replaces the 32 bits interface.
int
add (off_t at, void *block, size_t size)
{
if (at + size > len)
{
/* Resize the file and remap. */
size_t ps = sysconf (_SC_PAGESIZE);
size_t ns = (at + size + ps - 1) & ~(ps - 1);
void *np;
if (ftruncate (fd, ns) < 0)
return -1;
np = mmap (NULL, ns, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0);
if (np == MAP_FAILED)
return -1;
start = np;
len = ns;
}
memcpy ((char *) start + at, block, size);
return 0;
}
The function add writes a block of memory at an arbitrary position in the file. If the
current size of the file is too small it is extended. Note that it is extended by a whole
number of pages. This is a requirement of mmap. The program has to keep track of the real
size, and when it has finished a final ftruncate call should set the real size of the file.
The mknod function makes a special file with name filename. The mode specifies the
mode of the file, and may include the various special file bits, such as S_IFCHR (for a
character special file) or S_IFBLK (for a block special file). See Section 14.9.3 [Testing
the Type of a File], page 440.
The dev argument specifies which device the special file refers to. Its exact interpre-
tation depends on the kind of special file being created.
The return value is 0 on success and -1 on error. In addition to the usual file name
errors (see Section 11.2.3 [File Name Errors], page 268), the following errno error
conditions are defined for this function:
EPERM The calling process is not privileged. Only the superuser can create spe-
cial files.
ENOSPC The directory or file system that would contain the new file is full and
cannot be extended.
EROFS The directory containing the new file can’t be modified because it’s on a
read-only file system.
EEXIST There is already a file named filename. If you want to replace this file,
you must remove the old file explicitly first.
This function is similar to tmpfile, but the stream it returns a pointer to was opened
using tmpfile64. Therefore this stream can be used for files larger than 231 bytes on
32-bit machines.
Please note that the return type is still FILE *. There is no special FILE type for the
LFS interface.
If the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32 bits machine this
function is available under the name tmpfile and so transparently replaces the old
interface.
ran out of names. Some other systems have a fixed, small limit on the number of
temporary files. The limit is never less than 25.
Older Unix systems did not have the functions just described. Instead they used mktemp
and mkstemp. Both of these functions work by modifying a file name template string you
pass. The last six characters of this string must be ‘XXXXXX’. These six ‘X’s are replaced
with six characters which make the whole string a unique file name. Usually the template
string is something like ‘/tmp/prefixXXXXXX’, and each program uses a unique prefix.
NB: Because mktemp and mkstemp modify the template string, you must not pass string
constants to them. String constants are normally in read-only storage, so your program
would crash when mktemp or mkstemp tried to modify the string. These functions are
declared in the header file stdlib.h.
Warning: Between the time the pathname is constructed and the file is created an-
other process might have created a file with the same name using mktemp, leading to
a possible security hole. The implementation generates names which can hardly be
predicted, but when opening the file you should use the O_EXCL flag. Using mkstemp
is a safe way to avoid this problem.
Unlike mktemp, mkstemp is actually guaranteed to create a unique file that cannot possi-
bly clash with any other program trying to create a temporary file. This is because it works
by calling open with the O_EXCL flag, which says you want to create a new file and get an
error if the file already exists.
The directory created by mkdtemp cannot clash with temporary files or directories created
by other users. This is because directory creation always works like open with O_EXCL. See
Section 14.8 [Creating Directories], page 433.
The mkdtemp function comes from OpenBSD.
459
Here is an example of a simple program that creates a pipe. This program uses the fork
function (see Section 27.4 [Creating a Process], page 857) to create a child process. The
parent process writes data to the pipe, which is read by the child process.
Chapter 15: Pipes and FIFOs 460
#include <sys/types.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
void
read_from_pipe (int file)
{
FILE *stream;
int c;
stream = fdopen (file, "r");
while ((c = fgetc (stream)) != EOF)
putchar (c);
fclose (stream);
}
void
write_to_pipe (int file)
{
FILE *stream;
stream = fdopen (file, "w");
fprintf (stream, "hello, world!\n");
fprintf (stream, "goodbye, world!\n");
fclose (stream);
}
int
main (void)
{
pid_t pid;
int mypipe[2];
}
else
{
/* This is the parent process.
Close other end first. */
close (mypipe[0]);
write_to_pipe (mypipe[1]);
return EXIT_SUCCESS;
}
}
Here is an example showing how to use popen and pclose to filter output through
another program, in this case the paging program more.
#include <stdio.h>
#include <stdlib.h>
Chapter 15: Pipes and FIFOs 462
void
write_data (FILE * stream)
{
int i;
for (i = 0; i < 100; i++)
fprintf (stream, "%d\n", i);
if (ferror (stream))
{
fprintf (stderr, "Output to stream failed.\n");
exit (EXIT_FAILURE);
}
}
int
main (void)
{
FILE *output;
The normal, successful return value from mkfifo is 0. In the case of an error, -1
is returned. In addition to the usual file name errors (see Section 11.2.3 [File Name
Errors], page 268), the following errno error conditions are defined for this function:
EEXIST The named file already exists.
ENOSPC The directory or file system cannot be extended.
EROFS The directory that would contain the file resides on a read-only file system.
16 Sockets
This chapter describes the GNU facilities for interprocess communication using sockets.
A socket is a generalized interprocess communication channel. Like a pipe, a socket
is represented as a file descriptor. Unlike pipes sockets support communication between
unrelated processes, and even between processes running on different machines that com-
municate over a network. Sockets are the primary means of communicating with other
machines; telnet, rlogin, ftp, talk and the other familiar network programs use sockets.
Not all operating systems support sockets. In the GNU C Library, the header file
sys/socket.h exists regardless of the operating system, and the socket functions always
exist, but if the system does not really support sockets these functions always fail.
Incomplete: We do not currently document the facilities for broadcast messages or for
configuring Internet interfaces. The reentrant functions and some newer functions that are
related to IPv6 aren’t documented either so far.
The rules of a protocol apply to the data passing between two programs, perhaps on
different computers; most of these rules are handled by the operating system and you need
not know about them. What you do need to know about protocols is this:
• In order to have communication between two sockets, they must specify the same
protocol.
• Each protocol is meaningful with particular style/namespace combinations and cannot
be used with inappropriate combinations. For example, the TCP protocol fits only the
byte stream style of communication and the Internet namespace.
• For each combination of style and namespace there is a default protocol, which you can
request by specifying 0 as the protocol number. And that’s what you should normally
do—use the default.
Throughout the following description at various places variables/parameters to denote
sizes are required. And here the trouble starts. In the first implementations the type of these
variables was simply int. On most machines at that time an int was 32 bits wide, which
created a de facto standard requiring 32-bit variables. This is important since references to
variables of this type are passed to the kernel.
Then the POSIX people came and unified the interface with the words "all size values
are of type size_t". On 64-bit machines size_t is 64 bits wide, so pointers to variables
were no longer possible.
The Unix98 specification provides a solution by introducing a type socklen_t. This
type is used in all of the cases that POSIX changed to use size_t. The only requirement of
this type is that it be an unsigned type of at least 32 bits. Therefore, implementations which
require that references to 32-bit variables be passed can be as happy as implementations
which use 64-bit values.
packet after failing with the fourth and fifth packets; the seventh packet may arrive
before the sixth, and may arrive a second time after the sixth.
The typical use for SOCK_DGRAM is in situations where it is acceptable to simply re-send
a packet if no response is seen in a reasonable amount of time.
See Section 16.10 [Datagram Socket Operations], page 503, for detailed information
about how to use datagram sockets.
The one piece of information that you can get from the struct sockaddr data type is
the address format designator. This tells you which data type to use to understand the
address fully.
The symbols in this section are defined in the header file sys/socket.h.
Each address format has a symbolic name which starts with ‘AF_’. Each of them corre-
sponds to a ‘PF_’ symbol which designates the corresponding namespace. Here is a list of
address format names:
AF_LOCAL This designates the address format that goes with the local namespace. (PF_
LOCAL is the name of that namespace.) See Section 16.5.2 [Details of Local
Namespace], page 470, for information about this address format.
AF_UNIX This is a synonym for AF_LOCAL. Although AF_LOCAL is mandated by
POSIX.1g, AF_UNIX is portable to more systems. AF_UNIX was the traditional
name stemming from BSD, so even most POSIX systems support it. It is also
the name of choice in the Unix98 specification. (The same is true for PF_UNIX
vs. PF_LOCAL).
AF_FILE This is another synonym for AF_LOCAL, for compatibility. (PF_FILE is likewise
a synonym for PF_LOCAL.)
AF_INET This designates the address format that goes with the Internet namespace.
(PF_INET is the name of that namespace.) See Section 16.6.1 [Internet Socket
Address Formats], page 473.
AF_INET6 This is similar to AF_INET, but refers to the IPv6 protocol. (PF_INET6 is the
name of the corresponding namespace.)
AF_UNSPEC
This designates no particular address format. It is used only in rare cases,
such as to clear out the default destination address of a “connected” datagram
socket. See Section 16.10.1 [Sending Datagrams], page 503.
The corresponding namespace designator symbol PF_UNSPEC exists for com-
pleteness, but there is no reason to use it in a program.
sys/socket.h defines symbols starting with ‘AF_’ for many different kinds of networks,
most or all of which are not actually implemented. We will document those that really work
as we receive information about how to use them.
Chapter 16: Sockets 468
exactly how much space is needed and can provide that much. The usual practice is
to allocate a place for the value using the proper data type for the socket’s namespace,
then cast its address to struct sockaddr * to pass it to getsockname.
The return value is 0 on success and -1 on error. The following errno error conditions
are defined for this function:
EBADF The socket argument is not a valid file descriptor.
ENOTSOCK The descriptor socket is not a socket.
ENOBUFS There are not enough internal buffers available for the operation.
You can’t read the address of a socket in the file namespace. This is consistent with the
rest of the system; in general, there’s no way to find a file’s name from a descriptor for that
file.
char *if_name
This is the null-terminated index name.
The structure for specifying socket names in the local namespace is defined in the header
file sys/un.h:
You should compute the length parameter for a socket address in the local namespace as
the sum of the size of the sun_family component and the string length (not the allocation
size!) of the file name string. This can be done using the macro SUN_LEN:
#include <stddef.h>
#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/un.h>
int
make_named_socket (const char *filename)
Chapter 16: Sockets 472
{
struct sockaddr_un name;
int sock;
size_t size;
return sock;
}
• The address of the machine you want to connect to. Internet addresses can be specified
in several ways; these are discussed in Section 16.6.1 [Internet Socket Address Formats],
page 473, Section 16.6.2 [Host Addresses], page 474, and Section 16.6.2.4 [Host Names],
page 478.
• A port number for that machine. See Section 16.6.3 [Internet Ports], page 483.
You must ensure that the address and port number are represented in a canonical for-
mat called network byte order. See Section 16.6.5 [Byte Order Conversion], page 485, for
information about this.
sa_family_t sin_family
This identifies the address family or format of the socket address. You
should store the value AF_INET in this member. The address family is
stored in host byte order. See Section 16.3 [Socket Addresses], page 466.
struct in_addr sin_addr
This is the IPv4 address. See Section 16.6.2 [Host Addresses], page 474,
and Section 16.6.2.4 [Host Names], page 478, for how to get a value to
store here. The IPv4 address is stored in network byte order.
unsigned short int sin_port
This is the port number. See Section 16.6.3 [Internet Ports], page 483.
The port number is stored in network byte order.
When you call bind or getsockname, you should specify sizeof (struct sockaddr_in)
as the length parameter if you are using an IPv4 Internet namespace socket address.
sa_family_t sin6_family
This identifies the address family or format of the socket address. You
should store the value of AF_INET6 in this member. See Section 16.3
[Socket Addresses], page 466. The address family is stored in host byte
order.
Chapter 16: Sockets 474
Medium-sized Class B networks have two-byte network numbers, with the first byte in the
range 128 to 191. Class C networks are the smallest; they have three-byte network numbers,
with the first byte in the range 192-255. Thus, the first 1, 2, or 3 bytes of an Internet address
specify a network. The remaining bytes of the Internet address specify the address within
that network.
The Class A network 0 is reserved for broadcast to all networks. In addition, the host
number 0 within each network is reserved for broadcast to all hosts in that network. These
uses are obsolete now but for compatibility reasons you shouldn’t use network 0 and host
number 0.
The Class A network 127 is reserved for loopback; you can always use the Internet
address ‘127.0.0.1’ to refer to the host machine.
Since a single machine can be a member of multiple networks, it can have multiple
Internet host addresses. However, there is never supposed to be more than one machine
with the same host address.
There are four forms of the standard numbers-and-dots notation for Internet addresses:
a.b.c.d This specifies all four bytes of the address individually and is the commonly
used representation.
a.b.c The last part of the address, c, is interpreted as a 2-byte quantity. This is
useful for specifying host addresses in a Class B network with network address
number a.b.
a.b The last part of the address, b, is interpreted as a 3-byte quantity. This is
useful for specifying host addresses in a Class A network with network address
number a.
a If only one part is given, this corresponds directly to the host address number.
Within each part of the address, the usual C conventions for specifying the radix apply.
In other words, a leading ‘0x’ or ‘0X’ implies hexadecimal radix; a leading ‘0’ implies octal;
and otherwise decimal radix is assumed.
Classless Addresses
IPv4 addresses (and IPv6 addresses also) are now considered classless; the distinction be-
tween classes A, B and C can be ignored. Instead an IPv4 host address consists of a 32-bit
address and a 32-bit mask. The mask contains set bits for the network part and cleared
bits for the host part. The network part is contiguous from the left, with the remaining
bits representing the host. As a consequence, the netmask can simply be specified as the
number of set bits. Classes A, B and C are just special cases of this general rule. For
example, class A addresses have a netmask of ‘255.0.0.0’ or a prefix length of 8.
Classless IPv4 network addresses are written in numbers-and-dots notation with the
prefix length appended and a slash as separator. For example the class A network 10 is
written as ‘10.0.0.0/8’.
IPv6 Addresses
IPv6 addresses contain 128 bits (IPv4 has 32 bits) of data. A host address is usually
written as eight 16-bit hexadecimal numbers that are separated by colons. Two colons are
Chapter 16: Sockets 476
used to abbreviate strings of consecutive zeros. For example, the IPv6 loopback address
‘0:0:0:0:0:0:0:1’ can just be written as ‘::1’.
int inet_pton (int af, const char *cp, void *buf) [Function]
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
This function converts an Internet address (either IPv4 or IPv6) from presentation
(textual) to network (binary) format. af should be either AF_INET or AF_INET6, as
appropriate for the type of address being converted. cp is a pointer to the input
string, and buf is a pointer to a buffer for the result. It is the caller’s responsibility
to make sure the buffer is large enough.
const char * inet_ntop (int af, const void *cp, char *buf, [Function]
socklen_t len)
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
This function converts an Internet address (either IPv4 or IPv6) from network (bi-
nary) to presentation (textual) form. af should be either AF_INET or AF_INET6, as
appropriate. cp is a pointer to the address to be converted. buf should be a pointer
to a buffer to hold the result, and len is the length of this buffer. The return value
from the function will be this buffer address.
Internally, the system uses a database to keep track of the mapping between host names
and host numbers. This database is usually either the file /etc/hosts or an equivalent
provided by a name server. The functions and other symbols for accessing this database
are declared in netdb.h. They are BSD features, defined unconditionally if you include
netdb.h.
As far as the host database is concerned, each address is just a block of memory h_
length bytes long. But in other contexts there is an implicit assumption that you can
convert IPv4 addresses to a struct in_addr or an uint32_t. Host addresses in a struct
hostent structure are always given in network byte order; see Section 16.6.5 [Byte Order
Conversion], page 485.
You can use gethostbyname, gethostbyname2 or gethostbyaddr to search the hosts
database for information about a particular host. The information is returned in a statically-
allocated structure; you must copy the information if you need to save it across calls. You
can also use getaddrinfo and getnameinfo to obtain this information.
The gethostbyname function returns information about the host named name. If the
lookup fails, it returns a null pointer.
struct hostent * gethostbyname2 (const char *name, int af) [Function]
Preliminary: | MT-Unsafe race:hostbyname2 env locale | AS-Unsafe dlopen plugin
corrupt heap lock | AC-Unsafe lock corrupt mem fd | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
The gethostbyname2 function is like gethostbyname, but allows the caller to specify
the desired address family (e.g. AF_INET or AF_INET6) of the result.
struct hostent * gethostbyaddr (const void *addr, [Function]
socklen_t length, int format)
Preliminary: | MT-Unsafe race:hostbyaddr env locale | AS-Unsafe dlopen plugin
corrupt heap lock | AC-Unsafe lock corrupt mem fd | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
The gethostbyaddr function returns information about the host with Internet ad-
dress addr. The parameter addr is not really a pointer to char - it can be a pointer to
an IPv4 or an IPv6 address. The length argument is the size (in bytes) of the address
at addr. format specifies the address format; for an IPv4 Internet address, specify a
value of AF_INET; for an IPv6 Internet address, use AF_INET6.
If the lookup fails, gethostbyaddr returns a null pointer.
If the name lookup by gethostbyname or gethostbyaddr fails, you can find out the
reason by looking at the value of the variable h_errno. (It would be cleaner design for
these functions to set errno, but use of h_errno is compatible with other systems.)
Here are the error codes that you may find in h_errno:
HOST_NOT_FOUND
No such host is known in the database.
TRY_AGAIN
This condition happens when the name server could not be contacted. If you
try again later, you may succeed then.
NO_RECOVERY
A non-recoverable error occurred.
NO_ADDRESS
The host database contains an entry for the name, but it doesn’t have an
associated Internet address.
The lookup functions above all have one thing in common: they are not reentrant and
therefore unusable in multi-threaded applications. Therefore provides the GNU C Library
a new set of functions which can be used in this context.
int gethostbyname_r (const char *restrict name, struct [Function]
hostent *restrict result_buf, char *restrict buf, size_t
buflen, struct hostent **restrict result, int *restrict
h_errnop)
Preliminary: | MT-Safe env locale | AS-Unsafe dlopen plugin corrupt heap lock
| AC-Unsafe lock corrupt mem fd | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
Chapter 16: Sockets 481
The gethostbyname_r function returns information about the host named name.
The caller must pass a pointer to an object of type struct hostent in the result buf
parameter. In addition the function may need extra buffer space and the caller must
pass a pointer and the size of the buffer in the buf and buflen parameters.
A pointer to the buffer, in which the result is stored, is available in *result after the
function call successfully returned. The buffer passed as the buf parameter can be
freed only once the caller has finished with the result hostent struct, or has copied
it including all the other memory that it points to. If an error occurs or if no entry
is found, the pointer *result is a null pointer. Success is signalled by a zero return
value. If the function failed the return value is an error number. In addition to the
errors defined for gethostbyname it can also be ERANGE. In this case the call should
be repeated with a larger buffer. Additional error information is not stored in the
global variable h_errno but instead in the object pointed to by h errnop.
Here’s a small example:
struct hostent *
gethostname (char *host)
{
struct hostent *hostbuf, *hp;
size_t hstbuflen;
char *tmphstbuf;
int res;
int herr;
free (tmphstbuf);
/* Check for errors. */
if (res || hp == NULL)
return NULL;
return hp;
}
You can also scan the entire hosts database one entry at a time using sethostent,
gethostent and endhostent. Be careful when using these functions because they are not
reentrant.
char *s_proto
This is the name of the protocol to use with this service. See Section 16.6.6
[Protocols Database], page 486.
You can also scan the services database using setservent, getservent and endservent.
Be careful when using these functions because they are not reentrant.
You can use getprotobyname and getprotobynumber to search the protocols database
for a specific protocol. The information is returned in a statically-allocated structure; you
must copy the information if you need to save it across calls.
The getprotobyname function returns information about the network protocol named
name. If there is no such protocol, it returns a null pointer.
You can also scan the whole protocols database one protocol at a time by using
setprotoent, getprotoent and endprotoent. Be careful when using these functions
because they are not reentrant.
#include <stdio.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <netinet/in.h>
Chapter 16: Sockets 488
int
make_socket (uint16_t port)
{
int sock;
struct sockaddr_in name;
return sock;
}
Here is another example, showing how you can fill in a sockaddr_in structure, given a
host name string and a port number:
#include <stdio.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
void
init_sockaddr (struct sockaddr_in *name,
const char *hostname,
uint16_t port)
{
struct hostent *hostinfo;
name->sin_family = AF_INET;
name->sin_port = htons (port);
hostinfo = gethostbyname (hostname);
if (hostinfo == NULL)
{
fprintf (stderr, "Unknown host %s.\n", hostname);
exit (EXIT_FAILURE);
}
name->sin_addr = *(struct in_addr *) hostinfo->h_addr;
}
protocols. PF_ISO stands for Open Systems Interconnect. PF_CCITT refers to protocols
from CCITT. socket.h defines these symbols and others naming protocols not actually
implemented.
PF_IMPLINK is used for communicating between hosts and Internet Message Processors.
For information on this and PF_ROUTE, an occasionally-used local area routing protocol, see
the GNU Hurd Manual (to appear in the future).
You can also shut down only reception or transmission on a connection by calling
shutdown, which is declared in sys/socket.h.
int shutdown (int socket, int how) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The shutdown function shuts down the connection of socket socket. The argument
how specifies what action to perform:
0 Stop receiving data for this socket. If further data arrives, reject it.
1 Stop trying to transmit data from this socket. Discard any data waiting
to be sent. Stop looking for acknowledgement of data already sent; don’t
retransmit it if it is lost.
2 Stop both reception and transmission.
The return value is 0 on success and -1 on failure. The following errno error condi-
tions are defined for this function:
EBADF socket is not a valid file descriptor.
ENOTSOCK socket is not a socket.
ENOTCONN socket is not connected.
EAFNOSUPPORT
The specified namespace is not supported.
EPROTONOSUPPORT
The specified protocol is not supported.
EOPNOTSUPP
The specified protocol does not support the creation of socket pairs.
EADDRNOTAVAIL
The specified address is not available on the remote machine.
EAFNOSUPPORT
The namespace of the addr is not supported by this socket.
EISCONN The socket socket is already connected.
ETIMEDOUT
The attempt to establish the connection timed out.
ECONNREFUSED
The server has actively refused to establish the connection.
ENETUNREACH
The network of the given addr isn’t reachable from this host.
EADDRINUSE
The socket address of the given addr is already in use.
EINPROGRESS
The socket socket is non-blocking and the connection could not be estab-
lished immediately. You can determine when the connection is completely
established with select; see Section 13.9 [Waiting for Input or Output],
page 374. Another connect call on the same socket, before the connection
is completely established, will fail with EALREADY.
EALREADY The socket socket is non-blocking and already has a pending connection
in progress (see EINPROGRESS above).
This function is defined as a cancellation point in multi-threaded programs, so one
has to be prepared for this and make sure that allocated resources (like memory, file
descriptors, semaphores or whatever) are freed even if the thread is canceled.
After accept, the original socket socket remains open and unconnected, and continues
listening until you close it. You can accept further connections with socket by calling
accept again.
If an error occurs, accept returns -1. The following errno error conditions are defined
for this function:
EBADF The socket argument is not a valid file descriptor.
ENOTSOCK The descriptor socket argument is not a socket.
EOPNOTSUPP
The descriptor socket does not support this operation.
EWOULDBLOCK
socket has nonblocking mode set, and there are no pending connections
immediately available.
This function is defined as a cancellation point in multi-threaded programs, so one
has to be prepared for this and make sure that allocated resources (like memory, file
descriptors, semaphores or whatever) are freed even if the thread is canceled.
The accept function is not allowed for sockets using connectionless communication
styles.
There are also some I/O modes that are specific to socket operations. In order to specify
these modes, you must use the recv and send functions instead of the more generic read
and write functions. The recv and send functions take an additional argument which you
can use to specify various flags to control special I/O modes. For example, you can specify
the MSG_OOB flag to read or write out-of-band data, the MSG_PEEK flag to peek at input, or
the MSG_DONTROUTE flag to control inclusion of routing information on output.
ssize_t send (int socket, const void *buffer, size_t size, [Function]
int flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The send function is like write, but with the additional flags flags. The possible
values of flags are described in Section 16.9.5.3 [Socket Data Options], page 496.
This function returns the number of bytes transmitted, or -1 on failure. If the socket
is nonblocking, then send (like write) can return after sending just part of the data.
See Section 13.15 [File Status Flags], page 395, for information about nonblocking
mode.
Note, however, that a successful return value merely indicates that the message has
been sent without error, not necessarily that it has been received without error.
The following errno error conditions are defined for this function:
EBADF The socket argument is not a valid file descriptor.
EINTR The operation was interrupted by a signal before any data was sent. See
Section 25.5 [Primitives Interrupted by Signals], page 793.
ENOTSOCK The descriptor socket is not a socket.
EMSGSIZE The socket type requires that the message be sent atomically, but the
message is too large for this to be possible.
EWOULDBLOCK
Nonblocking mode has been set on the socket, and the write operation
would block. (Normally send blocks until the operation can be com-
pleted.)
ENOBUFS There is not enough internal buffer space available.
ENOTCONN You never connected this socket.
EPIPE This socket was connected but the connection is now broken. In this case,
send generates a SIGPIPE signal first; if that signal is ignored or blocked,
or if its handler returns, then send fails with EPIPE.
Chapter 16: Sockets 496
ssize_t recv (int socket, void *buffer, size_t size, int [Function]
flags)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The recv function is like read, but with the additional flags flags. The possible values
of flags are described in Section 16.9.5.3 [Socket Data Options], page 496.
If nonblocking mode is set for socket, and no data are available to be read, recv fails
immediately rather than waiting. See Section 13.15 [File Status Flags], page 395, for
information about nonblocking mode.
This function returns the number of bytes received, or -1 on failure. The following
errno error conditions are defined for this function:
EBADF The socket argument is not a valid file descriptor.
ENOTSOCK The descriptor socket is not a socket.
EWOULDBLOCK
Nonblocking mode has been set on the socket, and the read operation
would block. (Normally, recv blocks until there is input available to be
read.)
EINTR The operation was interrupted by a signal before any data was read. See
Section 25.5 [Primitives Interrupted by Signals], page 793.
ENOTCONN You never connected this socket.
This function is defined as a cancellation point in multi-threaded programs, so one
has to be prepared for this and make sure that allocated resources (like memory, file
descriptors, semaphores or whatever) are freed even if the thread is canceled.
#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
void
write_to_server (int filedes)
{
int nbytes;
int
main (void)
{
extern void init_sockaddr (struct sockaddr_in *name,
const char *hostname,
uint16_t port);
int sock;
struct sockaddr_in servername;
#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
int
read_from_client (int filedes)
{
char buffer[MAXMSG];
int nbytes;
/* End-of-file. */
return -1;
else
{
/* Data read. */
fprintf (stderr, "Server: got message: `%s'\n", buffer);
return 0;
}
}
int
main (void)
{
extern int make_socket (uint16_t port);
int sock;
fd_set active_fd_set, read_fd_set;
int i;
struct sockaddr_in clientname;
size_t size;
while (1)
{
/* Block until input arrives on one or more active sockets. */
read_fd_set = active_fd_set;
if (select (FD_SETSIZE, &read_fd_set, NULL, NULL, NULL) < 0)
{
perror ("select");
exit (EXIT_FAILURE);
}
}
fprintf (stderr,
"Server: connect from host %s, port %hd.\n",
inet_ntoa (clientname.sin_addr),
ntohs (clientname.sin_port));
FD_SET (new, &active_fd_set);
}
else
{
/* Data arriving on an already-connected socket. */
if (read_from_client (i) < 0)
{
close (i);
FD_CLR (i, &active_fd_set);
}
}
}
}
}
Here’s a function to discard any ordinary data preceding the out-of-band mark:
int
discard_until_mark (int socket)
{
while (1)
{
/* This is not an arbitrary limit; any size will do. */
char buffer[1024];
int atmark, success;
If you don’t want to discard the ordinary data preceding the mark, you may need to
read some of it anyway, to make room in internal system buffers for the out-of-band data. If
you try to read out-of-band data and get an EWOULDBLOCK error, try reading some ordinary
data (saving it so that you can use it when you want it) and see if that makes room. Here
is an example:
struct buffer
{
char *buf;
int size;
struct buffer *next;
};
struct buffer *
read_oob (int socket)
{
struct buffer *tail = 0;
struct buffer *list = 0;
while (1)
{
/* This is an arbitrary limit.
Does anyone know how to do this without a limit? */
Chapter 16: Sockets 502
#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <sys/un.h>
int
main (void)
Chapter 16: Sockets 505
{
int sock;
char message[MAXMSG];
struct sockaddr_un name;
size_t size;
int nbytes;
#include <stdio.h>
#include <errno.h>
#include <unistd.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <sys/un.h>
int
main (void)
{
extern int make_named_socket (const char *name);
int sock;
char message[MAXMSG];
struct sockaddr_un name;
size_t size;
int nbytes;
/* Clean up. */
remove (CLIENT);
close (sock);
}
Keep in mind that datagram socket communications are unreliable. In this example, the
client program waits indefinitely if the message never reaches the server or if the server’s
response never comes back. It’s up to the user running the program to kill and restart it
if desired. A more automatic solution could be to use select (see Section 13.9 [Waiting
for Input or Output], page 374) to establish a timeout period for the reply, and in case of
timeout either re-send the message or shut down the socket and exit.
Another way to provide a service on an Internet port is to let the daemon program inetd
do the listening. inetd is a program that runs all the time and waits (using select) for
messages on a specified set of ports. When it receives a message, it accepts the connection (if
the socket style calls for connections) and then forks a child process to run the corresponding
server program. You specify the ports and their programs in the file /etc/inetd.conf.
some servers, such as Telnet and FTP, read a username and passphrase themselves. These
servers need to be root initially so they can log in as commanded by the data coming over
the network.
program together with arguments specifies the command to run to start the server.
program should be an absolute file name specifying the executable file to run. arguments
consists of any number of whitespace-separated words, which become the command-line
arguments of program. The first word in arguments is argument zero, which should by
convention be the program name itself (sans directories).
If you edit /etc/inetd.conf, you can tell inetd to reread the file and obey its new
contents by sending the inetd process the SIGHUP signal. You’ll have to use ps to determine
the process ID of the inetd process as it is not fixed.
int getsockopt (int socket, int level, int optname, void [Function]
*optval, socklen_t *optlen-ptr)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The getsockopt function gets information about the value of option optname at level
level for socket socket.
The option value is stored in the buffer that optval points to. Before the call, you
should supply in *optlen-ptr the size of this buffer; on return, it contains the number
of bytes of information actually stored in the buffer.
Most options interpret the optval buffer as a single int value.
The actual return value of getsockopt is 0 on success and -1 on failure. The following
errno error conditions are defined:
EBADF The socket argument is not a valid file descriptor.
ENOTSOCK The descriptor socket is not a socket.
ENOPROTOOPT
The optname doesn’t make sense for the given level.
int setsockopt (int socket, int level, int optname, const [Function]
void *optval, socklen_t optlen)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 16: Sockets 509
This function is used to set the socket option optname at level level for socket socket.
The value of the option is passed in the buffer optval of size optlen.
The return value and error codes for setsockopt are the same as for getsockopt.
Here is a table of socket-level option names; all are defined in the header file sys/socket.h.
SO_DEBUG
This option toggles recording of debugging information in the underlying pro-
tocol modules. The value has type int; a nonzero value means “yes”.
SO_REUSEADDR
This option controls whether bind (see Section 16.3.2 [Setting the Address of a
Socket], page 468) should permit reuse of local addresses for this socket. If you
enable this option, you can actually have two sockets with the same Internet
port number; but the system won’t allow you to use the two identically-named
sockets in a way that would confuse the Internet. The reason for this option is
that some higher-level Internet protocols, including FTP, require you to keep
reusing the same port number.
The value has type int; a nonzero value means “yes”.
SO_KEEPALIVE
This option controls whether the underlying protocol should periodically trans-
mit messages on a connected socket. If the peer fails to respond to these mes-
sages, the connection is considered broken. The value has type int; a nonzero
value means “yes”.
SO_DONTROUTE
This option controls whether outgoing messages bypass the normal message
routing facilities. If set, messages are sent directly to the network interface
instead. The value has type int; a nonzero value means “yes”.
SO_LINGER
This option specifies what should happen when the socket of a type that
promises reliable delivery still has untransmitted messages when it is closed;
see Section 16.8.2 [Closing a Socket], page 489. The value has type struct
linger.
int l_linger
This specifies the timeout period, in seconds.
SO_BROADCAST
This option controls whether datagrams may be broadcast from the socket. The
value has type int; a nonzero value means “yes”.
SO_OOBINLINE
If this option is set, out-of-band data received on the socket is placed in the
normal input queue. This permits it to be read using read or recv without
specifying the MSG_OOB flag. See Section 16.9.8 [Out-of-Band Data], page 500.
The value has type int; a nonzero value means “yes”.
SO_SNDBUF
This option gets or sets the size of the output buffer. The value is a size_t,
which is the size in bytes.
SO_RCVBUF
This option gets or sets the size of the input buffer. The value is a size_t,
which is the size in bytes.
SO_STYLE
SO_TYPE This option can be used with getsockopt only. It is used to get the socket’s
communication style. SO_TYPE is the historical name, and SO_STYLE is the
preferred name in GNU. The value has type int and its value designates a
communication style; see Section 16.2 [Communication Styles], page 465.
SO_ERROR
This option can be used with getsockopt only. It is used to reset the error
status of the socket. The value is an int, which represents the previous error
status.
int n_addrtype
This is the type of the network number; this is always equal to AF_INET
for Internet networks.
unsigned long int n_net
This is the network number. Network numbers are returned in host byte
order; see Section 16.6.5 [Byte Order Conversion], page 485.
Use the getnetbyname or getnetbyaddr functions to search the networks database for
information about a specific network. The information is returned in a statically-allocated
structure; you must copy the information if you need to save it.
You can also scan the networks database using setnetent, getnetent and endnetent.
Be careful when using these functions because they are not reentrant.
ENODEV The filedes is associated with a terminal device that is a slave pseudo-
terminal, but the file name associated with that device could not be
determined. This is a GNU extension.
MAX_CANON bytes, but the maximum might be larger, and might even dynamically change
size.
In noncanonical input processing mode, characters are not grouped into lines, and
ERASE and KILL processing is not performed. The granularity with which bytes are read in
noncanonical input mode is controlled by the MIN and TIME settings. See Section 17.4.10
[Noncanonical Input], page 531.
Most programs use canonical input mode, because this gives the user a way to edit
input line by line. The usual reason to use noncanonical mode is when the program accepts
single-character commands or provides its own editing facilities.
The choice of canonical or noncanonical input is controlled by the ICANON flag in the
c_lflag member of struct termios. See Section 17.4.7 [Local Modes], page 522.
The struct termios structure also contains members which encode input and output
transmission speeds, but the representation is not specified. See Section 17.4.8 [Line
Speed], page 525, for how to examine and store the speed values.
The following sections describe the details of the members of the struct termios struc-
ture.
int tcsetattr (int filedes, int when, const struct termios [Function]
*termios-p)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function sets the attributes of the terminal device with file descriptor filedes.
The new attributes are taken from the structure that termios-p points to.
The when argument specifies how to deal with input and output already queued. It
can be one of the following values:
TCSANOW Make the change immediately.
TCSADRAIN
Make the change after waiting until all queued output has been written.
You should usually use this option when changing parameters that affect
output.
TCSAFLUSH
This is like TCSADRAIN, but also discards any queued input.
Chapter 17: Low-Level Terminal Interface 517
TCSASOFT This is a flag bit that you can add to any of the above alternatives. Its
meaning is to inhibit alteration of the state of the terminal hardware. It
is a BSD extension; it is only supported on BSD systems and GNU/Hurd
systems.
Using TCSASOFT is exactly the same as setting the CIGNORE bit in the
c_cflag member of the structure termios-p points to. See Section 17.4.6
[Control Modes], page 521, for a description of CIGNORE.
If this function is called from a background process on its controlling terminal, nor-
mally all processes in the process group are sent a SIGTTOU signal, in the same way
as if the process were trying to write to the terminal. The exception is if the calling
process itself is ignoring or blocking SIGTTOU signals, in which case the operation is
performed and no signal is sent. See Chapter 29 [Job Control], page 870.
If successful, tcsetattr returns 0. A return value of −1 indicates an error. The
following errno error conditions are defined for this function:
EBADF The filedes argument is not a valid file descriptor.
ENOTTY The filedes is not associated with a terminal.
EINVAL Either the value of the when argument is not valid, or there is something
wrong with the data in the termios-p argument.
Although tcgetattr and tcsetattr specify the terminal device with a file descriptor,
the attributes are those of the terminal device itself and not of the file descriptor. This
means that the effects of changing terminal attributes are persistent; if another process
opens the terminal file later on, it will see the changed attributes even though it doesn’t
have anything to do with the open file descriptor you originally specified in changing the
attributes.
Similarly, if a single process has multiple or duplicated file descriptors for the same
terminal device, changing the terminal attributes affects input and output to all of these
file descriptors. This means, for example, that you can’t open one file descriptor or stream
to read from a terminal in the normal line-buffered, echoed mode; and simultaneously
have another file descriptor for the same terminal that you use to read from it in single-
character, non-echoed mode. Instead, you have to explicitly switch the terminal back and
forth between the two modes.
If this bit is set, what happens when a parity error is detected depends on whether
the IGNPAR or PARMRK bits are set. If neither of these bits are set, a byte with a parity
error is passed to the application as a '\0' character.
The control mode flags also includes a field for the number of bits per character. You
can use the CSIZE macro as a mask to extract the value, like this: settings.c_cflag &
CSIZE.
The following four bits are BSD extensions; these exist only on BSD systems and
GNU/Hurd systems.
The c_lflag member itself is an integer, and you change the flags and fields using the
operators &, |, and ^. Don’t try to specify the entire value for c_lflag—instead, change
only specific flags and leave the rest untouched (see Section 17.4.3 [Setting Terminal Modes
Properly], page 517).
tcflag_t ICANON [Macro]
This bit, if set, enables canonical input processing mode. Otherwise, input is pro-
cessed in noncanonical mode. See Section 17.3 [Two Styles of Input: Canonical or
Not], page 514.
tcflag_t ECHO [Macro]
If this bit is set, echoing of input characters back to the terminal is enabled.
tcflag_t ECHOE [Macro]
If this bit is set, echoing indicates erasure of input with the ERASE character by
erasing the last character in the current line from the screen. Otherwise, the character
erased is re-echoed to show what has happened (suitable for a printing terminal).
This bit only controls the display behavior; the ICANON bit by itself controls actual
recognition of the ERASE character and erasure of input, without which ECHOE is
simply irrelevant.
tcflag_t ECHOPRT [Macro]
This bit, like ECHOE, enables display of the ERASE character in a way that is geared to
a hardcopy terminal. When you type the ERASE character, a ‘\’ character is printed
followed by the first character erased. Typing the ERASE character again just prints
the next character erased. Then, the next time you type a normal character, a ‘/’
character is printed before the character echoes.
This is a BSD extension, and exists only in BSD systems and GNU/Linux and
GNU/Hurd systems.
tcflag_t ECHOK [Macro]
This bit enables special display of the KILL character by moving to a new line after
echoing the KILL character normally. The behavior of ECHOKE (below) is nicer to
look at.
If this bit is not set, the KILL character echoes just as it would if it were not the
KILL character. Then it is up to the user to remember that the KILL character has
erased the preceding input; there is no indication of this on the screen.
This bit only controls the display behavior; the ICANON bit by itself controls actual
recognition of the KILL character and erasure of input, without which ECHOK is simply
irrelevant.
tcflag_t ECHOKE [Macro]
This bit is similar to ECHOK. It enables special display of the KILL character by
erasing on the screen the entire line that has been killed. This is a BSD extension,
and exists only in BSD systems and GNU/Linux and GNU/Hurd systems.
tcflag_t ECHONL [Macro]
If this bit is set and the ICANON bit is also set, then the newline ('\n') character is
echoed even if the ECHO bit is not set.
Chapter 17: Low-Level Terminal Interface 524
The following bits are BSD extensions; they exist only on BSD systems and GNU/Hurd
systems.
This function stores speed in *termios-p as the output speed. The normal return
value is 0; a value of −1 indicates an error. If speed is not a speed, cfsetospeed
returns −1.
The functions cfsetospeed and cfsetispeed report errors only for speed values that
the system simply cannot handle. If you specify a speed value that is basically acceptable,
then those functions will succeed. But they do not check that a particular hardware device
can actually support the specified speeds—in fact, they don’t know which device you plan
to set the speed for. If you use tcsetattr to set the speed of a particular device to a value
that it cannot handle, tcsetattr returns −1.
Portability note: In the GNU C Library, the functions above accept speeds measured
in bits per second as input, and return speed values measured in bits per second. Other
libraries require speeds to be indicated by special codes. For POSIX.1 portability, you must
use one of the following symbols to represent the speed; their precise numeric values are
system-dependent, but each name has a fixed meaning: B110 stands for 110 bps, B300 for
300 bps, and so on. There is no portable way to represent any speed but these, but these
are the only speeds that typical serial lines can support.
B0 B50 B75 B110 B134 B150 B200
B300 B600 B1200 B1800 B2400 B4800
B9600 B19200 B38400 B57600 B115200
B230400 B460800
BSD defines two additional speed symbols as aliases: EXTA is an alias for B19200 and
EXTB is an alias for B38400. These aliases are obsolete.
The particular characters used are specified in the c_cc member of the struct termios
structure. This member is an array; each element specifies the character for a particular
role. Each element has a symbolic constant that stands for the index of that element—for
example, VINTR is the index of the element that specifies the INTR character, so storing
'=' in termios.c_cc[VINTR] specifies ‘=’ as the INTR character.
On some systems, you can disable a particular special character function by specifying
the value _POSIX_VDISABLE for that role. This value is unequal to any possible character
code. See Section 33.7 [Optional Features in File Support], page 958, for more information
about how to tell whether the operating system you are using supports _POSIX_VDISABLE.
generates multibyte character sequences, this may cause more than one byte of input
to be discarded.) This cannot be used to erase past the beginning of the current line
of text. The ERASE character itself is discarded.
Usually, the ERASE character is DEL.
The INTR (interrupt) character raises a SIGINT signal for all processes in the fore-
ground job associated with the terminal. The INTR character itself is then discarded.
See Chapter 25 [Signal Handling], page 766, for more information about signals.
Typically, the INTR character is C-c.
Few applications disable the normal interpretation of the SUSP character. If your pro-
gram does this, it should provide some other mechanism for the user to stop the job. When
the user invokes this mechanism, the program should send a SIGTSTP signal to the process
group of the process, not just to the process itself. See Section 25.6.2 [Signaling Another
Process], page 795.
The STATUS character’s effect is to print out a status message about how the current
process is running.
The STATUS character is recognized only in canonical mode, and only if NOKERNINFO
is not set.
This character is available only on BSD systems and GNU/Hurd systems.
The MIN and TIME values interact to determine the criterion for when read should
return; their precise meanings depend on which of them are nonzero. There are four possible
cases:
• Both TIME and MIN are nonzero.
In this case, TIME specifies how long to wait after each input character to see if more
input arrives. After the first character received, read keeps waiting until either MIN
bytes have arrived in all, or TIME elapses with no further input.
read always blocks until the first character arrives, even if TIME elapses first. read
can return more than MIN characters if more than MIN happen to be in the queue.
• Both MIN and TIME are zero.
In this case, read always returns immediately with as many characters as are available
in the queue, up to the number requested. If no input is immediately available, read
returns a value of zero.
Chapter 17: Low-Level Terminal Interface 532
char sg_ospeed
Line speed for output
char sg_erase
Erase character
char sg_kill
Kill character
int sg_flags
Various flags
TCIFLUSH
Clear any input data received, but not yet read.
TCOFLUSH
Clear any output data written, but not yet transmitted.
TCIOFLUSH
Clear both queued input and output.
The return value is normally zero. In the event of an error, a value of −1 is returned.
The following errno error conditions are defined for this function:
It is unfortunate that this function is named tcflush, because the term “flush” is
normally used for quite another operation—waiting until all output is transmitted—
and using it for discarding input or output would be confusing. Unfortunately, the
name tcflush comes from POSIX and we cannot change it.
Chapter 17: Low-Level Terminal Interface 535
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <termios.h>
void
reset_input_mode (void)
{
tcsetattr (STDIN_FILENO, TCSANOW, &saved_attributes);
}
void
set_input_mode (void)
{
struct termios tattr;
exit (EXIT_FAILURE);
}
int
main (void)
{
char c;
set_input_mode ();
while (1)
{
read (STDIN_FILENO, &c, 1);
if (c == '\004') /* C-d */
break;
else
write (STDOUT_FILENO, &c, 1);
}
return EXIT_SUCCESS;
}
This program is careful to restore the original terminal modes before exiting or termi-
nating with a signal. It uses the atexit function (see Section 26.7.3 [Cleanups on Exit],
page 852) to make sure this is done by exit.
The shell is supposed to take care of resetting the terminal modes when a process is
stopped or continued; see Chapter 29 [Job Control], page 870. But some existing shells do
not actually do this, so you may wish to establish handlers for job control signals that reset
terminal modes. The above example does so.
terminal attribute (see Section 17.4.7 [Local Modes], page 522). The terminal is
flushed before and after getpass, so that characters of a mistyped passphrase are not
accidentally visible.
In other C libraries, getpass may only return the first PASS_MAX bytes of a passphrase.
The GNU C Library has no limit, so PASS_MAX is undefined.
The prototype for this function is in unistd.h. PASS_MAX would be defined in
limits.h.
This precise set of operations may not suit all possible situations. In this case, it is
recommended that users write their own getpass substitute. For instance, a very simple
substitute is as follows:
#include <termios.h>
#include <stdio.h>
ssize_t
my_getpass (char **lineptr, size_t *n, FILE *stream)
{
struct termios old, new;
int nread;
/* Restore terminal. */
(void) tcsetattr (fileno (stream), TCSAFLUSH, &old);
return nread;
}
The substitute takes the same parameters as getline (see Section 12.9 [Line-Oriented
Input], page 287); the user must print any prompt desired.
17.9 Pseudo-Terminals
A pseudo-terminal is a special interprocess communication channel that acts like a terminal.
One end of the channel is called the master side or master pseudo-terminal device, the other
side is called the slave side. Data written to the master side is received by the slave side as
if it was the result of a user typing at an ordinary terminal, and data written to the slave
side is sent to the master side as if it was written on an ordinary terminal.
Pseudo terminals are the way programs like xterm and emacs implement their terminal
emulation functionality.
Chapter 17: Low-Level Terminal Interface 538
The normal return value from grantpt is 0; a value of −1 is returned in case of failure.
The following errno error conditions are defined for this function:
EBADF The filedes argument is not a valid file descriptor.
EINVAL The filedes argument is not associated with a master pseudo-terminal
device.
EACCES The slave pseudo-terminal device corresponding to the master associated
with filedes could not be accessed.
int unlockpt (int filedes) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap/bsd | AC-Unsafe mem fd | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The unlockpt function unlocks the slave pseudo-terminal device corresponding to the
master pseudo-terminal device associated with the file descriptor filedes. On many
systems, the slave can only be opened after unlocking, so portable applications should
always call unlockpt before trying to open the slave.
The normal return value from unlockpt is 0; a value of −1 is returned in case of
failure. The following errno error conditions are defined for this function:
EBADF The filedes argument is not a valid file descriptor.
EINVAL The filedes argument is not associated with a master pseudo-terminal
device.
char * ptsname (int filedes) [Function]
Preliminary: | MT-Unsafe race:ptsname | AS-Unsafe heap/bsd | AC-Unsafe mem
fd | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
If the file descriptor filedes is associated with a master pseudo-terminal device, the
ptsname function returns a pointer to a statically-allocated, null-terminated string
containing the file name of the associated slave pseudo-terminal file. This string
might be overwritten by subsequent calls to ptsname.
int ptsname_r (int filedes, char *buf, size_t len) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap/bsd | AC-Unsafe mem fd | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The ptsname_r function is similar to the ptsname function except that it places its
result into the user-specified buffer starting at buf with length len.
This function is a GNU extension.
Typical usage of these functions is illustrated by the following example:
int
open_pty_pair (int *amaster, int *aslave)
{
int master, slave;
char *name;
*amaster = master;
*aslave = slave;
return 1;
close_slave:
close (slave);
close_master:
close (master);
return 0;
}
int openpty (int *amaster, int *aslave, char *name, const [Function]
struct termios *termp, const struct winsize *winp)
Preliminary: | MT-Safe locale | AS-Unsafe dlopen plugin heap lock | AC-Unsafe
corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function allocates and opens a pseudo-terminal pair, returning the file descriptor
for the master in *amaster, and the file descriptor for the slave in *aslave. If the
argument name is not a null pointer, the file name of the slave pseudo-terminal device
is stored in *name. If termp is not a null pointer, the terminal attributes of the slave
are set to the ones specified in the structure that termp points to (see Section 17.4
[Terminal Modes], page 515). Likewise, if winp is not a null pointer, the screen size
of the slave is set to the values specified in the structure that winp points to.
The normal return value from openpty is 0; a value of −1 is returned in case of failure.
The following errno conditions are defined for this function:
ENOENT There are no free pseudo-terminal pairs available.
Warning: Using the openpty function with name not set to NULL is very dangerous
because it provides no protection against overflowing the string name. You should
use the ttyname function on the file descriptor returned in *slave to find out the file
name of the slave pseudo-terminal device instead.
This function is similar to the openpty function, but in addition, forks a new pro-
cess (see Section 27.4 [Creating a Process], page 857) and makes the newly opened
slave pseudo-terminal device the controlling terminal (see Section 29.2 [Controlling
Terminal of a Process], page 871) for the child process.
If the operation is successful, there are then both parent and child processes and both
see forkpty return, but with different values: it returns a value of 0 in the child
process and returns the child’s process ID in the parent process.
If the allocation of a pseudo-terminal pair or the process creation failed, forkpty
returns a value of −1 in the parent process.
Warning: The forkpty function has the same problems with respect to the name
argument as openpty.
542
18 Syslog
This chapter describes facilities for issuing and logging messages of system administration
interest. This chapter has nothing to do with programs issuing messages to their own
users or keeping private logs (One would typically do that with the facilities described in
Chapter 12 [Input/Output on Streams], page 270).
Most systems have a facility called “Syslog” that allows programs to submit messages
of interest to system administrators and can be configured to pass these messages on in
various ways, such as printing on the console, mailing to a particular person, or recording
in a log file for future reference.
A program uses the facilities in this chapter to submit such messages.
In order to classify messages for disposition, Syslog requires any process that submits a
message to it to provide two pieces of classification information with it:
facility This identifies who submitted the message. There are a small number of facili-
ties defined. The kernel, the mail subsystem, and an FTP server are examples
of recognized facilities. For the complete list, See Section 18.2.2 [syslog, vsys-
log], page 545. Keep in mind that these are essentially arbitrary classifications.
"Mail subsystem" doesn’t have any more meaning than the system administra-
tor gives to it.
priority This tells how important the content of the message is. Examples of defined
priority values are: debug, informational, warning and critical. For the complete
list, see Section 18.2.2 [syslog, vsyslog], page 545. Except for the fact that the
priorities have a defined order, the meaning of each of these priorities is entirely
determined by the system administrator.
A “facility/priority” is a number that indicates both the facility and the priority.
Warning: This terminology is not universal. Some people use “level” to refer to the
priority and “priority” to refer to the combination of facility and priority. A Linux kernel
has a concept of a message “level,” which corresponds both to a Syslog priority and to a
Syslog facility/priority (It can be both because the facility code for the kernel is zero, and
that makes priority and facility/priority the same value).
The GNU C Library provides functions to submit messages to Syslog. They do it by
writing to the /dev/log socket. See Section 18.2 [Submitting Syslog Messages], page 543.
The GNU C Library functions only work to submit messages to the Syslog facility on
the same system. To submit a message to the Syslog facility on another system, use the
socket I/O functions to write a UDP datagram to the syslog UDP port on that system.
See Chapter 16 [Sockets], page 464.
18.2.1 openlog
The symbols referred to in this section are declared in the file syslog.h.
void openlog (const char *ident, int option, int facility) [Function]
Preliminary: | MT-Safe | AS-Unsafe lock | AC-Unsafe lock fd | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
openlog opens or reopens a connection to Syslog in preparation for submitting mes-
sages.
ident is an arbitrary identification string which future syslog invocations will prefix
to each message. This is intended to identify the source of the message, and people
conventionally set it to the name of the program that will submit the messages.
Chapter 18: Syslog 544
If ident is NULL, or if openlog is not called, the default identification string used in
Syslog messages will be the program name, taken from argv[0].
Please note that the string pointer ident will be retained internally by the Syslog
routines. You must not free the memory that ident points to. It is also dangerous to
pass a reference to an automatic variable since leaving the scope would mean ending
the lifetime of the variable. If you want to change the ident string, you must call
openlog again; overwriting the string pointed to by ident is not thread-safe.
You can cause the Syslog routines to drop the reference to ident and go back to
the default string (the program name taken from argv[0]), by calling closelog: See
Section 18.2.3 [closelog], page 547.
In particular, if you are writing code for a shared library that might get loaded and
then unloaded (e.g. a PAM module), and you use openlog, you must call closelog
before any point where your library might get unloaded, as in this example:
#include <syslog.h>
void
shared_library_function (void)
{
openlog ("mylibrary", option, priority);
closelog ();
}
Without the call to closelog, future invocations of syslog by the program using
the shared library may crash, if the library gets unloaded and the memory containing
the string "mylibrary" becomes unmapped. This is a limitation of the BSD syslog
interface.
openlog may or may not open the /dev/log socket, depending on option. If it does,
it tries to open it and connect it as a stream socket. If that doesn’t work, it tries to
open it and connect it as a datagram socket. The socket has the “Close on Exec”
attribute, so the kernel will close it if the process performs an exec.
You don’t have to use openlog. If you call syslog without having called openlog,
syslog just opens the connection implicitly and uses defaults for the information in
ident and options.
options is a bit string, with the bits as defined by the following single bit masks:
LOG_PERROR
If on, openlog sets up the connection so that any syslog on this con-
nection writes its message to the calling process’ Standard Error stream
in addition to submitting it to Syslog. If off, syslog does not write the
message to Standard Error.
LOG_CONS If on, openlog sets up the connection so that a syslog on this connection
that fails to submit a message to Syslog writes the message instead to
system console. If off, syslog does not write to the system console (but
of course Syslog may write messages it receives to the console).
Chapter 18: Syslog 545
LOG_PID When on, openlog sets up the connection so that a syslog on this con-
nection inserts the calling process’ Process ID (PID) into the message.
When off, openlog does not insert the PID.
LOG_NDELAY
When on, openlog opens and connects the /dev/log socket. When off,
a future syslog call must open and connect the socket.
Portability note: In early systems, the sense of this bit was exactly the
opposite.
LOG_ODELAY
This bit does nothing. It exists for backward compatibility.
If any other bit in options is on, the result is undefined.
facility is the default facility code for this connection. A syslog on this connection
that specifies default facility causes this facility to be associated with the message.
See syslog for possible values. A value of zero means the default, which is LOG_USER.
If a Syslog connection is already open when you call openlog, openlog “reopens” the
connection. Reopening is like opening except that if you specify zero for the default
facility code, the default facility code simply remains unchanged and if you specify
LOG NDELAY and the socket is already open and connected, openlog just leaves it
that way.
LOG_NOTICE
The message describes a normal but important event.
LOG_INFO The message is purely informational.
LOG_DEBUG
The message is only for debugging purposes.
Results are undefined if the priority code is anything else.
If the process does not presently have a Syslog connection open (i.e., it did not call
openlog), syslog implicitly opens the connection the same as openlog would, with
the following defaults for information that would otherwise be included in an openlog
call: The default identification string is the program name. The default default facility
is LOG_USER. The default for all the connection options in options is as if those bits
were off. syslog leaves the Syslog connection open.
If the /dev/log socket is not open and connected, syslog opens and connects it, the
same as openlog with the LOG_NDELAY option would.
syslog leaves /dev/log open and connected unless its attempt to send the message
failed, in which case syslog closes it (with the hope that a future implicit open will
restore the Syslog connection to a usable state).
Example:
#include <syslog.h>
syslog (LOG_MAKEPRI(LOG_LOCAL1, LOG_ERROR),
"Unable to make network connection to %s. Error=%m", host);
18.2.3 closelog
The symbols referred to in this section are declared in the file syslog.h.
closelog does not flush any buffers. You do not have to call closelog before re-
opening a Syslog connection with openlog. Syslog connections are automatically
closed on exec or exit.
18.2.4 setlogmask
The symbols referred to in this section are declared in the file syslog.h.
closelog ();
550
19 Mathematics
This chapter contains information about functions for performing mathematical computa-
tions, such as trigonometric functions. Most of these functions have prototypes declared in
the header file math.h. The complex-valued functions are defined in complex.h.
All mathematical functions which take a floating-point argument have three variants,
one each for double, float, and long double arguments. The double versions are mostly
defined in ISO C89. The float and long double versions are from the numeric extensions
to C included in ISO C99.
Which of the three versions of a function should be used depends on the situation. For
most calculations, the float functions are the fastest. On the other hand, the long double
functions have the highest precision. double is somewhere in between. It is usually wise to
pick the narrowest type that can accommodate your data. Not all machines have a distinct
long double type; it may be the same as double.
The GNU C Library also provides _FloatN and _FloatNx types. These types are defined
in ISO/IEC TS 18661-3, which extends ISO C and defines floating-point types that are not
machine-dependent. When such a type, such as _Float128, is supported by the GNU C
Library, extra variants for most of the mathematical functions provided for double, float,
and long double are also provided for the supported type. Throughout this manual, the
_FloatN and _FloatNx variants of these functions are described along with the double,
float, and long double variants and they come from ISO/IEC TS 18661-3, unless explic-
itly stated otherwise.
Support for _FloatN or _FloatNx types is provided for _Float32, _Float64 and _
Float32x on all platforms. It is also provided for _Float128 and _Float64x on powerpc64le
(PowerPC 64-bits little-endian), x86 64, x86, aarch64, alpha, loongarch, mips64, riscv, s390
and sparc.
M_2_SQRTPI
Two times the reciprocal of the square root of pi.
M_SQRT2 The square root of two.
M_SQRT1_2
The reciprocal of the square root of two (also the square root of 1/2).
These constants come from the Unix98 standard and were also available in 4.4BSD;
therefore they are only defined if _XOPEN_SOURCE=500, or a more general feature select
macro, is defined. The default set of features includes these constants. See Section 1.3.4
[Feature Test Macros], page 16.
All values are of type double. As an extension, the GNU C Library also defines these
constants with type long double and float. The long double macros have a lowercase ‘l’
while the float macros have a lowercase ‘f’ appended to their names: M_El, M_PIl, and so
forth. These are only available if _GNU_SOURCE is defined.
Likewise, the GNU C Library also defines these constants with the types _FloatN and
_FloatNx for the machines that have support for such types enabled (see Chapter 19 [Math-
ematics], page 550) and if _GNU_SOURCE is defined. When available, the macros names are
appended with ‘fN’ or ‘fNx’, such as ‘f128’ for the type _Float128.
Note: Some programs use a constant named PI which has the same value as M_PI.
This constant is not standard; it may have appeared in some old AT&T headers, and is
mentioned in Stroustrup’s book on C++. It infringes on the user’s name space, so the GNU
C Library does not define it. Fixing programs written to expect it is simple: replace PI
with M_PI throughout, or put ‘-DPI=M_PI’ on the compiler command line.
In many applications where sin and cos are used, the sine and cosine of the same angle
are needed at the same time. It is more efficient to compute them simultaneously, so the
library provides a function to do that.
ISO C99 defines variants of the trig functions which work on complex numbers. The
GNU C Library provides these functions, but they are only useful if your compiler supports
the new complex types defined by the standard. (As of this writing GCC supports complex
numbers, but there are bugs in the implementation.)
1 zi
sin(z) = (e − e−zi )
2i
complex double ccos (complex double z) [Function]
complex float ccosf (complex float z) [Function]
complex long double ccosl (complex long double z) [Function]
complex _FloatN ccosfN (complex _FloatN z) [Function]
complex _FloatNx ccosfNx (complex _FloatNx z) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
These functions return the complex cosine of z. The mathematical definition of the
complex cosine is
1
cos(z) = (ezi + e−zi )
2
complex double ctan (complex double z) [Function]
complex float ctanf (complex float z) [Function]
complex long double ctanl (complex long double z) [Function]
complex _FloatN ctanfN (complex _FloatN z) [Function]
complex _FloatNx ctanfNx (complex _FloatNx z) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
These functions return the complex tangent of z. The mathematical definition of the
complex tangent is
ezi − e−zi
tan(z) = −i ·
ezi + e−zi
The complex tangent has poles at pi/2 + 2n, where n is an integer. ctan may signal
overflow if z is too close to a pole.
Since integers cannot represent infinity and NaN, ilogb instead returns an integer that
can’t be the exponent of a normal floating-point number. math.h defines constants so you
can check for this.
These functions return a value equivalent to exp2 (x) - 1. They are computed in
a way that is accurate even if x is near zero—a case where exp2 (x) - 1 would be
inaccurate owing to subtraction of two numbers that are nearly equal.
The exp2m1 functions are from TS 18661-4:2015.
double exp10m1 (double x) [Function]
float exp10m1f (float x) [Function]
long double exp10m1l (long double x) [Function]
_FloatN exp10m1fN (_FloatN x) [Function]
_FloatNx exp10m1fNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
These functions return a value equivalent to exp10 (x) - 1. They are computed in
a way that is accurate even if x is near zero—a case where exp10 (x) - 1 would be
inaccurate owing to subtraction of two numbers that are nearly equal.
The exp10m1 functions are from TS 18661-4:2015.
double log1p (double x) [Function]
float log1pf (float x) [Function]
long double log1pl (long double x) [Function]
_FloatN log1pfN (_FloatN x) [Function]
_FloatNx log1pfNx (_FloatNx x) [Function]
double logp1 (double x) [Function]
float logp1f (float x) [Function]
long double logp1l (long double x) [Function]
_FloatN logp1fN (_FloatN x) [Function]
_FloatNx logp1fNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
These functions return a value equivalent to log (1 + x). They are computed in a
way that is accurate even if x is near zero.
The logp1 names for these functions are from TS 18661-4:2015.
double log2p1 (double x) [Function]
float log2p1f (float x) [Function]
long double log2p1l (long double x) [Function]
_FloatN log2p1fN (_FloatN x) [Function]
_FloatNx log2p1fNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
These functions return a value equivalent to log2 (1 + x). They are computed in a
way that is accurate even if x is near zero.
The log2p1 functions are from TS 18661-4:2015.
double log10p1 (double x) [Function]
float log10p1f (float x) [Function]
long double log10p1l (long double x) [Function]
Chapter 19: Mathematics 561
ISO C99 defines complex variants of some of the exponentiation and logarithm functions.
clog has a pole at 0, and will signal overflow if z equals or is very close to 0. It is
well-defined for all other values of z.
All these functions, including the _FloatN and _FloatNx variants, are GNU exten-
sions.
There are counterparts for the hyperbolic functions which take complex arguments.
The sign of the gamma function is stored in the global variable signgam, which is
declared in math.h. It is 1 if the intermediate result was positive or zero, or -1 if it
was negative.
To compute the real gamma function you can use the tgamma function or you can
compute the values as follows:
lgam = lgamma(x);
gam = signgam*exp(lgam);
The gamma function has singularities at the non-positive integers. lgamma will raise
the zero divide exception if evaluated at a singularity.
double lgamma_r (double x, int *signp) [Function]
float lgammaf_r (float x, int *signp) [Function]
long double lgammal_r (long double x, int *signp) [Function]
_FloatN lgammafN_r (_FloatN x, int *signp) [Function]
_FloatNx lgammafNx_r (_FloatNx x, int *signp) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
lgamma_r is just like lgamma, but it stores the sign of the intermediate result in
the variable pointed to by signp instead of in the signgam global. This means it is
reentrant.
The lgammafN_r and lgammafNx_r functions are GNU extensions.
double gamma (double x) [Function]
float gammaf (float x) [Function]
long double gammal (long double x) [Function]
Preliminary: | MT-Unsafe race:signgam | AS-Unsafe | AC-Safe | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
These functions exist for compatibility reasons. They are equivalent to lgamma etc. It
is better to use lgamma since for one the name reflects better the actual computation,
and moreover lgamma is standardized in ISO C99 while gamma is not.
double tgamma (double x) [Function]
float tgammaf (float x) [Function]
long double tgammal (long double x) [Function]
_FloatN tgammafN (_FloatN x) [Function]
_FloatNx tgammafNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 19: Mathematics 567
This function was introduced in ISO C99. The _FloatN and _FloatNx variants were
introduced in ISO/IEC TS 18661-3.
double j0 (double x) [Function]
float j0f (float x) [Function]
long double j0l (long double x) [Function]
_FloatN j0fN (_FloatN x) [Function]
_FloatNx j0fNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
j0 returns the Bessel function of the first kind of order 0 of x. It may signal underflow
if x is too large.
The _FloatN and _FloatNx variants are GNU extensions.
double j1 (double x) [Function]
float j1f (float x) [Function]
long double j1l (long double x) [Function]
_FloatN j1fN (_FloatN x) [Function]
_FloatNx j1fNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
j1 returns the Bessel function of the first kind of order 1 of x. It may signal underflow
if x is too large.
The _FloatN and _FloatNx variants are GNU extensions.
double jn (int n, double x) [Function]
float jnf (int n, float x) [Function]
long double jnl (int n, long double x) [Function]
_FloatN jnfN (int n, _FloatN x) [Function]
_FloatNx jnfNx (int n, _FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
jn returns the Bessel function of the first kind of order n of x. It may signal underflow
if x is too large.
The _FloatN and _FloatNx variants are GNU extensions.
double y0 (double x) [Function]
float y0f (float x) [Function]
long double y0l (long double x) [Function]
_FloatN y0fN (_FloatN x) [Function]
_FloatNx y0fNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 19: Mathematics 568
y0 returns the Bessel function of the second kind of order 0 of x. It may signal
underflow if x is too large. If x is negative, y0 signals a domain error; if it is zero, y0
signals overflow and returns −∞.
The _FloatN and _FloatNx variants are GNU extensions.
|d.d . . . d − (z/2e )|
2p−1
where p is the number of bits in the mantissa of the floating-point number representation.
Ideally the error for all functions is always less than 0.5ulps in round-to-nearest mode.
Using rounding bits this is also possible and normally implemented for the basic operations.
Except for certain functions such as sqrt, fma and rint whose results are fully specified
by reference to corresponding IEEE 754 floating-point operations, and conversions between
strings and floating point, the GNU C Library does not aim for correctly rounded results
for functions in the math library, and does not aim for correctness in whether “inexact”
exceptions are raised. Instead, the goals for accuracy of functions without fully specified
Chapter 19: Mathematics 569
results are as follows; some functions have bugs meaning they do not meet these goals in
all cases. In the future, the GNU C Library may provide some other correctly rounding
functions under the names such as crsin proposed for an extension to ISO C.
• Each function with a floating-point result behaves as if it computes an infinite-precision
result that is within a few ulp (in both real and complex parts, for functions with com-
plex results) of the mathematically correct value of the function (interpreted together
with ISO C or POSIX semantics for the function in question) at the exact value passed
as the input. Exceptions are raised appropriately for this value and in accordance with
IEEE 754 / ISO C / POSIX semantics, and it is then rounded according to the cur-
rent rounding direction to the result that is returned to the user. errno may also be
set (see Section 20.5.4 [Error Reporting by Mathematical Functions], page 655). (The
“inexact” exception may be raised, or not raised, even if this is inconsistent with the
infinite-precision value.)
• For the IBM long double format, as used on PowerPC GNU/Linux, the accuracy goal
is weaker for input values not exactly representable in 106 bits of precision; it is as if
the input value is some value within 0.5ulp of the value actually passed, where “ulp” is
interpreted in terms of a fixed-precision 106-bit mantissa, but not necessarily the exact
value actually passed with discontiguous mantissa bits.
• For the IBM long double format, functions whose results are fully specified by refer-
ence to corresponding IEEE 754 floating-point operations have the same accuracy goals
as other functions, but with the error bound being the same as that for division (3ulp).
Furthermore, “inexact” and “underflow” exceptions may be raised for all functions for
any inputs, even where such exceptions are inconsistent with the returned value, since
the underlying floating-point arithmetic has that property.
• Functions behave as if the infinite-precision result computed is zero, infinity or NaN if
and only if that is the mathematically correct infinite-precision result. They behave as
if the infinite-precision result computed always has the same sign as the mathematically
correct result.
• If the mathematical result is more than a few ulp above the overflow threshold for the
current rounding direction, the value returned is the appropriate overflow value for the
current rounding direction, with the overflow exception raised.
• If the mathematical result has magnitude well below half the least subnormal mag-
nitude, the returned value is either zero or the least subnormal (in each case, with
the correct sign), according to the current rounding direction and with the underflow
exception raised.
• Where the mathematical result underflows (before rounding) and is not exactly rep-
resentable as a floating-point value, the function does not behave as if the computed
infinite-precision result is an exact value in the subnormal range. This means that
the underflow exception is raised other than possibly for cases where the mathematical
result is very close to the underflow threshold and the function behaves as if it com-
putes an infinite-precision result that does not underflow. (So there may be spurious
underflow exceptions in cases where the underflowing result is exact, but not missing
underflow exceptions in cases where it is inexact.)
• The GNU C Library does not aim for functions to satisfy other properties of the
Chapter 19: Mathematics 570
asinh advsimdf2 - - - -
asinh advsimd 1 - - - -
asinh advsimdl- - - - -
asinh advsimdf128
- - - - -
asinh svef 2 - - - -
asinh sve 1 - - - -
asinh svel - - - - -
asinh svef128 - - - - -
atanf 1 1 1 1 1
atan 1 1 1 1 1
atanl 1 - - - 1
atanf128 - - - - -
atan2f 1 2 2 2 2
atan2 - 7 - - -
atan2l 2 - - - 2
atan2f128 - - - - -
atan2 advsimdf2 - - - -
atan2 advsimd 1 - - - -
atan2 advsimdl- - - - -
atan2 advsimdf128
- - - - -
atan2 svef 2 - - - -
atan2 sve 1 - - - -
atan2 svel - - - - -
atan2 svef128 - - - - -
atan advsimdf 1 - - - -
atan advsimd 1 - - - -
atan advsimdl - - - - -
atan advsimdf128
- - - - -
atan svef 1 - - - -
atan sve 1 - - - -
atan svel - - - - -
atan svef128 - - - - -
atanhf 2 2 2 2 2
atanh 2 2 2 2 2
atanhl 4 - - - 4
atanhf128 - - - - -
atanh advsimdf1 - - - -
atanh advsimd1 - - - -
atanh advsimdl- - - - -
atanh advsimdf128
- - - - -
atanh svef 1 - - - -
atanh sve 2 - - - -
atanh svel - - - - -
atanh svef128 - - - - -
cabsf - 1 - - -
cabs 1 1 1 1 1
cabsl 1 - - - 1
Chapter 19: Mathematics 573
cabsf128 - - - - -
cacosf 2+ i2 2 +i3 2 +i2 2 +i2 2 +i2
cacos 1+ i2 2 +i5 1 +i2 1 +i2 1 +i2
cacosl 2+ i2 - - - 2 +i2
cacosf128 - - - - -
cacoshf 2+ i2 4 +i2 2 +i2 2 +i2 2 +i2
cacosh 2+ i1 5 +i2 2 +i1 2 +i1 2 +i1
cacoshl 2+ i2 - - - 2 +i2
cacoshf128 - - - - -
cargf 1 2 1 1 1
carg 1 7 - - -
cargl 2 - - - 2
cargf128 - - - - -
casinf 1+ i2 1 +i4 1 +i2 1 +i2 1 +i2
casin 1+ i2 3 +i5 1 +i2 1 +i2 1 +i2
casinl 2+ i2 - - - 2 +i2
casinf128 - - - - -
casinhf 2+ i1 4 +i2 2 +i1 2 +i1 2 +i1
casinh 2+ i1 5 +i3 2 +i1 2 +i1 2 +i1
casinhl 2+ i2 - - - 2 +i2
casinhf128 - - - - -
catanf 1+ i1 1 +i3 1 +i1 1 +i1 1 +i1
catan 1+ i1 1 +i3 1 +i1 1 +i1 1 +i1
catanl 1+ i1 - - - 1 +i1
catanf128 - - - - -
catanhf 1+ i1 4 +i2 1 +i1 1 +i1 1 +i1
catanh 1+ i1 4 +i1 1 +i1 1 +i1 1 +i1
catanhl 1+ i1 - - - 1 +i1
catanhf128 - - - - -
cbrtf 1 1 1 1 1
cbrt 4 4 4 4 4
cbrtl 1 - - - 1
cbrtf128 - - - - -
cbrt advsimdf 1 - - - -
cbrt advsimd 1 - - - -
cbrt advsimdl - - - - -
cbrt advsimdf128
- - - - -
cbrt svef 1 - - - -
cbrt sve 1 - - - -
cbrt svel - - - - -
cbrt svef128 - - - - -
ccosf 1+ i1 3 +i3 1 +i1 1 +i1 1 +i1
ccos 1+ i1 3 +i3 1 +i1 1 +i1 1 +i1
ccosl 1+ i1 - - - 1 +i1
ccosf128 - - - - -
ccoshf 1+ i1 3 +i3 1 +i1 1 +i1 1 +i1
ccosh 1+ i1 3 +i3 1 +i1 1 +i1 1 +i1
Chapter 19: Mathematics 574
ccoshl 1+ i1 - - - 1 +i1
ccoshf128 - - - - -
cexpf 1+ i2 3 +i3 1 +i2 1 +i2 1 +i2
cexp 2+ i1 4 +i4 2 +i1 2 +i1 2 +i1
cexpl 1+ i1 - - - 1 +i1
cexpf128 - - - - -
clogf 3+ i1 4 +i2 3 +i1 3 +i1 3 +i1
clog 3+ i1 5 +i7 3 +i1 3 +i1 3 +i1
clogl 2+ i1 - - - 2 +i1
clogf128 - - - - -
clog10f 4+ i2 5 +i4 4 +i2 4 +i2 4 +i2
clog10 3+ i2 6 +i8 3 +i2 3 +i2 3 +i2
clog10l 2+ i2 - - - 2 +i2
clog10f128 - - - - -
cosf 1 1 1 1 1
cos 1 4 1 1 1
cosl 2 - - - 2
cosf128 - - - - -
cos advsimdf 1 - - - -
cos advsimd 2 - - - -
cos advsimdl - - - - -
cos advsimdf128
- - - - -
cos svef 1 - - - -
cos sve 1 - - - -
cos svel - - - - -
cos svef128 - - - - -
coshf 2 3 2 2 2
cosh 2 3 2 2 2
coshl 2 - - - 2
coshf128 - - - - -
cosh advsimdf 2 - - - -
cosh advsimd 2 - - - -
cosh advsimdl - - - - -
cosh advsimdf128
- - - - -
cosh svef 2 - - - -
cosh sve 2 - - - -
cosh svel - - - - -
cosh svef128 - - - - -
cpowf 5+ i2 8 +i6 5 +i2 5 +i2 5 +i2
cpow 2+ i0 9 +i8 2 +i0 2 +i0 2 +i0
cpowl 4+ i1 - - - 4 +i1
cpowf128 - - - - -
csinf 1+ i0 3 +i3 1 +i0 1 +i0 1 +i0
csin 1+ i0 3 +i3 1 +i0 1 +i0 1 +i0
csinl 1+ i1 - - - 1 +i1
csinf128 - - - - -
csinhf 1+ i1 3 +i3 1 +i1 1 +i1 1 +i1
Chapter 19: Mathematics 575
exp10f 1 1 1 1 1
exp10 2 4 2 2 2
exp10l 2 - - - 2
exp10f128 - - - - -
exp10 advsimdf2 - - - -
exp10 advsimd1 - - - -
exp10 advsimdl- - - - -
exp10 advsimdf128
- - - - -
exp10 svef 1 - - - -
exp10 sve 1 - - - -
exp10 svel - - - - -
exp10 svef128 - - - - -
exp10m1f 1 - - 1 -
exp10m1 2 - - 2 -
exp10m1l 1 - - - 1
exp10m1f128 - - - - -
exp2f 1 1 - 1 1
exp2 1 1 1 1 1
exp2l 1 - - - 1
exp2f128 - - - - -
exp2 advsimdf 1 - - - -
exp2 advsimd 1 - - - -
exp2 advsimdl - - - - -
exp2 advsimdf128
- - - - -
exp2 svef 1 - - - -
exp2 sve 1 - - - -
exp2 svel - - - - -
exp2 svef128 - - - - -
exp2m1f 1 - - 1 -
exp2m1 1 - - 1 -
exp2m1l 1 - - - 1
exp2m1f128 - - - - -
exp advsimdf 1 - - - -
exp advsimd 1 - - - -
exp advsimdl - - - - -
exp advsimdf128
- - - - -
exp svef 1 - - - -
exp sve 1 - - - -
exp svel - - - - -
exp svef128 - - - - -
expm1f 1 2 1 1 1
expm1 1 2 1 1 1
expm1l 2 - - - 2
expm1f128 - - - - -
expm1 advsimdf1 - - - -
expm1 advsimd2 - - - -
expm1 advsimdl- - - - -
Chapter 19: Mathematics 577
expm1 advsimdf128
- - - - -
expm1 svef 1 - - - -
expm1 sve 2 - - - -
expm1 svel - - - - -
expm1 svef128 - - - - -
fmaf - - - - -
fma - - - - -
fmal - - - - -
fmaf128 - - - - -
fma ldoublef - - - - -
fma ldouble - - - - -
fma ldoublel - - - - -
fma ldoublef128- - - - -
fmodf - - - - -
fmod - - - - -
fmodl - - - - -
fmodf128 - - - - -
gammaf 4 6 7 7 7
gamma 3 7 4 4 4
gammal 5 - - - 5
gammaf128 - - - - -
hypotf 1 1 - 1 -
hypot 1 2 1 1 1
hypotl 1 - - - 1
hypotf128 - - - - -
hypot advsimdf1 - - - -
hypot advsimd1 - - - -
hypot advsimdl- - - - -
hypot advsimdf128
- - - - -
hypot svef 1 - - - -
hypot sve 1 - - - -
hypot svel - - - - -
hypot svef128 - - - - -
j0f 9 9 9 9 9
j0 3 4 2 2 2
j0l 2 - - - 2
j0f128 - - - - -
j1f 9 9 9 9 9
j1 4 5 4 4 4
j1l 4 - - - 4
j1f128 - - - - -
jnf 4 8 4 4 4
jn 4 9 4 4 4
jnl 7 - - - 7
jnf128 - - - - -
lgammaf 4 6 7 7 7
lgamma 3 7 4 4 4
Chapter 19: Mathematics 578
lgammal 5 - - - 5
lgammaf128 - - - - -
logf 1 1 - 1 1
log 1 1 - - -
logl 1 - - - 1
logf128 - - - - -
log10f 2 3 2 2 2
log10 2 2 2 2 2
log10l 2 - - - 2
log10f128 - - - - -
log10 advsimdf2 - - - -
log10 advsimd 1 - - - -
log10 advsimdl- - - - -
log10 advsimdf128
- - - - -
log10 svef 2 - - - -
log10 sve 1 - - - -
log10 svel - - - - -
log10 svef128 - - - - -
log10p1f 1 - - 1 -
log10p1 1 - - 1 -
log10p1l 3 - - - 3
log10p1f128 - - - - -
log1pf 1 1 1 1 1
log1p 1 1 1 1 1
log1pl 3 - - - 3
log1pf128 - - - - -
log1p advsimdf1 - - - -
log1p advsimd 1 - - - -
log1p advsimdl- - - - -
log1p advsimdf128
- - - - -
log1p svef 1 - - - -
log1p sve 1 - - - -
log1p svel - - - - -
log1p svef128 - - - - -
log2f 1 1 1 1 1
log2 1 2 2 2 2
log2l 3 - - - 3
log2f128 - - - - -
log2 advsimdf 2 - - - -
log2 advsimd 1 - - - -
log2 advsimdl - - - - -
log2 advsimdf128
- - - - -
log2 svef 2 - - - -
log2 sve 1 - - - -
log2 svel - - - - -
log2 svef128 - - - - -
log2p1f 1 - - 1 -
Chapter 19: Mathematics 579
log2p1 1 - - 1 -
log2p1l 3 - - - 3
log2p1f128 - - - - -
log advsimdf 3 - - - -
log advsimd 1 - - - -
log advsimdl - - - - -
log advsimdf128- - - - -
log svef 3 - - - -
log sve 1 - - - -
log svel - - - - -
log svef128 - - - - -
logp1f 1 1 1 1 1
logp1 1 1 1 1 1
logp1l 3 - - - 3
logp1f128 - - - - -
mul ldoublef - - - - -
mul ldouble - - - - -
mul ldoublel - - - - -
mul ldoublef128- - - - -
powf 1 1 - 1 1
pow 1 1 1 1 1
powl 2 - - - 2
powf128 - - - - -
pow10f - - - - -
pow10 - - - - -
pow10l - - - - -
pow10f128 - - - - -
pow advsimdf 2 - - - -
pow advsimd 1 - - - -
pow advsimdl - - - - -
pow advsimdf128- - - - -
pow svef 2 - - - -
pow sve 1 - - - -
pow svel - - - - -
pow svef128 - - - - -
sinf 1 1 1 1 1
sin 1 7 1 1 1
sinl 2 - - - 2
sinf128 - - - - -
sin advsimdf 1 - - - -
sin advsimd 2 - - - -
sin advsimdl - - - - -
sin advsimdf128- - - - -
sin svef 1 - - - -
sin sve 2 - - - -
sin svel - - - - -
sin svef128 - - - - -
Chapter 19: Mathematics 580
sincosf 1 1 1 1 1
sincos 1 1 1 1 1
sincosl 1 - - - 1
sincosf128 - - - - -
sinhf 2 3 2 2 2
sinh 2 3 2 2 2
sinhl 2 - - - 2
sinhf128 - - - - -
sinh advsimdf 1 - - - -
sinh advsimd 2 - - - -
sinh advsimdl - - - - -
sinh advsimdf128- - - - -
sinh svef 1 - - - -
sinh sve 2 - - - -
sinh svel - - - - -
sinh svef128 - - - - -
sqrtf - - - - -
sqrt - - - - -
sqrtl - - - - -
sqrtf128 - - - - -
sqrt ldoublef - - - - -
sqrt ldouble - - - - -
sqrt ldoublel - - - - -
sqrt ldoublef128- - - - -
sub ldoublef - - - - -
sub ldouble - - - - -
sub ldoublel - - - - -
sub ldoublef128- - - - -
tanf 1 1 1 1 1
tan - 1 - - -
tanl 1 - - - 1
tanf128 - - - - -
tan advsimdf 2 - - - -
tan advsimd 2 - - - -
tan advsimdl - - - - -
tan advsimdf128 - - - - -
tan svef 2 - - - -
tan sve 2 - - - -
tan svel - - - - -
tan svef128 - - - - -
tanhf 2 2 2 2 2
tanh 2 3 2 2 2
tanhl 2 - - - 2
tanhf128 - - - - -
tanh advsimdf 2 - - - -
tanh advsimd 2 - - - -
tanh advsimdl - - - - -
Chapter 19: Mathematics 581
tanh advsimdf128
- - - - -
tanh svef 2 - - - -
tanh sve 2 - - - -
tanh svel - - - - -
tanh svef128 - - - - -
tgammaf 8 9 8 8 8
tgamma 9 9 9 9 9
tgammal 4 - - - 4
tgammaf128 - - - - -
y0f 8 8 9 9 9
y0 2 3 3 3 3
y0l 3 - - - 3
y0f128 - - - - -
y1f 9 9 9 9 9
y1 3 7 3 3 3
y1l 5 - - - 5
y1f128 - - - - -
ynf 3 9 3 3 3
yn 3 9 3 3 3
ynl 5 - - - 5
ynf128 - - - - -
acosh svef128 - - - - -
add ldoublef - - - - -
add ldouble - - - - -
add ldoublel - - - - -
add ldoublef128- - - - -
asinf 1 1 - - 1
asin - - - - 1
asinl - - - - -
asinf128 - - - - -
asin advsimdf - - - - -
asin advsimd - - - - -
asin advsimdl - - - - -
asin advsimdf128
- - - - -
asin svef - - - - -
asin sve - - - - -
asin svel - - - - -
asin svef128 - - - - -
asinhf 2 2 - - 2
asinh 2 2 - - 2
asinhl - - - - -
asinhf128 - - - - -
asinh advsimdf- - - - -
asinh advsimd - - - - -
asinh advsimdl- - - - -
asinh advsimdf128
- - - - -
asinh svef - - - - -
asinh sve - - - - -
asinh svel - - - - -
asinh svef128 - - - - -
atanf 1 1 - - 1
atan - - - - 1
atanl - - - - -
atanf128 - - - - -
atan2f 1 1 1 - 2
atan2 - - - - -
atan2l - - - - -
atan2f128 - - - - -
atan2 advsimdf- - - - -
atan2 advsimd - - - - -
atan2 advsimdl- - - - -
atan2 advsimdf128
- - - - -
atan2 svef - - - - -
atan2 sve - - - - -
atan2 svel - - - - -
atan2 svef128 - - - - -
atan advsimdf - - - - -
atan advsimd - - - - -
Chapter 19: Mathematics 583
atan advsimdl - - - - -
atan advsimdf128
- - - - -
atan svef - - - - -
atan sve - - - - -
atan svel - - - - -
atan svef128 - - - - -
atanhf 2 2 1 - 2
atanh 2 2 - - 2
atanhl - - - - -
atanhf128 - - - - -
atanh advsimdf- - - - -
atanh advsimd- - - - -
atanh advsimdl- - - - -
atanh advsimdf128
- - - - -
atanh svef - - - - -
atanh sve - - - - -
atanh svel - - - - -
atanh svef128 - - - - -
cabsf - - - - -
cabs 1 1 - - 1
cabsl - - - - -
cabsf128 - - - - -
cacosf 2+i 2 2 +i2 - - 2 +i2
cacos 1+i 2 1 +i2 - - 1 +i2
cacosl - - - - -
cacosf128 - - - - -
cacoshf 2+i 2 2 +i2 0 +i1 - 2 +i2
cacosh 2+i 1 2 +i1 - - 2 +i1
cacoshl - - - - -
cacoshf128 - - - - -
cargf 1 1 - - 1
carg - - - - -
cargl - - - - -
cargf128 - - - - -
casinf 1+i 2 1 +i2 1 +i0 - 1 +i2
casin 1+i 2 1 +i2 1 +i0 - 1 +i2
casinl - - - - 1 +i0
casinf128 - - - - -
casinhf 2+i 1 2 +i1 1 +i6 - 2 +i1
casinh 2+i 1 2 +i1 5 +i3 - 5 +i3
casinhl - - - - 5 +i3
casinhf128 - - - - -
catanf 1+i 1 1 +i1 0 +i1 - 1 +i1
catan 1+i 1 1 +i1 0 +i1 - 1 +i1
catanl - - - - 0 +i1
catanf128 - - - - -
catanhf 1+i 1 1 +i1 - - 1 +i1
Chapter 19: Mathematics 584
coshf 2 2 - - 2
cosh 2 2 - - 2
coshl - - - - -
coshf128 - - - - -
cosh advsimdf - - - - -
cosh advsimd - - - - -
cosh advsimdl - - - - -
cosh advsimdf128
- - - - -
cosh svef - - - - -
cosh sve - - - - -
cosh svel - - - - -
cosh svef128 - - - - -
cpowf 5+ i2 5 +i2 4 +i2 - 5 +i2
cpow 2+ i0 2 +i0 2 +i2 - 2 +i2
cpowl - - - - 2 +i2
cpowf128 - - - - -
csinf 1+ i0 1 +i0 - - 1 +i0
csin 1+ i0 1 +i0 - - 1 +i0
csinl - - - - -
csinf128 - - - - -
csinhf 1+ i1 1 +i1 1 +i1 - 1 +i1
csinh 0+ i1 0 +i1 0 +i1 - 0 +i1
csinhl - - - - 0 +i1
csinhf128 - - - - -
csqrtf 2+ i2 2 +i2 1 +i0 - 2 +i2
csqrt 2+ i2 2 +i2 - - 2 +i2
csqrtl - - - - -
csqrtf128 - - - - -
ctanf 1+ i2 1 +i2 - - 1 +i2
ctan 1+ i2 1 +i2 0 +i1 - 1 +i2
ctanl - - - - 0 +i1
ctanf128 - - - - -
ctanhf 2+ i2 2 +i2 2 +i1 - 2 +i2
ctanh 2+ i2 2 +i2 1 +i0 - 2 +i2
ctanhl - - - - 1 +i0
ctanhf128 - - - - -
div ldoublef - - - - -
div ldouble - - - - -
div ldoublel - - - - -
div ldoublef128- - - - -
erff 1 1 - - 1
erf 1 1 1 - 1
erfl - - - - 1
erff128 - - - - -
erf advsimdf - - - - -
erf advsimd - - - - -
erf advsimdl - - - - -
Chapter 19: Mathematics 586
erf advsimdf128- - - - -
erf svef - - - - -
erf sve - - - - -
erf svel - - - - -
erf svef128 - - - - -
erfcf 3 3 - - 3
erfc 5 5 1 - 5
erfcl - - - - 1
erfcf128 - - - - -
erfc advsimdf - - - - -
erfc advsimd - - - - -
erfc advsimdl - - - - -
erfc advsimdf128
- - - - -
erfc svef - - - - -
erfc sve - - - - -
erfc svel - - - - -
erfc svef128 - - - - -
expf 1 1 - - 1
exp 1 1 - - 1
expl - - - - -
expf128 - - - - -
exp10f - - 2 - 2
exp10 2 2 6 - 6
exp10l - - - - 6
exp10f128 - - - - -
exp10 advsimdf- - - - -
exp10 advsimd- - - - -
exp10 advsimdl- - - - -
exp10 advsimdf128
- - - - -
exp10 svef - - - - -
exp10 sve - - - - -
exp10 svel - - - - -
exp10 svef128 - - - - -
exp10m1f - - - - 1
exp10m1 - - - - 2
exp10m1l - - - - -
exp10m1f128 - - - - -
exp2f - 1 - - 1
exp2 1 1 - - 1
exp2l - - - - -
exp2f128 - - - - -
exp2 advsimdf - - - - -
exp2 advsimd - - - - -
exp2 advsimdl - - - - -
exp2 advsimdf128
- - - - -
exp2 svef - - - - -
exp2 sve - - - - -
Chapter 19: Mathematics 587
exp2 svel - - - - -
exp2 svef128 - - - - -
exp2m1f - - - - 1
exp2m1 - - - - 1
exp2m1l - - - - -
exp2m1f128 - - - - -
exp advsimdf - - - - -
exp advsimd - - - - -
exp advsimdl - - - - -
exp advsimdf128- - - - -
exp svef - - - - -
exp sve - - - - -
exp svel - - - - -
exp svef128 - - - - -
expm1f 1 1 1 - 1
expm1 1 1 1 - 1
expm1l - - - - 1
expm1f128 - - - - -
expm1 advsimdf - - - - -
expm1 advsimd- - - - -
expm1 advsimdl - - - - -
expm1 advsimdf128
- - - - -
expm1 svef - - - - -
expm1 sve - - - - -
expm1 svel - - - - -
expm1 svef128 - - - - -
fmaf - - - - -
fma - - - - -
fmal - - - - -
fmaf128 - - - - -
fma ldoublef - - - - -
fma ldouble - - - - -
fma ldoublel - - - - -
fma ldoublef128- - - - -
fmodf - - - - -
fmod - - - - -
fmodl - - - - -
fmodf128 - - - - -
gammaf 7 7 - - 7
gamma 4 4 - - 4
gammal - - - - -
gammaf128 - - - - -
hypotf - - 1 - 1
hypot 1 1 - - 1
hypotl - - - - -
hypotf128 - - - - -
hypot advsimdf- - - - -
Chapter 19: Mathematics 588
hypot advsimd- - - - -
hypot advsimdl- - - - -
hypot advsimdf128
- - - - -
hypot svef - - - - -
hypot sve - - - - -
hypot svel - - - - -
hypot svef128 - - - - -
j0f 8 8 2 - 9
j0 2 2 2 - 2
j0l - - - - 2
j0f128 - - - - -
j1f 9 9 2 - 9
j1 2 2 1 - 4
j1l - - - - 1
j1f128 - - - - -
jnf 4 4 4 - 5
jn 4 4 4 - 4
jnl - - - - 4
jnf128 - - - - -
lgammaf 7 7 2 - 7
lgamma 4 4 1 - 4
lgammal - - - - 1
lgammaf128 - - - - -
logf - 1 - - 1
log - - - - -
logl - - - - -
logf128 - - - - -
log10f 2 2 2 - 2
log10 2 2 1 - 2
log10l - - - - 1
log10f128 - - - - -
log10 advsimdf- - - - -
log10 advsimd - - - - -
log10 advsimdl- - - - -
log10 advsimdf128
- - - - -
log10 svef - - - - -
log10 sve - - - - -
log10 svel - - - - -
log10 svef128 - - - - -
log10p1f - - - - 1
log10p1 - - - - 1
log10p1l - - - - -
log10p1f128 - - - - -
log1pf 1 1 1 - 1
log1p 1 1 - - 1
log1pl - - - - -
log1pf128 - - - - -
Chapter 19: Mathematics 589
log1p advsimdf- - - - -
log1p advsimd - - - - -
log1p advsimdl- - - - -
log1p advsimdf128
- - - - -
log1p svef - - - - -
log1p sve - - - - -
log1p svel - - - - -
log1p svef128 - - - - -
log2f 1 1 - - 1
log2 2 2 - - 2
log2l - - - - -
log2f128 - - - - -
log2 advsimdf - - - - -
log2 advsimd - - - - -
log2 advsimdl - - - - -
log2 advsimdf128
- - - - -
log2 svef - - - - -
log2 sve - - - - -
log2 svel - - - - -
log2 svef128 - - - - -
log2p1f - - - - 1
log2p1 - - - - 1
log2p1l - - - - -
log2p1f128 - - - - -
log advsimdf - - - - -
log advsimd - - - - -
log advsimdl - - - - -
log advsimdf128- - - - -
log svef - - - - -
log sve - - - - -
log svel - - - - -
log svef128 - - - - -
logp1f 1 1 1 - 1
logp1 1 1 - - 1
logp1l - - - - -
logp1f128 - - - - -
mul ldoublef - - - - -
mul ldouble - - - - -
mul ldoublel - - - - -
mul ldoublef128- - - - -
powf - 1 - - 1
pow 1 1 - - 1
powl - - - - -
powf128 - - - - -
pow10f - - - - -
pow10 - 2 - - -
pow10l - - - - -
Chapter 19: Mathematics 590
pow10f128 - - - - -
pow advsimdf - - - - -
pow advsimd - - - - -
pow advsimdl - - - - -
pow advsimdf128 - - - - -
pow svef - - - - -
pow sve - - - - -
pow svel - - - - -
pow svef128 - - - - -
sinf 1 1 - - 1
sin 1 1 - - 1
sinl - - - - -
sinf128 - - - - -
sin advsimdf - - - - -
sin advsimd - - - - -
sin advsimdl - - - - -
sin advsimdf128- - - - -
sin svef - - - - -
sin sve - - - - -
sin svel - - - - -
sin svef128 - - - - -
sincosf - 1 1 - 1
sincos 1 1 1 - 1
sincosl - - - - 1
sincosf128 - - - - -
sinhf 2 2 - - 2
sinh 2 2 - - 2
sinhl - - - - -
sinhf128 - - - - -
sinh advsimdf - - - - -
sinh advsimd - - - - -
sinh advsimdl - - - - -
sinh advsimdf128- - - - -
sinh svef - - - - -
sinh sve - - - - -
sinh svel - - - - -
sinh svef128 - - - - -
sqrtf - - - - -
sqrt - - - - -
sqrtl - - - - -
sqrtf128 - - - - -
sqrt ldoublef - - - - -
sqrt ldouble - - - - -
sqrt ldoublel - - - - -
sqrt ldoublef128- - - - -
sub ldoublef - - - - -
sub ldouble - - - - -
Chapter 19: Mathematics 591
sub ldoublel - - - - -
sub ldoublef128- - - - -
tanf 1 1 - - 1
tan - - 1 - 1
tanl - - - - 1
tanf128 - - - - -
tan advsimdf - - - - -
tan advsimd - - - - -
tan advsimdl - - - - -
tan advsimdf128- - - - -
tan svef - - - - -
tan sve - - - - -
tan svel - - - - -
tan svef128 - - - - -
tanhf 2 2 - - 2
tanh 2 2 - - 2
tanhl - - - - -
tanhf128 - - - - -
tanh advsimdf - - - - -
tanh advsimd - - - - -
tanh advsimdl - - - - -
tanh advsimdf128
- - - - -
tanh svef - - - - -
tanh sve - - - - -
tanh svel - - - - -
tanh svef128 - - - - -
tgammaf 8 8 1 - 8
tgamma 9 9 1 - 9
tgammal - - - - 1
tgammaf128 - - - - -
y0f 8 8 1 - 9
y0 3 3 2 - 3
y0l - - - - 2
y0f128 - - - - -
y1f 2 2 2 - 9
y1 3 3 3 - 3
y1l - - - - 3
y1f128 - - - - -
ynf 3 3 2 - 3
yn 3 3 3 - 3
ynl - - - - 3
ynf128 - - - - -
acosl 1 - - 1 -
acosf128 - - - - -
acos advsimdf - - - - -
acos advsimd - - - - -
acos advsimdl - - - - -
acos advsimdf128
- - - - -
acos svef - - - - -
acos sve - - - - -
acos svel - - - - -
acos svef128 - - - - -
acoshf 2 1 2 2 2
acosh 2 1 2 2 2
acoshl 4 1 - 4 -
acoshf128 - - - - -
acosh advsimdf- - - - -
acosh advsimd - - - - -
acosh advsimdl- - - - -
acosh advsimdf128
- - - - -
acosh svef - - - - -
acosh sve - - - - -
acosh svel - - - - -
acosh svef128 - - - - -
add ldoublef - - - - -
add ldouble - - - - -
add ldoublel - - - - -
add ldoublef128- - - - -
asinf 1 - 1 1 1
asin 1 1 1 1 -
asinl 1 - - 1 -
asinf128 - - - - -
asin advsimdf - - - - -
asin advsimd - - - - -
asin advsimdl - - - - -
asin advsimdf128
- - - - -
asin svef - - - - -
asin sve - - - - -
asin svel - - - - -
asin svef128 - - - - -
asinhf 2 1 2 2 1
asinh 2 1 2 2 1
asinhl 4 1 - 4 -
asinhf128 - - - - -
asinh advsimdf- - - - -
asinh advsimd - - - - -
asinh advsimdl- - - - -
asinh advsimdf128
- - - - -
asinh svef - - - - -
Chapter 19: Mathematics 593
asinh sve - - - - -
asinh svel - - - - -
asinh svef128 - - - - -
atanf 1 - 1 1 1
atan 1 - 1 1 -
atanl 1 - - 1 -
atanf128 - - - - -
atan2f 2 1 2 2 1
atan2 - 1 - - -
atan2l 2 1 - 2 -
atan2f128 - - - - -
atan2 advsimdf- - - - -
atan2 advsimd - - - - -
atan2 advsimdl- - - - -
atan2 advsimdf128
- - - - -
atan2 svef - - - - -
atan2 sve - - - - -
atan2 svel - - - - -
atan2 svef128 - - - - -
atan advsimdf - - - - -
atan advsimd - - - - -
atan advsimdl - - - - -
atan advsimdf128
- - - - -
atan svef - - - - -
atan sve - - - - -
atan svel - - - - -
atan svef128 - - - - -
atanhf 2 - 2 2 2
atanh 2 1 2 2 2
atanhl 4 - - 4 -
atanhf128 - - - - -
atanh advsimdf- - - - -
atanh advsimd- - - - -
atanh advsimdl- - - - -
atanh advsimdf128
- - - - -
atanh svef - - - - -
atanh sve - - - - -
atanh svel - - - - -
atanh svef128 - - - - -
cabsf - - - - -
cabs 1 1 1 1 1
cabsl 1 1 - 1 -
cabsf128 - - - - -
cacosf 2+i2 2+i1 2+i2 2+i2 2+i2
cacos 1+i2 1+i1 1+i2 1+i2 1+i2
cacosl 2+i2 1+i2 - 2+i2 -
cacosf128 - - - - -
Chapter 19: Mathematics 594
cexpf128 - - - - -
clogf 3+ i1 3 +i1 3 +i1 3 +i1 3 +i1
clog 3+ i1 3 +i1 3 +i1 3 +i1 3 +i0
clogl 2+ i1 3 +i1 - 2 +i1 -
clogf128 - - - - -
clog10f 4+ i2 3 +i2 4 +i2 4 +i2 4 +i2
clog10 3+ i2 2 +i1 3 +i2 3 +i2 3 +i2
clog10l 2+ i2 3 +i2 - 2 +i2 -
clog10f128 - - - - -
cosf 1 6 1 1 1
cos 1 1 1 1 -
cosl 2 - - 2 -
cosf128 - - - - -
cos advsimdf - - - - -
cos advsimd - - - - -
cos advsimdl - - - - -
cos advsimdf128
- - - - -
cos svef - - - - -
cos sve - - - - -
cos svel - - - - -
cos svef128 - - - - -
coshf 2 - 2 2 1
cosh 2 1 2 2 1
coshl 2 - - 2 -
coshf128 - - - - -
cosh advsimdf - - - - -
cosh advsimd - - - - -
cosh advsimdl - - - - -
cosh advsimdf128
- - - - -
cosh svef - - - - -
cosh sve - - - - -
cosh svel - - - - -
cosh svef128 - - - - -
cpowf 5+ i2 3 +i5 5 +i2 5 +i2 4 +i2
cpow 2+ i0 1 +i0 2 +i0 2 +i0 2 +i0
cpowl 4+ i1 3 +i1 - 4 +i1 -
cpowf128 - - - - -
csinf 1+ i0 1 +i1 1 +i0 1 +i0 1 +i0
csin 1+ i0 - 1 +i0 1 +i0 1 +i0
csinl 1+ i1 1 +i0 - 1 +i1 -
csinf128 - - - - -
csinhf 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
csinh 0+ i1 - 0 +i1 0 +i1 0 +i1
csinhl 1+ i1 1 +i0 - 1 +i1 -
csinhf128 - - - - -
csqrtf 2+ i2 2 +i2 2 +i2 2 +i2 2 +i2
csqrt 2+ i2 1 +i1 2 +i2 2 +i2 2 +i2
Chapter 19: Mathematics 596
exp10 advsimd- - - - -
exp10 advsimdl- - - - -
exp10 advsimdf128
- - - - -
exp10 svef - - - - -
exp10 sve - - - - -
exp10 svel - - - - -
exp10 svef128 - - - - -
exp10m1f 1 1 1 1 -
exp10m1 2 1 2 2 -
exp10m1l 1 - - 1 -
exp10m1f128 - - - - -
exp2f - - 1 1 1
exp2 1 1 1 1 1
exp2l 1 - - 1 -
exp2f128 - - - - -
exp2 advsimdf - - - - -
exp2 advsimd - - - - -
exp2 advsimdl - - - - -
exp2 advsimdf128
- - - - -
exp2 svef - - - - -
exp2 sve - - - - -
exp2 svel - - - - -
exp2 svef128 - - - - -
exp2m1f 1 1 1 1 -
exp2m1 1 1 1 1 -
exp2m1l 1 - - 1 -
exp2m1f128 - - - - -
exp advsimdf - - - - -
exp advsimd - - - - -
exp advsimdl - - - - -
exp advsimdf128
- - - - -
exp svef - - - - -
exp sve - - - - -
exp svel - - - - -
exp svef128 - - - - -
expm1f 1 - 1 1 1
expm1 1 1 1 1 1
expm1l 2 - - 2 -
expm1f128 - - - - -
expm1 advsimdf- - - - -
expm1 advsimd- - - - -
expm1 advsimdl- - - - -
expm1 advsimdf128
- - - - -
expm1 svef - - - - -
expm1 sve - - - - -
expm1 svel - - - - -
expm1 svef128 - - - - -
Chapter 19: Mathematics 598
fmaf - - - - -
fma - - - - -
fmal - - - - -
fmaf128 - - - - -
fma ldoublef - - - - -
fma ldouble - - - - -
fma ldoublel - - - - -
fma ldoublef128- - - - -
fmodf - - - - -
fmod - - - - -
fmodl - - - - -
fmodf128 - - - - -
gammaf 7 7 7 7 4
gamma 4 3 4 4 4
gammal 5 2 - 5 -
gammaf128 - - - - -
hypotf 1 - 1 1 -
hypot 1 1 1 1 1
hypotl 1 1 - 1 -
hypotf128 - - - - -
hypot advsimdf- - - - -
hypot advsimd- - - - -
hypot advsimdl- - - - -
hypot advsimdf128
- - - - -
hypot svef - - - - -
hypot sve - - - - -
hypot svel - - - - -
hypot svef128 - - - - -
j0f 9 8 9 9 2
j0 3 8 2 3 2
j0l 2 2 - 2 -
j0f128 - - - - -
j1f 9 7 9 9 2
j1 4 3 4 4 1
j1l 4 1 - 4 -
j1f128 - - - - -
jnf 4 5 4 4 4
jn 4 2 4 4 4
jnl 7 4 - 7 -
jnf128 - - - - -
lgammaf 7 7 7 7 4
lgamma 4 3 4 4 4
lgammal 5 2 - 5 -
lgammaf128 - - - - -
logf - - 1 1 1
log 1 - - 1 -
logl 1 - - 1 -
Chapter 19: Mathematics 599
logf128 - - - - -
log10f 2 - 2 2 2
log10 2 - 2 2 2
log10l 2 - - 2 -
log10f128 - - - - -
log10 advsimdf- - - - -
log10 advsimd - - - - -
log10 advsimdl- - - - -
log10 advsimdf128
- - - - -
log10 svef - - - - -
log10 sve - - - - -
log10 svel - - - - -
log10 svef128 - - - - -
log10p1f 1 2 1 1 -
log10p1 1 1 1 1 -
log10p1l 3 - - 3 -
log10p1f128 - - - - -
log1pf 1 - 1 1 1
log1p 1 1 1 1 1
log1pl 3 - - 3 -
log1pf128 - - - - -
log1p advsimdf- - - - -
log1p advsimd - - - - -
log1p advsimdl- - - - -
log1p advsimdf128
- - - - -
log1p svef - - - - -
log1p sve - - - - -
log1p svel - - - - -
log1p svef128 - - - - -
log2f 1 - 1 1 1
log2 1 1 2 2 2
log2l 3 - - 3 -
log2f128 - - - - -
log2 advsimdf - - - - -
log2 advsimd - - - - -
log2 advsimdl - - - - -
log2 advsimdf128
- - - - -
log2 svef - - - - -
log2 sve - - - - -
log2 svel - - - - -
log2 svef128 - - - - -
log2p1f 1 2 1 1 -
log2p1 1 1 1 1 -
log2p1l 3 - 1 3 -
log2p1f128 - - - - -
log advsimdf - - - - -
log advsimd - - - - -
Chapter 19: Mathematics 600
log advsimdl - - - - -
log advsimdf128- - - - -
log svef - - - - -
log sve - - - - -
log svel - - - - -
log svef128 - - - - -
logp1f 1 - 1 1 1
logp1 1 1 1 1 1
logp1l 3 - - 3 -
logp1f128 - - - - -
mul ldoublef - - - - -
mul ldouble - - - - -
mul ldoublel - - - - -
mul ldoublef128- - - - -
powf - 7 1 1 1
pow 1 1 1 1 -
powl 2 9 - 2 -
powf128 - - - - -
pow10f - - - - -
pow10 - - - - -
pow10l - - - - -
pow10f128 - - - - -
pow advsimdf - - - - -
pow advsimd - - - - -
pow advsimdl - - - - -
pow advsimdf128- - - - -
pow svef - - - - -
pow sve - - - - -
pow svel - - - - -
pow svef128 - - - - -
sinf 1 - 1 1 1
sin 1 1 1 1 -
sinl 2 - - 2 -
sinf128 - - - - -
sin advsimdf - - - - -
sin advsimd - - - - -
sin advsimdl - - - - -
sin advsimdf128- - - - -
sin svef - - - - -
sin sve - - - - -
sin svel - - - - -
sin svef128 - - - - -
sincosf - - 1 1 1
sincos 1 - 1 1 -
sincosl 1 - - 1 -
sincosf128 - - - - -
sinhf 2 - 2 2 2
Chapter 19: Mathematics 601
sinh 2 - 2 2 2
sinhl 2 - - 2 -
sinhf128 - - - - -
sinh advsimdf - - - - -
sinh advsimd - - - - -
sinh advsimdl - - - - -
sinh advsimdf128- - - - -
sinh svef - - - - -
sinh sve - - - - -
sinh svel - - - - -
sinh svef128 - - - - -
sqrtf - - - - -
sqrt - - - - -
sqrtl - - - - -
sqrtf128 - - - - -
sqrt ldoublef - - - - -
sqrt ldouble - - - - -
sqrt ldoublel - - - - -
sqrt ldoublef128- - - - -
sub ldoublef - - - - -
sub ldouble - - - - -
sub ldoublel - - - - -
sub ldoublef128- - - - -
tanf 1 - 1 1 1
tan 1 - - - -
tanl 1 - - 1 -
tanf128 - - - - -
tan advsimdf - - - - -
tan advsimd - - - - -
tan advsimdl - - - - -
tan advsimdf128 - - - - -
tan svef - - - - -
tan sve - - - - -
tan svel - - - - -
tan svef128 - - - - -
tanhf 2 - 2 2 2
tanh 2 1 2 2 2
tanhl 2 - - 2 -
tanhf128 - - - - -
tanh advsimdf - - - - -
tanh advsimd - - - - -
tanh advsimdl - - - - -
tanh advsimdf128- - - - -
tanh svef - - - - -
tanh sve - - - - -
tanh svel - - - - -
tanh svef128 - - - - -
Chapter 19: Mathematics 602
tgammaf 8 9 8 8 4
tgamma 9 3 9 9 5
tgammal 4 9 - 4 -
tgammaf128 - - - - -
y0f 9 4 9 9 1
y0 3 1 3 3 2
y0l 3 1 - 3 -
y0f128 - - - - -
y1f 9 4 9 9 2
y1 3 1 3 3 3
y1l 5 2 - 5 -
y1f128 - - - - -
ynf 3 3 3 3 2
yn 3 2 3 3 3
ynl 5 4 - 5 -
ynf128 - - - - -
asinf 1 1 1 1 1
asin 1 1 1 1 1
asinl - - - 2 2
asinf128 - - - 1 -
asin advsimdf - - - - -
asin advsimd - - - - -
asin advsimdl - - - - -
asin advsimdf128
- - - - -
asin svef - - - - -
asin sve - - - - -
asin svel - - - - -
asin svef128 - - - - -
asinhf 2 2 2 2 2
asinh 2 2 2 2 2
asinhl - - - 2 2
asinhf128 - - - 4 -
asinh advsimdf- - - - -
asinh advsimd - - - - -
asinh advsimdl- - - - -
asinh advsimdf128
- - - - -
asinh svef - - - - -
asinh sve - - - - -
asinh svel - - - - -
asinh svef128 - - - - -
atanf 1 1 1 1 1
atan 1 1 1 1 1
atanl - - - 1 1
atanf128 - - - 1 -
atan2f 2 2 2 1 2
atan2 - - - - -
atan2l - - - 2 2
atan2f128 - - - 2 -
atan2 advsimdf- - - - -
atan2 advsimd - - - - -
atan2 advsimdl- - - - -
atan2 advsimdf128
- - - - -
atan2 svef - - - - -
atan2 sve - - - - -
atan2 svel - - - - -
atan2 svef128 - - - - -
atan advsimdf - - - - -
atan advsimd - - - - -
atan advsimdl - - - - -
atan advsimdf128
- - - - -
atan svef - - - - -
atan sve - - - - -
atan svel - - - - -
Chapter 19: Mathematics 604
atan svef128 - - - - -
atanhf 2 2 2 2 2
atanh 2 2 2 2 2
atanhl - - - 2 2
atanhf128 - - - 4 -
atanh advsimdf- - - - -
atanh advsimd- - - - -
atanh advsimdl- - - - -
atanh advsimdf128
- - - - -
atanh svef - - - - -
atanh sve - - - - -
atanh svel - - - - -
atanh svef128 - - - - -
cabsf - - - - -
cabs 1 1 1 1 1
cabsl - - - 1 1
cabsf128 - - - 1 -
cacosf 2+i 2 2 +i2 2 +i2 2 + i 2 2 +i2
cacos 1+i 2 1 +i2 1 +i2 1 + i 2 1 +i2
cacosl - - - 1 + i 2 2 +i1
cacosf128 - - - 2 + i 2 -
cacoshf 2+i 2 2 +i2 2 +i2 2 + i 2 2 +i2
cacosh 2+i 1 2 +i1 2 +i1 2 + i 1 2 +i1
cacoshl - - - 2 + i 1 1 +i2
cacoshf128 - - - 2 + i 2 -
cargf 1 1 1 1 1
carg - - - 1 -
cargl - - - 2 2
cargf128 - - - 2 -
casinf 1+i 2 1 +i2 1 +i2 1 + i 2 1 +i2
casin 1+i 2 1 +i2 1 +i2 1 + i 2 1 +i2
casinl - - - 1 + i 2 2 +i1
casinf128 - - - 2 + i 2 -
casinhf 2+i 1 2 +i1 2 +i1 2 + i 1 2 +i1
casinh 2+i 1 2 +i1 2 +i1 2 + i 1 2 +i1
casinhl - - - 2 + i 1 1 +i2
casinhf128 - - - 2 + i 2 -
catanf 1+i 1 1 +i1 1 +i1 1 + i 1 1 +i1
catan 1+i 1 1 +i1 1 +i1 1 + i 1 1 +i1
catanl - - - 3 + i 2 3 +i2
catanf128 - - - 1 + i 1 -
catanhf 1+i 1 1 +i1 1 +i1 1 + i 1 1 +i1
catanh 1+i 1 1 +i1 1 +i1 1 + i 1 1 +i1
catanhl - - - 2 + i 3 2 +i3
catanhf128 - - - 1 + i 1 -
cbrtf 1 1 1 1 1
cbrt 4 4 4 4 4
Chapter 19: Mathematics 605
cbrtl - - - 1 1
cbrtf128 - - - 1 -
cbrt advsimdf - - - - -
cbrt advsimd - - - - -
cbrt advsimdl - - - - -
cbrt advsimdf128
- - - - -
cbrt svef - - - - -
cbrt sve - - - - -
cbrt svel - - - - -
cbrt svef128 - - - - -
ccosf 1+ i1 1 +i1 1 +i1 1 + i 1 1 +i1
ccos 1+ i1 1 +i1 1 +i1 1 + i 1 1 +i1
ccosl - - - 1 + i 2 1 +i2
ccosf128 - - - 1 + i 1 -
ccoshf 1+ i1 1 +i1 1 +i1 1 + i 1 1 +i1
ccosh 1+ i1 2 +i1 2 +i1 1 + i 1 1 +i1
ccoshl - - - 1 + i 2 1 +i2
ccoshf128 - - - 1 + i 1 -
cexpf 1+ i2 1 +i2 1 +i2 1 + i 2 1 +i2
cexp 2+ i1 2 +i1 2 +i1 2 + i 1 2 +i1
cexpl - - - 2 + i 2 1 +i1
cexpf128 - - - 1 + i 1 -
clogf 3+ i1 3 +i1 3 +i1 3 + i 1 3 +i1
clog 3+ i1 3 +i1 3 +i1 3 + i 1 3 +i1
clogl - - - 5 + i 2 2 +i2
clogf128 - - - 2 + i 1 -
clog10f 4+ i2 4 +i2 4 +i2 4 + i 2 4 +i2
clog10 3+ i2 3 +i2 3 +i2 3 + i 2 3 +i2
clog10l - - - 3 + i 2 3 +i2
clog10f128 - - - 2 + i 2 -
cosf 1 1 1 3 1
cos 1 1 1 1 1
cosl - - - 4 4
cosf128 - - - 2 -
cos advsimdf - - - - -
cos advsimd - - - - -
cos advsimdl - - - - -
cos advsimdf128
- - - - -
cos svef - - - - -
cos sve - - - - -
cos svel - - - - -
cos svef128 - - - - -
coshf 2 2 2 2 2
cosh 2 2 2 2 2
coshl - - - 3 3
coshf128 - - - 2 -
cosh advsimdf - - - - -
Chapter 19: Mathematics 606
cosh advsimd - - - - -
cosh advsimdl - - - - -
cosh advsimdf128
- - - - -
cosh svef - - - - -
cosh sve - - - - -
cosh svel - - - - -
cosh svef128 - - - - -
cpowf 5+ i2 5 +i2 5 +i2 5 + i 2 5 +i2
cpow 2+ i0 2 +i0 2 +i0 2 + i 0 2 +i0
cpowl - - - 4 + i 2 4 +i1
cpowf128 - - - 4 + i 1 -
csinf 1+ i0 1 +i0 1 +i0 1 + i 0 1 +i0
csin 1+ i0 1 +i0 1 +i0 1 + i 0 1 +i0
csinl - - - 2 + i 1 2 +i1
csinf128 - - - 1 + i 1 -
csinhf 1+ i1 1 +i1 1 +i1 1 + i 1 1 +i1
csinh 0+ i1 0 +i1 0 +i1 0 + i 1 0 +i1
csinhl - - - 1 + i 2 1 +i2
csinhf128 - - - 1 + i 1 -
csqrtf 2+ i2 2 +i2 2 +i2 2 + i 2 2 +i2
csqrt 2+ i2 2 +i2 2 +i2 2 + i 2 2 +i2
csqrtl - - - 1 + i 1 1 +i1
csqrtf128 - - - 2 + i 2 -
ctanf 1+ i2 1 +i2 1 +i2 1 + i 2 1 +i2
ctan 1+ i2 1 +i2 1 +i2 1 + i 2 1 +i2
ctanl - - - 3 + i 2 3 +i2
ctanf128 - - - 3 + i 3 -
ctanhf 2+ i2 2 +i2 2 +i2 2 + i 1 2 +i2
ctanh 2+ i2 2 +i2 2 +i2 2 + i 2 2 +i2
ctanhl - - - 3 + i 3 2 +i3
ctanhf128 - - - 3 + i 3 -
div ldoublef - - - 1 1
div ldouble - - - - -
div ldoublel - - - - -
div ldoublef128- - - - -
erff 1 1 1 1 1
erf 1 1 1 1 1
erfl - - - 1 1
erff128 - - - 1 -
erf advsimdf - - - - -
erf advsimd - - - - -
erf advsimdl - - - - -
erf advsimdf128- - - - -
erf svef - - - - -
erf sve - - - - -
erf svel - - - - -
erf svef128 - - - - -
Chapter 19: Mathematics 607
erfcf 3 3 3 2 3
erfc 5 5 5 2 5
erfcl - - - 3 3
erfcf128 - - - 4 -
erfc advsimdf - - - - -
erfc advsimd - - - - -
erfc advsimdl - - - - -
erfc advsimdf128
- - - - -
erfc svef - - - - -
erfc sve - - - - -
erfc svel - - - - -
erfc svef128 - - - - -
expf 1 1 1 1 1
exp 1 1 1 1 1
expl - - - 1 1
expf128 - - - 1 -
exp10f - 1 1 1 -
exp10 2 2 2 2 2
exp10l - - - 1 1
exp10f128 - - - 2 -
exp10 advsimdf- - - - -
exp10 advsimd- - - - -
exp10 advsimdl- - - - -
exp10 advsimdf128
- - - - -
exp10 svef - - - - -
exp10 sve - - - - -
exp10 svel - - - - -
exp10 svef128 - - - - -
exp10m1f - - - 1 1
exp10m1 - - - 2 2
exp10m1l - - - 2 3
exp10m1f128 - - - 1 -
exp2f 1 - - - 1
exp2 1 1 1 1 1
exp2l - - - 2 1
exp2f128 - - - 1 -
exp2 advsimdf - - - - -
exp2 advsimd - - - - -
exp2 advsimdl - - - - -
exp2 advsimdf128
- - - - -
exp2 svef - - - - -
exp2 sve - - - - -
exp2 svel - - - - -
exp2 svef128 - - - - -
exp2m1f - - - 1 1
exp2m1 - - - 1 1
exp2m1l - - - 2 2
Chapter 19: Mathematics 608
exp2m1f128 - - - 1 -
exp advsimdf - - - - -
exp advsimd - - - - -
exp advsimdl - - - - -
exp advsimdf128- - - - -
exp svef - - - - -
exp sve - - - - -
exp svel - - - - -
exp svef128 - - - - -
expm1f 1 1 1 1 1
expm1 1 1 1 1 1
expm1l - - - 1 1
expm1f128 - - - 2 -
expm1 advsimdf - - - - -
expm1 advsimd- - - - -
expm1 advsimdl - - - - -
expm1 advsimdf128
- - - - -
expm1 svef - - - - -
expm1 sve - - - - -
expm1 svel - - - - -
expm1 svef128 - - - - -
fmaf - - - - -
fma - - - - -
fmal - - - 1 1
fmaf128 - - - - -
fma ldoublef - - - 1 1
fma ldouble - - - 1 1
fma ldoublel - - - - -
fma ldoublef128- - - - -
fmodf - - - - -
fmod - - - - -
fmodl - - - 1 1
fmodf128 - - - - -
gammaf 7 7 7 4 7
gamma 4 4 4 3 4
gammal - - - 3 3
gammaf128 - - - 5 -
hypotf - 1 1 1 1
hypot 1 1 1 1 1
hypotl - - - 1 1
hypotf128 - - - 1 -
hypot advsimdf- - - - -
hypot advsimd- - - - -
hypot advsimdl- - - - -
hypot advsimdf128
- - - - -
hypot svef - - - - -
hypot sve - - - - -
Chapter 19: Mathematics 609
hypot svel - - - - -
hypot svef128 - - - - -
j0f 8 9 9 9 9
j0 2 2 2 3 2
j0l - - - 5 4
j0f128 - - - 7 -
j1f 9 9 9 9 9
j1 2 4 4 4 4
j1l - - - 6 10
j1f128 - - - 4 -
jnf 4 4 4 4 4
jn 4 4 4 4 4
jnl - - - 4 4
jnf128 - - - 7 -
lgammaf 7 7 7 4 7
lgamma 4 4 4 3 4
lgammal - - - 3 3
lgammaf128 - - - 5 -
logf 1 - - 1 1
log - - - 1 -
logl - - - 1 1
logf128 - - - 1 -
log10f 2 2 2 2 2
log10 2 2 2 2 2
log10l - - - 1 1
log10f128 - - - 2 -
log10 advsimdf- - - - -
log10 advsimd - - - - -
log10 advsimdl- - - - -
log10 advsimdf128
- - - - -
log10 svef - - - - -
log10 sve - - - - -
log10 svel - - - - -
log10 svef128 - - - - -
log10p1f - - - 1 1
log10p1 - - - 1 1
log10p1l - - - 3 3
log10p1f128 - - - 3 -
log1pf 1 1 1 1 1
log1p 1 1 1 1 1
log1pl - - - 2 2
log1pf128 - - - 3 -
log1p advsimdf- - - - -
log1p advsimd - - - - -
log1p advsimdl- - - - -
log1p advsimdf128
- - - - -
log1p svef - - - - -
Chapter 19: Mathematics 610
log1p sve - - - - -
log1p svel - - - - -
log1p svef128 - - - - -
log2f 1 1 1 1 1
log2 2 - - 1 2
log2l - - - 1 1
log2f128 - - - 3 -
log2 advsimdf - - - - -
log2 advsimd - - - - -
log2 advsimdl - - - - -
log2 advsimdf128
- - - - -
log2 svef - - - - -
log2 sve - - - - -
log2 svel - - - - -
log2 svef128 - - - - -
log2p1f - - - 1 1
log2p1 - - - 1 1
log2p1l - - - 2 1
log2p1f128 - - - 3 -
log advsimdf - - - - -
log advsimd - - - - -
log advsimdl - - - - -
log advsimdf128- - - - -
log svef - - - - -
log sve - - - - -
log svel - - - - -
log svef128 - - - - -
logp1f 1 1 1 1 1
logp1 1 1 1 1 1
logp1l - - - 2 2
logp1f128 - - - 3 -
mul ldoublef - - - 1 1
mul ldouble - - - 1 1
mul ldoublel - - - - -
mul ldoublef128- - - - -
powf 3 - - 1 1
pow 1 1 1 1 1
powl - - - 1 1
powf128 - - - 2 -
pow10f - - - - -
pow10 - - - - -
pow10l - - - - -
pow10f128 - - - - -
pow advsimdf - - - - -
pow advsimd - - - - -
pow advsimdl - - - - -
pow advsimdf128- - - - -
Chapter 19: Mathematics 611
pow svef - - - - -
pow sve - - - - -
pow svel - - - - -
pow svef128 - - - - -
sinf 1 1 1 1 1
sin 1 1 1 1 1
sinl - - - 1 1
sinf128 - - - 2 -
sin advsimdf - - - - -
sin advsimd - - - - -
sin advsimdl - - - - -
sin advsimdf128- - - - -
sin svef - - - - -
sin sve - - - - -
sin svel - - - - -
sin svef128 - - - - -
sincosf 1 - - 1 1
sincos 1 1 1 1 1
sincosl - - - 1 1
sincosf128 - - - 1 -
sinhf 2 2 2 2 2
sinh 2 2 2 2 2
sinhl - - - 3 3
sinhf128 - - - 2 -
sinh advsimdf - - - - -
sinh advsimd - - - - -
sinh advsimdl - - - - -
sinh advsimdf128- - - - -
sinh svef - - - - -
sinh sve - - - - -
sinh svel - - - - -
sinh svef128 - - - - -
sqrtf - - - - -
sqrt - - - - -
sqrtl - - - 1 1
sqrtf128 - - - - -
sqrt ldoublef - - - - -
sqrt ldouble - - - 1 1
sqrt ldoublel - - - - -
sqrt ldoublef128- - - - -
sub ldoublef - - - 1 1
sub ldouble - - - 1 1
sub ldoublel - - - - -
sub ldoublef128- - - - -
tanf 1 1 1 3 1
tan - - - - -
tanl - - - 2 2
Chapter 19: Mathematics 612
tanf128 - - - 1 -
tan advsimdf - - - - -
tan advsimd - - - - -
tan advsimdl - - - - -
tan advsimdf128
- - - - -
tan svef - - - - -
tan sve - - - - -
tan svel - - - - -
tan svef128 - - - - -
tanhf 2 2 2 2 2
tanh 2 2 2 2 2
tanhl - - - 1 1
tanhf128 - - - 2 -
tanh advsimdf - - - - -
tanh advsimd - - - - -
tanh advsimdl - - - - -
tanh advsimdf128
- - - - -
tanh svef - - - - -
tanh sve - - - - -
tanh svel - - - - -
tanh svef128 - - - - -
tgammaf 8 8 8 8 8
tgamma 9 9 9 9 9
tgammal - - - 5 5
tgammaf128 - - - 4 -
y0f 8 9 9 8 9
y0 3 3 3 2 3
y0l - - - 10 10
y0f128 - - - 3 -
y1f 2 9 9 9 9
y1 3 3 3 3 3
y1l - - - 2 2
y1f128 - - - 5 -
ynf 3 3 3 3 3
yn 3 3 3 3 3
ynl - - - 2 2
ynf128 - - - 5 -
acos advsimdf128
- - - - -
acos svef - - - - -
acos sve - - - - -
acos svel - - - - -
acos svef128 - - - - -
acoshf 2 2 2 2 2
acosh 2 2 2 2 2
acoshl 4 4 4 - 4
acoshf128 - - - - -
acosh advsimdf- - - - -
acosh advsimd - - - - -
acosh advsimdl- - - - -
acosh advsimdf128
- - - - -
acosh svef - - - - -
acosh sve - - - - -
acosh svel - - - - -
acosh svef128 - - - - -
add ldoublef - - - - -
add ldouble - - - - -
add ldoublel - - - - -
add ldoublef128- - - - -
asinf 1 1 1 1 1
asin 1 1 1 - 1
asinl 1 1 1 - 1
asinf128 - - - - -
asin advsimdf - - - - -
asin advsimd - - - - -
asin advsimdl - - - - -
asin advsimdf128
- - - - -
asin svef - - - - -
asin sve - - - - -
asin svel - - - - -
asin svef128 - - - - -
asinhf 2 2 2 2 2
asinh 2 2 2 2 2
asinhl 4 4 4 - 4
asinhf128 - - - - -
asinh advsimdf- - - - -
asinh advsimd - - - - -
asinh advsimdl- - - - -
asinh advsimdf128
- - - - -
asinh svef - - - - -
asinh sve - - - - -
asinh svel - - - - -
asinh svef128 - - - - -
atanf 1 1 1 1 1
atan 1 1 1 - 1
Chapter 19: Mathematics 614
atanl 1 1 1 - 1
atanf128 - - - - -
atan2f 1 2 1 1 2
atan2 - - - - -
atan2l 2 2 2 - 2
atan2f128 - - - - -
atan2 advsimdf- - - - -
atan2 advsimd - - - - -
atan2 advsimdl- - - - -
atan2 advsimdf128
- - - - -
atan2 svef - - - - -
atan2 sve - - - - -
atan2 svel - - - - -
atan2 svef128 - - - - -
atan advsimdf - - - - -
atan advsimd - - - - -
atan advsimdl - - - - -
atan advsimdf128
- - - - -
atan svef - - - - -
atan sve - - - - -
atan svel - - - - -
atan svef128 - - - - -
atanhf 2 2 2 2 2
atanh 2 2 2 2 2
atanhl 4 4 4 - 4
atanhf128 - - - - -
atanh advsimdf- - - - -
atanh advsimd- - - - -
atanh advsimdl- - - - -
atanh advsimdf128
- - - - -
atanh svef - - - - -
atanh sve - - - - -
atanh svel - - - - -
atanh svef128 - - - - -
cabsf - - - - -
cabs 1 1 1 1 1
cabsl 1 1 1 - 1
cabsf128 - - - - -
cacosf 2+i 2 2 +i2 2 +i2 2 +i2 2 +i2
cacos 1+i 2 1 +i2 1 +i2 1 +i2 1 +i2
cacosl 2+i 2 2 +i2 2 +i2 - 2 +i2
cacosf128 - - - - -
cacoshf 2+i 2 2 +i2 2 +i2 2 +i2 2 +i2
cacosh 2+i 1 2 +i1 2 +i1 2 +i1 2 +i1
cacoshl 2+i 2 2 +i2 2 +i2 - 2 +i2
cacoshf128 - - - - -
cargf 1 1 1 1 1
Chapter 19: Mathematics 615
carg - - - - -
cargl 2 2 2 - 2
cargf128 - - - - -
casinf 1+ i2 1 +i2 1 +i2 1 +i2 1 +i2
casin 1+ i2 1 +i2 1 +i2 1 +i2 1 +i2
casinl 2+ i2 2 +i2 2 +i2 - 2 +i2
casinf128 - - - - -
casinhf 2+ i1 2 +i1 2 +i1 2 +i1 2 +i1
casinh 2+ i1 2 +i1 2 +i1 2 +i1 2 +i1
casinhl 2+ i2 2 +i2 2 +i2 - 2 +i2
casinhf128 - - - - -
catanf 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
catan 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
catanl 1+ i1 1 +i1 1 +i1 - 1 +i1
catanf128 - - - - -
catanhf 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
catanh 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
catanhl 1+ i1 1 +i1 1 +i1 - 1 +i1
catanhf128 - - - - -
cbrtf 1 1 1 1 1
cbrt 4 4 4 4 4
cbrtl 1 1 1 - 1
cbrtf128 - - - - -
cbrt advsimdf - - - - -
cbrt advsimd - - - - -
cbrt advsimdl - - - - -
cbrt advsimdf128
- - - - -
cbrt svef - - - - -
cbrt sve - - - - -
cbrt svel - - - - -
cbrt svef128 - - - - -
ccosf 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
ccos 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
ccosl 1+ i1 1 +i1 1 +i1 - 1 +i1
ccosf128 - - - - -
ccoshf 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
ccosh 1+ i1 1 +i1 1 +i1 1 +i1 1 +i1
ccoshl 1+ i1 1 +i1 1 +i1 - 1 +i1
ccoshf128 - - - - -
cexpf 1+ i2 1 +i2 1 +i2 1 +i2 1 +i2
cexp 2+ i1 2 +i1 2 +i1 2 +i1 2 +i1
cexpl 1+ i1 1 +i1 1 +i1 - 1 +i1
cexpf128 - - - - -
clogf 3+ i1 3 +i1 3 +i1 3 +i1 3 +i1
clog 3+ i1 3 +i1 3 +i1 3 +i0 3 +i1
clogl 2+ i1 2 +i1 2 +i1 - 4 +i1
clogf128 - - - - -
Chapter 19: Mathematics 616
ctanf128 - - - - -
ctanhf 2+i1 2+i2 2+i1 2+i2 2+i2
ctanh 2+i2 2+i2 2+i2 2+i2 2+i2
ctanhl 3+i3 3+i3 3+i3 - 3+i3
ctanhf128 - - - - -
div ldoublef - - - - -
div ldouble - - - - -
div ldoublel - - - - -
div ldoublef128- - - - -
erff 1 1 1 1 1
erf 1 1 1 1 1
erfl 1 1 1 - 1
erff128 - - - - -
erf advsimdf - - - - -
erf advsimd - - - - -
erf advsimdl - - - - -
erf advsimdf128- - - - -
erf svef - - - - -
erf sve - - - - -
erf svel - - - - -
erf svef128 - - - - -
erfcf 2 3 2 2 3
erfc 2 5 2 5 5
erfcl 4 4 4 - 4
erfcf128 - - - - -
erfc advsimdf - - - - -
erfc advsimd - - - - -
erfc advsimdl - - - - -
erfc advsimdf128
- - - - -
erfc svef - - - - -
erfc sve - - - - -
erfc svel - - - - -
erfc svef128 - - - - -
expf 1 1 1 1 1
exp 1 1 1 1 1
expl 1 1 1 - 1
expf128 - - - - -
exp10f - - 1 - 1
exp10 2 2 2 2 2
exp10l 2 2 2 - 2
exp10f128 - - - - -
exp10 advsimdf- - - - -
exp10 advsimd- - - - -
exp10 advsimdl- - - - -
exp10 advsimdf128
- - - - -
exp10 svef - - - - -
exp10 sve - - - - -
Chapter 19: Mathematics 618
exp10 svel - - - - -
exp10 svef128 - - - - -
exp10m1f 1 1 1 - 1
exp10m1 2 2 2 - 2
exp10m1l 1 1 1 - 1
exp10m1f128 - - - - -
exp2f - - - - 1
exp2 1 1 1 1 1
exp2l 1 1 1 - 1
exp2f128 - - - - -
exp2 advsimdf - - - - -
exp2 advsimd - - - - -
exp2 advsimdl - - - - -
exp2 advsimdf128
- - - - -
exp2 svef - - - - -
exp2 sve - - - - -
exp2 svel - - - - -
exp2 svef128 - - - - -
exp2m1f 1 1 1 - 1
exp2m1 1 1 1 - 1
exp2m1l 1 1 1 - 1
exp2m1f128 - - - - -
exp advsimdf - - - - -
exp advsimd - - - - -
exp advsimdl - - - - -
exp advsimdf128
- - - - -
exp svef - - - - -
exp sve - - - - -
exp svel - - - - -
exp svef128 - - - - -
expm1f 1 1 1 1 1
expm1 1 1 1 1 1
expm1l 2 2 2 - 2
expm1f128 - - - - -
expm1 advsimdf- - - - -
expm1 advsimd- - - - -
expm1 advsimdl- - - - -
expm1 advsimdf128
- - - - -
expm1 svef - - - - -
expm1 sve - - - - -
expm1 svel - - - - -
expm1 svef128 - - - - -
fmaf - - - - -
fma - - - - -
fmal - - - - -
fmaf128 - - - - -
fma ldoublef - - - - -
Chapter 19: Mathematics 619
fma ldouble - - - - -
fma ldoublel - - - - -
fma ldoublef128- - - - -
fmodf - - - - -
fmod - - - - -
fmodl - - - - -
fmodf128 - - - - -
gammaf 3 7 3 3 7
gamma 3 4 3 4 4
gammal 5 5 5 - 5
gammaf128 - - - - -
hypotf 1 1 1 - 1
hypot 1 1 1 1 1
hypotl 1 1 1 - 1
hypotf128 - - - - -
hypot advsimdf- - - - -
hypot advsimd- - - - -
hypot advsimdl- - - - -
hypot advsimdf128
- - - - -
hypot svef - - - - -
hypot sve - - - - -
hypot svel - - - - -
hypot svef128 - - - - -
j0f 9 9 9 8 9
j0 3 2 4 2 3
j0l 2 2 2 - 2
j0f128 - - - - -
j1f 9 9 9 8 9
j1 4 4 4 2 4
j1l 4 4 4 - 4
j1f128 - - - - -
jnf 4 4 4 4 4
jn 4 4 4 4 4
jnl 7 7 7 - 7
jnf128 - - - - -
lgammaf 3 7 3 3 7
lgamma 3 4 3 4 4
lgammal 5 5 5 - 5
lgammaf128 - - - - -
logf - - - 1 1
log 1 - 1 - 1
logl 1 1 1 - 1
logf128 - - - - -
log10f 2 2 2 2 2
log10 2 2 2 2 2
log10l 2 2 2 - 2
log10f128 - - - - -
Chapter 19: Mathematics 620
log10 advsimdf- - - - -
log10 advsimd - - - - -
log10 advsimdl- - - - -
log10 advsimdf128
- - - - -
log10 svef - - - - -
log10 sve - - - - -
log10 svel - - - - -
log10 svef128 - - - - -
log10p1f 1 1 1 - 1
log10p1 1 1 1 - 1
log10p1l 3 3 3 - 3
log10p1f128 - - - - -
log1pf 1 1 1 1 1
log1p 1 1 1 1 1
log1pl 3 3 3 - 3
log1pf128 - - - - -
log1p advsimdf- - - - -
log1p advsimd - - - - -
log1p advsimdl- - - - -
log1p advsimdf128
- - - - -
log1p svef - - - - -
log1p sve - - - - -
log1p svel - - - - -
log1p svef128 - - - - -
log2f 1 1 1 1 1
log2 1 2 - 2 2
log2l 3 3 3 - 3
log2f128 - - - - -
log2 advsimdf - - - - -
log2 advsimd - - - - -
log2 advsimdl - - - - -
log2 advsimdf128
- - - - -
log2 svef - - - - -
log2 sve - - - - -
log2 svel - - - - -
log2 svef128 - - - - -
log2p1f 1 1 1 - 1
log2p1 1 1 1 - 1
log2p1l 3 3 3 - 3
log2p1f128 - - - - -
log advsimdf - - - - -
log advsimd - - - - -
log advsimdl - - - - -
log advsimdf128
- - - - -
log svef - - - - -
log sve - - - - -
log svel - - - - -
Chapter 19: Mathematics 621
log svef128 - - - - -
logp1f 1 1 1 1 1
logp1 1 1 1 1 1
logp1l 3 3 3 - 3
logp1f128 - - - - -
mul ldoublef - - - - -
mul ldouble - - - - -
mul ldoublel - - - - -
mul ldoublef128- - - - -
powf - - - 1 3
pow 1 1 1 1 1
powl 2 2 2 - 2
powf128 - - - - -
pow10f - - - - -
pow10 - - - - -
pow10l - - - - -
pow10f128 - - - - -
pow advsimdf - - - - -
pow advsimd - - - - -
pow advsimdl - - - - -
pow advsimdf128- - - - -
pow svef - - - - -
pow sve - - - - -
pow svel - - - - -
pow svef128 - - - - -
sinf 1 1 1 1 1
sin 1 1 1 1 1
sinl 2 2 2 - 2
sinf128 - - - - -
sin advsimdf - - - - -
sin advsimd - - - - -
sin advsimdl - - - - -
sin advsimdf128- - - - -
sin svef - - - - -
sin sve - - - - -
sin svel - - - - -
sin svef128 - - - - -
sincosf - - - 1 1
sincos 1 1 1 1 1
sincosl 1 1 1 - 1
sincosf128 - - - - -
sinhf 2 2 2 2 2
sinh 2 2 2 2 2
sinhl 2 2 2 - 2
sinhf128 - - - - -
sinh advsimdf - - - - -
sinh advsimd - - - - -
Chapter 19: Mathematics 622
sinh advsimdl - - - - -
sinh advsimdf128- - - - -
sinh svef - - - - -
sinh sve - - - - -
sinh svel - - - - -
sinh svef128 - - - - -
sqrtf - - - - -
sqrt - - - - -
sqrtl - - - - -
sqrtf128 - - - - -
sqrt ldoublef - - - - -
sqrt ldouble - - - - -
sqrt ldoublel - - - - -
sqrt ldoublef128- - - - -
sub ldoublef - - - - -
sub ldouble - - - - -
sub ldoublel - - - - -
sub ldoublef128- - - - -
tanf 1 1 1 1 1
tan - - - - -
tanl 1 1 1 - 1
tanf128 - - - - -
tan advsimdf - - - - -
tan advsimd - - - - -
tan advsimdl - - - - -
tan advsimdf128 - - - - -
tan svef - - - - -
tan sve - - - - -
tan svel - - - - -
tan svef128 - - - - -
tanhf 2 2 2 2 2
tanh 2 2 2 2 2
tanhl 2 2 2 - 2
tanhf128 - - - - -
tanh advsimdf - - - - -
tanh advsimd - - - - -
tanh advsimdl - - - - -
tanh advsimdf128- - - - -
tanh svef - - - - -
tanh sve - - - - -
tanh svel - - - - -
tanh svef128 - - - - -
tgammaf 8 8 8 8 8
tgamma 9 9 9 9 9
tgammal 4 4 4 - 4
tgammaf128 - - - - -
y0f 8 9 8 6 9
Chapter 19: Mathematics 623
y0 2 3 2 3 3
y0l 3 3 3 - 3
y0f128 - - - - -
y1f 9 9 9 2 9
y1 3 3 3 3 3
y1l 5 5 5 - 5
y1f128 - - - - -
ynf 3 3 3 3 3
yn 3 3 3 3 3
ynl 5 5 5 - 5
ynf128 - - - - -
asin advsimdl - - -
asin advsimdf128
- - -
asin svef - - -
asin sve - - -
asin svel - - -
asin svef128 - - -
asinhf - - 2
asinh 1 1 2
asinhl 3 3 3
asinhf128 4 4 4
asinh advsimdf- - -
asinh advsimd - - -
asinh advsimdl- - -
asinh advsimdf128
- - -
asinh svef - - -
asinh sve - - -
asinh svel - - -
asinh svef128 - - -
atanf - - 1
atan 1 1 1
atanl 1 1 1
atanf128 1 1 1
atan2f - - 2
atan2 1 1 -
atan2l 1 1 1
atan2f128 2 2 2
atan2 advsimdf- - -
atan2 advsimd - - -
atan2 advsimdl- - -
atan2 advsimdf128
- - -
atan2 svef - - -
atan2 sve - - -
atan2 svel - - -
atan2 svef128 - - -
atan advsimdf - - -
atan advsimd - - -
atan advsimdl - - -
atan advsimdf128
- - -
atan svef - - -
atan sve - - -
atan svel - - -
atan svef128 - - -
atanhf - - 2
atanh 1 1 2
atanhl 3 3 3
atanhf128 4 4 4
atanh advsimdf- - -
Chapter 19: Mathematics 625
atanh advsimd- - -
atanh advsimdl- - -
atanh advsimdf128
- - -
atanh svef - - -
atanh sve - - -
atanh svel - - -
atanh svef128 - - -
cabsf - - -
cabs 1 1 1
cabsl 1 1 1
cabsf128 1 1 1
cacosf 2+i 2 2 + i 2 2 + i 2
cacos 1+i 2 1 + i 2 1 + i 2
cacosl 1+i 2 1 + i 2 1 + i 2
cacosf128 2+i 2 2 + i 2 2 + i 2
cacoshf 2+i 2 2 + i 2 2 + i 2
cacosh 2+i 1 2 + i 1 2 + i 1
cacoshl 2+i 1 2 + i 1 2 + i 1
cacoshf128 2+i 2 2 + i 2 2 + i 2
cargf - - 1
carg 1 1 -
cargl 1 1 1
cargf128 2 2 2
casinf 1+i 2 1 + i 2 1 + i 2
casin 1+i 2 1 + i 2 1 + i 2
casinl 1+i 2 1 + i 2 1 + i 2
casinf128 2+i 2 2 + i 2 2 + i 2
casinhf 2+i 1 2 + i 1 2 + i 1
casinh 2+i 1 2 + i 1 2 + i 1
casinhl 2+i 1 2 + i 1 2 + i 1
casinhf128 2+i 2 2 + i 2 2 + i 2
catanf 0+i 1 0 + i 1 1 + i 1
catan 1+i 1 1 + i 1 1 + i 1
catanl 1+i 1 1 + i 1 1 + i 1
catanf128 1+i 1 1 + i 1 1 + i 1
catanhf 1+i 0 1 + i 0 1 + i 1
catanh 1+i 1 1 + i 1 1 + i 1
catanhl 1+i 1 1 + i 1 1 + i 1
catanhf128 1+i 1 1 + i 1 1 + i 1
cbrtf 1 1 1
cbrt 1 1 4
cbrtl 3 3 1
cbrtf128 1 1 1
cbrt advsimdf - - -
cbrt advsimd - - -
cbrt advsimdl - - -
cbrt advsimdf128
- - -
Chapter 19: Mathematics 626
cbrt svef - - -
cbrt sve - - -
cbrt svel - - -
cbrt svef128 - - -
ccosf 1+ i 1 1 + i 1 1 + i 1
ccos 1+ i 1 1 + i 1 1 + i 1
ccosl 1+ i 1 1 + i 1 1 + i 1
ccosf128 1+ i 1 1 + i 1 1 + i 1
ccoshf 1+ i 1 1 + i 1 1 + i 1
ccosh 1+ i 1 1 + i 1 1 + i 1
ccoshl 1+ i 1 1 + i 1 1 + i 1
ccoshf128 1+ i 1 1 + i 1 1 + i 1
cexpf 1+ i 2 1 + i 2 1 + i 2
cexp 2+ i 1 2 + i 1 2 + i 1
cexpl 1+ i 1 1 + i 1 1 + i 1
cexpf128 1+ i 1 1 + i 1 1 + i 1
clogf 3+ i 0 3 + i 0 3 + i 1
clog 2+ i 1 2 + i 1 3 + i 1
clogl 3+ i 1 3 + i 1 3 + i 1
clogf128 2+ i 1 2 + i 1 2 + i 1
clog10f 4+ i 2 4 + i 2 4 + i 2
clog10 3+ i 2 3 + i 2 3 + i 2
clog10l 4+ i 2 4 + i 2 4 + i 2
clog10f128 2+ i 2 2 + i 2 2 + i 2
cosf 1 1 1
cos 1 1 1
cosl 1 1 1
cosf128 2 2 2
cos advsimdf - - -
cos advsimd - - -
cos advsimdl - - -
cos advsimdf128
- - -
cos svef - - -
cos sve - - -
cos svel - - -
cos svef128 - - -
coshf 2 2 2
cosh 1 1 2
coshl 3 3 3
coshf128 2 2 2
cosh advsimdf - - -
cosh advsimd - - -
cosh advsimdl - - -
cosh advsimdf128
- - -
cosh svef - - -
cosh sve - - -
cosh svel - - -
Chapter 19: Mathematics 627
cosh svef128 - - -
cpowf 5 + i 2 5 + i 2 5 + i 2
cpow 2 + i 1 2 + i 0 2 + i 0
cpowl 3 + i 4 3 + i 4 3 + i 4
cpowf128 4 + i 1 4 + i 1 4 + i 1
csinf 1 + i 1 1 + i 1 1 + i 0
csin 1 + i 1 1 + i 0 1 + i 0
csinl 1 + i 0 1 + i 0 1 + i 0
csinf128 1 + i 1 1 + i 1 1 + i 1
csinhf 1 + i 1 1 + i 1 1 + i 1
csinh 1 + i 1 0 + i 1 0 + i 1
csinhl 1 + i 1 1 + i 1 1 + i 1
csinhf128 1 + i 1 1 + i 1 1 + i 1
csqrtf 2 + i 2 2 + i 2 2 + i 2
csqrt 2 + i 2 2 + i 2 2 + i 2
csqrtl 2 + i 2 2 + i 2 2 + i 2
csqrtf128 2 + i 2 2 + i 2 2 + i 2
ctanf 1 + i 2 1 + i 2 1 + i 2
ctan 1 + i 2 1 + i 2 1 + i 2
ctanl 2 + i 1 2 + i 1 2 + i 1
ctanf128 3 + i 3 3 + i 3 3 + i 3
ctanhf 2 + i 2 2 + i 2 2 + i 2
ctanh 2 + i 2 2 + i 2 2 + i 2
ctanhl 1 + i 2 1 + i 2 1 + i 2
ctanhf128 3 + i 3 3 + i 3 3 + i 3
div ldoublef - - -
div ldouble - - -
div ldoublel - - -
div ldoublef128- - -
erff 1 1 1
erf 1 1 1
erfl 1 1 1
erff128 1 1 1
erf advsimdf - - -
erf advsimd - - -
erf advsimdl - - -
erf advsimdf128- - -
erf svef - - -
erf sve - - -
erf svel - - -
erf svef128 - - -
erfcf 3 3 3
erfc 5 5 5
erfcl 5 5 5
erfcf128 4 4 4
erfc advsimdf - - -
erfc advsimd - - -
Chapter 19: Mathematics 628
erfc advsimdl - - -
erfc advsimdf128
- - -
erfc svef - - -
erfc sve - - -
erfc svel - - -
erfc svef128 - - -
expf 1 1 1
exp 1 1 1
expl 1 1 1
expf128 1 1 1
exp10f - - 1
exp10 1 1 2
exp10l 1 1 1
exp10f128 2 2 2
exp10 advsimdf- - -
exp10 advsimd- - -
exp10 advsimdl- - -
exp10 advsimdf128
- - -
exp10 svef - - -
exp10 sve - - -
exp10 svel - - -
exp10 svef128 - - -
exp10m1f 1 1 1
exp10m1 1 1 2
exp10m1l 1 1 1
exp10m1f128 1 1 1
exp2f - - 1
exp2 1 1 1
exp2l 1 1 1
exp2f128 1 1 1
exp2 advsimdf - - -
exp2 advsimd - - -
exp2 advsimdl - - -
exp2 advsimdf128
- - -
exp2 svef - - -
exp2 sve - - -
exp2 svel - - -
exp2 svef128 - - -
exp2m1f 1 1 1
exp2m1 1 1 1
exp2m1l 1 1 1
exp2m1f128 1 1 1
exp advsimdf - - -
exp advsimd - - -
exp advsimdl - - -
exp advsimdf128
- - -
exp svef - - -
Chapter 19: Mathematics 629
exp sve - - -
exp svel - - -
exp svef128 - - -
expm1f - - 1
expm1 1 1 1
expm1l 3 3 3
expm1f128 2 2 2
expm1 advsimdf - - -
expm1 advsimd- - -
expm1 advsimdl - - -
expm1 advsimdf128
- - -
expm1 svef - - -
expm1 sve - - -
expm1 svel - - -
expm1 svef128 - - -
fmaf - - -
fma - - -
fmal - - -
fmaf128 - - -
fma ldoublef - - -
fma ldouble - - -
fma ldoublel - - -
fma ldoublef128- - -
fmodf - - -
fmod - - -
fmodl - - -
fmodf128 - - -
gammaf 5 5 7
gamma 4 4 4
gammal 4 4 4
gammaf128 - - -
hypotf 1 1 1
hypot 1 1 1
hypotl 1 1 1
hypotf128 1 1 1
hypot advsimdf- - -
hypot advsimd- - -
hypot advsimdl- - -
hypot advsimdf128
- - -
hypot svef - - -
hypot sve - - -
hypot svel - - -
hypot svef128 - - -
j0f 9 9 9
j0 5 5 3
j0l 8 8 8
j0f128 2 2 2
Chapter 19: Mathematics 630
j1f 9 9 9
j1 4 4 4
j1l 9 9 9
j1f128 4 4 4
jnf 4 4 4
jn 4 4 4
jnl 4 4 4
jnf128 7 7 7
lgammaf 5 5 7
lgamma 4 4 4
lgammal 4 4 4
lgammaf128 5 5 5
logf - - 1
log 1 1 1
logl 1 1 1
logf128 1 1 1
log10f - - 2
log10 1 1 2
log10l 1 1 1
log10f128 2 2 2
log10 advsimdf- - -
log10 advsimd - - -
log10 advsimdl- - -
log10 advsimdf128
- - -
log10 svef - - -
log10 sve - - -
log10 svel - - -
log10 svef128 - - -
log10p1f 2 2 1
log10p1 1 1 1
log10p1l 2 2 2
log10p1f128 3 3 3
log1pf - - 1
log1p 1 1 1
log1pl 2 2 2
log1pf128 3 3 3
log1p advsimdf- - -
log1p advsimd - - -
log1p advsimdl- - -
log1p advsimdf128
- - -
log1p svef - - -
log1p sve - - -
log1p svel - - -
log1p svef128 - - -
log2f 1 1 1
log2 1 1 2
log2l 1 1 1
Chapter 19: Mathematics 631
log2f128 3 3 3
log2 advsimdf - - -
log2 advsimd - - -
log2 advsimdl - - -
log2 advsimdf128
- - -
log2 svef - - -
log2 sve - - -
log2 svel - - -
log2 svef128 - - -
log2p1f 1 1 1
log2p1 1 1 1
log2p1l 2 2 2
log2p1f128 3 3 3
log advsimdf - - -
log advsimd - - -
log advsimdl - - -
log advsimdf128- - -
log svef - - -
log sve - - -
log svel - - -
log svef128 - - -
logp1f - - 1
logp1 1 1 1
logp1l 2 2 2
logp1f128 3 3 3
mul ldoublef - - -
mul ldouble - - -
mul ldoublel - - -
mul ldoublef128- - -
powf - - 1
pow 1 1 1
powl 1 1 1
powf128 2 2 2
pow10f - - -
pow10 - - -
pow10l - - -
pow10f128 - - -
pow advsimdf - - -
pow advsimd - - -
pow advsimdl - - -
pow advsimdf128- - -
pow svef - - -
pow sve - - -
pow svel - - -
pow svef128 - - -
sinf 1 1 1
sin 1 1 1
Chapter 19: Mathematics 632
sinl 2 2 2
sinf128 2 2 2
sin advsimdf - - -
sin advsimd - - -
sin advsimdl - - -
sin advsimdf128- - -
sin svef - - -
sin sve - - -
sin svel - - -
sin svef128 - - -
sincosf - 1 -
sincos 1 1 1
sincosl 1 1 1
sincosf128 1 1 1
sinhf 2 2 2
sinh 2 2 2
sinhl 3 3 3
sinhf128 2 2 2
sinh advsimdf - - -
sinh advsimd - - -
sinh advsimdl - - -
sinh advsimdf128- - -
sinh svef - - -
sinh sve - - -
sinh svel - - -
sinh svef128 - - -
sqrtf - - -
sqrt - - -
sqrtl - - -
sqrtf128 - - -
sqrt ldoublef - - -
sqrt ldouble - - -
sqrt ldoublel - - -
sqrt ldoublef128- - -
sub ldoublef - - -
sub ldouble - - -
sub ldoublel - - -
sub ldoublef128- - -
tanf 1 1 1
tan - - -
tanl 2 2 2
tanf128 1 1 1
tan advsimdf - - -
tan advsimd - - -
tan advsimdl - - -
tan advsimdf128 - - -
tan svef - - -
Chapter 19: Mathematics 633
tan sve - - -
tan svel - - -
tan svef128 - - -
tanhf 2 2 2
tanh 2 2 2
tanhl 3 3 3
tanhf128 2 2 2
tanh advsimdf - - -
tanh advsimd - - -
tanh advsimdl - - -
tanh advsimdf128
- - -
tanh svef - - -
tanh sve - - -
tanh svel - - -
tanh svef128 - - -
tgammaf 8 8 8
tgamma 9 9 9
tgammal 5 5 5
tgammaf128 4 4 4
y0f 9 9 9
y0 3 3 3
y0l 2 2 2
y0f128 3 3 3
y1f 9 9 9
y1 3 3 6
y1l 3 3 3
y1f128 5 5 5
ynf 3 3 3
yn 3 3 3
ynl 4 4 4
ynf128 5 5 5
Although the generated numbers look unpredictable within one run of a program, the
sequence of numbers is exactly the same from one run to the next. This is because the
initial seed is always the same. This is convenient when you are debugging a program, but
it is unhelpful if you want the program to behave unpredictably. If you want a different
pseudo-random series each time your program runs, you must specify a different seed each
time. For ordinary purposes, basing the seed on the current time works well. For random
numbers in cryptography, see Section 34.1 [Generating Unpredictable Bytes], page 965.
Chapter 19: Mathematics 634
You can obtain repeatable sequences of numbers on a particular machine type by spec-
ifying the same initial seed value for the random number generator. There is no standard
meaning for a particular seed value; the same seed, used in different C libraries or on
different CPU types, will give you different random numbers.
The GNU C Library supports the standard ISO C random number functions plus two
other sets derived from BSD and SVID. The BSD and ISO C functions provide identical,
somewhat limited functionality. If only a small number of random bits are required, we
recommend you use the ISO C interface, rand and srand. The SVID functions provide a
more flexible interface, which allows better random number generator algorithms, provides
more random bits (up to 48) per call, and can provide random floating-point numbers.
These functions are required by the XPG standard and therefore will be present in all
modern Unix systems.
only have as many bits as the type unsigned int has. This is far too few to provide
a good RNG.
If your program requires a reentrant RNG, we recommend you use the reentrant
GNU extensions to the SVID random number generator. The POSIX.1 interface
should only be used when the GNU extensions are not available.
The return value is the previous value of the state information array. You can use
this value later as an argument to setstate to restore that state.
If the function fails the return value is NULL.
The four functions described so far in this section all work on a state which is shared
by all threads. The state is not directly accessible to the user and can only be modified by
these functions. This makes it hard to deal with situations where each thread should have
its own pseudo-random number generator.
The GNU C Library contains four additional functions which contain the state as an
explicit parameter and therefore make it possible to handle thread-local PRNGs. Besides
this there is no difference. In fact, the four functions already discussed are implemented
internally using the following interfaces.
The stdlib.h header contains a definition of the following type:
The functions modifying the state follow exactly the already described functions.
The setstate_r function behaves exactly like the setstate function except that it
uses and modifies the state in the object pointed to by the first parameter instead of
the global state.
The lrand48 function returns an integer value in the range of 0 to 2^31 (exclusive).
Even if the size of the long int type can take more than 32 bits, no higher numbers
are returned. The random bits are determined by the global state of the random
number generator in the C library.
long int nrand48 (unsigned short int xsubi[3]) [Function]
Preliminary: | MT-Unsafe race:drand48 | AS-Unsafe | AC-Unsafe corrupt | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to the lrand48 function in that it returns a number in the
range of 0 to 2^31 (exclusive) but the state of the random number generator used to
produce the random bits is determined by the array provided as the parameter to the
function.
The numbers in the array are updated afterwards so that subsequent calls to this
function yield different results (as is expected of a random number generator). The
array should have been initialized before the first call to obtain reproducible results.
long int mrand48 (void) [Function]
Preliminary: | MT-Unsafe race:drand48 | AS-Unsafe | AC-Unsafe corrupt | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The mrand48 function is similar to lrand48. The only difference is that the numbers
returned are in the range -2^31 to 2^31 (exclusive).
long int jrand48 (unsigned short int xsubi[3]) [Function]
Preliminary: | MT-Unsafe race:drand48 | AS-Unsafe | AC-Unsafe corrupt | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The jrand48 function is similar to nrand48. The only difference is that the numbers
returned are in the range -2^31 to 2^31 (exclusive). For the xsubi parameter the
same requirements are necessary.
The internal state of the random number generator can be initialized in several ways.
The methods differ in the completeness of the information provided.
void srand48 (long int seedval) [Function]
Preliminary: | MT-Unsafe race:drand48 | AS-Unsafe | AC-Unsafe corrupt | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The srand48 function sets the most significant 32 bits of the internal state of the
random number generator to the least significant 32 bits of the seedval parameter.
The lower 16 bits are initialized to the value 0x330E. Even if the long int type
contains more than 32 bits only the lower 32 bits are used.
Owing to this limitation, initialization of the state of this function is not very useful.
But it makes it easy to use a construct like srand48 (time (0)).
A side-effect of this function is that the values a and c from the internal state, which
are used in the congruential formula, are reset to the default values given above. This
is of importance once the user has called the lcong48 function (see below).
unsigned short int * seed48 (unsigned short int seed16v[3]) [Function]
Preliminary: | MT-Unsafe race:drand48 | AS-Unsafe | AC-Unsafe corrupt | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
Chapter 19: Mathematics 639
The seed48 function initializes all 48 bits of the state of the internal random number
generator from the contents of the parameter seed16v. Here the lower 16 bits of the
first element of seed16v initialize the least significant 16 bits of the internal state, the
lower 16 bits of seed16v[1] initialize the mid-order 16 bits of the state and the 16
lower bits of seed16v[2] initialize the most significant 16 bits of the state.
Unlike srand48 this function lets the user initialize all 48 bits of the state.
The value returned by seed48 is a pointer to an array containing the values of the
internal state before the change. This might be useful to restart the random number
generator at a certain state. Otherwise the value can simply be ignored.
As for srand48, the values a and c from the congruential formula are reset to the
default values.
There is one more function to initialize the random number generator which enables
you to specify even more information by allowing you to change the parameters in the
congruential formula.
All the above functions have in common that they use the global parameters for the
congruential formula. In multi-threaded programs it might sometimes be useful to have
different parameters in different threads. For this reason all the above functions have a
counterpart which works on a description of the random number generator in the user-
supplied buffer instead of the global state.
Please note that it is no problem if several threads use the global state if all threads use
the functions which take a pointer to an array containing the state. The random numbers
are computed following the same loop but if the state in the array is different all threads
will obtain an individual random number generator.
The user-supplied buffer must be of type struct drand48_data. This type should be
regarded as opaque and not manipulated directly.
The return value of the function indicates whether the call succeeded. If the value is
less than 0 an error occurred and errno is set to indicate the problem.
This function is a GNU extension and should not be used in portable programs.
Before any of the above functions are used the buffer of type struct drand48_data
should be initialized. The easiest way to do this is to fill the whole buffer with null bytes,
e.g. by
memset (buffer, '\0', sizeof (struct drand48_data));
Using any of the reentrant functions of this family now will automatically initialize the
random number generator to the default values for the state and the parameters of the
congruential formula.
The other possibility is to use any of the functions which explicitly initialize the buffer.
Though it might be obvious how to initialize the buffer from looking at the parameter to
the function, it is highly recommended to use these functions since the result might not
always be what you expect.
names as the library functions and so are used instead of the latter. In the case of inline
functions the compiler will decide whether it is reasonable to use them, and this decision is
usually correct.
This means that no calls to the library functions may be necessary, and can increase the
speed of generated code significantly. The drawback is that code size will increase, and the
increase is not always negligible.
There are two kinds of inline functions: those that give the same result as the library
functions and others that might not set errno and might have a reduced precision and/or
argument range in comparison with the library functions. The latter inline functions are
only available if the flag -ffast-math is given to GNU CC.
Not all hardware implements the entire IEEE 754 standard, and even if it does there may
be a substantial performance penalty for using some of its features. For example, enabling
traps on some processors forces the FPU to run un-pipelined, which can more than double
calculation time.
644
20 Arithmetic Functions
This chapter contains information about functions for doing basic arithmetic operations,
such as splitting a float into its integer and fractional parts or retrieving the imaginary part
of a complex value. These functions are declared in the header files math.h and complex.h.
20.1 Integers
The C language defines several integer data types: integer, short integer, long integer, and
character, all in both signed and unsigned varieties. The GNU C compiler extends the
language to contain long long integers as well.
The C integer types were intended to allow code to be portable among machines with
different inherent data sizes (word sizes), so each type may have different ranges on different
machines. The problem with this is that a program often needs to be written for a particular
range of integers, and sometimes must be written for a particular size of storage, regardless
of what machine the program runs on.
To address this problem, the GNU C Library contains C type definitions you can use to
declare integers that meet your exact needs. Because the GNU C Library header files are
customized to a specific machine, your program source code doesn’t have to be.
These typedefs are in stdint.h.
If you require that an integer be represented in exactly N bits, use one of the following
types, with the obvious mapping to bit size and signedness:
• int8 t
• int16 t
• int32 t
• int64 t
• uint8 t
• uint16 t
• uint32 t
• uint64 t
If your C compiler and target machine do not allow integers of a certain size, the corre-
sponding above type does not exist.
If you don’t need a specific storage size, but want the smallest data structure with at
least N bits, use one of these:
• int least8 t
• int least16 t
• int least32 t
• int least64 t
• uint least8 t
• uint least16 t
• uint least32 t
• uint least64 t
Chapter 20: Arithmetic Functions 645
If you don’t need a specific storage size, but want the data structure that allows the
fastest access while having at least N bits (and among data structures with the same access
speed, the smallest one), use one of these:
• int fast8 t
• int fast16 t
• int fast32 t
• int fast64 t
• uint fast8 t
• uint fast16 t
• uint fast32 t
• uint fast64 t
If you want an integer with the widest range possible on the platform on which it is
being used, use one of the following. If you use these, you should write code that takes into
account the variable size and range of the integer.
• intmax t
• uintmax t
The GNU C Library also provides macros that tell you the maximum and minimum
possible values for each integer data type. The macro names follow these examples: INT32_
MAX, UINT8_MAX, INT_FAST32_MIN, INT_LEAST64_MIN, UINTMAX_MAX, INTMAX_MAX, INTMAX_
MIN. Note that there are no macros for unsigned integer minima. These are always zero.
Similarly, there are macros such as INTMAX_WIDTH for the width of these types. Those
macros for integer type widths come from TS 18661-1:2014.
There are similar macros for use with C’s built in integer types which should come with
your C compiler. These are described in Section A.5 [Data Type Measurements], page 1023.
Don’t forget you can use the C sizeof function with any of these data types to get the
number of bytes of storage each uses.
lldiv_t lldiv (long long int numerator, long long int [Function]
denominator)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The lldiv function is like the div function, but the arguments are of type long long
int and the result is returned as a structure of type lldiv_t.
The lldiv function was added in ISO C99.
Chapter 20: Arithmetic Functions 647
intmax_t quot
The quotient from the division.
intmax_t rem
The remainder from the division.
(This is identical to div_t except that the components are of type intmax_t rather
than int.)
See Section 20.1 [Integers], page 644, for a description of the intmax_t type.
fpclassify is most useful if more than one property of a number must be tested. There
are more specific macros which only test one property at a time. Generally these macros
execute faster than fpclassify, since there is special hardware support for them. You
should therefore use the specific macros whenever possible.
Portability Note: The functions listed in this section are BSD extensions.
5. Square root if the operand is less than zero. More generally, any mathe-
matical function evaluated outside its domain produces this exception.
6. Conversion of a floating-point number to an integer or decimal string, when
the number cannot be represented in the target format (due to overflow,
infinity, or NaN).
7. Conversion of an unrecognizable input string.
8. Comparison via predicates involving < or >, when one or other of the
operands is NaN. You can prevent this exception by using the unordered
comparison functions instead; see Section 20.8.6 [Floating-Point Compari-
son Functions], page 672.
If the exception does not trap, the result of the operation is NaN.
‘Division by Zero’
This exception is raised when a finite nonzero number is divided by zero. If
no trap occurs the result is either +∞ or −∞, depending on the signs of the
operands.
‘Overflow’
This exception is raised whenever the result cannot be represented as a finite
value in the precision format of the destination. If no trap occurs the result
depends on the sign of the intermediate result and the current rounding mode
(IEEE 754, section 7.3):
1. Round to nearest carries all overflows to ∞ with the sign of the intermediate
result.
2. Round toward 0 carries all overflows to the largest representable finite
number with the sign of the intermediate result.
3. Round toward −∞ carries positive overflows to the largest representable
finite number and negative overflows to −∞.
4. Round toward ∞ carries negative overflows to the most negative repre-
sentable finite number and positive overflows to ∞.
Whenever the overflow exception is raised, the inexact exception is also raised.
‘Underflow’
The underflow exception is raised when an intermediate result is too small to
be calculated accurately, or if the operation’s result rounded to the destination
precision is too small to be normalized.
When no trap is installed for the underflow exception, underflow is signaled
(via the underflow flag) only when both tininess and loss of accuracy have
been detected. If no trap handler is installed the operation continues with an
imprecise small value, or zero if the destination precision cannot hold the small
exact result.
‘Inexact’ This exception is signalled if a rounded result is not exact (such as when cal-
culating the square root of two) or a result overflows without an overflow trap.
Chapter 20: Arithmetic Functions 652
1
=∞
0
log 0 = −∞
√
−1 = NaN
When a calculation produces any of these values, an exception also occurs; see Sec-
tion 20.5.1 [FP Exceptions], page 650.
The basic operations and math functions all accept infinity and NaN and produce sensible
output. Infinities propagate through calculations as one would expect: for example, 2+∞ =
∞, 4/∞ = 0, atan (∞) = π/2. NaN, on the other hand, infects any calculation that involves
it. Unless the calculation would produce the same result no matter what real value replaced
NaN, the result is NaN.
In comparison operations, positive infinity is larger than all values except itself and NaN,
and negative infinity is smaller than all values except itself and NaN. NaN is unordered: it is
not equal to, greater than, or less than anything, including itself. x == x is false if the value
of x is NaN. You can use this to test whether a value is NaN or not, but the recommended
way to test for NaN is with the isnan function (see Section 20.4 [Floating-Point Number
Classification Functions], page 648). In addition, <, >, <=, and >= will raise an exception
when applied to NaNs.
math.h defines macros that allow you to explicitly set a variable to infinity or NaN.
IEEE 754 also allows for another unusual value: negative zero. This value is produced
when you divide a positive number by negative infinity, or when a negative result is smaller
than the limits of representation.
Note that the value stored in fexcept_t bears no resemblance to the bit mask returned
by fetestexcept. The type may not even be an integer. Do not attempt to modify an
fexcept_t variable.
−∞; errno may or may not be set to ERANGE when a finite value is returned on overflow.
When underflow occurs, the underflow exception is raised, and zero (appropriately signed)
or a subnormal value, as appropriate for the mathematical result of the function and the
rounding mode, is returned. errno may be set to ERANGE, but this is not guaranteed; it is
intended that the GNU C Library should set it when the underflow is to an appropriately
signed zero, but not necessarily for other underflows.
When a math function has an argument that is a signaling NaN, the GNU C Library does
not consider this a domain error, so errno is unchanged, but the invalid exception is still
raised (except for a few functions that are specified to handle signaling NaNs differently).
Some of the math functions are defined mathematically to result in a complex value over
parts of their domains. The most familiar example of this is taking the square root of a
negative number. The complex math functions, such as csqrt, will return the appropriate
complex value in this case. The real-valued functions, such as sqrt, will signal a domain
error.
Some older hardware does not support infinities. On that hardware, overflows instead
return a particular very large number (usually the largest representable number). math.h
defines macros you can use to test for overflow on both old and new hardware.
Round to nearest.
This is the default mode. It should be used unless there is a specific need for
one of the others. In this mode results are rounded to the nearest representable
value. If the result is midway between two representable values, the even repre-
sentable is chosen. Even here means the lowest-order bit is zero. This rounding
mode prevents statistical bias and guarantees numeric stability: round-off errors
in a lengthy calculation will remain smaller than half of FLT_EPSILON.
Round toward plus Infinity.
All results are rounded to the smallest representable value which is greater than
the result.
Chapter 20: Arithmetic Functions 657
You should avoid changing the rounding mode if possible. It can be an expensive oper-
ation; also, some hardware requires you to compile your program differently for it to work.
The resulting code may run slower. See your compiler documentation for details.
The functions which restore the floating-point environment can take these kinds of ar-
guments:
• Pointers to fenv_t objects, which were initialized previously by a call to fegetenv or
feholdexcept.
• The special macro FE_DFL_ENV which represents the floating-point environment as it
was available at program start.
• Implementation defined macros with names starting with FE_ and having type fenv_t
*.
Chapter 20: Arithmetic Functions 659
The following functions, which come from BSD, provide facilities equivalent to those of
ldexp and frexp. See also the ISO C function logb which originally also appeared in BSD.
The _FloatN and _FloatN variants of the following functions come from TS 18661-3:2015.
These functions return x but with the sign of y. They work even if x or y are NaN
or zero. Both of these can carry a sign (although not all implementations support it)
and this is one of the few operations that can tell the difference.
copysign never raises an exception.
This function is defined in IEC 559 (and the appendix with recommended functions
in IEEE 754/IEEE 854).
int signbit (float-type x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
signbit is a generic macro which can work on all floating-point types. It returns a
nonzero value if the value of x has its sign bit set.
This is not the same as x < 0.0, because IEEE 754 floating point allows zero to
be signed. The comparison -0.0 < 0.0 is false, but signbit (-0.0) will return a
nonzero value.
double nextafter (double x, double y) [Function]
float nextafterf (float x, float y) [Function]
long double nextafterl (long double x, long double y) [Function]
_FloatN nextafterfN (_FloatN x, _FloatN y) [Function]
_FloatNx nextafterfNx (_FloatNx x, _FloatNx y) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The nextafter function returns the next representable neighbor of x in the direction
towards y. The size of the step between x and the result depends on the type of the
result. If x = y the function simply returns y. If either value is NaN, NaN is returned.
Otherwise a value corresponding to the value of the least significant bit in the mantissa
is added or subtracted, depending on the direction. nextafter will signal overflow
or underflow if the result goes outside of the range of normalized numbers.
This function is defined in IEC 559 (and the appendix with recommended functions
in IEEE 754/IEEE 854).
double nexttoward (double x, long double y) [Function]
float nexttowardf (float x, long double y) [Function]
long double nexttowardl (long double x, long double y) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
These functions are identical to the corresponding versions of nextafter except that
their second argument is a long double.
double nextup (double x) [Function]
float nextupf (float x) [Function]
long double nextupl (long double x) [Function]
_FloatN nextupfN (_FloatN x) [Function]
_FloatNx nextupfNx (_FloatNx x) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 20: Arithmetic Functions 670
The nextup function returns the next representable neighbor of x in the direction
of positive infinity. If x is the smallest negative subnormal number in the type of
x the function returns -0. If x = 0 the function returns the smallest positive sub-
normal number in the type of x. If x is NaN, NaN is returned. If x is +∞, +∞ is
returned. nextup is from TS 18661-1:2014 and TS 18661-3:2015. nextup never raises
an exception except for signaling NaNs.
canonical value is produced, it is stored in the object pointed to by cx, and these
functions return zero. Otherwise (if a canonical value could not be produced because
the object pointed to by x is not a valid representation of any floating-point value),
the object pointed to by cx is unchanged and a nonzero value is returned.
Note that some formats have multiple encodings of a value which are all equally
canonical; when such an encoding is used as an input to this function, any such
encoding of the same value (or of the corresponding quiet NaN, if that value is a
signaling NaN) may be produced as output.
return zero. If payload is not a positive-signed integer that is a valid payload for a
signaling NaN of the given type, the object pointed to by x is set to positive zero and
a nonzero value is returned. They raise no floating-point exceptions.
NB: There are no macros isequal or isunequal. They are unnecessary, because the ==
and != operators do not throw an exception if one or both of the operands are NaN.
These functions, from TS 18661-1:2014, return whichever of the two values x and y
has the greater absolute value. If both have the same absolute value, or either is NaN,
they behave the same as the fmax functions.
These functions return whichever of the two values x and y has the greater absolute
value. If both have the same absolute value, or either is NaN, they behave the same
as the fmaximum_num functions.
Note that _Complex_I * _Complex_I has the value -1, but the type of that value is
complex.
_Complex_I is a bit of a mouthful. complex.h also defines a shorter name for the same
constant.
Chapter 20: Arithmetic Functions 680
If string depicts a negative number, strtoul acts the same as strtol but casts the
result to an unsigned integer. That means for example that strtoul on "-1" returns
ULONG_MAX and an input more negative than LONG_MIN returns (ULONG_MAX + 1) / 2.
strtoul sets errno to EINVAL if base is out of range, or ERANGE on overflow.
long long int strtoll (const char *restrict string, char [Function]
**restrict tailptr, int base)
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
The strtoll function is like strtol except that it returns a long long int value,
and accepts numbers with a correspondingly larger range.
If the string has valid syntax for an integer but the value is not representable because
of overflow, strtoll returns either LLONG_MAX or LLONG_MIN (see Section A.5.2 [Range
of an Integer Type], page 1025), as appropriate for the sign of the value. It also sets
errno to ERANGE to indicate there was overflow.
The strtoll function was introduced in ISO C99.
long long int strtoq (const char *restrict string, char [Function]
**restrict tailptr, int base)
Preliminary: | MT-Safe locale | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
strtoq (“string-to-quad-word”) is the BSD name for strtoll.
The wcstoimax function is equivalent to the strtoimax function in nearly all aspects
but handles wide character strings.
The wcstoimax function was introduced in ISO C99.
All the functions mentioned in this section so far do not handle alternative representa-
tions of characters as described in the locale data. Some locales specify thousands separator
and the way they have to be used which can help to make large numbers more readable.
To read such numbers one has to use the scanf functions with the ‘'’ flag.
Chapter 20: Arithmetic Functions 686
Here is a function which parses a string as a sequence of integers and returns the sum
of them:
int
sum_ints_from_string (char *string)
{
int sum = 0;
while (1) {
char *tail;
int next;
return sum;
}
If the string is empty, contains only whitespace, or does not contain an initial substring
that has the expected syntax for a floating-point number, no conversion is performed.
In this case, strtod returns a value of zero and the value returned in *tailptr is the
value of string.
In a locale other than the standard "C" or "POSIX" locales, this function may recognize
additional locale-dependent syntax.
If the string has valid syntax for a floating-point number but the value is outside
the range of a double, strtod will signal overflow or underflow as described in Sec-
tion 20.5.4 [Error Reporting by Mathematical Functions], page 655.
strtod recognizes four special input strings. The strings "inf" and "infinity"
are converted to ∞, or to the largest representable value if the floating-point format
doesn’t support infinities. You can prepend a "+" or "-" to specify the sign. Case is
ignored when scanning these strings.
The strings "nan" and "nan(chars...)" are converted to NaN. Again, case is ig-
nored. If chars. . . are provided, they are used in some unspecified fashion to select a
particular representation of NaN (there can be several).
Since zero is a valid result as well as the value returned on error, you should check
for errors in the same way as for strtol, by examining errno and tailptr.
The GNU C Library also provides ‘_l’ versions of these functions, which take an addi-
tional argument, the locale to use in conversion.
See also Section 20.11.1 [Parsing of Integers], page 681.
char * ecvt (double value, int ndigit, int *decpt, int [Function]
*neg)
Preliminary: | MT-Unsafe race:ecvt | AS-Unsafe | AC-Safe | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
Chapter 20: Arithmetic Functions 690
The function ecvt converts the floating-point number value to a string with at most
ndigit decimal digits. The returned string contains no decimal point or sign. The
first digit of the string is non-zero (unless value is actually zero) and the last digit is
rounded to nearest. *decpt is set to the index in the string of the first digit after the
decimal point. *neg is set to a nonzero value if value is negative, zero otherwise.
If ndigit decimal digits would exceed the precision of a double it is reduced to a
system-specific value.
The returned string is statically allocated and overwritten by each call to ecvt.
If value is zero, it is implementation defined whether *decpt is 0 or 1.
For example: ecvt (12.3, 5, &d, &n) returns "12300" and sets d to 2 and n to 0.
char * fcvt (double value, int ndigit, int *decpt, int [Function]
*neg)
Preliminary: | MT-Unsafe race:fcvt | AS-Unsafe heap | AC-Unsafe mem | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The function fcvt is like ecvt, but ndigit specifies the number of digits after the
decimal point. If ndigit is less than zero, value is rounded to the ndigit + 1’th place
to the left of the decimal point. For example, if ndigit is -1, value will be rounded to
the nearest 10. If ndigit is negative and larger than the number of digits to the left
of the decimal point in value, value will be rounded to one significant digit.
If ndigit decimal digits would exceed the precision of a double it is reduced to a
system-specific value.
The returned string is statically allocated and overwritten by each call to fcvt.
char * gcvt (double value, int ndigit, char *buf) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
gcvt is functionally equivalent to ‘sprintf(buf, "%*g", ndigit, value)’. It is pro-
vided only for compatibility’s sake. It returns buf.
If ndigit decimal digits would exceed the precision of a double it is reduced to a
system-specific value.
As extensions, the GNU C Library provides versions of these three functions that take
long double arguments.
char * qecvt (long double value, int ndigit, int *decpt, [Function]
int *neg)
Preliminary: | MT-Unsafe race:qecvt | AS-Unsafe | AC-Safe | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This function is equivalent to ecvt except that it takes a long double for the first
parameter and that ndigit is restricted by the precision of a long double.
char * qfcvt (long double value, int ndigit, int *decpt, [Function]
int *neg)
Preliminary: | MT-Unsafe race:qfcvt | AS-Unsafe heap | AC-Unsafe mem | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is equivalent to fcvt except that it takes a long double for the first
parameter and that ndigit is restricted by the precision of a long double.
Chapter 20: Arithmetic Functions 691
char * qgcvt (long double value, int ndigit, char *buf) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is equivalent to gcvt except that it takes a long double for the first
parameter and that ndigit is restricted by the precision of a long double.
The ecvt and fcvt functions, and their long double equivalents, all return a string
located in a static buffer which is overwritten by the next call to the function. The GNU
C Library provides another set of extended functions which write the converted string into
a user-supplied buffer. These have the conventional _r suffix.
gcvt_r is not necessary, because gcvt already uses a user-supplied buffer.
int ecvt_r (double value, int ndigit, int *decpt, int [Function]
*neg, char *buf, size_t len)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The ecvt_r function is the same as ecvt, except that it places its result into the
user-specified buffer pointed to by buf, with length len. The return value is -1 in case
of an error and zero otherwise.
This function is a GNU extension.
int fcvt_r (double value, int ndigit, int *decpt, int [Function]
*neg, char *buf, size_t len)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The fcvt_r function is the same as fcvt, except that it places its result into the
user-specified buffer pointed to by buf, with length len. The return value is -1 in case
of an error and zero otherwise.
This function is a GNU extension.
int qecvt_r (long double value, int ndigit, int *decpt, [Function]
int *neg, char *buf, size_t len)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The qecvt_r function is the same as qecvt, except that it places its result into the
user-specified buffer pointed to by buf, with length len. The return value is -1 in case
of an error and zero otherwise.
This function is a GNU extension.
int qfcvt_r (long double value, int ndigit, int *decpt, [Function]
int *neg, char *buf, size_t len)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The qfcvt_r function is the same as qfcvt, except that it places its result into the
user-specified buffer pointed to by buf, with length len. The return value is -1 in case
of an error and zero otherwise.
This function is a GNU extension.
692
21 Bit Manipulation
This chapter contains information about functions and macros for determining the endian-
ness of integer types and manipulating the bits of unsigned integers. These functions and
macros are from ISO C23 and are declared in the header file stdbit.h.
The following macros describe the endianness of integer types. They have values that
are integer constant expressions.
__STDC_ENDIAN_LITTLE__ [Macro]
This macro represents little-endian storage.
__STDC_ENDIAN_BIG__ [Macro]
This macro represents big-endian storage.
__STDC_ENDIAN_NATIVE__ [Macro]
This macro equals __STDC_ENDIAN_LITTLE__ if integer types are stored in memory
in little-endian format, and equals __STDC_ENDIAN_BIG__ if integer types are stored
in memory in big-endian format.
The following functions manipulate the bits of unsigned integers. Each function family
has functions for the types unsigned char, unsigned short, unsigned int, unsigned long
int and unsigned long long int. In addition, there is a corresponding type-generic macro
(not listed below), named the same as the functions but without any suffix such as ‘_uc’.
The type-generic macro can only be used with an argument of an unsigned integer type with
a width of 8, 16, 32 or 64 bits, or when using a compiler with support for __builtin_stdc_
bit_ceil (https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html), etc., built-in
functions such as GCC 14.1 or later any unsigned integer type those built-in functions sup-
port. In GCC 14.1 that includes support for unsigned __int128 and unsigned _BitInt(n)
if supported by the target.
unsigned int stdc_leading_zeros_uc (unsigned char x) [Function]
unsigned int stdc_leading_zeros_us (unsigned short x) [Function]
unsigned int stdc_leading_zeros_ui (unsigned int x) [Function]
unsigned int stdc_leading_zeros_ul (unsigned long int x) [Function]
unsigned int stdc_leading_zeros_ull (unsigned long long [Function]
int x)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The stdc_leading_zeros functions count the number of leading (most significant)
zero bits in x, starting from the most significant bit of the argument type. If x is
zero, they return the width of x in bits.
unsigned int stdc_leading_ones_uc (unsigned char x) [Function]
unsigned int stdc_leading_ones_us (unsigned short x) [Function]
unsigned int stdc_leading_ones_ui (unsigned int x) [Function]
unsigned int stdc_leading_ones_ul (unsigned long int x) [Function]
unsigned int stdc_leading_ones_ull (unsigned long long int [Function]
x)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 21: Bit Manipulation 693
CPU time measures the amount of time that a single process has actively used a CPU
to perform computations. It does not include the time that process has spent waiting for
external events. The system tracks the CPU time used by each process separately.
Processor time measures the amount of time any CPU has been in use by any process.
It is a basic system resource, since there’s a limit to how much can exist in any given interval
(the elapsed time of the interval times the number of CPUs in the computer)
People often call this CPU time, but we reserve the latter term in this manual for the
definition above.
time_t tv_sec
The number of whole seconds elapsed since the epoch (for a simple cal-
endar time) or since some other starting point (for an elapsed time).
long int tv_nsec
The number of nanoseconds elapsed since the time given by the tv_sec
member.
When struct timespec values are produced by GNU C Library func-
tions, the value in this field will always be greater than or equal to zero,
and less than 1,000,000,000. When struct timespec values are supplied
to GNU C Library functions, the value in this field must be in the same
range.
that a simple subtraction would overflow. However, if they are so far apart that a
double cannot exactly represent the difference, the result will be inexact.
On other systems, time_t values might be encoded in a way that prevents subtraction
from working directly, and then difftime would be the only way to compute their
difference.
The GNU C Library does not provide any functions for computing the difference be-
tween two values of type struct timespec or struct timeval. Here is one way to do this
calculation by hand. It works even on peculiar operating systems where the tv_sec member
has an unsigned type.
#include <stdckdint.h>
#include <time.h>
bool
timespec_subtract (struct timespec *r,
struct timespec x, struct timespec y)
{
/* Compute nanoseconds, setting borrow to 1 or 0
for propagation into seconds. */
long int nsec_diff = x.tv_nsec - y.tv_nsec;
bool borrow = nsec_diff < 0;
r->tv_nsec = nsec_diff + 1000000000 * borrow;
CLOCKS_PER_SEC [Macro]
The number of clock ticks per second.
to double can help code be more portable no matter what the underlying representation
is.
Note that the clock can wrap around. On a 32bit system with CLOCKS_PER_SEC set to
one million this function will return the same value approximately every 72 minutes.
For additional functions to examine a process’ use of processor time, and to control it,
see Chapter 23 [Resource Usage And Limitation], page 736.
start = clock();
... /* Do the work. */
end = clock();
cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;
Do not use a single CPU time as an amount of time; it doesn’t work that way. Either do
a subtraction as shown above or query processor time directly. See Section 22.4.2 [Processor
Time Inquiry], page 700.
Different computers and operating systems vary wildly in how they keep track of CPU
time. It’s common for the internal processor clock to have a resolution somewhere between
a hundredth and millionth of a second.
clock_t tms_utime
This is the total processor time the calling process has used in executing
the instructions of its program.
clock_t tms_stime
This is the processor time the system has used on behalf of the calling
process.
clock_t tms_cutime
This is the sum of the tms_utime values and the tms_cutime values of
all terminated child processes of the calling process, whose status has
been reported to the parent process by wait or waitpid; see Section 27.7
[Process Completion], page 862. In other words, it represents the total
processor time used in executing the instructions of all the terminated
child processes of the calling process, excluding child processes which
have not yet been reported by wait or waitpid.
clock_t tms_cstime
This is similar to tms_cutime, but represents the total processor time
the system has used on behalf of all the terminated child processes of the
calling process.
All of the times are given in numbers of clock ticks. Unlike CPU time, these are
the actual amounts of time; not relative to any event. See Section 27.4 [Creating a
Process], page 857.
Portability Note: The clock function described in Section 22.4.1 [CPU Time Inquiry],
page 700, is specified by the ISO C standard. The times function is a feature of POSIX.1.
On GNU systems, the CPU time is defined to be equivalent to the sum of the tms_utime
and tms_stime fields returned by times.
The return value is 0 on success and -1 on failure. The following errno error condition
is defined for this function:
EINVAL The clock identified by clock is not supported.
clock_gettime reports the time scaled to seconds and nanoseconds, but the actual
resolution of each clock may not be as fine as one nanosecond, and may not be the same for
all clocks. POSIX also provides a function for finding out the actual resolution of a clock:
Portability Note: On some systems, including systems that use older versions of the
GNU C Library, programs that use clock_gettime or clock_setres must be linked with
the -lrt library. This has not been necessary with the GNU C Library since version 2.17.
The following ISO C macros and functions for higher-resolution timestamps were stan-
dardized more recently than the POSIX functions, so they are less portable to older POSIX
systems. However, the ISO C functions are portable to C platforms that do not support
POSIX.
The previous functions, data types and constants are declared in time.h. The GNU
C Library also provides an older function for getting the current time with a resolution of
microseconds. This function is declared in sys/time.h.
Chapter 22: Date and Time 704
The return value is 0 on success and -1 on failure. The following errno error condi-
tions are defined for this function:
EINVAL The clock identified by clock is not supported or cannot be set at all, or
the simple calendar time in *ts is invalid (for instance, ts->tv_nsec is
negative or greater than 999,999,999).
EPERM This process does not have the privileges required to set the clock iden-
tified by clock.
Portability Note: On some systems, including systems that use older versions of the
GNU C Library, programs that use clock_settime must be linked with the -lrt
library. This has not been necessary with the GNU C Library since version 2.17.
For systems that remain up and running for long periods, it is not enough to set the
time once; one should also discipline the clock so that it does not drift away from the true
calendar time.
The ntp_gettime and ntp_adjtime functions provide an interface to monitor and disci-
pline the system clock. For example, you can fine-tune the rate at which the clock “ticks,”
and make small adjustments to the current reported calendar time smoothly, by temporarily
speeding up or slowing down the clock.
These functions’ names begin with ‘ntp_’ because they were designed for use by pro-
grams implementing the Network Time Protocol to synchronize a system’s clock with other
systems’ clocks and/or with external high-precision clock hardware.
These functions, and the constants and structures they use, are declared in sys/timex.h.
struct ntptimeval [Data Type]
This structure is used to report information about the system clock. It contains the
following members:
struct timeval time
The current calendar time, as if retrieved by gettimeofday. The struct
timeval data type is described in Section 22.2 [Time Types], page 697.
long int maxerror
This is the maximum error, measured in microseconds. Unless updated
via ntp_adjtime periodically, this value will reach some platform-specific
maximum value.
long int esterror
This is the estimated error, measured in microseconds. This value can be
set by ntp_adjtime to indicate the estimated offset of the system clock
from the true calendar time.
int ntp_gettime (struct ntptimeval *tptr) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The ntp_gettime function sets the structure pointed to by tptr to current values.
The elements of the structure afterwards contain the values the timer implementation
in the kernel assumes. They might or might not be correct. If they are not, an ntp_
adjtime call is necessary.
Chapter 22: Date and Time 706
The return value is 0 on success and other values on failure. The following errno
error conditions are defined for this function:
TIME_ERROR
The precision clock model is not properly set up at the moment, thus
the clock must be considered unsynchronized, and the values should be
treated with care.
struct timex [Data Type]
This structure is used to control and monitor the system clock. It contains the
following members:
unsigned int modes
This variable controls whether and which values are set. Several symbolic
constants have to be combined with binary or to specify the effective
mode. These constants start with MOD_.
long int offset
This value indicates the current offset of the system clock from the true
calendar time. The value is given in microseconds. If bit MOD_OFFSET is
set in modes, the offset (and possibly other dependent values) can be set.
The offset’s absolute value must not exceed MAXPHASE.
long int frequency
This value indicates the difference in frequency between the true calendar
time and the system clock. The value is expressed as scaled PPM (parts
per million, 0.0001%). The scaling is 1 << SHIFT_USEC. The value can
be set with bit MOD_FREQUENCY, but the absolute value must not exceed
MAXFREQ.
long int maxerror
This is the maximum error, measured in microseconds. A new value
can be set using bit MOD_MAXERROR. Unless updated via ntp_adjtime
periodically, this value will increase steadily and reach some platform-
specific maximum value.
long int esterror
This is the estimated error, measured in microseconds. This value can be
set using bit MOD_ESTERROR.
int status
This variable reflects the various states of the clock machinery. There are
symbolic constants for the significant bits, starting with STA_. Some of
these flags can be updated using the MOD_STATUS bit.
long int constant
This value represents the bandwidth or stiffness of the PLL (phase locked
loop) implemented in the kernel. The value can be changed using bit MOD_
TIMECONST.
long int precision
This value represents the accuracy or the maximum error when reading
the system clock. The value is expressed in microseconds.
Chapter 22: Date and Time 707
The return value is 0 on success and other values on failure. The following errno
error conditions are defined for this function:
TIME_ERROR
The high accuracy clock model is not properly set up at the moment, thus
the clock must be considered unsynchronized, and the values should be
treated with care. Another reason could be that the specified new values
are not allowed.
EPERM The process specified a settings update, but is not superuser.
For more details see RFC 5905 (Network Time Protocol, Version 4) and related doc-
uments.
Portability note: Early versions of the GNU C Library did not have this function,
but did have the synonymous adjtimex.
For compatibility, the GNU C Library also provides several older functions for controlling
the system time. New programs should prefer to use the functions above.
The return value is 0 on success and -1 on failure. The following errno error condition
is defined for this function:
EPERM This process does not have the privileges required to adjust the CLOCK_
REALTIME clock.
int tm_sec
This is the number of full seconds since the top of the minute (normally
in the range 0 through 59, but the actual upper limit is 60, to allow for
leap seconds if leap second support is available).
int tm_min
This is the number of full minutes since the top of the hour (in the range
0 through 59).
int tm_hour
This is the number of full hours past midnight (in the range 0 through
23).
int tm_mday
This is the ordinal day of the month (in the range 1 through 31). Watch
out for this one! As the only ordinal number in the structure, it is incon-
sistent with the rest of the structure.
int tm_mon
This is the number of full calendar months since the beginning of the year
(in the range 0 through 11). Watch out for this one! People usually use
ordinal numbers for month-of-year (where January = 1).
int tm_year
This is the number of full calendar years since 1900.
int tm_wday
This is the number of full days since Sunday (in the range 0 through 6).
int tm_yday
This is the number of full days since the beginning of the year (in the
range 0 through 365).
int tm_isdst
This is a flag that indicates whether daylight saving time is (or was, or
will be) in effect at the time described. The value is positive if daylight
saving time is in effect, zero if it is not, and negative if the information
is not available. Although this flag is useful when passing a broken-down
time to the mktime function, for other uses this flag should be ignored
and the tm_gmtoff and tm_zone fields should be inspected instead.
long int tm_gmtoff
This field describes the time zone that was used to compute this broken-
down time value, including any adjustment for daylight saving; it is the
number of seconds that you must add to UTC to get local time. You can
also think of this as the number of seconds east of the Prime Meridian.
For example, for U.S. Eastern Standard Time, the value is -5*60*60.
Chapter 22: Date and Time 711
Using the localtime function is a big problem in multi-threaded programs. The result
is returned in a static buffer and this is used in all threads. A variant function avoids this
problem.
As for the localtime function we have the problem that the result is placed in a static
variable. A thread-safe replacement is also provided for gmtime.
struct tm * gmtime_r (const time_t *time, struct tm [Function]
*resultp)
Preliminary: | MT-Safe env locale | AS-Unsafe heap lock | AC-Unsafe lock mem fd
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to localtime_r, except that it converts just like gmtime the
given time as UTC.
If the conversion is successful the function returns a pointer to the object the result
was written into, i.e., it returns resultp.
time_t mktime (struct tm *brokentime) [Function]
Preliminary: | MT-Safe env locale | AS-Unsafe heap lock | AC-Unsafe lock mem fd
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The mktime function converts a broken-down time structure to a simple time repre-
sentation. It also normalizes the contents of the broken-down time structure, and fills
in some components based on the values of the others.
The mktime function ignores the specified contents of the tm_wday, tm_yday, tm_
gmtoff, and tm_zone members of the broken-down time structure. It uses the values
of the other components to determine the calendar time; it’s permissible for these
components to have unnormalized values outside their normal ranges. The last thing
that mktime does is adjust the components of the brokentime structure, including the
members that were initially ignored.
If the specified broken-down time cannot be represented as a simple time, mktime
returns a value of (time_t)(-1) and does not modify the contents of brokentime.
Calling mktime also sets the time zone state as if tzset were called; mktime uses this
information instead of brokentime’s initial tm_gmtoff and tm_zone members. See
Section 22.5.7 [State Variables for Time Zones], page 729.
time_t timelocal (struct tm *brokentime) [Function]
Preliminary: | MT-Safe env locale | AS-Unsafe heap lock | AC-Unsafe lock mem fd
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
timelocal is functionally identical to mktime, but more mnemonically named. Note
that it is the inverse of the localtime function.
Portability note: mktime is essentially universally available. timelocal is rather rare.
time_t timegm (struct tm *brokentime) [Function]
Preliminary: | MT-Safe env locale | AS-Unsafe heap lock | AC-Unsafe lock mem fd
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
timegm is functionally identical to mktime except it always takes the input values to
be UTC regardless of any local time zone setting.
Note that timegm is the inverse of gmtime.
Portability note: mktime is essentially universally available. Although timegm is
standardized by C23, some other systems lack it; to be portable to them, you can set
the TZ environment variable to UTC, call mktime, then set TZ back.
Chapter 22: Date and Time 713
%h The abbreviated month name according to the current locale. The action
is the same as for %b.
%H The hour as a decimal number, using a 24-hour clock (range 00 through
23).
%I The hour as a decimal number, using a 12-hour clock (range 01 through
12).
%j The day of the year as a decimal number (range 001 through 366).
%k The hour as a decimal number, using a 24-hour clock like %H, but padded
with spaces (range 0 through 23).
This format is a GNU extension.
%l The hour as a decimal number, using a 12-hour clock like %I, but padded
with spaces (range 1 through 12).
This format is a GNU extension.
%m The month as a decimal number (range 01 through 12).
%M The minute as a decimal number (range 00 through 59).
%n A single ‘\n’ (newline) character.
%p Either ‘AM’ or ‘PM’, according to the given time value; or the corresponding
strings for the current locale. Noon is treated as ‘PM’ and midnight as
‘AM’. In most locales ‘AM’/‘PM’ format is not supported, in such cases "%p"
yields an empty string.
%P Either ‘am’ or ‘pm’, according to the given time value; or the corresponding
strings for the current locale, printed in lowercase characters. Noon is
treated as ‘pm’ and midnight as ‘am’. In most locales ‘AM’/‘PM’ format is
not supported, in such cases "%P" yields an empty string.
This format is a GNU extension.
%r The complete calendar time using the AM/PM format of the current
locale.
In the POSIX locale, this format is equivalent to %I:%M:%S %p.
%R The hour and minute in decimal numbers using the format %H:%M.
%s The number of seconds since the POSIX Epoch, i.e., since 1970-01-01
00:00:00 UTC. Leap seconds are not counted unless leap second support
is available.
This format is a GNU extension.
%S The seconds as a decimal number (range 00 through 60).
%t A single ‘\t’ (tabulator) character.
%T The time of day using decimal numbers using the format %H:%M:%S.
%u The day of the week as a decimal number (range 1 through 7), Monday
being 1.
Chapter 22: Date and Time 716
The size parameter can be used to specify the maximum number of characters to be
stored in the array s, including the terminating null character. If the formatted time
requires more than size characters, strftime returns zero and the contents of the
array s are undefined. Otherwise the return value indicates the number of characters
placed in the array s, not including the terminating null character.
Warning: This convention for the return value which is prescribed in ISO C can lead
to problems in some situations. For certain format strings and certain locales the
output really can be the empty string and this cannot be discovered by testing the
return value only. E.g., in most locales the AM/PM time format is not supported
(most of the world uses the 24 hour time representation). In such locales "%p" will
return the empty string, i.e., the return value is zero. To detect situations like this
something similar to the following code should be used:
buf[0] = '\1';
len = strftime (buf, bufsize, format, tp);
if (len == 0 && buf[0] != '\0')
{
/* Something went wrong in the strftime call. */
...
}
If s is a null pointer, strftime does not actually write anything, but instead returns
the number of characters it would have written.
Calling strftime also sets the time zone state as if tzset were called. See Sec-
tion 22.5.7 [State Variables for Time Zones], page 729.
For an example of strftime, see Section 22.5.8 [Time Functions Example], page 731.
The return value of wcsftime is the number of wide characters stored in s. When
more characters would have to be written than can be placed in the buffer s the return
value is zero, with the same problems indicated in the strftime documentation.
Calling ctime also sets the time zone state as if tzset were called. See Section 22.5.7
[State Variables for Time Zones], page 729.
Portability note: This obsolescent function is deprecated in C23. Programs should
instead use strftime or even sprintf.
Deprecated function char * ctime_r (const time_t *time, [Function]
char *buffer)
Preliminary: | MT-Safe env locale | AS-Unsafe heap lock | AC-Unsafe lock mem fd
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to ctime, but places the result in the string pointed to by
buffer, and the time zone state is not necessarily set as if tzset were called. It is
equivalent to:
asctime_r (localtime_r (time, &(struct tm) {0}), buffer)
Behavior is undefined if the calculated year would be less than 1000 or greater than
9999.
If no error occurred the function returns a pointer to the string the result was written
into, i.e., it returns buffer. Otherwise it returns NULL.
Portability Note: POSIX.1-2024 removed this obsolescent function. Programs should
instead use strftime or even sprintf.
The format string consists of the same components as the format string of the
strftime function. The only difference is that the flags _, -, 0, and ^ are not
allowed. Several of the distinct formats of strftime do the same work in strptime
since differences like case of the input do not matter. For reasons of symmetry all
formats are supported, though.
The modifiers E and O are also allowed everywhere the strftime function allows them.
The formats are:
%a
%A The weekday name according to the current locale, in abbreviated form
or the full name.
%b
%B
%h A month name according to the current locale. All three specifiers will
recognize both abbreviated and full month names. If the locale provides
two different grammatical forms of month names, all three specifiers will
recognize both forms.
As a GNU extension, the O modifier can be used with these specifiers; it
has no effect, as both grammatical forms of month names are recognized.
%c The date and time representation for the current locale.
%Ec Like %c but the locale’s alternative date and time format is used.
%C The century of the year.
It makes sense to use this format only if the format string also contains
the %y format.
%EC The locale’s representation of the period.
Unlike %C it sometimes makes sense to use this format since some cul-
tures represent years relative to the beginning of eras instead of using the
Gregorian years.
%d
%e The day of the month as a decimal number (range 1 through 31). Leading
zeroes are permitted but not required.
%Od
%Oe Same as %d but using the locale’s alternative numeric symbols.
Leading zeroes are permitted but not required.
%D Equivalent to %m/%d/%y.
%F Equivalent to %Y-%m-%d, which is the ISO 8601 date format.
This is a GNU extension following an ISO C99 extension to strftime.
%g The year corresponding to the ISO week number, but without the century
(range 00 through 99).
Note: Currently, this is not fully implemented. The format is recognized,
input is consumed but no field in tm is set.
This format is a GNU extension following a GNU extension of strftime.
Chapter 22: Date and Time 721
The specification of the function in the XPG standard is rather vague, leaving out a
few important pieces of information. Most importantly, it does not specify what happens
to those elements of tm which are not directly initialized by the different formats. The
implementations on different Unix systems vary here.
The GNU C Library implementation does not touch those fields which are not directly
initialized. Exceptions are the tm_wday and tm_yday elements, which are recomputed if any
of the year, month, or date elements changed. This has two implications:
Chapter 22: Date and Time 724
• Before calling the strptime function for a new input string, you should prepare the tm
structure you pass. Normally this will mean initializing all values to zero. Alternatively,
you can set all fields to values like INT_MAX, allowing you to determine which elements
were set by the function call. Zero does not work here since it is a valid value for many
of the fields.
Careful initialization is necessary if you want to find out whether a certain field in tm
was initialized by the function call.
• You can construct a struct tm value with several consecutive strptime calls. A useful
application of this is e.g. the parsing of two separate strings, one containing date
information and the other time information. By parsing one after the other without
clearing the structure in-between, you can construct a complete broken-down time.
The following example shows a function which parses a string which contains the date
information in either US style or ISO 8601 form:
const char *
parse_date (const char *input, struct tm *tm)
{
const char *cp;
return cp;
}
getdate_err [Variable]
This variable of type int contains the error code of the last unsuccessful call to
getdate. Defined values are:
1 The environment variable DATEMSK is not defined or null.
2 The template file denoted by the DATEMSK environment variable cannot
be opened.
3 Information about the template file cannot retrieved.
4 The template file is not a regular file.
5 An I/O error occurred while reading the template file.
Chapter 22: Date and Time 725
%A %B %d, %Y %H:%M:%S
%A
%B
%m/%d/%y %I %p
%d,%m,%Y %H:%M
at %A the %dst of %B in %Y
run job at %I %p,%B %dnd
%A den %d. %B %Y %H.%M Uhr
As you can see, the template list can contain very specific strings like run job at %I
%p,%B %dnd. Using the above list of templates and assuming the current time is Mon
Sep 22 12:19:47 EDT 1986, we can obtain the following results for the given input.
Input Match Result
Mon %a Mon Sep 22 12:19:47 EDT 1986
Sun %a Sun Sep 28 12:19:47 EDT 1986
Fri %a Fri Sep 26 12:19:47 EDT 1986
September %B Mon Sep 1 12:19:47 EDT 1986
January %B Thu Jan 1 12:19:47 EST 1987
December %B Mon Dec 1 12:19:47 EST 1986
Sep Mon %b %a Mon Sep 1 12:19:47 EDT 1986
Jan Fri %b %a Fri Jan 2 12:19:47 EST 1987
Dec Mon %b %a Mon Dec 1 12:19:47 EST 1986
Jan Wed 1989 %b %a %Y Wed Jan 4 12:19:47 EST 1989
Fri 9 %a %H Fri Sep 26 09:00:00 EDT 1986
Feb 10:30 %b %H:%S Sun Feb 1 10:00:30 EST 1987
10:30 %H:%M Tue Sep 23 10:30:00 EDT 1986
13:30 %H:%M Mon Sep 22 13:30:00 EDT 1986
The return value of the function is a pointer to a static variable of type struct tm,
or a null pointer if an error occurred. The result is only valid until the next getdate
call, making this function unusable in multi-threaded applications.
The errno variable is not changed. Error conditions are stored in the global variable
getdate_err. See the description above for a list of the possible error values.
Warning: The getdate function should never be used in SUID-programs. The reason
is obvious: using the DATEMSK environment variable you can get the function to open
any arbitrary file and chances are high that with some bogus input (such as a binary
file) the program will crash.
data files describing time zone rulesets in many different parts of the world. The names rep-
resent major cities, with subdirectories for geographical areas; for example, America/New_
York, Europe/London, Asia/Tokyo. These data files are installed by the system admin-
istrator, who also sets /etc/localtime to point to the data file for the local time zone
ruleset.
If the file corresponding to characters cannot be read or has invalid data, and characters
are not in the proleptic format, then the GNU C Library silently defaults to UTC. However,
applications should not depend on this, as TZ formats may be extended in the future.
n This specifies the Julian day, with n between 0 and 365. February 29 is counted
in leap years.
Mm.w.d This specifies day d of week w of month m. The day d must be between 0
(Sunday) and 6. The week w must be between 1 and 5; week 1 is the first week
in which day d occurs, and week 5 specifies the last d day in the month. The
month m should be between 1 and 12.
The time fields specify when, in the local time currently in effect, the change to the
other time occurs. They have the same format as offset except the hours part can range
from −167 through 167; for example, -22:30 stands for 01:30 the previous day and 25:30
stands for 01:30 the next day. If omitted, time defaults to 02:00:00.
Here are example TZ values with daylight saving time rules.
‘EST+5EDT,M3.2.0/2,M11.1.0/2’
In North American Eastern Standard Time (EST) and Eastern Daylight Time
(EDT), the normal offset from UTC is 5 hours; since this is west of the Prime
Meridian, the sign is positive. Summer time begins on March’s second Sunday
at 2:00am, and ends on November’s first Sunday at 2:00am.
‘IST-2IDT,M3.4.4/26,M10.5.0’
Israel Standard Time (IST) and Israel Daylight Time (IDT) are 2 hours ahead
of the prime meridian in winter, springing forward an hour on March’s fourth
Thursday at 26:00 (i.e., 02:00 on the first Friday on or after March 23), and
falling back on October’s last Sunday at 02:00.
‘IST-1GMT0,M10.5.0,M3.5.0/1’
Irish Standard Time (IST) is 1 hour behind the Prime Meridian in summer,
falling forward to Greenwich Mean Time (GMT, the Prime Meridian’s time),
on October’s last Sunday at 00:00 and springing back on March’s last Sunday
at 01:00. This is an example of “negative daylight saving”; here, daylight saving
time is one hour west of standard time instead of the more usual one hour east.
‘<-02>+2<-01>,M3.5.0/-1,M10.5.0/0’
Most of Greenland is 2 hours behind UTC in winter. Clocks follow the European
Union rules of springing forward by one hour on March’s last Sunday at 01:00
UTC (−01:00 local time) and falling back on October’s last Sunday at 01:00
UTC (00:00 local time). The numeric abbreviations ‘-02’ and ‘-01’ stand for
standard and daylight saving time, respectively.
The schedule of daylight saving time in any particular jurisdiction has changed over the
years. To be strictly correct, the conversion of dates and times in the past should be based
on the schedule that was in effect then. However, the proleptic format does not let you
specify how the schedule has changed from year to year. The most you can do is specify
one particular schedule—usually the present day schedule—and this is used to convert any
date, no matter when. For precise time zone specifications, it is best to use the geographical
format. See Section 22.5.6.1 [Geographical Format for TZ], page 727.
variables are obsolescent and are planned to be removed in a future version of POSIX, and
programs generally should avoid them because they are not thread-safe and their values
are specified only when TZ uses the proleptic format. See Section 22.5.6 [Specifying the
Time Zone with TZ], page 727. Programs should instead use the tm_gmtoff and tm_zone
members of struct tm. See Section 22.5.3 [Broken-down Time], page 709.
#include <time.h>
#include <stdio.h>
int
main (void)
{
/* This buffer is big enough that the strftime calls
below cannot possibly exhaust it. */
char buf[256];
return 0;
}
It produces output like this:
2024-06-09 13:50:06
Today is Sunday, June 09.
The time is 01:50 PM.
This timer is useful for profiling in interpreters. The interval timer mechanism does
not have the fine granularity necessary for profiling native code.
You can only have one timer of each kind set at any given time. If you set a timer that
has not yet expired, that timer is simply reset to the new value.
You should establish a handler for the appropriate alarm signal using signal or
sigaction before issuing a call to setitimer or alarm. Otherwise, an unusual chain of
events could cause the timer to expire before your program establishes the handler. In this
case it would be terminated, since termination is the default action for the alarm signals.
See Chapter 25 [Signal Handling], page 766.
To be able to use the alarm function to interrupt a system call which might block
otherwise indefinitely it is important to not set the SA_RESTART flag when registering the
signal handler using sigaction. When not using sigaction things get even uglier: the
signal function has fixed semantics with respect to restarts. The BSD semantics for this
function is to set the flag. Therefore, if sigaction for whatever reason cannot be used, it
is necessary to use sysv_signal and not signal.
The setitimer function is the primary means for setting an alarm. This facility is
declared in the header file sys/time.h. The alarm function, declared in unistd.h, provides
a somewhat simpler interface for setting the real-time timer.
struct itimerval [Data Type]
This structure is used to specify when a timer should expire. It contains the following
members:
struct timeval it_interval
This is the period between successive timer interrupts. If zero, the alarm
will only be sent once.
struct timeval it_value
This is the period between now and the first timer interrupt. If zero, the
alarm is disabled.
The struct timeval data type is described in Section 22.2 [Time Types], page 697.
int setitimer (int which, const struct itimerval *new, [Function]
struct itimerval *old)
Preliminary: | MT-Safe timer | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
The setitimer function sets the timer specified by which according to new. The
which argument can have a value of ITIMER_REAL, ITIMER_VIRTUAL, or ITIMER_PROF.
If old is not a null pointer, setitimer returns information about any previous unex-
pired timer of the same kind in the structure it points to.
The return value is 0 on success and -1 on failure. The following errno error condi-
tions are defined for this function:
EINVAL The timer period is too large.
int getitimer (int which, struct itimerval *old) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Chapter 22: Date and Time 733
The getitimer function stores information about the timer specified by which in the
structure pointed at by old.
The return value and error conditions are the same as for setitimer.
ITIMER_REAL
This constant can be used as the which argument to the setitimer and
getitimer functions to specify the real-time timer.
ITIMER_VIRTUAL
This constant can be used as the which argument to the setitimer and
getitimer functions to specify the virtual timer.
ITIMER_PROF
This constant can be used as the which argument to the setitimer and
getitimer functions to specify the profiling timer.
22.7 Sleeping
The function sleep gives a simple way to make the program wait for a short interval.
If your program doesn’t use signals (except to terminate), then you can expect sleep to
wait reliably throughout the specified interval. Otherwise, sleep can return sooner if a
signal arrives; if you want to wait for a given interval regardless of signals, use select (see
Section 13.9 [Waiting for Input or Output], page 374) and don’t specify any descriptors to
wait for.
Resist the temptation to implement a sleep for a fixed amount of time by using the
return value of sleep, when nonzero, to call sleep again. This will work with a certain
amount of accuracy as long as signals arrive infrequently. But each signal can cause the
eventual wakeup time to be off by an additional second or so. Suppose a few signals happen
to arrive in rapid succession by bad luck—there is no limit on how much this could shorten
or lengthen the wait.
Instead, compute the calendar time at which the program should stop waiting, and keep
trying to wait until that calendar time. This won’t be off by more than a second. With just
a little more work, you can use select and make the waiting period quite accurate. (Of
course, heavy system load can cause additional unavoidable delays—unless the machine is
dedicated to one application, there is no way you can avoid this.)
On some systems, sleep can do strange things if your program uses SIGALRM explicitly.
Even if SIGALRM signals are being ignored or blocked when sleep is called, sleep might
return prematurely on delivery of a SIGALRM signal. If you have established a handler for
SIGALRM signals and a SIGALRM signal is delivered while the process is sleeping, the action
taken might be just to cause sleep to return instead of invoking your handler. And, if
sleep is interrupted by delivery of a signal whose handler requests an alarm or alters the
handling of SIGALRM, this handler and sleep will interfere.
On GNU systems, it is safe to use sleep and SIGALRM in the same program, because
sleep does not work by means of SIGALRM.
you request up to the next integer multiple of the actual resolution the system can
deliver.
*requested_time is the elapsed time of the interval you want to sleep.
The function returns as *remaining the elapsed time left in the interval for which
you requested to sleep. If the interval completed without getting interrupted by a
signal, this is zero.
struct timespec is described in Section 22.2 [Time Types], page 697.
If the function returns because the interval is over the return value is zero. If the
function returns −1 the global variable errno is set to the following values:
EINTR The call was interrupted because a signal was delivered to the thread. If
the remaining parameter is not the null pointer the structure pointed to
by remaining is updated to contain the remaining elapsed time.
EINVAL The nanosecond value in the requested time parameter contains an illegal
value. Either the value is negative or greater than or equal to 1000 million.
This function is a cancellation point in multi-threaded programs. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time nanosleep is called. If the thread gets canceled these resources
stay allocated until the program ends. To avoid this calls to nanosleep should be
protected using cancellation handlers.
The nanosleep function is declared in time.h.
736
a process to get around it. A process may lower its own maximum limit, but
only the superuser may increase a maximum limit.
The symbols for use with getrlimit, setrlimit, getrlimit64, and setrlimit64 are
defined in sys/resource.h.
int getrlimit (int resource, struct rlimit *rlp) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Read the current and maximum limits for the resource resource and store them in
*rlp.
The return value is 0 on success and -1 on failure. The only possible errno error
condition is EFAULT.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32-bit system
this function is in fact getrlimit64. Thus, the LFS interface transparently replaces
the old interface.
int getrlimit64 (int resource, struct rlimit64 *rlp) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to getrlimit but its second parameter is a pointer to a
variable of type struct rlimit64, which allows it to read values which wouldn’t fit
in the member of a struct rlimit.
If the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32-bit machine, this
function is available under the name getrlimit and so transparently replaces the old
interface.
int setrlimit (int resource, const struct rlimit *rlp) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
Store the current and maximum limits for the resource resource in *rlp.
The return value is 0 on success and -1 on failure. The following errno error condition
is possible:
EPERM
• The process tried to raise a current limit beyond the maximum limit.
• The process tried to raise a maximum limit, but is not superuser.
When the sources are compiled with _FILE_OFFSET_BITS == 64 on a 32-bit system
this function is in fact setrlimit64. Thus, the LFS interface transparently replaces
the old interface.
int setrlimit64 (int resource, const struct rlimit64 *rlp) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function is similar to setrlimit but its second parameter is a pointer to a
variable of type struct rlimit64 which allows it to set values which wouldn’t fit in
the member of a struct rlimit.
Chapter 23: Resource Usage And Limitation 739
RLIMIT_RSS
The maximum amount of physical memory that this process should get. This
parameter is a guide for the system’s scheduler and memory allocator; the
system may give the process more memory when there is a surplus.
RLIMIT_MEMLOCK
The maximum amount of memory that can be locked into physical memory (so
it will never be paged out).
RLIMIT_NPROC
The maximum number of processes that can be created with the same user ID.
If you have reached the limit for your user ID, fork will fail with EAGAIN. See
Section 27.4 [Creating a Process], page 857.
RLIMIT_NOFILE
RLIMIT_OFILE
The maximum number of files that the process can open. If it tries to open
more files than this, its open attempt fails with errno EMFILE. See Section 2.2
[Error Codes], page 25. Not all systems support this limit; GNU does, and 4.4
BSD does.
RLIMIT_AS
The maximum size of total memory that this process should get. If the process
tries to allocate more memory beyond this amount with, for example, brk,
malloc, mmap or sbrk, the allocation function fails.
RLIM_NLIMITS
The number of different resource limits. Any valid resource operand must be
less than RLIM_NLIMITS.
The following are historical functions to do some of what the functions above do. The
functions above are better choices.
ulimit and the command symbols are declared in ulimit.h.
SETFSIZE Set the current and maximum limit on the size of a file to limit * 512
bytes.
There are also some other cmd values that may do things on some systems, but they
are not supported.
Only the superuser may increase a maximum limit.
When you successfully get a limit, the return value of ulimit is that limit, which is
never negative. When you successfully set a limit, the return value is zero. When the
function fails, the return value is -1 and errno is set according to the reason:
EPERM A process tried to increase a maximum limit, but is not superuser.
scheduling algorithms. This section discusses the general concepts, some specifics of systems
that commonly use the GNU C Library, and some standards.
For simplicity, we talk about CPU contention as if there is only one CPU in the system.
But all the same principles apply when a processor has multiple CPUs, and knowing that
the number of processes that can run at any one time is equal to the number of CPUs, you
can easily extrapolate the information.
The functions described in this section are all defined by the POSIX.1 and POSIX.1b
standards (the sched... functions are POSIX.1b). However, POSIX does not define any
semantics for the values that these functions get and set. In this chapter, the semantics are
based on the Linux kernel’s implementation of the POSIX standard. As you will see, the
Linux implementation is quite the inverse of what the authors of the POSIX syntax had in
mind.
Don’t try to make too much out of the naming and structure of these functions. They
don’t match the concepts described in this manual because the functions are as defined
by POSIX.1b, but the implementation on systems that use the GNU C Library is the
inverse of what the POSIX structure contemplates. The POSIX scheme assumes that the
primary scheduling parameter is the scheduling policy and that the priority value, if any, is
a parameter of the scheduling policy. In the implementation, though, the priority value is
king and the scheduling policy, if anything, only fine tunes the effect of that priority.
The symbols in this section are declared by including file sched.h.
Portability Note: In POSIX, the pid_t arguments of the functions below refer to process
IDs. On Linux, they are actually thread IDs, and control how specific threads are scheduled
with regards to the entire system. The resulting behavior does not conform to POSIX. This
is why the following description refers to tasks and tasks IDs, and not processes and process
IDs.
EINVAL
• policy does not identify an existing scheduling policy.
• The absolute priority value identified by *param is outside the valid
range for the scheduling policy policy (or the existing scheduling
policy if policy is negative) or param is null. sched_get_priority_
max and sched_get_priority_min tell you what the valid range is.
• pid is negative.
If there are no other tasks that share the calling task’s absolute priority, this function
doesn’t have any effect.
To the extent that the containing program is oblivious to what other processes in the
system are doing and how fast it executes, this function appears as a no-op.
The return value is 0 on success and in the pathological case that it fails, the return
value is -1 and errno is set accordingly. There is nothing specific that can go wrong
with this function, so there are no specific errno values.
On a typical Linux system, for example, a process with a nice value of 20 can get only 10
milliseconds on the CPU at a time, whereas a process with a nice value of -20 can achieve
a high enough priority to get 400 milliseconds.
The idea of the nice value is deferential courtesy. In the beginning, in the Unix garden
of Eden, all processes shared equally in the bounty of the computer system. But not all
processes really need the same share of CPU time, so the nice value gave a courteous process
the ability to refuse its equal share of CPU time that others might prosper. Hence, the higher
a process’ nice value, the nicer the process is. (Then a snake came along and offered some
process a negative nice value and the system became the crass resource allocation system
we know today.)
Dynamic priorities tend upward and downward with an objective of smoothing out allo-
cation of CPU time and giving quick response time to infrequent requests. But they never
exceed their nice limits, so on a heavily loaded CPU, the nice value effectively determines
how fast a process runs.
In keeping with the socialistic heritage of Unix process priority, a process begins life with
the same nice value as its parent process and can raise it at will. A process can also raise
the nice value of any other process owned by the same user (or effective user). But only
a privileged process can lower its nice value. A privileged process can also raise or lower
another process’ nice value.
GNU C Library functions for getting and setting nice values are described in See Sec-
tion 23.3.4.2 [Functions For Traditional Scheduling], page 749.
If the return value is -1, it could indicate failure, or it could be the nice value. The
only way to make certain is to set errno = 0 before calling getpriority, then use
errno != 0 afterward as the criterion for failure.
The arguments class and id together specify a set of processes in which you are interested.
These are the possible values of class:
PRIO_PROCESS
One particular process. The argument id is a process ID (pid).
PRIO_PGRP
All the processes in a particular process group. The argument id is a process
group ID (pgid).
PRIO_USER
All the processes owned by a particular user (i.e., whose real uid indicates the
user). The argument id is a user ID (uid).
If the argument id is 0, it stands for the calling process, its process group, or its owner
(real uid), according to class.
To manipulate the bitset, to set and reset bits, a number of macros are defined. Some
of the macros take a CPU number as a parameter. Here it is important to never exceed the
size of the bitset. The following macro specifies the number of bits in the cpu_set_t bitset.
The type cpu_set_t should be considered opaque; all manipulation should happen via
the next four macros.
CPU bitsets can be constructed from scratch or the currently installed affinity mask can
be retrieved from the system.
Note that it is not portably possible to use this information to retrieve the information
for different POSIX threads. A separate interface must be provided for that.
The correct interface to query about the page size is sysconf (see Section 33.4.1 [Def-
inition of sysconf], page 946) with the parameter _SC_PAGESIZE. There is a much older
interface available, too.
Widely available on System V derived systems is a method to get information about the
physical memory the system has. The call
sysconf (_SC_PHYS_PAGES)
returns the total number of pages of physical memory the system has. This does not mean
all this memory is available. This information can be found using
sysconf (_SC_AVPHYS_PAGES)
These two values help to optimize applications. The value returned for _SC_AVPHYS_
PAGES is the amount of memory the application can use without hindering any other process
(given that no other process increases its memory usage). The value returned for _SC_PHYS_
PAGES is more or less a hard limit for the working set. If all applications together constantly
use more than that amount of memory the system is in trouble.
The GNU C Library provides in addition to these already described way to get this
information two functions. They are declared in the file sys/sysinfo.h. Programmers
should prefer to use the sysconf method described above.
Before starting more threads it should be checked whether the processors are not already
overused. Unix systems calculate something called the load average. This is a number
indicating how many processes were running. This number is an average over different
periods of time (normally 1, 5, and 15 minutes).
24 Non-Local Exits
Sometimes when your program detects an unusual situation inside a deeply nested set of
function calls, you would like to be able to immediately return to an outer level of control.
This section describes how you can do such non-local exits using the setjmp and longjmp
functions.
#include <setjmp.h>
#include <stdlib.h>
#include <stdio.h>
jmp_buf main_loop;
void
abort_to_main_loop (int status)
{
longjmp (main_loop, status);
}
int
main (void)
Chapter 24: Non-Local Exits 758
{
while (1)
if (setjmp (main_loop))
puts ("Back at main loop....");
else
do_command ();
}
void
do_command (void)
{
char buffer[128];
if (fgets (buffer, 128, stdin) == NULL)
abort_to_main_loop (-1);
else
exit (EXIT_SUCCESS);
}
The function abort_to_main_loop causes an immediate transfer of control back to the
main loop of the program, no matter where it is called from.
The flow of control inside the main function may appear a little mysterious at first, but
it is actually a common idiom with setjmp. A normal call to setjmp returns zero, so the
“else” clause of the conditional is executed. If abort_to_main_loop is called somewhere
within the execution of do_command, then it actually appears as if the same call to setjmp
in main were returning a second time with a value of -1.
So, the general pattern for using setjmp looks something like:
if (setjmp (buffer))
/* Code to clean up after premature return. */
...
else
/* Code to be executed normally after setting up the return point. */
...
This function restores current execution to the state saved in state, and continues
execution from the call to setjmp that established that return point. Returning from
setjmp by means of longjmp returns the value argument that was passed to longjmp,
rather than 0. (But if value is given as 0, setjmp returns 1).
There are a lot of obscure but important restrictions on the use of setjmp and longjmp.
Most of these restrictions are present because non-local exits require a fair amount of magic
on the part of the C compiler and can interact with other parts of the language in strange
ways.
The setjmp function is actually a macro without an actual function definition, so you
shouldn’t try to ‘#undef’ it or take its address. In addition, calls to setjmp are safe in only
the following contexts:
• As the test expression of a selection or iteration statement (such as ‘if’, ‘switch’, or
‘while’).
• As one operand of an equality or comparison operator that appears as the test ex-
pression of a selection or iteration statement. The other operand must be an integer
constant expression.
• As the operand of a unary ‘!’ operator, that appears as the test expression of a selection
or iteration statement.
• By itself as an expression statement.
Return points are valid only during the dynamic extent of the function that called setjmp
to establish them. If you longjmp to a return point that was established in a function that
has already returned, unpredictable and disastrous things are likely to happen.
You should use a nonzero value argument to longjmp. While longjmp refuses to pass
back a zero argument as the return value from setjmp, this is intended as a safety net
against accidental misuse and is not really good programming style.
When you perform a non-local exit, accessible objects generally retain whatever values
they had at the time longjmp was called. The exception is that the values of automatic
variables local to the function containing the setjmp call that have been changed since the
call to setjmp are indeterminate, unless you have declared them volatile.
The getcontext function is similar to setjmp but it does not provide an indication of
whether getcontext is returning for the first time or whether an initialized context has
just been restored. If this is necessary the user has to determine this herself. This must be
done carefully since the context contains registers which might contain register variables.
This is a good situation to define variables with volatile.
Once the context variable is initialized it can be used as is or it can be modified using
the makecontext function. The latter is normally done when implementing co-routines or
similar constructs.
While allocating the memory for the stack one has to be careful. Most modern processors
keep track of whether a certain memory region is allowed to contain code which is executed
or not. Data segments and heap memory are normally not tagged to allow this. The result
is that programs would fail. Examples for such code include the calling sequences the GNU
C compiler generates for calls to nested functions. Safe ways to allocate stacks correctly
include using memory on the original thread’s stack or explicitly allocating memory tagged
for execution using (see Section 13.8 [Memory-mapped I/O], page 366).
Chapter 24: Non-Local Exits 762
Compatibility note: The current Unix standard is very imprecise about the way the stack
is allocated. All implementations seem to agree that the uc_stack element must be used
but the values stored in the elements of the stack_t value are unclear. The GNU C Library
and most other Unix implementations require the ss_sp value of the uc_stack element to
point to the base of the memory region allocated for the stack and the size of the memory
region is stored in ss_size. There are implementations out there which require ss_sp to
be set to the value the stack pointer will have (which can, depending on the direction the
stack grows, be different). This difference makes the makecontext function hard to use and
it requires detection of the platform at compile time.
int setcontext (const ucontext_t *ucp) [Function]
Preliminary: | MT-Safe race:ucp | AS-Unsafe corrupt | AC-Unsafe corrupt | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The setcontext function restores the context described by ucp. The context is not
modified and can be reused as often as wanted.
If the context was created by getcontext execution resumes with the registers filled
with the same values and the same stack as if the getcontext call just returned.
If the context was modified with a call to makecontext execution continues with the
function passed to makecontext which gets the specified parameters passed. If this
function returns execution is resumed in the context which was referenced by the
uc_link element of the context structure passed to makecontext at the time of the
call. If uc_link was a null pointer the application terminates normally with an exit
status value of EXIT_SUCCESS (see Section 26.7 [Program Termination], page 851).
If the context was created by a call to a signal handler or from any other source then
the behaviour of setcontext is unspecified.
Since the context contains information about the stack no two threads should use the
same context at the same time. The result in most cases would be disastrous.
The setcontext function does not return unless an error occurred in which case it
returns -1.
The setcontext function simply replaces the current context with the one described by
the ucp parameter. This is often useful but there are situations where the current context
has to be preserved.
int swapcontext (ucontext_t *restrict oucp, const [Function]
ucontext_t *restrict ucp)
Preliminary: | MT-Safe race:oucp race:ucp | AS-Unsafe corrupt | AC-Unsafe corrupt
| See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The swapcontext function is similar to setcontext but instead of just replacing the
current context the latter is first saved in the object pointed to by oucp as if this was
a call to getcontext. The saved context would resume after the call to swapcontext.
Once the current context is saved the context described in ucp is installed and exe-
cution continues as described in this context.
If swapcontext succeeds the function does not return unless the context oucp is used
without prior modification by makecontext. The return value in this case is 0. If the
function fails it returns -1 and sets errno accordingly.
Chapter 24: Non-Local Exits 763
/* Not found. */
return 0;
}
Using contexts in such a way enables emulating exception handling. The search functions
passed in the fp parameter could be very large, nested, and complex which would make it
complicated (or at least would require a lot of code) to leave the function with an error
value which has to be passed down to the caller. By using the context it is possible to leave
the search function in one step and allow restarting the search which also has the nice side
effect that it can be significantly faster.
Something which is harder to implement with setjmp and longjmp is to switch tem-
porarily to a different execution path and then resume where execution was stopped.
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <ucontext.h>
#include <sys/time.h>
/* The contexts. */
static ucontext_t uc[3];
f (int n)
{
int m = 0;
while (1)
{
/* This is where the work would be done. */
if (++m % 100 == 0)
{
putchar ('.');
fflush (stdout);
}
int
main (void)
{
struct sigaction sa;
struct itimerval it;
char st1[8192];
char st2[8192];
/* Start running. */
swapcontext (&uc[0], &uc[1]);
putchar ('\n');
return 0;
}
This an example how the context functions can be used to implement co-routines or coop-
erative multi-threading. All that has to be done is to call every once in a while swapcontext
to continue running a different context. It is not recommended to do the context switching
from the signal handler directly since leaving the signal handler via setcontext if the signal
was delivered during code that was not asynchronous signal safe could lead to problems.
Setting a variable in the signal handler and checking it in the body of the functions which
are executed is a safer approach. Since swapcontext is saving the current context it is
possible to have multiple different scheduling points in the code. Execution will always
resume where it was left.
766
25 Signal Handling
A signal is a software interrupt delivered to a process. The operating system uses sig-
nals to report exceptional situations to an executing program. Some signals report errors
such as references to invalid memory addresses; others report asynchronous events, such as
disconnection of a phone line.
The GNU C Library defines a variety of signal types, each for a particular kind of event.
Some kinds of events make it inadvisable or impossible for the program to proceed as usual,
and the corresponding signals normally abort the program. Other kinds of signals that
report harmless events are ignored by default.
If you anticipate an event that causes signals, you can define a handler function and tell
the operating system to run it when that particular type of signal arrives.
Finally, one process can send a signal to another process; this allows a parent process to
abort a child, or two related processes to communicate and synchronize.
An error means that a program has done something invalid and cannot continue exe-
cution. But not all kinds of errors generate signals—in fact, most do not. For example,
opening a nonexistent file is an error, but it does not raise a signal; instead, open returns -1.
In general, errors that are necessarily associated with certain library functions are reported
by returning a value that indicates an error. The errors which raise signals are those which
can happen anywhere in the program, not just in library calls. These include division by
zero and invalid memory addresses.
An external event generally has to do with I/O or other processes. These include the
arrival of input, the expiration of a timer, and the termination of a child process.
An explicit request means the use of a library function such as kill whose purpose is
specifically to generate a signal.
Signals may be generated synchronously or asynchronously. A synchronous signal per-
tains to a specific action in the program, and is delivered (unless blocked) during that
action. Most errors generate signals synchronously, and so do explicit requests by a process
to generate a signal for that same process. On some machines, certain kinds of hardware
errors (usually floating-point exceptions) are not reported completely synchronously, but
may arrive a few instructions later.
Asynchronous signals are generated by events outside the control of the process that
receives them. These signals arrive at unpredictable times during execution. External
events generate signals asynchronously, and so do explicit requests that apply to some
other process.
A given type of signal is either typically synchronous or typically asynchronous. For
example, signals for errors are typically synchronous because errors generate signals syn-
chronously. But any type of signal can be generated synchronously or asynchronously with
an explicit request.
tion 25.2 [Standard Signals], page 768). For most kinds of signals, the default action is to
terminate the process. For certain kinds of signals that represent “harmless” events, the
default action is to do nothing.
When a signal terminates a process, its parent process can determine the cause of termi-
nation by examining the termination status code reported by the wait or waitpid functions.
(This is discussed in more detail in Section 27.7 [Process Completion], page 862.) The in-
formation it can get includes the fact that termination was due to a signal and the kind
of signal involved. If a program you run from a shell is terminated by a signal, the shell
typically prints some kind of error message.
The signals that normally represent program errors have a special property: when one of
these signals terminates the process, it also writes a core dump file which records the state
of the process at the time of termination. You can examine the core dump with a debugger
to investigate what caused the error.
If you raise a “program error” signal by explicit request, and this terminates the process,
it makes a core dump file just as if the signal had been due directly to an error.
The default action for all of these signals is to cause the process to terminate. If you block
or ignore these signals or establish handlers for them that return normally, your program
will probably break horribly when such signals happen, unless they are generated by raise
or kill instead of a real error.
When one of these program error signals terminates a process, it also writes a core dump
file which records the state of the process at the time of termination. The core dump file is
named core and is written in whichever directory is current in the process at the time. (On
GNU/Hurd systems, you can specify the file name for core dumps with the environment
variable COREFILE.) The purpose of core dump files is so that you can examine them with
a debugger to investigate what caused the error.
Actual floating-point exceptions are a complicated subject because there are many
types of exceptions with subtly different meanings, and the SIGFPE signal doesn’t
distinguish between them. The IEEE Standard for Binary Floating-Point Arithmetic
(ANSI/IEEE Std 754-1985 and ANSI/IEEE Std 854-1987) defines various floating-
point exceptions and requires conforming computer systems to report their occur-
rences. However, this standard does not specify how the exceptions are reported, or
what kinds of handling and control the operating system can offer to the programmer.
BSD systems provide the SIGFPE handler with an extra argument that distinguishes var-
ious causes of the exception. In order to access this argument, you must define the handler
to accept two arguments, which means you must cast it to a one-argument function type
in order to establish the handler. The GNU C Library does provide this extra argument,
but the value is meaningful only on operating systems that provide the information (BSD
systems and GNU systems).
FPE_INTOVF_TRAP
Integer overflow (impossible in a C program unless you enable overflow trapping
in a hardware-specific fashion).
FPE_INTDIV_TRAP
Integer division by zero.
FPE_SUBRNG_TRAP
Subscript-range (something that C programs never check for).
FPE_FLTOVF_TRAP
Floating overflow trap.
FPE_FLTDIV_TRAP
Floating/decimal division by zero.
Chapter 25: Signal Handling 770
FPE_FLTUND_TRAP
Floating underflow trap. (Trapping on floating underflow is not normally en-
abled.)
FPE_DECOVF_TRAP
Decimal overflow trap. (Only a few machines have decimal arithmetic and C
never uses it.)
Compatibility Note: A problem encountered when working with the signal function is
that it has different semantics on BSD and SVID systems. The difference is that on SVID
systems the signal handler is deinstalled after signal delivery. On BSD systems the handler
must be explicitly deinstalled. In the GNU C Library we use the BSD version by default.
To use the SVID version you can either use the function sysv_signal (see below) or use
the _XOPEN_SOURCE feature select macro (see Section 1.3.4 [Feature Test Macros], page 16).
In general, use of these functions should be avoided because of compatibility problems. It
is better to use sigaction if it is available since the results are much more reliable.
Here is a simple example of setting up a handler to delete temporary files when certain
fatal signals happen:
#include <signal.h>
void
termination_handler (int signum)
{
struct temp_file *p;
int
main (void)
{
...
if (signal (SIGINT, termination_handler) == SIG_IGN)
signal (SIGINT, SIG_IGN);
Chapter 25: Signal Handling 779
sigset_t sa_mask
This specifies a set of signals to be blocked while the handler runs.
Blocking is explained in Section 25.7.5 [Blocking Signals for a Handler],
page 802. Note that the signal that was delivered is automatically blocked
by default before its handler is started; this is true regardless of the value
in sa_mask. If you want that signal not to be blocked within its handler,
you must write code in the handler to unblock it.
int sa_flags
This specifies various flags which can affect the behavior of the signal.
These are described in more detail in Section 25.3.5 [Flags for sigaction],
page 782.
you can rely on using it as an argument to sigaction. This problem never happens on
GNU systems.
So, you’re better off using one or the other of the mechanisms consistently within a single
program.
Portability Note: The basic signal function is a feature of ISO C, while sigaction
is part of the POSIX.1 standard. If you are concerned about portability to non-POSIX
systems, then you should use the signal function instead.
void
termination_handler (int signum)
{
struct temp_file *p;
int
main (void)
{
...
struct sigaction new_action, old_action;
The program just loads the new_action structure with the desired parameters and passes
it in the sigaction call. The usage of sigemptyset is described later; see Section 25.7
[Blocking Signals], page 798.
As in the example using signal, we avoid handling signals previously set to be ignored.
Here we can avoid altering the signal handler even momentarily, by using the feature of
sigaction that lets us examine the current action without specifying a new one.
Chapter 25: Signal Handling 782
Here is another example. It retrieves information about the current action for SIGINT
without changing that action.
struct sigaction query_action;
if (temp.sa_handler != SIG_IGN)
{
temp.sa_handler = handle_sighup;
sigemptyset (&temp.sa_mask);
sigaction (SIGHUP, &temp, NULL);
}
It is not safe to return normally from the handler for a program error signal, because the
behavior of the program when the handler function returns is not defined after a program
error. See Section 25.2.1 [Program Error Signals], page 768.
Handlers that return normally must modify some global variable in order to have any
effect. Typically, the variable is one that is examined periodically by the program during
normal operation. Its data type should be sig_atomic_t for reasons described in Sec-
tion 25.4.7 [Atomic Data Access and Signal Handling], page 791.
Here is a simple example of such a program. It executes the body of the loop until it
has noticed that a SIGALRM signal has arrived. This technique is useful because it allows
the iteration in progress when the signal arrives to complete before the loop exits.
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
/* The signal handler just clears the flag and re-enables itself. */
void
catch_alarm (int sig)
{
keep_going = 0;
signal (sig, catch_alarm);
}
void
do_stuff (void)
{
puts ("Doing stuff while waiting for alarm....");
}
int
main (void)
{
/* Establish a handler for SIGALRM signals. */
signal (SIGALRM, catch_alarm);
return EXIT_SUCCESS;
}
void
fatal_error_signal (int sig)
{
/* Since this handler is established for more than one kind of signal,
it might still get invoked recursively by delivery of some other kind
of signal. Use a static variable to keep track of that. */
if (fatal_error_in_progress)
raise (sig);
fatal_error_in_progress = 1;
When the handler does a nonlocal control transfer, the part of the program that was
running will not continue. If this part of the program was in the middle of updating an
important data structure, the data structure will remain inconsistent. Since the program
does not terminate, the inconsistency is likely to be noticed later on.
There are two ways to avoid this problem. One is to block the signal for the parts of the
program that update important data structures. Blocking the signal delays its delivery until
it is unblocked, once the critical updating is finished. See Section 25.7 [Blocking Signals],
page 798.
The other way is to re-initialize the crucial data structures in the signal handler, or to
make their values consistent.
Here is a rather schematic example showing the reinitialization of one global variable.
Chapter 25: Signal Handling 786
#include <signal.h>
#include <setjmp.h>
jmp_buf return_to_top_level;
void
handle_sigint (int signum)
{
/* We may have been waiting for input when the signal arrived,
but we are no longer waiting once we transfer control. */
waiting_for_input = 0;
longjmp (return_to_top_level, 1);
}
int
main (void)
{
...
signal (SIGINT, sigint_handler);
...
while (1) {
prepare_for_command ();
if (setjmp (return_to_top_level) == 0)
read_and_execute_command ();
}
}
When the handler for a particular signal is invoked, that signal is automatically blocked
until the handler returns. That means that if two signals of the same kind arrive close
together, the second one will be held until the first has been handled. (The handler can
explicitly unblock the signal using sigprocmask, if you want to allow more signals of this
type to arrive; see Section 25.7.3 [Process Signal Mask], page 800.)
However, your handler can still be interrupted by delivery of another kind of signal. To
avoid this, you can use the sa_mask member of the action structure passed to sigaction
to explicitly specify which signals should be blocked while the signal handler runs. These
signals are in addition to the signal for which the handler was invoked, and any other
Chapter 25: Signal Handling 787
signals that are normally blocked by the process. See Section 25.7.5 [Blocking Signals for a
Handler], page 802.
When the handler returns, the set of blocked signals is restored to the value it had
before the handler ran. So using sigprocmask inside the handler only affects what signals
can arrive during the execution of the handler itself, not what signals can arrive once the
handler returns.
Portability Note: Always use sigaction to establish a handler for a signal that you
expect to receive asynchronously, if you want your program to work properly on System
V Unix. On this system, the handling of a signal whose handler was established with
signal automatically sets the signal’s action back to SIG_DFL, and the handler must re-
establish itself each time it runs. This practice, while inconvenient, does work when signals
cannot arrive in succession. However, if another signal can arrive right away, it may arrive
before the handler can re-establish itself. Then the second signal would receive the default
handling, which could terminate the process.
void
sigchld_handler (int signo)
{
int old_errno = errno;
while (1) {
register int pid;
int w;
struct process *p;
if (pid <= 0) {
/* A real failure means there are no more
stopped or terminated child processes, so return. */
errno = old_errno;
return;
}
/* Find the process that signaled us, and record its status. */
It is vital to clear the flag before examining the list; otherwise, if a signal were delivered
just before the clearing of the flag, and after the appropriate element of the process list had
been checked, the status change would go unnoticed until the next signal arrived to set the
flag again. You could, of course, avoid this problem by blocking the signal while scanning
the list, but it is much more elegant to guarantee correctness by doing things in the right
order.
The loop which checks process status avoids examining p->status until it sees that
status has been validly stored. This is to make sure that the status cannot change in
the middle of accessing it. Once p->have_status is set, it means that the child process
is stopped or terminated, and in either case, it cannot stop or terminate again until the
program has taken notice. See Section 25.4.7.3 [Atomic Usage Patterns], page 792, for more
information about coping with interruptions during accesses of a variable.
Here is another way you can test whether the handler has run since the last time you
checked. This technique uses a counter which is never changed outside the handler. Instead
of clearing the count, the program remembers the previous value and sees whether it has
changed since the previous check. The advantage of this method is that different parts of
the program can check independently, each part checking whether there has been a signal
since that part last checked.
sig_atomic_t process_status_change;
sig_atomic_t last_process_status_change;
...
{
sig_atomic_t prev = last_process_status_change;
last_process_status_change = process_status_change;
if (last_process_status_change != prev) {
struct process *p;
for (p = process_list; p; p = p->next)
if (p->have_status) {
... Examine p->status ...
}
}
}
• If you call a function in the handler, make sure it is reentrant with respect to signals,
or else make sure that the signal cannot interrupt a call to a related function.
A function can be non-reentrant if it uses memory that is not on the stack.
• If a function uses a static variable or a global variable, or a dynamically-allocated object
that it finds for itself, then it is non-reentrant and any two calls to the function can
interfere.
For example, suppose that the signal handler uses gethostbyname. This function
returns its value in a static object, reusing the same object each time. If the signal
happens to arrive during a call to gethostbyname, or even after one (while the program
is still using the value), it will clobber the value that the program asked for.
However, if the program does not use gethostbyname or any other function that returns
information in the same object, or if it always blocks signals around each use, then you
are safe.
There are a large number of library functions that return values in a fixed object,
always reusing the same object in this fashion, and all of them cause the same problem.
Function descriptions in this manual always mention this behavior.
• If a function uses and modifies an object that you supply, then it is potentially non-
reentrant; two calls can interfere if they use the same object.
This case arises when you do I/O using streams. Suppose that the signal handler prints
a message with fprintf. Suppose that the program was in the middle of an fprintf
call using the same stream when the signal was delivered. Both the signal handler’s
message and the program’s data could be corrupted, because both calls operate on the
same data structure—the stream itself.
However, if you know that the stream that the handler uses cannot possibly be used
by the program at a time when signals can arrive, then you are safe. It is no problem
if the program uses some other stream.
• On most systems, malloc and free are not reentrant, because they use a static data
structure which records what memory blocks are free. As a result, no library functions
that allocate or free memory are reentrant. This includes functions that allocate space
to store a result.
The best way to avoid the need to allocate memory in a handler is to allocate in advance
space for signal handlers to use.
The best way to avoid freeing memory in a handler is to flag or record the objects to
be freed, and have the program check from time to time whether anything is waiting
to be freed. But this must be done with care, because placing an object on a chain is
not atomic, and if it is interrupted by another signal handler that does the same thing,
you could “lose” one of the objects.
• Any function that modifies errno is non-reentrant, but you can correct for this: in the
handler, save the original value of errno and restore it before returning normally. This
prevents errors that occur within the signal handler from being confused with errors
from system calls at the point the program is interrupted to run the handler.
This technique is generally applicable; if you want to call in a handler a function that
modifies a particular object in memory, you can make this safe by saving and restoring
that object.
Chapter 25: Signal Handling 791
• Merely reading from a memory object is safe provided that you can deal with any of the
values that might appear in the object at a time when the signal can be delivered. Keep
in mind that assignment to some data types requires more than one instruction, which
means that the handler could run “in the middle of” an assignment to the variable if
its type is not atomic. See Section 25.4.7 [Atomic Data Access and Signal Handling],
page 791.
• Merely writing into a memory object is safe as long as a sudden change in the value,
at any time when the handler might run, will not disturb anything.
void
handler(int signum)
{
printf ("%d,%d\n", memory.a, memory.b);
alarm (1);
}
int
main (void)
{
static struct two_words zeros = { 0, 0 }, ones = { 1, 1 };
signal (SIGALRM, handler);
memory = zeros;
alarm (1);
while (1)
{
memory = zeros;
memory = ones;
}
}
This program fills memory with zeros, ones, zeros, ones, alternating forever; meanwhile,
once per second, the alarm signal handler prints the current contents. (Calling printf
Chapter 25: Signal Handling 792
in the handler is safe in this program because it is certainly not being called outside the
handler when the signal happens.)
Clearly, this program can print a pair of zeros or a pair of ones. But that’s not all it can
do! On most machines, it takes several instructions to store a new value in memory, and the
value is stored one word at a time. If the signal is delivered in between these instructions,
the handler might find that memory.a is zero and memory.b is one (or vice versa).
On some machines it may be possible to store a new value in memory with just one
instruction that cannot be interrupted. On these machines, the handler will always print
two zeros or two ones.
In practice, you can assume that int is atomic. You can also assume that pointer
types are atomic; that is very convenient. Both of these assumptions are true on all of the
machines that the GNU C Library supports and on all POSIX systems we know of.
BSD avoids EINTR entirely and provides a more convenient approach: to restart the
interrupted primitive, instead of making it fail. If you choose this approach, you need not
be concerned with EINTR.
You can choose either approach with the GNU C Library. If you use sigaction to
establish a signal handler, you can specify how that handler should behave. If you specify
the SA_RESTART flag, return from that handler will resume a primitive; otherwise, return
from that handler will cause EINTR. See Section 25.3.5 [Flags for sigaction], page 782.
Another way to specify the choice is with the siginterrupt function. See Section 25.10
[BSD Signal Handling], page 809.
When you don’t specify with sigaction or siginterrupt what a particular handler
should do, it uses a default choice. The default choice in the GNU C Library is to make
primitives fail with EINTR.
The description of each primitive affected by this issue lists EINTR among the error codes
it can return.
There is one situation where resumption never happens no matter which choice you
make: when a data-transfer function such as read or write is interrupted by a signal after
transferring part of the data. In this case, the function returns the number of bytes already
transferred, indicating partial success.
This might at first appear to cause unreliable behavior on record-oriented devices (includ-
ing datagram sockets; see Section 16.10 [Datagram Socket Operations], page 503), where
splitting one read or write into two would read or write two records. Actually, there is
no problem, because interruption after a partial transfer cannot happen on such devices;
they always transfer an entire record in one burst, with no waiting once data transfer has
started.
Chapter 25: Signal Handling 794
One convenient use for raise is to reproduce the default behavior of a signal that you
have trapped. For instance, suppose a user of your program types the SUSP character
(usually C-z; see Section 17.4.9 [Special Characters], page 526) to send it an interactive
stop signal (SIGTSTP), and you want to clean up some internal data buffers before stopping.
You might set this up like this:
#include <signal.h>
/* When a stop signal arrives, set the action back to the default
and then resend the signal after doing cleanup actions. */
void
tstp_handler (int sig)
{
signal (SIGTSTP, SIG_DFL);
/* Do cleanup actions here. */
...
raise (SIGTSTP);
}
void
cont_handler (int sig)
{
signal (SIGCONT, cont_handler);
signal (SIGTSTP, tstp_handler);
}
Chapter 25: Signal Handling 795
int
main (void)
{
signal (SIGCONT, cont_handler);
signal (SIGTSTP, tstp_handler);
...
}
Portability note: raise was invented by the ISO C committee. Older systems may not
support it, so using kill may be more portable. See Section 25.6.2 [Signaling Another
Process], page 795.
The return value from kill is zero if the signal can be sent successfully. Otherwise,
no signal is sent, and a value of -1 is returned. If pid specifies sending a signal to
several processes, kill succeeds if it can send the signal to at least one of them.
There’s no way you can tell which of the processes got the signal or whether all of
them did.
The following errno error conditions are defined for this function:
EINVAL The signum argument is an invalid or unsupported number.
EPERM You do not have the privilege to send a signal to the process or any of
the processes in the process group named by pid.
ESRCH The pid argument does not refer to an existing process or group.
As a simple example of kill, the call kill (getpid (), sig) has the same effect as
raise (sig).
process image file, then the owner of the process image file is used in place of its current
effective user ID. In some implementations, a parent process might be able to send signals to
a child process even if the user ID’s don’t match, and other implementations might enforce
other restrictions.
The SIGCONT signal is a special case. It can be sent if the sender is part of the same
session as the receiver, regardless of user IDs.
#include <signal.h>
#include <stdio.h>
#include <sys/types.h>
#include <unistd.h>
void
synch_signal (int sig)
{
usr_interrupt = 1;
}
int
main (void)
{
struct sigaction usr_action;
sigset_t block_mask;
pid_t child_id;
usr_action.sa_handler = synch_signal;
usr_action.sa_mask = block_mask;
usr_action.sa_flags = 0;
sigaction (SIGUSR1, &usr_action, NULL);
return 0;
}
This example uses a busy wait, which is bad, because it wastes CPU cycles that other
programs could otherwise use. It is better to ask the system to wait until the signal arrives.
See the example in Section 25.8 [Waiting for a Signal], page 805.
is unreliable. Suppose the signal is delivered immediately after you test the flag, but before
the consequent action: then the program will perform the action even though the signal has
arrived.
The only way to test reliably for whether a signal has yet arrived is to test while the
signal is blocked.
The last argument, oldset, is used to return information about the old process signal
mask. If you just want to change the mask without looking at it, pass a null pointer
as the oldset argument. Similarly, if you want to know what’s in the mask without
changing it, pass a null pointer for set (in this case the how argument is not signif-
icant). The oldset argument is often used to remember the previous signal mask in
order to restore it later. (Since the signal mask is inherited over fork and exec calls,
you can’t predict what its contents are when your program starts running.)
You can’t block the SIGKILL and SIGSTOP signals, but if the signal set includes these,
sigprocmask just ignores them instead of returning an error status.
Remember, too, that blocking program error signals such as SIGFPE leads to undesir-
able results for signals generated by an actual program error (as opposed to signals
sent with raise or kill). This is because your program may be too broken to be
able to continue executing to a point where the signal is unblocked again. See Sec-
tion 25.2.1 [Program Error Signals], page 768.
int
main (void)
{
sigset_t block_alarm;
...
while (1)
{
/* Check if a signal has arrived; if so, reset the flag. */
sigprocmask (SIG_BLOCK, &block_alarm, NULL);
if (flag)
{
actions-if-not-arrived
flag = 0;
}
sigprocmask (SIG_UNBLOCK, &block_alarm, NULL);
...
}
}
void
install_handler (void)
{
struct sigaction setup_action;
sigset_t block_mask;
sigemptyset (&block_mask);
/* Block other terminal-generated signals while handler runs. */
sigaddset (&block_mask, SIGINT);
sigaddset (&block_mask, SIGQUIT);
setup_action.sa_handler = catch_stop;
setup_action.sa_mask = block_mask;
setup_action.sa_flags = 0;
sigaction (SIGTSTP, &setup_action, NULL);
}
This is more reliable than blocking the other signals explicitly in the code for the handler.
If you block signals explicitly in the handler, you can’t avoid at least a short interval at the
beginning of the handler where they are not yet blocked.
Chapter 25: Signal Handling 803
You cannot remove signals from the process’s current mask using this mechanism. How-
ever, you can make calls to sigprocmask within your handler to block or unblock signals
as you wish.
In any case, when the handler returns, the system restores the mask that was in place
before the handler was entered. If any signals that become unblocked by this restoration
are pending, the process will receive those signals immediately, before returning to the code
that was interrupted.
sigemptyset (&base_mask);
sigaddset (&base_mask, SIGINT);
sigaddset (&base_mask, SIGTSTP);
void
handler (int signum)
{
if (defer_signal)
signal_pending = signum;
else
... /* ‘‘Really” handle the signal. */
}
...
void
update_mumble (int frob)
{
/* Prevent signals from having immediate effect. */
defer_signal++;
/* Now update mumble, without worrying about interruption. */
mumble.a = 1;
mumble.b = hack ();
mumble.c = frob;
/* We have updated mumble. Handle any signal that came in. */
defer_signal--;
if (defer_signal == 0 && signal_pending != 0)
raise (signal_pending);
}
Note how the particular signal that arrives is stored in signal_pending. That way, we
can handle several types of inconvenient signals with the same mechanism.
We increment and decrement defer_signal so that nested critical sections will work
properly; thus, if update_mumble were called with signal_pending already nonzero, signals
would be deferred not only within update_mumble, but also within the caller. This is also
why we do not check signal_pending if defer_signal is still nonzero.
The incrementing and decrementing of defer_signal each require more than one in-
struction; it is possible for a signal to happen in the middle. But that does not cause any
problem. If the signal happens early enough to see the value from before the increment or
decrement, that is equivalent to a signal which came before the beginning of the increment
or decrement, which is a case that works properly.
It is absolutely vital to decrement defer_signal before testing signal_pending, be-
cause this avoids a subtle bug. If we did these things in the other order, like this,
if (defer_signal == 1 && signal_pending != 0)
raise (signal_pending);
defer_signal--;
Chapter 25: Signal Handling 805
then a signal arriving in between the if statement and the decrement would be effectively
“lost” for an indefinite amount of time. The handler would merely set defer_signal, but
the program having already tested this variable, it would not test the variable again.
Bugs like these are called timing errors. They are especially bad because they happen
only rarely and are nearly impossible to reproduce. You can’t expect to find them with a
debugger as you would find a reproducible bug. So it is worth being especially careful to
avoid them.
(You would not be tempted to write the code in this order, given the use of defer_
signal as a counter which must be tested along with signal_pending. After all, testing
for zero is cleaner than testing for one. But if you did not use defer_signal as a counter,
and gave it values of zero and one only, then either order might seem equally simple. This
is a further advantage of using a counter for defer_signal: it will reduce the chance you
will write the code in the wrong order and create a subtle bug.)
With sigsuspend, you can replace the pause or sleep loop in the previous section with
something completely reliable:
sigset_t mask, oldmask;
...
...
void *ss_sp
This points to the base of the signal stack.
size_t ss_size
This is the size (in bytes) of the signal stack which ‘ss_sp’ points to. You
should set this to however much space you allocated for the stack.
There are two macros defined in signal.h that you should use in calcu-
lating this size:
SIGSTKSZ This is the canonical size for a signal stack. It is judged to
be sufficient for normal uses.
MINSIGSTKSZ
This is the amount of signal stack space the operating system
needs just to implement signal delivery. The size of a signal
stack must be greater than this.
For most cases, just using SIGSTKSZ for ss_size is sufficient.
But if you know how much stack space your program’s signal
handlers will need, you may want to use a different size. In
this case, you should allocate MINSIGSTKSZ additional bytes
for the signal stack and increase ss_size accordingly.
int ss_flags
This field contains the bitwise or of these flags:
SS_DISABLE
This tells the system that it should not use the signal stack.
SS_ONSTACK
This is set by the system, and indicates that the signal stack
is currently in use. If this bit is not set, then signals will be
delivered on the normal user stack.
int sigaltstack (const stack_t *restrict stack, stack_t [Function]
*restrict oldstack)
Preliminary: | MT-Safe | AS-Unsafe lock/hurd | AC-Unsafe lock/hurd | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The sigaltstack function specifies an alternate stack for use during signal handling.
When a signal is received by the process and its action indicates that the signal stack
is used, the system arranges a switch to the currently installed signal stack while the
handler for that signal is executed.
If oldstack is not a null pointer, information about the currently installed signal stack
is returned in the location it points to. If stack is not a null pointer, then this is
installed as the new stack for use by signal handlers.
The return value is 0 on success and -1 on failure. If sigaltstack fails, it sets errno
to one of these values:
EINVAL You tried to disable a stack that was in fact currently in use.
ENOMEM The size of the alternate stack was too small. It must be greater than
MINSIGSTKSZ.
Chapter 25: Signal Handling 809
Here is the older sigstack interface. You should use sigaltstack instead on systems
that have it.
ables], page 844. POSIX.1 does not allow this three-argument form, so to be portable it is
best to write main to take two arguments, and use the value of environ.
for example), you are usually better off using getopt (see Section 26.2 [Parsing program
options using getopt], page 813) or argp_parse (see Section 26.3 [Parsing Program Options
with Argp], page 820) to do the parsing.
getopt is more standard (the short-option only version of it is a part of the POSIX
standard), but using argp_parse is often easier, both for very simple and very complex
option structures, because it does more of the dirty work for you.
int getopt (int argc, char *const *argv, const char [Function]
*options)
Preliminary: | MT-Unsafe race:getopt env | AS-Unsafe heap i18n lock corrupt |
AC-Unsafe mem lock corrupt | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The getopt function gets the next option argument from the argument list specified
by the argv and argc arguments. Normally these values come directly from the
arguments received by main.
The options argument is a string that specifies the option characters that are valid
for this program. An option character in this string can be followed by a colon (‘:’)
Chapter 26: The Basic Program/System Interface 814
getopt has three ways to deal with options that follow non-options argv elements.
The special argument ‘--’ forces in all cases the end of option scanning.
• The default is to permute the contents of argv while scanning it so that eventually
all the non-options are at the end. This allows options to be given in any order,
even with programs that were not written to expect this.
• If the options argument string begins with a hyphen (‘-’), this is treated specially.
It permits arguments that are not options to be returned as if they were associated
with option character ‘\1’.
• POSIX demands the following behavior: the first non-option stops option
processing. This mode is selected by either setting the environment variable
POSIXLY_CORRECT or beginning the options argument string with a plus sign
(‘+’).
The getopt function returns the option character for the next command line option.
When no more option arguments are available, it returns -1. There may still be more
non-option arguments; you must compare the external variable optind against the
argc parameter to check this.
If the option has an argument, getopt returns the argument by storing it in the
variable optarg. You don’t ordinarily need to copy the optarg string, since it is a
pointer into the original argv array, not into a static area that might be overwritten.
If getopt finds an option character in argv that was not included in options, or a
missing option argument, it returns ‘?’ and sets the external variable optopt to the
actual option character. If the first character of options is a colon (‘:’), then getopt
returns ‘:’ instead of ‘?’ to indicate a missing option argument. In addition, if the
external variable opterr is nonzero (which is the default), getopt prints an error
message.
• Normally, getopt is called in a loop. When getopt returns -1, indicating no more
options are present, the loop terminates.
• A switch statement is used to dispatch on the return value from getopt. In typical
use, each case just sets a variable that is used later in the program.
• A second loop is used to process the remaining non-option arguments.
Chapter 26: The Basic Program/System Interface 815
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int
main (int argc, char **argv)
{
int aflag = 0;
int bflag = 0;
char *cvalue = NULL;
int index;
int c;
opterr = 0;
Here are some examples showing what this program prints with different combinations
of arguments:
% testopt
aflag = 0, bflag = 0, cvalue = (null)
% testopt -a -b
aflag = 1, bflag = 1, cvalue = (null)
Chapter 26: The Basic Program/System Interface 816
% testopt -ab
aflag = 1, bflag = 1, cvalue = (null)
% testopt -c foo
aflag = 0, bflag = 0, cvalue = foo
% testopt -cfoo
aflag = 0, bflag = 0, cvalue = foo
% testopt arg1
aflag = 0, bflag = 0, cvalue = (null)
Non-option argument arg1
% testopt -a arg1
aflag = 1, bflag = 0, cvalue = (null)
Non-option argument arg1
% testopt -a -- -b
aflag = 1, bflag = 0, cvalue = (null)
Non-option argument -b
% testopt -a -
aflag = 1, bflag = 0, cvalue = (null)
Non-option argument -
int getopt_long (int argc, char *const *argv, const char [Function]
*shortopts, const struct option *longopts, int *indexptr)
Preliminary: | MT-Unsafe race:getopt env | AS-Unsafe heap i18n lock corrupt |
AC-Unsafe mem lock corrupt | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
Decode options from the vector argv (whose length is argc). The argument shortopts
describes the short options to accept, just as it does in getopt. The argument longopts
describes the long options to accept (see above).
When getopt_long encounters a short option, it does the same thing that getopt
would do: it returns the character code for the option, and stores the option’s argu-
ment (if it has one) in optarg.
When getopt_long encounters a long option, it takes actions based on the flag and
val fields of the definition of that option. The option name may be abbreviated as
long as the abbreviation is unique.
If flag is a null pointer, then getopt_long returns the contents of val to indicate
which option it found. You should arrange distinct values in the val field for options
with different meanings, so you can decode these values after getopt_long returns.
If the long option is equivalent to a short option, you can use the short option’s
character code in val.
If flag is not a null pointer, that means this option should just set a flag in the
program. The flag is a variable of type int that you define. Put the address of the
flag in the flag field. Put in the val field the value you would like this option to
store in the flag. In this case, getopt_long returns 0.
For any long option, getopt_long tells you the index in the array longopts of the
options definition, by storing it into *indexptr. You can get the name of the option
with longopts[*indexptr].name. So you can distinguish among long options either
by the values in their val fields or by their indices. You can also distinguish in this
way among long options that set flags.
When a long option has an argument, getopt_long puts the argument value in the
variable optarg before returning. When the option has no argument, the value in
optarg is a null pointer. This is how you can tell whether an optional argument was
supplied.
When getopt_long has no more options to handle, it returns -1, and leaves in the
variable optind the index in argv of the next remaining argument.
Since long option names were used before getopt_long was invented there are pro-
gram interfaces which require programs to recognize options like ‘-option value’ instead
of ‘--option value’. To enable these programs to use the GNU getopt functionality there
is one more function available.
Chapter 26: The Basic Program/System Interface 818
int
main (int argc, char **argv)
{
int c;
while (1)
{
static struct option long_options[] =
{
/* These options set a flag. */
{"verbose", no_argument, &verbose_flag, 1},
{"brief", no_argument, &verbose_flag, 0},
/* These options don’t set a flag.
We distinguish them by their indices. */
{"add", no_argument, 0, 'a'},
{"append", no_argument, 0, 'b'},
{"delete", required_argument, 0, 'd'},
{"create", required_argument, 0, 'c'},
{"file", required_argument, 0, 'f'},
{0, 0, 0, 0}
};
/* getopt_long stores the option index here. */
int option_index = 0;
switch (c)
{
case 0:
/* If this option set a flag, do nothing else now. */
if (long_options[option_index].flag != 0)
break;
printf ("option %s", long_options[option_index].name);
if (optarg)
printf (" with arg %s", optarg);
printf ("\n");
break;
case 'a':
puts ("option -a\n");
break;
case 'b':
puts ("option -b\n");
break;
case 'c':
printf ("option -c with value `%s'\n", optarg);
break;
case 'd':
printf ("option -d with value `%s'\n", optarg);
break;
case 'f':
printf ("option -f with value `%s'\n", optarg);
break;
case '?':
/* getopt_long already printed an error message. */
break;
default:
abort ();
}
}
exit (0);
Chapter 26: The Basic Program/System Interface 820
argp_program_version_hook [Variable]
If defined or set by the user program to a non-zero value, a ‘--version’ option is
added when parsing with arg_parse, which prints the program version and exits
with a status of zero. This is not the case if the ARGP_NO_HELP flag is used. If the
ARGP_NO_EXIT flag is set, the exit behavior of the program is suppressed or modified,
as when the argp parser is going to be used by other programs.
It should point to a function with this type of signature:
void print-version (FILE *stream, struct argp_state *state)
See Section 26.3.5.2 [Argp Parsing State], page 827, for an explanation of state.
This variable takes precedence over argp_program_version, and is useful if a program
has version information not easily expressed in a simple string.
multiple names for an option, additional entries may follow this one, with
the OPTION_ALIAS flag set. See Section 26.3.4.1 [Flags for Argp Options],
page 823.
int key The integer key provided by the current option to the option parser. If
key has a value that is a printable ascii character (i.e., isascii (key)
is true), it also specifies a short option ‘-char’, where char is the ascii
character with the code key.
const char *arg
If non-zero, this is the name of an argument associated with this option,
which must be provided (e.g., with the ‘--name=value’ or ‘-char value’
syntaxes), unless the OPTION_ARG_OPTIONAL flag (see Section 26.3.4.1
[Flags for Argp Options], page 823) is set, in which case it may be pro-
vided.
int flags Flags associated with this option, some of which are referred to above.
See Section 26.3.4.1 [Flags for Argp Options], page 823.
const char *doc
A documentation string for this option, for printing in help messages.
If both the name and key fields are zero, this string will be printed tabbed
left from the normal option column, making it useful as a group header.
This will be the first thing printed in its group. In this usage, it’s con-
ventional to end the string with a ‘:’ character.
int group Group identity for this option.
In a long help message, options are sorted alphabetically within each
group, and the groups presented in the order 0, 1, 2, . . . , n, −m, . . . ,
−2, −1.
Every entry in an options array with this field 0 will inherit the group
number of the previous entry, or zero if it’s the first one. If it’s a group
header with name and key fields both zero, the previous entry + 1 is the
default. Automagic options such as ‘--help’ are put into group −1.
Note that because of C structure initialization rules, this field often need
not be specified, because 0 is the correct value.
OPTION_DOC
This option isn’t actually an option and should be ignored by the actual option
parser. It is an arbitrary section of documentation that should be displayed
in much the same manner as the options. This is known as a documentation
option.
If this flag is set, then the option name field is displayed unmodified (e.g., no
‘--’ prefix is added) at the left-margin where a short option would normally be
displayed, and this documentation string is left in its usual place. For purposes
of sorting, any leading whitespace and punctuation is ignored, unless the first
non-whitespace character is ‘-’. This entry is displayed after all options, after
OPTION_DOC entries with a leading ‘-’, in the same group.
OPTION_NO_USAGE
This option shouldn’t be included in ‘long’ usage messages, but should still be
included in other help messages. This is intended for options that are completely
documented in an argp’s args_doc field. See Section 26.3.3 [Specifying Argp
Parsers], page 821. Including this option in the generic usage list would be
redundant, and should be avoided.
For instance, if args_doc is "FOO BAR\n-x BLAH", and the ‘-x’ option’s purpose
is to distinguish these two cases, ‘-x’ should probably be marked OPTION_NO_
USAGE.
When parser is called, it should perform whatever action is appropriate for key, and
return 0 for success, ARGP_ERR_UNKNOWN if the value of key is not handled by this parser
function, or a unix error code if a real error occurred. See Section 2.2 [Error Codes], page 25.
int ARGP_ERR_UNKNOWN [Macro]
Argp parser functions should return ARGP_ERR_UNKNOWN for any key value they do
not recognize, or for non-option arguments (key == ARGP_KEY_ARG) that they are not
equipped to handle.
A typical parser function uses a switch statement on key:
error_t
parse_opt (int key, char *arg, struct argp_state *state)
{
switch (key)
{
case option_key:
action
break;
...
default:
return ARGP_ERR_UNKNOWN;
}
return 0;
}
amount by which state->next has been adjusted indicates how many were
used. Here’s an example that uses both, for different args:
...
case ARGP_KEY_ARG:
if (state->arg_num == 0)
/* First argument */
first_arg = arg;
else
/* Let the next case parse it. */
return ARGP_KEY_UNKNOWN;
break;
case ARGP_KEY_ARGS:
remaining_args = state->argv + state->next;
num_remaining_args = state->argc - state->next;
break;
ARGP_KEY_END
This indicates that there are no more command line arguments. Parser func-
tions are called in a different order, children first. This allows each parser to
clean up its state for the parent.
ARGP_KEY_NO_ARGS
Because it’s common to do some special processing if there aren’t any non-
option args, parser functions are called with this key if they didn’t successfully
process any non-option arguments. This is called just before ARGP_KEY_END,
where more general validity checks on previously parsed arguments take place.
ARGP_KEY_INIT
This is passed in before any parsing is done. Afterwards, the values of each
element of the child_input field of state, if any, are copied to each child’s
state to be the initial value of the input when their parsers are called.
ARGP_KEY_SUCCESS
Passed in when parsing has successfully been completed, even if arguments
remain.
ARGP_KEY_ERROR
Passed in if an error has occurred and parsing is terminated. In this case a call
with a key of ARGP_KEY_SUCCESS is never made.
ARGP_KEY_FINI
The final key ever seen by any parser, even after ARGP_KEY_SUCCESS and ARGP_
KEY_ERROR. Any resources allocated by ARGP_KEY_INIT may be freed here.
At times, certain resources allocated are to be returned to the caller after a
successful parse. In that case, those particular resources can be freed in the
ARGP_KEY_ERROR case.
In all cases, ARGP_KEY_INIT is the first key seen by parser functions, and ARGP_KEY_FINI
the last, unless an error was returned by the parser for ARGP_KEY_INIT. Other keys can
occur in one the following orders. opt refers to an arbitrary option key:
opt. . . ARGP_KEY_NO_ARGS ARGP_KEY_END ARGP_KEY_SUCCESS
The arguments being parsed did not contain any non-option arguments.
Chapter 26: The Basic Program/System Interface 827
mented after each ARGP_KEY_ARG call returns. At all other times, this is
the number of ARGP_KEY_ARG arguments that have been processed.
int quoted
If non-zero, the index in argv of the first argument following a special ‘--’
argument. This prevents anything that follows from being interpreted as
an option. It is only set after argument parsing has proceeded past this
point.
void *input
An arbitrary pointer passed in from the caller of argp_parse, in the input
argument.
void **child_inputs
These are values that will be passed to child parsers. This vector will be
the same length as the number of children in the current parser. Each
child parser will be given the value of state->child_inputs[i] as its
state->input field, where i is the index of the child in the this parser’s
children field. See Section 26.3.6 [Combining Multiple Argp Parsers],
page 830.
void *hook
For the parser function’s use. Initialized to 0, but otherwise ignored by
argp.
char *name
The name used when printing messages. This is initialized to argv[0],
or program_invocation_name if argv[0] is unavailable.
FILE *err_stream
FILE *out_stream
The stdio streams used when argp prints. Error messages are printed to
err_stream, all other output, such as ‘--help’ output) to out_stream.
These are initialized to stderr and stdout respectively. See Section 12.2
[Standard Streams], page 270.
void *pstate
Private, for use by the argp implementation.
Error output is sent to state->err_stream, and the program name printed is state-
>name.
The output or program termination behavior of these functions may be suppressed if the
ARGP_NO_EXIT or ARGP_NO_ERRS flags are passed to argp_parse. See Section 26.3.7 [Flags
for argp_parse], page 830.
This behavior is useful if an argp parser is exported for use by other programs (e.g., by
a library), and may be used in a context where it is not desirable to terminate the program
in response to parsing errors. In argp parsers intended for such general use, and for the case
where the program doesn’t terminate, calls to any of these functions should be followed by
code that returns the appropriate error code:
if (bad argument syntax)
{
argp_usage (state);
return EINVAL;
}
If a parser function will only be used when ARGP_NO_EXIT is not set, the return may be
omitted.
Chapter 26: The Basic Program/System Interface 830
ARGP_NO_ARGS
Don’t parse any non-option args. Normally these are parsed by calling the parse
functions with a key of ARGP_KEY_ARG, the actual argument being the value.
This flag needn’t normally be set, as the default behavior is to stop parsing
as soon as an argument fails to be parsed. See Section 26.3.5 [Argp Parser
Functions], page 824.
ARGP_IN_ORDER
Parse options and arguments in the same order they occur on the command
line. Normally they’re rearranged so that all options come first.
ARGP_NO_HELP
Don’t provide the standard long option ‘--help’, which ordinarily causes usage
and option help information to be output to stdout and exit (0).
ARGP_NO_EXIT
Don’t exit on errors, although they may still result in error messages.
ARGP_LONG_ONLY
Use the GNU getopt ‘long-only’ rules for parsing arguments. This allows long-
options to be recognized with only a single ‘-’ (i.e., ‘-help’). This results in a
less useful interface, and its use is discouraged as it conflicts with the way most
GNU programs work as well as the GNU coding standards.
ARGP_SILENT
Turns off any message-printing/exiting options, specifically ARGP_NO_EXIT,
ARGP_NO_ERRS, and ARGP_NO_HELP.
ARGP_KEY_HELP_POST_DOC
The help text following options.
ARGP_KEY_HELP_HEADER
The option header string.
ARGP_KEY_HELP_EXTRA
This is used after all other documentation; text is zero for this key.
ARGP_KEY_HELP_DUP_ARGS_NOTE
The explanatory note printed when duplicate option arguments have been sup-
pressed.
ARGP_KEY_HELP_ARGS_DOC
The argument doc string; formally the args_doc field from the argp parser.
See Section 26.3.3 [Specifying Argp Parsers], page 821.
ARGP_HELP_LONG
A verbose option help message that gives each option available along with its
documentation string.
ARGP_HELP_PRE_DOC
The part of the argp parser doc string preceding the verbose option help.
ARGP_HELP_POST_DOC
The part of the argp parser doc string that following the verbose option help.
ARGP_HELP_DOC
(ARGP_HELP_PRE_DOC | ARGP_HELP_POST_DOC)
ARGP_HELP_BUG_ADDR
A message that prints where to report bugs for this program, if the argp_
program_bug_address variable contains this information.
ARGP_HELP_LONG_ONLY
This will modify any output to reflect the ARGP_LONG_ONLY mode.
The following flags are only understood when used with argp_state_help. They control
whether the function returns after printing its output, or terminates the program:
ARGP_HELP_EXIT_ERR
This will terminate the program with exit (argp_err_exit_status).
ARGP_HELP_EXIT_OK
This will terminate the program with exit (0).
The following flags are combinations of the basic flags for printing standard messages:
ARGP_HELP_STD_ERR
Assuming that an error message for a parsing error has printed, this prints a
message on how to get help, and terminates the program with an error.
ARGP_HELP_STD_USAGE
This prints a standard usage message and terminates the program with an error.
This is used when no other specific error messages are appropriate or available.
ARGP_HELP_STD_HELP
This prints the standard response for a ‘--help’ option, and terminates the
program successfully.
#include <stdlib.h>
#include <argp.h>
int
main (int argc, char **argv)
{
argp_parse (0, argc, argv, 0, 0, 0);
exit (0);
}
#include <stdlib.h>
#include <argp.h>
/* Program documentation. */
static char doc[] =
Chapter 26: The Basic Program/System Interface 835
int
main (int argc, char **argv)
{
argp_parse (&argp, argc, argv, 0, 0, 0);
exit (0);
}
/* This program uses the same features as example 2, and uses options and
arguments.
We now use the first four fields in ARGP, so here’s a description of them:
OPTIONS – A pointer to a vector of struct argp option (see below)
PARSER – A function to parse a single option, called by argp
ARGS DOC – A string describing how the non-option arguments should look
DOC – A descriptive string about this program; if it contains a
vertical tab character (\v), the part after it will be
printed *following* the options
error.
Note that in this example, main uses a structure to communicate with the
parse opt function, a pointer to which it passes in the INPUT argument to
argp parse. Of course, it’s also possible to use global variables
instead, but this is somewhat more flexible.
#include <stdlib.h>
#include <argp.h>
/* Program documentation. */
static char doc[] =
"Argp example #3 -- a program with options and arguments using argp";
switch (key)
{
case 'q': case 's':
arguments->silent = 1;
break;
case 'v':
arguments->verbose = 1;
break;
case 'o':
arguments->output_file = arg;
break;
case ARGP_KEY_ARG:
if (state->arg_num >= 2)
/* Too many arguments. */
argp_usage (state);
arguments->args[state->arg_num] = arg;
break;
case ARGP_KEY_END:
if (state->arg_num < 2)
/* Not enough arguments. */
argp_usage (state);
break;
default:
return ARGP_ERR_UNKNOWN;
}
return 0;
}
int
main (int argc, char **argv)
{
struct arguments arguments;
/* Default values. */
arguments.silent = 0;
arguments.verbose = 0;
arguments.output_file = "-";
exit (0);
}
/* This program uses the same features as example 3, but has more
options, and somewhat more structure in the -help output. It
also shows how you can ‘steal’ the remainder of the input
arguments past a certain point, for programs that accept a
list of items. It also shows the special argp KEY value
ARGP KEY NO ARGS, which is only given if no non-option
arguments were supplied to the program.
#include <stdlib.h>
Chapter 26: The Basic Program/System Interface 839
#include <error.h>
#include <argp.h>
/* Program documentation. */
static char doc[] =
"Argp example #4 -- a program with somewhat more complicated\
options\
\vThis part of the documentation comes *after* the options;\
note that the text is automatically filled, but it's possible\
to force a line-break, e.g.\n<-- here.";
{ 0 }
};
switch (key)
{
Chapter 26: The Basic Program/System Interface 840
case ARGP_KEY_NO_ARGS:
argp_usage (state);
case ARGP_KEY_ARG:
/* Here we know that state->arg_num == 0, since we
force argument parsing to end before any more arguments can
get here. */
arguments->arg1 = arg;
break;
default:
return ARGP_ERR_UNKNOWN;
}
return 0;
}
int
main (int argc, char **argv)
{
int i, j;
struct arguments arguments;
/* Default values. */
arguments.silent = 0;
arguments.verbose = 0;
Chapter 26: The Basic Program/System Interface 841
arguments.output_file = "-";
arguments.repeat_count = 1;
arguments.abort = 0;
if (arguments.abort)
error (10, 0, "ABORTED");
exit (0);
}
‘opt-doc-col=n’
This prints the documentation for options starting in column n. The default is
29.
‘header-col=n’
This will indent the group headers that document groups of options to column
n. The default is 1.
‘usage-indent=n’
This will indent continuation lines in ‘Usage:’ messages to column n. The
default is 12.
‘rmargin=n’
This will word wrap help output at or before column n. The default is 79.
#include <stdio.h>
#include <stdlib.h>
Chapter 26: The Basic Program/System Interface 843
#include <unistd.h>
int do_all;
const char *type;
int read_size;
int write_size;
int read_only;
enum
{
RO_OPTION = 0,
RW_OPTION,
READ_SIZE_OPTION,
WRITE_SIZE_OPTION,
THE_END
};
int
main (int argc, char **argv)
{
char *subopts, *value;
int opt;
if (value == NULL)
abort ();
write_size = atoi (value);
break;
default:
/* Unknown suboption. */
printf ("Unknown suboption `%s'\n", value);
break;
}
break;
default:
abort ();
}
return 0;
}
int setenv (const char *name, const char *value, int [Function]
replace)
Preliminary: | MT-Unsafe const:env | AS-Unsafe heap lock | AC-Unsafe corrupt
lock mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The setenv function can be used to add a new definition to the environment. The
entry with the name name is replaced by the value ‘name=value’. Please note that
this is also true if value is the empty string. To do this a new string is created and the
strings name and value are copied. A null pointer for the value parameter is illegal.
If the environment already contains an entry with key name the replace parameter
Chapter 26: The Basic Program/System Interface 846
controls the action. If replace is zero, nothing happens. Otherwise the old entry is
replaced by the new one.
Please note that you cannot remove an entry completely using this function.
If the function is successful it returns 0. Otherwise the environment is unchanged
and the return value is -1 and errno is set.
This function was originally part of the BSD library but is now part of the Unix
standard.
There is one more function to modify the whole environment. This function is said to
be used in the POSIX.9 (POSIX bindings for Fortran 77) and so one should expect it did
made it into POSIX.1. But this never happened. But we still provide this function as a
GNU extension to enable writing standard compliant Fortran environments.
You can deal directly with the underlying representation of environment objects to add
more variables to the environment (for example, to communicate with another program you
are about to execute; see Section 27.6 [Executing a File], page 859).
Unix systems, and GNU systems, pass the initial value of environ as the third argument
to main. See Section 26.1 [Program Arguments], page 811.
Chapter 26: The Basic Program/System Interface 847
TZ
This specifies the time zone ruleset. See Section 22.5.6 [Specifying the Time
Zone with TZ], page 727.
LANG
This specifies the default locale to use for attribute categories where neither LC_
ALL nor the specific environment variable for that category is set. See Chapter 7
[Locales and Internationalization], page 186, for more information about locales.
LC_ALL
If this environment variable is set it overrides the selection for all the locales
done using the other LC_* environment variables. The value of the other LC_*
environment variables is simply ignored in this case.
LC_COLLATE
This specifies what locale to use for string sorting.
LC_CTYPE
This specifies what locale to use for character sets and character classification.
LC_MESSAGES
This specifies what locale to use for printing messages and to parse responses.
LC_MONETARY
This specifies what locale to use for formatting monetary values.
LC_NUMERIC
This specifies what locale to use for formatting numbers.
LC_TIME
This specifies what locale to use for formatting date/time values.
NLSPATH
This specifies the directories in which the catopen function looks for message
translation catalogs.
_POSIX_OPTION_ORDER
If this environment variable is defined, it suppresses the usual reordering of com-
mand line arguments by getopt and argp_parse. See Section 26.1.1 [Program
Argument Syntax Conventions], page 812.
by any strong authority, but we won’t describe it here either because anyone who is coding
syscall probably won’t accept anything less than kernel and C library source code as a
specification of the interface between them anyway.
syscall does not provide cancellation logic, even if the system call you’re calling is listed
as cancellable above.
syscall is declared in unistd.h.
#include <unistd.h>
#include <sys/syscall.h>
#include <errno.h>
...
int rc;
if (rc == -1)
fprintf(stderr, "chmod failed, errno = %d\n", errno);
This, if all the compatibility stars are aligned, is equivalent to the following preferable
code:
#include <sys/types.h>
#include <sys/stat.h>
#include <errno.h>
...
int rc;
rc = chmod("/etc/passwd", 0444);
if (rc == -1)
fprintf(stderr, "chmod failed, errno = %d\n", errno);
Chapter 26: The Basic Program/System Interface 851
and status 2 to indicate an inability to compare. Your program should follow an existing
convention if an existing convention makes sense for it.
A general convention reserves status values 128 and up for special purposes. In particular,
the value 128 is used to indicate failure to execute another program in a subprocess. This
convention is not universally obeyed, but it is a good idea to follow it in your programs.
Warning: Don’t try to use the number of errors as the exit status. This is actually not
very useful; a parent process would generally not care how many errors occurred. Worse
than that, it does not work, because the status value is truncated to eight bits. Thus, if
the program tried to report 256 errors, the parent would receive a report of 0 errors—that
is, success.
For the same reason, it does not work to use the value of errno as the exit status—these
can exceed 255.
Portability note: Some non-POSIX systems use different conventions for exit status
values. For greater portability, you can use the macros EXIT_SUCCESS and EXIT_FAILURE
for the conventional status value for success and failure, respectively. They are declared in
the file stdlib.h.
int EXIT_SUCCESS [Macro]
This macro can be used with the exit function to indicate successful program com-
pletion.
On POSIX systems, the value of this macro is 0. On other systems, the value might
be some other (possibly non-constant) integer expression.
int EXIT_FAILURE [Macro]
This macro can be used with the exit function to indicate unsuccessful program
completion in a general sense.
On POSIX systems, the value of this macro is 1. On other systems, the value might be
some other (possibly non-constant) integer expression. Other nonzero status values
also indicate failures. Certain programs use different nonzero status values to indicate
particular kinds of "non-success". For example, diff uses status value 1 to mean that
the files are different, and 2 or more to mean that there was difficulty in opening the
files.
Don’t confuse a program’s exit status with a process’ termination status. There are lots
of ways a process can terminate besides having its program finish. In the event that the
process termination is caused by program termination (i.e., exit), though, the program’s
exit status becomes part of the process’ termination status.
The atexit function registers the function function to be called at normal program
termination. The function is called with no arguments.
The return value from atexit is zero on success and nonzero if the function cannot
be registered.
Here’s a trivial program that illustrates the use of exit and atexit:
#include <stdio.h>
#include <stdlib.h>
void
bye (void)
{
puts ("Goodbye, cruel world....");
}
int
main (void)
{
atexit (bye);
exit (EXIT_SUCCESS);
}
When this program is executed, it just prints the message and exits.
When a process terminates for any reason—either because the program terminates, or
as a result of a signal—the following things happen:
• All open file descriptors in the process are closed. See Chapter 13 [Low-Level In-
put/Output], page 347. Note that streams are not flushed automatically when the
process terminates; see Chapter 12 [Input/Output on Streams], page 270.
• A process exit status is saved to be reported back to the parent process via wait or
waitpid; see Section 27.7 [Process Completion], page 862. If the program exited, this
status includes as its low-order 8 bits the program exit status.
• Any child processes of the process being terminated are assigned a new parent process.
(On most systems, including GNU, this is the init process, with process ID 1.)
• A SIGCHLD signal is sent to the parent process.
• If the process is a session leader that has a controlling terminal, then a SIGHUP signal is
sent to each process in the foreground job, and the controlling terminal is disassociated
from that session. See Chapter 29 [Job Control], page 870.
• If termination of a process causes a process group to become orphaned, and any member
of that process group is stopped, then a SIGHUP signal and a SIGCONT signal are sent
to each process in the group. See Chapter 29 [Job Control], page 870.
855
27 Processes
Processes are the primitive units for allocation of system resources. Each process has its
own address space and (usually) one thread of control. A process executes a program; you
can have multiple processes executing the same program, but each process has its own copy
of the program within its own address space and executes it independently of the other
copies.
Processes are organized hierarchically. Each process has a parent process which explicitly
arranged to create it. The processes created by a given parent are called its child processes.
A child inherits many of its attributes from the parent process.
This chapter describes how a program can create, terminate, and control child processes.
Actually, there are three distinct operations involved: creating a new child process, causing
the new process to execute a program, and coordinating the completion of the child process
with the original program.
The system function provides a simple, portable mechanism for running another pro-
gram; it does all three steps automatically. If you need more control over the details of how
this is done, you can use the primitive functions to do each step individually instead.
Portability Note: Some C implementations may not have any notion of a command pro-
cessor that can execute other programs. You can determine whether a command processor
exists by executing system (NULL); if the return value is nonzero, a command processor is
available.
Chapter 27: Processes 856
The popen and pclose functions (see Section 15.2 [Pipe to a Subprocess], page 461) are
closely related to the system function. They allow the parent process to communicate with
the standard input and output channels of the command being executed.
joinable threads, not just detached threads. Threads are assigned to a thread group. In the
GNU C Library implementation running on Linux, the process ID is the thread group ID
of all threads in the process.
You can get the process ID of a process by calling getpid. The function getppid returns
the process ID of the parent of the current process (this is also known as the parent process
ID). Your program should include the header files unistd.h and sys/types.h to use these
functions.
pid_t [Data Type]
The pid_t data type is a signed integer type which is capable of representing a process
ID. In the GNU C Library, this is an int.
pid_t getpid (void) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The getpid function returns the process ID of the current process.
pid_t getppid (void) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The getppid function returns the process ID of the parent of the current process.
pid_t gettid (void) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The gettid function returns the thread ID of the current thread. The returned value
is obtained from the Linux kernel and is not subject to caching. See the discussion of
thread IDs above, especially regarding reuse of the IDs of threads which have exited.
This function is specific to Linux.
ENOMEM The process requires more space than the system can supply.
The specific attributes of the child process that differ from the parent process are:
• The child process has its own unique process ID.
• The parent process ID of the child process is the process ID of its parent process.
• The child process gets its own copies of the parent process’s open file descriptors. Sub-
sequently changing attributes of the file descriptors in the parent process won’t affect
the file descriptors in the child, and vice versa. See Section 13.12 [Control Operations
on Files], page 391. However, the file position associated with each descriptor is shared
by both processes; see Section 11.1.2 [File Position], page 266.
• The elapsed processor times for the child process are set to zero; see Section 22.4.2
[Processor Time Inquiry], page 700.
• The child doesn’t inherit file locks set by the parent process. See Section 13.12 [Control
Operations on Files], page 391.
• The child doesn’t inherit alarms set by the parent process. See Section 22.6 [Setting
an Alarm], page 731.
• The set of pending signals (see Section 25.1.3 [How Signals Are Delivered], page 767)
for the child process is cleared. (The child process inherits its mask of blocked signals
and signal actions from the parent process.)
Some operating systems don’t really implement vfork. The GNU C Library permits
you to use vfork on all systems, but actually executes fork if vfork isn’t available. If
you follow the proper precautions for using vfork, your program will still work even
if the system uses fork instead.
of this array is the file name of the program sans directory names. See Section 26.1
[Program Arguments], page 811, for full details on how programs can access these
arguments.
The environment for the new process image is taken from the environ variable of
the current process image; see Section 26.4 [Environment Variables], page 844, for
information about environments.
int execl (const char *filename, const char *arg0, ...) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This is similar to execv, but the argv strings are specified individually instead of as
an array. A null pointer must be passed as the last such argument.
int execve (const char *filename, char *const argv[], char [Function]
*const env[])
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This is similar to execv, but permits you to specify the environment for the new
program explicitly as the env argument. This should be an array of strings in the
same format as for the environ variable; see Section 26.4.1 [Environment Access],
page 844.
int fexecve (int fd, char *const argv[], char *const env[]) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This is similar to execve, but instead of identifying the program executable by its
pathname, the file descriptor fd is used. The descriptor must have been opened with
the O_RDONLY flag or (on Linux) the O_PATH flag.
On Linux, fexecve can fail with an error of ENOSYS if /proc has not been mounted
and the kernel lacks support for the underlying execveat system call.
int execle (const char *filename, const char *arg0, ..., [Function]
char *const env[])
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This is similar to execl, but permits you to specify the environment for the new
program explicitly. The environment argument is passed following the null pointer
that marks the last argv argument, and should be an array of strings in the same
format as for the environ variable.
This function is useful for executing system utility programs, because it looks for
them in the places that the user has chosen. Shells use it to run the commands that
users type.
int execlp (const char *filename, const char *arg0, ...) [Function]
Preliminary: | MT-Safe env | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
This function is like execl, except that it performs the same file name searching as
the execvp function.
The size of the argument list and environment list taken together must not be greater
than ARG_MAX bytes. See Section 33.1 [General Capacity Limits], page 943. On GNU/Hurd
systems, the size (which compares against ARG_MAX) includes, for each string, the number
of characters in the string, plus the size of a char *, plus one, rounded up to a multiple of
the size of a char *. Other systems may have somewhat different rules for counting.
These functions normally don’t return, since execution of a new program causes the
currently executing program to go away completely. A value of -1 is returned in the event
of a failure. In addition to the usual file name errors (see Section 11.2.3 [File Name Errors],
page 268), the following errno error conditions are defined for these functions:
E2BIG The combined size of the new program’s argument list and environment list is
larger than ARG_MAX bytes. GNU/Hurd systems have no specific limit on the
argument list size, so this error code cannot result, but you may get ENOMEM
instead if the arguments are too big for available memory.
ENOEXEC The specified file can’t be executed because it isn’t in the right format.
ENOMEM Executing the specified file requires more storage than is available.
If execution of the new file succeeds, it updates the access time field of the file as if the
file had been read. See Section 14.9.9 [File Times], page 448, for more details about access
times of files.
The point at which the file is closed again is not specified, but is at some point before
the process exits or before another process image is executed.
Executing a new process image completely changes the contents of memory, copying only
the argument and environment strings to new locations. But many other attributes of the
process are unchanged:
• The process ID and the parent process ID. See Section 27.2 [Process Creation Concepts],
page 856.
• Session and process group membership. See Section 29.1 [Concepts of Job Control],
page 870.
• Real user ID and group ID, and supplementary group IDs. See Section 31.2 [The
Persona of a Process], page 898.
• Pending alarms. See Section 22.6 [Setting an Alarm], page 731.
• Current working directory and root directory. See Section 14.1 [Working Directory],
page 411. On GNU/Hurd systems, the root directory is not copied when executing a
setuid program; instead the system default root directory is used for the new program.
• File mode creation mask. See Section 14.9.7 [Assigning File Permissions], page 445.
Chapter 27: Processes 862
• Process signal mask; see Section 25.7.3 [Process Signal Mask], page 800.
• Pending signals; see Section 25.7 [Blocking Signals], page 798.
• Elapsed processor time associated with the process; see Section 22.4.2 [Processor Time
Inquiry], page 700.
If the set-user-ID and set-group-ID mode bits of the process image file are set, this affects
the effective user ID and effective group ID (respectively) of the process. These concepts
are discussed in detail in Section 31.2 [The Persona of a Process], page 898.
Signals that are set to be ignored in the existing process image are also set to be ignored
in the new process image. All other signals are set to the default action in the new process
image. For more information about signals, see Chapter 25 [Signal Handling], page 766.
File descriptors open in the existing process image remain open in the new process image,
unless they have the FD_CLOEXEC (close-on-exec) flag set. The files that remain open inherit
all attributes of the open file descriptors from the existing process image, including file
locks. File descriptors are discussed in Chapter 13 [Low-Level Input/Output], page 347.
Streams, by contrast, cannot survive through exec functions, because they are located
in the memory of the process itself. The new process image has no streams except those it
creates afresh. Each of the streams in the pre-exec process image has a descriptor inside
it, and these descriptors do survive through exec (provided that they do not have FD_
CLOEXEC set). The new process image can reconnect these to new streams using fdopen
(see Section 13.4 [Descriptors and Streams], page 358).
WNOHANG flag to indicate that the parent process shouldn’t wait; and the WUNTRACED
flag to request status information from stopped processes as well as processes that
have terminated.
The status information from the child process is stored in the object that status-ptr
points to, unless status-ptr is a null pointer.
This function is a cancellation point in multi-threaded programs. This is a problem
if the thread allocates some resources (like memory, file descriptors, semaphores or
whatever) at the time waitpid is called. If the thread gets canceled these resources
stay allocated until the program ends. To avoid this calls to waitpid should be
protected using cancellation handlers.
The return value is normally the process ID of the child process whose status is
reported. If there are child processes but none of them is waiting to be noticed,
waitpid will block until one is. However, if the WNOHANG option was specified, waitpid
will return zero instead of blocking.
If a specific PID to wait for was given to waitpid, it will ignore all other children
(if any). Therefore if there are children waiting to be noticed but the child whose
PID was specified is not one of them, waitpid will block or return zero as described
above.
A value of -1 is returned in case of error. The following errno error conditions are
defined for this function:
EINTR The function was interrupted by delivery of a signal to the calling process.
See Section 25.5 [Primitives Interrupted by Signals], page 793.
ECHILD There are no child processes to wait for, or the specified pid is not a child
of the calling process.
EINVAL An invalid value was provided for the options argument.
These symbolic constants are defined as values for the pid argument to the waitpid
function.
WAIT_ANY
This constant macro (whose value is -1) specifies that waitpid should return
status information about any child process.
WAIT_MYPGRP
This constant (with value 0) specifies that waitpid should return status in-
formation about any child process in the same process group as the calling
process.
These symbolic constants are defined as flags for the options argument to the waitpid
function. You can bitwise-OR the flags together to obtain a value to use as the argument.
WNOHANG
This flag specifies that waitpid should return immediately instead of waiting,
if there is no child process ready to be noticed.
WUNTRACED
This flag specifies that waitpid should report the status of any child processes
that have been stopped as well as those that have terminated.
Chapter 27: Processes 864
Here’s an example of how to use waitpid to get the status from all child processes
that have terminated, without ever waiting. This function is designed to be a handler for
SIGCHLD, the signal that indicates that at least one child process has terminated.
void
sigchld_handler (int signum)
{
int pid, status, serrno;
serrno = errno;
while (1)
{
pid = waitpid (WAIT_ANY, &status, WNOHANG);
if (pid < 0)
{
perror ("waitpid");
break;
}
if (pid == 0)
break;
notice_termination (pid, status);
}
errno = serrno;
}
Chapter 27: Processes 865
int
my_system (const char *command)
{
int status;
pid_t pid;
There are a couple of things you should pay attention to in this example.
Chapter 27: Processes 867
Remember that the first argv argument supplied to the program represents the name of
the program being executed. That is why, in the call to execl, SHELL is supplied once to
name the program to execute and a second time to supply a value for argv[0].
The execl call in the child process doesn’t return if it is successful. If it fails, you must
do something to make the child process terminate. Just returning a bad status code with
return would leave two processes running the original program. Instead, the right behavior
is for the child process to report failure to its parent process.
Call _exit to accomplish this. The reason for using _exit instead of exit is to avoid
flushing fully buffered streams such as stdout. The buffers of these streams probably
contain data that was copied from the parent process by the fork, data that will be output
eventually by the parent process. Calling exit in the child would output the data twice.
See Section 26.7.5 [Termination Internals], page 854.
868
28 Inter-Process Communication
This chapter describes the GNU C Library inter-process communication primitives.
28.1 Semaphores
The GNU C Library implements the semaphore APIs as defined in POSIX and System V.
Semaphores can be used by multiple processes to coordinate shared resources. The following
is a complete list of the semaphore functions provided by the GNU C Library.
int semop (int semid, struct sembuf *sops, size_t nsops); [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
29 Job Control
Job control refers to the protocol for allowing a user to move between multiple process
groups (or jobs) within a single login session. The job control facilities are set up so
that appropriate behavior for most programs happens automatically and they need not do
anything special about job control. So you can probably ignore the material in this chapter
unless you are writing a shell or login program.
You need to be familiar with concepts relating to process creation (see Section 27.2 [Pro-
cess Creation Concepts], page 856) and signal handling (see Chapter 25 [Signal Handling],
page 766) in order to understand this material presented in this chapter.
Some old systems do not support job control, but GNU systems always have, and it is a
required feature in the 2001 revision of POSIX.1 (see Section 1.2.2 [POSIX (The Portable
Operating System Interface)], page 2). If you need to be portable to old systems, you can
use the _POSIX_JOB_CONTROL macro to test at compile-time whether the system supports
job control. See Section 33.2 [Overall System Options], page 944.
prevent this, the shell must cooperate with the terminal driver using the protocol described
in this chapter.
The shell can give unlimited access to the controlling terminal to only one process group
at a time. This is called the foreground job on that controlling terminal. Other process
groups managed by the shell that are executing without such access to the terminal are
called background jobs.
If a background job needs to read from its controlling terminal, it is stopped by the ter-
minal driver; if the TOSTOP mode is set, likewise for writing. The user can stop a foreground
job by typing the SUSP character (see Section 17.4.9 [Special Characters], page 526) and a
program can stop any job by sending it a SIGSTOP signal. It’s the responsibility of the shell
to notice when jobs stop, to notify the user about them, and to provide mechanisms for
allowing the user to interactively continue stopped jobs and switch jobs between foreground
and background.
See Section 29.3 [Access to the Controlling Terminal], page 871, for more information
about I/O to the controlling terminal.
For more information about the primitive read and write functions, see Section 13.2
[Input and Output Primitives], page 351.
/* The active jobs are linked into a list. This is its head. */
job *first_job = NULL;
Here are some utility functions that are used for operating on job objects.
#include <sys/types.h>
#include <termios.h>
#include <unistd.h>
pid_t shell_pgid;
struct termios shell_tmodes;
int shell_terminal;
int shell_is_interactive;
void
init_shell ()
{
if (shell_is_interactive)
{
/* Loop until we are in the foreground. */
while (tcgetpgrp (shell_terminal) != (shell_pgid = getpgrp ()))
kill (- shell_pgid, SIGTTIN);
becomes its process group leader, and its process ID becomes the process group ID for the
group.
The shell should also call setpgid to put each of its child processes into the new process
group. This is because there is a potential timing problem: each child process must be put
in the process group before it begins executing a new program, and the shell depends on
having all the child processes in the group before it continues executing. If both the child
processes and the shell call setpgid, this ensures that the right things happen no matter
which process gets to it first.
If the job is being launched as a foreground job, the new process group also needs to be
put into the foreground on the controlling terminal using tcsetpgrp. Again, this should
be done by the shell as well as by each of its child processes, to avoid race conditions.
The next thing each child process should do is to reset its signal actions.
During initialization, the shell process set itself to ignore job control signals; see Sec-
tion 29.5.2 [Initializing the Shell], page 874. As a result, any child processes it creates also
ignore these signals by inheritance. This is definitely undesirable, so each child process
should explicitly set the actions for these signals back to SIG_DFL just after it is forked.
Since shells follow this convention, applications can assume that they inherit the correct
handling of these signals from the parent process. But every application has a responsi-
bility not to mess up the handling of stop signals. Applications that disable the normal
interpretation of the SUSP character should provide some other mechanism for the user to
stop the job. When the user invokes this mechanism, the program should send a SIGTSTP
signal to the process group of the process, not just to the process itself. See Section 25.6.2
[Signaling Another Process], page 795.
Finally, each child process should call exec in the normal way. This is also the point
at which redirection of the standard input and output channels should be handled. See
Section 13.13 [Duplicating Descriptors], page 392, for an explanation of how to do this.
Here is the function from the sample shell program that is responsible for launching a
program. The function is executed by each child process immediately after it has been
forked by the shell, and never returns.
void
launch_process (process *p, pid_t pgid,
int infile, int outfile, int errfile,
int foreground)
{
pid_t pid;
if (shell_is_interactive)
{
/* Put the process into the process group and give the process group
the terminal, if appropriate.
This has to be done both by the shell and in the individual
child processes because of potential race conditions. */
pid = getpid ();
if (pgid == 0) pgid = pid;
setpgid (pid, pgid);
if (foreground)
tcsetpgrp (shell_terminal, pgid);
/* Set the handling for job control signals back to the default. */
Chapter 29: Job Control 877
infile = j->stdin;
for (p = j->first_process; p; p = p->next)
{
/* Set up pipes, if necessary. */
if (p->next)
{
if (pipe (mypipe) < 0)
{
perror ("pipe");
exit (1);
}
outfile = mypipe[1];
Chapter 29: Job Control 878
}
else
outfile = j->stdout;
if (!shell_is_interactive)
wait_for_job (j);
else if (foreground)
put_job_in_foreground (j, 0);
else
put_job_in_background (j, 0);
}
When a foreground job is launched, the shell must first give it access to the controlling
terminal by calling tcsetpgrp. Then, the shell should wait for processes in that process
group to terminate or stop. This is discussed in more detail in Section 29.5.5 [Stopped and
Terminated Jobs], page 880.
Chapter 29: Job Control 879
When all of the processes in the group have either completed or stopped, the shell should
regain control of the terminal for its own process group by calling tcsetpgrp again. Since
stop signals caused by I/O from a background process or a SUSP character typed by the
user are sent to the process group, normally all the processes in the job stop together.
The foreground job may have left the terminal in a strange state, so the shell should
restore its own saved terminal modes before continuing. In case the job is merely stopped,
the shell should first save the current terminal modes so that it can restore them later if
the job is continued. The functions for dealing with terminal modes are tcgetattr and
tcsetattr; these are described in Section 17.4 [Terminal Modes], page 515.
Here is the sample shell’s function for doing all of this.
/* Put job j in the foreground. If cont is nonzero,
restore the saved terminal modes and send the process group a
SIGCONT signal to wake it up before we block. */
void
put_job_in_foreground (job *j, int cont)
{
/* Put the job into the foreground. */
tcsetpgrp (shell_terminal, j->pgid);
void
put_job_in_background (job *j, int cont)
{
/* Send the job a continue signal, if necessary. */
if (cont)
if (kill (-j->pgid, SIGCONT) < 0)
perror ("kill (SIGCONT)");
}
Chapter 29: Job Control 880
int
mark_process_status (pid_t pid, int status)
{
job *j;
process *p;
if (pid > 0)
{
/* Update the record for the process. */
for (j = first_job; j; j = j->next)
for (p = j->first_process; p; p = p->next)
if (p->pid == pid)
{
p->status = status;
if (WIFSTOPPED (status))
p->stopped = 1;
else
{
p->completed = 1;
if (WIFSIGNALED (status))
fprintf (stderr, "%d: Terminated by signal %d.\n",
(int) pid, WTERMSIG (p->status));
}
return 0;
}
fprintf (stderr, "No child process %d.\n", pid);
return -1;
}
Chapter 29: Job Control 881
void
update_status (void)
{
int status;
pid_t pid;
do
pid = waitpid (WAIT_ANY, &status, WUNTRACED|WNOHANG);
while (!mark_process_status (pid, status));
}
void
wait_for_job (job *j)
{
int status;
pid_t pid;
do
pid = waitpid (WAIT_ANY, &status, WUNTRACED);
while (!mark_process_status (pid, status)
&& !job_is_stopped (j)
&& !job_is_completed (j));
}
/* Format information about job status for the user to look at. */
void
format_job_info (job *j, const char *status)
{
fprintf (stderr, "%ld (%s): %s\n", (long)j->pgid, status, j->command);
}
Chapter 29: Job Control 882
void
do_job_notification (void)
{
job *j, *jlast, *jnext;
jlast = NULL;
for (j = first_job; j; j = jnext)
{
jnext = j->next;
/* If all processes have completed, tell the user the job has
completed and delete it from the list of active jobs. */
if (job_is_completed (j)) {
format_job_info (j, "completed");
if (jlast)
jlast->next = jnext;
else
first_job = jnext;
free_job (j);
}
void
mark_job_as_running (job *j)
{
Process *p;
void
continue_job (job *j, int foreground)
{
mark_job_as_running (j);
if (foreground)
put_job_in_foreground (j, 1);
else
put_job_in_background (j, 1);
}
EPERM The process indicated by the pid argument is a session leader, or is not
in the same session as the calling process, or the value of the pgid argu-
ment doesn’t match a process group ID in the same session as the calling
process.
ESRCH The process indicated by the pid argument is not the calling process or
a child of the calling process.
int setpgrp (pid_t pid, pid_t pgid) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This is the BSD Unix name for setpgid. Both functions do exactly the same thing.
group are sent a SIGTTOU signal. The exception is if the calling process itself is
ignoring or blocking SIGTTOU signals, in which case the operation is performed and
no signal is sent.
If successful, tcsetpgrp returns 0. A return value of -1 indicates an error. The
following errno error conditions are defined for this function:
EBADF The filedes argument is not a valid file descriptor.
EINVAL The pgid argument is not valid.
ENOSYS The system doesn’t support job control.
ENOTTY The filedes isn’t the controlling terminal of the calling process.
EPERM The pgid isn’t a process group in the same session as the calling process.
publickey
Public keys for Secure RPC.
rpc Remote procedure call names and numbers.
services Network services, see Section 16.6.4 [The Services Database], page 483.
shadow User passphrase hashes and related information.
More databases may be added later.
passwd: db files
shadow: files
group: db files
ethers: db files
protocols: db files
rpc: db files
services: db files
The first column is the database as you can guess from the table above. The rest of
the line specifies how the lookup process works. Please note that you specify the way it
works for each database individually. This cannot be done with the old way of a monolithic
implementation.
The configuration specification for each database can contain two different items:
• the service specification like files, db, or nis.
• the reaction on lookup result like [NOTFOUND=return].
Assume the service name shall be used for a lookup. The code for this service is im-
plemented in a module called libnss_name. On a system supporting shared libraries this
is in fact a shared library with the name (for example) libnss_name.so.2. The number
at the end is the currently used version of the interface which will not change frequently.
Normally the user should not have to be cognizant of these files since they should be placed
in a directory where they are found automatically. Only the names of all available services
are important.
Lastly, some system software may make use of the NSS configuration file to store their
own configuration for similar purposes. Examples of this include the automount service
which is used by autofs.
‘merge’
Proceed with the lookup process, retaining the current lookup result. This ac-
tion is useful only with the ‘success’ status. If a subsequent service lookup
succeeds and has a matching ‘return’ specification, the results are merged,
the lookup process ends, and the merged results are returned to the applica-
tion. If the following service has a matching ‘merge’ action, the lookup process
continues, retaining the combined data from this and any previous lookups.
After a merge action, errors from subsequent lookups are ignored, and the data
gathered so far will be returned.
The ‘merge’ only applies to the ‘success’ status. It is currently implemented
for the ‘group’ database and its group members field, ‘gr_mem’. If specified for
other databases, it causes the lookup to fail (if the status matches).
When processing ‘merge’ for ‘group’ membership, the group GID and name
must be identical for both entries. If only one or the other is a match, the
behavior is undefined.
If we have a line like
ethers: nisplus [NOTFOUND=return] db files
this is equivalent to
ethers: nisplus [SUCCESS=return NOTFOUND=return UNAVAIL=continue
TRYAGAIN=continue]
db [SUCCESS=return NOTFOUND=continue UNAVAIL=continue
TRYAGAIN=continue]
files
(except that it would have to be written on one line). The default value for the actions are
normally what you want, and only need to be changed in exceptional cases.
If the optional ! is placed before the status this means the following action is used for
all statuses but status itself. I.e., ! is negation as in the C language (and others).
Before we explain the exception which makes this action item necessary one more remark:
obviously it makes no sense to add another action item after the files service. Since there
is no other service following the action always is return.
Now, why is this [NOTFOUND=return] action useful? To understand this we should know
that the nisplus service is often complete; i.e., if an entry is not available in the NIS+ tables
it is not available anywhere else. This is what is expressed by this action item: it is useless
to examine further services since they will not give us a result.
The situation would be different if the NIS+ service is not available because the machine
is booting. In this case the return value of the lookup function is not notfound but instead
unavail. And as you can see in the complete form above: in this situation the db and
files services are used. Neat, isn’t it? The system administrator need not pay special
care for the time the system is not completely ready to work (while booting or shutdown
or network problems).
so it should normally be possible to get the system running even if the file is corrupted or
missing.
For the hosts and networks databases the default value is files dns. I.e., local con-
figuration will override the contents of the domain name system (DNS).
The passwd, group, and shadow databases was traditionally handled in a special way.
The appropriate files in the /etc directory were read but if an entry with a name starting
with a + character was found NIS was used. This kind of lookup was removed and now the
default value for the services is files. libnss compat no longer depends on libnsl and can
be used without NIS.
For all other databases the default value is files.
A second point is that the user should try to optimize the lookup process. The different
service have different response times. A simple file look up on a local file could be fast, but
if the file is long and the needed entry is near the end of the file this may take quite some
time. In this case it might be better to use the db service which allows fast local access to
large data sets.
Often the situation is that some global information like NIS must be used. So it is
unavoidable to use service entries like nis etc. But one should avoid slow services like this
if possible.
simply treated as if the function would return unavail (see Section 30.2.2 [Actions in the
NSS configuration], page 890).
The file name libnss_files.so.2 would be on a Solaris 2 system nss_files.so.2.
This is the difference mentioned above. Sun’s NSS modules are usable as modules which
get indirectly loaded only.
The NSS modules in the GNU C Library are prepared to be used as normal libraries
themselves. This is not true at the moment, though. However, the organization of the
name space in the modules does not make it impossible like it is for Solaris. Now you can
see why the modules are still libraries.2
In case the interface function has to return an error it is important that the correct error
code is stored in *errnop. Some return status values have only one associated error code,
others have more.
NSS_STATUS_TRYAGAIN EAGAIN One of the functions used ran temporarily
out of resources or a service is currently not
available.
ERANGE The provided buffer is not large enough.
The function should be called again with
a larger buffer.
NSS_STATUS_UNAVAIL ENOENT A necessary input file cannot be found.
NSS_STATUS_NOTFOUND ENOENT The requested entry is not available.
size_t buflen
length of the buffer pointed to by buffer.
int *errnop
the low-level error code to return to the application. If the return value
is not NSS_STATUS_SUCCESS, *errnop needs to be set to a non-zero value.
An NSS module should never set *errnop to zero. The value ERANGE is
special, as described above.
• possibly a last argument h errnop, for the host name and network name lookup func-
tions. If the return value is not NSS_STATUS_SUCCESS, *h_errnop needs to be set to a
non-zero value. A generic error code is NETDB_INTERNAL, which instructs the caller to
examine *errnop for further details. (This includes the ERANGE special case.)
This table is correct for all functions but the set...ent and end...ent functions.
But this is not always possible since some programs (those which run under IDs which
do not belong to the user) ignore this variable. Therefore the stable version of the module
should be placed into a directory which is searched by the dynamic linker. Normally this
should be the directory $prefix/lib, where $prefix corresponds to the value given to
configure using the --prefix option. But be careful: this should only be done if it is clear
the module does not cause any harm. System administrators should be careful.
As explained above this function could also have an additional last argument.
This depends on the database used; it happens only for host and networks.
The function shall return NSS_STATUS_SUCCESS as long as there are more en-
tries. When the last entry was read it should return NSS_STATUS_NOTFOUND.
When the buffer given as an argument is too small for the data to be returned
NSS_STATUS_TRYAGAIN should be returned. When the service was not formerly
initialized by a call to _nss_DATABASE_setdbent all return values allowed for
this function can also be returned here.
enum nss_status _nss_DATABASE_getdbbyXX_r (PARAMS, STRUCTURE *result, char
*buffer, size_t buflen, int *errnop)
This function shall return the entry from the database which is addressed by
the PARAMS. The type and number of these arguments vary. It must be
individually determined by looking to the user-level interface functions. All
arguments given to the non-reentrant version are here described by PARAMS.
The result must be stored in the structure pointed to by result. If there are
additional data to return (say strings, where the result structure only contains
pointers) the function must use the buffer of length buflen. There must not be
any references to non-constant global data.
The implementation of this function should honor the stayopen flag set by the
setDBent function whenever this makes sense.
Before the function returns, the implementation should store the value of the
local errno variable in the variable pointed to by errnop. This is important to
guarantee the module works in statically linked programs.
Again, this function takes an additional last argument for the host and
networks database.
The return value should as always follow the rules given above (see
Section 30.3.2 [The Interface of the Function in NSS Modules], page 893).
898
Finally, there are many operations which can only be performed by a process whose
effective user ID is zero. A process with this user ID is a privileged process. Commonly the
user name root is associated with user ID 0, but there may be other user names with this
ID.
Portability Note: Older systems do not have file IDs. To determine if a system has this
feature, you can test the compiler define _POSIX_SAVED_IDS. (In the POSIX standard, file
IDs are known as saved IDs.)
See Section 14.9 [File Attributes], page 434, for a more general discussion of file modes
and accessibility.
If count is zero, then getgroups just returns the total number of supplementary group
IDs. On systems that do not support supplementary groups, this will always be zero.
Here’s how to use getgroups to read all the supplementary group IDs:
gid_t *
read_all_groups (void)
{
int ngroups = getgroups (0, NULL);
gid_t *groups
= (gid_t *) xmalloc (ngroups * sizeof (gid_t));
int val = getgroups (ngroups, groups);
if (val < 0)
{
free (groups);
return NULL;
}
return groups;
}
The return values and error conditions are the same as for seteuid.
if (pw == NULL)
return NULL;
void
do_setuid (void)
{
int status;
#ifdef _POSIX_SAVED_IDS
Chapter 31: Users and Groups 906
void
undo_setuid (void)
{
int status;
#ifdef _POSIX_SAVED_IDS
status = seteuid (ruid);
#else
status = setreuid (euid, ruid);
#endif
if (status < 0) {
fprintf (stderr, "Couldn't set uid.\n");
exit (status);
}
}
/* Main program. */
int
main (void)
{
/* Remember the real and effective user IDs. */
ruid = getuid ();
euid = geteuid ();
undo_setuid ();
int
record_score (int score)
{
FILE *stream;
char *myname;
undo_setuid ();
These functions let your program identify positively the user who is running or the
user who logged in this session. (These can differ when setuid programs are involved; see
Section 31.2 [The Persona of a Process], page 898.) The user cannot do anything to fool
these functions.
For most purposes, it is more useful to use the environment variable LOGNAME to find out
who the user is. This is more flexible precisely because the user can set LOGNAME arbitrarily.
See Section 26.4.2 [Standard Environment Variables], page 847.
Chapter 31: Users and Groups 909
long ut_session
The Session ID, used for windowing.
struct timeval ut_tv
Time the entry was made. For entries of type OLD_TIME this is the time
when the system clock changed, and for entries of type NEW_TIME this is
the time the system clock was set to.
int32_t ut_addr_v6[4]
The Internet address of a remote host.
The ut_type, ut_pid, ut_id, ut_tv, and ut_host fields are not available on all systems.
Portable applications therefore should be prepared for these situations. To help do this the
utmp.h header provides macros _HAVE_UT_TYPE, _HAVE_UT_PID, _HAVE_UT_ID, _HAVE_UT_
TV, and _HAVE_UT_HOST if the respective field is available. The programmer can handle the
situations by using #ifdef in the program code.
The following macros are defined for use as values for the ut_type member of the utmp
structure. The values are integer constants.
EMPTY This macro is used to indicate that the entry contains no valid user accounting
information.
RUN_LVL This macro is used to identify the system’s runlevel.
BOOT_TIME
This macro is used to identify the time of system boot.
OLD_TIME This macro is used to identify the time when the system clock changed.
NEW_TIME This macro is used to identify the time after the system clock changed.
INIT_PROCESS
This macro is used to identify a process spawned by the init process.
LOGIN_PROCESS
This macro is used to identify the session leader of a logged in user.
USER_PROCESS
This macro is used to identify a user process.
DEAD_PROCESS
This macro is used to identify a terminated process.
ACCOUNTING
???
The size of the ut_line, ut_id, ut_user and ut_host arrays can be found using the
sizeof operator.
Many older systems have, instead of an ut_tv member, an ut_time member, usually of
type time_t, for representing the time associated with the entry. Therefore, for backwards
compatibility only, utmp.h defines ut_time as an alias for ut_tv.tv_sec.
void setutent (void) [Function]
Preliminary: | MT-Unsafe race:utent | AS-Unsafe lock | AC-Unsafe lock fd | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
Chapter 31: Users and Groups 911
This function opens the user accounting database to begin scanning it. You can then
call getutent, getutid or getutline to read entries and pututline to write entries.
If the database is already open, it resets the input to the beginning of the database.
an entry, it returns a pointer to the entry which is statically allocated, and may be
overwritten by a subsequent call to getutent, getutid or getutline. You must copy
the contents of the structure if you wish to save the information.
A null pointer is returned in case the end of the database is reached without a match.
The getutline function may cache the last read entry. Therefore if you are using
getutline to search for multiple occurrences, it is necessary to zero out the static
data after each call. Otherwise getutline could just return a pointer to the same
entry over and over again.
All the get* functions mentioned before store the information they return in a static
buffer. This can be a problem in multi-threaded programs since the data returned for the
request is overwritten by the return value data in another thread. Therefore the GNU C
Library provides as extensions three more functions which return the data in a user-provided
buffer.
int getutid_r (const struct utmp *id, struct utmp *buffer, [Function]
struct utmp **result)
Preliminary: | MT-Unsafe race:utent sig:ALRM timer | AS-Unsafe lock | AC-Unsafe
lock fd | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
Chapter 31: Users and Groups 913
This function retrieves just like getutid the next entry matching the information
stored in id. But the result is stored in the buffer pointed to by the parameter buffer.
If successful the function returns 0 and the pointer variable pointed to by the pa-
rameter result contains a pointer to the buffer with the result (probably the same as
result. If not successful the function return -1.
This function is a GNU extension.
In addition to the user accounting database, most systems keep a number of similar
databases. For example most systems keep a log file with all previous logins (usually in
/etc/wtmp or /var/log/wtmp).
For specifying which database to examine, the following function should be used.
The utmpname function returns a value of 0 if the new name was successfully stored,
and a value of -1 to indicate an error. Note that utmpname does not try to open the
database, and that therefore the return value does not say anything about whether
the database can be successfully opened.
Specially for maintaining log-like databases the GNU C Library provides the following
function:
Chapter 31: Users and Groups 914
EMPTY This macro is used to indicate that the entry contains no valid user accounting
information.
RUN_LVL This macro is used to identify the system’s runlevel.
BOOT_TIME
This macro is used to identify the time of system boot.
OLD_TIME This macro is used to identify the time when the system clock changed.
NEW_TIME This macro is used to identify the time after the system clock changed.
INIT_PROCESS
This macro is used to identify a process spawned by the init process.
LOGIN_PROCESS
This macro is used to identify the session leader of a logged in user.
USER_PROCESS
This macro is used to identify a user process.
DEAD_PROCESS
This macro is used to identify a terminated process.
The size of the ut_line, ut_id and ut_user arrays can be found using the sizeof
operator.
Portability Note: The BSD struct utmp only has the ut_line, ut_name, ut_host and
ut_time members. Older systems do not even have the ut_host member.
bytes of the additional buffer pointed to by buffer are used to contain additional
information, normally strings which are pointed to by the elements of the result
structure.
If a user with ID uid is found, the pointer returned in result points to the record
which contains the wanted data (i.e., result contains the value result buf ). If no user
is found or if an error occurred, the pointer returned in result is a null pointer. The
function returns zero or an error code. If the buffer buffer is too small to contain all
the needed information, the error code ERANGE is returned and errno is set to ERANGE.
struct passwd * getpwnam (const char *name) [Function]
Preliminary: | MT-Unsafe race:pwnam locale | AS-Unsafe dlopen plugin heap lock
| AC-Unsafe corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
This function returns a pointer to a statically-allocated structure containing informa-
tion about the user whose user name is name. This structure may be overwritten on
subsequent calls to getpwnam.
A null pointer return indicates there is no user named name.
int getpwnam_r (const char *name, struct passwd [Function]
*result_buf, char *buffer, size_t buflen, struct passwd
**result)
Preliminary: | MT-Safe locale | AS-Unsafe dlopen plugin heap lock | AC-Unsafe
corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
This function is similar to getpwnam in that it returns information about the user
whose user name is name. However, like getpwuid_r, it fills the user supplied buffers
in result buf and buffer with the information instead of using a static buffer.
The return values are the same as for getpwuid_r.
This function is similar to fgetpwent in that it reads the next user entry from stream.
But the result is returned in the structure pointed to by result buf. The first buflen
bytes of the additional buffer pointed to by buffer are used to contain additional
information, normally strings which are pointed to by the elements of the result
structure.
The stream must correspond to a file in the same format as the standard user database
file.
If the function returns zero result points to the structure with the wanted data (nor-
mally this is in result buf ). If errors occurred the return value is nonzero and result
contains a null pointer.
The way to scan all the entries in the user database is with setpwent, getpwent, and
endpwent.
The way to scan all the entries in the group database is with setgrent, getgrent, and
endgrent.
#include <grp.h>
#include <pwd.h>
#include <sys/types.h>
#include <unistd.h>
#include <stdlib.h>
int
main (void)
{
uid_t me;
struct passwd *my_passwd;
struct group *my_group;
char **members;
return EXIT_SUCCESS;
}
Here is some output from this program:
I am Throckmorton Snurd.
My login name is snurd.
My uid is 31093.
My home directory is /home/fsg/snurd.
My default shell is /bin/sh.
My default group is guest (12).
The members of this group are:
friedman
tami
be entries which will not match any input. For entries like this, a name consisting of the
single character - shall be used.
It is important to remember that there is only one single state for iterating the netgroups.
Even if the programmer uses the getnetgrent_r function the result is not really reentrant
since always only one single netgroup at a time can be processed. If the program needs
to process more than one netgroup simultaneously she must protect this by using external
locking. This problem was introduced in the original netgroups implementation in SunOS
and since we must stay compatible it is not possible to change this.
Some other functions also use the netgroups state. Currently these are the innetgr
function and parts of the implementation of the compat service part of the NSS implemen-
tation.
This function is similar to getnetgrent with only one exception: the strings the three
string pointers hostp, userp, and domainp point to, are placed in the buffer of buflen
bytes starting at buffer. This means the returned values are valid even after other
netgroup related functions are called.
The return value is 1 if the next entry was successfully read and the buffer contains
enough room to place the strings in it. 0 is returned in case no more entries are found,
the buffer is too small, or internal errors occurred.
This function is a GNU extension. The original implementation in the SunOS libc
does not provide this function.
int innetgr (const char *netgroup, const char *host, const [Function]
char *user, const char *domain)
Preliminary: | MT-Unsafe race:netgrent locale | AS-Unsafe dlopen plugin heap lock
| AC-Unsafe corrupt lock fd mem | See Section 1.2.2.1 [POSIX Safety Concepts],
page 2.
This function tests whether the triple specified by the parameters host, user, and
domain is part of the netgroup netgroup. Using this function has the advantage that
1. no other netgroup function can use the global netgroup state since internal locking
is used and
2. the function is implemented more efficiently than successive calls to the other
set/get/endnetgrent functions.
Any of the pointers host, user, or domain can be NULL which means any value is
accepted in this position. This is also true for the name - which should not match
any other string otherwise.
The return value is 1 if an entry matching the given triple is found in the netgroup.
The return value is 0 if the netgroup itself is not found, the netgroup does not contain
the triple or internal errors occurred.
928
32 System Management
This chapter describes facilities for controlling the system that underlies a process (including
the operating system and hardware) and for getting information about it. Anyone can
generally use the informational facilities, but usually only a properly privileged process can
make changes.
To get information on parameters of the system that are built into the system, such as the
maximum length of a filename, Chapter 33 [System Configuration Parameters], page 943.
This function returns the host name of the system on which it is called, in the array
name. The size argument specifies the size of this array, in bytes. Note that this is
not the DNS hostname. If the system participates in the DNS, this is the FQDN (see
above).
The return value is 0 on success and -1 on failure. In the GNU C Library,
gethostname fails if size is not large enough; then you can try again with a larger
array. The following errno error condition is defined for this function:
ENAMETOOLONG
The size argument is less than the size of the host name plus one.
On some systems, there is a symbol for the maximum possible host name length:
MAXHOSTNAMELEN. It is defined in sys/param.h. But you can’t count on this to exist,
so it is cleaner to handle failure and try again.
gethostname stores the beginning of the host name in name even if the host name
won’t entirely fit. For some purposes, a truncated host name is good enough. If it is,
you can ignore the error code.
char release[]
This is the current release level of the operating system implementation.
char version[]
This is the current version level within the release of the operating system.
char machine[]
This is a description of the type of hardware that is in use.
Some systems provide a mechanism to interrogate the kernel directly
for this information. On systems without such a mechanism, the GNU
C Library fills in this field based on the configuration name that was
specified when building and installing the library.
GNU uses a three-part name to describe a system configuration; the three
parts are cpu, manufacturer and system-type, and they are separated
with dashes. Any possible combination of three names is potentially
meaningful, but most such combinations are meaningless in practice and
even the meaningful ones are not necessarily supported by any particular
GNU program.
Since the value in machine is supposed to describe just the
hardware, it consists of the first two parts of the configuration name:
‘cpu-manufacturer’. For example, it might be one of these:
"sparc-sun", "i386-anything", "m68k-hp", "m68k-sony",
"m68k-sun", "mips-dec"
char nodename[]
This is the host name of this particular computer. In the GNU C Library,
the value is the same as that returned by gethostname; see Section 32.1
[Host Identification], page 928.
gethostname is implemented with a call to uname.
char domainname[]
This is the NIS or YP domain name. It is the same value returned by
getdomainname; see Section 32.1 [Host Identification], page 928. This
element is a relatively recent invention and use of it is not as portable as
use of the rest of the structure.
int uname (struct utsname *info) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
The uname function fills in the structure pointed to by info with information about
the operating system and host machine. A non-negative return value indicates that
the data was successfully stored.
-1 as the return value indicates an error. The only error possible is EFAULT, which
we normally don’t mention as it is always a possibility.
doing almost anything. This section explains how to find out what filesystems are cur-
rently mounted and what filesystems are available for mounting, and how to change what
is mounted.
The classic filesystem is the contents of a disk drive. The concept is considerably more
abstract, though, and lots of things other than disk drives can be mounted.
Some block devices don’t correspond to traditional devices like disk drives. For example,
a loop device is a block device whose driver uses a regular file in another filesystem as its
medium. So if that regular file contains appropriate data for a filesystem, you can by
mounting the loop device essentially mount a regular file.
Some filesystems aren’t based on a device of any kind. The “proc” filesystem, for exam-
ple, contains files whose data is made up by the filesystem driver on the fly whenever you
ask for it. And when you write to it, the data you write causes changes in the system. No
data gets stored.
but it could also be a more or less generic string. For NFS it would be a
hostname and directory name combination.
Even though the element is not declared const it shouldn’t be modi-
fied. The missing const has historic reasons, since this function predates
ISO C. The same is true for the other string elements of this structure.
char *fs_file
This describes the mount point on the local system. I.e., accessing any
file in this filesystem has implicitly or explicitly this string as a prefix.
char *fs_vfstype
This is the type of the filesystem. Depending on what the underlying
kernel understands it can be any string.
char *fs_mntops
This is a string containing options passed to the kernel with the mount
call. Again, this can be almost anything. There can be more than one
option, separated from the others by a comma. Each option consists of a
name and an optional value part, introduced by an = character.
If the value of this element must be processed it should ideally be done us-
ing the getsubopt function; see Section 26.3.12.1 [Parsing of Suboptions],
page 842.
const char *fs_type
This name is poorly chosen. This element points to a string (possibly in
the fs_mntops string) which describes the modes with which the filesys-
tem is mounted. fstab defines five macros to describe the possible values:
FSTAB_RW The filesystem gets mounted with read and write enabled.
FSTAB_RQ The filesystem gets mounted with read and write enabled.
Write access is restricted by quotas.
FSTAB_RO The filesystem gets mounted read-only.
FSTAB_SW This is not a real filesystem, it is a swap device.
FSTAB_XX This entry from the fstab file is totally ignored.
Testing for equality with these values must happen using strcmp since
these are all strings. Comparing the pointer will probably always fail.
int fs_freq
This element describes the dump frequency in days.
int fs_passno
This element describes the pass number on parallel dumps. It is closely
related to the dump utility used on Unix systems.
To read the entire content of the of the fstab file the GNU C Library contains a set of
three functions which are designed in the usual way.
int setfsent (void) [Function]
Preliminary: | MT-Unsafe race:fsent | AS-Unsafe heap corrupt lock | AC-Unsafe
corrupt lock mem fd | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
Chapter 32: System Management 934
This function makes sure that the internal read pointer for the fstab file is at the
beginning of the file. This is done by either opening the file or resetting the read
pointer.
Since the file handle is internal to the libc this function is not thread-safe.
This function returns a non-zero value if the operation was successful and the getfs*
functions can be used to read the entries of the file.
char *mnt_fsname
This element contains a pointer to a string describing the name of the
special device from which the filesystem is mounted. It corresponds to
the fs_spec element in struct fstab.
char *mnt_dir
This element points to a string describing the mount point of the filesys-
tem. It corresponds to the fs_file element in struct fstab.
char *mnt_type
mnt_type describes the filesystem type and is therefore equivalent to fs_
vfstype in struct fstab. mntent.h defines a few symbolic names for
some of the values this string can have. But since the kernel can support
arbitrary filesystems it does not make much sense to give them symbolic
names. If one knows the symbol name one also knows the filesystem name.
Nevertheless here follows the list of the symbols provided in mntent.h.
MNTTYPE_IGNORE
This symbol expands to "ignore". The value is sometimes
used in fstab files to make sure entries are not used without
removing them.
MNTTYPE_NFS
Expands to "nfs". Using this macro sometimes could make
sense since it names the default NFS implementation, in case
both version 2 and 3 are supported.
MNTTYPE_SWAP
This symbol expands to "swap". It names the special fstab
entry which names one of the possibly multiple swap parti-
tions.
char *mnt_opts
The element contains a string describing the options used while mounting
the filesystem. As for the equivalent element fs_mntops of struct fstab
it is best to use the function getsubopt (see Section 26.3.12.1 [Parsing of
Suboptions], page 842) to access the parts of this string.
The mntent.h file defines a number of macros with string values which
correspond to some of the options understood by the kernel. There might
be many more options which are possible so it doesn’t make much sense
to rely on these macros but to be consistent here is the list:
Chapter 32: System Management 936
MNTOPT_DEFAULTS
Expands to "defaults". This option should be used alone
since it indicates all values for the customizable values are
chosen to be the default.
MNTOPT_RO
Expands to "ro". See the FSTAB_RO value, it means the
filesystem is mounted read-only.
MNTOPT_RW
Expands to "rw". See the FSTAB_RW value, it means the
filesystem is mounted with read and write permissions.
MNTOPT_SUID
Expands to "suid". This means that the SUID bit (see
Section 31.4 [How an Application Can Change Persona],
page 899) is respected when a program from the filesystem
is started.
MNTOPT_NOSUID
Expands to "nosuid". This is the opposite of MNTOPT_SUID,
the SUID bit for all files from the filesystem is ignored.
MNTOPT_NOAUTO
Expands to "noauto". At startup time the mount program
will ignore this entry if it is started with the -a option to
mount all filesystems mentioned in the fstab file.
As for the FSTAB_* entries introduced above it is important to use strcmp
to check for equality.
mnt_freq This elements corresponds to fs_freq and also specifies the frequency in
days in which dumps are made.
mnt_passno
This element is equivalent to fs_passno with the same meaning which is
uninteresting for all programs beside dump.
For accessing the mtab file there is again a set of three functions to access all entries in
a row. Unlike the functions to handle fstab these functions do not access a fixed file and
there is even a thread safe variant of the get function. Besides this the GNU C Library
contains functions to alter the file and test for specific options.
FILE * setmntent (const char *file, const char *mode) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap lock | AC-Unsafe mem fd lock | See
Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The setmntent function prepares the file named FILE which must be in the format
of a fstab and mtab file for the upcoming processing through the other functions of
the family. The mode parameter can be chosen in the way the opentype parameter
for fopen (see Section 12.3 [Opening Streams], page 271) can be chosen. If the file is
opened for writing the file is also allowed to be empty.
If the file was successfully opened setmntent returns a file handle for future use.
Otherwise the return value is NULL and errno is set accordingly.
Chapter 32: System Management 937
The addmntent function allows adding a new entry to the file previously opened with
setmntent. The new entries are always appended. I.e., even if the position of the
file descriptor is not at the end of the file this function does not overwrite an existing
entry following the current position.
The implication of this is that to remove an entry from a file one has to create a new
file while leaving out the entry to be removed and after closing the file remove the
old one and rename the new file to the chosen name.
This function takes care of spaces and tab characters in the names to be written to
the file. It converts them and the backslash character into the format described in
the getmntent description above.
This function returns 0 in case the operation was successful. Otherwise the return
value is 1 and errno is set appropriately.
char * hasmntopt (const struct mntent *mnt, const char [Function]
*opt)
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
This function can be used to check whether the string pointed to by the mnt_opts
element of the variable pointed to by mnt contains the option opt. If this is true a
pointer to the beginning of the option in the mnt_opts element is returned. If no
such option exists the function returns NULL.
This function is useful to test whether a specific option is present but when all options
have to be processed one is better off with using the getsubopt function to iterate
over all options in the string.
For a mount, the filesystem on the block device represented by the device special
file named special file gets mounted over the mount point dir. This means that the
directory dir (along with any files in it) is no longer visible; in its place (and still with
the name dir) is the root directory of the filesystem on the device.
As an exception, if the filesystem type (see below) is one which is not based on a
device (e.g. “proc”), mount instantiates a filesystem and mounts it over dir and
ignores special file.
For a remount, dir specifies the mount point where the filesystem to be remounted is
(and remains) mounted and special file is ignored. Remounting a filesystem means
changing the options that control operations on the filesystem while it is mounted. It
does not mean unmounting and mounting again.
For a mount, you must identify the type of the filesystem with fstype. This type
tells the kernel how to access the filesystem and can be thought of as the name
of a filesystem driver. The acceptable values are system dependent. On a system
with a Linux kernel and the proc filesystem, the list of possible values is in the file
filesystems in the proc filesystem (e.g. type cat /proc/filesystems to see the
list). With a Linux kernel, the types of filesystems that mount can mount, and their
type names, depends on what filesystem drivers are configured into the kernel or
loaded as loadable kernel modules. An example of a common value for fstype is ext2.
For a remount, mount ignores fstype.
options specifies a variety of options that apply until the filesystem is unmounted or
remounted. The precise meaning of an option depends on the filesystem and with some
filesystems, an option may have no effect at all. Furthermore, for some filesystems,
some of these options (but never MS_RDONLY) can be overridden for individual file
accesses via ioctl.
options is a bit string with bit fields defined using the following mask and masked
value macros:
MS_MGC_MASK
This multibit field contains a magic number. If it does not have the value
MS_MGC_VAL, mount assumes all the following bits are zero and the data
argument is a null string, regardless of their actual values.
MS_REMOUNT
This bit on means to remount the filesystem. Off means to mount it.
MS_RDONLY
This bit on specifies that no writing to the filesystem shall be allowed
while it is mounted. This cannot be overridden by ioctl. This option is
available on nearly all filesystems.
MS_NOSUID
This bit on specifies that Setuid and Setgid permissions on files in the
filesystem shall be ignored while it is mounted.
MS_NOEXEC
This bit on specifies that no files in the filesystem shall be executed while
the filesystem is mounted.
Chapter 32: System Management 940
MS_NODEV This bit on specifies that no device special files in the filesystem shall be
accessible while the filesystem is mounted.
MS_SYNCHRONOUS
This bit on specifies that all writes to the filesystem while it is mounted
shall be synchronous; i.e., data shall be synced before each write com-
pletes rather than held in the buffer cache.
MS_MANDLOCK
This bit on specifies that mandatory locks on files shall be permitted
while the filesystem is mounted.
MS_NOATIME
This bit on specifies that access times of files shall not be updated when
the files are accessed while the filesystem is mounted.
MS_NODIRATIME
This bit on specifies that access times of directories shall not be updated
when the directories are accessed while the filesystem in mounted.
Any bits not covered by the above masks should be set off; otherwise, results are
undefined.
The meaning of data depends on the filesystem type and is controlled entirely by the
filesystem driver in the kernel.
Example:
#include <sys/mount.h>
Appropriate arguments for mount are conventionally recorded in the fstab table. See
Section 32.3.1 [Mount Information], page 932.
The return value is zero if the mount or remount is successful. Otherwise, it is -1 and
errno is set appropriately. The values of errno are filesystem dependent, but here is
a general list:
EPERM The process is not superuser.
ENODEV The file system type fstype is not known to the kernel.
ENOTBLK The file dev is not a block device special file.
EBUSY
• The device is already mounted.
• The mount point is busy. (E.g. it is some process’ working directory
or has a filesystem mounted on it already).
• The request is to remount read-only, but there are files open for
writing.
EINVAL
• A remount was attempted, but there is no filesystem mounted over
the specified mount point.
Chapter 32: System Management 941
umount2("/mnt", MNT_FORCE);
umount2("/dev/hdd1", 0);
After the filesystem is unmounted, the directory that was the mount point is visible,
as are any files in it.
As part of unmounting, umount2 syncs the filesystem.
If the unmounting is successful, the return value is zero. Otherwise, it is -1 and errno
is set accordingly:
EPERM The process is not superuser.
EBUSY The filesystem cannot be unmounted because it is busy. E.g. it contains
a directory that is some process’s working directory or a file that some
process has open. With some filesystems in some cases, you can avoid
this failure with the MNT_FORCE option.
Chapter 32: System Management 942
EINVAL file validly refers to a file, but that file is neither a mount point nor a
device special file of a currently mounted filesystem.
This function is not available on all systems.
can’t change it back again. See Section 31.8 [Enabling and Disabling Setuid Access],
page 904.
For the following macros, if the macro is defined in unistd.h, then its value indicates
whether the option is supported. A value of -1 means no, and any other value means yes.
If the macro is not defined, then the option may or may not be supported; use sysconf to
find out. See Section 33.4 [Using sysconf], page 946.
_SC_JOB_CONTROL
Inquire about the parameter corresponding to _POSIX_JOB_CONTROL.
_SC_SAVED_IDS
Inquire about the parameter corresponding to _POSIX_SAVED_IDS.
_SC_VERSION
Inquire about the parameter corresponding to _POSIX_VERSION.
_SC_CLK_TCK
Inquire about the number of clock ticks per second; see Section 22.4.1 [CPU
Time Inquiry], page 700. The corresponding parameter CLK_TCK is obsolete.
_SC_CHARCLASS_NAME_MAX
Inquire about the parameter corresponding to maximal length allowed for a
character class name in an extended locale specification. These extensions are
not yet standardized and so this option is not standardized as well.
_SC_REALTIME_SIGNALS
Inquire about the parameter corresponding to _POSIX_REALTIME_SIGNALS.
_SC_PRIORITY_SCHEDULING
Inquire about the parameter corresponding to _POSIX_PRIORITY_SCHEDULING.
_SC_TIMERS
Inquire about the parameter corresponding to _POSIX_TIMERS.
_SC_ASYNCHRONOUS_IO
Inquire about the parameter corresponding to _POSIX_ASYNCHRONOUS_IO.
_SC_PRIORITIZED_IO
Inquire about the parameter corresponding to _POSIX_PRIORITIZED_IO.
_SC_SYNCHRONIZED_IO
Inquire about the parameter corresponding to _POSIX_SYNCHRONIZED_IO.
_SC_FSYNC
Inquire about the parameter corresponding to _POSIX_FSYNC.
_SC_MAPPED_FILES
Inquire about the parameter corresponding to _POSIX_MAPPED_FILES.
_SC_MEMLOCK
Inquire about the parameter corresponding to _POSIX_MEMLOCK.
_SC_MEMLOCK_RANGE
Inquire about the parameter corresponding to _POSIX_MEMLOCK_RANGE.
_SC_MEMORY_PROTECTION
Inquire about the parameter corresponding to _POSIX_MEMORY_PROTECTION.
_SC_MESSAGE_PASSING
Inquire about the parameter corresponding to _POSIX_MESSAGE_PASSING.
_SC_SEMAPHORES
Inquire about the parameter corresponding to _POSIX_SEMAPHORES.
Chapter 33: System Configuration Parameters 948
_SC_SHARED_MEMORY_OBJECTS
Inquire about the parameter corresponding to
_POSIX_SHARED_MEMORY_OBJECTS.
_SC_AIO_LISTIO_MAX
Inquire about the parameter corresponding to _POSIX_AIO_LISTIO_MAX.
_SC_AIO_MAX
Inquire about the parameter corresponding to _POSIX_AIO_MAX.
_SC_AIO_PRIO_DELTA_MAX
Inquire about the value by which a process can decrease its asynchronous I/O
priority level from its own scheduling priority. This corresponds to the run-time
invariant value AIO_PRIO_DELTA_MAX.
_SC_DELAYTIMER_MAX
Inquire about the parameter corresponding to _POSIX_DELAYTIMER_MAX.
_SC_MQ_OPEN_MAX
Inquire about the parameter corresponding to _POSIX_MQ_OPEN_MAX.
_SC_MQ_PRIO_MAX
Inquire about the parameter corresponding to _POSIX_MQ_PRIO_MAX.
_SC_RTSIG_MAX
Inquire about the parameter corresponding to _POSIX_RTSIG_MAX.
_SC_SEM_NSEMS_MAX
Inquire about the parameter corresponding to _POSIX_SEM_NSEMS_MAX.
_SC_SEM_VALUE_MAX
Inquire about the parameter corresponding to _POSIX_SEM_VALUE_MAX.
_SC_SIGQUEUE_MAX
Inquire about the parameter corresponding to _POSIX_SIGQUEUE_MAX.
_SC_TIMER_MAX
Inquire about the parameter corresponding to _POSIX_TIMER_MAX.
_SC_PII Inquire about the parameter corresponding to _POSIX_PII.
_SC_PII_XTI
Inquire about the parameter corresponding to _POSIX_PII_XTI.
_SC_PII_SOCKET
Inquire about the parameter corresponding to _POSIX_PII_SOCKET.
_SC_PII_INTERNET
Inquire about the parameter corresponding to _POSIX_PII_INTERNET.
_SC_PII_OSI
Inquire about the parameter corresponding to _POSIX_PII_OSI.
_SC_SELECT
Inquire about the parameter corresponding to _POSIX_SELECT.
_SC_UIO_MAXIOV
Inquire about the parameter corresponding to _POSIX_UIO_MAXIOV.
Chapter 33: System Configuration Parameters 949
_SC_PII_INTERNET_STREAM
Inquire about the parameter corresponding to _POSIX_PII_INTERNET_STREAM.
_SC_PII_INTERNET_DGRAM
Inquire about the parameter corresponding to _POSIX_PII_INTERNET_DGRAM.
_SC_PII_OSI_COTS
Inquire about the parameter corresponding to _POSIX_PII_OSI_COTS.
_SC_PII_OSI_CLTS
Inquire about the parameter corresponding to _POSIX_PII_OSI_CLTS.
_SC_PII_OSI_M
Inquire about the parameter corresponding to _POSIX_PII_OSI_M.
_SC_T_IOV_MAX
Inquire about the value associated with the T_IOV_MAX variable.
_SC_THREADS
Inquire about the parameter corresponding to _POSIX_THREADS.
_SC_THREAD_SAFE_FUNCTIONS
Inquire about the parameter corresponding to
_POSIX_THREAD_SAFE_FUNCTIONS.
_SC_GETGR_R_SIZE_MAX
Inquire about the parameter corresponding to _POSIX_GETGR_R_SIZE_MAX.
_SC_GETPW_R_SIZE_MAX
Inquire about the parameter corresponding to _POSIX_GETPW_R_SIZE_MAX.
_SC_LOGIN_NAME_MAX
Inquire about the parameter corresponding to _POSIX_LOGIN_NAME_MAX.
_SC_TTY_NAME_MAX
Inquire about the parameter corresponding to _POSIX_TTY_NAME_MAX.
_SC_THREAD_DESTRUCTOR_ITERATIONS
Inquire about the parameter corresponding to _POSIX_THREAD_DESTRUCTOR_
ITERATIONS.
_SC_THREAD_KEYS_MAX
Inquire about the parameter corresponding to _POSIX_THREAD_KEYS_MAX.
_SC_THREAD_STACK_MIN
Inquire about the parameter corresponding to _POSIX_THREAD_STACK_MIN.
_SC_THREAD_THREADS_MAX
Inquire about the parameter corresponding to _POSIX_THREAD_THREADS_MAX.
_SC_THREAD_ATTR_STACKADDR
Inquire about the parameter corresponding to
a _POSIX_THREAD_ATTR_STACKADDR.
_SC_THREAD_ATTR_STACKSIZE
Inquire about the parameter corresponding to
_POSIX_THREAD_ATTR_STACKSIZE.
Chapter 33: System Configuration Parameters 950
_SC_THREAD_PRIORITY_SCHEDULING
Inquire about the parameter corresponding to _POSIX_THREAD_PRIORITY_
SCHEDULING.
_SC_THREAD_PRIO_INHERIT
Inquire about the parameter corresponding to _POSIX_THREAD_PRIO_INHERIT.
_SC_THREAD_PRIO_PROTECT
Inquire about the parameter corresponding to _POSIX_THREAD_PRIO_PROTECT.
_SC_THREAD_PROCESS_SHARED
Inquire about the parameter corresponding to _POSIX_THREAD_PROCESS_
SHARED.
_SC_2_C_DEV
Inquire about whether the system has the POSIX.2 C compiler command, c89.
_SC_2_FORT_DEV
Inquire about whether the system has the POSIX.2 Fortran compiler command,
fort77.
_SC_2_FORT_RUN
Inquire about whether the system has the POSIX.2 asa command to interpret
Fortran carriage control.
_SC_2_LOCALEDEF
Inquire about whether the system has the POSIX.2 localedef command.
_SC_2_SW_DEV
Inquire about whether the system has the POSIX.2 commands ar, make, and
strip.
_SC_BC_BASE_MAX
Inquire about the maximum value of obase in the bc utility.
_SC_BC_DIM_MAX
Inquire about the maximum size of an array in the bc utility.
_SC_BC_SCALE_MAX
Inquire about the maximum value of scale in the bc utility.
_SC_BC_STRING_MAX
Inquire about the maximum size of a string constant in the bc utility.
_SC_COLL_WEIGHTS_MAX
Inquire about the maximum number of weights that can necessarily be used in
defining the collating sequence for a locale.
_SC_EXPR_NEST_MAX
Inquire about the maximum number of expressions nested within parentheses
when using the expr utility.
_SC_LINE_MAX
Inquire about the maximum size of a text line that the POSIX.2 text utilities
can handle.
Chapter 33: System Configuration Parameters 951
_SC_EQUIV_CLASS_MAX
Inquire about the maximum number of weights that can be assigned to an entry
of the LC_COLLATE category ‘order’ keyword in a locale definition. The GNU
C Library does not presently support locale definitions.
_SC_VERSION
Inquire about the version number of POSIX.1 that the library and kernel sup-
port.
_SC_2_VERSION
Inquire about the version number of POSIX.2 that the system utilities support.
_SC_PAGESIZE
Inquire about the virtual memory page size of the machine. getpagesize
returns the same value (see Section 23.4.2 [How to get information about the
memory subsystem?], page 754).
_SC_NPROCESSORS_CONF
Inquire about the number of configured processors.
_SC_NPROCESSORS_ONLN
Inquire about the number of processors online.
_SC_PHYS_PAGES
Inquire about the number of physical pages in the system.
_SC_AVPHYS_PAGES
Inquire about the number of available physical pages in the system.
_SC_ATEXIT_MAX
Inquire about the number of functions which can be registered as termination
functions for atexit; see Section 26.7.3 [Cleanups on Exit], page 852.
_SC_LEVEL1_ICACHE_SIZE
Inquire about the size of the Level 1 instruction cache.
_SC_LEVEL1_ICACHE_ASSOC
Inquire about the associativity of the Level 1 instruction cache.
_SC_LEVEL1_ICACHE_LINESIZE
Inquire about the line length of the Level 1 instruction cache.
On aarch64, the cache line size returned is the minimum instruction cache line
size observable by userspace. This is typically the same as the L1 icache size but
on some cores it may not be so. However, it is specified in the architecture that
operations such as cache line invalidation are consistent with the size reported
with this variable.
_SC_LEVEL1_DCACHE_SIZE
Inquire about the size of the Level 1 data cache.
_SC_LEVEL1_DCACHE_ASSOC
Inquire about the associativity of the Level 1 data cache.
_SC_LEVEL1_DCACHE_LINESIZE
Inquire about the line length of the Level 1 data cache.
Chapter 33: System Configuration Parameters 952
On aarch64, the cache line size returned is the minimum data cache line size
observable by userspace. This is typically the same as the L1 dcache size but
on some cores it may not be so. However, it is specified in the architecture that
operations such as cache line invalidation are consistent with the size reported
with this variable.
_SC_LEVEL2_CACHE_SIZE
Inquire about the size of the Level 2 cache.
_SC_LEVEL2_CACHE_ASSOC
Inquire about the associativity of the Level 2 cache.
_SC_LEVEL2_CACHE_LINESIZE
Inquire about the line length of the Level 2 cache.
_SC_LEVEL3_CACHE_SIZE
Inquire about the size of the Level 3 cache.
_SC_LEVEL3_CACHE_ASSOC
Inquire about the associativity of the Level 3 cache.
_SC_LEVEL3_CACHE_LINESIZE
Inquire about the line length of the Level 3 cache.
_SC_LEVEL4_CACHE_SIZE
Inquire about the size of the Level 4 cache.
_SC_LEVEL4_CACHE_ASSOC
Inquire about the associativity of the Level 4 cache.
_SC_LEVEL4_CACHE_LINESIZE
Inquire about the line length of the Level 4 cache.
_SC_XOPEN_VERSION
Inquire about the parameter corresponding to _XOPEN_VERSION.
_SC_XOPEN_XCU_VERSION
Inquire about the parameter corresponding to _XOPEN_XCU_VERSION.
_SC_XOPEN_UNIX
Inquire about the parameter corresponding to _XOPEN_UNIX.
_SC_XOPEN_REALTIME
Inquire about the parameter corresponding to _XOPEN_REALTIME.
_SC_XOPEN_REALTIME_THREADS
Inquire about the parameter corresponding to _XOPEN_REALTIME_THREADS.
_SC_XOPEN_LEGACY
Inquire about the parameter corresponding to _XOPEN_LEGACY.
_SC_XOPEN_CRYPT
Inquire about the parameter corresponding to _XOPEN_CRYPT. The GNU
C Libraryno longer implements the _XOPEN_CRYPT extensions, so ‘sysconf
(_SC_XOPEN_CRYPT)’ always returns -1.
Chapter 33: System Configuration Parameters 953
_SC_XOPEN_ENH_I18N
Inquire about the parameter corresponding to _XOPEN_ENH_I18N.
_SC_XOPEN_SHM
Inquire about the parameter corresponding to _XOPEN_SHM.
_SC_XOPEN_XPG2
Inquire about the parameter corresponding to _XOPEN_XPG2.
_SC_XOPEN_XPG3
Inquire about the parameter corresponding to _XOPEN_XPG3.
_SC_XOPEN_XPG4
Inquire about the parameter corresponding to _XOPEN_XPG4.
_SC_CHAR_BIT
Inquire about the number of bits in a variable of type char.
_SC_CHAR_MAX
Inquire about the maximum value which can be stored in a variable of type
char.
_SC_CHAR_MIN
Inquire about the minimum value which can be stored in a variable of type
char.
_SC_INT_MAX
Inquire about the maximum value which can be stored in a variable of type
int.
_SC_INT_MIN
Inquire about the minimum value which can be stored in a variable of type int.
_SC_LONG_BIT
Inquire about the number of bits in a variable of type long int.
_SC_WORD_BIT
Inquire about the number of bits in a variable of a register word.
_SC_MB_LEN_MAX
Inquire about the maximum length of a multi-byte representation of a wide
character value.
_SC_NZERO
Inquire about the value used to internally represent the zero priority level for
the process execution.
_SC_SSIZE_MAX
Inquire about the maximum value which can be stored in a variable of type
ssize_t.
_SC_SCHAR_MAX
Inquire about the maximum value which can be stored in a variable of type
signed char.
Chapter 33: System Configuration Parameters 954
_SC_SCHAR_MIN
Inquire about the minimum value which can be stored in a variable of type
signed char.
_SC_SHRT_MAX
Inquire about the maximum value which can be stored in a variable of type
short int.
_SC_SHRT_MIN
Inquire about the minimum value which can be stored in a variable of type
short int.
_SC_UCHAR_MAX
Inquire about the maximum value which can be stored in a variable of type
unsigned char.
_SC_UINT_MAX
Inquire about the maximum value which can be stored in a variable of type
unsigned int.
_SC_ULONG_MAX
Inquire about the maximum value which can be stored in a variable of type
unsigned long int.
_SC_USHRT_MAX
Inquire about the maximum value which can be stored in a variable of type
unsigned short int.
_SC_NL_ARGMAX
Inquire about the parameter corresponding to NL_ARGMAX.
_SC_NL_LANGMAX
Inquire about the parameter corresponding to NL_LANGMAX.
_SC_NL_MSGMAX
Inquire about the parameter corresponding to NL_MSGMAX.
_SC_NL_NMAX
Inquire about the parameter corresponding to NL_NMAX.
_SC_NL_SETMAX
Inquire about the parameter corresponding to NL_SETMAX.
_SC_NL_TEXTMAX
Inquire about the parameter corresponding to NL_TEXTMAX.
_SC_MINSIGSTKSZ
Inquire about the minimum number of bytes of free stack space required in order
to guarantee successful, non-nested handling of a single signal whose handler is
an empty function.
_SC_SIGSTKSZ
Inquire about the suggested minimum number of bytes of stack space required
for a signal stack.
Chapter 33: System Configuration Parameters 955
This is not guaranteed to be enough for any specific purpose other than the
invocation of a single, non-nested, empty handler, but nonetheless should be
enough for basic scenarios involving simple signal handlers and very low levels
of signal nesting (say, 2 or 3 levels at the very most).
This value is provided for developer convenience and to ease migration from
the legacy SIGSTKSZ constant. Programs requiring stronger guarantees should
avoid using it if at all possible.
_POSIX_AIO_LISTIO_MAX
The most restrictive limit permitted by POSIX for the maximum number of I/O
operations that can be specified in a list I/O call. The value of this constant is
2; thus you can add up to two new entries of the list of outstanding operations.
Chapter 33: System Configuration Parameters 956
_POSIX_AIO_MAX
The most restrictive limit permitted by POSIX for the maximum number of
outstanding asynchronous I/O operations. The value of this constant is 1. So
you cannot expect that you can issue more than one operation and immediately
continue with the normal work, receiving the notifications asynchronously.
_POSIX_ARG_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the maximum combined length of the argv and environ arguments that can be
passed to the exec functions. Its value is 4096.
_POSIX_CHILD_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the maximum number of simultaneous processes per real user ID. Its value is
6.
_POSIX_NGROUPS_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the maximum number of supplementary group IDs per process. Its value is 0.
_POSIX_OPEN_MAX
The value of this macro is the most restrictive limit permitted by POSIX for the
maximum number of files that a single process can have open simultaneously.
Its value is 16.
_POSIX_SSIZE_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the maximum value that can be stored in an object of type ssize_t. Its value
is 32767.
_POSIX_STREAM_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the maximum number of streams that a single process can have open simulta-
neously. Its value is 8.
_POSIX_TZNAME_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the maximum length of a time zone abbreviation. Its value is 3.
_POSIX2_RE_DUP_MAX
The value of this macro is the most restrictive limit permitted by POSIX for
the numbers used in the ‘\{min,max\}’ construct in a regular expression. Its
value is 255.
Each of the following macros is defined in limits.h only if the system has a fixed,
uniform limit for the parameter in question. If the system allows different file systems or
files to have different limits, then the macro is undefined; use pathconf or fpathconf to find
out the limit that applies to a particular file. See Section 33.9 [Using pathconf], page 959.
Each parameter also has another macro, with a name starting with ‘_POSIX’, which gives
the lowest value that the limit is allowed to have on any POSIX system. See Section 33.8
[Minimum Values for File System Limits], page 958.
int LINK_MAX [Macro]
The uniform system limit (if any) for the number of names for a given file. See
Section 14.4 [Hard Links], page 427.
int MAX_CANON [Macro]
The uniform system limit (if any) for the amount of text in a line of input when
input editing is enabled. See Section 17.3 [Two Styles of Input: Canonical or Not],
page 514.
int MAX_INPUT [Macro]
The uniform system limit (if any) for the total number of characters typed ahead as
input. See Section 17.2 [I/O Queues], page 514.
int NAME_MAX [Macro]
The uniform system limit (if any) for the length of a file name component, not in-
cluding the terminating null character.
Portability Note: On some systems, the GNU C Library defines NAME_MAX, but does
not actually enforce this limit.
int PATH_MAX [Macro]
The uniform system limit (if any) for the length of an entire file name (that is, the
argument given to system calls such as open), including the terminating null character.
Portability Note: The GNU C Library does not enforce this limit even if PATH_MAX
is defined.
int PIPE_BUF [Macro]
The uniform system limit (if any) for the number of bytes that can be written atom-
ically to a pipe. If multiple processes are writing to the same pipe simultaneously,
output from different processes might be interleaved in chunks of this size. See Chap-
ter 15 [Pipes and FIFOs], page 459.
These are alternative macro names for some of the same information.
int MAXNAMLEN [Macro]
This is the BSD name for NAME_MAX. It is defined in dirent.h.
int FILENAME_MAX [Macro]
The value of this macro is an integer constant expression that represents the maximum
length of a file name string. It is defined in stdio.h.
Unlike PATH_MAX, this macro is defined even if there is no actual limit imposed. In
such a case, its value is typically a very large number. This is always the case on
GNU/Hurd systems.
Chapter 33: System Configuration Parameters 958
Usage Note: Don’t use FILENAME_MAX as the size of an array in which to store a
file name! You can’t possibly make an array that big! Use dynamic allocation (see
Section 3.2 [Allocating Storage For Program Data], page 45) instead.
If one of these macros is undefined, that means that the option might be in effect for
some files and not for others. To inquire about a particular file, call pathconf or fpathconf.
See Section 33.9 [Using pathconf], page 959.
_POSIX_LINK_MAX
The most restrictive limit permitted by POSIX for the maximum value of a
file’s link count. The value of this constant is 8; thus, you can always make up
to eight names for a file without running into a system limit.
_POSIX_MAX_CANON
The most restrictive limit permitted by POSIX for the maximum number of
bytes in a canonical input line from a terminal device. The value of this constant
is 255.
_POSIX_MAX_INPUT
The most restrictive limit permitted by POSIX for the maximum number of
bytes in a terminal device input queue (or typeahead buffer). See Section 17.4.4
[Input Modes], page 518. The value of this constant is 255.
_POSIX_NAME_MAX
The most restrictive limit permitted by POSIX for the maximum number of
bytes in a file name component. The value of this constant is 14.
_POSIX_PATH_MAX
The most restrictive limit permitted by POSIX for the maximum number of
bytes in a file name. The value of this constant is 256.
_POSIX_PIPE_BUF
The most restrictive limit permitted by POSIX for the maximum number of
bytes that can be written atomically to a pipe. The value of this constant is
512.
SYMLINK_MAX
Maximum number of bytes in a symbolic link.
POSIX_REC_INCR_XFER_SIZE
Recommended increment for file transfer sizes between the POSIX_REC_MIN_
XFER_SIZE and POSIX_REC_MAX_XFER_SIZE values.
POSIX_REC_MAX_XFER_SIZE
Maximum recommended file transfer size.
POSIX_REC_MIN_XFER_SIZE
Minimum recommended file transfer size.
POSIX_REC_XFER_ALIGN
Recommended file transfer buffer alignment.
Here are the symbolic constants that you can use as the parameter argument to pathconf
and fpathconf. The values are all integer constants.
_PC_LINK_MAX
Inquire about the value of LINK_MAX.
_PC_MAX_CANON
Inquire about the value of MAX_CANON.
_PC_MAX_INPUT
Inquire about the value of MAX_INPUT.
_PC_NAME_MAX
Inquire about the value of NAME_MAX.
_PC_PATH_MAX
Inquire about the value of PATH_MAX.
_PC_PIPE_BUF
Inquire about the value of PIPE_BUF.
_PC_CHOWN_RESTRICTED
Inquire about the value of _POSIX_CHOWN_RESTRICTED.
Chapter 33: System Configuration Parameters 961
_PC_NO_TRUNC
Inquire about the value of _POSIX_NO_TRUNC.
_PC_VDISABLE
Inquire about the value of _POSIX_VDISABLE.
_PC_SYNC_IO
Inquire about the value of _POSIX_SYNC_IO.
_PC_ASYNC_IO
Inquire about the value of _POSIX_ASYNC_IO.
_PC_PRIO_IO
Inquire about the value of _POSIX_PRIO_IO.
_PC_FILESIZEBITS
Inquire about the availability of large files on the filesystem.
_PC_REC_INCR_XFER_SIZE
Inquire about the value of POSIX_REC_INCR_XFER_SIZE.
_PC_REC_MAX_XFER_SIZE
Inquire about the value of POSIX_REC_MAX_XFER_SIZE.
_PC_REC_MIN_XFER_SIZE
Inquire about the value of POSIX_REC_MIN_XFER_SIZE.
_PC_REC_XFER_ALIGN
Inquire about the value of POSIX_REC_XFER_ALIGN.
Portability Note: On some systems, the GNU C Library does not enforce _PC_NAME_MAX
or _PC_PATH_MAX limits.
_POSIX2_EQUIV_CLASS_MAX
The most restrictive limit permitted by POSIX.2 for the maximum number of
weights that can be assigned to an entry of the LC_COLLATE category ‘order’
keyword in a locale definition. Its value is 2. The GNU C Library does not
presently support locale definitions.
Currently there is just one parameter you can read with confstr:
_CS_PATH This parameter’s value is the recommended default path for searching for
executable files. This is the path that a user has by default just after logging
in.
_CS_LFS_CFLAGS
The returned string specifies which additional flags must be given to the C
compiler if a source is compiled using the _LARGEFILE_SOURCE feature select
macro; see Section 1.3.4 [Feature Test Macros], page 16.
_CS_LFS_LDFLAGS
The returned string specifies which additional flags must be given to the linker
if a source is compiled using the _LARGEFILE_SOURCE feature select macro; see
Section 1.3.4 [Feature Test Macros], page 16.
_CS_LFS_LIBS
The returned string specifies which additional libraries must be linked to the
application if a source is compiled using the _LARGEFILE_SOURCE feature select
macro; see Section 1.3.4 [Feature Test Macros], page 16.
Chapter 33: System Configuration Parameters 964
_CS_LFS_LINTFLAGS
The returned string specifies which additional flags must be given to the lint
tool if a source is compiled using the _LARGEFILE_SOURCE feature select macro;
see Section 1.3.4 [Feature Test Macros], page 16.
_CS_LFS64_CFLAGS
The returned string specifies which additional flags must be given to the C
compiler if a source is compiled using the _LARGEFILE64_SOURCE feature select
macro; see Section 1.3.4 [Feature Test Macros], page 16.
_CS_LFS64_LDFLAGS
The returned string specifies which additional flags must be given to the linker
if a source is compiled using the _LARGEFILE64_SOURCE feature select macro;
see Section 1.3.4 [Feature Test Macros], page 16.
_CS_LFS64_LIBS
The returned string specifies which additional libraries must be linked to the
application if a source is compiled using the _LARGEFILE64_SOURCE feature
select macro; see Section 1.3.4 [Feature Test Macros], page 16.
_CS_LFS64_LINTFLAGS
The returned string specifies which additional flags must be given to the lint tool
if a source is compiled using the _LARGEFILE64_SOURCE feature select macro;
see Section 1.3.4 [Feature Test Macros], page 16.
The way to use confstr without any arbitrary limit on string size is to call it twice:
first call it to get the length, allocate the buffer accordingly, and then call confstr again
to fill the buffer, like this:
char *
get_default_path (void)
{
size_t len = confstr (_CS_PATH, NULL, 0);
char *buffer = (char *) xmalloc (len);
return buffer;
}
965
34 Cryptographic Functions
The GNU C Library includes only one type of special-purpose cryptographic functions; these
allow use of a source of cryptographically strong pseudorandom numbers, if such a source
is provided by the operating system. Programs that need general-purpose cryptography
should use a dedicated cryptography library, such as libgcrypt.
35 Debugging support
Applications are usually debugged using dedicated debugger programs. But sometimes
this is not possible and, in any case, it is useful to provide the developer with as much
information as possible at the time the problems are experienced. For this reason a few
functions are provided which a program can use to help the developer more easily locate
the problem.
35.1 Backtraces
A backtrace is a list of the function calls that are currently active in a thread. The usual way
to inspect a backtrace of a program is to use an external debugger such as gdb. However,
sometimes it is useful to obtain a backtrace programmatically from within a program, e.g.,
for the purposes of logging or diagnostics.
The header file execinfo.h declares three functions that obtain and manipulate back-
traces of the current thread.
int backtrace (void **buffer, int size) [Function]
Preliminary: | MT-Safe | AS-Unsafe init heap dlopen plugin lock | AC-Unsafe init
mem lock fd | See Section 1.2.2.1 [POSIX Safety Concepts], page 2.
The backtrace function obtains a backtrace for the current thread, as a list of point-
ers, and places the information into buffer. The argument size should be the number
of void * elements that will fit into buffer. The return value is the actual number of
entries of buffer that are obtained, and is at most size.
The pointers placed in buffer are actually return addresses obtained by inspecting
the stack, one return address per stack frame.
Note that certain compiler optimizations may interfere with obtaining a valid back-
trace. Function inlining causes the inlined function to not have a stack frame; tail
call optimization replaces one stack frame with another; frame pointer elimination
will stop backtrace from interpreting the stack contents correctly.
char ** backtrace_symbols (void *const *buffer, int size) [Function]
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem lock | See Sec-
tion 1.2.2.1 [POSIX Safety Concepts], page 2.
The backtrace_symbols function translates the information obtained from the
backtrace function into an array of strings. The argument buffer should be a
pointer to an array of addresses obtained via the backtrace function, and size is the
number of entries in that array (the return value of backtrace).
The return value is a pointer to an array of strings, which has size entries just like
the array buffer. Each string contains a printable representation of the corresponding
element of buffer. It includes the function name (if this can be determined), an offset
into the function, and the actual return address (in hexadecimal).
Currently, the function name and offset can only be obtained on systems that use the
ELF binary format for programs and libraries. On other systems, only the hexadec-
imal return address will be present. Also, you may need to pass additional flags to
the linker to make the function names available to the program. (For example, on
systems using GNU ld, you must pass -rdynamic.)
Chapter 35: Debugging support 968
The return value of backtrace_symbols is a pointer obtained via the malloc function,
and it is the responsibility of the caller to free that pointer. Note that only the return
value need be freed, not the individual strings.
The return value is NULL if sufficient memory for the strings cannot be obtained.
void backtrace_symbols_fd (void *const *buffer, int size, [Function]
int fd)
Preliminary: | MT-Safe | AS-Safe | AC-Unsafe lock | See Section 1.2.2.1 [POSIX
Safety Concepts], page 2.
The backtrace_symbols_fd function performs the same translation as the function
backtrace_symbols function. Instead of returning the strings to the caller, it writes
the strings to the file descriptor fd, one per line. It does not use the malloc function,
and can therefore be used in situations where that function might fail.
The following program illustrates the use of these functions. Note that the array to
contain the return addresses returned by backtrace is allocated on the stack. Therefore
code like this can be used in situations where the memory handling via malloc does not
work anymore (in which case the backtrace_symbols has to be replaced by a backtrace_
symbols_fd call as well). The number of return addresses is normally not very large. Even
complicated programs rather seldom have a nesting level of more than, say, 50 and with
200 possible entries probably all programs should be covered.
#include <execinfo.h>
#include <stdio.h>
#include <stdlib.h>
free (strings);
}
int
main (void)
{
dummy_function ();
return 0;
}
970
36 Threads
This chapter describes functions used for managing threads. The GNU C Library provides
two threading implementations: ISO C threads and POSIX threads.
thrd_create creates a new thread that will execute the function func. The object
pointed to by arg will be used as the argument to func. If successful, thr is set to the
new thread identifier.
This function may return thrd_success, thrd_nomem, or thrd_error.
ONCE_FLAG_INIT [Macro]
This value is used to initialize an object of type once_flag.
36.1.4 Mutexes
To have better control of resources and how threads access them, the GNU C Library
implements a mutex object, which can help avoid race conditions and other concurrency
issues. The term “mutex” refers to mutual exclusion.
The fundamental data type for a mutex is the mtx_t:
Chapter 36: Threads 973
The ISO C standard defines several types of mutexes. They are represented by the
following symbolic constants:
mtx_plain
A mutex that does not support timeout, or test and return.
mtx_recursive
A mutex that supports recursive locking, which means that the owning thread
can lock it more than once without causing deadlock.
mtx_timed
A mutex that supports timeout.
The following functions are used for working with mutexes:
cnd_broadcast, or until the calendar time pointed to by time point has been reached.
The mutex is locked again before the function returns.
As for mtx_timedlock, since this function takes an absolute time, if a duration is
required, the calendar time must be calculated manually. See Section 22.1 [Time
Basics], page 696, and Section 22.5 [Calendar Time], page 701.
This function may return thrd_success, thrd_nomem, or thrd_error.
void cnd_destroy (cnd_t *cond) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
cnd_destroy destroys the condition variable pointed to by cond. If there are threads
waiting on cond, the behavior is undefined.
If destructor is not NULL, a destructor function will be set, and called when the
thread finishes its execution by calling thrd_exit.
This function returns thrd_success if tss_key is successfully set to a unique value for
the thread; otherwise, thrd_error is returned and the value of tss_key is undefined.
int tss_set (tss_t tss_key, void *val) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
tss_set sets the value of the thread-specific storage identified by tss key for the
current thread to val. Different threads may set different values to the same key.
This function returns either thrd_success or thrd_error.
void * tss_get (tss_t tss_key) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
tss_get returns the value identified by tss key held in thread-specific storage for the
current thread. Different threads may get different values identified by the same key.
On failure, tss_get returns zero.
void tss_delete (tss_t tss_key) [Function]
Preliminary: | MT-Safe | AS-Safe | AC-Safe | See Section 1.2.2.1 [POSIX Safety
Concepts], page 2.
tss_delete destroys the thread-specific storage identified by tss key.
attr will no longer specify an explicit signal mask, so that the initial signal mask of
the new thread is inherited from the thread that calls pthread_create.
This function returns zero on success, and ENOMEM on memory allocation failure.
int pthread_attr_getsigmask_np (const pthread_attr_t [Function]
*attr, sigset_t *sigmask)
Preliminary: | MT-Safe | AS-Unsafe heap | AC-Unsafe mem | See Section 1.2.2.1
[POSIX Safety Concepts], page 2.
Retrieve the signal mask stored in attr and copy it to *sigmask. If the signal mask has
not been set, return the special constant PTHREAD_ATTR_NO_SIGMASK_NP, otherwise
return zero.
Obtaining the signal mask only works if it has been previously stored by pthread_
attr_setsigmask_np. For example, the pthread_getattr_np function does not ob-
tain the current signal mask of the specified thread, and pthread_attr_getsigmask_
np will subsequently report the signal mask as unset.
int PTHREAD_ATTR_NO_SIGMASK_NP [Macro]
The special value returned by pthread_attr_setsigmask_np to indicate that no
signal mask has been set for the attribute.
It is possible to create a new thread with a specific signal mask without using these
functions. On the thread that calls pthread_create, the required steps for the general case
are:
1. Mask all signals, and save the old signal mask, using pthread_sigmask. This ensures
that the new thread will be created with all signals masked, so that no signals can be
delivered to the thread until the desired signal mask is set.
2. Call pthread_create to create the new thread, passing the desired signal mask to the
thread start routine (which could be a wrapper function for the actual thread start
routine). It may be necessary to make a copy of the desired signal mask on the heap,
so that the life-time of the copy extends to the point when the start routine needs to
access the signal mask.
3. Restore the thread’s signal mask, to the set that was saved in the first step.
The start routine for the created thread needs to locate the desired signal mask and
use pthread_sigmask to apply it to the thread. If the signal mask was copied to a heap
allocation, the copy should be freed.
if (single_threaded)
cleanup_single_threaded ();
else
cleanup_multi_thread ();
Since the value of __libc_single_threaded can change from true to false during the
execution of the program, it is not useful for selecting optimized function implementations
in IFUNC resolvers.
Atomic operations can also be used on mappings shared among single-threaded processes.
This means that a compiler must not use __libc_single_threaded to optimize atomic
operations, unless it is able to prove that the memory is not shared.
Implementation Note: The __libc_single_threaded variable is not declared as
volatile because it is expected that compilers optimize a sequence of single-threaded
checks into one check, for example if several reference counts are updated. The current
implementation in the GNU C Library does not set the __libc_single_threaded variable
to a true value if a process turns single-threaded again. Future versions of the GNU
C Library may do this, but only as the result of function calls which imply an acquire
(compiler) barrier. (Some compilers assume that well-known functions such as malloc
do not write to global variables, and setting __libc_single_threaded would introduce
a data race and undefined behavior.) In any case, an application must not write to
__libc_single_threaded even if it has joined the last application-created thread because
future versions of the GNU C Library may create background threads after the first
thread has been created, and the application has no way of knowing that these threads are
present.
special action must be taken. Else, before that memory is re-used of freed, the appli-
cation is responsible for setting the rseq_cs field to NULL in each thread’s restartable
sequence area to guarantee that it does not leak dangling references. Because the ap-
plication does not typically have knowledge of libraries’ use of restartable sequences,
it is recommended that libraries using restartable sequences which may end up freeing
or re-using their memory set the rseq_cs field to NULL before returning from library
functions which use restartable sequences.
The manual for the rseq system call can be found at https://git.kernel.org/
pub/scm/libs/librseq/librseq.git/tree/doc/man/rseq.2.
37 Dynamic Linker
The dynamic linker is responsible for loading dynamically linked programs and their de-
pendencies (in the form of shared objects). The dynamic linker in the GNU C Library also
supports loading shared objects (such as plugins) later at run time.
Dynamic linkers are sometimes called dynamic loaders.
path.system_dirs[0x0]="/lib64/"
path.system_dirs[0x1]="/usr/lib64/"
The built-in dynamic linker search path contains two directories, /lib64 and
/usr/lib64.
dl_platform=string
The $PLATFORM dynamic string token expands to string.
dso.libc=string
This is the soname of the shared libc object that is part of the GNU C Library.
On most architectures, this is libc.so.6.
env[index]=string
env_filtered[index]=string
An environment variable from the process environment. The integer index is
the array index in the environment array. Variables under env include the
variable value after the ‘=’ (assuming that it was present), variables under env_
filtered do not.
path.prefix=string
This indicates that the GNU C Library was configured using
‘--prefix=string’.
path.sysconfdir=string
The GNU C Library was configured (perhaps implicitly) with
‘--sysconfdir=string’ (typically /etc).
path.system_dirs[index]=string
These items list the elements of the built-in array that describes the default
library search path. The value string is a directory file name with a trailing ‘/’.
path.rtld=string
This string indicates the application binary interface (ABI) file name of the
run-time dynamic linker.
version.release="stable"
version.release="development"
The value "stable" indicates that this build of the GNU C Library is from a
release branch. Releases labeled as "development" are unreleased development
versions.
version.version="major.minor"
version.version="major.minor.9000"
The GNU C Library version. Development releases end in ‘.9000’.
auxv[index].a_type=type
auxv[index].a_val=integer
auxv[index].a_val_string=string
An entry in the auxiliary vector (specific to Linux). The values type (an integer)
and integer correspond to the members of struct auxv. If the value is a string,
a_val_string is used instead of a_val, so that values have consistent types.
The AT_HWCAP and AT_HWCAP2 values in this output do not reflect adjustment
by the GNU C Library.
Chapter 37: Dynamic Linker 987
uname.sysname=string
uname.nodename=string
uname.release=string
uname.version=string
uname.machine=string
uname.domain=string
These Linux-specific items show the values of struct utsname, as reported by
the uname function. See Section 32.2 [Platform Type Identification], page 930.
aarch64.cpu_features....
These items are specific to the AArch64 architectures. They report data the
GNU C Library uses to activate conditionally supported features such as BTI
and MTE, and to select alternative function implementations.
aarch64.processor[index]....
These are additional items for the AArch64 architecture and are described be-
low.
aarch64.processor[index].requested=kernel-cpu
The kernel is told to run the subsequent probing on the CPU numbered kernel-
cpu. The values kernel-cpu and index can be distinct if there are gaps in the
process CPU affinity mask. This line is not included if CPU affinity mask
information is not available.
aarch64.processor[index].observed=kernel-cpu
This line reports the kernel CPU number kernel-cpu on which the probing code
initially ran. If the CPU number cannot be obtained, this line is not printed.
aarch64.processor[index].observed_node=node
This reports the observed NUMA node number, as reported by the getcpu
system call. If this information cannot be obtained, this line is not printed.
aarch64.processor[index].midr_el1=value
The value of the midr_el1 system register on the processor index. This line is
only printed if the kernel indicates that this system register is supported.
aarch64.processor[index].dczid_el0=value
The value of the dczid_el0 system register on the processor index.
x86.cpu_features....
These items are specific to the i386 and x86-64 architectures. They reflect
supported CPU features and information on cache geometry, mostly collected
using the CPUID instruction.
x86.processor[index]....
These are additional items for the i386 and x86-64 architectures, as described
below. They mostly contain raw data from the CPUID instruction. The probes
are performed for each active CPU for the ld.so process, and data for different
probed CPUs receives a uniqe index value. Some CPUID data is expected to
differ from CPU core to CPU core. In some cases, CPUs are not correctly
initialized and indicate the presence of different feature sets.
Chapter 37: Dynamic Linker 988
x86.processor[index].requested=kernel-cpu
The kernel is told to run the subsequent probing on the CPU numbered kernel-
cpu. The values kernel-cpu and index can be distinct if there are gaps in the
process CPU affinity mask. This line is not included if CPU affinity mask
information is not available.
x86.processor[index].observed=kernel-cpu
This line reports the kernel CPU number kernel-cpu on which the probing code
initially ran. If the CPU number cannot be obtained, this line is not printed.
x86.processor[index].observed_node=node
This reports the observed NUMA node number, as reported by the getcpu
system call. If this information cannot be obtained, this line is not printed.
x86.processor[index].cpuid_leaves=count
This line indicates that count distinct CPUID leaves were encountered. (This
reflects internal ld.so storage space, it does not directly correspond to CPUID
enumeration ranges.)
x86.processor[index].ecx_limit=value
The CPUID data extraction code uses a brute-force approach to enumerate
subleaves (see the ‘.subleaf_eax’ lines below). The last %rcx value used in a
CPUID query on this probed CPU was value.
x86.processor[index].cpuid.eax[query_eax].eax=eax
x86.processor[index].cpuid.eax[query_eax].ebx=ebx
x86.processor[index].cpuid.eax[query_eax].ecx=ecx
x86.processor[index].cpuid.eax[query_eax].edx=edx
These lines report the register contents after executing the CPUID instruction
with ‘%rax == query_eax’ and ‘%rcx == 0’ (a leaf ). For the first probed CPU
(with a zero index), only leaves with non-zero register contents are reported. For
subsequent CPUs, only leaves whose register contents differs from the previously
probed CPUs (with index one less) are reported.
Basic and extended leaves are reported using the same syntax. This means
there is a large jump in query eax for the first reported extended leaf.
x86.processor[index].cpuid.subleaf_eax[query_eax].ecx[query_ecx].eax=eax
x86.processor[index].cpuid.subleaf_eax[query_eax].ecx[query_ecx].ebx=ebx
x86.processor[index].cpuid.subleaf_eax[query_eax].ecx[query_ecx].ecx=ecx
x86.processor[index].cpuid.subleaf_eax[query_eax].ecx[query_ecx].edx=edx
This is similar to the leaves above, but for a subleaf. For subleaves, the CPUID
instruction is executed with ‘%rax == query_eax’ and ‘%rcx == query_ecx’, so
the result depends on both register values. The same rules about filtering zero
and identical results apply.
x86.processor[index].cpuid.subleaf_eax[query_eax].ecx[query_ecx].until_
ecx=ecx_limit
Some CPUID results are the same regardless the query ecx value. If this situ-
ation is detected, a line with the ‘.until_ecx’ selector ins included, and this
indicates that the CPUID register contents is the same for %rcx values between
query ecx and ecx limit (inclusive).
Chapter 37: Dynamic Linker 989
x86.processor[index].cpuid.subleaf_eax[query_eax].ecx[query_ecx].ecx_query_
mask=0xff
This line indicates that in an ‘.until_ecx’ range, the CPUID instruction pre-
served the lowested 8 bits of the input %rcx in the output %rcx registers. Oth-
erwise, the subleaves in the range have identical values. This special treatment
is necessary to report compact range information in case such copying occurs
(because the subleaves would otherwise be all different).
x86.processor[index].xgetbv.ecx[query_ecx]=result
This line shows the 64-bit result value in the %rdx:%rax register pair after
executing the XGETBV instruction with %rcx set to query ecx. Zero values
and values matching the previously probed CPU are omitted. Nothing is printed
if the system does not support the XGETBV instruction.
and dls_cnt members of the Dl_serinfo object. The caller should then
allocate memory to store at least dls_size bytes and pass that buffer to
a RTLD_DI_SERINFO request. This second request fills the dls_serpath
array. The number of array elements was returned in the dls_cnt mem-
ber in the initial RTLD_DI_SERINFOSIZE request. The caller is responsible
for freeing the allocated buffer.
This interface is prone to buffer overflows in multi-threaded processes
because the required size can change between the RTLD_DI_SERINFOSIZE
and RTLD_DI_SERINFO requests.
RTLD_DI_TLS_DATA
This request writes the address of the TLS block (in the current thread)
for the shared object identified by handle to *arg. The argument arg
must be the address of an object of type void *. A null pointer is written
if the object does not have any associated TLS block.
RTLD_DI_TLS_MODID
This request writes the TLS module ID for the shared object handle to
*arg. The argument arg must be the address of an object of type size_
t. The module ID is zero if the object does not have an associated TLS
block.
RTLD_DI_PHDR
This request writes the address of the program header array to *arg. The
argument arg must be the address of an object of type const ElfW(Phdr)
* (that is, const Elf32_Phdr * or const Elf64_Phdr *, as appropriate
for the current architecture). For this request, the value returned by
dlinfo is the number of program headers in the program header array.
The dlinfo function is a GNU extension.
The remainder of this section documents the _dl_find_object function and supporting
types and constants.
void *dlfo_eh_frame
This member contains a pointer to the exception handling data of the
object. See DLFO_EH_SEGMENT_TYPE below.
This structure is a GNU extension.
• Make dependencies on shared objects explicit. Do not assume that certain libraries
(such as libc.so.6) are always loaded. Specifically, if a main program or shared ob-
ject references a symbol, create an ELF DT_NEEDED dependency on that shared object,
or on another shared object that is documented (or otherwise guaranteed) to have
the required explicit dependency. Referencing a symbol without a matching link de-
pendency results in underlinking, and underlinked objects cannot always be loaded
correctly: Initialization of objects may not happen in the required order.
• Do not create dependency loops between shared objects (libA.so.1 depending on
libB.so.1 depending on libC.so.1 depending on libA.so.1). The GNU C Library
has to initialize one of the objects in the cycle first, and the choice of that object is
arbitrary and can change over time. The object which is initialized first (and other
objects involved in the cycle) may not run correctly because not all of its dependencies
have been initialized.
Underlinking (see above) can hide the presence of cycles.
• Limit the creation of indirect function (IFUNC) resolvers. These resolvers run during
relocation processing, when the GNU C Library is not in a fully consistent state. If you
write your own IFUNC resolvers, do not depend on external data or function references
in those resolvers.
• Do not use the audit functionality (LD_AUDIT, DT_AUDIT, DT_DEPAUDIT). Its callback
and hooking capabilities introduce a lot of complexity and subtly alter dynamic linker
behavior in corner cases even if the audit module is inactive.
• Do not use symbol interposition. Without symbol interposition, the exact order in
which shared objects are searched are less relevant.
Exceptions to this rule are copy relocations (see the next item), and vague linkage, as
used by the C++ implementation (see below).
• One potential source of symbol interposition is a combination of static and dynamic
linking, namely linking a static archive into multiple dynamic shared objects. For such
scenarios, the static library should be converted into its own dynamic shared object.
A different approach to this situation uses hidden visibility for symbols in the static
library, but this can cause problems if the library does not expect that multiple copies
of its code coexist within the same process, with no or partial sharing of state.
• If you use shared objects that are linked with -Wl,-Bsymbolic (or equivalent) or use
protected visibility, the code for the main program must be built as -fpic or -fPIC to
avoid creating copy relocations (and the main program must not use copy relocations
for other reasons). Using -fpie or -fPIE is not an alternative to PIC code in this
context.
• Be careful about explicit section annotations. Make sure that the target section matches
the properties of the declared entity (e.g., no writable objects in .text).
• Ensure that all assembler or object input files have the recommended security markup,
particularly for non-executable stack.
• Avoid using non-default linker flags and features. In particular, do not use the DT_
PREINIT_ARRAY dynamic tag, and do not flag objects as DF_1_INITFIRST. Do not
change the default linker script of BFD ld. Do not override ABI defaults, such as the
dynamic linker path (with --dynamic-linker).
Chapter 37: Dynamic Linker 994
• Some features of the GNU C Library indirectly depend on run-time code loading and
dlopen. Use iconv_open with built-in converters only (such as UTF-8). Do not use
NSS functionality such as getaddrinfo or getpwuid_r unless the system is configured
for built-in NSS service modules only (see below).
Several considerations apply to ELF constructors and destructors.
• The dynamic linker does not take constructor and destructor priorities into account
when determining their execution order. Priorities are only used by the link editor
for ordering execution within a completely linked object. If a dynamic shared object
needs to be initialized before another object, this can be expressed with a DT_NEEDED
dependency on the object that needs to be initialized earlier.
• The recommendations to avoid cyclic dependencies and symbol interposition make
it less likely that ELF objects are accessed before their ELF constructors have run.
However, using dlsym and dlvsym, it is still possible to access uninitialized facilities
even with these restrictions in place. (Of course, access to uninitialized functionality
is also possible within a single shared object or the main executable, without resorting
to explicit symbol lookup.) Consider using dynamic, on-demand initialization instead.
To deal with access after de-initialization, it may be necessary to implement special
cases for that scenario, potentially with degraded functionality.
• Be aware that when ELF destructors are executed, it is possible to reference already-
deconstructed shared objects. This can happen even in the absence of dlsym and
dlvsym function calls, for example if client code using a shared object has registered
callbacks or objects with another shared object. The ELF destructor for the client code
is executed before the ELF destructor for the shared objects that it uses, based on the
expected dependency order.
• If dlopen and dlmopen are not used, DT_NEEDED dependency information is complete,
and lazy binding is disabled, the execution order of ELF destructors is expected to
be the reverse of the ELF constructor order. However, two separate dependency sort
operations still occur. Even though the listed preconditions should ensure that both
sorts produce the same ordering, it is recommended not to depend on the destructor
order being the reverse of the constructor order.
The following items provide C++-specific guidance for preparing applications. If another
programming language is used and it uses these toolchain features targeted at C++ to
implement some language constructs, these restrictions and recommendations still apply in
analogous ways.
• C++ inline functions, templates, and other constructs may need to be duplicated into
multiple shared objects using vague linkage, resulting in symbol interposition. This type
of symbol interposition is unproblematic, as long as the C++ one definition rule (ODR)
is followed, and all definitions in different translation units are equivalent according to
the language C++ rules.
• Be aware that under C++ language rules, it is unspecified whether evaluating a string
literal results in the same address for each evaluation. This also applies to anonymous
objects of static storage duration that GCC creates, for example to implement the
compound literals C++ extension. As a result, comparing pointers to such objects, or
using them directly as hash table keys, may give unexpected results.
Chapter 37: Dynamic Linker 995
By default, variables of block scope of static storage have consistent addresses across
different translation units, even if defined in functions that use vague linkage.
• Special care is needed if a C++ project uses symbol visibility or symbol version manage-
ment (for example, the GCC ‘visibility’ attribute, the GCC -fvisibility option,
or a linker version script with the linker option --version-script). It is necessary
to ensure that the symbol management remains consistent with how the symbols are
used. Some C++ constructs are implemented with the help of ancillary symbols, which
can make complicated to achieve consistency. For example, an inline function that is
always inlined into its callers has no symbol footprint for the function itself, but if the
function contains a variable of static storage duration, this variable may result in the
creation of one or more global symbols. For correctness, such symbols must be visible
and bound to the same object in all other places where the inline function may be
called. This requirement is not met if the symbol visibility is set to hidden, or if sym-
bols are assigned a textually different symbol version (effectively creating two distinct
symbols).
Due to the complex interaction between ELF symbol management and C++ symbol
generation, it is recommended to use C++ language features for symbol management,
in particular inline namespaces.
• The toolchain and dynamic linker have multiple mechanisms that bypass the usual
symbol binding procedures. This means that the C++ one definition rule (ODR) still
holds even if certain symbol-based isolation mechanisms are used, and object addresses
are not shared across translation units with incompatible type definitions.
This does not matter if the original (language-independent) advice regarding symbol
interposition is followed. However, as the advice may be difficult to implement for
C++ applications, it is recommended to avoid ODR violations across the entire process
image. Inline namespaces can be helpful in this context because they can be used to
create distinct ELF symbols while maintaining source code compatibility at the C++
level.
• Be aware that as a special case of interposed symbols, symbols with the STB_GNU_
UNIQUE binding type do not follow the usual ELF symbol namespace isolation rules:
such symbols bind across RTLD_LOCAL boundaries. Furthermore, symbol versioning is
ignored for such symbols; they are bound by symbol name only. All their definitions
and uses must therefore be compatible. Hidden visibility still prevents the creation of
STB_GNU_UNIQUE symbols and can achieve isolation of incompatible definitions.
• C++ constructor priorities only affect constructor ordering within one shared object.
Global constructor order across shared objects is consistent with ELF dependency
ordering if there are no ELF dependency cycles.
• C++ exception handling and run-time type information (RTTI), as implemented in the
GNU toolchain, is not address-significant, and therefore is not affected by the symbol
binding behaviour of the dynamic linker. This means that types of the same fully-
qualified name (in non-anonymous namespaces) are always considered the same from
an exception-handling or RTTI perspective. This is true even if the type informa-
tion object or vtable has hidden symbol visibility, or the corresponding symbols are
versioned under different symbol versions, or the symbols are not bound to the same
objects due to the use of RTLD_LOCAL or dlmopen.
Chapter 37: Dynamic Linker 996
This can cause issues in applications that contain multiple incompatible definitions of
the same type. Inline namespaces can be used to create distinct symbols at the ELF
layer, avoiding this type of issue.
• C++ exception handling across multiple dlmopen namespaces may not work, particular
with the unwinder in GCC versions before 12. Current toolchain versions are able to
process unwinding tables across dlmopen boundaries. However, note that type compar-
ison is name-based, not address-based (see the previous item), so exception types may
still be matched in unexpected ways. An important special case of exception handling,
invoking destructors for variables of block scope, is not impacted by this RTTI type-
sharing. Likewise, regular virtual member function dispatch for objects is unaffected
(but still requires that the type definitions match in all directly involved translation
units).
Once more, inline namespaces can be used to create distinct ELF symbols for different
types.
• Although the C++ standard requires that destructors for global objects run in the op-
posite order of their constructors, the Itanium C++ ABI requires a different destruction
order in some cases. As a result, do not depend on the precise destructor invocation
order in applications that use dlclose.
• Registering destructors for later invocation allocates memory and may silently fail if
insufficient memory is available. As a result, the destructor is never invoked. This
applies to all forms of destructor registration, with the exception of thread-local vari-
ables (see the next item). To avoid this issue, ensure that such objects merely have
trivial destructors, avoiding the need for registration, and deallocate resources using a
different mechanism (for example, from an ELF destructor).
• A similar issue exists for thread_local variables with thread storage duration of types
that have non-trivial destructors. However, in this case, memory allocation failure dur-
ing registration leads to process termination. If process termination is not acceptable,
use thread_local variables with trivial destructors only. Functions for per-thread
cleanup can be registered using pthread_key_create (globally for all threads) and
activated using pthread_setspecific (on each thread). Note that a pthread_key_
create call may still fail (and pthread_create keys are a limited resource in the GNU
C Library), but this failure can be handled without terminating the process.
• Specify all direct shared objects dependencies using -l options to avoid underlinking.
Rely on .so files (which can be linker scripts) and searching with the -l option. Do
not specify the file names of shared objects on the linker command line.
• Consider using -Wl,-z,defs to treat underlinking as an error condition.
• When creating a shared object (linked with -shared), use -Wl,-soname,lib... to set
a soname that matches the final installed name of the file.
• Do not use the -rpath linker option. (As explained below, all required shared objects
should be installed into the default search path.)
• Use -Wl,--error-rwx-segments and -Wl,--error-execstack to instruct the link
editor to fail the link if the resulting final object would have read-write-execute segments
or an executable stack. Such issues usually indicate that the input files are not marked
up correctly.
• Ensure that for each LOAD segment in the ELF program header, file offsets, memory
sizes, and load addresses are multiples of the largest page size supported at run time.
Similarly, the start address and size of the GNU_RELRO range should be multiples of the
page size.
Avoid creating gaps between LOAD segments. The difference between the load addresses
of two subsequent LOAD segments should be the size of the first LOAD segment. (This
may require linking with -Wl,-z,noseparate-code.)
This may not be possible to achieve with the currently available link editors.
• If the multiple-of-page-size criterion for the GNU_RELRO region cannot be achieved, en-
sure that the process memory image right before the start of the region does not contain
executable or writable memory.
• Do not install shared objects in non-default locations. (Such locations are listed ex-
plicitly in the configuration file for ldconfig, usually /etc/ld.so.conf, or in files
included from there.)
• In relation to the previous item, do not install any objects it glibc-hwcaps subdirec-
tories.
• Do not configure dynamically-loaded NSS service modules, to avoid accidental internal
use of the dlopen facility. The files and dns modules are built in and do not rely on
dlopen.
• Do not truncate and overwrite files containing programs and shared objects in place,
while they are used. Instead, write the new version to a different path and use rename
to replace the already-installed version.
• Be aware that during a component update procedure that involves multiple object
files (shared objects and main programs), concurrently starting processes may observe
an inconsistent combination of object files (some already updated, some still at the
previous version). For example, this can happen during an update of the GNU C
Library itself.
1000
38 Internal probes
In order to aid in debugging and monitoring internal behavior, the GNU C Library exposes
nearly-zero-overhead SystemTap probes marked with the libc provider.
These probes are not part of the GNU C Library stable ABI, and they are subject to
change or removal across releases. Our only promise with regard to them is that, if we
find a need to remove or modify the arguments of a probe, the modified probe will have a
different name, so that program monitors relying on the old probe will not get unexpected
arguments.
to select an alternate arena in which to retry the allocation. Argument $arg1 is the
amount of memory requested by the user; in the calloc case, that is the total size
computed from both function arguments. In the realloc case, $arg2 is the pointer
to the memory area being resized. In the memalign case, $arg2 is the alignment to
be used for the request, which may be stricter than the value passed to the memalign
function. A memalign probe is also used by functions posix_memalign, valloc and
pvalloc.
Note that the argument order does not match that of the corresponding two-argument
functions, so that in all of these probes the user-requested allocation size is in $arg1.
memory_arena_retry (size t $arg1, void *$arg2) [Probe]
This probe is triggered within arena_get_retry (the function called to select the
alternate arena in which to retry an allocation that failed on the first attempt), before
the selection of an alternate arena. This probe is redundant, but much easier to use
when it’s not important to determine which of the various memory allocation functions
is failing to allocate on the first try. Argument $arg1 is the same as in the function-
specific probes, except for extra room for padding introduced by functions that have
to ensure stricter alignment. Argument $arg2 is the arena in which allocation failed.
memory_arena_new (void *$arg1, size t $arg2) [Probe]
This probe is triggered when malloc allocates and initializes an additional arena (not
the main arena), but before the arena is assigned to the running thread or inserted into
the internal linked list of arenas. The arena’s malloc_state internal data structure
is located at $arg1, within a newly-allocated heap big enough to hold at least $arg2
bytes.
memory_arena_reuse (void *$arg1, void *$arg2) [Probe]
This probe is triggered when malloc has just selected an existing arena to reuse,
and (temporarily) reserved it for exclusive use. Argument $arg1 is a pointer to the
newly-selected arena, and $arg2 is a pointer to the arena previously used by that
thread.
This occurs within reused_arena, right after the mutex mentioned in probe memory_
arena_reuse_wait is acquired; argument $arg1 will point to the same arena. In this
configuration, this will usually only occur once per thread. The exception is when a
thread first selected the main arena, but a subsequent allocation from it fails: then,
and only then, may we switch to another arena to retry that allocation, and for further
allocations within that thread.
memory_arena_reuse_wait (void *$arg1, void *$arg2, void *$arg3) [Probe]
This probe is triggered when malloc is about to wait for an arena to become available
for reuse. Argument $arg1 holds a pointer to the mutex the thread is going to wait
on, $arg2 is a pointer to a newly-chosen arena to be reused, and $arg3 is a pointer
to the arena previously used by that thread.
This occurs within reused_arena, when a thread first tries to allocate memory or
needs a retry after a failure to allocate from the main arena, there isn’t any free arena,
the maximum number of arenas has been reached, and an existing arena was chosen
for reuse, but its mutex could not be immediately acquired. The mutex in $arg1 is
the mutex of the selected arena.
Chapter 38: Internal probes 1002
39 Tunables
Tunables are a feature in the GNU C Library that allows application authors and distri-
bution maintainers to alter the runtime library behavior to match their workload. These
are implemented as a set of switches that may be modified in different ways. The current
default method to do this is via the GLIBC_TUNABLES environment variable by setting it to
a string of colon-separated name=value pairs. For example, the following example enables
malloc checking and sets the malloc trim threshold to 128 bytes:
GLIBC_TUNABLES=glibc.malloc.trim_threshold=128:glibc.malloc.check=3
export GLIBC_TUNABLES
Tunables are not part of the GNU C Library stable ABI, and they are subject to change
or removal across releases. Additionally, the method to modify tunable values may change
between releases and across distributions. It is possible to implement multiple ‘frontends’
for the tunables allowing distributions to choose their preferred method at build time.
Finally, the set of tunables available may vary between distributions as the tunables
feature allows distributions to add their own tunables under their own namespace.
Passing --list-tunables to the dynamic loader to print all tunables with minimum
and maximum values:
$ /lib64/ld-linux-x86-64.so.2 --list-tunables
glibc.rtld.nns: 0x4 (min: 0x1, max: 0x10)
glibc.elision.skip_lock_after_retries: 3 (min: 0, max: 2147483647)
glibc.malloc.trim_threshold: 0x0 (min: 0x0, max: 0xffffffffffffffff)
glibc.malloc.perturb: 0 (min: 0, max: 255)
glibc.cpu.x86_shared_cache_size: 0x100000 (min: 0x0, max: 0xffffffffffffffff)
glibc.pthread.rseq: 1 (min: 0, max: 1)
glibc.cpu.prefer_map_32bit_exec: 0 (min: 0, max: 1)
glibc.mem.tagging: 0 (min: 0, max: 255)
glibc.elision.tries: 3 (min: 0, max: 2147483647)
glibc.elision.enable: 0 (min: 0, max: 1)
glibc.malloc.hugetlb: 0x0 (min: 0x0, max: 0xffffffffffffffff)
glibc.cpu.x86_rep_movsb_threshold: 0x2000 (min: 0x100, max: 0xffffffffffffffff)
glibc.malloc.mxfast: 0x0 (min: 0x0, max: 0xffffffffffffffff)
glibc.rtld.dynamic_sort: 2 (min: 1, max: 2)
glibc.elision.skip_lock_busy: 3 (min: 0, max: 2147483647)
glibc.malloc.top_pad: 0x20000 (min: 0x0, max: 0xffffffffffffffff)
glibc.cpu.x86_rep_stosb_threshold: 0x800 (min: 0x1, max: 0xffffffffffffffff)
glibc.cpu.x86_non_temporal_threshold: 0xc0000 (min: 0x4040, max: 0xfffffffffffffff)
glibc.cpu.x86_memset_non_temporal_threshold: 0xc0000 (min: 0x4040, max: 0xfffffffffffff
glibc.cpu.x86_shstk:
glibc.pthread.stack_cache_size: 0x2800000 (min: 0x0, max: 0xffffffffffffffff)
glibc.malloc.mmap_max: 0 (min: 0, max: 2147483647)
glibc.elision.skip_trylock_internal_abort: 3 (min: 0, max: 2147483647)
glibc.cpu.plt_rewrite: 0 (min: 0, max: 2)
glibc.malloc.tcache_unsorted_limit: 0x0 (min: 0x0, max: 0xffffffffffffffff)
glibc.cpu.x86_ibt:
glibc.cpu.hwcaps:
Chapter 39: Tunables 1006
This tunable determines the amount of extra memory in bytes to obtain from the
system when any of the arenas need to be extended. It also specifies the number
of bytes to retain when shrinking any of the arenas. This provides the necessary
hysteresis in heap size such that excessive amounts of system calls can be avoided.
The default value of this tunable is ‘131072’ (128 KB).
glibc.malloc.perturb [Tunable]
This tunable supersedes the MALLOC_PERTURB_ environment variable and is identical
in features.
If set to a non-zero value, memory blocks are initialized with values depending on
some low order bits of this tunable when they are allocated (except when allocated
by calloc) and freed. This can be used to debug the use of uninitialized or freed
heap memory. Note that this option does not guarantee that the freed block will have
any specific values. It only guarantees that the content the block had before it was
freed will be overwritten.
The default value of this tunable is ‘0’.
glibc.malloc.mmap_threshold [Tunable]
This tunable supersedes the MALLOC_MMAP_THRESHOLD_ environment variable and is
identical in features.
When this tunable is set, all chunks larger than this value in bytes are allocated
outside the normal heap, using the mmap system call. This way it is guaranteed that
the memory for these chunks can be returned to the system on free. Note that
requests smaller than this threshold might still be allocated via mmap.
If this tunable is not set, the default value is set to ‘131072’ bytes and the threshold
is adjusted dynamically to suit the allocation patterns of the program. If the tunable
is set, the dynamic adjustment is disabled and the value is set as static.
glibc.malloc.trim_threshold [Tunable]
This tunable supersedes the MALLOC_TRIM_THRESHOLD_ environment variable and is
identical in features.
The value of this tunable is the minimum size (in bytes) of the top-most, releasable
chunk in an arena that will trigger a system call in order to return memory to the
system from that arena.
If this tunable is not set, the default value is set as 128 KB and the threshold is
adjusted dynamically to suit the allocation patterns of the program. If the tunable is
set, the dynamic adjustment is disabled and the value is set as static.
glibc.malloc.mmap_max [Tunable]
This tunable supersedes the MALLOC_MMAP_MAX_ environment variable and is identical
in features.
The value of this tunable is maximum number of chunks to allocate with mmap. Setting
this to zero disables all use of mmap.
The default value of this tunable is ‘65536’.
Chapter 39: Tunables 1008
glibc.malloc.arena_test [Tunable]
This tunable supersedes the MALLOC_ARENA_TEST environment variable and is identi-
cal in features.
The glibc.malloc.arena_test tunable specifies the number of arenas that can be
created before the test on the limit to the number of arenas is conducted. The value
is ignored if glibc.malloc.arena_max is set.
The default value of this tunable is 2 for 32-bit systems and 8 for 64-bit systems.
glibc.malloc.arena_max [Tunable]
This tunable supersedes the MALLOC_ARENA_MAX environment variable and is identical
in features.
This tunable sets the number of arenas to use in a process regardless of the number
of cores in the system.
The default value of this tunable is 0, meaning that the limit on the number of arenas
is determined by the number of CPU cores online. For 32-bit systems the limit is
twice the number of cores online and on 64-bit systems, it is 8 times the number of
cores online.
glibc.malloc.tcache_max [Tunable]
The maximum size of a request (in bytes) which may be met via the per-thread cache.
The default (and maximum) value is 1032 bytes on 64-bit systems and 516 bytes on
32-bit systems.
glibc.malloc.tcache_count [Tunable]
The maximum number of chunks of each size to cache. The default is 7. The upper
limit is 65535. If set to zero, the per-thread cache is effectively disabled.
The approximate maximum overhead of the per-thread cache is thus equal to the
number of bins times the chunk count in each bin times the size of each chunk. With
defaults, the approximate maximum overhead of the per-thread cache is approxi-
mately 236 KB on 64-bit systems and 118 KB on 32-bit systems.
glibc.malloc.tcache_unsorted_limit [Tunable]
When the user requests memory and the request cannot be met via the per-thread
cache, the arenas are used to meet the request. At this time, additional chunks will
be moved from existing arena lists to pre-fill the corresponding cache. While copies
from the fastbins, smallbins, and regular bins are bounded and predictable due to
the bin sizes, copies from the unsorted bin are not bounded, and incur additional
time penalties as they need to be sorted as they’re scanned. To make scanning the
unsorted list more predictable and bounded, the user may set this tunable to limit the
number of chunks that are scanned from the unsorted list while searching for chunks
to pre-fill the per-thread cache with. The default, or when set to zero, is no limit.
glibc.malloc.mxfast [Tunable]
One of the optimizations malloc uses is to maintain a series of “fast bins” that hold
chunks up to a specific size. The default and maximum size which may be held this
way is 80 bytes on 32-bit systems or 160 bytes on 64-bit systems. Applications which
value size over speed may choose to reduce the size of requests which are serviced from
Chapter 39: Tunables 1009
fast bins with this tunable. Note that the value specified includes malloc’s internal
overhead, which is normally the size of one pointer, so add 4 on 32-bit systems or 8
on 64-bit systems to the size passed to malloc for the largest bin size to enable.
glibc.malloc.hugetlb [Tunable]
This tunable controls the usage of Huge Pages on malloc calls. The default value is
0, which disables any additional support on malloc.
Setting its value to 1 enables the use of madvise with MADV_HUGEPAGE after memory
allocation with mmap. It is enabled only if the system supports Transparent Huge
Page (currently only on Linux).
Setting its value to 2 enables the use of Huge Page directly with mmap with the use
of MAP_HUGETLB flag. The huge page size to use will be the default one provided by
the system. A value larger than 2 specifies huge page size, which will be matched
against the system supported ones. If provided value is invalid, MAP_HUGETLB will not
be used.
glibc.rtld.nns [Tunable]
Sets the number of supported dynamic link namespaces (see dlmopen). Currently this
limit can be set between 1 and 16 inclusive, the default is 4. Each link namespace
consumes some memory in all thread, and thus raising the limit will increase the
amount of memory each thread uses. Raising the limit is useful when your application
uses more than 4 dynamic link namespaces as created by dlmopen with an lmid
argument of LM_ID_NEWLM. Dynamic linker audit modules are loaded in their own
dynamic link namespaces, but they are not accounted for in glibc.rtld.nns. They
implicitly increase the per-thread memory usage as necessary, so this tunable does
not need to be changed to allow many audit modules e.g. via LD_AUDIT.
glibc.rtld.optional_static_tls [Tunable]
Sets the amount of surplus static TLS in bytes to allocate at program startup. Ev-
ery thread created allocates this amount of specified surplus static TLS. This is a
minimum value and additional space may be allocated for internal purposes includ-
ing alignment. Optional static TLS is used for optimizing dynamic TLS access for
platforms that support such optimizations e.g. TLS descriptors or optimized TLS
access for POWER (DT_PPC64_OPT and DT_PPC_OPT). In order to make the best use
of such optimizations the value should be as many bytes as would be required to hold
all TLS variables in all dynamic loaded shared libraries. The value cannot be known
by the dynamic loader because it doesn’t know the expected set of shared libraries
which will be loaded. The existing static TLS space cannot be changed once allocated
at process startup. The default allocation of optional static TLS is 512 bytes and is
allocated in every thread.
Chapter 39: Tunables 1010
glibc.rtld.dynamic_sort [Tunable]
Sets the algorithm to use for DSO sorting, valid values are ‘1’ and ‘2’. For value
of ‘1’, an older O(n^3) algorithm is used, which is long time tested, but may have
performance issues when dependencies between shared objects contain cycles due to
circular dependencies. When set to the value of ‘2’, a different algorithm is used,
which implements a topological sort through depth-first search, and does not exhibit
the performance issues of ‘1’.
The default value of this tunable is ‘2’.
glibc.rtld.enable_secure [Tunable]
Used to run a program as if it were a setuid process. The only valid value is ‘1’ as this
tunable can only be used to set and not unset enable_secure. Setting this tunable
to ‘1’ also disables all other tunables. This tunable is intended to facilitate more
extensive verification tests for AT_SECURE programs and not meant to be a security
feature.
The default value of this tunable is ‘0’.
glibc.elision.enable [Tunable]
The glibc.elision.enable tunable enables lock elision if the feature is supported
by the hardware. If elision is not supported by the hardware this tunable has no
effect.
Elision tunables are supported for 64-bit Intel, IBM POWER, and z System archi-
tectures.
glibc.elision.skip_lock_busy [Tunable]
The glibc.elision.skip_lock_busy tunable sets how many times to use a non-
transactional lock after a transactional failure has occurred because the lock is already
acquired. Expressed in number of lock acquisition attempts.
The default value of this tunable is ‘3’.
glibc.elision.skip_lock_internal_abort [Tunable]
The glibc.elision.skip_lock_internal_abort tunable sets how many times the
thread should avoid using elision if a transaction aborted for any reason other than a
different thread’s memory accesses. Expressed in number of lock acquisition attempts.
The default value of this tunable is ‘3’.
glibc.elision.skip_lock_after_retries [Tunable]
The glibc.elision.skip_lock_after_retries tunable sets how many times to try
to elide a lock with transactions, that only failed due to a different thread’s memory
Chapter 39: Tunables 1011
accesses, before falling back to regular lock. Expressed in number of lock elision
attempts.
This tunable is supported only on IBM POWER, and z System architectures.
The default value of this tunable is ‘3’.
glibc.elision.tries [Tunable]
The glibc.elision.tries sets how many times to retry elision if there is chance
for the transaction to finish execution e.g., it wasn’t aborted due to the lock being
already acquired. If elision is not supported by the hardware this tunable is set to ‘0’
to avoid retries.
The default value of this tunable is ‘3’.
glibc.elision.skip_trylock_internal_abort [Tunable]
The glibc.elision.skip_trylock_internal_abort tunable sets how many times
the thread should avoid trying the lock if a transaction aborted due to reasons other
than a different thread’s memory accesses. Expressed in number of try lock attempts.
The default value of this tunable is ‘3’.
glibc.pthread.mutex_spin_count [Tunable]
The glibc.pthread.mutex_spin_count tunable sets the maximum number of times
a thread should spin on the lock before calling into the kernel to block. Adaptive spin
is used for mutexes initialized with the PTHREAD_MUTEX_ADAPTIVE_NP GNU extension.
It affects both pthread_mutex_lock and pthread_mutex_timedlock.
The thread spins until either the maximum spin count is reached or the lock is ac-
quired.
The default value of this tunable is ‘100’.
glibc.pthread.stack_cache_size [Tunable]
This tunable configures the maximum size of the stack cache. Once the stack cache
exceeds this size, unused thread stacks are returned to the kernel, to bring the cache
size below this limit.
The value is measured in bytes. The default is ‘41943040’ (forty mibibytes).
glibc.pthread.rseq [Tunable]
The glibc.pthread.rseq tunable can be set to ‘0’, to disable restartable sequences
support in the GNU C Library. This enables applications to perform direct restartable
sequence registration with the kernel. The default is ‘1’, which means that the GNU
C Library performs registration on behalf of the application.
Restartable sequences are a Linux-specific extension.
Chapter 39: Tunables 1012
glibc.pthread.stack_hugetlb [Tunable]
This tunable controls whether to use Huge Pages in the stacks created by pthread_
create. This tunable only affects the stacks created by the GNU C Library, it has
no effect on stack assigned with pthread_attr_setstack.
The default is ‘1’ where the system default value is used. Setting its value to 0 enables
the use of madvise with MADV_NOHUGEPAGE after stack creation with mmap.
This is a memory utilization optimization, since internal glibc setup of either the
thread descriptor and the guard page might force the kernel to move the thread stack
originally backup by Huge Pages to default pages.
glibc.cpu.x86_shared_cache_size [Tunable]
The glibc.cpu.x86_shared_cache_size tunable allows the user to set shared cache
size in bytes for use in memory and string routines.
glibc.cpu.x86_non_temporal_threshold [Tunable]
The glibc.cpu.x86_non_temporal_threshold tunable allows the user to set thresh-
old in bytes for non temporal store. Non temporal stores give a hint to the hardware
to move data directly to memory without displacing other data from the cache. This
tunable is used by some platforms to determine when to use non temporal stores in
operations like memmove and memcpy.
This tunable is specific to i386 and x86-64.
glibc.cpu.x86_memset_non_temporal_threshold [Tunable]
The glibc.cpu.x86_memset_non_temporal_threshold tunable allows the user to
set threshold in bytes for non temporal store in memset. Non temporal stores give a
hint to the hardware to move data directly to memory without displacing other data
from the cache. This tunable is used by some platforms to determine when to use
non temporal stores memset.
This tunable is specific to i386 and x86-64.
glibc.cpu.x86_rep_movsb_threshold [Tunable]
The glibc.cpu.x86_rep_movsb_threshold tunable allows the user to set threshold
in bytes to start using "rep movsb". The value must be greater than zero, and
currently defaults to 2048 bytes.
This tunable is specific to i386 and x86-64.
glibc.cpu.x86_rep_stosb_threshold [Tunable]
The glibc.cpu.x86_rep_stosb_threshold tunable allows the user to set threshold
in bytes to start using "rep stosb". The value must be greater than zero, and currently
defaults to 2048 bytes.
This tunable is specific to i386 and x86-64.
glibc.cpu.x86_ibt [Tunable]
The glibc.cpu.x86_ibt tunable allows the user to control how indirect branch track-
ing (IBT) should be enabled. Accepted values are on, off, and permissive. on
always turns on IBT regardless of whether IBT is enabled in the executable and its
dependent shared libraries. off always turns off IBT regardless of whether IBT is
enabled in the executable and its dependent shared libraries. permissive is the same
as the default which disables IBT on non-CET executables and shared libraries.
This tunable is specific to i386 and x86-64.
glibc.cpu.x86_shstk [Tunable]
The glibc.cpu.x86_shstk tunable allows the user to control how the shadow stack
(SHSTK) should be enabled. Accepted values are on, off, and permissive. on
always turns on SHSTK regardless of whether SHSTK is enabled in the executable
and its dependent shared libraries. off always turns off SHSTK regardless of whether
SHSTK is enabled in the executable and its dependent shared libraries. permissive
changes how dlopen works on non-CET shared libraries. By default, when SHSTK is
Chapter 39: Tunables 1014
glibc.cpu.prefer_map_32bit_exec [Tunable]
When this tunable is set to 1, shared libraries of non-setuid programs will be loaded
below 2GB with MAP 32BIT.
Note that the LD_PREFER_MAP_32BIT_EXEC environment is an alias of this tunable.
This tunable is specific to 64-bit x86-64.
glibc.cpu.plt_rewrite [Tunable]
When this tunable is set to 1, the dynamic linker will rewrite the PLT section with
32-bit direct jump. When it is set to 2, the dynamic linker will rewrite the PLT
section with 32-bit direct jump and on APX processors with 64-bit absolute jump.
This tunable is specific to x86-64 and effective only when the lazy binding is disabled.
glibc.mem.tagging [Tunable]
If the hardware supports memory tagging, this tunable can be used to control the way
the GNU C Library uses this feature. At present this is only supported on AArch64
systems with the MTE extension; it is ignored for all other systems.
This tunable takes a value between 0 and 255 and acts as a bitmask that enables
various capabilities.
Bit 0 (the least significant bit) causes the malloc subsystem to allocate tagged mem-
ory, with each allocation being assigned a random tag.
Bit 1 enables precise faulting mode for tag violations on systems that support deferred
tag violation reporting. This may cause programs to run more slowly.
Bit 2 enables either precise or deferred faulting mode for tag violations whichever is
preferred by the system.
Other bits are currently reserved.
The GNU C Library startup code will automatically enable memory tagging support
in the kernel if this tunable has any non-zero value.
The default value is ‘0’, which disables all memory tagging.
glibc.mem.decorate_maps [Tunable]
If the kernel supports naming anonymous virtual memory areas (since Linux version
5.17, although not always enabled by some kernel configurations), this tunable can
be used to control whether the GNU C Library decorates the underlying memory
obtained from operating system with a string describing its usage (for instance, on
the thread stack created by ptthread_create or memory allocated by malloc).
Chapter 39: Tunables 1015
The process mappings can be obtained by reading the /proc/<pid>maps (with pid
being either the process ID or self for the process own mapping).
This tunable takes a value of 0 and 1, where 1 enables the feature. The default value
is ‘0’, which disables the decoration.
glibc.mem.minarcs [Tunable]
The heuristic for sizing the call graph buffer is known to be insufficient for small
programs; hence, the calculated value is clamped to be at least a minimum size. The
default minimum (in units of call graph entries, struct tostruct), is given by the
macro MINARCS. If you have some program with an unusually complex call graph, for
which the heuristic fails to allocate enough space, you can use this tunable to increase
the minimum to a larger value.
glibc.mem.maxarcs [Tunable]
To prevent excessive memory consumption when profiling very large programs, the
call graph buffer is allowed to have a maximum of MAXARCS entries. For some very
large programs, the default value of MAXARCS defined in sys/gmon.h is too small; in
that case, you can use this tunable to increase it.
Note the value of the maxarcs tunable must be greater or equal to that of the minarcs
tunable; if this constraint is violated, a warning will printed to standard error at
program startup, and the minarcs value will be used as the maximum as well.
Setting either tunable too high may result in a call graph buffer whose size exceeds
the available memory; in that case, an out of memory error will be printed at program
startup, the profiler will be disabled, and no gmon.out file will be generated.
1016
Usage note: The assert facility is designed for detecting internal inconsistency; it is
not suitable for reporting invalid input or improper usage by the user of the program.
The information in the diagnostic messages printed by the assert and assert_perror
macro is intended to help you, the programmer, track down the cause of a bug, but is
not really useful for telling a user of your program why his or her input was invalid or
why a command could not be carried out. What’s more, your program should not abort
when given invalid input, as assert would do—it should exit with nonzero status (see
Section 26.7.2 [Exit Status], page 851) after printing its error messages, or perhaps read
another command or move on to the next input file.
See Section 2.3 [Error Messages], page 37, for information on printing error messages for
problems that do not represent bugs in the program.
But some functions perform operations that can meaningfully accept an unlimited num-
ber of arguments.
In some cases a function can handle any number of values by operating on all of them
as a block. For example, consider a function that allocates a one-dimensional array with
malloc to hold a specified set of values. This operation makes sense for any number of
values, as long as the length of the array corresponds to that number. Without facilities
for variable arguments, you would have to define a separate function for each possible array
size.
The library function printf (see Section 12.12 [Formatted Output], page 292) is an
example of another class of function where variable arguments are useful. This function
prints its arguments (which can vary in type as well as number) under the control of a
format template string.
These are good reasons to define a variadic function which can handle as many arguments
as the caller chooses to pass.
Some functions such as open take a fixed set of arguments, but occasionally ignore the
last few. Strict adherence to ISO C requires these functions to be defined as variadic; in
practice, however, the GNU C compiler and most other C compilers let you define such a
function to take a fixed set of arguments—the most it can ever use—and then only declare
the function as variadic (or not declare its arguments at all!).
array and function types, as well as float, char (whether signed or not) and short int
(whether signed or not). This is actually an ISO C requirement.
A similar alternative is to have one of the required arguments be a bit mask, with a bit
for each possible purpose for which an optional argument might be supplied. You would
test the bits in a predefined sequence; if the bit is set, fetch the value of the next argument,
otherwise use a default value.
A required argument can be used as a pattern to specify both the number and types of
the optional arguments. The format string argument to printf is one example of this (see
Section 12.12.7 [Formatted Output Functions], page 301).
Another possibility is to pass an “end marker” value as the last optional argument. For
example, for a function that manipulates an arbitrary number of pointer arguments, a null
pointer might indicate the end of the argument list. (This assumes that a null pointer
isn’t otherwise meaningful to the function.) The execl function works in just this way; see
Section 27.6 [Executing a File], page 859.
a simple assignment is invalid, hopefully va_copy will be available, so one should always
write something like this if concerned about pre-C99 portability:
{
va_list ap, save;
...
#ifdef va_copy
va_copy (save, ap);
#else
save = ap;
#endif
...
}
#include <stdarg.h>
#include <stdio.h>
int
add_em_up (int count,...)
{
va_list ap;
int i, sum;
sum = 0;
for (i = 0; i < count; i++)
sum += va_arg (ap, int); /* Get the next argument value. */
int
main (void)
{
/* This call prints 16. */
printf ("%d\n", add_em_up (3, 5, 5, 6));
return 0;
}
You can also use 0 or (void *)0 as a null pointer constant, but using NULL is cleaner
because it makes the purpose of the constant more evident.
If you use the null pointer constant as a function argument, then for complete portability
you should make sure that the function has a prototype declaration. Otherwise, if the
target machine has two different pointer representations, the compiler won’t know which
representation to use for that argument. You can avoid the problem by explicitly casting
the constant to the proper pointer type, but we recommend instead adding a prototype for
the function you are calling.
This is the minimum value that can be represented by a signed long int.
On most machines that the GNU C Library runs on, long integers are 32-bit
quantities, the same size as int.
LONG_MAX
ULONG_MAX
These are the maximum values that can be represented by a signed long int
and unsigned long int, respectively.
LLONG_MIN
This is the minimum value that can be represented by a signed long long int.
On most machines that the GNU C Library runs on, long long integers are
64-bit quantities.
LLONG_MAX
ULLONG_MAX
These are the maximum values that can be represented by a signed long long
int and unsigned long long int, respectively.
LONG_LONG_MIN
LONG_LONG_MAX
ULONG_LONG_MAX
These are obsolete names for LLONG_MIN, LLONG_MAX, and ULLONG_MAX. They
are only available if _GNU_SOURCE is defined (see Section 1.3.4 [Feature Test
Macros], page 16). In GCC versions prior to 3.0, these were the only names
available.
WCHAR_MAX
This is the maximum value that can be represented by a wchar_t. See Sec-
tion 6.1 [Introduction to Extended Characters], page 143.
The header file limits.h also defines some additional constants that parameterize var-
ious operating system and file system limits. These constants are described in Chapter 33
[System Configuration Parameters], page 943.
You are probably already familiar with most of these concepts in terms of scientific or
exponential notation for floating point numbers. For example, the number 123456.0 could
be expressed in exponential notation as 1.23456e+05, a shorthand notation indicating that
the mantissa 1.23456 is multiplied by the base 10 raised to power 5.
More formally, the internal representation of a floating point number can be characterized
in terms of the following parameters:
• The sign is either -1 or 1.
• The base or radix for exponentiation, an integer greater than 1. This is a constant for
a particular representation.
• The exponent to which the base is raised. The upper and lower bounds of the exponent
value are constants for a particular representation.
Sometimes, in the actual bits representing the floating point number, the exponent is
biased by adding a constant to it, to make it always be represented as an unsigned
quantity. This is only important if you have some reason to pick apart the bit fields
making up the floating point number by hand, which is something for which the GNU
C Library provides no support. So this is ignored in the discussion that follows.
• The mantissa or significand is an unsigned integer which is a part of each floating point
number.
• The precision of the mantissa. If the base of the representation is b, then the precision
is the number of base-b digits in the mantissa. This is a constant for a particular
representation.
Many floating point representations have an implicit hidden bit in the mantissa. This
is a bit which is present virtually in the mantissa, but not stored in memory because
its value is always 1 in a normalized number. The precision figure (see above) includes
any hidden bits.
Again, the GNU C Library provides no facilities for dealing with such low-level aspects
of the representation.
The mantissa of a floating point number represents an implicit fraction whose denomina-
tor is the base raised to the power of the precision. Since the largest representable mantissa
is one less than this denominator, the value of the fraction is always strictly less than 1.
The mathematical value of a floating point number is then the product of this fraction, the
sign, and the base raised to the exponent.
We say that the floating point number is normalized if the fraction is at least 1/b, where
b is the base. In other words, the mantissa would be too large to fit if it were multiplied
by the base. Non-normalized numbers are sometimes called denormal; they contain less
precision than the representation normally can hold.
If the number is not normalized, then you can subtract 1 from the exponent while
multiplying the mantissa by the base, and get another floating point number with the same
value. Normalization consists of doing this repeatedly until the number is normalized. Two
distinct normalized floating point numbers cannot be equal in value.
(There is an exception to this rule: if the mantissa is zero, it is considered normalized.
Another exception happens on certain machines where the exponent is as small as the
representation can hold. Then it is impossible to subtract 1 from the exponent, so a number
may be normalized even if its fraction is less than 1/b.)
Appendix A: C Language Facilities in the Library 1028
DBL_MAX_EXP
LDBL_MAX_EXP
These are similar to FLT_MAX_EXP, but for the data types double and long
double, respectively.
FLT_MAX_10_EXP
This is the maximum positive integer such that 10 raised to this power can be
represented as a finite floating point number of type float. This is supposed
to be at least 37.
DBL_MAX_10_EXP
LDBL_MAX_10_EXP
These are similar to FLT_MAX_10_EXP, but for the data types double and long
double, respectively.
FLT_MAX
The value of this macro is the maximum number representable in type float.
It is supposed to be at least 1E+37. The value has type float.
The smallest representable number is - FLT_MAX.
DBL_MAX
LDBL_MAX
These are similar to FLT_MAX, but for the data types double and long double,
respectively. The type of the macro’s value is the same as the type it describes.
FLT_MIN
The value of this macro is the minimum normalized positive floating point
number that is representable in type float. It is supposed to be no more than
1E-37.
DBL_MIN
LDBL_MIN
These are similar to FLT_MIN, but for the data types double and long double,
respectively. The type of the macro’s value is the same as the type it describes.
FLT_EPSILON
This is the difference between 1 and the smallest floating point number of type
float that is greater than 1. It’s supposed to be no greater than 1E-5.
DBL_EPSILON
LDBL_EPSILON
These are similar to FLT_EPSILON, but for the data types double and long
double, respectively. The type of the macro’s value is the same as the type it
describes. The values are not supposed to be greater than 1E-9.
The IEEE single-precision float representation uses a base of 2. There is a sign bit, a
mantissa with 23 bits plus one hidden bit (so the total precision is 24 base-2 digits), and an
8-bit exponent that can represent values in the range -125 to 128, inclusive.
So, for an implementation that uses this representation for the float data type, appro-
priate values for the corresponding parameters are:
FLT_RADIX 2
FLT_MANT_DIG 24
FLT_DIG 6
FLT_MIN_EXP -125
FLT_MIN_10_EXP -37
FLT_MAX_EXP 128
FLT_MAX_10_EXP +38
FLT_MIN 1.17549435E-38F
FLT_MAX 3.40282347E+38F
FLT_EPSILON 1.19209290E-07F
Here are the values for the double data type:
DBL_MANT_DIG 53
DBL_DIG 15
DBL_MIN_EXP -1021
DBL_MIN_10_EXP -307
DBL_MAX_EXP 1024
DBL_MAX_10_EXP 308
DBL_MAX 1.7976931348623157E+308
DBL_MIN 2.2250738585072014E-308
DBL_EPSILON 2.2204460492503131E-016
ARGP_HELP_STD_ERR
argp.h (GNU): Section 26.3.10 [Flags for the argp_help Function], page 832.
ARGP_HELP_STD_HELP
argp.h (GNU): Section 26.3.10 [Flags for the argp_help Function], page 832.
ARGP_HELP_STD_USAGE
argp.h (GNU): Section 26.3.10 [Flags for the argp_help Function], page 832.
ARGP_HELP_USAGE
argp.h (GNU): Section 26.3.10 [Flags for the argp_help Function], page 832.
ARGP_IN_ORDER
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
ARGP_KEY_ARG
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_ARGS
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_END
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_ERROR
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_FINI
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_HELP_ARGS_DOC
argp.h (GNU): Section 26.3.8.1 [Special Keys for Argp Help Filter Functions], page 831.
ARGP_KEY_HELP_DUP_ARGS_NOTE
argp.h (GNU): Section 26.3.8.1 [Special Keys for Argp Help Filter Functions], page 831.
ARGP_KEY_HELP_EXTRA
argp.h (GNU): Section 26.3.8.1 [Special Keys for Argp Help Filter Functions], page 831.
ARGP_KEY_HELP_HEADER
argp.h (GNU): Section 26.3.8.1 [Special Keys for Argp Help Filter Functions], page 831.
ARGP_KEY_HELP_POST_DOC
argp.h (GNU): Section 26.3.8.1 [Special Keys for Argp Help Filter Functions], page 831.
ARGP_KEY_HELP_PRE_DOC
argp.h (GNU): Section 26.3.8.1 [Special Keys for Argp Help Filter Functions], page 831.
ARGP_KEY_INIT
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_NO_ARGS
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_KEY_SUCCESS
argp.h (GNU): Section 26.3.5.1 [Special Keys for Argp Parser Functions], page 825.
ARGP_LONG_ONLY
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
ARGP_NO_ARGS
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
ARGP_NO_ERRS
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
ARGP_NO_EXIT
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
Appendix B: Summary of Library Facilities 1034
ARGP_NO_HELP
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
ARGP_PARSE_ARGV0
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
ARGP_SILENT
argp.h (GNU): Section 26.3.7 [Flags for argp_parse], page 830.
int ARG_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
int BC_BASE_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
int BC_DIM_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
int BC_SCALE_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
int BC_STRING_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
BOOT_TIME
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
tcflag_t BRKINT
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
int BUFSIZ
stdio.h (ISO): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
tcflag_t CCTS_OFLOW
termios.h (BSD): Section 17.4.6 [Control Modes], page 521.
int CHAR_BIT
limits.h (C90): Section A.5.1 [Width of an Integer Type], page 1024.
CHAR_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
CHAR_MIN
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
CHAR_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
int CHILD_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
tcflag_t CIGNORE
termios.h (BSD): Section 17.4.6 [Control Modes], page 521.
int CLK_TCK
time.h (POSIX.1): Section 22.4.2 [Processor Time Inquiry], page 700.
tcflag_t CLOCAL
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
CLOCKS_PER_SEC
time.h (ISO): Section 22.4 [Processor And CPU Time], page 699.
int CLOCKS_PER_SEC
time.h (ISO): Section 22.4.1 [CPU Time Inquiry], page 700.
Appendix B: Summary of Library Facilities 1035
clockid_t CLOCK_MONOTONIC
time.h (POSIX.1): Section 22.5.1 [Getting the Time], page 701.
clockid_t CLOCK_REALTIME
time.h (POSIX.1): Section 22.5.1 [Getting the Time], page 701.
int COLL_WEIGHTS_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
void CPU_CLR (int cpu, cpu_set_t *set)
sched.h (GNU): Section 23.3.5 [Limiting execution to certain CPUs], page 751.
int CPU_ISSET (int cpu, const cpu_set_t *set)
sched.h (GNU): Section 23.3.5 [Limiting execution to certain CPUs], page 751.
void CPU_SET (int cpu, cpu_set_t *set)
sched.h (GNU): Section 23.3.5 [Limiting execution to certain CPUs], page 751.
int CPU_SETSIZE
sched.h (GNU): Section 23.3.5 [Limiting execution to certain CPUs], page 751.
void CPU_ZERO (cpu_set_t *set)
sched.h (GNU): Section 23.3.5 [Limiting execution to certain CPUs], page 751.
tcflag_t CREAD
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t CRTS_IFLOW
termios.h (BSD): Section 17.4.6 [Control Modes], page 521.
tcflag_t CS5
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t CS6
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t CS7
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t CS8
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t CSIZE
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t CSTOPB
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
DBL_DIG
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_EPSILON
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_MANT_DIG
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_MAX
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_MAX_10_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_MAX_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_MIN
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
Appendix B: Summary of Library Facilities 1036
DBL_MIN_10_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DBL_MIN_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
DEAD_PROCESS
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
DIR
dirent.h (POSIX.1): Section 14.2.2 [Opening a Directory Stream], page 415.
int DLFO_EH_SEGMENT_TYPE
dlfcn.h (GNU): Section 37.2 [Dynamic Linker Introspection], page 989.
int DLFO_STRUCT_HAS_EH_COUNT
dlfcn.h (GNU): Section 37.2 [Dynamic Linker Introspection], page 989.
int DLFO_STRUCT_HAS_EH_DBASE
dlfcn.h (GNU): Section 37.2 [Dynamic Linker Introspection], page 989.
mode_t DTTOIF (int dtype)
dirent.h (BSD): Section 14.2.1 [Format of a Directory Entry], page 413.
int E2BIG
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EACCES
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EADDRINUSE
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EADDRNOTAVAIL
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EADV
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EAFNOSUPPORT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EAGAIN
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EALREADY
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EAUTH
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EBACKGROUND
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int EBADE
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EBADF
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EBADFD
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EBADMSG
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
Appendix B: Summary of Library Facilities 1037
int EBADR
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EBADRPC
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EBADRQC
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EBADSLT
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EBFONT
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EBUSY
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ECANCELED
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ECHILD
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
tcflag_t ECHO
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t ECHOCTL
termios.h (BSD): Section 17.4.7 [Local Modes], page 522.
tcflag_t ECHOE
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t ECHOK
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t ECHOKE
termios.h (BSD): Section 17.4.7 [Local Modes], page 522.
tcflag_t ECHONL
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t ECHOPRT
termios.h (BSD): Section 17.4.7 [Local Modes], page 522.
int ECHRNG
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ECOMM
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ECONNABORTED
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ECONNREFUSED
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ECONNRESET
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ED
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int EDEADLK
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
Appendix B: Summary of Library Facilities 1038
int EDEADLOCK
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EDESTADDRREQ
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EDIED
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int EDOM
errno.h (ISO): Section 2.2 [Error Codes], page 25.
int EDOTDOT
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EDQUOT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EEXIST
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EFAULT
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EFBIG
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EFTYPE
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EGRATUITOUS
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int EGREGIOUS
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int EHOSTDOWN
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EHOSTUNREACH
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EHWPOISON
errno.h (Linux): Section 2.2 [Error Codes], page 25.
int EIDRM
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int EIEIO
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int EILSEQ
errno.h (ISO): Section 2.2 [Error Codes], page 25.
int EINPROGRESS
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EINTR
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EINVAL
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EIO
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
Appendix B: Summary of Library Facilities 1039
int EISCONN
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EISDIR
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EISNAM
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EKEYEXPIRED
errno.h (Linux): Section 2.2 [Error Codes], page 25.
int EKEYREJECTED
errno.h (Linux): Section 2.2 [Error Codes], page 25.
int EKEYREVOKED
errno.h (Linux): Section 2.2 [Error Codes], page 25.
int EL2HLT
errno.h (Obsolete): Section 2.2 [Error Codes], page 25.
int EL2NSYNC
errno.h (Obsolete): Section 2.2 [Error Codes], page 25.
int EL3HLT
errno.h (Obsolete): Section 2.2 [Error Codes], page 25.
int EL3RST
errno.h (Obsolete): Section 2.2 [Error Codes], page 25.
int ELIBACC
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ELIBBAD
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ELIBEXEC
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int ELIBMAX
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ELIBSCN
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ELNRNG
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ELOOP
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EMEDIUMTYPE
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EMFILE
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EMLINK
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
EMPTY
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
Appendix B: Summary of Library Facilities 1040
int EMSGSIZE
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EMULTIHOP
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int ENAMETOOLONG
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENAVAIL
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENEEDAUTH
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENETDOWN
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENETRESET
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENETUNREACH
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENFILE
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOANO
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENOBUFS
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENOCSI
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENODATA
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int ENODEV
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOENT
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOEXEC
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOKEY
errno.h (Linux): Section 2.2 [Error Codes], page 25.
int ENOLCK
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOLINK
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int ENOMEDIUM
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENOMEM
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOMSG
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
Appendix B: Summary of Library Facilities 1041
int ENONET
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENOPKG
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENOPROTOOPT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENOSPC
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOSR
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int ENOSTR
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int ENOSYS
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOTBLK
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENOTCONN
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENOTDIR
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOTEMPTY
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOTNAM
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENOTRECOVERABLE
errno.h (GNU): Section 2.2 [Error Codes], page 25.
int ENOTSOCK
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ENOTSUP
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOTTY
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ENOTUNIQ
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ENXIO
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EOF
stdio.h (ISO): Section 12.15 [End-Of-File and Errors], page 326.
int EOPNOTSUPP
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EOVERFLOW
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int EOWNERDEAD
errno.h (GNU): Section 2.2 [Error Codes], page 25.
Appendix B: Summary of Library Facilities 1042
int EPERM
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EPFNOSUPPORT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EPIPE
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EPROCLIM
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EPROCUNAVAIL
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EPROGMISMATCH
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EPROGUNAVAIL
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EPROTO
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int EPROTONOSUPPORT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EPROTOTYPE
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EQUIV_CLASS_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
int ERANGE
errno.h (ISO): Section 2.2 [Error Codes], page 25.
int EREMCHG
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EREMOTE
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EREMOTEIO
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ERESTART
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ERFKILL
errno.h (Linux): Section 2.2 [Error Codes], page 25.
int EROFS
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ERPCMISMATCH
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ESHUTDOWN
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ESOCKTNOSUPPORT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ESPIPE
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
Appendix B: Summary of Library Facilities 1043
int ESRCH
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int ESRMNT
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ESTALE
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ESTRPIPE
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int ETIME
errno.h (XOPEN): Section 2.2 [Error Codes], page 25.
int ETIMEDOUT
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ETOOMANYREFS
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int ETXTBSY
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EUCLEAN
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EUNATCH
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EUSERS
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EWOULDBLOCK
errno.h (BSD): Section 2.2 [Error Codes], page 25.
int EXDEV
errno.h (POSIX.1): Section 2.2 [Error Codes], page 25.
int EXFULL
errno.h (Linux???): Section 2.2 [Error Codes], page 25.
int EXIT_FAILURE
stdlib.h (ISO): Section 26.7.2 [Exit Status], page 851.
int EXIT_SUCCESS
stdlib.h (ISO): Section 26.7.2 [Exit Status], page 851.
int EXPR_NEST_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
int FD_CLOEXEC
fcntl.h (POSIX.1): Section 13.14 [File Descriptor Flags], page 394.
void FD_CLR (int filedes, fd_set *set)
sys/types.h (BSD): Section 13.9 [Waiting for Input or Output], page 374.
int FD_ISSET (int filedes, const fd_set *set)
sys/types.h (BSD): Section 13.9 [Waiting for Input or Output], page 374.
void FD_SET (int filedes, fd_set *set)
sys/types.h (BSD): Section 13.9 [Waiting for Input or Output], page 374.
int FD_SETSIZE
sys/types.h (BSD): Section 13.9 [Waiting for Input or Output], page 374.
Appendix B: Summary of Library Facilities 1044
FLT_RADIX
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
FLT_ROUNDS
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
tcflag_t FLUSHO
termios.h (BSD): Section 17.4.7 [Local Modes], page 522.
FNM_CASEFOLD
fnmatch.h (GNU): Section 10.1 [Wildcard Matching], page 243.
FNM_EXTMATCH
fnmatch.h (GNU): Section 10.1 [Wildcard Matching], page 243.
FNM_FILE_NAME
fnmatch.h (GNU): Section 10.1 [Wildcard Matching], page 243.
FNM_LEADING_DIR
fnmatch.h (GNU): Section 10.1 [Wildcard Matching], page 243.
FNM_NOESCAPE
fnmatch.h (POSIX.2): Section 10.1 [Wildcard Matching], page 243.
FNM_PATHNAME
fnmatch.h (POSIX.2): Section 10.1 [Wildcard Matching], page 243.
FNM_PERIOD
fnmatch.h (POSIX.2): Section 10.1 [Wildcard Matching], page 243.
int FOPEN_MAX
stdio.h (ISO): Section 12.3 [Opening Streams], page 271.
FPE_DECOVF_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_FLTDIV_FAULT
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_FLTDIV_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_FLTOVF_FAULT
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_FLTOVF_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_FLTUND_FAULT
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_FLTUND_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_INTDIV_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_INTOVF_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
FPE_SUBRNG_TRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
int FP_ILOGB0
math.h (ISO): Section 19.4 [Exponentiation and Logarithms], page 555.
int FP_ILOGBNAN
math.h (ISO): Section 19.4 [Exponentiation and Logarithms], page 555.
Appendix B: Summary of Library Facilities 1046
FP_INFINITE
math.h (C99): Section 20.4 [Floating-Point Number Classification Functions], page 648.
FP_INT_DOWNWARD
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
FP_INT_TONEAREST
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
FP_INT_TONEARESTFROMZERO
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
FP_INT_TOWARDZERO
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
FP_INT_UPWARD
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
long int FP_LLOGB0
math.h (ISO): Section 19.4 [Exponentiation and Logarithms], page 555.
long int FP_LLOGBNAN
math.h (ISO): Section 19.4 [Exponentiation and Logarithms], page 555.
FP_NAN
math.h (C99): Section 20.4 [Floating-Point Number Classification Functions], page 648.
FP_NORMAL
math.h (C99): Section 20.4 [Floating-Point Number Classification Functions], page 648.
FP_SUBNORMAL
math.h (C99): Section 20.4 [Floating-Point Number Classification Functions], page 648.
FP_ZERO
math.h (C99): Section 20.4 [Floating-Point Number Classification Functions], page 648.
struct FTW
ftw.h (XPG4.2): Section 14.3 [Working with Directory Trees], page 423.
int F_DUPFD
fcntl.h (POSIX.1): Section 13.13 [Duplicating Descriptors], page 392.
int F_GETFD
fcntl.h (POSIX.1): Section 13.14 [File Descriptor Flags], page 394.
int F_GETFL
fcntl.h (POSIX.1): Section 13.15.4 [Getting and Setting File Status Flags], page 400.
int F_GETLK
fcntl.h (POSIX.1): Section 13.16 [File Locks], page 401.
int F_GETOWN
fcntl.h (BSD): Section 13.19 [Interrupt-Driven Input], page 408.
int F_OFD_SETLK
fcntl.h (POSIX.1): Section 13.17 [Open File Description Locks], page 404.
int F_OFD_SETLKW
fcntl.h (POSIX.1): Section 13.17 [Open File Description Locks], page 404.
int F_OK
unistd.h (POSIX.1): Section 14.9.8 [Testing Permission to Access a File], page 447.
F_RDLCK
fcntl.h (POSIX.1): Section 13.16 [File Locks], page 401.
Appendix B: Summary of Library Facilities 1047
int F_SETFD
fcntl.h (POSIX.1): Section 13.14 [File Descriptor Flags], page 394.
int F_SETFL
fcntl.h (POSIX.1): Section 13.15.4 [Getting and Setting File Status Flags], page 400.
int F_SETLK
fcntl.h (POSIX.1): Section 13.16 [File Locks], page 401.
int F_SETLKW
fcntl.h (POSIX.1): Section 13.16 [File Locks], page 401.
int F_SETOWN
fcntl.h (BSD): Section 13.19 [Interrupt-Driven Input], page 408.
F_UNLCK
fcntl.h (POSIX.1): Section 13.16 [File Locks], page 401.
F_WRLCK
fcntl.h (POSIX.1): Section 13.16 [File Locks], page 401.
GLOB_ABORTED
glob.h (POSIX.2): Section 10.2.1 [Calling glob], page 244.
GLOB_ALTDIRFUNC
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
GLOB_APPEND
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_BRACE
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
GLOB_DOOFFS
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_ERR
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_MAGCHAR
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
GLOB_MARK
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_NOCHECK
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_NOESCAPE
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_NOMAGIC
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
GLOB_NOMATCH
glob.h (POSIX.2): Section 10.2.1 [Calling glob], page 244.
GLOB_NOSORT
glob.h (POSIX.2): Section 10.2.2 [Flags for Globbing], page 249.
GLOB_NOSPACE
glob.h (POSIX.2): Section 10.2.1 [Calling glob], page 244.
GLOB_ONLYDIR
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
Appendix B: Summary of Library Facilities 1048
GLOB_PERIOD
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
GLOB_TILDE
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
GLOB_TILDE_CHECK
glob.h (GNU): Section 10.2.3 [More Flags for Globbing], page 250.
HOST_NOT_FOUND
netdb.h (BSD): Section 16.6.2.4 [Host Names], page 478.
double HUGE_VAL
math.h (ISO): Section 20.5.4 [Error Reporting by Mathematical Functions], page 655.
float HUGE_VALF
math.h (ISO): Section 20.5.4 [Error Reporting by Mathematical Functions], page 655.
long double HUGE_VALL
math.h (ISO): Section 20.5.4 [Error Reporting by Mathematical Functions], page 655.
_FloatN HUGE_VAL_FN
math.h (TS 18661-3:2015): Section 20.5.4 [Error Reporting by Mathematical Functions],
page 655.
_FloatNx HUGE_VAL_FNx
math.h (TS 18661-3:2015): Section 20.5.4 [Error Reporting by Mathematical Functions],
page 655.
tcflag_t HUPCL
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
const float complex I
complex.h (C99): Section 20.9 [Complex Numbers], page 679.
tcflag_t ICANON
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t ICRNL
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t IEXTEN
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
size_t IFNAMSIZ
net/if.h (???): Section 16.4 [Interface Naming], page 469.
int IFTODT (mode_t mode)
dirent.h (BSD): Section 14.2.1 [Format of a Directory Entry], page 413.
tcflag_t IGNBRK
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t IGNCR
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t IGNPAR
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t IMAXBEL
termios.h (BSD): Section 17.4.4 [Input Modes], page 518.
uint32_t INADDR_ANY
netinet/in.h (BSD): Section 16.6.2.2 [Host Address Data Type], page 476.
uint32_t INADDR_BROADCAST
netinet/in.h (BSD): Section 16.6.2.2 [Host Address Data Type], page 476.
Appendix B: Summary of Library Facilities 1049
uint32_t INADDR_LOOPBACK
netinet/in.h (BSD): Section 16.6.2.2 [Host Address Data Type], page 476.
uint32_t INADDR_NONE
netinet/in.h (BSD): Section 16.6.2.2 [Host Address Data Type], page 476.
float INFINITY
math.h (ISO): Section 20.5.2 [Infinity and NaN], page 652.
INIT_PROCESS
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
tcflag_t INLCR
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t INPCK
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
INTPTR_WIDTH
stdint.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
INT_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
INT_MIN
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
INT_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
int IPPORT_RESERVED
netinet/in.h (BSD): Section 16.6.3 [Internet Ports], page 483.
int IPPORT_USERRESERVED
netinet/in.h (BSD): Section 16.6.3 [Internet Ports], page 483.
tcflag_t ISIG
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t ISTRIP
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
ITIMER_PROF
sys/time.h (BSD): Section 22.6 [Setting an Alarm], page 731.
ITIMER_REAL
sys/time.h (BSD): Section 22.6 [Setting an Alarm], page 731.
ITIMER_VIRTUAL
sys/time.h (BSD): Section 22.6 [Setting an Alarm], page 731.
tcflag_t IXANY
termios.h (BSD): Section 17.4.4 [Input Modes], page 518.
tcflag_t IXOFF
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t IXON
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
LANG
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
LC_ALL
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
Appendix B: Summary of Library Facilities 1050
LC_COLLATE
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
LC_CTYPE
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
LC_MESSAGES
locale.h (XOPEN): Section 7.3 [Locale Categories], page 187.
LC_MONETARY
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
LC_NUMERIC
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
LC_TIME
locale.h (ISO): Section 7.3 [Locale Categories], page 187.
LDBL_DIG
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_EPSILON
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MANT_DIG
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MAX
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MAX_10_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MAX_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MIN
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MIN_10_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
LDBL_MIN_EXP
float.h (C90): Section A.5.3.2 [Floating Point Parameters], page 1028.
int LINE_MAX
limits.h (POSIX.2): Section 33.10 [Utility Program Capacity Limits], page 961.
int LINK_MAX
limits.h optional (POSIX.1): Section 33.6 [Limits on File System Capacity], page 956.
LLONG_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
LLONG_MIN
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
LLONG_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
LOGIN_PROCESS
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
LONG_LONG_MAX
limits.h (GNU): Section A.5.2 [Range of an Integer Type], page 1025.
Appendix B: Summary of Library Facilities 1051
LONG_LONG_MIN
limits.h (GNU): Section A.5.2 [Range of an Integer Type], page 1025.
LONG_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
LONG_MIN
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
LONG_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
L_INCR
sys/file.h (BSD): Section 12.18 [File Positioning], page 328.
L_SET
sys/file.h (BSD): Section 12.18 [File Positioning], page 328.
L_XTND
sys/file.h (BSD): Section 12.18 [File Positioning], page 328.
int L_ctermid
stdio.h (POSIX.1): Section 29.6.1 [Identifying the Controlling Terminal], page 884.
int L_cuserid
stdio.h (POSIX.1): Section 31.11 [Identifying Who Logged In], page 908.
int L_tmpnam
stdio.h (ISO): Section 14.11 [Temporary Files], page 455.
MADV_HUGEPAGE
sys/mman.h (Linux): Section 13.8 [Memory-mapped I/O], page 366.
MAP_HUGETLB
sys/mman.h (Linux): Section 13.8 [Memory-mapped I/O], page 366.
int MAXNAMLEN
dirent.h (BSD): Section 33.6 [Limits on File System Capacity], page 956.
int MAXSYMLINKS
sys/param.h (BSD): Section 14.5 [Symbolic Links], page 428.
int MAX_CANON
limits.h (POSIX.1): Section 33.6 [Limits on File System Capacity], page 956.
int MAX_INPUT
limits.h (POSIX.1): Section 33.6 [Limits on File System Capacity], page 956.
int MB_CUR_MAX
stdlib.h (ISO): Section 6.3.1 [Selecting the conversion and its properties], page 147.
int MB_LEN_MAX
limits.h (ISO): Section 6.3.1 [Selecting the conversion and its properties], page 147.
tcflag_t MDMBUF
termios.h (BSD): Section 17.4.6 [Control Modes], page 521.
MFD_ALLOW_SEALING
sys/mman.h (Linux): Section 13.8 [Memory-mapped I/O], page 366.
MFD_CLOEXEC
sys/mman.h (Linux): Section 13.8 [Memory-mapped I/O], page 366.
MFD_HUGETLB
sys/mman.h (Linux): Section 13.8 [Memory-mapped I/O], page 366.
Appendix B: Summary of Library Facilities 1052
MLOCK_ONFAULT
sys/mman.h (Linux): Section 3.5.3 [Functions To Lock And Unlock Pages], page 84.
int MSG_DONTROUTE
sys/socket.h (BSD): Section 16.9.5.3 [Socket Data Options], page 496.
int MSG_OOB
sys/socket.h (BSD): Section 16.9.5.3 [Socket Data Options], page 496.
int MSG_PEEK
sys/socket.h (BSD): Section 16.9.5.3 [Socket Data Options], page 496.
int NAME_MAX
limits.h (POSIX.1): Section 33.6 [Limits on File System Capacity], page 956.
float NAN
math.h (GNU): Section 20.5.2 [Infinity and NaN], page 652.
int NCCS
termios.h (POSIX.1): Section 17.4.1 [Terminal Mode Data Types], page 515.
NEW_TIME
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
int NGROUPS_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
tcflag_t NOFLSH
termios.h (POSIX.1): Section 17.4.7 [Local Modes], page 522.
tcflag_t NOKERNINFO
termios.h optional (BSD): Section 17.4.7 [Local Modes], page 522.
NO_ADDRESS
netdb.h (BSD): Section 16.6.2.4 [Host Names], page 478.
NO_RECOVERY
netdb.h (BSD): Section 16.6.2.4 [Host Names], page 478.
int NSIG
signal.h (BSD): Section 25.2 [Standard Signals], page 768.
void * NULL
stddef.h (ISO): Section A.3 [Null Pointer Constant], page 1022.
OLD_TIME
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
ONCE_FLAG_INIT
threads.h (C11): Section 36.1.3 [Call Once], page 972.
tcflag_t ONLCR
termios.h (POSIX.1): Section 17.4.5 [Output Modes], page 520.
tcflag_t ONOEOT
termios.h optional (BSD): Section 17.4.5 [Output Modes], page 520.
int OPEN_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
tcflag_t OPOST
termios.h (POSIX.1): Section 17.4.5 [Output Modes], page 520.
Appendix B: Summary of Library Facilities 1053
OPTION_ALIAS
argp.h (GNU): Section 26.3.4.1 [Flags for Argp Options], page 823.
OPTION_ARG_OPTIONAL
argp.h (GNU): Section 26.3.4.1 [Flags for Argp Options], page 823.
OPTION_DOC
argp.h (GNU): Section 26.3.4.1 [Flags for Argp Options], page 823.
OPTION_HIDDEN
argp.h (GNU): Section 26.3.4.1 [Flags for Argp Options], page 823.
OPTION_NO_USAGE
argp.h (GNU): Section 26.3.4.1 [Flags for Argp Options], page 823.
tcflag_t OXTABS
termios.h optional (BSD): Section 17.4.5 [Output Modes], page 520.
int O_ACCMODE
fcntl.h (POSIX.1): Section 13.15.1 [File Access Modes], page 396.
int O_APPEND
fcntl.h (POSIX.1): Section 13.15.3 [I/O Operating Modes], page 399.
int O_ASYNC
fcntl.h (BSD): Section 13.15.3 [I/O Operating Modes], page 399.
int O_CREAT
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
int O_DIRECTORY
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
int O_EXCL
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
int O_EXEC
fcntl.h optional (GNU): Section 13.15.1 [File Access Modes], page 396.
int O_EXLOCK
fcntl.h optional (BSD): Section 13.15.2 [Open-time Flags], page 397.
int O_FSYNC
fcntl.h (BSD): Section 13.15.3 [I/O Operating Modes], page 399.
int O_IGNORE_CTTY
fcntl.h optional (GNU): Section 13.15.2 [Open-time Flags], page 397.
int O_NDELAY
fcntl.h (BSD): Section 13.15.3 [I/O Operating Modes], page 399.
int O_NOATIME
fcntl.h (GNU): Section 13.15.3 [I/O Operating Modes], page 399.
int O_NOCTTY
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
int O_NOFOLLOW
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
int O_NOLINK
fcntl.h optional (GNU): Section 13.15.2 [Open-time Flags], page 397.
int O_NONBLOCK
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
fcntl.h (POSIX.1): Section 13.15.3 [I/O Operating Modes], page 399.
Appendix B: Summary of Library Facilities 1054
int O_NOTRANS
fcntl.h optional (GNU): Section 13.15.2 [Open-time Flags], page 397.
int O_PATH
fcntl.h (Linux): Section 13.15.1 [File Access Modes], page 396.
int O_RDONLY
fcntl.h (POSIX.1): Section 13.15.1 [File Access Modes], page 396.
int O_RDWR
fcntl.h (POSIX.1): Section 13.15.1 [File Access Modes], page 396.
int O_READ
fcntl.h optional (GNU): Section 13.15.1 [File Access Modes], page 396.
int O_SHLOCK
fcntl.h optional (BSD): Section 13.15.2 [Open-time Flags], page 397.
int O_SYNC
fcntl.h (BSD): Section 13.15.3 [I/O Operating Modes], page 399.
int O_TMPFILE
fcntl.h (GNU): Section 13.15.2 [Open-time Flags], page 397.
int O_TRUNC
fcntl.h (POSIX.1): Section 13.15.2 [Open-time Flags], page 397.
int O_WRITE
fcntl.h optional (GNU): Section 13.15.1 [File Access Modes], page 396.
int O_WRONLY
fcntl.h (POSIX.1): Section 13.15.1 [File Access Modes], page 396.
tcflag_t PARENB
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
tcflag_t PARMRK
termios.h (POSIX.1): Section 17.4.4 [Input Modes], page 518.
tcflag_t PARODD
termios.h (POSIX.1): Section 17.4.6 [Control Modes], page 521.
int PATH_MAX
limits.h (POSIX.1): Section 33.6 [Limits on File System Capacity], page 956.
PA_CHAR
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_DOUBLE
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_FLAG_LONG
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_FLAG_LONG_DOUBLE
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_FLAG_LONG_LONG
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
int PA_FLAG_MASK
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_FLAG_PTR
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
Appendix B: Summary of Library Facilities 1055
PA_FLAG_SHORT
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_FLOAT
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_INT
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_LAST
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_POINTER
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
PA_STRING
printf.h (GNU): Section 12.12.10 [Parsing a Template String], page 307.
tcflag_t PENDIN
termios.h (BSD): Section 17.4.7 [Local Modes], page 522.
int PF_FILE
sys/socket.h (GNU): Section 16.5.2 [Details of Local Namespace], page 470.
int PF_INET
sys/socket.h (BSD): Section 16.6 [The Internet Namespace], page 472.
int PF_INET6
sys/socket.h (X/Open): Section 16.6 [The Internet Namespace], page 472.
int PF_LOCAL
sys/socket.h (POSIX): Section 16.5.2 [Details of Local Namespace], page 470.
int PF_UNIX
sys/socket.h (BSD): Section 16.5.2 [Details of Local Namespace], page 470.
int PIPE_BUF
limits.h (POSIX.1): Section 33.6 [Limits on File System Capacity], page 956.
PKEY_DISABLE_ACCESS
sys/mman.h (Linux): Section 3.4 [Memory Protection], page 78.
PKEY_DISABLE_WRITE
sys/mman.h (Linux): Section 3.4 [Memory Protection], page 78.
POSIX_REC_INCR_XFER_SIZE
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
POSIX_REC_MAX_XFER_SIZE
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
POSIX_REC_MIN_XFER_SIZE
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
POSIX_REC_XFER_ALIGN
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
PRIO_MAX
sys/resource.h (BSD): Section 23.3.4.2 [Functions For Traditional Scheduling], page 749.
PRIO_MIN
sys/resource.h (BSD): Section 23.3.4.2 [Functions For Traditional Scheduling], page 749.
PRIO_PGRP
sys/resource.h (BSD): Section 23.3.4.2 [Functions For Traditional Scheduling], page 749.
Appendix B: Summary of Library Facilities 1056
PRIO_PROCESS
sys/resource.h (BSD): Section 23.3.4.2 [Functions For Traditional Scheduling], page 749.
PRIO_USER
sys/resource.h (BSD): Section 23.3.4.2 [Functions For Traditional Scheduling], page 749.
PROT_EXEC
sys/mman.h (POSIX): Section 3.4 [Memory Protection], page 78.
PROT_NONE
sys/mman.h (POSIX): Section 3.4 [Memory Protection], page 78.
PROT_READ
sys/mman.h (POSIX): Section 3.4 [Memory Protection], page 78.
PROT_WRITE
sys/mman.h (POSIX): Section 3.4 [Memory Protection], page 78.
PTRDIFF_WIDTH
stdint.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
char * P_tmpdir
stdio.h (SVID): Section 14.11 [Temporary Files], page 455.
int RAND_MAX
stdlib.h (ISO): Section 19.8.1 [ISO C Random Number Functions], page 634.
REG_BADBR
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_BADPAT
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_BADRPT
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_EBRACE
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_EBRACK
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_ECOLLATE
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_ECTYPE
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_EESCAPE
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_EPAREN
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_ERANGE
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
REG_ESPACE
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
regex.h (POSIX.2): Section 10.3.3 [Matching a Compiled POSIX Regular Expression],
page 255.
REG_ESUBREG
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
Appendix B: Summary of Library Facilities 1057
REG_EXTENDED
regex.h (POSIX.2): Section 10.3.2 [Flags for POSIX Regular Expressions], page 254.
REG_ICASE
regex.h (POSIX.2): Section 10.3.2 [Flags for POSIX Regular Expressions], page 254.
REG_NEWLINE
regex.h (POSIX.2): Section 10.3.2 [Flags for POSIX Regular Expressions], page 254.
REG_NOMATCH
regex.h (POSIX.2): Section 10.3.3 [Matching a Compiled POSIX Regular Expression],
page 255.
REG_NOSUB
regex.h (POSIX.2): Section 10.3.2 [Flags for POSIX Regular Expressions], page 254.
REG_NOTBOL
regex.h (POSIX.2): Section 10.3.3 [Matching a Compiled POSIX Regular Expression],
page 255.
REG_NOTEOL
regex.h (POSIX.2): Section 10.3.3 [Matching a Compiled POSIX Regular Expression],
page 255.
int RE_DUP_MAX
limits.h (POSIX.2): Section 33.1 [General Capacity Limits], page 943.
RLIMIT_AS
sys/resource.h (Unix98): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_CORE
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_CPU
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_DATA
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_FSIZE
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_MEMLOCK
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_NOFILE
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_NPROC
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_RSS
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIMIT_STACK
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
rlim_t RLIM_INFINITY
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
RLIM_NLIMITS
sys/resource.h (BSD): Section 23.2 [Limiting Resource Usage], page 737.
int RSEQ_SIG
sys/rseq.h (Linux): Section 36.2.2.5 [Restartable Sequences], page 982.
Appendix B: Summary of Library Facilities 1058
RUN_LVL
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
RUSAGE_CHILDREN
sys/resource.h (BSD): Section 23.1 [Resource Usage], page 736.
RUSAGE_SELF
sys/resource.h (BSD): Section 23.1 [Resource Usage], page 736.
int R_OK
unistd.h (POSIX.1): Section 14.9.8 [Testing Permission to Access a File], page 447.
int SA_NOCLDSTOP
signal.h (POSIX.1): Section 25.3.5 [Flags for sigaction], page 782.
int SA_ONSTACK
signal.h (BSD): Section 25.3.5 [Flags for sigaction], page 782.
int SA_RESTART
signal.h (BSD): Section 25.3.5 [Flags for sigaction], page 782.
SCHAR_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
SCHAR_MIN
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
SCHAR_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
int SEEK_CUR
stdio.h (ISO): Section 12.18 [File Positioning], page 328.
int SEEK_END
stdio.h (ISO): Section 12.18 [File Positioning], page 328.
int SEEK_SET
stdio.h (ISO): Section 12.18 [File Positioning], page 328.
SHRT_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
SHRT_MIN
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
SHRT_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
int SIGABRT
signal.h (ISO): Section 25.2.1 [Program Error Signals], page 768.
int SIGALRM
signal.h (POSIX.1): Section 25.2.3 [Alarm Signals], page 772.
int SIGBUS
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
int SIGCHLD
signal.h (POSIX.1): Section 25.2.5 [Job Control Signals], page 773.
int SIGCLD
signal.h (SVID): Section 25.2.5 [Job Control Signals], page 773.
Appendix B: Summary of Library Facilities 1059
int SIGCONT
signal.h (POSIX.1): Section 25.2.5 [Job Control Signals], page 773.
int SIGEMT
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
int SIGFPE
signal.h (ISO): Section 25.2.1 [Program Error Signals], page 768.
int SIGHUP
signal.h (POSIX.1): Section 25.2.2 [Termination Signals], page 771.
int SIGILL
signal.h (ISO): Section 25.2.1 [Program Error Signals], page 768.
int SIGINFO
signal.h (BSD): Section 25.2.7 [Miscellaneous Signals], page 775.
int SIGINT
signal.h (ISO): Section 25.2.2 [Termination Signals], page 771.
int SIGIO
signal.h (BSD): Section 25.2.4 [Asynchronous I/O Signals], page 772.
int SIGIOT
signal.h (Unix): Section 25.2.1 [Program Error Signals], page 768.
int SIGKILL
signal.h (POSIX.1): Section 25.2.2 [Termination Signals], page 771.
int SIGLOST
signal.h (GNU): Section 25.2.6 [Operation Error Signals], page 774.
int SIGPIPE
signal.h (POSIX.1): Section 25.2.6 [Operation Error Signals], page 774.
int SIGPOLL
signal.h (SVID): Section 25.2.4 [Asynchronous I/O Signals], page 772.
int SIGPROF
signal.h (BSD): Section 25.2.3 [Alarm Signals], page 772.
int SIGQUIT
signal.h (POSIX.1): Section 25.2.2 [Termination Signals], page 771.
int SIGSEGV
signal.h (ISO): Section 25.2.1 [Program Error Signals], page 768.
int SIGSTOP
signal.h (POSIX.1): Section 25.2.5 [Job Control Signals], page 773.
int SIGSYS
signal.h (Unix): Section 25.2.1 [Program Error Signals], page 768.
int SIGTERM
signal.h (ISO): Section 25.2.2 [Termination Signals], page 771.
int SIGTRAP
signal.h (BSD): Section 25.2.1 [Program Error Signals], page 768.
int SIGTSTP
signal.h (POSIX.1): Section 25.2.5 [Job Control Signals], page 773.
Appendix B: Summary of Library Facilities 1060
int SIGTTIN
signal.h (POSIX.1): Section 25.2.5 [Job Control Signals], page 773.
int SIGTTOU
signal.h (POSIX.1): Section 25.2.5 [Job Control Signals], page 773.
int SIGURG
signal.h (BSD): Section 25.2.4 [Asynchronous I/O Signals], page 772.
int SIGUSR1
signal.h (POSIX.1): Section 25.2.7 [Miscellaneous Signals], page 775.
int SIGUSR2
signal.h (POSIX.1): Section 25.2.7 [Miscellaneous Signals], page 775.
int SIGVTALRM
signal.h (BSD): Section 25.2.3 [Alarm Signals], page 772.
int SIGWINCH
signal.h (BSD): Section 25.2.7 [Miscellaneous Signals], page 775.
int SIGXCPU
signal.h (BSD): Section 25.2.6 [Operation Error Signals], page 774.
int SIGXFSZ
signal.h (BSD): Section 25.2.6 [Operation Error Signals], page 774.
SIG_ATOMIC_WIDTH
stdint.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
SIG_BLOCK
signal.h (POSIX.1): Section 25.7.3 [Process Signal Mask], page 800.
sighandler_t SIG_ERR
signal.h (ISO): Section 25.3.1 [Basic Signal Handling], page 777.
SIG_SETMASK
signal.h (POSIX.1): Section 25.7.3 [Process Signal Mask], page 800.
SIG_UNBLOCK
signal.h (POSIX.1): Section 25.7.3 [Process Signal Mask], page 800.
SIZE_WIDTH
stdint.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
double SNAN
math.h (TS 18661-1:2014): Section 20.5.2 [Infinity and NaN], page 652.
float SNANF
math.h (TS 18661-1:2014): Section 20.5.2 [Infinity and NaN], page 652.
_FloatN SNANFN
math.h (TS 18661-3:2015): Section 20.5.2 [Infinity and NaN], page 652.
_FloatNx SNANFNx
math.h (TS 18661-3:2015): Section 20.5.2 [Infinity and NaN], page 652.
long double SNANL
math.h (TS 18661-1:2014): Section 20.5.2 [Infinity and NaN], page 652.
int SOCK_DGRAM
sys/socket.h (BSD): Section 16.2 [Communication Styles], page 465.
int SOCK_RAW
sys/socket.h (BSD): Section 16.2 [Communication Styles], page 465.
Appendix B: Summary of Library Facilities 1061
int SOCK_STREAM
sys/socket.h (BSD): Section 16.2 [Communication Styles], page 465.
int SOL_SOCKET
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_BROADCAST
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_DEBUG
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_DONTROUTE
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_ERROR
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_KEEPALIVE
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_LINGER
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_OOBINLINE
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_RCVBUF
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_REUSEADDR
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_SNDBUF
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
SO_STYLE
sys/socket.h (GNU): Section 16.12.2 [Socket-Level Options], page 509.
SO_TYPE
sys/socket.h (BSD): Section 16.12.2 [Socket-Level Options], page 509.
ssize_t SSIZE_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
STDERR_FILENO
unistd.h (POSIX.1): Section 13.4 [Descriptors and Streams], page 358.
STDIN_FILENO
unistd.h (POSIX.1): Section 13.4 [Descriptors and Streams], page 358.
STDOUT_FILENO
unistd.h (POSIX.1): Section 13.4 [Descriptors and Streams], page 358.
int STREAM_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
int SUN_LEN (struct sockaddr_un * ptr)
sys/un.h (BSD): Section 16.5.2 [Details of Local Namespace], page 470.
SYMLINK_MAX
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
S_IEXEC
sys/stat.h (BSD): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
Appendix B: Summary of Library Facilities 1062
S_IFBLK
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IFCHR
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IFDIR
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IFIFO
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IFLNK
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
int S_IFMT
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IFREG
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IFSOCK
sys/stat.h (BSD): Section 14.9.3 [Testing the Type of a File], page 440.
S_IREAD
sys/stat.h (BSD): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
S_IRGRP
sys/stat.h (POSIX.1): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
S_IROTH
sys/stat.h (POSIX.1): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
S_IRUSR
sys/stat.h (POSIX.1): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
S_IRWXG
sys/stat.h (POSIX.1): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
S_IRWXO
sys/stat.h (POSIX.1): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
S_IRWXU
sys/stat.h (POSIX.1): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
int S_ISBLK (mode_t m)
sys/stat.h (POSIX): Section 14.9.3 [Testing the Type of a File], page 440.
int S_ISCHR (mode_t m)
sys/stat.h (POSIX): Section 14.9.3 [Testing the Type of a File], page 440.
int S_ISDIR (mode_t m)
sys/stat.h (POSIX): Section 14.9.3 [Testing the Type of a File], page 440.
int S_ISFIFO (mode_t m)
sys/stat.h (POSIX): Section 14.9.3 [Testing the Type of a File], page 440.
S_ISGID
sys/stat.h (POSIX): Section 14.9.5 [The Mode Bits for Access Permission], page 443.
int S_ISLNK (mode_t m)
sys/stat.h (GNU): Section 14.9.3 [Testing the Type of a File], page 440.
Appendix B: Summary of Library Facilities 1063
TRY_AGAIN
netdb.h (BSD): Section 16.6.2.4 [Host Names], page 478.
TSS_DTOR_ITERATIONS
threads.h (C11): Section 36.1.6 [Thread-local Storage], page 976.
int TZNAME_MAX
limits.h (POSIX.1): Section 33.1 [General Capacity Limits], page 943.
UCHAR_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
UCHAR_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
UINTPTR_WIDTH
stdint.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
UINT_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
UINT_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
ULLONG_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
ULLONG_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
ULONG_LONG_MAX
limits.h (GNU): Section A.5.2 [Range of an Integer Type], page 1025.
ULONG_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
ULONG_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
USER_PROCESS
utmp.h (SVID): Section 31.12.1 [Manipulating the User Accounting Database], page 909.
utmpx.h (XPG4.2): Section 31.12.2 [XPG User Accounting Database Functions], page 914.
USHRT_MAX
limits.h (ISO): Section A.5.2 [Range of an Integer Type], page 1025.
USHRT_WIDTH
limits.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
int VDISCARD
termios.h (BSD): Section 17.4.9.4 [Other Special Characters], page 530.
int VDSUSP
termios.h (BSD): Section 17.4.9.2 [Characters that Cause Signals], page 528.
int VEOF
termios.h (POSIX.1): Section 17.4.9.1 [Characters for Input Editing], page 527.
int VEOL
termios.h (POSIX.1): Section 17.4.9.1 [Characters for Input Editing], page 527.
int VEOL2
termios.h (BSD): Section 17.4.9.1 [Characters for Input Editing], page 527.
Appendix B: Summary of Library Facilities 1065
int VERASE
termios.h (POSIX.1): Section 17.4.9.1 [Characters for Input Editing], page 527.
int VINTR
termios.h (POSIX.1): Section 17.4.9.2 [Characters that Cause Signals], page 528.
int VKILL
termios.h (POSIX.1): Section 17.4.9.1 [Characters for Input Editing], page 527.
int VLNEXT
termios.h (BSD): Section 17.4.9.4 [Other Special Characters], page 530.
int VMIN
termios.h (POSIX.1): Section 17.4.10 [Noncanonical Input], page 531.
int VQUIT
termios.h (POSIX.1): Section 17.4.9.2 [Characters that Cause Signals], page 528.
int VREPRINT
termios.h (BSD): Section 17.4.9.1 [Characters for Input Editing], page 527.
int VSTART
termios.h (POSIX.1): Section 17.4.9.3 [Special Characters for Flow Control], page 529.
int VSTATUS
termios.h (BSD): Section 17.4.9.4 [Other Special Characters], page 530.
int VSTOP
termios.h (POSIX.1): Section 17.4.9.3 [Special Characters for Flow Control], page 529.
int VSUSP
termios.h (POSIX.1): Section 17.4.9.2 [Characters that Cause Signals], page 528.
int VTIME
termios.h (POSIX.1): Section 17.4.10 [Noncanonical Input], page 531.
int VWERASE
termios.h (BSD): Section 17.4.9.1 [Characters for Input Editing], page 527.
WCHAR_MAX
limits.h (GNU): Section A.5.2 [Range of an Integer Type], page 1025.
wint_t WCHAR_MAX
wchar.h (ISO): Section 6.1 [Introduction to Extended Characters], page 143.
wint_t WCHAR_MIN
wchar.h (ISO): Section 6.1 [Introduction to Extended Characters], page 143.
WCHAR_WIDTH
stdint.h (ISO): Section A.5.1 [Width of an Integer Type], page 1024.
int WCOREDUMP (int status)
sys/wait.h (BSD): Section 27.8 [Process Completion Status], page 865.
int WEOF
wchar.h (ISO): Section 12.15 [End-Of-File and Errors], page 326.
wint_t WEOF
wchar.h (ISO): Section 6.1 [Introduction to Extended Characters], page 143.
int WEXITSTATUS (int status)
sys/wait.h (POSIX.1): Section 27.8 [Process Completion Status], page 865.
Appendix B: Summary of Library Facilities 1066
_CS_LFS64_LIBS
unistd.h (Unix98): Section 33.12 [String-Valued Parameters], page 963.
_CS_LFS64_LINTFLAGS
unistd.h (Unix98): Section 33.12 [String-Valued Parameters], page 963.
_CS_LFS_CFLAGS
unistd.h (Unix98): Section 33.12 [String-Valued Parameters], page 963.
_CS_LFS_LDFLAGS
unistd.h (Unix98): Section 33.12 [String-Valued Parameters], page 963.
_CS_LFS_LIBS
unistd.h (Unix98): Section 33.12 [String-Valued Parameters], page 963.
_CS_LFS_LINTFLAGS
unistd.h (Unix98): Section 33.12 [String-Valued Parameters], page 963.
_CS_PATH
unistd.h (POSIX.2): Section 33.12 [String-Valued Parameters], page 963.
const float complex _Complex_I
complex.h (C99): Section 20.9 [Complex Numbers], page 679.
_DEFAULT_SOURCE
no header (GNU): Section 1.3.4 [Feature Test Macros], page 16.
_DYNAMIC_STACK_SIZE_SOURCE
no header (GNU): Section 1.3.4 [Feature Test Macros], page 16.
void _Exit (int status)
stdlib.h (ISO): Section 26.7.5 [Termination Internals], page 854.
_FILE_OFFSET_BITS
no header (X/Open): Section 1.3.4 [Feature Test Macros], page 16.
_FORTIFY_SOURCE
no header (GNU): Section 1.3.4 [Feature Test Macros], page 16.
pid_t _Fork (void)
unistd.h (GNU): Section 27.4 [Creating a Process], page 857.
_GNU_SOURCE
no header (GNU): Section 1.3.4 [Feature Test Macros], page 16.
int _IOFBF
stdio.h (ISO): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
int _IOLBF
stdio.h (ISO): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
int _IONBF
stdio.h (ISO): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
_ISOC11_SOURCE
no header (C11): Section 1.3.4 [Feature Test Macros], page 16.
_ISOC23_SOURCE
no header (C23): Section 1.3.4 [Feature Test Macros], page 16.
_ISOC99_SOURCE
no header (GNU): Section 1.3.4 [Feature Test Macros], page 16.
_LARGEFILE64_SOURCE
no header (X/Open): Section 1.3.4 [Feature Test Macros], page 16.
_LARGEFILE_SOURCE
no header (X/Open): Section 1.3.4 [Feature Test Macros], page 16.
Appendix B: Summary of Library Facilities 1068
_PC_ASYNC_IO
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_CHOWN_RESTRICTED
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_FILESIZEBITS
unistd.h (LFS): Section 33.9 [Using pathconf], page 959.
_PC_LINK_MAX
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_MAX_CANON
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_MAX_INPUT
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_NAME_MAX
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_NO_TRUNC
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_PATH_MAX
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_PIPE_BUF
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_PRIO_IO
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_REC_INCR_XFER_SIZE
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_REC_MAX_XFER_SIZE
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_REC_MIN_XFER_SIZE
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_REC_XFER_ALIGN
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_SYNC_IO
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_PC_VDISABLE
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
_POSIX2_BC_BASE_MAX
limits.h (POSIX.2): Section 33.11 [Minimum Values for Utility Limits], page 962.
_POSIX2_BC_DIM_MAX
limits.h (POSIX.2): Section 33.11 [Minimum Values for Utility Limits], page 962.
_POSIX2_BC_SCALE_MAX
limits.h (POSIX.2): Section 33.11 [Minimum Values for Utility Limits], page 962.
_POSIX2_BC_STRING_MAX
limits.h (POSIX.2): Section 33.11 [Minimum Values for Utility Limits], page 962.
_POSIX2_COLL_WEIGHTS_MAX
limits.h (POSIX.2): Section 33.11 [Minimum Values for Utility Limits], page 962.
int _POSIX2_C_DEV
unistd.h (POSIX.2): Section 33.2 [Overall System Options], page 944.
Appendix B: Summary of Library Facilities 1069
_POSIX_PATH_MAX
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
_POSIX_PIPE_BUF
limits.h (POSIX.1): Section 33.8 [Minimum Values for File System Limits], page 958.
int _POSIX_SAVED_IDS
unistd.h (POSIX.1): Section 33.2 [Overall System Options], page 944.
_POSIX_SOURCE
no header (POSIX.1): Section 1.3.4 [Feature Test Macros], page 16.
_POSIX_SSIZE_MAX
limits.h (POSIX.1): Section 33.5 [Minimum Values for General Capacity Limits], page 955.
_POSIX_STREAM_MAX
limits.h (POSIX.1): Section 33.5 [Minimum Values for General Capacity Limits], page 955.
_POSIX_TZNAME_MAX
limits.h (POSIX.1): Section 33.5 [Minimum Values for General Capacity Limits], page 955.
unsigned char _POSIX_VDISABLE
unistd.h (POSIX.1): Section 33.7 [Optional Features in File Support], page 958.
long int _POSIX_VERSION
unistd.h (POSIX.1): Section 33.3 [Which Version of POSIX is Supported], page 945.
_REENTRANT
no header (Obsolete): Section 1.3.4 [Feature Test Macros], page 16.
_SC_2_C_DEV
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_2_FORT_DEV
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_2_FORT_RUN
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_2_LOCALEDEF
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_2_SW_DEV
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_2_VERSION
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_AIO_LISTIO_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_AIO_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_AIO_PRIO_DELTA_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_ARG_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_ASYNCHRONOUS_IO
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_ATEXIT_MAX
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_AVPHYS_PAGES
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
Appendix B: Summary of Library Facilities 1071
_SC_BC_BASE_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_BC_DIM_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_BC_SCALE_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_BC_STRING_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_CHARCLASS_NAME_MAX
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_CHAR_BIT
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_CHAR_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_CHAR_MIN
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_CHILD_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_CLK_TCK
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_COLL_WEIGHTS_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_DELAYTIMER_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_EQUIV_CLASS_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_EXPR_NEST_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_FSYNC
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_GETGR_R_SIZE_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_GETPW_R_SIZE_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_INT_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_INT_MIN
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_JOB_CONTROL
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL1_DCACHE_ASSOC
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL1_DCACHE_LINESIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL1_DCACHE_SIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
Appendix B: Summary of Library Facilities 1072
_SC_LEVEL1_ICACHE_ASSOC
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL1_ICACHE_LINESIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL1_ICACHE_SIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL2_CACHE_ASSOC
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL2_CACHE_LINESIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL2_CACHE_SIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL3_CACHE_ASSOC
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL3_CACHE_LINESIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL3_CACHE_SIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL4_CACHE_ASSOC
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL4_CACHE_LINESIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LEVEL4_CACHE_SIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LINE_MAX
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LOGIN_NAME_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_LONG_BIT
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MAPPED_FILES
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MB_LEN_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MEMLOCK
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MEMLOCK_RANGE
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MEMORY_PROTECTION
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MESSAGE_PASSING
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MINSIGSTKSZ
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_MQ_OPEN_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
Appendix B: Summary of Library Facilities 1073
_SC_MQ_PRIO_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NGROUPS_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NL_ARGMAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NL_LANGMAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NL_MSGMAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NL_NMAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NL_SETMAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NL_TEXTMAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NPROCESSORS_CONF
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NPROCESSORS_ONLN
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_NZERO
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_OPEN_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PAGESIZE
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PHYS_PAGES
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_INTERNET
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_INTERNET_DGRAM
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_INTERNET_STREAM
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_OSI
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_OSI_CLTS
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_OSI_COTS
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_OSI_M
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PII_SOCKET
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
Appendix B: Summary of Library Facilities 1074
_SC_PII_XTI
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PRIORITIZED_IO
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_PRIORITY_SCHEDULING
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_REALTIME_SIGNALS
unistdh.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_RTSIG_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SAVED_IDS
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SCHAR_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SCHAR_MIN
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SELECT
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SEMAPHORES
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SEM_NSEMS_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SEM_VALUE_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SHARED_MEMORY_OBJECTS
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SHRT_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SHRT_MIN
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SIGQUEUE_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SIGSTKSZ
unistd.h (GNU): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SSIZE_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_STREAM_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_SYNCHRONIZED_IO
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREADS
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_ATTR_STACKADDR
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_ATTR_STACKSIZE
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
Appendix B: Summary of Library Facilities 1075
_SC_THREAD_DESTRUCTOR_ITERATIONS
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_KEYS_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_PRIORITY_SCHEDULING
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_PRIO_INHERIT
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_PRIO_PROTECT
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_PROCESS_SHARED
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_SAFE_FUNCTIONS
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_STACK_MIN
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_THREAD_THREADS_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_TIMERS
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_TIMER_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_TTY_NAME_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_TZNAME_MAX
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_T_IOV_MAX
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_UCHAR_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_UINT_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_UIO_MAXIOV
unistd.h (POSIX.1g): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_ULONG_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_USHRT_MAX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_VERSION
unistd.h (POSIX.1): Section 33.4.2 [Constants for sysconf Parameters], page 946.
unistd.h (POSIX.2): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_WORD_BIT
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_CRYPT
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_ENH_I18N
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
Appendix B: Summary of Library Facilities 1076
_SC_XOPEN_LEGACY
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_REALTIME
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_REALTIME_THREADS
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_SHM
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_UNIX
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_VERSION
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_XCU_VERSION
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_XPG2
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_XPG3
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_SC_XOPEN_XPG4
unistd.h (X/Open): Section 33.4.2 [Constants for sysconf Parameters], page 946.
_THREAD_SAFE
no header (Obsolete): Section 1.3.4 [Feature Test Macros], page 16.
_XOPEN_SOURCE
no header (X/Open): Section 1.3.4 [Feature Test Macros], page 16.
_XOPEN_SOURCE_EXTENDED
no header (X/Open): Section 1.3.4 [Feature Test Macros], page 16.
__STDC_WANT_IEC_60559_BFP_EXT__
no header (ISO): Section 1.3.4 [Feature Test Macros], page 16.
__STDC_WANT_IEC_60559_EXT__
no header (ISO): Section 1.3.4 [Feature Test Macros], page 16.
__STDC_WANT_IEC_60559_FUNCS_EXT__
no header (ISO): Section 1.3.4 [Feature Test Macros], page 16.
__STDC_WANT_IEC_60559_TYPES_EXT__
no header (ISO): Section 1.3.4 [Feature Test Macros], page 16.
__STDC_WANT_LIB_EXT2__
no header (ISO): Section 1.3.4 [Feature Test Macros], page 16.
size_t __fbufsize (FILE *stream)
stdio_ext.h (GNU): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
int __flbf (FILE *stream)
stdio_ext.h (GNU): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
size_t __fpending (FILE *stream)
stdio_ext.h (GNU): Section 12.20.3 [Controlling Which Kind of Buffering], page 335.
void __fpurge (FILE *stream)
stdio_ext.h (GNU): Section 12.20.2 [Flushing Buffers], page 334.
int __freadable (FILE *stream)
stdio_ext.h (GNU): Section 12.3 [Opening Streams], page 271.
Appendix B: Summary of Library Facilities 1077
struct argp
argp.h (GNU): Section 26.3.3 [Specifying Argp Parsers], page 821.
struct argp_child
argp.h (GNU): Section 26.3.6 [Combining Multiple Argp Parsers], page 830.
error_t argp_err_exit_status
argp.h (GNU): Section 26.3.2 [Argp Global Variables], page 821.
void argp_error (const struct argp_state *state, const char *fmt, ...)
argp.h (GNU): Section 26.3.5.3 [Functions For Use in Argp Parsers], page 828.
void argp_failure (const struct argp_state *state, int status, int errnum, const char *fmt, ...)
argp.h (GNU): Section 26.3.5.3 [Functions For Use in Argp Parsers], page 828.
void argp_help (const struct argp *argp, FILE *stream, unsigned flags, char *name)
argp.h (GNU): Section 26.3.9 [The argp_help Function], page 832.
struct argp_option
argp.h (GNU): Section 26.3.4 [Specifying Options in an Argp Parser], page 822.
error_t argp_parse (const struct argp *argp, int argc, char **argv, unsigned flags, int
*arg_index, void *input)
argp.h (GNU): Section 26.3 [Parsing Program Options with Argp], page 820.
const char * argp_program_bug_address
argp.h (GNU): Section 26.3.2 [Argp Global Variables], page 821.
const char * argp_program_version
argp.h (GNU): Section 26.3.2 [Argp Global Variables], page 821.
argp_program_version_hook
argp.h (GNU): Section 26.3.2 [Argp Global Variables], page 821.
struct argp_state
argp.h (GNU): Section 26.3.5.2 [Argp Parsing State], page 827.
void argp_state_help (const struct argp_state *state, FILE *stream, unsigned flags)
argp.h (GNU): Section 26.3.5.3 [Functions For Use in Argp Parsers], page 828.
void argp_usage (const struct argp_state *state)
argp.h (GNU): Section 26.3.5.3 [Functions For Use in Argp Parsers], page 828.
error_t argz_add (char **argz, size_t *argz_len, const char *str)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
error_t argz_add_sep (char **argz, size_t *argz_len, const char *str, int delim)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
error_t argz_append (char **argz, size_t *argz_len, const char *buf, size_t buf_len)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
size_t argz_count (const char *argz, size_t argz_len)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
error_t argz_create (char *const argv[], char **argz, size_t *argz_len)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
error_t argz_create_sep (const char *string, int sep, char **argz, size_t *argz_len)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
void argz_delete (char **argz, size_t *argz_len, char *entry)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
void argz_extract (const char *argz, size_t argz_len, char **argv)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
error_t argz_insert (char **argz, size_t *argz_len, char *before, const char *entry)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
Appendix B: Summary of Library Facilities 1081
char * argz_next (const char *argz, size_t argz_len, const char *entry)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
error_t argz_replace (char **argz, size_t *argz_len, const char *str, const char *with,
unsigned *replace_count)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
void argz_stringify (char *argz, size_t len, int sep)
argz.h (GNU): Section 5.15.1 [Argz Functions], page 138.
char * asctime (const struct tm *brokentime)
time.h (ISO): Section 22.5.4 [Formatting Calendar Time], page 713.
char * asctime_r (const struct tm *brokentime, char *buffer)
time.h (???): Section 22.5.4 [Formatting Calendar Time], page 713.
double asin (double x)
math.h (ISO): Section 19.3 [Inverse Trigonometric Functions], page 553.
float asinf (float x)
math.h (ISO): Section 19.3 [Inverse Trigonometric Functions], page 553.
_FloatN asinfN (_FloatN x)
math.h (TS 18661-3:2015): Section 19.3 [Inverse Trigonometric Functions], page 553.
_FloatNx asinfNx (_FloatNx x)
math.h (TS 18661-3:2015): Section 19.3 [Inverse Trigonometric Functions], page 553.
double asinh (double x)
math.h (ISO): Section 19.5 [Hyperbolic Functions], page 562.
float asinhf (float x)
math.h (ISO): Section 19.5 [Hyperbolic Functions], page 562.
_FloatN asinhfN (_FloatN x)
math.h (TS 18661-3:2015): Section 19.5 [Hyperbolic Functions], page 562.
_FloatNx asinhfNx (_FloatNx x)
math.h (TS 18661-3:2015): Section 19.5 [Hyperbolic Functions], page 562.
long double asinhl (long double x)
math.h (ISO): Section 19.5 [Hyperbolic Functions], page 562.
long double asinl (long double x)
math.h (ISO): Section 19.3 [Inverse Trigonometric Functions], page 553.
int asprintf (char **ptr, const char *template, ...)
stdio.h (GNU): Section 12.12.8 [Dynamically Allocating Formatted Output], page 303.
void assert (int expression)
assert.h (ISO): Section A.1 [Explicitly Checking Internal Consistency], page 1016.
void assert_perror (int errnum)
assert.h (GNU): Section A.1 [Explicitly Checking Internal Consistency], page 1016.
double atan (double x)
math.h (ISO): Section 19.3 [Inverse Trigonometric Functions], page 553.
double atan2 (double y, double x)
math.h (ISO): Section 19.3 [Inverse Trigonometric Functions], page 553.
float atan2f (float y, float x)
math.h (ISO): Section 19.3 [Inverse Trigonometric Functions], page 553.
_FloatN atan2fN (_FloatN y, _FloatN x)
math.h (TS 18661-3:2015): Section 19.3 [Inverse Trigonometric Functions], page 553.
_FloatNx atan2fNx (_FloatNx y, _FloatNx x)
math.h (TS 18661-3:2015): Section 19.3 [Inverse Trigonometric Functions], page 553.
Appendix B: Summary of Library Facilities 1082
div_t
stdlib.h (ISO): Section 20.2 [Integer Division], page 645.
struct dl_find_object
dlfcn.h (GNU): Section 37.2 [Dynamic Linker Introspection], page 989.
double dmull (long double x, long double y)
math.h (TS 18661-1:2014): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
char * dngettext (const char *domain, const char *msgid1, const char *msgid2, unsigned long int
n)
libintl.h (GNU): Section 8.2.1.3 [Additional functions for more complicated situations],
page 220.
double drand48 (void)
stdlib.h (SVID): Section 19.8.3 [SVID Random Number Function], page 637.
int drand48_r (struct drand48_data *buffer, double *result)
stdlib.h (GNU): Section 19.8.3 [SVID Random Number Function], page 637.
double drem (double numerator, double denominator)
math.h (BSD): Section 20.8.4 [Remainder Functions], page 667.
float dremf (float numerator, float denominator)
math.h (BSD): Section 20.8.4 [Remainder Functions], page 667.
long double dreml (long double numerator, long double denominator)
math.h (BSD): Section 20.8.4 [Remainder Functions], page 667.
double dsqrtl (long double x)
math.h (TS 18661-1:2014): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
double dsubl (long double x, long double y)
math.h (TS 18661-1:2014): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
int dup (int old)
unistd.h (POSIX.1): Section 13.13 [Duplicating Descriptors], page 392.
int dup2 (int old, int new)
unistd.h (POSIX.1): Section 13.13 [Duplicating Descriptors], page 392.
int dup3 (int old, int new, int flags)
unistd.h (Linux): Section 13.13 [Duplicating Descriptors], page 392.
char * ecvt (double value, int ndigit, int *decpt, int *neg)
stdlib.h (SVID): Section 20.13 [Old-fashioned System V number-to-string functions],
page 689.
stdlib.h (Unix98): Section 20.13 [Old-fashioned System V number-to-string functions],
page 689.
int ecvt_r (double value, int ndigit, int *decpt, int *neg, char *buf, size_t len)
stdlib.h (GNU): Section 20.13 [Old-fashioned System V number-to-string functions],
page 689.
void endfsent (void)
fstab.h (BSD): Section 32.3.1.1 [The fstab file], page 932.
void endgrent (void)
grp.h (SVID): Section 31.14.3 [Scanning the List of All Groups], page 922.
grp.h (BSD): Section 31.14.3 [Scanning the List of All Groups], page 922.
void endhostent (void)
netdb.h (BSD): Section 16.6.2.4 [Host Names], page 478.
int endmntent (FILE *stream)
mntent.h (BSD): Section 32.3.1.2 [The mtab file], page 935.
Appendix B: Summary of Library Facilities 1094
fd_set
sys/types.h (BSD): Section 13.9 [Waiting for Input or Output], page 374.
int fdatasync (int fildes)
unistd.h (POSIX): Section 13.10 [Synchronizing I/O operations], page 377.
double fdim (double x, double y)
math.h (ISO): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
float fdimf (float x, float y)
math.h (ISO): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
_FloatN fdimfN (_FloatN x, _FloatN y)
math.h (TS 18661-3:2015): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
_FloatNx fdimfNx (_FloatNx x, _FloatNx y)
math.h (TS 18661-3:2015): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
long double fdiml (long double x, long double y)
math.h (ISO): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
float fdiv (double x, double y)
math.h (TS 18661-1:2014): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
float fdivl (long double x, long double y)
math.h (TS 18661-1:2014): Section 20.8.7 [Miscellaneous FP arithmetic functions], page 674.
FILE * fdopen (int filedes, const char *opentype)
stdio.h (POSIX.1): Section 13.4 [Descriptors and Streams], page 358.
DIR * fdopendir (int fd)
dirent.h (GNU): Section 14.2.2 [Opening a Directory Stream], page 415.
int feclearexcept (int excepts)
fenv.h (ISO): Section 20.5.3 [Examining the FPU status word], page 653.
int fedisableexcept (int excepts)
fenv.h (GNU): Section 20.7 [Floating-Point Control Functions], page 658.
int feenableexcept (int excepts)
fenv.h (GNU): Section 20.7 [Floating-Point Control Functions], page 658.
int fegetenv (fenv_t *envp)
fenv.h (ISO): Section 20.7 [Floating-Point Control Functions], page 658.
int fegetexcept (void)
fenv.h (GNU): Section 20.7 [Floating-Point Control Functions], page 658.
int fegetexceptflag (fexcept_t *flagp, int excepts)
fenv.h (ISO): Section 20.5.3 [Examining the FPU status word], page 653.
int fegetmode (femode_t *modep)
fenv.h (ISO): Section 20.7 [Floating-Point Control Functions], page 658.
int fegetround (void)
fenv.h (ISO): Section 20.6 [Rounding Modes], page 656.
int feholdexcept (fenv_t *envp)
fenv.h (ISO): Section 20.7 [Floating-Point Control Functions], page 658.
int feof (FILE *stream)
stdio.h (ISO): Section 12.15 [End-Of-File and Errors], page 326.
int feof_unlocked (FILE *stream)
stdio.h (GNU): Section 12.15 [End-Of-File and Errors], page 326.
int feraiseexcept (int excepts)
fenv.h (ISO): Section 20.5.3 [Examining the FPU status word], page 653.
Appendix B: Summary of Library Facilities 1100
int fnmatch (const char *pattern, const char *string, int flags)
fnmatch.h (POSIX.2): Section 10.1 [Wildcard Matching], page 243.
FILE * fopen (const char *filename, const char *opentype)
stdio.h (ISO): Section 12.3 [Opening Streams], page 271.
FILE * fopen64 (const char *filename, const char *opentype)
stdio.h (Unix98): Section 12.3 [Opening Streams], page 271.
FILE * fopencookie (void *cookie, const char *opentype, cookie_io_functions_t io-functions)
stdio.h (GNU): Section 12.21.2.1 [Custom Streams and Cookies], page 340.
pid_t fork (void)
unistd.h (POSIX.1): Section 27.4 [Creating a Process], page 857.
int forkpty (int *amaster, char *name, const struct termios *termp, const struct winsize *winp)
pty.h (BSD): Section 17.9.2 [Opening a Pseudo-Terminal Pair], page 540.
long int fpathconf (int filedes, int parameter)
unistd.h (POSIX.1): Section 33.9 [Using pathconf], page 959.
int fpclassify (float-type x)
math.h (ISO): Section 20.4 [Floating-Point Number Classification Functions], page 648.
fpos64_t
stdio.h (Unix98): Section 12.19 [Portable File-Position Functions], page 331.
fpos_t
stdio.h (ISO): Section 12.19 [Portable File-Position Functions], page 331.
int fprintf (FILE *stream, const char *template, ...)
stdio.h (ISO): Section 12.12.7 [Formatted Output Functions], page 301.
int fputc (int c, FILE *stream)
stdio.h (ISO): Section 12.7 [Simple Output by Characters or Lines], page 281.
int fputc_unlocked (int c, FILE *stream)
stdio.h (POSIX): Section 12.7 [Simple Output by Characters or Lines], page 281.
int fputs (const char *s, FILE *stream)
stdio.h (ISO): Section 12.7 [Simple Output by Characters or Lines], page 281.
int fputs_unlocked (const char *s, FILE *stream)
stdio.h (GNU): Section 12.7 [Simple Output by Characters or Lines], page 281.
wint_t fputwc (wchar_t wc, FILE *stream)
wchar.h (ISO): Section 12.7 [Simple Output by Characters or Lines], page 281.
wint_t fputwc_unlocked (wchar_t wc, FILE *stream)
wchar.h (POSIX): Section 12.7 [Simple Output by Characters or Lines], page 281.
int fputws (const wchar_t *ws, FILE *stream)
wchar.h (ISO): Section 12.7 [Simple Output by Characters or Lines], page 281.
int fputws_unlocked (const wchar_t *ws, FILE *stream)
wchar.h (GNU): Section 12.7 [Simple Output by Characters or Lines], page 281.
size_t fread (void *data, size_t size, size_t count, FILE *stream)
stdio.h (ISO): Section 12.11 [Block Input/Output], page 291.
size_t fread_unlocked (void *data, size_t size, size_t count, FILE *stream)
stdio.h (GNU): Section 12.11 [Block Input/Output], page 291.
void free (void *ptr)
malloc.h (ISO): Section 3.2.3.3 [Freeing Memory Allocated with malloc], page 49.
stdlib.h (ISO): Section 3.2.3.3 [Freeing Memory Allocated with malloc], page 49.
Appendix B: Summary of Library Facilities 1106
FILE * freopen (const char *filename, const char *opentype, FILE *stream)
stdio.h (ISO): Section 12.3 [Opening Streams], page 271.
FILE * freopen64 (const char *filename, const char *opentype, FILE *stream)
stdio.h (Unix98): Section 12.3 [Opening Streams], page 271.
double frexp (double value, int *exponent)
math.h (ISO): Section 20.8.2 [Normalization Functions], page 661.
float frexpf (float value, int *exponent)
math.h (ISO): Section 20.8.2 [Normalization Functions], page 661.
_FloatN frexpfN (_FloatN value, int *exponent)
math.h (TS 18661-3:2015): Section 20.8.2 [Normalization Functions], page 661.
_FloatNx frexpfNx (_FloatNx value, int *exponent)
math.h (TS 18661-3:2015): Section 20.8.2 [Normalization Functions], page 661.
long double frexpl (long double value, int *exponent)
math.h (ISO): Section 20.8.2 [Normalization Functions], page 661.
intmax_t fromfp (double x, int round, unsigned int width)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpf (float x, int round, unsigned int width)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpfN (_FloatN x, int round, unsigned int width)
math.h (TS 18661-3:2015): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpfNx (_FloatNx x, int round, unsigned int width)
math.h (TS 18661-3:2015): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpl (long double x, int round, unsigned int width)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpx (double x, int round, unsigned int width)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpxf (float x, int round, unsigned int width)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpxfN (_FloatN x, int round, unsigned int width)
math.h (TS 18661-3:2015): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpxfNx (_FloatNx x, int round, unsigned int width)
math.h (TS 18661-3:2015): Section 20.8.3 [Rounding Functions], page 663.
intmax_t fromfpxl (long double x, int round, unsigned int width)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
int fscanf (FILE *stream, const char *template, ...)
stdio.h (ISO): Section 12.14.8 [Formatted Input Functions], page 323.
int fseek (FILE *stream, long int offset, int whence)
stdio.h (ISO): Section 12.18 [File Positioning], page 328.
int fseeko (FILE *stream, off_t offset, int whence)
stdio.h (Unix98): Section 12.18 [File Positioning], page 328.
int fseeko64 (FILE *stream, off64_t offset, int whence)
stdio.h (Unix98): Section 12.18 [File Positioning], page 328.
int fsetpos (FILE *stream, const fpos_t *position)
stdio.h (ISO): Section 12.19 [Portable File-Position Functions], page 331.
int fsetpos64 (FILE *stream, const fpos64_t *position)
stdio.h (Unix98): Section 12.19 [Portable File-Position Functions], page 331.
Appendix B: Summary of Library Facilities 1107
ssize_t getdelim (char **lineptr, size_t *n, int delimiter, FILE *stream)
stdio.h (GNU): Section 12.9 [Line-Oriented Input], page 287.
ssize_t getdents64 (int fd, void *buffer, size_t length)
dirent.h (Linux): Section 14.2.8 [Low-level Directory Access], page 422.
int getdomainnname (char *name, size_t length)
unistd.h (???): Section 32.1 [Host Identification], page 928.
gid_t getegid (void)
unistd.h (POSIX.1): Section 31.5 [Reading the Persona of a Process], page 900.
int getentropy (void *buffer, size_t length)
sys/random.h (GNU): Section 34.1 [Generating Unpredictable Bytes], page 965.
char * getenv (const char *name)
stdlib.h (ISO): Section 26.4.1 [Environment Access], page 844.
uid_t geteuid (void)
unistd.h (POSIX.1): Section 31.5 [Reading the Persona of a Process], page 900.
struct fstab * getfsent (void)
fstab.h (BSD): Section 32.3.1.1 [The fstab file], page 932.
struct fstab * getfsfile (const char *name)
fstab.h (BSD): Section 32.3.1.1 [The fstab file], page 932.
struct fstab * getfsspec (const char *name)
fstab.h (BSD): Section 32.3.1.1 [The fstab file], page 932.
gid_t getgid (void)
unistd.h (POSIX.1): Section 31.5 [Reading the Persona of a Process], page 900.
struct group * getgrent (void)
grp.h (SVID): Section 31.14.3 [Scanning the List of All Groups], page 922.
grp.h (BSD): Section 31.14.3 [Scanning the List of All Groups], page 922.
int getgrent_r (struct group *result_buf, char *buffer, size_t buflen, struct group **result)
grp.h (GNU): Section 31.14.3 [Scanning the List of All Groups], page 922.
struct group * getgrgid (gid_t gid)
grp.h (POSIX.1): Section 31.14.2 [Looking Up One Group], page 921.
int getgrgid_r (gid_t gid, struct group *result_buf, char *buffer, size_t buflen, struct group
**result)
grp.h (POSIX.1c): Section 31.14.2 [Looking Up One Group], page 921.
struct group * getgrnam (const char *name)
grp.h (SVID): Section 31.14.2 [Looking Up One Group], page 921.
grp.h (BSD): Section 31.14.2 [Looking Up One Group], page 921.
int getgrnam_r (const char *name, struct group *result_buf, char *buffer, size_t buflen, struct
group **result)
grp.h (POSIX.1c): Section 31.14.2 [Looking Up One Group], page 921.
int getgrouplist (const char *user, gid_t group, gid_t *groups, int *ngroups)
grp.h (BSD): Section 31.7 [Setting the Group IDs], page 902.
int getgroups (int count, gid_t *groups)
unistd.h (POSIX.1): Section 31.5 [Reading the Persona of a Process], page 900.
struct hostent * gethostbyaddr (const void *addr, socklen_t length, int format)
netdb.h (BSD): Section 16.6.2.4 [Host Names], page 478.
int gethostbyaddr_r (const void *addr, socklen_t length, int format, struct hostent *restrict
result_buf, char *restrict buf, size_t buflen, struct hostent **restrict result, int *restrict
h_errnop)
netdb.h (GNU): Section 16.6.2.4 [Host Names], page 478.
Appendix B: Summary of Library Facilities 1110
size_t mbsrtowcs (wchar_t *restrict dst, const char **restrict src, size_t len, mbstate_t
*restrict ps)
wchar.h (ISO): Section 6.3.4 [Converting Multibyte and Wide Character Strings], page 156.
mbstate_t
wchar.h (ISO): Section 6.3.2 [Representing the state of the conversion], page 148.
size_t mbstowcs (wchar_t *wstring, const char *string, size_t size)
stdlib.h (ISO): Section 6.4.2 [Non-reentrant Conversion of Strings], page 163.
int mbtowc (wchar_t *restrict result, const char *restrict string, size_t size)
stdlib.h (ISO): Section 6.4.1 [Non-reentrant Conversion of Single Characters], page 161.
int mcheck (void (*abortfn) (enum mcheck_status status))
mcheck.h (GNU): Section 3.2.3.8 [Heap Consistency Checking], page 55.
void * memalign (size_t boundary, size_t size)
malloc.h (BSD): Section 3.2.3.6 [Allocating Aligned Memory Blocks], page 52.
void * memccpy (void *restrict to, const void *restrict from, int c, size_t size)
string.h (SVID): Section 5.4 [Copying Strings and Arrays], page 102.
void * memchr (const void *block, int c, size_t size)
string.h (ISO): Section 5.9 [Search Functions], page 124.
int memcmp (const void *a1, const void *a2, size_t size)
string.h (ISO): Section 5.7 [String/Array Comparison], page 115.
void * memcpy (void *restrict to, const void *restrict from, size_t size)
string.h (ISO): Section 5.4 [Copying Strings and Arrays], page 102.
int memfd_create (const char *name, unsigned int flags)
sys/mman.h (Linux): Section 13.8 [Memory-mapped I/O], page 366.
void * memfrob (void *mem, size_t length)
string.h (GNU): Section 5.13 [Obfuscating Data], page 135.
void * memmem (const void *haystack, size_t haystack-len,
const void *needle, size_t needle-len)
string.h (GNU): Section 5.9 [Search Functions], page 124.
void * memmove (void *to, const void *from, size_t size)
string.h (ISO): Section 5.4 [Copying Strings and Arrays], page 102.
void * mempcpy (void *restrict to, const void *restrict from, size_t size)
string.h (GNU): Section 5.4 [Copying Strings and Arrays], page 102.
void * memrchr (const void *block, int c, size_t size)
string.h (GNU): Section 5.9 [Search Functions], page 124.
void * memset (void *block, int c, size_t size)
string.h (ISO): Section 5.4 [Copying Strings and Arrays], page 102.
int mkdir (const char *filename, mode_t mode)
sys/stat.h (POSIX.1): Section 14.8 [Creating Directories], page 433.
char * mkdtemp (char *template)
stdlib.h (BSD): Section 14.11 [Temporary Files], page 455.
int mkfifo (const char *filename, mode_t mode)
sys/stat.h (POSIX.1): Section 15.3 [FIFO Special Files], page 462.
int mknod (const char *filename, mode_t mode, dev_t dev)
sys/stat.h (BSD): Section 14.10 [Making Special Files], page 454.
int mkstemp (char *template)
stdlib.h (BSD): Section 14.11 [Temporary Files], page 455.
Appendix B: Summary of Library Facilities 1126
char * qfcvt (long double value, int ndigit, int *decpt, int *neg)
stdlib.h (GNU): Section 20.13 [Old-fashioned System V number-to-string functions],
page 689.
int qfcvt_r (long double value, int ndigit, int *decpt, int *neg, char *buf, size_t len)
stdlib.h (GNU): Section 20.13 [Old-fashioned System V number-to-string functions],
page 689.
char * qgcvt (long double value, int ndigit, char *buf)
stdlib.h (GNU): Section 20.13 [Old-fashioned System V number-to-string functions],
page 689.
void qsort (void *array, size_t count, size_t size, comparison_fn_t compare)
stdlib.h (ISO): Section 9.3 [Array Sort Function], page 232.
int raise (int signum)
signal.h (ISO): Section 25.6.1 [Signaling Yourself], page 794.
int rand (void)
stdlib.h (ISO): Section 19.8.1 [ISO C Random Number Functions], page 634.
int rand_r (unsigned int *seed)
stdlib.h (POSIX.1): Section 19.8.1 [ISO C Random Number Functions], page 634.
long int random (void)
stdlib.h (BSD): Section 19.8.2 [BSD Random Number Functions], page 635.
struct random_data
stdlib.h (GNU): Section 19.8.2 [BSD Random Number Functions], page 635.
int random_r (struct random_data *restrict buf, int32_t *restrict result)
stdlib.h (GNU): Section 19.8.2 [BSD Random Number Functions], page 635.
void * rawmemchr (const void *block, int c)
string.h (GNU): Section 5.9 [Search Functions], page 124.
ssize_t read (int filedes, void *buffer, size_t size)
unistd.h (POSIX.1): Section 13.2 [Input and Output Primitives], page 351.
struct dirent * readdir (DIR *dirstream)
dirent.h (POSIX.1): Section 14.2.3 [Reading and Closing a Directory Stream], page 416.
struct dirent64 * readdir64 (DIR *dirstream)
dirent.h (LFS): Section 14.2.3 [Reading and Closing a Directory Stream], page 416.
int readdir64_r (DIR *dirstream, struct dirent64 *entry, struct dirent64 **result)
dirent.h (LFS): Section 14.2.3 [Reading and Closing a Directory Stream], page 416.
int readdir_r (DIR *dirstream, struct dirent *entry, struct dirent **result)
dirent.h (GNU): Section 14.2.3 [Reading and Closing a Directory Stream], page 416.
ssize_t readlink (const char *filename, char *buffer, size_t size)
unistd.h (BSD): Section 14.5 [Symbolic Links], page 428.
ssize_t readv (int filedes, const struct iovec *vector, int count)
sys/uio.h (BSD): Section 13.6 [Fast Scatter-Gather I/O], page 361.
void * realloc (void *ptr, size_t newsize)
malloc.h (ISO): Section 3.2.3.4 [Changing the Size of a Block], page 50.
stdlib.h (ISO): Section 3.2.3.4 [Changing the Size of a Block], page 50.
void * reallocarray (void *ptr, size_t nmemb, size_t size)
malloc.h (BSD): Section 3.2.3.4 [Changing the Size of a Block], page 50.
stdlib.h (BSD): Section 3.2.3.4 [Changing the Size of a Block], page 50.
char * realpath (const char *restrict name, char *restrict resolved)
stdlib.h (XPG): Section 14.5 [Symbolic Links], page 428.
Appendix B: Summary of Library Facilities 1136
ssize_t recv (int socket, void *buffer, size_t size, int flags)
sys/socket.h (BSD): Section 16.9.5.2 [Receiving Data], page 496.
ssize_t recvfrom (int socket, void *buffer, size_t size, int flags, struct sockaddr *addr,
socklen_t *length-ptr)
sys/socket.h (BSD): Section 16.10.2 [Receiving Datagrams], page 503.
int regcomp (regex_t *restrict compiled, const char *restrict pattern, int cflags)
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
size_t regerror (int errcode, const regex_t *restrict compiled, char *restrict buffer, size_t
length)
regex.h (POSIX.2): Section 10.3.6 [POSIX Regexp Matching Cleanup], page 257.
regex_t
regex.h (POSIX.2): Section 10.3.1 [POSIX Regular Expression Compilation], page 253.
int regexec (const regex_t *restrict compiled, const char *restrict string, size_t nmatch,
regmatch_t matchptr[restrict], int eflags)
regex.h (POSIX.2): Section 10.3.3 [Matching a Compiled POSIX Regular Expression],
page 255.
void regfree (regex_t *compiled)
regex.h (POSIX.2): Section 10.3.6 [POSIX Regexp Matching Cleanup], page 257.
int register_printf_function (int spec, printf_function handler-function,
printf_arginfo_function arginfo-function)
printf.h (GNU): Section 12.13.1 [Registering New Conversions], page 310.
regmatch_t
regex.h (POSIX.2): Section 10.3.4 [Match Results with Subexpressions], page 256.
regoff_t
regex.h (POSIX.2): Section 10.3.4 [Match Results with Subexpressions], page 256.
double remainder (double numerator, double denominator)
math.h (ISO): Section 20.8.4 [Remainder Functions], page 667.
float remainderf (float numerator, float denominator)
math.h (ISO): Section 20.8.4 [Remainder Functions], page 667.
_FloatN remainderfN (_FloatN numerator, _FloatN denominator)
math.h (TS 18661-3:2015): Section 20.8.4 [Remainder Functions], page 667.
_FloatNx remainderfNx (_FloatNx numerator, _FloatNx denominator)
math.h (TS 18661-3:2015): Section 20.8.4 [Remainder Functions], page 667.
long double remainderl (long double numerator, long double denominator)
math.h (ISO): Section 20.8.4 [Remainder Functions], page 667.
int remove (const char *filename)
stdio.h (ISO): Section 14.6 [Deleting Files], page 431.
int rename (const char *oldname, const char *newname)
stdio.h (ISO): Section 14.7 [Renaming Files], page 432.
void rewind (FILE *stream)
stdio.h (ISO): Section 12.18 [File Positioning], page 328.
void rewinddir (DIR *dirstream)
dirent.h (POSIX.1): Section 14.2.5 [Random Access in a Directory Stream], page 419.
char * rindex (const char *string, int c)
string.h (BSD): Section 5.9 [Search Functions], page 124.
double rint (double x)
math.h (ISO): Section 20.8.3 [Rounding Functions], page 663.
Appendix B: Summary of Library Facilities 1137
int sigprocmask (int how, const sigset_t *restrict set, sigset_t *restrict oldset)
signal.h (POSIX.1): Section 25.7.3 [Process Signal Mask], page 800.
sigset_t
signal.h (POSIX.1): Section 25.7.2 [Signal Sets], page 799.
int sigsetjmp (sigjmp_buf state, int savesigs)
setjmp.h (POSIX.1): Section 24.3 [Non-Local Exits and Signals], page 759.
int sigsetmask (int mask)
signal.h (BSD): Section 25.10 [BSD Signal Handling], page 809.
int sigstack (struct sigstack *stack, struct sigstack *oldstack)
signal.h (BSD): Section 25.9 [Using a Separate Signal Stack], page 807.
struct sigstack
signal.h (BSD): Section 25.9 [Using a Separate Signal Stack], page 807.
int sigsuspend (const sigset_t *set)
signal.h (POSIX.1): Section 25.8.3 [Using sigsuspend], page 806.
double sin (double x)
math.h (ISO): Section 19.2 [Trigonometric Functions], page 551.
void sincos (double x, double *sinx, double *cosx)
math.h (GNU): Section 19.2 [Trigonometric Functions], page 551.
void sincosf (float x, float *sinx, float *cosx)
math.h (GNU): Section 19.2 [Trigonometric Functions], page 551.
_FloatN sincosfN (_FloatN x, _FloatN *sinx, _FloatN *cosx)
math.h (GNU): Section 19.2 [Trigonometric Functions], page 551.
_FloatNx sincosfNx (_FloatNx x, _FloatNx *sinx, _FloatNx *cosx)
math.h (GNU): Section 19.2 [Trigonometric Functions], page 551.
void sincosl (long double x, long double *sinx, long double *cosx)
math.h (GNU): Section 19.2 [Trigonometric Functions], page 551.
float sinf (float x)
math.h (ISO): Section 19.2 [Trigonometric Functions], page 551.
_FloatN sinfN (_FloatN x)
math.h (TS 18661-3:2015): Section 19.2 [Trigonometric Functions], page 551.
_FloatNx sinfNx (_FloatNx x)
math.h (TS 18661-3:2015): Section 19.2 [Trigonometric Functions], page 551.
double sinh (double x)
math.h (ISO): Section 19.5 [Hyperbolic Functions], page 562.
float sinhf (float x)
math.h (ISO): Section 19.5 [Hyperbolic Functions], page 562.
_FloatN sinhfN (_FloatN x)
math.h (TS 18661-3:2015): Section 19.5 [Hyperbolic Functions], page 562.
_FloatNx sinhfNx (_FloatNx x)
math.h (TS 18661-3:2015): Section 19.5 [Hyperbolic Functions], page 562.
long double sinhl (long double x)
math.h (ISO): Section 19.5 [Hyperbolic Functions], page 562.
long double sinl (long double x)
math.h (ISO): Section 19.2 [Trigonometric Functions], page 551.
size_t
stddef.h (ISO): Section A.4 [Important Data Types], page 1023.
Appendix B: Summary of Library Facilities 1144
wctrans_t
wctype.h (ISO): Section 4.5 [Mapping of wide characters.], page 96.
wctype_t wctype (const char *property)
wctype.h (ISO): Section 4.3 [Character class determination for wide characters], page 91.
wctype_t
wctype.h (ISO): Section 4.3 [Character class determination for wide characters], page 91.
wint_t
wchar.h (ISO): Section 6.1 [Introduction to Extended Characters], page 143.
wchar_t * wmemchr (const wchar_t *block, wchar_t wc, size_t size)
wchar.h (ISO): Section 5.9 [Search Functions], page 124.
int wmemcmp (const wchar_t *a1, const wchar_t *a2, size_t size)
wchar.h (ISO): Section 5.7 [String/Array Comparison], page 115.
wchar_t * wmemcpy (wchar_t *restrict wto, const wchar_t *restrict wfrom, size_t size)
wchar.h (ISO): Section 5.4 [Copying Strings and Arrays], page 102.
wchar_t * wmemmove (wchar_t *wto, const wchar_t *wfrom, size_t size)
wchar.h (ISO): Section 5.4 [Copying Strings and Arrays], page 102.
wchar_t * wmempcpy (wchar_t *restrict wto, const wchar_t *restrict wfrom, size_t size)
wchar.h (GNU): Section 5.4 [Copying Strings and Arrays], page 102.
wchar_t * wmemset (wchar_t *block, wchar_t wc, size_t size)
wchar.h (ISO): Section 5.4 [Copying Strings and Arrays], page 102.
int wordexp (const char *words, wordexp_t *word-vector-ptr, int flags)
wordexp.h (POSIX.2): Section 10.4.2 [Calling wordexp], page 259.
wordexp_t
wordexp.h (POSIX.2): Section 10.4.2 [Calling wordexp], page 259.
void wordfree (wordexp_t *word-vector-ptr)
wordexp.h (POSIX.2): Section 10.4.2 [Calling wordexp], page 259.
int wprintf (const wchar_t *template, ...)
wchar.h (ISO): Section 12.12.7 [Formatted Output Functions], page 301.
ssize_t write (int filedes, const void *buffer, size_t size)
unistd.h (POSIX.1): Section 13.2 [Input and Output Primitives], page 351.
ssize_t writev (int filedes, const struct iovec *vector, int count)
sys/uio.h (BSD): Section 13.6 [Fast Scatter-Gather I/O], page 361.
int wscanf (const wchar_t *template, ...)
wchar.h (ISO): Section 12.14.8 [Formatted Input Functions], page 323.
double y0 (double x)
math.h (SVID): Section 19.6 [Special Functions], page 565.
float y0f (float x)
math.h (SVID): Section 19.6 [Special Functions], page 565.
_FloatN y0fN (_FloatN x)
math.h (GNU): Section 19.6 [Special Functions], page 565.
_FloatNx y0fNx (_FloatNx x)
math.h (GNU): Section 19.6 [Special Functions], page 565.
long double y0l (long double x)
math.h (SVID): Section 19.6 [Special Functions], page 565.
double y1 (double x)
math.h (SVID): Section 19.6 [Special Functions], page 565.
Appendix B: Summary of Library Facilities 1162
to the kernel. The GNU C Library will normally look in /usr/include for
them, but if you specify this option, it will look in DIRECTORY instead.
This option is primarily of use on a system where the headers in /usr/include
come from an older version of the GNU C Library. Conflicts can occasionally
happen in this case. You can also use this option if you want to compile the
GNU C Library with a newer set of kernel headers than the ones found in
/usr/include.
‘--enable-kernel=version’
This option is currently only useful on GNU/Linux systems. The version pa-
rameter should have the form X.Y.Z and describes the smallest version of the
Linux kernel the generated library is expected to support. The higher the ver-
sion number is, the less compatibility code is added, and the faster the code
gets.
‘--with-binutils=directory’
Use the binutils (assembler and linker) in directory, not the ones the C com-
piler would default to. You can use this option if the default binutils on your
system cannot deal with all the constructs in the GNU C Library. In that
case, configure will detect the problem and suppress these constructs, so that
the library will still be usable, but functionality may be lost—for example, you
can’t build a shared libc with old binutils.
‘--with-nonshared-cflags=cflags’
Use additional compiler flags cflags to build the parts of the library which
are always statically linked into applications and libraries even with shared
linking (that is, the object files contained in lib*_nonshared.a libraries).
The build process will automatically use the appropriate flags, but this
option can be used to set additional flags required for building applications
and libraries, to match local policy. For example, if such a policy requires
that all code linked into applications must be built with source fortification,
‘--with-nonshared-cflags=-Wp,-D_FORTIFY_SOURCE=2’ will make sure that
the objects in libc_nonshared.a are compiled with this flag (although this
will not affect the generated code in this particular case and potentially change
debugging information and metadata only).
‘--with-rtld-early-cflags=cflags’
Use additional compiler flags cflags to build the early startup code of the dy-
namic linker. These flags can be used to enable early dynamic linker diagnostics
to run on CPUs which are not compatible with the rest of the GNU C Library,
for example, due to compiler flags which target a later instruction set architec-
ture (ISA).
‘--with-timeoutfactor=NUM’
Specify an integer NUM to scale the timeout of test programs. This factor can
be changed at run time using TIMEOUTFACTOR environment variable.
‘--disable-shared’
Don’t build shared libraries even if it is possible. Not all systems support shared
libraries; you need ELF support and (currently) the GNU linker.
Appendix C: Installing the GNU C Library 1165
‘--disable-default-pie’
Don’t build glibc programs and the testsuite as position independent executa-
bles (PIE). By default, glibc programs and tests are created as position indepen-
dent executables on targets that support it. If the toolchain and architecture
support it, static executables are built as static PIE and the resulting glibc can
be used with the GCC option, -static-pie, which is available with GCC 8 or
above, to create static PIE.
‘--enable-cet’
‘--enable-cet=permissive’
Enable Intel Control-flow Enforcement Technology (CET) support. When the
GNU C Library is built with --enable-cet or --enable-cet=permissive, the
resulting library is protected with indirect branch tracking (IBT) and shadow
stack (SHSTK). When CET is enabled, the GNU C Library is compatible
with all existing executables and shared libraries. This feature is currently
supported on x86 64 and x32 with GCC 8 and binutils 2.29 or later. With
--enable-cet, it is an error to dlopen a non CET enabled shared library in
CET enabled application. With --enable-cet=permissive, CET is disabled
when dlopening a non CET enabled shared library in CET enabled application.
NOTE: --enable-cet is only supported on x86 64 and x32.
‘--enable-memory-tagging’
Enable memory tagging support if the architecture supports it. When the
GNU C Library is built with this option then the resulting library will be able
to control the use of tagged memory when hardware support is present by use
of the tunable ‘glibc.mem.tagging’. This includes the generation of tagged
memory when using the malloc APIs.
At present only AArch64 platforms with MTE provide this functionality, al-
though the library will still operate (without memory tagging) on older versions
of the architecture.
The default is to disable support for memory tagging.
‘--disable-profile’
Don’t build libraries with profiling information. You may want to use this
option if you don’t plan to do profiling.
‘--enable-static-nss’
Compile static versions of the NSS (Name Service Switch) libraries. This is
not recommended because it defeats the purpose of NSS; a program linked
statically with the NSS libraries cannot be dynamically reconfigured to use a
different name database.
‘--enable-hardcoded-path-in-tests’
By default, dynamic tests are linked to run with the installed C library. This
option hardcodes the newly built C library path in dynamic tests so that they
can be invoked directly.
Appendix C: Installing the GNU C Library 1166
‘--disable-timezone-tools’
By default, time zone related utilities (zic, zdump, and tzselect) are installed
with the GNU C Library. If you are building these independently (e.g. by using
the ‘tzcode’ package), then this option will allow disabling the install of these.
Note that you need to make sure the external tools are kept in sync with the
versions that the GNU C Library expects as the data formats may change over
time. Consult the timezone subdirectory for more details.
‘--enable-stack-protector’
‘--enable-stack-protector=strong’
‘--enable-stack-protector=all’
Compile the C library and all other parts of the glibc package (including the
threading and math libraries, NSS modules, and transliteration modules) us-
ing the GCC -fstack-protector, -fstack-protector-strong or -fstack-
protector-all options to detect stack overruns. Only the dynamic linker and
a small number of routines called directly from assembler are excluded from
this protection.
‘--enable-bind-now’
Disable lazy binding for installed shared objects and programs. This provides
additional security hardening because it enables full RELRO and a read-only
global offset table (GOT), at the cost of slightly increased program load times.
‘--enable-pt_chown’
The file pt_chown is a helper binary for grantpt (see Section 17.9.1 [Allocating
Pseudo-Terminals], page 538) that is installed setuid root to fix up pseudo-
terminal ownership on GNU/Hurd. It is not required on GNU/Linux, and the
GNU C Library will not use the installed pt_chown program when configured
with --enable-pt_chown.
‘--disable-werror’
By default, the GNU C Library is built with -Werror. If you wish to build
without this option (for example, if building with a newer version of GCC than
this version of the GNU C Library was tested with, so new warnings cause the
build with -Werror to fail), you can configure with --disable-werror.
‘--disable-mathvec’
By default for x86 64, the GNU C Library is built with the vector math library.
Use this option to disable the vector math library.
‘--disable-static-c++-tests’
By default, if the C++ toolchain lacks support for static linking, configure fails
to find the C++ header files and the glibc build fails. --disable-static-c++-
link-check allows the glibc build to finish, but static C++ tests will fail if the
C++ toolchain doesn’t have the necessary static C++ libraries. Use this option
to skip the static C++ tests. This option implies --disable-static-c++-link-
check.
‘--disable-static-c++-link-check’
By default, if the C++ toolchain lacks support for static linking, configure fails
to find the C++ header files and the glibc build fails. Use this option to disable
Appendix C: Installing the GNU C Library 1167
the static C++ link check so that the C++ header files can be located. The newly
built libc.a can be used to create static C++ tests if the C++ toolchain has the
necessary static C++ libraries.
‘--disable-scv’
Disable using scv instruction for syscalls. All syscalls will use sc instead, even
if the kernel supports scv. PowerPC only.
‘--build=build-system’
‘--host=host-system’
These options are for cross-compiling. If you specify both options and build-
system is different from host-system, configure will prepare to cross-compile
the GNU C Library from build-system to be used on host-system. You’ll prob-
ably need the ‘--with-headers’ option too, and you may have to override
configure’s selection of the compiler and/or binutils.
If you only specify ‘--host’, configure will prepare for a native compile but
use what you specify instead of guessing what your system is. This is most
useful to change the CPU submodel. For example, if configure guesses your
machine as i686-pc-linux-gnu but you want to compile a library for 586es,
give ‘--host=i586-pc-linux-gnu’ or just ‘--host=i586-linux’ and add the
appropriate compiler flags (‘-mcpu=i586’ will do the trick) to CC.
If you specify just ‘--build’, configure will get confused.
‘--with-pkgversion=version’
Specify a description, possibly including a build number or build date, of the
binaries being built, to be included in --version output from programs in-
stalled with the GNU C Library. For example, --with-pkgversion='FooBar
GNU/Linux glibc build 123'. The default value is ‘GNU libc’.
‘--with-bugurl=url’
Specify the URL that users should visit if they wish to report a bug, to be
included in --help output from programs installed with the GNU C Library.
The default value refers to the main bug-reporting information for the GNU C
Library.
‘--enable-fortify-source’
‘--enable-fortify-source=LEVEL’
Use -D FORTIFY SOURCE=LEVEL to control hardening in the GNU C Li-
brary. If not provided, LEVEL defaults to highest possible value supported by
the build compiler.
Default is to disable fortification.
To build the library and related programs, type make. This will produce a lot of output,
some of which may look like errors from make but aren’t. Look for error messages from
make containing ‘***’. Those indicate that something is seriously wrong.
The compilation process can take a long time, depending on the configuration and the
speed of your machine. Some complex modules may take a very long time to compile, as
much as several minutes on slower machines. Do not panic if the compiler appears to hang.
If you want to run a parallel make, simply pass the ‘-j’ option with an appropriate
numeric parameter to make. You need a recent GNU make version, though.
Appendix C: Installing the GNU C Library 1168
To build and run test programs which exercise some of the library facilities, type make
check. If it does not complete successfully, do not use the built library, and report a bug
after verifying that the problem is not already known. See Section C.5 [Reporting Bugs],
page 1173, for instructions on reporting bugs. Note that some of the tests assume they are
not being run by root. We recommend you compile and test the GNU C Library as an
unprivileged user.
Before reporting bugs make sure there is no problem with your system. The tests
(and later installation) use some pre-existing files of the system such as /etc/passwd,
/etc/nsswitch.conf and others. These files must all contain correct and sensible content.
Normally, make check will run all the tests before reporting all problems found and exit-
ing with error status if any problems occurred. You can specify ‘stop-on-test-failure=y’
when running make check to make the test run stop and exit with an error status immedi-
ately when a failure occurs.
To format the GNU C Library Reference Manual for printing, type make dvi. You need
a working TEX installation to do this. The distribution builds the on-line formatted version
of the manual, as Info files, as part of the build process. You can build them manually with
make info.
The library has a number of special-purpose configuration parameters which you can
find in Makeconfig. These can be overwritten with the file configparms. To change them,
create a configparms in your build directory and add values as appropriate for your system.
The file is included and parsed by make and has to follow the conventions for makefiles.
It is easy to configure the GNU C Library for cross-compilation by setting a few variables
in configparms. Set CC to the cross-compiler for the target you configured the library for;
it is important to use this same CC value when running configure, like this: ‘configure
target CC=target-gcc’. Set BUILD_CC to the compiler to use for programs run on the
build system as part of compiling the library. You may need to set AR to cross-compiling
versions of ar if the native tools are not configured to work with object files for the target
you configured for. When cross-compiling the GNU C Library, it may be tested using ‘make
check test-wrapper="srcdir/scripts/cross-test-ssh.sh hostname"’, where srcdir is
the absolute directory name for the main source directory and hostname is the host name
of a system that can run the newly built binaries of the GNU C Library. The source
and build directories must be visible at the same locations on both the build system and
hostname. The ‘cross-test-ssh.sh’ script requires ‘flock’ from ‘util-linux’ to work
when glibc test allow time setting environment variable is set.
It is also possible to execute tests, which require setting the date on the target machine.
Following use cases are supported:
• GLIBC_TEST_ALLOW_TIME_SETTING is set in the environment in which eligible tests are
executed and have the privilege to run clock_settime. In this case, nothing prevents
those tests from running in parallel, so the caller shall assure that those tests are
serialized or provide a proper wrapper script for them.
• The cross-test-ssh.sh script is used and one passes the --allow-time-setting
flag. In this case, both sets GLIBC_TEST_ALLOW_TIME_SETTING and serialization of test
execution are assured automatically.
In general, when testing the GNU C Library, ‘test-wrapper’ may be set to the name
and arguments of any program to run newly built binaries. This program must preserve the
Appendix C: Installing the GNU C Library 1169
arguments to the binary being run, its working directory and the standard input, output and
error file descriptors. If ‘test-wrapper env’ will not work to run a program with environ-
ment variables set, then ‘test-wrapper-env’ must be set to a program that runs a newly
built program with environment variable assignments in effect, those assignments being
specified as ‘var=value’ before the name of the program to be run. If multiple assignments
to the same variable are specified, the last assignment specified must take precedence. Sim-
ilarly, if ‘test-wrapper env -i’ will not work to run a program with an environment com-
pletely empty of variables except those directly assigned, then ‘test-wrapper-env-only’
must be set; its use has the same syntax as ‘test-wrapper-env’, the only difference in
its semantics being starting with an empty set of environment variables rather than the
ambient set.
For AArch64 with SVE, when testing the GNU C Library, ‘test-wrapper’ may be
set to "srcdir/sysdeps/unix/sysv/linux/aarch64/vltest.py vector-length" to change Vector
Length.
the preceding options. As of release, this implies GCC 7.4 and newer (excepting GCC
7.5.0, see GCC PR94200). These additional features are required for building the
GNU C Library with support for IEEE long double.
For ARC architecture builds, GCC 8.3 or higher is needed.
For s390x architecture builds, GCC 7.1 or higher is needed (See gcc Bug 98269).
For AArch64 architecture builds with mathvec enabled, GCC 10 or higher is needed
due to dependency on arm sve.h.
For multi-arch support it is recommended to use a GCC which has been built with
support for GNU indirect functions. This ensures that correct debugging information
is generated for functions selected by IFUNC resolvers. This support can either be
enabled by configuring GCC with ‘--enable-gnu-indirect-function’, or by enabling
it by default by setting ‘default_gnu_indirect_function’ variable for a particular
architecture in the GCC source file gcc/config.gcc.
You can use whatever compiler you like to compile programs that use the GNU C
Library.
Check the FAQ for any special compiler issues on particular platforms.
• GNU binutils 2.25 or later
You must use GNU binutils (as and ld) to build the GNU C Library. No other
assembler or linker has the necessary functionality at the moment. As of release time,
GNU binutils 2.42 is the newest verified to work to build the GNU C Library.
For PowerPC 64-bits little-endian (powerpc64le), objcopy is required to support
--update-section. This option requires binutils 2.26 or newer.
ARC architecture needs binutils 2.32 or higher for TLS related fixes.
• GNU texinfo 4.7 or later
To correctly translate and install the Texinfo documentation you need this version
of the texinfo package. Earlier versions do not understand all the tags used in the
document, and the installation mechanism for the info files is not present or works
differently. As of release time, texinfo 7.1 is the newest verified to work to build the
GNU C Library.
• GNU awk 3.1.2, or higher
awk is used in several places to generate files. Some gawk extensions are used, including
the asorti function, which was introduced in version 3.1.2 of gawk. As of release time,
gawk version 5.3.0 is the newest verified to work to build the GNU C Library.
• GNU bison 2.7 or later
bison is used to generate the yacc parser code in the intl subdirectory. As of release
time, bison version 3.8.2 is the newest verified to work to build the GNU C Library.
• Perl 5
Perl is not required, but if present it is used in some tests and the mtrace program, to
build the GNU C Library manual. As of release time perl version 5.40.0 is the newest
verified to work to build the GNU C Library.
Appendix C: Installing the GNU C Library 1172
The final step when you have a simple test case is to report the bug. Do this at
https://www.gnu.org/software/libc/bugs.html.
If you are not sure how a function should behave, and this manual doesn’t tell you, that’s
a bug in the manual. Report that too! If the function’s behavior disagrees with the manual,
then either the library or the manual has a bug, so report the disagreement. If you find any
errors or omissions in this manual, please report them to the bug database. If you refer to
specific sections of the manual, please include the section names for easier identification.
1175
In general, the fortified variants of the function calls use the name of the function with
a __ prefix and a _chk suffix. There are some exceptions, e.g. the printf family of
functions where, depending on the architecture, one may also see fortified variants have the
_chkieee128 suffix or the __nldbl___ prefix to their names.
Another exception is the open family of functions, where their fortified replacements
have the __ prefix and a _2 suffix. The FD_SET, FD_CLR and FD_ISSET macros use the
__fdelt_chk function on fortification.
The following functions and macros are fortified in the GNU C Library:
• asprintf
• confstr
• dprintf
• explicit_bzero
• FD_SET
• FD_CLR
• FD_ISSET
• fgets
• fgets_unlocked
• fgetws
• fgetws_unlocked
• fprintf
• fread
• fread_unlocked
• fwprintf
• getcwd
• getdomainname
• getgroups
• gethostname
• getlogin_r
• gets
• getwd
• longjmp
• mbsnrtowcs
• mbsrtowcs
• mbstowcs
• memcpy
• memmove
• mempcpy
• memset
• mq_open
Appendix D: Library Maintenance 1179
• obstack_printf
• obstack_vprintf
• open
• open64
• openat
• openat64
• poll
• ppoll64
• ppoll
• pread64
• pread
• printf
• ptsname_r
• read
• readlinkat
• readlink
• realpath
• recv
• recvfrom
• snprintf
• sprintf
• stpcpy
• stpncpy
• strcat
• strcpy
• strlcat
• strlcpy
• strncat
• strncpy
• swprintf
• syslog
• ttyname_r
• vasprintf
• vdprintf
• vfprintf
• vfwprintf
• vprintf
• vsnprintf
• vsprintf
Appendix D: Library Maintenance 1180
• vswprintf
• vsyslog
• vwprintf
• wcpcpy
• wcpncpy
• wcrtomb
• wcscat
• wcscpy
• wcslcat
• wcslcpy
• wcsncat
• wcsncpy
• wcsnrtombs
• wcsrtombs
• wcstombs
• wctomb
• wmemcpy
• wmemmove
• wmempcpy
• wmemset
• wprintf
The 32-bit-time implementation is a wrapper and is only compiled for dual-time config-
urations:
#if __TIMESIZE != 64
struct tm *
localtime (const time_t *t)
{
__time64_t t64 = *t;
return __localtime64 (&t64);
}
libc_hidden_def (localtime)
#endif
Subdirs
This file contains the names of new whole subdirectories under the top-level
library source tree that should be included for this system. These subdirectories
are treated just like the system-independent subdirectories in the library source
tree, such as stdio and math.
Use this when there are completely new sets of functions and header files that
should go into the library for the system this subdirectory of sysdeps imple-
ments. For example, sysdeps/unix/inet/Subdirs contains inet; the inet
directory contains various network-oriented operations which only make sense
to put in the library on systems that support the Internet.
Appendix D: Library Maintenance 1184
configure
This file is a shell script fragment to be run at configuration time. The top-level
configure script uses the shell . command to read the configure file in each
system-dependent directory chosen, in order. The configure files are often
generated from configure.ac files using Autoconf.
A system-dependent configure script will usually add things to the shell vari-
ables ‘DEFS’ and ‘config_vars’; see the top-level configure script for details.
The script can check for ‘--with-package’ options that were passed to the top-
level configure. For an option ‘--with-package=value’ configure sets the
shell variable ‘with_package’ (with any dashes in package converted to under-
scores) to value; if the option is just ‘--with-package’ (no argument), then it
sets ‘with_package’ to ‘yes’.
configure.ac
This file is an Autoconf input fragment to be processed into the file configure
in this subdirectory. See Section “Introduction” in Autoconf: Generating Auto-
matic Configuration Scripts, for a description of Autoconf. You should write ei-
ther configure or configure.ac, but not both. The first line of configure.ac
should invoke the m4 macro ‘GLIBC_PROVIDES’. This macro does several AC_
PROVIDE calls for Autoconf macros which are used by the top-level configure
script; without this, those macros might be invoked again unnecessarily by
Autoconf.
That is the general system for how system-dependencies are isolated. The next section
explains how to decide what directories in sysdeps to use. Section D.4.2 [Porting the
GNU C Library to Unix Systems], page 1186, has some tips on porting the library to Unix
variants.
sysdeps/gnu
sysdeps/unix/common
sysdeps/unix/mman
sysdeps/unix/inet
sysdeps/unix/sysv/i386/i686
sysdeps/unix/sysv/i386
sysdeps/unix/sysv
sysdeps/unix/i386
sysdeps/unix
sysdeps/posix
sysdeps/i386/i686
sysdeps/i386/i486
sysdeps/libm-i387/i686
sysdeps/i386/fpu
sysdeps/libm-i387
sysdeps/i386
sysdeps/wordsize-32
sysdeps/ieee754
sysdeps/libm-ieee754
sysdeps/generic
Different machine architectures are conventionally subdirectories at the top level of the
sysdeps directory tree. For example, sysdeps/sparc and sysdeps/m68k. These contain
files specific to those machine architectures, but not specific to any particular operating
system. There might be subdirectories for specializations of those architectures, such as
sysdeps/m68k/68020. Code which is specific to the floating-point coprocessor used with a
particular machine should go in sysdeps/machine/fpu.
There are a few directories at the top level of the sysdeps hierarchy that are not for
particular machine architectures.
generic As described above (see Section D.4 [Porting the GNU C Library], page 1182),
this is the subdirectory that every configuration implicitly uses after all others.
ieee754 This directory is for code using the IEEE 754 floating-point format, where the
C type float is IEEE 754 single-precision format, and double is IEEE 754
double-precision format. Usually this directory is referred to in the Implies
file in a machine architecture-specific directory, such as m68k/Implies.
libm-ieee754
This directory contains an implementation of a mathematical library usable on
platforms which use IEEE 754 conformant floating-point arithmetic.
libm-i387
This is a special case. Ideally the code should be in sysdeps/i386/fpu but for
various reasons it is kept aside.
posix This directory contains implementations of things in the library in terms of
POSIX.1 functions. This includes some of the POSIX.1 functions themselves.
Of course, POSIX.1 cannot be completely implemented in terms of itself, so a
configuration using just posix cannot be complete.
unix This is the directory for Unix-like things. See Section D.4.2 [Porting the GNU
C Library to Unix Systems], page 1186. unix implies posix. There are some
special-purpose subdirectories of unix:
Appendix D: Library Maintenance 1186
unix/common
This directory is for things common to both BSD and System V re-
lease 4. Both unix/bsd and unix/sysv/sysv4 imply unix/common.
unix/inet
This directory is for socket and related functions on Unix sys-
tems. unix/inet/Subdirs enables the inet top-level subdirectory.
unix/common implies unix/inet.
mach This is the directory for things based on the Mach microkernel from CMU (in-
cluding GNU/Hurd systems). Other basic operating systems (VMS, for exam-
ple) would have their own directories at the top level of the sysdeps hierarchy,
parallel to unix and mach.
The following functions provide hints about the usage of resources that are shared with
other processors. They can be used, for example, if a program waiting on a lock intends to
divert the shared resources to be used by other processors. More information is available
in Power ISA 2.06b - Book II - Section 3.2.
Power ISA 2.07 extends the priorities that can be set to the Program Priority Register
(PPR). The following functions implement the new priority levels: very low and medium
high.
• AMD_VIRT_SSBD – Speculative Store Bypass Disable (SSBD) for AMD cpus (older sys-
tems).
• AMX_BF16 – Tile computational operations on bfloat16 numbers.
• AMX_COMPLEX – Tile computational operations on complex FP16 numbers.
• AMX_INT8 – Tile computational operations on 8-bit numbers.
• AMX_FP16 – Tile computational operations on FP16 numbers.
• AMX_TILE – Tile architecture.
• APX_F – The APX instruction extensions.
• ARCH_CAPABILITIES – IA32 ARCH CAPABILITIES MSR.
• ArchPerfmonExt – Architectural Performance Monitoring Extended Leaf (EAX =
23H).
• AVX – The AVX instruction extensions.
• AVX10 – The AVX10 instruction extensions.
• AVX10_XMM – Whether AVX10 includes xmm registers.
• AVX10_YMM – Whether AVX10 includes ymm registers.
• AVX10_ZMM – Whether AVX10 includes zmm registers.
• AVX2 – The AVX2 instruction extensions.
• AVX_IFMA – The AVX-IFMA instruction extensions.
• AVX_NE_CONVERT – The AVX-NE-CONVERT instruction extensions.
• AVX_VNNI – The AVX-VNNI instruction extensions.
• AVX_VNNI_INT8 – The AVX-VNNI-INT8 instruction extensions.
• AVX512_4FMAPS – The AVX512 4FMAPS instruction extensions.
• AVX512_4VNNIW – The AVX512 4VNNIW instruction extensions.
• AVX512_BF16 – The AVX512 BF16 instruction extensions.
• AVX512_BITALG – The AVX512 BITALG instruction extensions.
• AVX512_FP16 – The AVX512 FP16 instruction extensions.
• AVX512_IFMA – The AVX512 IFMA instruction extensions.
• AVX512_VBMI – The AVX512 VBMI instruction extensions.
• AVX512_VBMI2 – The AVX512 VBMI2 instruction extensions.
• AVX512_VNNI – The AVX512 VNNI instruction extensions.
• AVX512_VP2INTERSECT – The AVX512 VP2INTERSECT instruction extensions.
• AVX512_VPOPCNTDQ – The AVX512 VPOPCNTDQ instruction extensions.
• AVX512BW – The AVX512BW instruction extensions.
• AVX512CD – The AVX512CD instruction extensions.
• AVX512ER – The AVX512ER instruction extensions.
• AVX512DQ – The AVX512DQ instruction extensions.
• AVX512F – The AVX512F instruction extensions.
• AVX512PF – The AVX512PF instruction extensions.
• AVX512VL – The AVX512VL instruction extensions.
Appendix E: Platform-specific facilities 1191
int
avx_present (void)
{
return CPU_FEATURE_PRESENT (AVX);
}
Appendix E: Platform-specific facilities 1195
int
avx_active (void)
{
return CPU_FEATURE_ACTIVE (AVX);
}
1196
• Martin Galvan for contributing gdb pretty printer support to glibc and adding an initial
set of pretty printers for structures in the POSIX Threads library.
• Romain Geissler for various fixes.
• Michael Glad for the passphrase-hashing function crypt and related functions (no
longer part of glibc, but we still appreciate his work).
• Wolfram Gloger for contributing the memory allocation functions functions malloc,
realloc and free and related code.
• Noah Goldstein for contributing extensive x86 / x86-64 optimizations.
• Gabriel F. T. Gomes for his improvements for Linux on PowerPC and for implementing
the IEEE 128-bit floating point type for PowerPC.
• Torbjörn Granlund for fast implementations of many of the string functions (memcpy,
strlen, etc.).
• Evan Green for work on the RISC-V port.
• Vineet Gupta for their maintainership of the ARC port.
• Michael J. Haertel for writing the merge sort function qsort and malloc checking
functions like mcheck.
• Bruno Haible for his improvements to the iconv and locale implementations and various
fixes.
• Mao Han for the C-SKY port.
• Richard Henderson for the port to Linux on Alpha (alpha-anything-linux) and soft-
ware floating-point support.
• David Holsgrove for the port to Linux on MicroBlaze.
• Leonhard Holz for various fixes.
• Stafford Horne for maintainership of the OpenRISC port.
• Ying Huang for work on the MIPS port.
• Guy-Fleury Iteriteka for contributions to Hurd support.
• Daniel Jacobowitz for various fixes and enhancements.
• Andreas Jaeger for the port to Linux on x86-64 (x86_64-anything-linux and his work
on Linux for MIPS (mips-anything-linux), implementing the ldconfig program,
providing a test suite for the math library and for his direction as part of the GNU C
Library steering committee.
• Sam James for various fixes.
• Aurelien Jarno for various fixes.
• Rical Jasan for contributing various fixes in the GNU C Library manual.
• Jakub Jelinek for implementing a number of checking functions, software floating-point
support and for his direction as part of the GNU C Library steering committee.
• Simon Josefsson for the libidn add-on.
• Geoffrey Keating for the port to Linux on PowerPC (powerpc-anything-linux).
• Brendan Kehoe for contributing the port to the MIPS DECStation running Ultrix 4
(mips-dec-ultrix4) and the port to the DEC Alpha running OSF/1 (alpha-dec-
osf1).
Appendix F: Contributors to the GNU C Library 1199
• Mark Kettenis for implementing the utmpx interface and a utmp daemon, and for a
Hesiod NSS module.
• Simon Kissane for gmon improvements.
• Andi Kleen for implementing pthreads lock elision with TSX.
• Kazumoto Kojima for the port of the Mach and Hurd code to the MIPS architecture
(mips-anything-gnu) and for his work on the SH architecture.
• Pavel Kozlov for maintainership of the ARC port.
• Maxim Kuvyrkov for various fixes.
• Andreas Krebbel for his work on Linux for s390 and s390x.
• Thorsten Kukuk for providing an implementation for NIS (YP) and NIS+, securelevel
0, 1 and 2 and for the implementation for a caching daemon for NSS (nscd).
• Akhilesh Kumar for various fixes to locales.
• Jeff Law for various fixes.
• Doug Lea for contributing the memory allocation functions malloc, realloc and free
and related code.
• Chris Leonard for various fixes and enhancements to localedata.
• Ilya Leoshkevich for various fixes.
• Dmitry V. Levin for various fixes.
• Stefan Liebler for numerous fixes and the work on the S390 port.
• Hongjiu Lu for providing the support for a Linux 32-bit runtime environment under
x86-64 (x32), for porting to Linux on IA64, for improved string functions, a framework
for testing IFUNC implementations, for implementing Intel Control-Flow Enforcement
Technology, many x86-64 improvements, and many bug fixes.
• Rafał Lużyński for contributing support for two grammatical forms of month names,
and for various fixes to locales.
• Maxim Kuvyrkov for various fixes.
• Luis Machado for optimized functions on PowerPC.
• David J. MacKenzie for his contribution to the getopt function and writing the tar.h
header.
• Lukasz Majewski for Y2038 related fixes.
• Manjunath Matti for contributions to the PowerPC port.
• Greg McGary for adding runtime support for bounds checking.
• Roland McGrath for writing most of the GNU C Library originally, for his work on
the Hurd port, his direction as part of the GNU C Library steering committee and as
FSF Project Steward for the GNU C Library, and for many bug fixes and reviewing of
contributions.
• Allan McRae for various fixes.
• Meng Qinggang for contributions to the LoongArch port.
• Jason Merrill for the port to the Sequent Symmetry running Dynix version 3 (i386-
sequent-bsd).
Appendix F: Contributors to the GNU C Library 1200
• Joe Ramsay for contributing to the AArch64 port, in particular the vector library.
• Torvald Riegel for the implementation of new algorithms for semaphores,
pthread rwlock and condition variables.
• Maciej W. Rozycki for MIPS fixes, support for ABSOLUTE symbols, and various fixes.
• Leonardo Sandoval for various fixes.
• Pravin Satpute for writing sorting rules for some Indian languages.
• Douglas C. Schmidt for writing the quick sort function used as a fallback by qsort.
• Will Schmidt for optimized string functions on PowerPC.
• Andreas Schwab for the port to Linux/m68k (m68k-anything-linux), for his direction
as part of the GNU C Library steering committee, and for various bug fixes.
• Martin Schwidefsky for porting to Linux on s390 (s390-anything-linux) and s390x
(s390x-anything-linux).
• Thomas Schwinge for his contribution to Hurd and the SH architecture.
• Martin Sebor for various fixes.
• Andrew Senkevich for contributing vector math function implementations for x86.
• Carlos Eduardo Seo for optimized functions on PowerPC.
• Arjun Shankar for testing and bug fixing.
• Marcus Shawcroft for contributing the AArch64 port.
• TAMUKI Shoichi for various fixes.
• Joe Simmons-Talbott for various fixes.
• Franz Sirl for various fixes.
• Gavin Smith for various fixes.
• Jes Sorensen for porting to Linux on IA64 (ia64-anything-linux).
• Julian Squires for various fixes.
• Rajalakshmi Srinivasaraghavan for various fixes and optimizations on PowerPC, for
implementing the IEEE 128-bit floating point type for PowerPC., and for their main-
tainership of the PowerPC port.
• Richard Stallman for his contribution to the getopt function.
• Alfred M. Szmidt for various fixes.
• Chung-Lin Tang for contributing the Nios II port.
• Ian Lance Taylor for contributing the port to the MIPS DECStation running Ultrix 4
(mips-dec-ultrix4).
• Samuel Thibault for numerous improvements to the Hurd port.
• Pino Toscano for various fixes.
• Matt Turner for various fixes to the Alpha port.
• Valery Ushakov for locale fixes.
• Hsiangkai Wang for various fixes.
• Tim Waugh for the implementation of the POSIX.2 wordexp function family.
• Ulrich Weigand for various fixes to the PowerPC64 and Arm ports.
Appendix F: Contributors to the GNU C Library 1202
• Florian Weimer for his maintainership of the network component, for handling of se-
curity issues, and for numerous fixes and contributions.
• Zack Weinberg for the explicit_bzero implementation and for various fixes.
• Mark Wielaard for various fixes.
• Xi Ruoyao for various fixes and work on the loongarch port.
• Qixing ksyx Xue for various fixes.
• Adam Yi for various fixes.
• Eric Youngdale for implementing versioning of objects on the symbol level.
• YunQiang Su for work on the MIPS port.
• Adhemerval Zanella for optimized functions on PowerPC, ISO C threads support, the
work on tunables, fortify improvements, and numerous contributions and fixes.
• Xuelei Zhang for optimized functions on AArch64.
• Junxian Zhu for work on the MIPS port.
Some code in the GNU C Library comes from other projects and might be under a
different license:
• The time zone support code is derived from the public-domain time zone package by
Arthur David Olson and his many contributors.
• Some of the support code for Mach is taken from Mach 3.0 by CMU; the file if_ppp.h
is also copyright by CMU, but under a different license; see the file LICENSES for the
text of the licenses.
• The random number generation functions random, srandom, setstate and initstate,
which are also the basis for the rand and srand functions, were written by Earl T.
Cohen for the University of California at Berkeley and are copyrighted by the Regents
of the University of California. They have undergone minor changes to fit into the
GNU C Library and to fit the ISO C standard, but the functional code is Berkeley’s.
• The Internet-related code (most of the inet subdirectory) and several other miscel-
laneous functions and header files have been included from 4.4 BSD with little or no
modification. The copying permission notice for this code can be found in the file
LICENSES in the source distribution.
• The getaddrinfo and getnameinfo functions and supporting code were written by
Craig Metz; see the file LICENSES for details on their licensing.
• The DNS resolver code is taken directly from BIND 8.2.3-T5B, which includes copy-
righted code from UC Berkeley and from Digital Equipment Corporation. See the file
LICENSES for the text of the DEC license.
• The code to support Sun RPC is taken verbatim from Sun’s rpcsrc-4.0 distribution;
see the file LICENSES for the text of the license.
• The math functions are taken from fdlibm-5.1 by Sun Microsystems, as modified
by J.T. Conklin, Ian Lance Taylor, Ulrich Drepper, Andreas Schwab, and Roland
McGrath.
• Many of the IEEE 64-bit double precision math functions (in the
sysdeps/ieee754/dbl-64 subdirectory) come from the IBM Accurate Math-
ematical Library, contributed by IBM.
Appendix F: Contributors to the GNU C Library 1203
• Many of the IA64 math functions are taken from a collection of “Highly Optimized
Mathematical Functions for Itanium” that Intel makes available under a free license;
see the file LICENSES for details.
1204
documentation will realize, before it is too late, that only free manuals contribute to the
free software community.
If you are writing documentation, please insist on publishing it under the GNU Free
Documentation License or another free documentation license. Remember that this deci-
sion requires your approval—you don’t have to let the publisher decide. Some commercial
publishers will use a free license if you insist, but they will not propose the option; it is up
to you to raise the issue and say firmly that this is what you want. If the publisher you
are dealing with refuses, please try other publishers. If you’re not sure whether a proposed
license is free, write to licensing@gnu.org.
You can encourage commercial publishers to sell more free, copylefted manuals and
tutorials by buying them, and particularly by buying copies from the publishers that paid
for their writing or for major improvements. Meanwhile, try to avoid buying non-free
documentation at all. Check the distribution terms of a manual before you buy it, and
insist that whoever seeks your business must respect your freedom. Check the history of
the book, and try reward the publishers that have paid or pay the authors to work on it.
The Free Software Foundation maintains a list of free documentation published by other
publishers, at https://www.fsf.org/doc/other-free-books.html.
1206
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence the
version number 2.1.]
Preamble
The licenses for most software are designed to take away your freedom to share and change
it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom
to share and change free software—to make sure the software is free for all its users.
This license, the Lesser General Public License, applies to some specially designated
software—typically libraries—of the Free Software Foundation and other authors who decide
to use it. You can use it too, but we suggest you first think carefully about whether this
license or the ordinary General Public License is the better strategy to use in any particular
case, based on the explanations below.
When we speak of free software, we are referring to freedom of use, not price. Our
General Public Licenses are designed to make sure that you have the freedom to distribute
copies of free software (and charge for this service if you wish); that you receive source code
or can get it if you want it; that you can change the software and use pieces of it in new
free programs; and that you are informed that you can do these things.
To protect your rights, we need to make restrictions that forbid distributors to deny you
these rights or to ask you to surrender these rights. These restrictions translate to certain
responsibilities for you if you distribute copies of the library or if you modify it.
For example, if you distribute copies of the library, whether gratis or for a fee, you must
give the recipients all the rights that we gave you. You must make sure that they, too,
receive or can get the source code. If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them with the library after
making changes to the library and recompiling it. And you must show them these terms so
they know their rights.
We protect your rights with a two-step method: (1) we copyright the library, and (2) we
offer you this license, which gives you legal permission to copy, distribute and/or modify
the library.
To protect each distributor, we want to make it very clear that there is no warranty for
the free library. Also, if the library is modified by someone else and passed on, the recipients
should know that what they have is not the original version, so that the original author’s
reputation will not be affected by problems that might be introduced by others.
Finally, software patents pose a constant threat to the existence of any free program.
We wish to make sure that a company cannot effectively restrict the users of a free program
Appendix H: GNU Lesser General Public License 1207
by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent
license obtained for a version of the library must be consistent with the full freedom of use
specified in this license.
Most GNU software, including some libraries, is covered by the ordinary GNU General
Public License. This license, the GNU Lesser General Public License, applies to certain
designated libraries, and is quite different from the ordinary General Public License. We
use this license for certain libraries in order to permit linking those libraries into non-free
programs.
When a program is linked with a library, whether statically or using a shared library,
the combination of the two is legally speaking a combined work, a derivative of the original
library. The ordinary General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General Public License permits
more lax criteria for linking other code with the library.
We call this license the Lesser General Public License because it does Less to protect the
user’s freedom than the ordinary General Public License. It also provides other free software
developers Less of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many libraries. However, the
Lesser license provides advantages in certain special circumstances.
For example, on rare occasions, there may be a special need to encourage the widest
possible use of a certain library, so that it becomes a de-facto standard. To achieve this,
non-free programs must be allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this case, there is little to
gain by limiting the free library to free software only, so we use the Lesser General Public
License.
In other cases, permission to use a particular library in non-free programs enables a
greater number of people to use a large body of free software. For example, permission to
use the GNU C Library in non-free programs enables many more people to use the whole
GNU operating system, as well as its variant, the GNU/Linux operating system.
Although the Lesser General Public License is Less protective of the users’ freedom, it
does ensure that the user of a program that is linked with the Library has the freedom and
the wherewithal to run that program using a modified version of the Library.
The precise terms and conditions for copying, distribution and modification follow. Pay
close attention to the difference between a “work based on the library” and a “work that
uses the library”. The former contains code derived from the library, whereas the latter
must be combined with the library in order to run.
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION
AND MODIFICATION
0. This License Agreement applies to any software library or other program which contains
a notice placed by the copyright holder or other authorized party saying it may be
distributed under the terms of this Lesser General Public License (also called “this
License”). Each licensee is addressed as “you”.
A “library” means a collection of software functions and/or data prepared so as to be
conveniently linked with application programs (which use some of those functions and
data) to form executables.
Appendix H: GNU Lesser General Public License 1208
The “Library”, below, refers to any such software library or work which has been
distributed under these terms. A “work based on the Library” means either the Library
or any derivative work under copyright law: that is to say, a work containing the
Library or a portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language. (Hereinafter, translation is included without
limitation in the term “modification”.)
“Source code” for a work means the preferred form of the work for making modifications
to it. For a library, complete source code means all the source code for all modules it
contains, plus any associated interface definition files, plus the scripts used to control
compilation and installation of the library.
Activities other than copying, distribution and modification are not covered by this
License; they are outside its scope. The act of running a program using the Library is
not restricted, and output from such a program is covered only if its contents constitute
a work based on the Library (independent of the use of the Library in a tool for writing
it). Whether that is true depends on what the Library does and what the program
that uses the Library does.
1. You may copy and distribute verbatim copies of the Library’s complete source code
as you receive it, in any medium, provided that you conspicuously and appropriately
publish on each copy an appropriate copyright notice and disclaimer of warranty; keep
intact all the notices that refer to this License and to the absence of any warranty; and
distribute a copy of this License along with the Library.
You may charge a fee for the physical act of transferring a copy, and you may at your
option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Library or any portion of it, thus forming a
work based on the Library, and copy and distribute such modifications or work under
the terms of Section 1 above, provided that you also meet all of these conditions:
a. The modified work must itself be a software library.
b. You must cause the files modified to carry prominent notices stating that you
changed the files and the date of any change.
c. You must cause the whole of the work to be licensed at no charge to all third
parties under the terms of this License.
d. If a facility in the modified Library refers to a function or a table of data to
be supplied by an application program that uses the facility, other than as an
argument passed when the facility is invoked, then you must make a good faith
effort to ensure that, in the event an application does not supply such function or
table, the facility still operates, and performs whatever part of its purpose remains
meaningful.
(For example, a function in a library to compute square roots has a purpose that
is entirely well-defined independent of the application. Therefore, Subsection 2d
requires that any application-supplied function or table used by this function must
be optional: if the application does not supply it, the square root function must
still compute square roots.)
These requirements apply to the modified work as a whole. If identifiable sections of
that work are not derived from the Library, and can be reasonably considered indepen-
dent and separate works in themselves, then this License, and its terms, do not apply
Appendix H: GNU Lesser General Public License 1209
to those sections when you distribute them as separate works. But when you distribute
the same sections as part of a whole which is a work based on the Library, the distri-
bution of the whole must be on the terms of this License, whose permissions for other
licensees extend to the entire whole, and thus to each and every part regardless of who
wrote it.
Thus, it is not the intent of this section to claim rights or contest your rights to
work written entirely by you; rather, the intent is to exercise the right to control the
distribution of derivative or collective works based on the Library.
In addition, mere aggregation of another work not based on the Library with the
Library (or with a work based on the Library) on a volume of a storage or distribution
medium does not bring the other work under the scope of this License.
3. You may opt to apply the terms of the ordinary GNU General Public License instead
of this License to a given copy of the Library. To do this, you must alter all the notices
that refer to this License, so that they refer to the ordinary GNU General Public
License, version 2, instead of to this License. (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify that version
instead if you wish.) Do not make any other change in these notices.
Once this change is made in a given copy, it is irreversible for that copy, so the ordinary
GNU General Public License applies to all subsequent copies and derivative works made
from that copy.
This option is useful when you wish to copy part of the code of the Library into a
program that is not a library.
4. You may copy and distribute the Library (or a portion or derivative of it, under Section
2) in object code or executable form under the terms of Sections 1 and 2 above provided
that you accompany it with the complete corresponding machine-readable source code,
which must be distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange.
If distribution of object code is made by offering access to copy from a designated place,
then offering equivalent access to copy the source code from the same place satisfies the
requirement to distribute the source code, even though third parties are not compelled
to copy the source along with the object code.
5. A program that contains no derivative of any portion of the Library, but is designed
to work with the Library by being compiled or linked with it, is called a “work that
uses the Library”. Such a work, in isolation, is not a derivative work of the Library,
and therefore falls outside the scope of this License.
However, linking a “work that uses the Library” with the Library creates an executable
that is a derivative of the Library (because it contains portions of the Library), rather
than a “work that uses the library”. The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.
When a “work that uses the Library” uses material from a header file that is part of
the Library, the object code for the work may be a derivative work of the Library even
though the source code is not. Whether this is true is especially significant if the work
can be linked without the Library, or if the work is itself a library. The threshold for
this to be true is not precisely defined by law.
Appendix H: GNU Lesser General Public License 1210
If such an object file uses only numerical parameters, data structure layouts and ac-
cessors, and small macros and small inline functions (ten lines or less in length), then
the use of the object file is unrestricted, regardless of whether it is legally a derivative
work. (Executables containing this object code plus portions of the Library will still
fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may distribute the object code
for the work under the terms of Section 6. Any executables containing that work also
fall under Section 6, whether or not they are linked directly with the Library itself.
6. As an exception to the Sections above, you may also combine or link a “work that
uses the Library” with the Library to produce a work containing portions of the Li-
brary, and distribute that work under terms of your choice, provided that the terms
permit modification of the work for the customer’s own use and reverse engineering for
debugging such modifications.
You must give prominent notice with each copy of the work that the Library is used
in it and that the Library and its use are covered by this License. You must supply
a copy of this License. If the work during execution displays copyright notices, you
must include the copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License. Also, you must do one of these things:
a. Accompany the work with the complete corresponding machine-readable source
code for the Library including whatever changes were used in the work (which must
be distributed under Sections 1 and 2 above); and, if the work is an executable
linked with the Library, with the complete machine-readable “work that uses the
Library”, as object code and/or source code, so that the user can modify the
Library and then relink to produce a modified executable containing the modified
Library. (It is understood that the user who changes the contents of definitions
files in the Library will not necessarily be able to recompile the application to use
the modified definitions.)
b. Use a suitable shared library mechanism for linking with the Library. A suitable
mechanism is one that (1) uses at run time a copy of the library already present
on the user’s computer system, rather than copying library functions into the
executable, and (2) will operate properly with a modified version of the library, if
the user installs one, as long as the modified version is interface-compatible with
the version that the work was made with.
c. Accompany the work with a written offer, valid for at least three years, to give the
same user the materials specified in Subsection 6a, above, for a charge no more
than the cost of performing this distribution.
d. If distribution of the work is made by offering access to copy from a designated
place, offer equivalent access to copy the above specified materials from the same
place.
e. Verify that the user has already received a copy of these materials or that you have
already sent this user a copy.
For an executable, the required form of the “work that uses the Library” must include
any data and utility programs needed for reproducing the executable from it. However,
as a special exception, the materials to be distributed need not include anything that
is normally distributed (in either source or binary form) with the major components
Appendix H: GNU Lesser General Public License 1211
(compiler, kernel, and so on) of the operating system on which the executable runs,
unless that component itself accompanies the executable.
It may happen that this requirement contradicts the license restrictions of other pro-
prietary libraries that do not normally accompany the operating system. Such a con-
tradiction means you cannot use both them and the Library together in an executable
that you distribute.
7. You may place library facilities that are a work based on the Library side-by-side in
a single library together with other library facilities not covered by this License, and
distribute such a combined library, provided that the separate distribution of the work
based on the Library and of the other library facilities is otherwise permitted, and
provided that you do these two things:
a. Accompany the combined library with a copy of the same work based on the
Library, uncombined with any other library facilities. This must be distributed
under the terms of the Sections above.
b. Give prominent notice with the combined library of the fact that part of it is a work
based on the Library, and explaining where to find the accompanying uncombined
form of the same work.
8. You may not copy, modify, sublicense, link with, or distribute the Library except
as expressly provided under this License. Any attempt otherwise to copy, modify,
sublicense, link with, or distribute the Library is void, and will automatically terminate
your rights under this License. However, parties who have received copies, or rights,
from you under this License will not have their licenses terminated so long as such
parties remain in full compliance.
9. You are not required to accept this License, since you have not signed it. However,
nothing else grants you permission to modify or distribute the Library or its derivative
works. These actions are prohibited by law if you do not accept this License. Therefore,
by modifying or distributing the Library (or any work based on the Library), you
indicate your acceptance of this License to do so, and all its terms and conditions for
copying, distributing or modifying the Library or works based on it.
10. Each time you redistribute the Library (or any work based on the Library), the recipient
automatically receives a license from the original licensor to copy, distribute, link with
or modify the Library subject to these terms and conditions. You may not impose any
further restrictions on the recipients’ exercise of the rights granted herein. You are not
responsible for enforcing compliance by third parties with this License.
11. If, as a consequence of a court judgment or allegation of patent infringement or for any
other reason (not limited to patent issues), conditions are imposed on you (whether by
court order, agreement or otherwise) that contradict the conditions of this License, they
do not excuse you from the conditions of this License. If you cannot distribute so as
to satisfy simultaneously your obligations under this License and any other pertinent
obligations, then as a consequence you may not distribute the Library at all. For
example, if a patent license would not permit royalty-free redistribution of the Library
by all those who receive copies directly or indirectly through you, then the only way
you could satisfy both it and this License would be to refrain entirely from distribution
of the Library.
Appendix H: GNU Lesser General Public License 1212
If any portion of this section is held invalid or unenforceable under any particular
circumstance, the balance of the section is intended to apply, and the section as a
whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any patents or other
property right claims or to contest validity of any such claims; this section has the
sole purpose of protecting the integrity of the free software distribution system which
is implemented by public license practices. Many people have made generous contri-
butions to the wide range of software distributed through that system in reliance on
consistent application of that system; it is up to the author/donor to decide if he or
she is willing to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to be a consequence
of the rest of this License.
12. If the distribution and/or use of the Library is restricted in certain countries either
by patents or by copyrighted interfaces, the original copyright holder who places the
Library under this License may add an explicit geographical distribution limitation
excluding those countries, so that distribution is permitted only in or among countries
not thus excluded. In such case, this License incorporates the limitation as if written
in the body of this License.
13. The Free Software Foundation may publish revised and/or new versions of the Lesser
General Public License from time to time. Such new versions will be similar in spirit
to the present version, but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Library specifies a version
number of this License which applies to it and “any later version”, you have the option of
following the terms and conditions either of that version or of any later version published
by the Free Software Foundation. If the Library does not specify a license version
number, you may choose any version ever published by the Free Software Foundation.
14. If you wish to incorporate parts of the Library into other free programs whose distribu-
tion conditions are incompatible with these, write to the author to ask for permission.
For software which is copyrighted by the Free Software Foundation, write to the Free
Software Foundation; we sometimes make exceptions for this. Our decision will be
guided by the two goals of preserving the free status of all derivatives of our free soft-
ware and of promoting the sharing and reuse of software generally.
NO WARRANTY
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLI-
CABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPY-
RIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY “AS IS”
WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH
YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST
OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
Appendix H: GNU Lesser General Public License 1213
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
USA.
Also add information on how to contact you by electronic and paper mail.
You should also get your employer (if you work as a programmer) or your school, if any,
to sign a “copyright disclaimer” for the library, if necessary. Here is a sample; alter the
names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the library
`Frob' (a library for tweaking knobs) written by James Random Hacker.
under this License. If a section does not fit the above definition of Secondary then it is
not allowed to be designated as Invariant. The Document may contain zero Invariant
Sections. If the Document does not identify any Invariant Sections then there are none.
The “Cover Texts” are certain short passages of text that are listed, as Front-Cover
Texts or Back-Cover Texts, in the notice that says that the Document is released under
this License. A Front-Cover Text may be at most 5 words, and a Back-Cover Text may
be at most 25 words.
A “Transparent” copy of the Document means a machine-readable copy, represented
in a format whose specification is available to the general public, that is suitable for
revising the document straightforwardly with generic text editors or (for images com-
posed of pixels) generic paint programs or (for drawings) some widely available drawing
editor, and that is suitable for input to text formatters or for automatic translation to
a variety of formats suitable for input to text formatters. A copy made in an otherwise
Transparent file format whose markup, or absence of markup, has been arranged to
thwart or discourage subsequent modification by readers is not Transparent. An image
format is not Transparent if used for any substantial amount of text. A copy that is
not “Transparent” is called “Opaque”.
Examples of suitable formats for Transparent copies include plain ASCII without
markup, Texinfo input format, LaTEX input format, SGML or XML using a publicly
available DTD, and standard-conforming simple HTML, PostScript or PDF designed
for human modification. Examples of transparent image formats include PNG, XCF
and JPG. Opaque formats include proprietary formats that can be read and edited
only by proprietary word processors, SGML or XML for which the DTD and/or pro-
cessing tools are not generally available, and the machine-generated HTML, PostScript
or PDF produced by some word processors for output purposes only.
The “Title Page” means, for a printed book, the title page itself, plus such following
pages as are needed to hold, legibly, the material this License requires to appear in the
title page. For works in formats which do not have any title page as such, “Title Page”
means the text near the most prominent appearance of the work’s title, preceding the
beginning of the body of the text.
The “publisher” means any person or entity that distributes copies of the Document
to the public.
A section “Entitled XYZ” means a named subunit of the Document whose title either
is precisely XYZ or contains XYZ in parentheses following text that translates XYZ in
another language. (Here XYZ stands for a specific section name mentioned below, such
as “Acknowledgements”, “Dedications”, “Endorsements”, or “History”.) To “Preserve
the Title” of such a section when you modify the Document means that it remains a
section “Entitled XYZ” according to this definition.
The Document may include Warranty Disclaimers next to the notice which states that
this License applies to the Document. These Warranty Disclaimers are considered to
be included by reference in this License, but only as regards disclaiming warranties:
any other implication that these Warranty Disclaimers may have is void and has no
effect on the meaning of this License.
2. VERBATIM COPYING
Appendix I: GNU Free Documentation License 1217
You may copy and distribute the Document in any medium, either commercially or
noncommercially, provided that this License, the copyright notices, and the license
notice saying this License applies to the Document are reproduced in all copies, and
that you add no other conditions whatsoever to those of this License. You may not use
technical measures to obstruct or control the reading or further copying of the copies
you make or distribute. However, you may accept compensation in exchange for copies.
If you distribute a large enough number of copies you must also follow the conditions
in section 3.
You may also lend copies, under the same conditions stated above, and you may publicly
display copies.
3. COPYING IN QUANTITY
If you publish printed copies (or copies in media that commonly have printed covers) of
the Document, numbering more than 100, and the Document’s license notice requires
Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all
these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover. Both covers must also clearly and legibly identify you as the publisher
of these copies. The front cover must present the full title with all words of the title
equally prominent and visible. You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve the title of the
Document and satisfy these conditions, can be treated as verbatim copying in other
respects.
If the required texts for either cover are too voluminous to fit legibly, you should put
the first ones listed (as many as fit reasonably) on the actual cover, and continue the
rest onto adjacent pages.
If you publish or distribute Opaque copies of the Document numbering more than 100,
you must either include a machine-readable Transparent copy along with each Opaque
copy, or state in or with each Opaque copy a computer-network location from which
the general network-using public has access to download using public-standard network
protocols a complete Transparent copy of the Document, free of added material. If
you use the latter option, you must take reasonably prudent steps, when you begin
distribution of Opaque copies in quantity, to ensure that this Transparent copy will
remain thus accessible at the stated location until at least one year after the last time
you distribute an Opaque copy (directly or through your agents or retailers) of that
edition to the public.
It is requested, but not required, that you contact the authors of the Document well
before redistributing any large number of copies, to give them a chance to provide you
with an updated version of the Document.
4. MODIFICATIONS
You may copy and distribute a Modified Version of the Document under the conditions
of sections 2 and 3 above, provided that you release the Modified Version under precisely
this License, with the Modified Version filling the role of the Document, thus licensing
distribution and modification of the Modified Version to whoever possesses a copy of
it. In addition, you must do these things in the Modified Version:
A. Use in the Title Page (and on the covers, if any) a title distinct from that of the
Document, and from those of previous versions (which should, if there were any,
Appendix I: GNU Free Documentation License 1218
be listed in the History section of the Document). You may use the same title as
a previous version if the original publisher of that version gives permission.
B. List on the Title Page, as authors, one or more persons or entities responsible for
authorship of the modifications in the Modified Version, together with at least five
of the principal authors of the Document (all of its principal authors, if it has fewer
than five), unless they release you from this requirement.
C. State on the Title page the name of the publisher of the Modified Version, as the
publisher.
D. Preserve all the copyright notices of the Document.
E. Add an appropriate copyright notice for your modifications adjacent to the other
copyright notices.
F. Include, immediately after the copyright notices, a license notice giving the public
permission to use the Modified Version under the terms of this License, in the form
shown in the Addendum below.
G. Preserve in that license notice the full lists of Invariant Sections and required Cover
Texts given in the Document’s license notice.
H. Include an unaltered copy of this License.
I. Preserve the section Entitled “History”, Preserve its Title, and add to it an item
stating at least the title, year, new authors, and publisher of the Modified Version
as given on the Title Page. If there is no section Entitled “History” in the Docu-
ment, create one stating the title, year, authors, and publisher of the Document
as given on its Title Page, then add an item describing the Modified Version as
stated in the previous sentence.
J. Preserve the network location, if any, given in the Document for public access to
a Transparent copy of the Document, and likewise the network locations given in
the Document for previous versions it was based on. These may be placed in the
“History” section. You may omit a network location for a work that was published
at least four years before the Document itself, or if the original publisher of the
version it refers to gives permission.
K. For any section Entitled “Acknowledgements” or “Dedications”, Preserve the Title
of the section, and preserve in the section all the substance and tone of each of the
contributor acknowledgements and/or dedications given therein.
L. Preserve all the Invariant Sections of the Document, unaltered in their text and
in their titles. Section numbers or the equivalent are not considered part of the
section titles.
M. Delete any section Entitled “Endorsements”. Such a section may not be included
in the Modified Version.
N. Do not retitle any existing section to be Entitled “Endorsements” or to conflict in
title with any Invariant Section.
O. Preserve any Warranty Disclaimers.
If the Modified Version includes new front-matter sections or appendices that qualify
as Secondary Sections and contain no material copied from the Document, you may at
your option designate some or all of these sections as invariant. To do this, add their
Appendix I: GNU Free Documentation License 1219
titles to the list of Invariant Sections in the Modified Version’s license notice. These
titles must be distinct from any other section titles.
You may add a section Entitled “Endorsements”, provided it contains nothing but
endorsements of your Modified Version by various parties—for example, statements of
peer review or that the text has been approved by an organization as the authoritative
definition of a standard.
You may add a passage of up to five words as a Front-Cover Text, and a passage of up
to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified
Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be
added by (or through arrangements made by) any one entity. If the Document already
includes a cover text for the same cover, previously added by you or by arrangement
made by the same entity you are acting on behalf of, you may not add another; but
you may replace the old one, on explicit permission from the previous publisher that
added the old one.
The author(s) and publisher(s) of the Document do not by this License give permission
to use their names for publicity for or to assert or imply endorsement of any Modified
Version.
5. COMBINING DOCUMENTS
You may combine the Document with other documents released under this License,
under the terms defined in section 4 above for modified versions, provided that you
include in the combination all of the Invariant Sections of all of the original documents,
unmodified, and list them all as Invariant Sections of your combined work in its license
notice, and that you preserve all their Warranty Disclaimers.
The combined work need only contain one copy of this License, and multiple identical
Invariant Sections may be replaced with a single copy. If there are multiple Invariant
Sections with the same name but different contents, make the title of each such section
unique by adding at the end of it, in parentheses, the name of the original author or
publisher of that section if known, or else a unique number. Make the same adjustment
to the section titles in the list of Invariant Sections in the license notice of the combined
work.
In the combination, you must combine any sections Entitled “History” in the vari-
ous original documents, forming one section Entitled “History”; likewise combine any
sections Entitled “Acknowledgements”, and any sections Entitled “Dedications”. You
must delete all sections Entitled “Endorsements.”
6. COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents released
under this License, and replace the individual copies of this License in the various
documents with a single copy that is included in the collection, provided that you
follow the rules of this License for verbatim copying of each of the documents in all
other respects.
You may extract a single document from such a collection, and distribute it individu-
ally under this License, provided you insert a copy of this License into the extracted
document, and follow this License in all other respects regarding verbatim copying of
that document.
Appendix I: GNU Free Documentation License 1220
Concept Index
! alloca disadvantages . . . . . . . . . . . . . . . . . . . . . . . . . . 76
!posix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 alloca function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
allocating file storage . . . . . . . . . . . . . . . . . . . . . . . . . 453
allocating pseudo-terminals . . . . . . . . . . . . . . . . . . . 538
. allocation (obstacks) . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
.lib section in a.out corrupted . . . . . . . . . . . . . . . . . . 36 allocation debugging . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
allocation of memory with malloc . . . . . . . . . . . . . . 47
allocation size of string . . . . . . . . . . . . . . . . . . . . . . . . . 99
/ allocation statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
/condition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 alphabetic character . . . . . . . . . . . . . . . . . . . . . . . . 89, 92
/etc/hostname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 929 alphanumeric character . . . . . . . . . . . . . . . . . . . . . 89, 92
/etc/nsswitch.conf . . . . . . . . . . . . . . . . . . . . . . . . . . 889 alternative malloc implementations . . . . . . . . . . . . 63
append-access files . . . . . . . . . . . . . . . . . . . . . . . . . . . . 267
argc (program argument count) . . . . . . . . . . . . . . . 811
: argp (program argument parser) . . . . . . . . . . . . . . 820
:identifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 argp parser functions . . . . . . . . . . . . . . . . . . . . . . . . . 824
ARGP HELP FMT environment variable . . . . . 841
Argument list too long . . . . . . . . . . . . . . . . . . . . . . . . . 26
? argument parsing with argp . . . . . . . . . . . . . . . . . . . 820
? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 argument promotion . . . . . . . . . . . . . . . . . . . . . . . . . 1020
argument vectors, null-byte separated . . . . . . . . . 138
arguments (variadic functions) . . . . . . . . . . . . . . . 1019
arguments, how many. . . . . . . . . . . . . . . . . . . . . . . . 1019
_POSIX_OPTION_ORDER environment variable. . . 848 arguments, to program . . . . . . . . . . . . . . . . . . . . . . . . 811
_POSIX_SAVED_IDS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 899 argv (program argument vector) . . . . . . . . . . . . . . 811
argz vectors (string vectors) . . . . . . . . . . . . . . . . . . . 138
4 arithmetic expansion . . . . . . . . . . . . . . . . . . . . . . . . . . 258
array comparison functions. . . . . . . . . . . . . . . . . . . . 115
4.n BSD Unix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 array copy functions . . . . . . . . . . . . . . . . . . . . . . . . . . 102
array search function . . . . . . . . . . . . . . . . . . . . . . . . . 231
A array sort function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232
AS-Safe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
abort signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 770
AS-Unsafe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
aborting a program . . . . . . . . . . . . . . . . . . . . . . . . . . . 853
ASCII character . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
absolute file name. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 268
absolute priority . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 742 assertions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1016
absolute value functions . . . . . . . . . . . . . . . . . . . . . . . 660 Async-Cancel-Safe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
AC-Safe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Async-Cancel-Unsafe . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
AC-Unsafe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Async-Signal-Safe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
accepting connections . . . . . . . . . . . . . . . . . . . . . . . . . 493 Async-Signal-Unsafe . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
access permission for a file . . . . . . . . . . . . . . . . . . . . 445 Attempting to link in too many shared libraries . 36
access, testing for . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 447 attributes of a file . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 434
Accessing a corrupted shared library . . . . . . . . . . . 36 Authentication error . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
accessing directories . . . . . . . . . . . . . . . . . . . . . . . . . . 413 automatic freeing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
Address already in use . . . . . . . . . . . . . . . . . . . . . . . . . 30 automatic memory allocation. . . . . . . . . . . . . . . . . . . 46
Address family not supported by protocol . . . . . . 30 automatic storage class . . . . . . . . . . . . . . . . . . . . . . . . 46
address of socket . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 466 automatic storage with variable size . . . . . . . . . . . . 75
address space . . . . . . . . . . . . . . . . . . . . . . . . . . . . 754, 811 auxiliary vector . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 848
Advertise error. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 auxiliary vector (diagnostics) . . . . . . . . . . . . . . . . . . 986
alarm signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 772
alarms, setting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 731
aliases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 888
alignment (in obstacks) . . . . . . . . . . . . . . . . . . . . . . . . 72
alignment (with malloc) . . . . . . . . . . . . . . . . . . . . . . . 52
Concept Index 1224
format string, for printf . . . . . . . . . . . . . . . . . . . . . . 292 hook functions (of custom streams) . . . . . . . . . . . 341
format string, for scanf . . . . . . . . . . . . . . . . . . . . . . . 315 host address, Internet . . . . . . . . . . . . . . . . . . . . . . . . . 474
formatted input from a stream . . . . . . . . . . . . . . . . 315 Host is down . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
formatted messages . . . . . . . . . . . . . . . . . . . . . . . . . . . 342 host name . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928
formatted output to a stream . . . . . . . . . . . . . . . . . 292 hostid. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
FP arithmetic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 668 hostname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928
FQDN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928 hosts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 888
fragmentation of files . . . . . . . . . . . . . . . . . . . . . . . . . 453 hosts database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 478
frame, real memory . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 how many arguments . . . . . . . . . . . . . . . . . . . . . . . . 1019
free documentation . . . . . . . . . . . . . . . . . . . . . . . . . . 1204 hwcap tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1012
freeing (obstacks) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 HWCAP (diagnostics) . . . . . . . . . . . . . . . . . . . . . . . . 985
freeing memory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 hwcaps tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1012
freeing memory allocated with malloc . . . . . . . . . . 49 hyperbolic functions . . . . . . . . . . . . . . . . . . . . . . 562, 563
fully buffered stream . . . . . . . . . . . . . . . . . . . . . . . . . . 333
Function not implemented . . . . . . . . . . . . . . . . . . . . . 32
function prototypes (variadic) . . . . . . . . . . . . . . . . 1018 I
i18n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
iconv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
G Identifier removed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
gamma function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565 identifying terminals . . . . . . . . . . . . . . . . . . . . . . . . . . 513
gcvt r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 691 IEEE 754 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 647
gencat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211 IEEE floating point . . . . . . . . . . . . . . . . . . . . . . . . . . . 647
generation of signals . . . . . . . . . . . . . . . . . . . . . . . . . . 766 IEEE floating point representation . . . . . . . . . . . 1030
generic i/o control operations . . . . . . . . . . . . . . . . . 409 IEEE Std 1003.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
globbing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244 IEEE Std 1003.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
gmon tunables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1015 ignore action for a signal . . . . . . . . . . . . . . . . . . . . . . 777
gnu allocator. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 illegal instruction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 770
graphic character . . . . . . . . . . . . . . . . . . . . . . . . . . . 90, 93 Illegal seek . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
Gratuitous error . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 impossible events . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1016
Gregorian calendar . . . . . . . . . . . . . . . . . . . . . . . . . . . 696 Inappropriate file type or format . . . . . . . . . . . . . . . 32
group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 888 Inappropriate ioctl for device . . . . . . . . . . . . . . . . . . . 27
group database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 921 Inappropriate operation for background process . 33
group ID . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 898 independent channels . . . . . . . . . . . . . . . . . . . . . . . . . 360
group name . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 898 inexact exception . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650
group owner of a file . . . . . . . . . . . . . . . . . . . . . . . . . . 442 infinity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 652
grouping of digits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192 init . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
growing objects (in obstacks) . . . . . . . . . . . . . . . . . . . 68 initgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 888
gshadow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 888 initial signal actions . . . . . . . . . . . . . . . . . . . . . . . . . . 783
inode number . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 437
input available signal . . . . . . . . . . . . . . . . . . . . . . . . . 773
H input conversions, for scanf . . . . . . . . . . . . . . . . . . . 317
handling multiple signals . . . . . . . . . . . . . . . . . . . . . . 787 input from multiple files . . . . . . . . . . . . . . . . . . . . . . 374
hangup signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 772 Input/output error . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
hard limit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 738 installation tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1170
hard link . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 427 installing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1169
hardware capability tunables . . . . . . . . . . . . . . . . . 1012 integer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 644
header files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 integer division functions. . . . . . . . . . . . . . . . . . . . . . 645
heap . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 integer type range . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
heap consistency checking . . . . . . . . . . . . . . . . . . . . . . 55 integer type width . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
heap, dynamic allocation from . . . . . . . . . . . . . . . . . 47 interactive signals, from terminal . . . . . . . . . . . . . . 524
heap, freeing memory from . . . . . . . . . . . . . . . . . . . . . 49 interactive stop signal . . . . . . . . . . . . . . . . . . . . . . . . . 774
hexadecimal digit character . . . . . . . . . . . . . . . . . 89, 95 internal representation . . . . . . . . . . . . . . . . . . . . . . . . 143
hidden bit (of floating point number mantissa) . 1027 internationalization . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
hierarchy, directory . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 Internet host address . . . . . . . . . . . . . . . . . . . . . . . . . 474
high-priority data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 500 Internet namespace, for sockets . . . . . . . . . . . . . . . 472
holes in files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 356 interposing malloc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
home directory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 847 interprocess communication, with FIFO . . . . . . . 462
HOME environment variable . . . . . . . . . . . . . . . . . . . . 847 interprocess communication, with pipes . . . . . . . 459
Concept Index 1228
X
xmalloc function. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 Z
xrealloc and xreallocarray functions . . . . . . . . 51 zero divide . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650
1236
Type Index
G
__ftw_func_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 gid_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 900
__ftw64_func_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 glibc.cpu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1012
__nftw_func_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424 glibc.cpu.cached_memopt . . . . . . . . . . . . . . . . . . . 1012
__nftw64_func_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424 glibc.cpu.hwcaps . . . . . . . . . . . . . . . . . . . . . . . . . . . 1012
glibc.cpu.name . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1012
glibc.cpu.plt_rewrite . . . . . . . . . . . . . . . . . . . . . 1014
glibc.cpu.prefer_map_32bit_exec. . . . . . . . . . 1014
B glibc.cpu.x86_data_cache_size . . . . . . . . . . . . 1012
blkcnt_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 438 glibc.cpu.x86_ibt . . . . . . . . . . . . . . . . . . . . . . . . . . 1013
glibc.cpu.x86_memset_non_temporal_
blkcnt64_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 438
threshold . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1013
glibc.cpu.x86_non_temporal_threshold . . . . 1013
glibc.cpu.x86_rep_movsb_threshold . . . . . . . 1013
C glibc.cpu.x86_rep_stosb_threshold . . . . . . . 1013
glibc.cpu.x86_shared_cache_size. . . . . . . . . . 1013
cc_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 516 glibc.cpu.x86_shstk . . . . . . . . . . . . . . . . . . . . . . . 1013
clock_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 697 glibc.elision . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1010
clockid_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 702 glibc.elision.enable . . . . . . . . . . . . . . . . . . . . . . 1010
cnd_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 975 glibc.elision.skip_lock_after_retries . . . 1010
comparison_fn_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231 glibc.elision.skip_lock_busy . . . . . . . . . . . . . 1010
cookie_close_function_t . . . . . . . . . . . . . . . . . . . . 341 glibc.elision.skip_lock_internal_abort . 1010
cookie_io_functions_t . . . . . . . . . . . . . . . . . . . . . . 340 glibc.elision.skip_trylock_internal_
cookie_read_function_t . . . . . . . . . . . . . . . . . . . . . 341 abort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1011
cookie_seek_function_t . . . . . . . . . . . . . . . . . . . . . 341 glibc.elision.tries . . . . . . . . . . . . . . . . . . . . . . . 1011
cookie_write_function_t . . . . . . . . . . . . . . . . . . . . 341 glibc.gmon . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1015
cpu_set_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 751 glibc.malloc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1006
glibc.malloc.arena_max . . . . . . . . . . . . . . . . . . . . 1008
glibc.malloc.arena_test . . . . . . . . . . . . . . . . . . . 1008
glibc.malloc.check . . . . . . . . . . . . . . . . . . . . . . . . 1006
D glibc.malloc.hugetlb . . . . . . . . . . . . . . . . . . . . . . 1009
dev_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 438 glibc.malloc.mmap_max . . . . . . . . . . . . . . . . . . . . . 1007
DIR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 415 glibc.malloc.mmap_threshold . . . . . . . . . . . . . . 1007
div_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 645 glibc.malloc.mxfast . . . . . . . . . . . . . . . . . . . . . . . 1008
glibc.malloc.perturb . . . . . . . . . . . . . . . . . . . . . . 1007
glibc.malloc.tcache_count . . . . . . . . . . . . . . . . 1008
glibc.malloc.tcache_max . . . . . . . . . . . . . . . . . . . 1008
E glibc.malloc.tcache_unsorted_limit . . . . . . 1008
glibc.malloc.top_pad . . . . . . . . . . . . . . . . . . . . . . 1006
ENTRY. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
glibc.malloc.trim_threshold . . . . . . . . . . . . . . 1007
enum mcheck_status . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 glibc.mem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1014
glibc.mem.decorate_maps . . . . . . . . . . . . . . . . . . . 1014
glibc.mem.maxarcs . . . . . . . . . . . . . . . . . . . . . . . . . . 1015
F glibc.mem.minarcs . . . . . . . . . . . . . . . . . . . . . . . . . . 1015
glibc.mem.tagging . . . . . . . . . . . . . . . . . . . . . . . . . . 1014
fd_set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375 glibc.pthread . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1011
FILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270 glibc.pthread.mutex_spin_count . . . . . . . . . . . 1011
fpos_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 332 glibc.pthread.rseq . . . . . . . . . . . . . . . . . . . . . . . . 1011
fpos64_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 332 glibc.pthread.stack_cache_size . . . . . . . . . . . 1011
glibc.pthread.stack_hugetlb . . . . . . . . . . . . . . 1012
glibc.rtld . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1009
glibc.rtld.dynamic_sort . . . . . . . . . . . . . . . . . . . 1010
glibc.rtld.enable_secure . . . . . . . . . . . . . . . . . . 1010
glibc.rtld.nns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1009
Type Index 1237
glibc.rtld.optional_static_tls . . . . . . . . . . . 1009 N
glob_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245 nlink_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 438
glob64_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
O
I off_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358
iconv_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 off64_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358
imaxdiv_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 647 once_flag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 972
ino_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 437
ino64_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 438
P
pid_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 857
J printf_arginfo_function . . . . . . . . . . . . . . . . . . . . 313
jmp_buf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 758 printf_function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 312
ptrdiff_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1023
L
ldiv_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 646 R
lldiv_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 646 regex_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 253
longjmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1003 regmatch_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 256
longjmp_target . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1004 regoff_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 256
M S
mbstate_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148 setjmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1003
memory_arena_new . . . . . . . . . . . . . . . . . . . . . . . . . . . 1001 sig_atomic_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 792
memory_arena_retry . . . . . . . . . . . . . . . . . . . . . . . . 1001 sighandler_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 777
memory_arena_reuse . . . . . . . . . . . . . . . . . . . . . . . . 1001 sigjmp_buf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 759
memory_arena_reuse_free_list . . . . . . . . . . . . . 1002 sigset_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 799
memory_arena_reuse_wait . . . . . . . . . . . . . . . . . . . 1001 size_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1023
memory_calloc_retry . . . . . . . . . . . . . . . . . . . . . . . 1000 speed_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526
memory_heap_free . . . . . . . . . . . . . . . . . . . . . . . . . . . 1000 ssize_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 351
memory_heap_less . . . . . . . . . . . . . . . . . . . . . . . . . . . 1000 stack_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 807
memory_heap_more . . . . . . . . . . . . . . . . . . . . . . . . . . . 1000 struct __gconv_step . . . . . . . . . . . . . . . . . . . . . . . . . 175
memory_heap_new . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1000 struct __gconv_step_data . . . . . . . . . . . . . . . . . . . 176
memory_malloc_retry . . . . . . . . . . . . . . . . . . . . . . . 1000 struct aiocb . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 379
memory_mallopt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1002 struct aiocb64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 380
memory_mallopt_arena_max . . . . . . . . . . . . . . . . . . 1003 struct aioinit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 390
memory_mallopt_arena_test . . . . . . . . . . . . . . . . 1002 struct argp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 821
memory_mallopt_free_dyn_thresholds . . . . . . 1003 struct argp_child . . . . . . . . . . . . . . . . . . . . . . . . . . . 830
memory_mallopt_mmap_max . . . . . . . . . . . . . . . . . . . 1002 struct argp_option . . . . . . . . . . . . . . . . . . . . . . . . . . 822
memory_mallopt_mmap_threshold . . . . . . . . . . . . 1002 struct argp_state . . . . . . . . . . . . . . . . . . . . . . . . . . . 827
memory_mallopt_mxfast . . . . . . . . . . . . . . . . . . . . . 1002 struct dirent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 413
memory_mallopt_perturb . . . . . . . . . . . . . . . . . . . . 1002 struct dl_find_object. . . . . . . . . . . . . . . . . . . . . . . 990
memory_mallopt_top_pad . . . . . . . . . . . . . . . . . . . . 1002 struct entry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
memory_mallopt_trim_threshold . . . . . . . . . . . . 1002 struct epoll_event . . . . . . . . . . . . . . . . . . . . . . . . . . 410
memory_memalign_retry . . . . . . . . . . . . . . . . . . . . . 1000 struct exit_status . . . . . . . . . . . . . . . . . . . . . . . . . . 909
memory_realloc_retry . . . . . . . . . . . . . . . . . . . . . . 1000 struct flock . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401
memory_sbrk_less . . . . . . . . . . . . . . . . . . . . . . . . . . . 1000 struct fstab . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 932
memory_sbrk_more . . . . . . . . . . . . . . . . . . . . . . . . . . . 1000 struct FTW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424
memory_tcache_double_free . . . . . . . . . . . . . . . . 1003 struct group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 921
memory_tunable_tcache_count . . . . . . . . . . . . . . 1003 struct hostent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 479
memory_tunable_tcache_max_bytes. . . . . . . . . . 1003 struct if_nameindex . . . . . . . . . . . . . . . . . . . . . . . . . 469
memory_tunable_tcache_unsorted_limit . . . . 1003 struct in_addr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
mode_t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 437 struct in6_addr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
mtx_t. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 973 struct iovec . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361
struct itimerval . . . . . . . . . . . . . . . . . . . . . . . . . . . . 732
Type Index 1238
* acoshfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564
*pthread_getspecific . . . . . . . . . . . . . . . . . . . . . . . 978 acoshl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564
*sbrk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78 acosl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554
*sem_open . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 868 addmntent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 937
addseverity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 344
adjtime . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 708
adjtimex . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 709
aio_cancel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389
__fbufsize . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337
aio_cancel64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 390
__flbf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337
aio_error . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 386
__fpending . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337
aio_error64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 386
__fpurge . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 335
aio_fsync . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 387
__freadable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274
aio_fsync64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388
__freading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274
aio_init . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 391
__fsetlocking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
aio_read . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 381
__fwritable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274
aio_read64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 382
__fwriting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275
aio_return . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 386
__ppc_get_timebase . . . . . . . . . . . . . . . . . . . . . . . . 1187
aio_return64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 387
__ppc_get_timebase_freq . . . . . . . . . . . . . . . . . . . 1187
aio_suspend . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388
__ppc_mdoio. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1187
aio_suspend64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389
__ppc_mdoom. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1188
aio_write . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383
__ppc_set_ppr_low . . . . . . . . . . . . . . . . . . . . . . . . . . 1188
aio_write64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 384
__ppc_set_ppr_med . . . . . . . . . . . . . . . . . . . . . . . . . . 1188
alarm. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 733
__ppc_set_ppr_med_high . . . . . . . . . . . . . . . . . . . . 1188
aligned_alloc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
__ppc_set_ppr_med_low . . . . . . . . . . . . . . . . . . . . . 1188
alloca. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
__ppc_set_ppr_very_low . . . . . . . . . . . . . . . . . . . . 1188
alphasort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 420
__ppc_yield. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1187
alphasort64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 421
__riscv_flush_icache . . . . . . . . . . . . . . . . . . . . . . 1189
arc4random . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 642
__STDC_ENDIAN_BIG__ . . . . . . . . . . . . . . . . . . . . . . . . 692
arc4random_buf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 642
__STDC_ENDIAN_LITTLE__ . . . . . . . . . . . . . . . . . . . . . 692
arc4random_uniform . . . . . . . . . . . . . . . . . . . . . . . . . . 642
__STDC_ENDIAN_NATIVE__ . . . . . . . . . . . . . . . . . . . . . 692 argp_error . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 829
__va_copy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1021 argp_failure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 829
__x86_get_cpuid_feature_leaf . . . . . . . . . . . . . 1189 argp_help . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 832
_dl_find_object . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 991 argp_parse . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 820
_exit. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 854 argp_state_help . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 829
_Exit. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 854 argp_usage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 828
_flushlbf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 argz_add . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
_Fork. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 858 argz_add_sep . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
_tolower . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 argz_append . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
_toupper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 argz_count . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
argz_create . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
argz_create_sep . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
A argz_delete . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
a64l . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 argz_extract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
abort. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 853 argz_insert . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
abs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 660 argz_next . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
accept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493 argz_replace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 448 argz_stringify . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
acos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554 asin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 553
acosf. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554 asinf. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 553
acosfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554 asinfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 553
acosfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554 asinfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 553
acosh. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564 asinh. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564
acoshf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564 asinhf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564
acoshfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564 asinhfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 564
Function and Macro Index 1240
F fgetc_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
fabs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661 fgetgrent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 923
fabsf. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661 fgetgrent_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 923
fabsfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661 fgetpos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 332
fabsfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661 fgetpos64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 332
fabsl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661 fgetpwent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 919
fadd . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 fgetpwent_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 919
faddl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 fgets. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
fchdir . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 413 fgets_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
fchmod . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 447 fgetwc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
fchown . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443 fgetwc_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
fclose . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 fgetws . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
fcloseall . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 fgetws_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
fcntl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 391 fileno . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 359
fcvt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 690 fileno_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 359
fcvt_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 691 finite . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650
FD_CLR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375 finitef . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650
FD_ISSET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375 finitel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650
FD_SET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375 flockfile . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 276
FD_ZERO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375 floor. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664
fdatasync . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 378 floorf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664
fdim . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 floorfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664
fdimf. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 floorfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664
fdimfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 floorl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664
fdimfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 fma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
fdiml. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677 fMaddfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
fdiv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 678 fMaddfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
fdivl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 678 fmaf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
fdopen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358 fmafN. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
fdopendir . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 415 fmafNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
feclearexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 654 fmal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
fedisableexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 660 fmax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
feenableexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 660 fmaxf. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
fegetenv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 658 fmaxfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
fegetexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 660 fmaxfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
fegetexceptflag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 655 fmaximum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
fegetmode . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659 fmaximum_mag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
fegetround . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 657 fmaximum_mag_num . . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
feholdexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 658 fmaximum_mag_numf . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
feof . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326 fmaximum_mag_numfN . . . . . . . . . . . . . . . . . . . . . . . . . . 676
feof_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326 fmaximum_mag_numfNx . . . . . . . . . . . . . . . . . . . . . . . . 676
feraiseexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 654 fmaximum_mag_numl . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
ferror . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326 fmaximum_magf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
ferror_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326 fmaximum_magfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
fesetenv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659 fmaximum_magfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
fesetexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 654 fmaximum_magl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 676
fesetexceptflag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 655 fmaximum_num . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
fesetmode . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659 fmaximum_numf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
fesetround . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 657 fmaximum_numfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
fetestexcept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 654 fmaximum_numfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
fetestexceptflag . . . . . . . . . . . . . . . . . . . . . . . . . . . . 655 fmaximum_numl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
feupdateenv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659 fmaximumf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
fexecve . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 860 fmaximumfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
fflush . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 fmaximumfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
fflush_unlocked . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 fmaximuml . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
ffma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 679 fmaxl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 674
ffmal. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 679 fmaxmag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
fgetc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284 fmaxmagf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
Function and Macro Index 1244
strftime . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 713 T
strftime_l . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 717 tan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 552
strlcat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114 tanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 552
strlcpy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 tanfN. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 552
strlen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100 tanfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 552
strncasecmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118 tanh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
strncat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 tanhf. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
strncmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 tanhfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
strncpy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110 tanhfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
strndup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 tanhl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563
strndupa . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 tanl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 552
strnlen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 tcdrain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 534
strpbrk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 tcflow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 535
strptime . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 719 tcflush . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 534
strrchr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 tcgetattr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 516
tcgetpgrp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 886
strsep . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131
tcgetsid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 887
strsignal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 776
tcsendbreak . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533
strspn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
tcsetattr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 516
strstr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 tcsetpgrp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 886
strtod . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 686 tdelete . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
strtof . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 687 tdestroy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
strtofN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 688 telldir . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 419
strtofNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 688 TEMP_FAILURE_RETRY . . . . . . . . . . . . . . . . . . . . . . . . . . 793
strtoimax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 684 tempnam . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
strtok . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129 textdomain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219
strtok_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 tfind. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
strtol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 681 tgamma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566
strtold . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 687 tgammaf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566
strtoll . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683 tgammafN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566
strtoq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683 tgammafNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566
strtoul . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 682 tgammal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566
strtoull . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 684 tgkill . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 796
strtoumax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 685 thrd_create . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 970
thrd_current . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 971
strtouq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 684
thrd_detach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 972
strverscmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
thrd_equal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 971
strxfrm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
thrd_exit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 971
stty . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533 thrd_join . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 972
success . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 890 thrd_sleep . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 971
SUN_LEN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471 thrd_yield . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 971
swapcontext . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 762 time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 702
swprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 302 timegm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 712
swscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324 timelocal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 712
symlink . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 429 times. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 701
sync . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 378 timespec_get . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 703
syscall . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 850 timespec_getres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 703
sysconf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 946 tmpfile . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
syslog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545 tmpfile64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
system . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 855 tmpnam . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456
sysv_signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 779 tmpnam_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456
toascii . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
tolower . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
totalorder . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
totalorderf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
totalorderfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
totalorderfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
totalorderl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
Function and Macro Index 1254
totalordermag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673 V
totalordermagf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673 va_arg . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1021
totalordermagfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673 va_copy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1021
totalordermagfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673 va_end . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1021
totalordermagl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673 va_start . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1021
toupper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 valloc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
towctrans . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 vasprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306
towlower . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 verr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
towupper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 verrx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
trunc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664 versionsort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 420
truncate . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 451 versionsort64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 421
truncate64 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 451 vfork. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 858
truncf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664 vfprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
truncfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664 vfscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
truncfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664 vfwprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
truncl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 664 vfwscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
tryagain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 890 vlimit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741
tsearch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239 vprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
tss_create . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 976 vscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324
tss_delete . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 977 vsnprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306
tss_get . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 977 vsprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
tss_set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 977 vsscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
ttyname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 513 vswprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306
ttyname_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 513 vswscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
twalk. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241 vsyslog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547
twalk_r . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241 vwarn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
tzset. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 730 vwarnx. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
vwprintf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
vwscanf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
U
ufromfp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666
ufromfpf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666
W
ufromfpfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666 wait . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 864
ufromfpfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666 wait3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 866
ufromfpl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666 wait4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 864
ufromfpx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666 waitpid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 862
ufromfpxf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 666 warn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
ufromfpxfN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 667 warnx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
ufromfpxfNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 667 WCOREDUMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 865
ufromfpxl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 667 wcpcpy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106
ulimit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 wcpncpy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
umask. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 446 wcrtomb . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
umount . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 942 wcscasecmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
umount2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 941 wcscat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108
uname. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 931 wcschr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
unavail . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 890 wcschrnul . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
ungetc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290 wcscmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
ungetwc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290 wcscoll . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
unlink . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431 wcscpy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
unlockpt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 539 wcscspn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128
unsetenv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 846 wcsdup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
updwtmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 914 wcsftime . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 717
utime. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449 wcslcat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
utimes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 450 wcslcpy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
utmpname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 913 wcslen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
utmpxname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 916 wcsncasecmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
wcsncat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
wcsncmp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
Function and Macro Index 1255
( _PC_PATH_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960
(*__gconv_end_fct) . . . . . . . . . . . . . . . . . . . . . . . . . . 181 _PC_PIPE_BUF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960
(*__gconv_fct) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 _PC_PRIO_IO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961
(*__gconv_init_fct) . . . . . . . . . . . . . . . . . . . . . . . . 178 _PC_REC_INCR_XFER_SIZE . . . . . . . . . . . . . . . . . . . . . 961
(void). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 _PC_REC_MAX_XFER_SIZE . . . . . . . . . . . . . . . . . . . . . . 961
_PC_REC_MIN_XFER_SIZE . . . . . . . . . . . . . . . . . . . . . . 961
_PC_REC_XFER_ALIGN . . . . . . . . . . . . . . . . . . . . . . . . . . 961
_PC_SYNC_IO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961
_PC_VDISABLE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961
__libc_single_threaded . . . . . . . . . . . . . . . . . . . . . 981 _POSIX_AIO_LISTIO_MAX . . . . . . . . . . . . . . . . . . . . . . 955
__rseq_flags . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 983 _POSIX_AIO_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
__rseq_offset . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 983 _POSIX_ARG_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
__rseq_size . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 983 _POSIX_C_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
__STDC_WANT_IEC_60559_BFP_EXT__ . . . . . . . . . . . . 19 _POSIX_CHILD_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
__STDC_WANT_IEC_60559_EXT__ . . . . . . . . . . . . . . . . 19 _POSIX_CHOWN_RESTRICTED . . . . . . . . . . . . . . . . . . . . 958
__STDC_WANT_IEC_60559_FUNCS_EXT__ . . . . . . . . . 19 _POSIX_JOB_CONTROL . . . . . . . . . . . . . . . . . . . . . 870, 944
__STDC_WANT_IEC_60559_TYPES_EXT__ . . . . . . . . . 19 _POSIX_LINK_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 959
__STDC_WANT_LIB_EXT2__ . . . . . . . . . . . . . . . . . . . . . . 19 _POSIX_MAX_CANON . . . . . . . . . . . . . . . . . . . . . . . . . . . . 959
_ATFILE_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 _POSIX_MAX_INPUT . . . . . . . . . . . . . . . . . . . . . . . . . . . . 959
_Complex_I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 679 _POSIX_NAME_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 959
_CS_LFS_CFLAGS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 963 _POSIX_NGROUPS_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . 956
_CS_LFS_LDFLAGS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 963 _POSIX_NO_TRUNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 958
_CS_LFS_LIBS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 963 _POSIX_OPEN_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
_CS_LFS_LINTFLAGS . . . . . . . . . . . . . . . . . . . . . . . . . . . 964 _POSIX_PATH_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 959
_CS_LFS64_CFLAGS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 964 _POSIX_PIPE_BUF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 959
_CS_LFS64_LDFLAGS . . . . . . . . . . . . . . . . . . . . . . . . . . . 964 _POSIX_SAVED_IDS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 944
_CS_LFS64_LIBS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 964 _POSIX_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
_CS_LFS64_LINTFLAGS . . . . . . . . . . . . . . . . . . . . . . . . 964 _POSIX_SSIZE_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
_CS_PATH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 963 _POSIX_STREAM_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
_DEFAULT_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 _POSIX_TZNAME_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . 956
_DYNAMIC_STACK_SIZE_SOURCE. . . . . . . . . . . . . . . . . . 20 _POSIX_VDISABLE . . . . . . . . . . . . . . . . . . . . . . . . 527, 958
_FILE_OFFSET_BITS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 _POSIX_VERSION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 945
_FORTIFY_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 _POSIX2_BC_BASE_MAX . . . . . . . . . . . . . . . . . . . . . . . . 962
_GNU_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 _POSIX2_BC_DIM_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . 962
_IOFBF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 336 _POSIX2_BC_SCALE_MAX . . . . . . . . . . . . . . . . . . . . . . . 962
_IOLBF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 336 _POSIX2_BC_STRING_MAX . . . . . . . . . . . . . . . . . . . . . . 962
_IONBF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 336 _POSIX2_C_DEV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 945
_ISOC11_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 _POSIX2_C_VERSION . . . . . . . . . . . . . . . . . . . . . . . . . . . 946
_ISOC23_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 _POSIX2_COLL_WEIGHTS_MAX . . . . . . . . . . . . . . . . . . . 962
_ISOC99_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 _POSIX2_EQUIV_CLASS_MAX . . . . . . . . . . . . . . . . . . . . 963
_LARGEFILE_SOURCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 _POSIX2_EXPR_NEST_MAX . . . . . . . . . . . . . . . . . . . . . . 962
_LARGEFILE64_SOURCE. . . . . . . . . . . . . . . . . . . . . . . . . . 17 _POSIX2_FORT_DEV . . . . . . . . . . . . . . . . . . . . . . . . . . . . 945
_PATH_FSTAB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 932 _POSIX2_FORT_RUN . . . . . . . . . . . . . . . . . . . . . . . . . . . . 945
_PATH_MNTTAB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 932 _POSIX2_LINE_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . 962
_PATH_MOUNTED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 932 _POSIX2_LOCALEDEF . . . . . . . . . . . . . . . . . . . . . . . . . . . 945
_PATH_UTMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 913 _POSIX2_RE_DUP_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . 956
_PATH_WTMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 913 _POSIX2_SW_DEV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 945
_PC_ASYNC_IO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 _REENTRANT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
_PC_CHOWN_RESTRICTED . . . . . . . . . . . . . . . . . . . . . . . 960 _SC_2_C_DEV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 950
_PC_FILESIZEBITS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 _SC_2_FORT_DEV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 950
_PC_LINK_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960 _SC_2_FORT_RUN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 950
_PC_MAX_CANON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960 _SC_2_LOCALEDEF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 950
_PC_MAX_INPUT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960 _SC_2_SW_DEV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 950
_PC_NAME_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960 _SC_2_VERSION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 951
_PC_NO_TRUNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 _SC_AIO_LISTIO_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . 948
Variable and Constant Macro Index 1257
B CURRENCY_SYMBOL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198
B0 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526
B110 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526
B115200 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526
D
B1200. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 D_FMT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
B134 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 D_T_FMT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
B150 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B1800. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B19200 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B200 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B230400 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B2400. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B300 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DAY_7. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
B38400 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 daylight . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 730
B460800 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_DIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029
B4800. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_EPSILON. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
B50 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_MANT_DIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029
B57600 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
B600 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_MAX_10_EXP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
B75 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_MAX_EXP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
B9600. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 526 DBL_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
BC_BASE_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 DBL_MIN_10_EXP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029
BC_DIM_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 DBL_MIN_EXP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029
BC_SCALE_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 DEAD_PROCESS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915
BC_STRING_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 961 DECIMAL_POINT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
BOOT_TIME . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915 DLFO_EH_SEGMENT_TYPE . . . . . . . . . . . . . . . . . . . . . . . 991
BRKINT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519 DLFO_STRUCT_HAS_EH_COUNT . . . . . . . . . . . . . . . . . . . 991
BUFSIZ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 336 DLFO_STRUCT_HAS_EH_DBASE . . . . . . . . . . . . . . . . . . . 991
DT_BLK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
DT_CHR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
C DT_DIR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
CCTS_OFLOW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 DT_FIFO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
CHAR_BIT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024 DT_LNK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
CHAR_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025 DT_REG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
CHAR_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025 DT_SOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
CHAR_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024 DT_UNKNOWN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
CHILD_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 943
CIGNORE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522
CLK_TCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 701 E
CLOCAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521 E2BIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
CLOCK_MONOTONIC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 702 EACCES. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
CLOCK_REALTIME . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 702 EADDRINUSE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
CLOCKS_PER_SEC . . . . . . . . . . . . . . . . . . . . . . . . . 699, 700 EADDRNOTAVAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
CLOSE_RANGE_CLOEXEC . . . . . . . . . . . . . . . . . . . . . . . . 350 EADV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
CLOSE_RANGE_UNSHARE . . . . . . . . . . . . . . . . . . . . . . . . 350 EAFNOSUPPORT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
CODESET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196 EAGAIN. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
COLL_WEIGHTS_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . 962 EALREADY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
COREFILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 769 EAUTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
CPU_SETSIZE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 751 EBACKGROUND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
CREAD. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521 EBADE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
CRNCYSTR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198 EBADF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26, 535
CRTS_IFLOW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 EBADFD. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
CS5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 EBADMSG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
CS6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 EBADR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
CS7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 EBADRPC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
CS8 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 EBADRQC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
CSIZE. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 EBADSLT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
CSTOPB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521 EBFONT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Variable and Constant Macro Index 1260
EBUSY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 EMLINK. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
ECANCELED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 EMPTY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915
ECHILD. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 EMSGSIZE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
ECHO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 EMULTIHOP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
ECHOCTL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524 ENAMETOOLONG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
ECHOE. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 ENAVAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
ECHOK. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 endorder . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
ECHOKE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 ENEEDAUTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
ECHONL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 ENETDOWN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
ECHOPRT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 ENETRESET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
ECHRNG. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ENETUNREACH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
ECOMM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ENFILE. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
ECONNABORTED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ENOANO. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
ECONNREFUSED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ENOBUFS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
ECONNRESET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ENOCSI. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
ED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENODATA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
EDEADLK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 ENODEV. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
EDEADLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ENOENT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
EDESTADDRREQ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ENOEXEC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
EDIED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENOKEY. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
EDOM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ENOLCK. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
EDOTDOT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ENOLINK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
EDQUOT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ENOMEDIUM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
EEXIST. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 ENOMEM. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
EFAULT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 ENOMSG. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EFBIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ENONET. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
EFTYPE. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ENOPKG. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
EGRATUITOUS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENOPROTOOPT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
EGREGIOUS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENOSPC. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
EHOSTDOWN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ENOSR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EHOSTUNREACH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ENOSTR. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EHWPOISON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ENOSYS. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
EIDRM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENOTBLK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
EIEIO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENOTCONN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
EILSEQ. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ENOTDIR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
EINPROGRESS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ENOTEMPTY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
EINTR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 ENOTNAM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
EINVAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27, 38, 535 ENOTRECOVERABLE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EIO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 ENOTSOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
EISCONN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ENOTSUP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
EISDIR. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ENOTTY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27, 535
EISNAM. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ENOTUNIQ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
EKEYEXPIRED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 environ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 846
EKEYREJECTED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ENXIO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
EKEYREVOKED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 EOF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326
EL2HLT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 EOPNOTSUPP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
EL2NSYNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 EOVERFLOW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EL3HLT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 EOWNERDEAD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EL3RST. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 EPERM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
ELIBACC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 EPFNOSUPPORT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
ELIBBAD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 EPIPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
ELIBEXEC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 EPROCLIM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
ELIBMAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 EPROCUNAVAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
ELIBSCN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 EPROGMISMATCH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
ELNRNG. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 EPROGUNAVAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
ELOOP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 EPROTO. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
EMEDIUMTYPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 EPROTONOSUPPORT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
EMFILE. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 EPROTOTYPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
Variable and Constant Macro Index 1261
FPE_SUBRNG_TRAP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 769 I
FRAC_DIGITS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
FSETLOCKING_BYCALLER . . . . . . . . . . . . . . . . . . . . . . . 279 I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 680
FSETLOCKING_INTERNAL . . . . . . . . . . . . . . . . . . . . . . . 279 ICANON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523
FSETLOCKING_QUERY . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 ICRNL. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
FSTAB. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 932 IEXTEN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524
FSTAB_RO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 933 IFNAMSIZ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469
FSTAB_RQ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 933 IGNBRK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
FSTAB_RW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 933 IGNCR. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
FSTAB_SW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 933 IGNPAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
FSTAB_XX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 933
IMAXBEL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520
FTW_ACTIONRETVAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . 426
FTW_CHDIR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 426 in6addr_any . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 477
FTW_D. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 in6addr_loopback . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
FTW_DEPTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 426 INADDR_ANY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
FTW_DNR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 INADDR_BROADCAST . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
FTW_DP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424 INADDR_LOOPBACK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
FTW_F. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 INADDR_NONE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 476
FTW_MOUNT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 426 INFINITY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 652
FTW_NS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 INIT_PROCESS . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915
FTW_PHYS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 426
INLCR. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
FTW_SL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423
FTW_SLN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424 INPCK. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 518
INT_CURR_SYMBOL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198
INT_FRAC_DIGITS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
G INT_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
getdate_err . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 724 INT_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
GETFSIZE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 INT_N_CS_PRECEDES . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
GLOB_ABORTED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248 INT_N_SEP_BY_SPACE . . . . . . . . . . . . . . . . . . . . . . . . . . 200
GLOB_ALTDIRFUNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251 INT_N_SIGN_POSN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
GLOB_APPEND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249 INT_P_CS_PRECEDES . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
GLOB_BRACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251 INT_P_SEP_BY_SPACE . . . . . . . . . . . . . . . . . . . . . . . . . . 200
GLOB_DOOFFS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249
INT_P_SIGN_POSN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
GLOB_ERR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249
GLOB_MAGCHAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250 INT_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
GLOB_MARK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250 INTPTR_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
GLOB_NOCHECK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250 IPPORT_RESERVED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483
GLOB_NOESCAPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250 IPPORT_USERRESERVED . . . . . . . . . . . . . . . . . . . . . . . . 483
GLOB_NOMAGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251 ISIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524
GLOB_NOMATCH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248 ISTRIP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
GLOB_NOSORT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250 ITIMER_PROF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 733
GLOB_NOSPACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248 ITIMER_REAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 733
GLOB_ONLYDIR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252
ITIMER_VIRTUAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 733
GLOB_PERIOD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250
GLOB_TILDE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251 IXANY. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520
GLOB_TILDE_CHECK . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252 IXOFF. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520
GROUPING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 IXON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520
H
h_errno . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 480
HOST_NOT_FOUND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 480
HUGE_VAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 656
HUGE_VAL_FN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 656
HUGE_VAL_FNx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 656
HUGE_VALF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 656
HUGE_VALL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 656
HUPCL. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
Variable and Constant Macro Index 1263
L LOG_LOCAL5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
L_ctermid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 884 LOG_LOCAL6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
L_cuserid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 908 LOG_LOCAL7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
L_INCR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331, 358 LOG_LPR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
L_SET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331, 358 LOG_MAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
L_tmpnam . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456 LOG_NDELAY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
L_XTND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331, 358 LOG_NEWS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
LANG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 LOG_NOTICE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547
LANGUAGE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 LOG_ODELAY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
LC_ALL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 LOG_PERROR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 544
LC_COLLATE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 LOG_PID . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
LC_CTYPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 LOG_SYSLOG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
LC_MESSAGES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 LOG_USER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545
LC_MONETARY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 LOG_UUCP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
LC_NUMERIC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 LOG_WARNING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
LC_TIME . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 LOGIN_PROCESS . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915
LDBL_DIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029 LONG_LONG_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1026
LDBL_EPSILON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030 LONG_LONG_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1026
LDBL_MANT_DIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029 LONG_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1026
LDBL_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030 LONG_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
LDBL_MAX_10_EXP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030 LONG_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
LDBL_MAX_EXP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
LDBL_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1030
LDBL_MIN_10_EXP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029 M
LDBL_MIN_EXP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1029 M_1_PI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
leaf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241 M_2_PI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LIM_CORE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 M_2_SQRTPI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
LIM_CPU . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 M_ARENA_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
LIM_DATA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 M_ARENA_TEST . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
LIM_FSIZE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 M_E . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LIM_MAXRSS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 M_LN10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LIM_STACK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 M_LN2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LINE_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 962 M_LOG10E . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LINK_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 957 M_LOG2E . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LIO_NOP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 380 M_MMAP_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
LIO_READ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 380 M_MMAP_THRESHOLD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
LIO_WRITE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 380 M_PERTURB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
LLONG_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1026 M_PI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LLONG_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1026 M_PI_2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LLONG_WIDTH. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024 M_PI_4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
LOCPATH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191 M_SQRT1_2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
LOG_ALERT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 M_SQRT2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
LOG_AUTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545 M_TOP_PAD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
LOG_AUTHPRIV . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 M_TRIM_THRESHOLD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
LOG_CONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 544 MADV_DONTNEED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372
LOG_CRIT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MADV_HUGEPAGE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372
LOG_CRON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MADV_NOHUGEPAGE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
LOG_DAEMON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545 MADV_NORMAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372
LOG_DEBUG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547 MADV_RANDOM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372
LOG_EMERG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MADV_SEQUENTIAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372
LOG_ERR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MADV_WILLNEED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372
LOG_FTP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MAP_32BIT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 368
LOG_INFO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547 MAP_ANON . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367
LOG_LOCAL0 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MAP_ANONYMOUS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367
LOG_LOCAL1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MAP_DENYWRITE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 368
LOG_LOCAL2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MAP_EXECUTABLE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 368
LOG_LOCAL3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MAP_FILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 368
LOG_LOCAL4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546 MAP_FIXED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367
Variable and Constant Macro Index 1264
NSS_STATUS_UNAVAIL . . . . . . . . . . . . . . . . . . . . . . . . . . 893 P
NULL. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1023 P_CS_PRECEDES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
P_SEP_BY_SPACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
P_SIGN_POSN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
P_tmpdir . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
O PA_CHAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
O_ACCMODE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PA_DOUBLE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
O_APPEND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399 PA_FLAG_LONG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
O_ASYNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399 PA_FLAG_LONG_DOUBLE . . . . . . . . . . . . . . . . . . . . . . . . 308
O_CREAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 PA_FLAG_LONG_LONG . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
O_DIRECTORY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 PA_FLAG_MASK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
O_EXCL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 PA_FLAG_PTR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
O_EXEC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PA_FLAG_SHORT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
O_EXLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399 PA_FLOAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
PA_INT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
O_FSYNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 400
PA_LAST . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
O_IGNORE_CTTY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398
PA_POINTER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
O_NDELAY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399
PA_STRING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
O_NOATIME . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 400 PARENB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
O_NOCTTY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398 PARMRK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
O_NOFOLLOW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 PARODD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522
O_NOLINK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398 PATH_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 957
O_NONBLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398, 399 PENDIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 525
O_NOTRANS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398 PF_CCITT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 488
O_PATH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PF_FILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
O_RDONLY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PF_IMPLINK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 488
O_RDWR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PF_INET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 472
O_READ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PF_INET6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 472
O_SHLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399 PF_ISO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 488
O_SYNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 400 PF_LOCAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
O_TMPFILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 PF_NS. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 488
O_TRUNC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398 PF_ROUTE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 488
O_WRITE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PF_UNIX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
O_WRONLY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 PI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
obstack_alloc_failed_handler . . . . . . . . . . . . . . . 65 PIPE_BUF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 957
OLD_TIME . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915 PKEY_DISABLE_ACCESS. . . . . . . . . . . . . . . . . . . . . . . . . . 82
PKEY_DISABLE_WRITE . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
ONCE_FLAG_INIT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 972
PM_STR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
ONLCR. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520
POSITIVE_SIGN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
ONOEOT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
POSIX_MADV_DONTNEED . . . . . . . . . . . . . . . . . . . . . . . . 373
OPEN_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 943 POSIX_MADV_NORMAL . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
OPOST. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520 POSIX_MADV_RANDOM . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
optarg . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 813 POSIX_MADV_SEQUENTIAL . . . . . . . . . . . . . . . . . . . . . . 373
opterr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 813 POSIX_MADV_WILLNEED . . . . . . . . . . . . . . . . . . . . . . . . 373
optind . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 813 POSIX_REC_INCR_XFER_SIZE . . . . . . . . . . . . . . . . . . . 959
OPTION_ALIAS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 823 POSIX_REC_MAX_XFER_SIZE . . . . . . . . . . . . . . . . . . . . 959
OPTION_ARG_OPTIONAL . . . . . . . . . . . . . . . . . . . . . . . . 823 POSIX_REC_MIN_XFER_SIZE . . . . . . . . . . . . . . . . . . . . 959
OPTION_DOC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 824 POSIX_REC_XFER_ALIGN . . . . . . . . . . . . . . . . . . . . . . . 959
OPTION_HIDDEN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 823 postorder . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
OPTION_NO_USAGE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 824 preorder . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
optopt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 813 PRIO_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 749
OXTABS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521 PRIO_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 749
PRIO_PGRP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 750
PRIO_PROCESS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 750
PRIO_USER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 750
program_invocation_name . . . . . . . . . . . . . . . . . . . . . 39
program_invocation_short_name . . . . . . . . . . . . . . 39
PROT_EXEC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
Variable and Constant Macro Index 1266
S
R S_IEXEC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
R_OK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 448 S_IFBLK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
RADIXCHAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 S_IFCHR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
RAND_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 634 S_IFDIR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
RE_DUP_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 944 S_IFIFO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
REG_BADBR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IFLNK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
REG_BADPAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IFMT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
REG_BADRPT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IFREG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
REG_EBRACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IFSOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
REG_EBRACK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IREAD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
REG_ECOLLATE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IRGRP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_ECTYPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IROTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_EESCAPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IRUSR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
REG_EPAREN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IRWXG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_ERANGE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_IRWXO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_ESPACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254, 255 S_IRWXU . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_ESUBREG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_ISGID . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_EXTENDED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_ISUID . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_ICASE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 S_ISVTX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_NEWLINE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255 S_IWGRP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_NOMATCH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255 S_IWOTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
REG_NOSUB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255 S_IWRITE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
REG_NOTBOL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255 S_IWUSR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
REG_NOTEOL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255 S_IXGRP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
RLIM_INFINITY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 S_IXOTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
RLIM_NLIMITS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 S_IXUSR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
RLIMIT_AS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 SA_NOCLDSTOP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 782
RLIMIT_CORE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 739 SA_ONSTACK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 782
RLIMIT_CPU . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 739 SA_RESTART . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 782
RLIMIT_DATA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 739 SCHAR_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
RLIMIT_FSIZE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 739 SCHAR_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
RLIMIT_MEMLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 SCHAR_WIDTH. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
RLIMIT_NOFILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 SCHED_FIFO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745
RLIMIT_NPROC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 SCHED_OTHER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745
RLIMIT_OFILE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 SCHED_RR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745
RLIMIT_RSS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740 SEEK_CUR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330, 356
RLIMIT_STACK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 739 SEEK_END . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330, 356
RSEQ_SIG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 983 SEEK_SET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330, 356
RTLD_DI_LINKMAP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 989 SETFSIZE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741
RTLD_DI_LMID . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 989 SHRT_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
RTLD_DI_ORIGIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 989 SHRT_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025
RTLD_DI_PHDR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 990 SHRT_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
RTLD_DI_SERINFO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 989 SIG_ATOMIC_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
RTLD_DI_SERINFOSIZE . . . . . . . . . . . . . . . . . . . . . . . . 989 SIG_BLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 800
RTLD_DI_TLS_DATA . . . . . . . . . . . . . . . . . . . . . . . . . . . . 990 SIG_DFL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 777
RTLD_DI_TLS_MODID . . . . . . . . . . . . . . . . . . . . . . . . . . . 990 SIG_ERR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 779
RUN_LVL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910, 915 SIG_IGN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 777
RUSAGE_CHILDREN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 736 SIG_SETMASK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 800
RUSAGE_SELF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 736 SIG_UNBLOCK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 800
RWF_APPEND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363 SIGABRT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 770
Variable and Constant Macro Index 1267
USHRT_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1025 W
USHRT_WIDTH. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024 W_OK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 448
WAIT_ANY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 863
WAIT_MYPGRP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 863
WCHAR_MAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144, 1026
WCHAR_MIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144
WCHAR_WIDTH. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
WEOF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144, 326
V WINT_WIDTH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024
WNOHANG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 863
VDISCARD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530 WRDE_APPEND . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
VDSUSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 529 WRDE_BADCHAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
VEOF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 527 WRDE_BADVAL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
VEOL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 527 WRDE_CMDSUB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
WRDE_DOOFFS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
VEOL2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 527
WRDE_NOCMD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
VERASE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 527 WRDE_NOSPACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
VINTR. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528 WRDE_REUSE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261
VKILL. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528 WRDE_SHOWERR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261
VLNEXT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530 WRDE_SYNTAX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
WRDE_UNDEF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261
VMIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531
WUNTRACED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 863
VQUIT. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 529
VREPRINT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528
VSTART . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530
X
VSTATUS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530 X_OK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 448
VSTOP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530
VSUSP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 529 Y
VTIME. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531 YESEXPR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
VWERASE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528 YESSTR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
1269
/ I
/etc/group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 921 iconv.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 167, 168
/etc/hosts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 478
/etc/localtime . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 727
/etc/networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 510
/etc/passwd . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 917 K
/etc/protocols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 486
/etc/services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483 kill . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 771
/usr/share/zoneinfo . . . . . . . . . . . . . . . . . . . . . . . . 727 ksh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244
A
argp.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 820
L
argz.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138 langinfo.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
arpa/inet.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 477 limits.h . . . . . . . . . . . . . . . . . . 15, 148, 943, 956, 1024
assert.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1016 locale . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 190
locale.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188, 192
localtime . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 727
C ls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 434
cd . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
chgrp. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 442
chown. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 442
complex.h . . . . . . . . . . . . . . . . . . . . . . . . . . 550, 679, 680 M
ctype.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88, 90
malloc.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53, 57
math.h . . . . . . . . . . . . . . . . . . . . 550, 648, 660, 661, 663
D mcheck.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
mkdir. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 433
dirent.h . . . . . . . . . . . . . . . . . . . 15, 413, 415, 416, 419
E N
envz.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
errno.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24, 25 netdb.h . . . . . . . . . . . . . . . . . . . . . . . . 478, 483, 486, 510
execinfo.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 967 netinet/in.h . . . . . . . . . . . . . . . . . . 473, 476, 483, 485
F
fcntl.h . . . . . . 15, 347, 391, 392, 394, 395, 401, 408 O
fcntl.h. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 405 obstack.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
float.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1028
fnmatch.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243
P
G
printf.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310, 311
gcc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
pt_chown . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1166
gconv.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
grp.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15, 903, 921 pwd.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15, 917
H
hostid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928
hostname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928
Program and File Index 1270
S T
setjmp.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 758, 759 termios.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15, 515
sh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 855 threads.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 970
signal.h . . . . 15, 768, 777, 779, 782, 794, 795, 799, time.h . . . . . . . . . . . . . . . . . . . . . . . . . 448, 700, 713, 727
800, 803, 809
stdarg.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1019, 1020
stddef.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1023
stdint.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 644 U
stdio.h . 270, 271, 281, 284, 291, 301, 305, 323, 328, ulimit.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 740
332, 334, 335, 338, 340, 358, 432, 455, 776, 884, 908 umask. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445
stdlib.h . . . . . . . . . . . . . . . . . . . . . . . 47, 49, 50, 51, 52, unistd.h . . . 347, 351, 359, 392, 411, 427, 429, 431,
75, 148, 162, 232, 457, 538, 634, 635, 637, 642, 645, 432, 442, 448, 459, 513, 732, 813, 854, 857, 859, 884,
660, 681, 686, 688, 844, 852, 853, 855 886, 900, 901, 902, 908, 928, 944, 958
string.h . . . . 39, 100, 102, 107, 115, 120, 124, 129, utime.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449
776, 777 utmp.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 909, 916
sys/param.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 929 utmpx.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 914
sys/resource.h . . . . . . . . . . . . . . . . . . . . . 736, 738, 749
sys/socket.h . . . 465, 467, 468, 470, 472, 489, 490,
495, 496, 503, 508, 509
sys/stat.h . . . . . . . 15, 434, 440, 443, 446, 454, 462 W
sys/time.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 450, 732 wchar.h . . . . 102, 107, 120, 144, 145, 148, 149, 150,
sys/times.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15, 700 151, 153, 154, 156, 158, 281, 284, 681
sys/timex.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 705 wctype.h . . . . . . . . . . . . . . . . . . . . 92, 93, 94, 95, 96, 97
sys/types.h . . . . . 374, 857, 884, 886, 900, 901, 902
sys/un.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
sys/utsname.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 930
sys/vlimit.h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741 Z
sys/wait.h . . . . . . . . . . . . . . . . . . . . . . . . . 862, 865, 866 zoneinfo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 727