| /netvirt/usr/src/cmd/man/src/util/nsgmls.src/include/ |
| NotationStorage.h | 23 Boolean search,
|
| Options.h | 27 const T *search(T) const;
|
| URLStorage.h | 22 Boolean search,
|
| WinInetStorage.h | 20 Boolean search,
|
| Options.cxx | 22 const T *Options<T>::search(T c) const function in class:SP_NAMESPACE::Options
54 && (cp = search(c)) != 0
89 if (c == T(':') || (cp = search(c)) == 0) {
|
| StorageManager.h | 44 Boolean search,
54 // and physical searching is required to resolve it and search is true;
60 Boolean search) const;
|
| /netvirt/usr/src/lib/libbc/libc/gen/common/ |
| tfind.c | 29 * Tree search algorithm, generalized from Knuth (6.2.2) Algorithm T.
35 #include <search.h>
|
| /netvirt/usr/src/cmd/mailx/ |
| myfopen.c | 60 static NODE *search();
77 search(FILE *fp) function
147 cur = search(iop);
|
| /netvirt/usr/src/cmd/refer/ |
| refer0.c | 37 char **search = rdata; variable
|
| refer1.c | 76 *search++ = argv[1];
77 if (search-rdata > NSERCH)
113 *search++ = getenv("REFER");
115 *search++ = "/usr/lib/refer/papers/Ind";
|
| refer..c | 42 extern char *rdata[], **search;
|
| /netvirt/usr/src/lib/libc/port/gen/ |
| lfind.c | 34 * Linear search algorithm, generalized from Knuth (6.1) Algorithm Q.
54 #include <search.h>
|
| tfind.c | 34 * Tree search algorithm, generalized from Knuth (6.2.2) Algorithm T.
45 #include <search.h>
|
| /netvirt/usr/src/lib/libc/sparc/gen/ |
| memchr.s | 66 bz .prepword ! yup, prepare for word-wise search
67 and %o1, 0xff, %o1 ! search only for this one byte
76 bz .prepword2 ! yup, prepare for word-wise search
85 bz .prepword3 ! yup, prepare for word-wise search
146 ! Here we know that "word" is the last word in the search, and that
|
| /netvirt/usr/src/lib/libc/sparcv9/gen/ |
| memchr.s | 66 bz %ncc, .prepword ! yup, prepare for word-wise search
67 and %o1, 0xff, %o1 ! search only for this one byte
76 bz %ncc, .prepword2 ! yup, prepare for word-wise search
85 bz %ncc, .prepword3 ! yup, prepare for word-wise search
146 ! Here we know that "word" is the last word in the search, and that
|
| /netvirt/usr/src/lib/libnsl/rpc/ |
| fdsync.c | 62 static mutex_t *search(const void *handle, int fd);
81 * If search() and create_block() fail for rpc_fd_lock(), then search()
94 mp = search(handle, fd);
113 mp = search(handle, fd);
157 search(const void *handle, int fd) function
|
| /netvirt/usr/src/cmd/lp/lib/filters/ |
| Makefile | 43 search.o \
|
| /netvirt/usr/src/lib/efcode/fcdriver/ |
| load_node.c | 53 * Build the library/drop-in fcode search path. If there's no architecture
54 * passed, we build the search path (per the PSARC decision):
58 * If there is an architecture passed, we prepend the following search path to
114 search_path(char *name, char *search, int (*fn)(char *))
119 fpath = STRDUP(search);
186 char *search, *fname; local
190 if ((search = cdp->search_path) == NULL &&
191 (search = default_search_path) == NULL) {
192 log_message(MSG_ERROR, "find_lib_file: no search path\n");
198 fname = search_path(lib_name, search, fn)
[all...] |
| /netvirt/usr/src/cmd/ldapcachemgr/ |
| cachemgr_discovery.c | 364 char *search = NULL; local
394 /* (re)construct the search filter form the input context */
395 search = malloc(strlen(cookie->context_attr) +
398 if (!search) {
402 (void) sprintf(search, "(%s=%s)", cookie->context_attr, context);
414 search, foreach_server, cookie);
429 if (search) free(search);
|
| /netvirt/usr/src/cmd/sgs/rtld/common/ |
| paths.c | 32 * PATH setup and search directory functions.
47 * Given a search rule type, return a list of directories to search according
55 int search; local
64 search = 1;
66 search = 0;
72 * (LD_LIBRARY_PATH) search path list. Note, we always call
74 * be preceded with the appropriate search path information.
90 * For ldd(1) -s, indicate the search paths that'll
92 * search paths may be ignored, therefore reset th
[all...] |
| /netvirt/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/ |
| pmHelpSearchPanel.java | 29 * Search help keywords
149 // place item titles in search result panel
193 pmUtility.getResource("Search.Results:"));
197 * pmUtility.getIntResource("Search.Results:.mnemonic"));
300 pmButton search; field in class:pmHelpSearchQueryPanel
330 search = new pmButton(
332 search.setMnemonic(
335 search.addActionListener(new ActionListener() {
350 Debug.info("HELP: search vector full");
353 Debug.info("HELP: search vector empty")
[all...] |
| /netvirt/usr/src/cmd/fm/schemes/zfs/ |
| scheme.c | 92 find_vdev_iter(nvlist_t *nv, uint64_t search)
101 if (search == guid)
109 if ((ret = find_vdev_iter(child[c], search)) != 0)
|
| /netvirt/usr/src/cmd/perl/5.8.4/distrib/lib/Class/ |
| ISA.pm | 13 Class::ISA -- report the search path for a class's ISA tree
51 maybe "height-first" is the word) search. In the above example, it'd
56 the list (in order) of names of classes Perl would search to find a
66 search thru in order to find a method, with no duplicates in the list.
106 suppose, AUTOLOADs could bypass Perl's ISA-based search mechanism and
|
| /netvirt/usr/src/cmd/zpool/ |
| zpool_iter.c | 147 * Search for any new pools, adding them to the list. We only add pools when no
185 zpool_node_t search, *node; local
187 search.zn_handle = zhp;
188 if ((node = uu_avl_find(zlp->zl_avl, &search, NULL, NULL)) != NULL) {
|
| /netvirt/usr/src/cmd/perl/5.6.1/distrib/lib/Search/ |
| Dict.pm | 1 package Search::Dict;
10 Search::Dict, look - search for key in dictionary file
14 use Search::Dict;
25 If I<$dict> is true, search by dictionary order (ignore anything but word
|
