Searched refs:strings (Results 51 - 75 of 196) sorted by relevance

12345678

/haiku-fatelf/src/bin/bc/dc/
H A Dmisc.c40 # include <strings.h>
H A Dstring.c45 # include <strings.h> /* memcpy, maybe */
208 /* initialize the strings subsystem */
/haiku-fatelf/src/bin/findutils/locate/
H A Dfrcode.c23 The input is a sorted list of NUL-terminated strings.
25 NUL-terminated strings.)
73 #include <strings.h>
125 /* Return the length of the longest common prefix of strings S1 and S2. */
H A Dcode.c54 #include <strings.h>
109 /* Return the length of the longest common prefix of strings S1 and S2. */
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dconcat.c1 /* Concatenate variable number of strings.
26 Concatenate zero or more of strings and return the result in freshly
29 pointer encountered. Pointers to empty strings are ignored.
64 # include <strings.h>
/haiku-fatelf/src/bin/gdb/readline/
H A Dparens.c51 # include <strings.h>
/haiku-fatelf/src/bin/network/wget/src/
H A Dcss-url.c47 # include <strings.h>
/haiku-fatelf/src/bin/sharutils/intl/
H A Dbindtextdom.c35 # include <strings.h>
/haiku-fatelf/src/bin/sharutils/lib/
H A Dsystem.h67 # include <strings.h>
/haiku-fatelf/src/system/libroot/add-ons/icu/
H A DICUNumericData.cpp11 #include <strings.h>
/haiku-fatelf/src/tests/kits/net/netperf/
H A Dnetperf.c54 #include <strings.h>
/haiku-fatelf/src/tests/system/benchmarks/libMicro/
H A Dmmap.c36 #include <strings.h>
H A Dmprotect.c36 #include <strings.h>
H A Dmunmap.c36 #include <strings.h>
/haiku-fatelf/src/bin/gdb/bfd/
H A Dconfigure.com205 /* Define if you have the <strings.h> header file. */
H A Dmerge.c68 /* Are entries fixed size or zero terminated strings? */
69 bfd_boolean strings; member in struct:sec_merge_hash
145 if (table->strings)
236 sec_merge_init (unsigned int entsize, bfd_boolean strings) argument
254 table->strings = strings;
530 /* Like strrevcmp, but for the case where all strings have the same
573 merge strings matching suffixes of longer strings. */
582 /* Now sort the strings */
[all...]
H A Dcoffgen.c97 const char *strings; local
104 strings = _bfd_coff_read_string_table (abfd);
105 if (strings == NULL)
110 strings += strindex;
111 name = bfd_alloc (abfd, (bfd_size_type) strlen (strings) + 1);
114 strcpy (name, strings);
409 const char *strings; local
412 strings = obj_coff_strings (abfd);
413 if (strings == NULL)
415 strings
1628 char *strings; local
[all...]
H A Dversados.c94 char *strings; /* strings of all the above */ member in struct:versados_data_struct
259 char *n = VDATA (abfd)->strings;
260 strcpy (VDATA (abfd)->strings, name);
261 VDATA (abfd)->strings += strlen (VDATA (abfd)->strings) + 1;
572 VDATA (abfd)->strings = bfd_alloc (abfd, amt);
575 || (VDATA (abfd)->strings == NULL && VDATA (abfd)->stringlen > 0))
H A Dpdp11.c455 /* Now write out reloc info, followed by syms and strings */
1511 char *strings;
1513 /* Get the size of the strings. */
1524 strings = (char *) obj_aout_string_window (abfd).data;
1526 strings = (char *) bfd_malloc (stringsize + 1);
1527 if (strings == NULL)
1532 if (bfd_bread (strings + 4, stringsize - 4, abfd) != stringsize - 4)
1534 free (strings);
1540 strings[0] = '\0';
1542 strings[stringsiz
1510 char *strings; local
3001 char *strings; local
3137 char *strings; local
3806 char *strings; local
4515 char *strings; local
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A Dremote-e7000.c1834 static char *strings[NITEMS] = local
1849 p[i] = strings[i];
1866 p[i] = strings[i];
1873 /* Suck characters, if a string match, then return the strings index
1877 expect_n (char **strings) argument
1884 /* Count number of expect strings */
1886 for (n = 0; strings[n]; n++)
1888 ptr[n] = strings[n];
1930 ptr[i] = strings[i];
/haiku-fatelf/src/add-ons/media/plugins/ffmpeg/
H A Dgen_lookup.cpp10 #include <strings.h>
H A Dgfx_util.cpp3 #include <strings.h>
/haiku-fatelf/src/bin/bash/lib/readline/
H A Dchardefs.h35 # include <strings.h>
/haiku-fatelf/src/bin/diffutils/lib/
H A Dexclude.c48 # include <strings.h>
H A Dxstrtol.c41 # include <strings.h>

Completed in 201 milliseconds

12345678