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

123456

/illumos-gate/usr/src/tools/onbld/Checks/
H A DWsCheck.py38 if re.search(r' \t', line):
41 if re.search(r'[ \t]$', line):
H A DHdrChk.py110 if self.lenient and re.search(r'^\s*//', line):
114 if not re.search(r'^\s*/\*', line):
117 while not re.search(r'\*/', line):
180 if lenient and line.startswith("#pragma ident") and IDENT.search(line):
187 match = re.search(r'^#ifndef\s([a-zA-Z0-9_]+)$', line)
206 if not re.search(r'^_.*%s[_]?$' % guardname, guard):
212 if not re.search(r'#define\s%s$' % guard, line):
227 not IDENT.search(line)):
247 match = re.search(r'^#include(.*)$', line)
253 if not lenient and not re.search(
[all...]
H A DCopyright.py37 return re.search(r'Copyright (?!\[yyyy\])', line)
40 return re.search(r'Copyright.*\b%s\b' % time.strftime('%Y'), line)
H A DSpellCheck.py283 if entry[0].search(line):
286 if entry[0].search(line):
289 if entry[0].search(line):
H A DKeywords.py64 if lenient and ident.search(line):
H A DComments.py91 if ignorere.search(com):
102 match = bugre.search(com)
114 match = bugnospcre.search(com)
147 if not re.search(r'^' + re.escape(synopsis) +
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dtfind.c29 * Tree search algorithm, generalized from Knuth (6.2.2) Algorithm T.
35 #include <search.h>
/illumos-gate/usr/src/cmd/cmd-inet/lib/nwamd/
H A Dllp.h30 #include <search.h>
/illumos-gate/usr/src/cmd/mandoc/
H A Dmain.c119 struct mansearch search; local
172 memset(&search, 0, sizeof(struct mansearch));
173 search.outkey = "Nd";
177 search.argmode = ARG_NAME;
179 search.argmode = ARG_EXPR;
181 search.argmode = ARG_WORD;
183 search.argmode = ARG_NAME;
185 search.argmode = ARG_FILE;
201 if (c == 'i' && search.argmode == ARG_EXPR) {
216 search
905 struct mansearch search; local
[all...]
H A Dmansearch.c84 mansearch(const struct mansearch *search, argument
100 if ((e = exprcomp(search, argc, argv, &argi)) == NULL) {
110 if (search->outkey != NULL)
112 if (0 == strcasecmp(search->outkey,
134 * search.
172 if (lstmatch(search->sec, page->sect) == 0 ||
173 lstmatch(search->arch, page->arch) == 0 ||
174 (search->argmode == ARG_NAME &&
219 if (cur && search->firstmatch)
606 exprcomp(const struct mansearch *search, in argument
659 expr_and(const struct mansearch *search, int argc, char *argv[], int *argi) argument
715 exprterm(const struct mansearch *search, int argc, char *argv[], int *argi) argument
[all...]
/illumos-gate/usr/src/cmd/mailx/
H A Dmyfopen.c60 static NODE *search();
77 search(FILE *fp) function
147 cur = search(iop);
/illumos-gate/usr/src/lib/libnsl/rpc/
H A Dfdsync.c62 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
/illumos-gate/usr/src/lib/libc/port/gen/
H A Dlfind.c33 * Linear search algorithm, generalized from Knuth (6.1) Algorithm Q.
53 #include <search.h>
H A Dtfind.c33 * Tree search algorithm, generalized from Knuth (6.2.2) Algorithm T.
44 #include <search.h>
/illumos-gate/usr/src/lib/libc/sparc/gen/
H A Dmemchr.s64 bz .prepword ! yup, prepare for word-wise search
65 and %o1, 0xff, %o1 ! search only for this one byte
74 bz .prepword2 ! yup, prepare for word-wise search
83 bz .prepword3 ! yup, prepare for word-wise search
144 ! Here we know that "word" is the last word in the search, and that
/illumos-gate/usr/src/lib/libc/sparcv9/gen/
H A Dmemchr.s64 bz %ncc, .prepword ! yup, prepare for word-wise search
65 and %o1, 0xff, %o1 ! search only for this one byte
74 bz %ncc, .prepword2 ! yup, prepare for word-wise search
83 bz %ncc, .prepword3 ! yup, prepare for word-wise search
144 ! Here we know that "word" is the last word in the search, and that
/illumos-gate/usr/src/cmd/refer/
H A Drefer0.c37 char **search = rdata; variable
H A Drefer1.c76 *search++ = argv[1];
77 if (search-rdata > NSERCH)
113 *search++ = getenv("REFER");
115 *search++ = "/usr/lib/refer/papers/Ind";
H A Drefer..c42 extern char *rdata[], **search;
/illumos-gate/usr/src/tools/smatch/src/smatch_scripts/
H A Dcall_tree.pl67 sub search($$) subroutine
142 search($start_func, $end_func);
/illumos-gate/usr/src/cmd/oamuser/user/
H A Dhomedir.c312 struct mnttab entry, search; local
316 search.mnt_special = search.mnt_mntopts = search.mnt_time = NULL;
317 search.mnt_mountp = mountp;
318 search.mnt_fstype = fstype;
321 if (getmntany(fp, &entry, &search) == 0)
/illumos-gate/usr/src/cmd/sgs/libconv/common/
H A Daudit.c104 conv_la_search(uint_t search, Conv_la_search_buf_t *la_search_buf) argument
118 if (search == 0)
122 conv_arg.oflags = conv_arg.rflags = search;
/illumos-gate/usr/src/lib/efcode/fcdriver/
H A Dload_node.c53 * 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 *)) argument
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, f
[all...]
/illumos-gate/usr/src/cmd/ldapcachemgr/
H A Dcachemgr_discovery.c363 char *search = NULL; local
393 /* (re)construct the search filter form the input context */
394 search = malloc(strlen(cookie->context_attr) +
397 if (!search) {
401 (void) sprintf(search, "(%s=%s)", cookie->context_attr, context);
413 search, foreach_server, cookie);
428 if (search) free(search);
/illumos-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DpmHelpSearchPanel.java149 // place item titles in search result panel
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");
363 this.add(search, c);
374 pmHelpSearchQueryPanel.this.search.doClick();
384 // make search th
[all...]

Completed in 101 milliseconds

123456