Searched refs:search (Results 1 - 25 of 73) sorted by relevance

123

/haiku-fatelf/src/tests/system/benchmarks/libMicro/
H A Dgetenv.c55 " [-s search-size (default = %d)]\n"
56 "notes: measures time to search env for missing string\n",
109 char *search = "RUMPLSTILTSKIN"; local
112 (void) getenv(search);
113 (void) getenv(search);
114 (void) getenv(search);
115 (void) getenv(search);
116 (void) getenv(search);
117 (void) getenv(search);
118 (void) getenv(search);
[all...]
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dcgen-opc.c147 /* Initialize a keyword table search.
148 SPEC is a specification of what to search for.
152 The result is an opaque data item used to record the search status.
158 CGEN_KEYWORD_SEARCH search; local
167 search.table = kt;
168 search.spec = spec;
169 search.current_hash = 0;
170 search.current_entry = NULL;
171 return search;
178 cgen_keyword_search_next (CGEN_KEYWORD_SEARCH *search) argument
[all...]
H A Dcgen-asm.in442 CGEN_KEYWORD_SEARCH search = cgen_keyword_search_init (opvals, NULL);
445 while ((ke = cgen_keyword_search_next (& search)) != NULL)
447 #if 0 /* Unnecessary, should be done in the search routine. */
/haiku-fatelf/src/system/libroot/posix/glibc/misc/
H A Dhsearch.c20 #include <search.h>
H A Dinsremque.c20 #include <search.h>
H A Dlsearch.c1 /* Linear search functions.
21 #include <search.h>
H A Dhsearch_r.c25 #include <search.h>
127 /* This is the search function. It uses double hashing with open addressing.
/haiku-fatelf/src/system/libroot/posix/glibc/include/
H A Dsearch.h2 #include <misc/search.h>
/haiku-fatelf/src/libs/alm/
H A DTab.cpp30 bool HasLayout(BALMLayout* search) argument
32 if (layout == search)
34 return next ? next->HasLayout(search) : false;
/haiku-fatelf/src/libs/glut/
H A Dbeos_x11.cpp42 *Returns pointer to first char ins search which is also in what, else NULL.
44 static char *strscan (char *search, char *what)
49 while ((c = *(search++))) {
52 return (--search);
/haiku-fatelf/src/tests/add-ons/index_server/fulltext_search/
H A DBeaconSearcher.cpp21 using namespace lucene::search ;
87 hits = fMultiSearcher->search(luceneQuery) ;
101 hits = indexSearcher->search(luceneQuery) ;
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dvmsbuild.com7 $ SEARCH= "search /Exact"
19 $! anything not caught by link+search of dummy.* should be added here
43 $ if f$search("dummy.obj").nes."" then DELETE dummy.obj;*
50 $ if f$search("dummy.obj").eqs."" then goto pass2_failure1
59 $ if f$search("dummy.map").eqs."" then goto pass2_failure2
109 $ if pass.eq.3 .and. f$search("''f'.c").eqs."" then gosub chk_deffunc
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/conformance/interfaces/timer_create/speculative/
H A D2-1.c20 #include <search.h>
/haiku-fatelf/src/kits/network/libbind/irs/
H A Dlcl_gr.c281 grscan(struct irs_gr *this, int search, gid_t gid, const char *name) { argument
286 /* Read lines until we find one that matches our search criteria. */
293 if (search && name != NULL &&
317 if (search && name == NULL && (gid_t)pvt->group.gr_gid != gid)
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/
H A Dprinting.cpp29 char search[B_PATH_NAME_LENGTH], path[B_PATH_NAME_LENGTH]; local
35 // Create the search path for all .job files in the spool folder.
36 btMakePath(search, printer->spoolDir, "*.job");
41 finder = result = _findfirst(search, &fileInfo);
53 // Close our job search and wait awhile.
/haiku-fatelf/src/bin/bash/lib/readline/
H A DMakefile.in83 $(srcdir)/histfile.c $(srcdir)/nls.c $(srcdir)/search.c \
97 OBJECTS = readline.o vi_mode.o funmap.o keymaps.o parens.o search.o \
236 search.o: rldefs.h ${BUILD_DIR}/config.h rlconf.h
237 search.o: readline.h keymaps.h rltypedefs.h chardefs.h tilde.h
238 search.o: ansi_stdlib.h history.h rlstdc.h
288 search.o: rlprivate.h
312 search.o: xmalloc.h
330 search.o: rlmbutil.h
353 search.o: search
[all...]
H A DMakefile74 $(srcdir)/histfile.c $(srcdir)/nls.c $(srcdir)/search.c \
88 OBJECTS = readline.o vi_mode.o funmap.o keymaps.o parens.o search.o \
227 search.o: rldefs.h ${BUILD_DIR}/config.h rlconf.h
228 search.o: readline.h keymaps.h rltypedefs.h chardefs.h tilde.h
229 search.o: ansi_stdlib.h history.h rlstdc.h
279 search.o: rlprivate.h
303 search.o: xmalloc.h
321 search.o: rlmbutil.h
344 search.o: search
[all...]
/haiku-fatelf/src/bin/gdb/readline/shlib/
H A DMakefile.in117 $(topdir)/histfile.c $(topdir)/nls.c $(topdir)/search.c \
130 SHARED_OBJ = readline.so vi_mode.so funmap.so keymaps.so parens.so search.so \
275 search.so: $(topdir)/rldefs.h ${BUILD_DIR}/config.h $(topdir)/rlconf.h
276 search.so: $(topdir)/readline.h $(topdir)/keymaps.h $(topdir)/chardefs.h
277 search.so: $(topdir)/ansi_stdlib.h $(topdir)/history.h $(topdir)/tilde.h
278 search.so: $(topdir)/rltypedefs.h
331 search.so: $(topdir)/rlprivate.h
355 search.so: $(topdir)/xmalloc.h
373 search.o: $(topdir)/rlmbutil.h
395 search
[all...]
/haiku-fatelf/src/bin/gdb/readline/
H A DMakefile.in100 $(srcdir)/histfile.c $(srcdir)/nls.c $(srcdir)/search.c \
113 OBJECTS = readline.o vi_mode.o funmap.o keymaps.o parens.o search.o \
371 search.o: rldefs.h ${BUILD_DIR}/config.h rlconf.h
372 search.o: readline.h keymaps.h rltypedefs.h chardefs.h tilde.h
373 search.o: ansi_stdlib.h history.h rlstdc.h
424 search.o: rlprivate.h
448 search.o: xmalloc.h
466 search.o: rlmbutil.h
488 search.o: $(srcdir)/search
[all...]
/haiku-fatelf/headers/cpp/
H A Dalgo.h44 using __STD::search;
/haiku-fatelf/src/bin/bash/lib/intl/
H A Ddcigettext.c221 /* This is the type used for the search tree where known translations
225 /* Domain in which to search. */
245 /* Root of the search tree with known translations. We can use this
248 # include <search.h>
434 CATEGORY locale and, if PLURAL is nonzero, search over string
458 struct known_translation_t *search; local
496 search = (struct known_translation_t *)
498 memcpy (search->msgid, msgid1, msgid_len);
499 search->domainname = (char *) domainname;
500 search
[all...]
/haiku-fatelf/src/bin/gawk/intl/
H A Ddcigettext.c215 /* This is the type used for the search tree where known translations
219 /* Domain in which to search. */
239 /* Root of the search tree with known translations. We can use this
242 # include <search.h>
424 CATEGORY locale and, if PLURAL is nonzero, search over string
448 struct known_translation_t *search; local
486 search = (struct known_translation_t *)
488 memcpy (search->msgid, msgid1, msgid_len);
489 search->domainname = (char *) domainname;
490 search
[all...]
/haiku-fatelf/src/apps/webpositive/
H A DBrowserWindow.h194 BString _EncodeURIComponent(const BString& search);
196 void _VisitSearchEngine(const BString& search);
/haiku-fatelf/src/documentation/docbook-xsl/slides/browser/
H A DxbStyle.js165 while ( (capIndex = cappropname.search(/[A-Z]/)) != -1)
/haiku-fatelf/src/libs/edit/
H A DMakefile10 parse.c prompt.c read.c refresh.c search.c sig.c term.c tty.c vi.c

Completed in 942 milliseconds

123