1 @node String and Array Utilities, Extended Characters, Character Handling, Top
2 @c %MENU% Utilities for copying and comparing strings and arrays
3 @chapter String and Array Utilities
5 Operations on strings (or arrays of characters) are an important part of
6 many programs. The GNU C library provides an extensive set of string
7 utility functions, including functions for copying, concatenating,
8 comparing, and searching strings. Many of these functions can also
9 operate on arbitrary regions of storage; for example, the @code{memcpy}
10 function can be used to copy the contents of any kind of array.
12 It's fairly common for beginning C programmers to ``reinvent the wheel''
13 by duplicating this functionality in their own code, but it pays to
14 become familiar with the library functions and to make use of them,
15 since this offers benefits in maintenance, efficiency, and portability.
17 For instance, you could easily compare one string to another in two
18 lines of C code, but if you use the built-in @code{strcmp} function,
19 you're less likely to make a mistake. And, since these library
20 functions are typically highly optimized, your program may run faster
24 * Representation of Strings:: Introduction to basic concepts.
25 * String/Array Conventions:: Whether to use a string function or an
26 arbitrary array function.
27 * String Length:: Determining the length of a string.
28 * Copying and Concatenation:: Functions to copy the contents of strings
30 * String/Array Comparison:: Functions for byte-wise and character-wise
32 * Collation Functions:: Functions for collating strings.
33 * Search Functions:: Searching for a specific element or substring.
34 * Finding Tokens in a String:: Splitting a string into tokens by looking
36 * Encode Binary Data:: Encoding and Decoding of Binary Data.
37 * Argz and Envz Vectors:: Null-separated string vectors.
40 @node Representation of Strings
41 @section Representation of Strings
42 @cindex string, representation of
44 This section is a quick summary of string concepts for beginning C
45 programmers. It describes how character strings are represented in C
46 and some common pitfalls. If you are already familiar with this
47 material, you can skip this section.
50 @cindex null character
51 A @dfn{string} is an array of @code{char} objects. But string-valued
52 variables are usually declared to be pointers of type @code{char *}.
53 Such variables do not include space for the text of a string; that has
54 to be stored somewhere else---in an array variable, a string constant,
55 or dynamically allocated memory (@pxref{Memory Allocation}). It's up to
56 you to store the address of the chosen memory space into the pointer
57 variable. Alternatively you can store a @dfn{null pointer} in the
58 pointer variable. The null pointer does not point anywhere, so
59 attempting to reference the string it points to gets an error.
61 By convention, a @dfn{null character}, @code{'\0'}, marks the end of a
62 string. For example, in testing to see whether the @code{char *}
63 variable @var{p} points to a null character marking the end of a string,
64 you can write @code{!*@var{p}} or @code{*@var{p} == '\0'}.
66 A null character is quite different conceptually from a null pointer,
67 although both are represented by the integer @code{0}.
69 @cindex string literal
70 @dfn{String literals} appear in C program source as strings of
71 characters between double-quote characters (@samp{"}). In @w{ISO C},
72 string literals can also be formed by @dfn{string concatenation}:
73 @code{"a" "b"} is the same as @code{"ab"}. Modification of string
74 literals is not allowed by the GNU C compiler, because literals
75 are placed in read-only storage.
77 Character arrays that are declared @code{const} cannot be modified
78 either. It's generally good style to declare non-modifiable string
79 pointers to be of type @code{const char *}, since this often allows the
80 C compiler to detect accidental modifications as well as providing some
81 amount of documentation about what your program intends to do with the
84 The amount of memory allocated for the character array may extend past
85 the null character that normally marks the end of the string. In this
86 document, the term @dfn{allocated size} is always used to refer to the
87 total amount of memory allocated for the string, while the term
88 @dfn{length} refers to the number of characters up to (but not
89 including) the terminating null character.
90 @cindex length of string
91 @cindex allocation size of string
92 @cindex size of string
94 @cindex string allocation
96 A notorious source of program bugs is trying to put more characters in a
97 string than fit in its allocated size. When writing code that extends
98 strings or moves characters into a pre-allocated array, you should be
99 very careful to keep track of the length of the text and make explicit
100 checks for overflowing the array. Many of the library functions
101 @emph{do not} do this for you! Remember also that you need to allocate
102 an extra byte to hold the null character that marks the end of the
105 @node String/Array Conventions
106 @section String and Array Conventions
108 This chapter describes both functions that work on arbitrary arrays or
109 blocks of memory, and functions that are specific to null-terminated
110 arrays of characters.
112 Functions that operate on arbitrary blocks of memory have names
113 beginning with @samp{mem} (such as @code{memcpy}) and invariably take an
114 argument which specifies the size (in bytes) of the block of memory to
115 operate on. The array arguments and return values for these functions
116 have type @code{void *}, and as a matter of style, the elements of these
117 arrays are referred to as ``bytes''. You can pass any kind of pointer
118 to these functions, and the @code{sizeof} operator is useful in
119 computing the value for the size argument.
121 In contrast, functions that operate specifically on strings have names
122 beginning with @samp{str} (such as @code{strcpy}) and look for a null
123 character to terminate the string instead of requiring an explicit size
124 argument to be passed. (Some of these functions accept a specified
125 maximum length, but they also check for premature termination with a
126 null character.) The array arguments and return values for these
127 functions have type @code{char *}, and the array elements are referred
128 to as ``characters''.
130 In many cases, there are both @samp{mem} and @samp{str} versions of a
131 function. The one that is more appropriate to use depends on the exact
132 situation. When your program is manipulating arbitrary arrays or blocks of
133 storage, then you should always use the @samp{mem} functions. On the
134 other hand, when you are manipulating null-terminated strings it is
135 usually more convenient to use the @samp{str} functions, unless you
136 already know the length of the string in advance.
139 @section String Length
141 You can get the length of a string using the @code{strlen} function.
142 This function is declared in the header file @file{string.h}.
147 @deftypefun size_t strlen (const char *@var{s})
148 The @code{strlen} function returns the length of the null-terminated
149 string @var{s}. (In other words, it returns the offset of the terminating
150 null character within the array.)
154 strlen ("hello, world")
158 When applied to a character array, the @code{strlen} function returns
159 the length of the string stored there, not its allocated size. You can
160 get the allocated size of the character array that holds a string using
161 the @code{sizeof} operator:
164 char string[32] = "hello, world";
171 But beware, this will not work unless @var{string} is the character
172 array itself, not a pointer to it. For example:
175 char string[32] = "hello, world";
180 @result{} 4 /* @r{(on a machine with 4 byte pointers)} */
183 This is an easy mistake to make when you are working with functions that
184 take string arguments; those arguments are always pointers, not arrays.
190 @deftypefun size_t strnlen (const char *@var{s}, size_t @var{maxlen})
191 The @code{strnlen} function returns the length of the null-terminated
192 string @var{s} is this length is smaller than @var{maxlen}. Otherwise
193 it returns @var{maxlen}. Therefore this function is equivalent to
194 @code{(strlen (@var{s}) < n ? strlen (@var{s}) : @var{maxlen})} but it
198 char string[32] = "hello, world";
205 This function is a GNU extension.
208 @node Copying and Concatenation
209 @section Copying and Concatenation
211 You can use the functions described in this section to copy the contents
212 of strings and arrays, or to append the contents of one string to
213 another. These functions are declared in the header file
216 @cindex copying strings and arrays
217 @cindex string copy functions
218 @cindex array copy functions
219 @cindex concatenating strings
220 @cindex string concatenation functions
222 A helpful way to remember the ordering of the arguments to the functions
223 in this section is that it corresponds to an assignment expression, with
224 the destination array specified to the left of the source array. All
225 of these functions return the address of the destination array.
227 Most of these functions do not work properly if the source and
228 destination arrays overlap. For example, if the beginning of the
229 destination array overlaps the end of the source array, the original
230 contents of that part of the source array may get overwritten before it
231 is copied. Even worse, in the case of the string functions, the null
232 character marking the end of the string may be lost, and the copy
233 function might get stuck in a loop trashing all the memory allocated to
236 All functions that have problems copying between overlapping arrays are
237 explicitly identified in this manual. In addition to functions in this
238 section, there are a few others like @code{sprintf} (@pxref{Formatted
239 Output Functions}) and @code{scanf} (@pxref{Formatted Input
244 @deftypefun {void *} memcpy (void *@var{to}, const void *@var{from}, size_t @var{size})
245 The @code{memcpy} function copies @var{size} bytes from the object
246 beginning at @var{from} into the object beginning at @var{to}. The
247 behavior of this function is undefined if the two arrays @var{to} and
248 @var{from} overlap; use @code{memmove} instead if overlapping is possible.
250 The value returned by @code{memcpy} is the value of @var{to}.
252 Here is an example of how you might use @code{memcpy} to copy the
253 contents of an array:
256 struct foo *oldarray, *newarray;
259 memcpy (new, old, arraysize * sizeof (struct foo));
265 @deftypefun {void *} mempcpy (void *@var{to}, const void *@var{from}, size_t @var{size})
266 The @code{mempcpy} function is nearly identical to the @code{memcpy}
267 function. It copies @var{size} bytes from the object beginning at
268 @code{from} into the object pointed to by @var{to}. But instead of
269 returning the value of @code{to} it returns a pointer to the byte
270 following the last written byte in the object beginning at @var{to}.
271 I.e., the value is @code{((void *) ((char *) @var{to} + @var{size}))}.
273 This function is useful in situations where a number of objects shall be
274 copied to consecutive memory positions.
278 combine (void *o1, size_t s1, void *o2, size_t s2)
280 void *result = malloc (s1 + s2);
282 mempcpy (mempcpy (result, o1, s1), o2, s2);
287 This function is a GNU extension.
292 @deftypefun {void *} memmove (void *@var{to}, const void *@var{from}, size_t @var{size})
293 @code{memmove} copies the @var{size} bytes at @var{from} into the
294 @var{size} bytes at @var{to}, even if those two blocks of space
295 overlap. In the case of overlap, @code{memmove} is careful to copy the
296 original values of the bytes in the block at @var{from}, including those
297 bytes which also belong to the block at @var{to}.
302 @deftypefun {void *} memccpy (void *@var{to}, const void *@var{from}, int @var{c}, size_t @var{size})
303 This function copies no more than @var{size} bytes from @var{from} to
304 @var{to}, stopping if a byte matching @var{c} is found. The return
305 value is a pointer into @var{to} one byte past where @var{c} was copied,
306 or a null pointer if no byte matching @var{c} appeared in the first
307 @var{size} bytes of @var{from}.
312 @deftypefun {void *} memset (void *@var{block}, int @var{c}, size_t @var{size})
313 This function copies the value of @var{c} (converted to an
314 @code{unsigned char}) into each of the first @var{size} bytes of the
315 object beginning at @var{block}. It returns the value of @var{block}.
320 @deftypefun {char *} strcpy (char *@var{to}, const char *@var{from})
321 This copies characters from the string @var{from} (up to and including
322 the terminating null character) into the string @var{to}. Like
323 @code{memcpy}, this function has undefined results if the strings
324 overlap. The return value is the value of @var{to}.
329 @deftypefun {char *} strncpy (char *@var{to}, const char *@var{from}, size_t @var{size})
330 This function is similar to @code{strcpy} but always copies exactly
331 @var{size} characters into @var{to}.
333 If the length of @var{from} is more than @var{size}, then @code{strncpy}
334 copies just the first @var{size} characters. Note that in this case
335 there is no null terminator written into @var{to}.
337 If the length of @var{from} is less than @var{size}, then @code{strncpy}
338 copies all of @var{from}, followed by enough null characters to add up
339 to @var{size} characters in all. This behavior is rarely useful, but it
340 is specified by the @w{ISO C} standard.
342 The behavior of @code{strncpy} is undefined if the strings overlap.
344 Using @code{strncpy} as opposed to @code{strcpy} is a way to avoid bugs
345 relating to writing past the end of the allocated space for @var{to}.
346 However, it can also make your program much slower in one common case:
347 copying a string which is probably small into a potentially large buffer.
348 In this case, @var{size} may be large, and when it is, @code{strncpy} will
349 waste a considerable amount of time copying null characters.
354 @deftypefun {char *} strdup (const char *@var{s})
355 This function copies the null-terminated string @var{s} into a newly
356 allocated string. The string is allocated using @code{malloc}; see
357 @ref{Unconstrained Allocation}. If @code{malloc} cannot allocate space
358 for the new string, @code{strdup} returns a null pointer. Otherwise it
359 returns a pointer to the new string.
364 @deftypefun {char *} strndup (const char *@var{s}, size_t @var{size})
365 This function is similar to @code{strdup} but always copies at most
366 @var{size} characters into the newly allocated string.
368 If the length of @var{s} is more than @var{size}, then @code{strndup}
369 copies just the first @var{size} characters and adds a closing null
370 terminator. Otherwise all characters are copied and the string is
373 This function is different to @code{strncpy} in that it always
374 terminates the destination string.
378 @comment Unknown origin
379 @deftypefun {char *} stpcpy (char *@var{to}, const char *@var{from})
380 This function is like @code{strcpy}, except that it returns a pointer to
381 the end of the string @var{to} (that is, the address of the terminating
382 null character) rather than the beginning.
384 For example, this program uses @code{stpcpy} to concatenate @samp{foo}
385 and @samp{bar} to produce @samp{foobar}, which it then prints.
388 @include stpcpy.c.texi
391 This function is not part of the ISO or POSIX standards, and is not
392 customary on Unix systems, but we did not invent it either. Perhaps it
395 Its behavior is undefined if the strings overlap.
400 @deftypefun {char *} stpncpy (char *@var{to}, const char *@var{from}, size_t @var{size})
401 This function is similar to @code{stpcpy} but copies always exactly
402 @var{size} characters into @var{to}.
404 If the length of @var{from} is more then @var{size}, then @code{stpncpy}
405 copies just the first @var{size} characters and returns a pointer to the
406 character directly following the one which was copied last. Note that in
407 this case there is no null terminator written into @var{to}.
409 If the length of @var{from} is less than @var{size}, then @code{stpncpy}
410 copies all of @var{from}, followed by enough null characters to add up
411 to @var{size} characters in all. This behaviour is rarely useful, but it
412 is implemented to be useful in contexts where this behaviour of the
413 @code{strncpy} is used. @code{stpncpy} returns a pointer to the
414 @emph{first} written null character.
416 This function is not part of ISO or POSIX but was found useful while
417 developing the GNU C Library itself.
419 Its behaviour is undefined if the strings overlap.
424 @deftypefn {Macro} {char *} strdupa (const char *@var{s})
425 This function is similar to @code{strdup} but allocates the new string
426 using @code{alloca} instead of @code{malloc} (@pxref{Variable Size
427 Automatic}). This means of course the returned string has the same
428 limitations as any block of memory allocated using @code{alloca}.
430 For obvious reasons @code{strdupa} is implemented only as a macro;
431 you cannot get the address of this function. Despite this limitation
432 it is a useful function. The following code shows a situation where
433 using @code{malloc} would be a lot more expensive.
436 @include strdupa.c.texi
439 Please note that calling @code{strtok} using @var{path} directly is
442 This function is only available if GNU CC is used.
447 @deftypefn {Macro} {char *} strndupa (const char *@var{s}, size_t @var{size})
448 This function is similar to @code{strndup} but like @code{strdupa} it
449 allocates the new string using @code{alloca}
450 @pxref{Variable Size Automatic}. The same advantages and limitations
451 of @code{strdupa} are valid for @code{strndupa}, too.
453 This function is implemented only as a macro, just like @code{strdupa}.
455 @code{strndupa} is only available if GNU CC is used.
460 @deftypefun {char *} strcat (char *@var{to}, const char *@var{from})
461 The @code{strcat} function is similar to @code{strcpy}, except that the
462 characters from @var{from} are concatenated or appended to the end of
463 @var{to}, instead of overwriting it. That is, the first character from
464 @var{from} overwrites the null character marking the end of @var{to}.
466 An equivalent definition for @code{strcat} would be:
470 strcat (char *to, const char *from)
472 strcpy (to + strlen (to), from);
477 This function has undefined results if the strings overlap.
482 @deftypefun {char *} strncat (char *@var{to}, const char *@var{from}, size_t @var{size})
483 This function is like @code{strcat} except that not more than @var{size}
484 characters from @var{from} are appended to the end of @var{to}. A
485 single null character is also always appended to @var{to}, so the total
486 allocated size of @var{to} must be at least @code{@var{size} + 1} bytes
487 longer than its initial length.
489 The @code{strncat} function could be implemented like this:
494 strncat (char *to, const char *from, size_t size)
496 strncpy (to + strlen (to), from, size);
502 The behavior of @code{strncat} is undefined if the strings overlap.
505 Here is an example showing the use of @code{strncpy} and @code{strncat}.
506 Notice how, in the call to @code{strncat}, the @var{size} parameter
507 is computed to avoid overflowing the character array @code{buffer}.
510 @include strncat.c.texi
514 The output produced by this program looks like:
523 @deftypefun void bcopy (const void *@var{from}, void *@var{to}, size_t @var{size})
524 This is a partially obsolete alternative for @code{memmove}, derived from
525 BSD. Note that it is not quite equivalent to @code{memmove}, because the
526 arguments are not in the same order and there is no return value.
531 @deftypefun void bzero (void *@var{block}, size_t @var{size})
532 This is a partially obsolete alternative for @code{memset}, derived from
533 BSD. Note that it is not as general as @code{memset}, because the only
534 value it can store is zero.
537 @node String/Array Comparison
538 @section String/Array Comparison
539 @cindex comparing strings and arrays
540 @cindex string comparison functions
541 @cindex array comparison functions
542 @cindex predicates on strings
543 @cindex predicates on arrays
545 You can use the functions in this section to perform comparisons on the
546 contents of strings and arrays. As well as checking for equality, these
547 functions can also be used as the ordering functions for sorting
548 operations. @xref{Searching and Sorting}, for an example of this.
550 Unlike most comparison operations in C, the string comparison functions
551 return a nonzero value if the strings are @emph{not} equivalent rather
552 than if they are. The sign of the value indicates the relative ordering
553 of the first characters in the strings that are not equivalent: a
554 negative value indicates that the first string is ``less'' than the
555 second, while a positive value indicates that the first string is
558 The most common use of these functions is to check only for equality.
559 This is canonically done with an expression like @w{@samp{! strcmp (s1, s2)}}.
561 All of these functions are declared in the header file @file{string.h}.
566 @deftypefun int memcmp (const void *@var{a1}, const void *@var{a2}, size_t @var{size})
567 The function @code{memcmp} compares the @var{size} bytes of memory
568 beginning at @var{a1} against the @var{size} bytes of memory beginning
569 at @var{a2}. The value returned has the same sign as the difference
570 between the first differing pair of bytes (interpreted as @code{unsigned
571 char} objects, then promoted to @code{int}).
573 If the contents of the two blocks are equal, @code{memcmp} returns
577 On arbitrary arrays, the @code{memcmp} function is mostly useful for
578 testing equality. It usually isn't meaningful to do byte-wise ordering
579 comparisons on arrays of things other than bytes. For example, a
580 byte-wise comparison on the bytes that make up floating-point numbers
581 isn't likely to tell you anything about the relationship between the
582 values of the floating-point numbers.
584 You should also be careful about using @code{memcmp} to compare objects
585 that can contain ``holes'', such as the padding inserted into structure
586 objects to enforce alignment requirements, extra space at the end of
587 unions, and extra characters at the ends of strings whose length is less
588 than their allocated size. The contents of these ``holes'' are
589 indeterminate and may cause strange behavior when performing byte-wise
590 comparisons. For more predictable results, perform an explicit
591 component-wise comparison.
593 For example, given a structure type definition like:
609 you are better off writing a specialized comparison function to compare
610 @code{struct foo} objects instead of comparing them with @code{memcmp}.
614 @deftypefun int strcmp (const char *@var{s1}, const char *@var{s2})
615 The @code{strcmp} function compares the string @var{s1} against
616 @var{s2}, returning a value that has the same sign as the difference
617 between the first differing pair of characters (interpreted as
618 @code{unsigned char} objects, then promoted to @code{int}).
620 If the two strings are equal, @code{strcmp} returns @code{0}.
622 A consequence of the ordering used by @code{strcmp} is that if @var{s1}
623 is an initial substring of @var{s2}, then @var{s1} is considered to be
624 ``less than'' @var{s2}.
629 @deftypefun int strcasecmp (const char *@var{s1}, const char *@var{s2})
630 This function is like @code{strcmp}, except that differences in case are
631 ignored. How uppercase and lowercase characters are related is
632 determined by the currently selected locale. In the standard @code{"C"}
633 locale the characters @"A and @"a do not match but in a locale which
634 regards these characters as parts of the alphabet they do match.
636 @code{strcasecmp} is derived from BSD.
641 @deftypefun int strncasecmp (const char *@var{s1}, const char *@var{s2}, size_t @var{n})
642 This function is like @code{strncmp}, except that differences in case
643 are ignored. Like @code{strcasecmp}, it is locale dependent how
644 uppercase and lowercase characters are related.
646 @code{strncasecmp} is a GNU extension.
651 @deftypefun int strncmp (const char *@var{s1}, const char *@var{s2}, size_t @var{size})
652 This function is the similar to @code{strcmp}, except that no more than
653 @var{size} characters are compared. In other words, if the two strings are
654 the same in their first @var{size} characters, the return value is zero.
657 Here are some examples showing the use of @code{strcmp} and @code{strncmp}.
658 These examples assume the use of the ASCII character set. (If some
659 other character set---say, EBCDIC---is used instead, then the glyphs
660 are associated with different numeric codes, and the return values
661 and ordering may differ.)
664 strcmp ("hello", "hello")
665 @result{} 0 /* @r{These two strings are the same.} */
666 strcmp ("hello", "Hello")
667 @result{} 32 /* @r{Comparisons are case-sensitive.} */
668 strcmp ("hello", "world")
669 @result{} -15 /* @r{The character @code{'h'} comes before @code{'w'}.} */
670 strcmp ("hello", "hello, world")
671 @result{} -44 /* @r{Comparing a null character against a comma.} */
672 strncmp ("hello", "hello, world", 5)
673 @result{} 0 /* @r{The initial 5 characters are the same.} */
674 strncmp ("hello, world", "hello, stupid world!!!", 5)
675 @result{} 0 /* @r{The initial 5 characters are the same.} */
680 @deftypefun int strverscmp (const char *@var{s1}, const char *@var{s2})
681 The @code{strverscmp} function compares the string @var{s1} against
682 @var{s2}, considering them as holding indices/version numbers. Return
683 value follows the same conventions as found in the @code{strverscmp}
684 function. In fact, if @var{s1} and @var{s2} contain no digits,
685 @code{strverscmp} behaves like @code{strcmp}.
687 Basically, we compare strings normally (character by character), until
688 we find a digit in each string - then we enter a special comparison
689 mode, where each sequence of digits is taken as a whole. If we reach the
690 end of these two parts without noticing a difference, we return to the
691 standard comparison mode. There are two types of numeric parts:
692 "integral" and "fractional" (those begin with a '0'). The types
693 of the numeric parts affect the way we sort them:
697 integral/integral: we compare values as you would expect.
700 fractional/integral: the fractional part is less than the integral one.
704 fractional/fractional: the things become a bit more complex.
705 If the common prefix contains only leading zeroes, the longest part is less
706 than the other one; else the comparison behaves normally.
710 strverscmp ("no digit", "no digit")
711 @result{} 0 /* @r{same behaviour as strcmp.} */
712 strverscmp ("item#99", "item#100")
713 @result{} <0 /* @r{same prefix, but 99 < 100.} */
714 strverscmp ("alpha1", "alpha001")
715 @result{} >0 /* @r{fractional part inferior to integral one.} */
716 strverscmp ("part1_f012", "part1_f01")
717 @result{} >0 /* @r{two fractional parts.} */
718 strverscmp ("foo.009", "foo.0")
719 @result{} <0 /* @r{idem, but with leading zeroes only.} */
722 This function is especially useful when dealing with filename sorting,
723 because filenames frequently hold indices/version numbers.
725 @code{strverscmp} is a GNU extension.
730 @deftypefun int bcmp (const void *@var{a1}, const void *@var{a2}, size_t @var{size})
731 This is an obsolete alias for @code{memcmp}, derived from BSD.
734 @node Collation Functions
735 @section Collation Functions
737 @cindex collating strings
738 @cindex string collation functions
740 In some locales, the conventions for lexicographic ordering differ from
741 the strict numeric ordering of character codes. For example, in Spanish
742 most glyphs with diacritical marks such as accents are not considered
743 distinct letters for the purposes of collation. On the other hand, the
744 two-character sequence @samp{ll} is treated as a single letter that is
745 collated immediately after @samp{l}.
747 You can use the functions @code{strcoll} and @code{strxfrm} (declared in
748 the header file @file{string.h}) to compare strings using a collation
749 ordering appropriate for the current locale. The locale used by these
750 functions in particular can be specified by setting the locale for the
751 @code{LC_COLLATE} category; see @ref{Locales}.
754 In the standard C locale, the collation sequence for @code{strcoll} is
755 the same as that for @code{strcmp}.
757 Effectively, the way these functions work is by applying a mapping to
758 transform the characters in a string to a byte sequence that represents
759 the string's position in the collating sequence of the current locale.
760 Comparing two such byte sequences in a simple fashion is equivalent to
761 comparing the strings with the locale's collating sequence.
763 The function @code{strcoll} performs this translation implicitly, in
764 order to do one comparison. By contrast, @code{strxfrm} performs the
765 mapping explicitly. If you are making multiple comparisons using the
766 same string or set of strings, it is likely to be more efficient to use
767 @code{strxfrm} to transform all the strings just once, and subsequently
768 compare the transformed strings with @code{strcmp}.
772 @deftypefun int strcoll (const char *@var{s1}, const char *@var{s2})
773 The @code{strcoll} function is similar to @code{strcmp} but uses the
774 collating sequence of the current locale for collation (the
775 @code{LC_COLLATE} locale).
778 Here is an example of sorting an array of strings, using @code{strcoll}
779 to compare them. The actual sort algorithm is not written here; it
780 comes from @code{qsort} (@pxref{Array Sort Function}). The job of the
781 code shown here is to say how to compare the strings while sorting them.
782 (Later on in this section, we will show a way to do this more
783 efficiently using @code{strxfrm}.)
786 /* @r{This is the comparison function used with @code{qsort}.} */
789 compare_elements (char **p1, char **p2)
791 return strcoll (*p1, *p2);
794 /* @r{This is the entry point---the function to sort}
795 @r{strings using the locale's collating sequence.} */
798 sort_strings (char **array, int nstrings)
800 /* @r{Sort @code{temp_array} by comparing the strings.} */
801 qsort (array, sizeof (char *),
802 nstrings, compare_elements);
806 @cindex converting string to collation order
809 @deftypefun size_t strxfrm (char *@var{to}, const char *@var{from}, size_t @var{size})
810 The function @code{strxfrm} transforms @var{string} using the collation
811 transformation determined by the locale currently selected for
812 collation, and stores the transformed string in the array @var{to}. Up
813 to @var{size} characters (including a terminating null character) are
816 The behavior is undefined if the strings @var{to} and @var{from}
817 overlap; see @ref{Copying and Concatenation}.
819 The return value is the length of the entire transformed string. This
820 value is not affected by the value of @var{size}, but if it is greater
821 or equal than @var{size}, it means that the transformed string did not
822 entirely fit in the array @var{to}. In this case, only as much of the
823 string as actually fits was stored. To get the whole transformed
824 string, call @code{strxfrm} again with a bigger output array.
826 The transformed string may be longer than the original string, and it
829 If @var{size} is zero, no characters are stored in @var{to}. In this
830 case, @code{strxfrm} simply returns the number of characters that would
831 be the length of the transformed string. This is useful for determining
832 what size string to allocate. It does not matter what @var{to} is if
833 @var{size} is zero; @var{to} may even be a null pointer.
836 Here is an example of how you can use @code{strxfrm} when
837 you plan to do many comparisons. It does the same thing as the previous
838 example, but much faster, because it has to transform each string only
839 once, no matter how many times it is compared with other strings. Even
840 the time needed to allocate and free storage is much less than the time
841 we save, when there are many strings.
844 struct sorter @{ char *input; char *transformed; @};
846 /* @r{This is the comparison function used with @code{qsort}}
847 @r{to sort an array of @code{struct sorter}.} */
850 compare_elements (struct sorter *p1, struct sorter *p2)
852 return strcmp (p1->transformed, p2->transformed);
855 /* @r{This is the entry point---the function to sort}
856 @r{strings using the locale's collating sequence.} */
859 sort_strings_fast (char **array, int nstrings)
861 struct sorter temp_array[nstrings];
864 /* @r{Set up @code{temp_array}. Each element contains}
865 @r{one input string and its transformed string.} */
866 for (i = 0; i < nstrings; i++)
868 size_t length = strlen (array[i]) * 2;
870 size_t transformed_length;
872 temp_array[i].input = array[i];
874 /* @r{First try a buffer perhaps big enough.} */
875 transformed = (char *) xmalloc (length);
877 /* @r{Transform @code{array[i]}.} */
878 transformed_length = strxfrm (transformed, array[i], length);
880 /* @r{If the buffer was not large enough, resize it}
881 @r{and try again.} */
882 if (transformed_length >= length)
884 /* @r{Allocate the needed space. +1 for terminating}
885 @r{@code{NUL} character.} */
886 transformed = (char *) xrealloc (transformed,
887 transformed_length + 1);
889 /* @r{The return value is not interesting because we know}
890 @r{how long the transformed string is.} */
891 (void) strxfrm (transformed, array[i],
892 transformed_length + 1);
895 temp_array[i].transformed = transformed;
898 /* @r{Sort @code{temp_array} by comparing transformed strings.} */
899 qsort (temp_array, sizeof (struct sorter),
900 nstrings, compare_elements);
902 /* @r{Put the elements back in the permanent array}
903 @r{in their sorted order.} */
904 for (i = 0; i < nstrings; i++)
905 array[i] = temp_array[i].input;
907 /* @r{Free the strings we allocated.} */
908 for (i = 0; i < nstrings; i++)
909 free (temp_array[i].transformed);
913 @strong{Compatibility Note:} The string collation functions are a new
914 feature of @w{ISO C 89}. Older C dialects have no equivalent feature.
916 @node Search Functions
917 @section Search Functions
919 This section describes library functions which perform various kinds
920 of searching operations on strings and arrays. These functions are
921 declared in the header file @file{string.h}.
923 @cindex search functions (for strings)
924 @cindex string search functions
928 @deftypefun {void *} memchr (const void *@var{block}, int @var{c}, size_t @var{size})
929 This function finds the first occurrence of the byte @var{c} (converted
930 to an @code{unsigned char}) in the initial @var{size} bytes of the
931 object beginning at @var{block}. The return value is a pointer to the
932 located byte, or a null pointer if no match was found.
937 @deftypefun {char *} strchr (const char *@var{string}, int @var{c})
938 The @code{strchr} function finds the first occurrence of the character
939 @var{c} (converted to a @code{char}) in the null-terminated string
940 beginning at @var{string}. The return value is a pointer to the located
941 character, or a null pointer if no match was found.
945 strchr ("hello, world", 'l')
946 @result{} "llo, world"
947 strchr ("hello, world", '?')
951 The terminating null character is considered to be part of the string,
952 so you can use this function get a pointer to the end of a string by
953 specifying a null character as the value of the @var{c} argument.
958 @deftypefun {char *} index (const char *@var{string}, int @var{c})
959 @code{index} is another name for @code{strchr}; they are exactly the same.
960 New code should always use @code{strchr} since this name is defined in
961 @w{ISO C} while @code{index} is a BSD invention which never was available
962 on @w{System V} derived systems.
967 @deftypefun {char *} strrchr (const char *@var{string}, int @var{c})
968 The function @code{strrchr} is like @code{strchr}, except that it searches
969 backwards from the end of the string @var{string} (instead of forwards
974 strrchr ("hello, world", 'l')
981 @deftypefun {char *} rindex (const char *@var{string}, int @var{c})
982 @code{rindex} is another name for @code{strrchr}; they are exactly the same.
983 New code should always use @code{strrchr} since this name is defined in
984 @w{ISO C} while @code{rindex} is a BSD invention which never was available
985 on @w{System V} derived systems.
990 @deftypefun {char *} strstr (const char *@var{haystack}, const char *@var{needle})
991 This is like @code{strchr}, except that it searches @var{haystack} for a
992 substring @var{needle} rather than just a single character. It
993 returns a pointer into the string @var{haystack} that is the first
994 character of the substring, or a null pointer if no match was found. If
995 @var{needle} is an empty string, the function returns @var{haystack}.
999 strstr ("hello, world", "l")
1000 @result{} "llo, world"
1001 strstr ("hello, world", "wo")
1009 @deftypefun {void *} memmem (const void *@var{haystack}, size_t @var{haystack-len},@*const void *@var{needle}, size_t @var{needle-len})
1010 This is like @code{strstr}, but @var{needle} and @var{haystack} are byte
1011 arrays rather than null-terminated strings. @var{needle-len} is the
1012 length of @var{needle} and @var{haystack-len} is the length of
1013 @var{haystack}.@refill
1015 This function is a GNU extension.
1020 @deftypefun size_t strspn (const char *@var{string}, const char *@var{skipset})
1021 The @code{strspn} (``string span'') function returns the length of the
1022 initial substring of @var{string} that consists entirely of characters that
1023 are members of the set specified by the string @var{skipset}. The order
1024 of the characters in @var{skipset} is not important.
1028 strspn ("hello, world", "abcdefghijklmnopqrstuvwxyz")
1035 @deftypefun size_t strcspn (const char *@var{string}, const char *@var{stopset})
1036 The @code{strcspn} (``string complement span'') function returns the length
1037 of the initial substring of @var{string} that consists entirely of characters
1038 that are @emph{not} members of the set specified by the string @var{stopset}.
1039 (In other words, it returns the offset of the first character in @var{string}
1040 that is a member of the set @var{stopset}.)
1044 strcspn ("hello, world", " \t\n,.;!?")
1051 @deftypefun {char *} strpbrk (const char *@var{string}, const char *@var{stopset})
1052 The @code{strpbrk} (``string pointer break'') function is related to
1053 @code{strcspn}, except that it returns a pointer to the first character
1054 in @var{string} that is a member of the set @var{stopset} instead of the
1055 length of the initial substring. It returns a null pointer if no such
1056 character from @var{stopset} is found.
1058 @c @group Invalid outside the example.
1062 strpbrk ("hello, world", " \t\n,.;!?")
1068 @node Finding Tokens in a String
1069 @section Finding Tokens in a String
1071 @cindex tokenizing strings
1072 @cindex breaking a string into tokens
1073 @cindex parsing tokens from a string
1074 It's fairly common for programs to have a need to do some simple kinds
1075 of lexical analysis and parsing, such as splitting a command string up
1076 into tokens. You can do this with the @code{strtok} function, declared
1077 in the header file @file{string.h}.
1082 @deftypefun {char *} strtok (char *@var{newstring}, const char *@var{delimiters})
1083 A string can be split into tokens by making a series of calls to the
1084 function @code{strtok}.
1086 The string to be split up is passed as the @var{newstring} argument on
1087 the first call only. The @code{strtok} function uses this to set up
1088 some internal state information. Subsequent calls to get additional
1089 tokens from the same string are indicated by passing a null pointer as
1090 the @var{newstring} argument. Calling @code{strtok} with another
1091 non-null @var{newstring} argument reinitializes the state information.
1092 It is guaranteed that no other library function ever calls @code{strtok}
1093 behind your back (which would mess up this internal state information).
1095 The @var{delimiters} argument is a string that specifies a set of delimiters
1096 that may surround the token being extracted. All the initial characters
1097 that are members of this set are discarded. The first character that is
1098 @emph{not} a member of this set of delimiters marks the beginning of the
1099 next token. The end of the token is found by looking for the next
1100 character that is a member of the delimiter set. This character in the
1101 original string @var{newstring} is overwritten by a null character, and the
1102 pointer to the beginning of the token in @var{newstring} is returned.
1104 On the next call to @code{strtok}, the searching begins at the next
1105 character beyond the one that marked the end of the previous token.
1106 Note that the set of delimiters @var{delimiters} do not have to be the
1107 same on every call in a series of calls to @code{strtok}.
1109 If the end of the string @var{newstring} is reached, or if the remainder of
1110 string consists only of delimiter characters, @code{strtok} returns
1114 @strong{Warning:} Since @code{strtok} alters the string it is parsing,
1115 you should always copy the string to a temporary buffer before parsing
1116 it with @code{strtok}. If you allow @code{strtok} to modify a string
1117 that came from another part of your program, you are asking for trouble;
1118 that string might be used for other purposes after @code{strtok} has
1119 modified it, and it would not have the expected value.
1121 The string that you are operating on might even be a constant. Then
1122 when @code{strtok} tries to modify it, your program will get a fatal
1123 signal for writing in read-only memory. @xref{Program Error Signals}.
1125 This is a special case of a general principle: if a part of a program
1126 does not have as its purpose the modification of a certain data
1127 structure, then it is error-prone to modify the data structure
1130 The function @code{strtok} is not reentrant. @xref{Nonreentrancy}, for
1131 a discussion of where and why reentrancy is important.
1133 Here is a simple example showing the use of @code{strtok}.
1135 @comment Yes, this example has been tested.
1142 const char string[] = "words separated by spaces -- and, punctuation!";
1143 const char delimiters[] = " .,;:!-";
1148 cp = strdupa (string); /* Make writable copy. */
1149 token = strtok (cp, delimiters); /* token => "words" */
1150 token = strtok (NULL, delimiters); /* token => "separated" */
1151 token = strtok (NULL, delimiters); /* token => "by" */
1152 token = strtok (NULL, delimiters); /* token => "spaces" */
1153 token = strtok (NULL, delimiters); /* token => "and" */
1154 token = strtok (NULL, delimiters); /* token => "punctuation" */
1155 token = strtok (NULL, delimiters); /* token => NULL */
1158 The GNU C library contains two more functions for tokenizing a string
1159 which overcome the limitation of non-reentrancy.
1163 @deftypefun {char *} strtok_r (char *@var{newstring}, const char *@var{delimiters}, char **@var{save_ptr})
1164 Just like @code{strtok}, this function splits the string into several
1165 tokens which can be accessed by successive calls to @code{strtok_r}.
1166 The difference is that the information about the next token is stored in
1167 the space pointed to by the third argument, @var{save_ptr}, which is a
1168 pointer to a string pointer. Calling @code{strtok_r} with a null
1169 pointer for @var{newstring} and leaving @var{save_ptr} between the calls
1170 unchanged does the job without hindering reentrancy.
1172 This function is defined in POSIX-1 and can be found on many systems
1173 which support multi-threading.
1178 @deftypefun {char *} strsep (char **@var{string_ptr}, const char *@var{delimiter})
1179 This function is just @code{strtok_r} with the @var{newstring} argument
1180 replaced by the @var{save_ptr} argument. The initialization of the
1181 moving pointer has to be done by the user. Successive calls to
1182 @code{strsep} move the pointer along the tokens separated by
1183 @var{delimiter}, returning the address of the next token and updating
1184 @var{string_ptr} to point to the beginning of the next token.
1186 If the input string contains more than one character from
1187 @var{delimiter} in a row @code{strsep} returns an empty string for each
1188 pair of characters from @var{delimiter}. This means that a program
1189 normally should test for @code{strsep} returning an empty string before
1192 This function was introduced in 4.3BSD and therefore is widely available.
1195 Here is how the above example looks like when @code{strsep} is used.
1197 @comment Yes, this example has been tested.
1204 const char string[] = "words separated by spaces -- and, punctuation!";
1205 const char delimiters[] = " .,;:!-";
1211 running = strdupa (string);
1212 token = strsep (&running, delimiters); /* token => "words" */
1213 token = strsep (&running, delimiters); /* token => "separated" */
1214 token = strsep (&running, delimiters); /* token => "by" */
1215 token = strsep (&running, delimiters); /* token => "spaces" */
1216 token = strsep (&running, delimiters); /* token => "" */
1217 token = strsep (&running, delimiters); /* token => "" */
1218 token = strsep (&running, delimiters); /* token => "" */
1219 token = strsep (&running, delimiters); /* token => "and" */
1220 token = strsep (&running, delimiters); /* token => "" */
1221 token = strsep (&running, delimiters); /* token => "punctuation" */
1222 token = strsep (&running, delimiters); /* token => "" */
1223 token = strsep (&running, delimiters); /* token => NULL */
1226 @node Encode Binary Data
1227 @section Encode Binary Data
1229 To store or transfer binary data in environments which only support text
1230 one has to encode the binary data by mapping the input bytes to
1231 characters in the range allowed for storing or transfering. SVID
1232 systems (and nowadays XPG compliant systems) provide minimal support for
1237 @deftypefun {char *} l64a (long int @var{n})
1238 This function encodes a 32-bit input value using characters from the
1239 basic character set. It returns a pointer to a 6 character buffer which
1240 contains an encoded version of @var{n}. To encode a series of bytes the
1241 user must copy the returned string to a destination buffer. It returns
1242 the empty string if @var{n} is zero, which is somewhat bizarre but
1243 mandated by the standard.@*
1244 @strong{Warning:} Since a static buffer is used this function should not
1245 be used in multi-threaded programs. There is no thread-safe alternative
1246 to this function in the C library.@*
1247 @strong{Compatibility Note:} The XPG standard states that the return
1248 value of @code{l64a} is undefined if @var{n} is negative. In the GNU
1249 implementation, @code{l64a} treats its argument as unsigned, so it will
1250 return a sensible encoding for any nonzero @var{n}; however, portable
1251 programs should not rely on this.
1253 To encode a large buffer @code{l64a} must be called in a loop, once for
1254 each 32-bit word of the buffer. For example, one could do something
1259 encode (const void *buf, size_t len)
1261 /* @r{We know in advance how long the buffer has to be.} */
1262 unsigned char *in = (unsigned char *) buf;
1263 char *out = malloc (6 + ((len + 3) / 4) * 6 + 1);
1266 /* @r{Encode the length.} */
1267 /* @r{Using `htonl' is necessary so that the data can be}
1268 @r{decoded even on machines with different byte order.} */
1270 cp = mempcpy (cp, l64a (htonl (len)), 6);
1274 unsigned long int n = *in++;
1275 n = (n << 8) | *in++;
1276 n = (n << 8) | *in++;
1277 n = (n << 8) | *in++;
1280 cp = mempcpy (cp, l64a (htonl (n)), 6);
1282 /* @r{`l64a' returns the empty string for n==0, so we }
1283 @r{must generate its encoding (}"......"@r{) by hand.} */
1284 cp = stpcpy (cp, "......");
1288 unsigned long int n = *in++;
1291 n = (n << 8) | *in++;
1295 memcpy (cp, l64a (htonl (n)), 6);
1303 It is strange that the library does not provide the complete
1304 functionality needed but so be it.
1308 To decode data produced with @code{l64a} the following function should be
1313 @deftypefun {long int} a64l (const char *@var{string})
1314 The parameter @var{string} should contain a string which was produced by
1315 a call to @code{l64a}. The function processes at least 6 characters of
1316 this string, and decodes the characters it finds according to the table
1317 below. It stops decoding when it finds a character not in the table,
1318 rather like @code{atoi}; if you have a buffer which has been broken into
1319 lines, you must be careful to skip over the end-of-line characters.
1321 The decoded number is returned as a @code{long int} value.
1324 The @code{l64a} and @code{a64l} functions use a base 64 encoding, in
1325 which each character of an encoded string represents six bits of an
1326 input word. These symbols are used for the base 64 digits:
1328 @multitable {xxxxx} {xxx} {xxx} {xxx} {xxx} {xxx} {xxx} {xxx} {xxx}
1329 @item @tab 0 @tab 1 @tab 2 @tab 3 @tab 4 @tab 5 @tab 6 @tab 7
1330 @item 0 @tab @code{.} @tab @code{/} @tab @code{0} @tab @code{1}
1331 @tab @code{2} @tab @code{3} @tab @code{4} @tab @code{5}
1332 @item 8 @tab @code{6} @tab @code{7} @tab @code{8} @tab @code{9}
1333 @tab @code{A} @tab @code{B} @tab @code{C} @tab @code{D}
1334 @item 16 @tab @code{E} @tab @code{F} @tab @code{G} @tab @code{H}
1335 @tab @code{I} @tab @code{J} @tab @code{K} @tab @code{L}
1336 @item 24 @tab @code{M} @tab @code{N} @tab @code{O} @tab @code{P}
1337 @tab @code{Q} @tab @code{R} @tab @code{S} @tab @code{T}
1338 @item 32 @tab @code{U} @tab @code{V} @tab @code{W} @tab @code{X}
1339 @tab @code{Y} @tab @code{Z} @tab @code{a} @tab @code{b}
1340 @item 40 @tab @code{c} @tab @code{d} @tab @code{e} @tab @code{f}
1341 @tab @code{g} @tab @code{h} @tab @code{i} @tab @code{j}
1342 @item 48 @tab @code{k} @tab @code{l} @tab @code{m} @tab @code{n}
1343 @tab @code{o} @tab @code{p} @tab @code{q} @tab @code{r}
1344 @item 56 @tab @code{s} @tab @code{t} @tab @code{u} @tab @code{v}
1345 @tab @code{w} @tab @code{x} @tab @code{y} @tab @code{z}
1348 This encoding scheme is not standard. There are some other encoding
1349 methods which are much more widely used (UU encoding, MIME encoding).
1350 Generally, it is better to use one of these encodings.
1352 @node Argz and Envz Vectors
1353 @section Argz and Envz Vectors
1355 @cindex argz vectors (string vectors)
1356 @cindex string vectors, null-character separated
1357 @cindex argument vectors, null-character separated
1358 @dfn{argz vectors} are vectors of strings in a contiguous block of
1359 memory, each element separated from its neighbors by null-characters
1362 @cindex envz vectors (environment vectors)
1363 @cindex environment vectors, null-character separated
1364 @dfn{Envz vectors} are an extension of argz vectors where each element is a
1365 name-value pair, separated by a @code{'='} character (as in a Unix
1369 * Argz Functions:: Operations on argz vectors.
1370 * Envz Functions:: Additional operations on environment vectors.
1373 @node Argz Functions, Envz Functions, , Argz and Envz Vectors
1374 @subsection Argz Functions
1376 Each argz vector is represented by a pointer to the first element, of
1377 type @code{char *}, and a size, of type @code{size_t}, both of which can
1378 be initialized to @code{0} to represent an empty argz vector. All argz
1379 functions accept either a pointer and a size argument, or pointers to
1380 them, if they will be modified.
1382 The argz functions use @code{malloc}/@code{realloc} to allocate/grow
1383 argz vectors, and so any argz vector creating using these functions may
1384 be freed by using @code{free}; conversely, any argz function that may
1385 grow a string expects that string to have been allocated using
1386 @code{malloc} (those argz functions that only examine their arguments or
1387 modify them in place will work on any sort of memory).
1388 @xref{Unconstrained Allocation}.
1390 All argz functions that do memory allocation have a return type of
1391 @code{error_t}, and return @code{0} for success, and @code{ENOMEM} if an
1392 allocation error occurs.
1395 These functions are declared in the standard include file @file{argz.h}.
1399 @deftypefun {error_t} argz_create (char *const @var{argv}[], char **@var{argz}, size_t *@var{argz_len})
1400 The @code{argz_create} function converts the Unix-style argument vector
1401 @var{argv} (a vector of pointers to normal C strings, terminated by
1402 @code{(char *)0}; @pxref{Program Arguments}) into an argz vector with
1403 the same elements, which is returned in @var{argz} and @var{argz_len}.
1408 @deftypefun {error_t} argz_create_sep (const char *@var{string}, int @var{sep}, char **@var{argz}, size_t *@var{argz_len})
1409 The @code{argz_create_sep} function converts the null-terminated string
1410 @var{string} into an argz vector (returned in @var{argz} and
1411 @var{argz_len}) by splitting it into elements at every occurance of the
1412 character @var{sep}.
1417 @deftypefun {size_t} argz_count (const char *@var{argz}, size_t @var{arg_len})
1418 Returns the number of elements in the argz vector @var{argz} and
1424 @deftypefun {void} argz_extract (char *@var{argz}, size_t @var{argz_len}, char **@var{argv})
1425 The @code{argz_extract} function converts the argz vector @var{argz} and
1426 @var{argz_len} into a Unix-style argument vector stored in @var{argv},
1427 by putting pointers to every element in @var{argz} into successive
1428 positions in @var{argv}, followed by a terminator of @code{0}.
1429 @var{Argv} must be pre-allocated with enough space to hold all the
1430 elements in @var{argz} plus the terminating @code{(char *)0}
1431 (@code{(argz_count (@var{argz}, @var{argz_len}) + 1) * sizeof (char *)}
1432 bytes should be enough). Note that the string pointers stored into
1433 @var{argv} point into @var{argz}---they are not copies---and so
1434 @var{argz} must be copied if it will be changed while @var{argv} is
1435 still active. This function is useful for passing the elements in
1436 @var{argz} to an exec function (@pxref{Executing a File}).
1441 @deftypefun {void} argz_stringify (char *@var{argz}, size_t @var{len}, int @var{sep})
1442 The @code{argz_stringify} converts @var{argz} into a normal string with
1443 the elements separated by the character @var{sep}, by replacing each
1444 @code{'\0'} inside @var{argz} (except the last one, which terminates the
1445 string) with @var{sep}. This is handy for printing @var{argz} in a
1451 @deftypefun {error_t} argz_add (char **@var{argz}, size_t *@var{argz_len}, const char *@var{str})
1452 The @code{argz_add} function adds the string @var{str} to the end of the
1453 argz vector @code{*@var{argz}}, and updates @code{*@var{argz}} and
1454 @code{*@var{argz_len}} accordingly.
1459 @deftypefun {error_t} argz_add_sep (char **@var{argz}, size_t *@var{argz_len}, const char *@var{str}, int @var{delim})
1460 The @code{argz_add_sep} function is similar to @code{argz_add}, but
1461 @var{str} is split into separate elements in the result at occurances of
1462 the character @var{delim}. This is useful, for instance, for
1463 adding the components of a Unix search path to an argz vector, by using
1464 a value of @code{':'} for @var{delim}.
1469 @deftypefun {error_t} argz_append (char **@var{argz}, size_t *@var{argz_len}, const char *@var{buf}, size_t @var{buf_len})
1470 The @code{argz_append} function appends @var{buf_len} bytes starting at
1471 @var{buf} to the argz vector @code{*@var{argz}}, reallocating
1472 @code{*@var{argz}} to accommodate it, and adding @var{buf_len} to
1473 @code{*@var{argz_len}}.
1478 @deftypefun {error_t} argz_delete (char **@var{argz}, size_t *@var{argz_len}, char *@var{entry})
1479 If @var{entry} points to the beginning of one of the elements in the
1480 argz vector @code{*@var{argz}}, the @code{argz_delete} function will
1481 remove this entry and reallocate @code{*@var{argz}}, modifying
1482 @code{*@var{argz}} and @code{*@var{argz_len}} accordingly. Note that as
1483 destructive argz functions usually reallocate their argz argument,
1484 pointers into argz vectors such as @var{entry} will then become invalid.
1489 @deftypefun {error_t} argz_insert (char **@var{argz}, size_t *@var{argz_len}, char *@var{before}, const char *@var{entry})
1490 The @code{argz_insert} function inserts the string @var{entry} into the
1491 argz vector @code{*@var{argz}} at a point just before the existing
1492 element pointed to by @var{before}, reallocating @code{*@var{argz}} and
1493 updating @code{*@var{argz}} and @code{*@var{argz_len}}. If @var{before}
1494 is @code{0}, @var{entry} is added to the end instead (as if by
1495 @code{argz_add}). Since the first element is in fact the same as
1496 @code{*@var{argz}}, passing in @code{*@var{argz}} as the value of
1497 @var{before} will result in @var{entry} being inserted at the beginning.
1502 @deftypefun {char *} argz_next (char *@var{argz}, size_t @var{argz_len}, const char *@var{entry})
1503 The @code{argz_next} function provides a convenient way of iterating
1504 over the elements in the argz vector @var{argz}. It returns a pointer
1505 to the next element in @var{argz} after the element @var{entry}, or
1506 @code{0} if there are no elements following @var{entry}. If @var{entry}
1507 is @code{0}, the first element of @var{argz} is returned.
1509 This behavior suggests two styles of iteration:
1513 while ((entry = argz_next (@var{argz}, @var{argz_len}, entry)))
1517 (the double parentheses are necessary to make some C compilers shut up
1518 about what they consider a questionable @code{while}-test) and:
1522 for (entry = @var{argz};
1524 entry = argz_next (@var{argz}, @var{argz_len}, entry))
1528 Note that the latter depends on @var{argz} having a value of @code{0} if
1529 it is empty (rather than a pointer to an empty block of memory); this
1530 invariant is maintained for argz vectors created by the functions here.
1535 @deftypefun error_t argz_replace (@w{char **@var{argz}, size_t *@var{argz_len}}, @w{const char *@var{str}, const char *@var{with}}, @w{unsigned *@var{replace_count}})
1536 Replace any occurances of the string @var{str} in @var{argz} with
1537 @var{with}, reallocating @var{argz} as necessary. If
1538 @var{replace_count} is non-zero, @code{*@var{replace_count}} will be
1539 incremented by number of replacements performed.
1542 @node Envz Functions, , Argz Functions, Argz and Envz Vectors
1543 @subsection Envz Functions
1545 Envz vectors are just argz vectors with additional constraints on the form
1546 of each element; as such, argz functions can also be used on them, where it
1549 Each element in an envz vector is a name-value pair, separated by a @code{'='}
1550 character; if multiple @code{'='} characters are present in an element, those
1551 after the first are considered part of the value, and treated like all other
1552 non-@code{'\0'} characters.
1554 If @emph{no} @code{'='} characters are present in an element, that element is
1555 considered the name of a ``null'' entry, as distinct from an entry with an
1556 empty value: @code{envz_get} will return @code{0} if given the name of null
1557 entry, whereas an entry with an empty value would result in a value of
1558 @code{""}; @code{envz_entry} will still find such entries, however. Null
1559 entries can be removed with @code{envz_strip} function.
1561 As with argz functions, envz functions that may allocate memory (and thus
1562 fail) have a return type of @code{error_t}, and return either @code{0} or
1566 These functions are declared in the standard include file @file{envz.h}.
1570 @deftypefun {char *} envz_entry (const char *@var{envz}, size_t @var{envz_len}, const char *@var{name})
1571 The @code{envz_entry} function finds the entry in @var{envz} with the name
1572 @var{name}, and returns a pointer to the whole entry---that is, the argz
1573 element which begins with @var{name} followed by a @code{'='} character. If
1574 there is no entry with that name, @code{0} is returned.
1579 @deftypefun {char *} envz_get (const char *@var{envz}, size_t @var{envz_len}, const char *@var{name})
1580 The @code{envz_get} function finds the entry in @var{envz} with the name
1581 @var{name} (like @code{envz_entry}), and returns a pointer to the value
1582 portion of that entry (following the @code{'='}). If there is no entry with
1583 that name (or only a null entry), @code{0} is returned.
1588 @deftypefun {error_t} envz_add (char **@var{envz}, size_t *@var{envz_len}, const char *@var{name}, const char *@var{value})
1589 The @code{envz_add} function adds an entry to @code{*@var{envz}}
1590 (updating @code{*@var{envz}} and @code{*@var{envz_len}}) with the name
1591 @var{name}, and value @var{value}. If an entry with the same name
1592 already exists in @var{envz}, it is removed first. If @var{value} is
1593 @code{0}, then the new entry will the special null type of entry
1599 @deftypefun {error_t} envz_merge (char **@var{envz}, size_t *@var{envz_len}, const char *@var{envz2}, size_t @var{envz2_len}, int @var{override})
1600 The @code{envz_merge} function adds each entry in @var{envz2} to @var{envz},
1601 as if with @code{envz_add}, updating @code{*@var{envz}} and
1602 @code{*@var{envz_len}}. If @var{override} is true, then values in @var{envz2}
1603 will supersede those with the same name in @var{envz}, otherwise not.
1605 Null entries are treated just like other entries in this respect, so a null
1606 entry in @var{envz} can prevent an entry of the same name in @var{envz2} from
1607 being added to @var{envz}, if @var{override} is false.
1612 @deftypefun {void} envz_strip (char **@var{envz}, size_t *@var{envz_len})
1613 The @code{envz_strip} function removes any null entries from @var{envz},
1614 updating @code{*@var{envz}} and @code{*@var{envz_len}}.