Searched refs:strings (Results 1 - 25 of 196) sorted by last modified time

12345678

/haiku-fatelf/src/system/kernel/
H A Delf.cpp2784 const char* strings; local
2789 strings = image->debug_string_table;
2793 strings = image->strtab;
2804 stringTableSize += strlen(strings + stringTableSize) + 1;
2819 if (user_memcpy(stringTable, strings, stringsToCopy)
/haiku-fatelf/src/add-ons/kernel/busses/scsi/usb/
H A Dusb_scsi.c20 #include <strings.h>
H A Dsettings.c20 #include <strings.h> /* strncpy */
H A Dfake_device.c15 #include <strings.h>
/haiku-fatelf/src/kits/interface/
H A DFont.cpp942 BString *strings = new BString[numStrings]; local
943 GetTruncatedStrings(stringArray, numStrings, mode, width, strings);
946 strcpy(resultArray[i], strings[i].String());
948 delete[] strings;
998 // TODO: all strings into a single array???
/haiku-fatelf/src/system/boot/platform/bios_ia32/
H A Dstage1.S16 ; 1 enables more informative error strings, that shouldn't be seen by the
627 ; error strings
/haiku-fatelf/src/tests/kits/locale/
H A DcollatorTest.cpp67 printArray(const char *label, const char **strings, size_t size) argument
74 int compare = gCollator->Compare(strings[i], strings[i - 1]);
78 printf("\t*** broken sort order, next is NOT %s\n", strings[i]);
86 gCollator->GetSortKey(strings[i - 1], &a);
87 gCollator->GetSortKey(strings[i], &b);
96 printf("\t%s", strings[i]);
100 gCollator->GetSortKey(strings[i], &key);
115 " -k\tshows the sort keys along the strings (sort keys doesn't have to be visually correct)\n");
H A DlocaleTest.cpp66 const char *strings[] = {"gehen", "g��hen", "aus", "��U��", "auss", "��U��", "WO", local
69 for (int32 i = 0; strings[i]; i += 2) {
72 collator->GetSortKey(strings[i], &a, strength);
73 collator->GetSortKey(strings[i + 1], &b, strength);
76 strengths[strength-1], strings[i], a.String(), strings[i+1], b.String());
78 collator->Compare(strings[i], strings[i + 1], -1, strength),
/haiku-fatelf/src/tests/kits/net/netperf/
H A Dnetperf.c54 #include <strings.h>
H A Dnetserver.c79 # include <strings.h>
H A Dnetsh.c47 #include <strings.h>
240 /* netperf_usage done as two concatenated strings to make the MS
H A Dnettest_bsd.c64 # include <strings.h>
/haiku-fatelf/src/tests/servers/app/newClipping/
H A DLayer.cpp5 #include <strings.h>
/haiku-fatelf/src/tests/system/benchmarks/libMicro/
H A Dlibmicro.c43 #include <strings.h>
H A Dmmap.c36 #include <strings.h>
H A Dmprotect.c36 #include <strings.h>
H A Dmsync.c36 #include <strings.h>
H A Dmunmap.c36 #include <strings.h>
/haiku-fatelf/src/tests/system/libroot/posix/bonnie++-1.03d/
H A DMakefile10 WFLAGS=-Wall -W -Wshadow -Wpointer-arith -Wwrite-strings -pedantic -ffor-scope $(MORE_WARNINGS)
H A Dconfigure604 # include <strings.h>
3134 for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/conformance/interfaces/sem_timedwait/
H A D3-1.c20 #include <strings.h>
H A D7-1.c20 #include <strings.h>
/haiku-fatelf/src/tools/docbook/libxml2/
H A Ddict.c2 * dict.c: dictionary of reusable strings, just used to avoid allocation
68 xmlDictStringsPtr strings; member in struct:_xmlDict
133 pool = dict->strings;
155 pool->next = dict->strings;
156 dict->strings = pool;
189 pool = dict->strings;
211 pool->next = dict->strings;
212 dict->strings = pool;
337 dict->strings = NULL;
355 * Create a new dictionary, inheriting strings fro
[all...]
H A Dnanoftp.c62 #include <strings.h>
H A Dnanohttp.c61 #include <strings.h>

Completed in 229 milliseconds

12345678