Searched defs:matches (Results 1 - 25 of 26) sorted by relevance

12

/illumos-gate/usr/src/lib/print/libpapi-lpd/common/
H A Dlpd-query.c154 regmatch_t matches[10]; local
165 if (regexec(&job_re, line, (size_t)5, matches, 0) == REG_NOMATCH) {
166 if (regexec(&wjob_re, line, (size_t)10, matches, 0)
177 if ((s = regvalue(matches[1], line)) == NULL)
182 if ((s = regvalue(matches[4], line)) == NULL)
189 if ((s = regvalue(matches[7], line)) == NULL)
194 if ((s = regvalue(matches[8], line)) == NULL)
208 if ((s = regvalue(matches[1], line)) == NULL)
213 if ((s = regvalue(matches[2], line)) == NULL)
218 if ((s = regvalue(matches[
[all...]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dkeytab.c326 * matches, so we shouldn't allow it.
441 * See if any ambiguous matches exist, and if so make *first and *last
442 * refer to the first and last matches.
467 * matches KeySym ** The array of minimally matching symbols
468 * can be found in (*matches)[0..nmatch-1], unless
469 * no match was found, in which case *matches will
483 int nc, KeySym **matches, int *nmatch)
491 if(!kt || !binary_keyseq || !matches || !nmatch || nc < 0) {
509 *matches = kt->table + first;
513 *matches
482 _kt_lookup_keybinding(KeyTab *kt, const char *binary_keyseq, int nc, KeySym **matches, int *nmatch) argument
[all...]
H A Dcplmatch.c61 * matches[] array by whenever it is found to be too small.
72 * Completion matches are recorded in containers of the following
78 int matches_dim; /* The allocated size of result.matches[] */
188 cpl->result.matches = NULL;
215 cpl->result.matches = (CplMatch *) malloc(sizeof(cpl->result.matches[0]) *
217 if(!cpl->result.matches) {
245 if(cpl->result.matches) {
246 free(cpl->result.matches);
247 cpl->result.matches
318 CplMatch *matches = (CplMatch *) realloc(cpl->result.matches, local
974 CplMatch *matches; /* The array of matches */ local
[all...]
H A Dgetline.c1089 * Return the line index of the parenthesis that either matches the one under
5331 * history buffer whos prefix matches the characters that currently
5386 * history buffer who's prefix matches that specified in an earlier call
5396 * history buffer who's prefix matches that specified in the earlier call
5447 * history buffer who's prefix matches that specified in an earlier call
5474 CplMatches *matches; /* The possible completions */ local
5500 matches = cpl_complete_word(gl->cpl, gl->line, gl->buff_curpos, cb->data,
5505 if(!matches) {
5510 } else if(matches->nmatch >= 1) {
5512 * If there any ambiguous matches, repor
6133 CplMatches *matches = cpl_complete_word(gl->cpl, gl->line, gl->buff_curpos, local
[all...]
/illumos-gate/usr/src/cmd/hal/hald/
H A Ddevice_store.c343 GSList *matches = NULL; local
362 matches = g_slist_prepend (matches, d);
365 return matches;
/illumos-gate/usr/src/lib/lvm/libmeta/common/
H A Dmeta_set_tkr.c505 int matches = 0; local
729 * (old_devid) matches a devid known by
928 matches++;
934 matches++;
938 if (numsides > 0 && (numsides - matches) == 0) {
/illumos-gate/usr/src/cmd/mdb/common/mdb/
H A Dmdb_tab.c399 size_t matches, index; local
416 matches = mdb_tab_size(mcp);
417 if (matches == 1) {
/illumos-gate/usr/src/cmd/hal/hald/solaris/
H A Dsysevent.c252 int matches; local
271 matches = sscanf(s, "%s %s %s %s %s %s %d", class, subclass,
275 if (matches < 3) {
/illumos-gate/usr/src/lib/libadm/common/
H A Dgetdev.c84 * in matches().
103 * deviceent Defines a device that matches criteria
139 * getnextmatch() Get the next device that matches the search
145 * matches() See if the criteria and attribute match
160 static int matches(char *, char *, int);
242 * Keep on going until we get no more matches
759 * Gets the next device in the device table that matches the criteria.
769 * device that matches the criteria, or (char *) NULL if none.
797 * Search the device table until we've got a record that matches
815 * Search the device table until we've got a record that matches
1055 matches(char *value, char *compare, int function) function
[all...]
/illumos-gate/usr/src/cmd/luxadm/
H A Dadm.c406 getaction(char *cmd, struct keyword *matches, int *retval) argument
411 if (! cmd || ! matches || ! retval ||
416 while (matches->match) {
425 if ((((int)strlen(matches->match)) >= actlen) &&
426 (actlen >= matches->num_match) &&
428 /* (strncasecmp(matches->match, cmd, actlen) == 0) */
429 (strncmp(matches->match, cmd, actlen) == 0)) {
430 *retval = matches->ret_code; /* Found our match */
433 matches++; /* Next match string/struct */
435 } /* End of matches loo
[all...]
/illumos-gate/usr/src/lib/print/libpapi-common/common/
H A Dattribute.c661 regmatch_t matches[4]; local
672 matches, 0) == REG_NOMATCH)
676 list_append(parts, regvalue(matches[j], string));
/illumos-gate/usr/src/lib/libtecla/
H A Dlibtecla.h212 * matches. The '-' character looses its special meaning
215 * [^chars] - The same as [chars] except that it matches any single
281 * Ambiguous completion matches are recorded in objects of the
306 * contain the matches. This should be filled
456 * matches in.
480 * matches in.
1561 * separator here for directory matches, and a
1594 CplMatch *matches; /* The array of possible completion strings, */ member in struct:__anon4117
1596 int nmatch; /* The number of elements in matches[] */
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Ddoupdate.c426 int matches; local
438 matches = 0;
443 matches++;
447 if (matches > bestFit) {
448 bestFit = matches;
/illumos-gate/usr/src/uts/common/zmod/
H A Ddeflate.h116 * bytes. With this organization, matches are limited to a distance of
246 uInt matches; /* number of string matches in current block */ member in struct:internal_state
/illumos-gate/usr/src/uts/common/io/sfxge/common/
H A Def10_nic.c1086 uint32_t matches; local
1102 matches = (__ef10_external_port_mappings[i].modes_mask &
1104 if (matches != 0) {
1106 port_modes &= ~matches;
/illumos-gate/usr/src/lib/libzfs_jni/common/
H A Dlibzfs_jni_dataset.c295 regmatch_t matches[REGEX_ZFS_NAME_NGROUPS]; local
298 regexec(&re, name, REGEX_ZFS_NAME_NGROUPS, matches, 0) != 0) {
308 env, name, matches + REGEX_ZFS_NAME_POOL_GROUP);
310 env, name, matches + REGEX_ZFS_NAME_PARENT_GROUP);
312 env, name, matches + REGEX_ZFS_NAME_BASE_GROUP);
H A Dlibzfs_jni_pool.c490 regmatch_t matches[2]; local
495 if (regexec(&re, path, 2, matches, 0) == 0) {
496 regmatch_t *match = matches + 1;
512 if (regexec(&re, path, 2, matches, 0) == 0) {
513 regmatch_t *match = matches + 1;
/illumos-gate/usr/src/boot/lib/libz/
H A Ddeflate.h119 * bytes. With this organization, matches are limited to a distance of
249 uInt matches; /* number of string matches in current block */ member in struct:internal_state
/illumos-gate/usr/src/cmd/grep_xpg4/
H A Dgrep.c87 static uchar_t cflag; /* Count of matches */
91 static uchar_t lflag; /* Print file names of matches */
94 static uchar_t bflag; /* Preccede matches by block number */
167 case 'v': /* POSIX: negate matches */
246 case 'x': /* POSIX: full line matches */
808 long long matches = 0; /* Number of matching lines */ local
872 matches);
1116 matches++;
1167 (void) printf("%lld\n", matches);
1170 return (matches !
[all...]
/illumos-gate/usr/src/cmd/ldap/common/
H A Dldapsearch.c613 int rc, first, matches; local
804 matches = 0;
826 matches++;
912 matches = 0;
916 matches++;
927 printf( gettext("%d matches\n"), matches );
/illumos-gate/usr/src/uts/common/io/usb/usba/
H A Dusbai_register.c566 int matches = 0; local
607 matches++;
621 if (matches == 0) {
/illumos-gate/usr/src/lib/libast/common/misc/
H A Dmagic.c489 regmatch_t matches[10]; local
675 if ((c = regexec(ep->value.sub, p, elementsof(matches), matches, 0)) || (c = regsubexec(ep->value.sub, p, elementsof(matches), matches)))
683 if ((c = regexec(ep->value.sub, p, elementsof(matches), matches, 0)) || (c = regsubexec(ep->value.sub, p, elementsof(matches), matches)))
/illumos-gate/usr/src/cmd/picl/plugins/sun4u/psvc/psvcobj/
H A Dpsvcobj.c460 * Find number of matches to an antecedent_id of a certain
465 int32_t *matches)
471 *matches = 0;
484 ++*matches;
491 * Find 1st m matches to an antecedent_id of a certain
682 int32_t matches; local
713 PSVC_PRESENCE_SENSOR, &matches);
715 if (matches != 0) {
1321 int32_t status = PSVC_SUCCESS, matches; local
1333 PSVC_KS_NORMAL_POS_SENSOR, &matches);
464 i_psvc_get_assoc_matches(EHdl_t *hdlp, char *antecedent, int32_t assoc_id, int32_t *matches) argument
[all...]
/illumos-gate/usr/src/common/lzma/
H A DLzmaEnc.c305 UInt32 matches[LZMA_MATCH_LEN_MAX * 2 + 2 + 1]; member in struct:_CLzmaEnc
840 numPairs = p->matchFinder.GetMatches(p->matchFinderObj, p->matches);
847 printf("%2d %6d | ", p->matches[i], p->matches[i + 1]);
852 lenRes = p->matches[numPairs - 2];
856 UInt32 distance = p->matches[numPairs - 1] + 1;
954 UInt32 *matches; local
1011 matches = p->matches;
1014 *backRes = matches[numPair
1513 const UInt32 *matches; local
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c237 * bytes. With this organization, matches are limited to a distance of
368 uInt matches; /* number of string matches in current block */ member in struct:deflate_state
432 * most input files: try all possible matches and select the longest.
436 * string matches are performed only when the previous match ends. So it
437 * is preferable to spend more time in matches to allow very fast string
451 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
507 /* 1 */ {4, 4, 8, 4}, /* maximum speed, no lazy matches */
511 /* 4 */ {4, 4, 16, 16}, /* lazy matches */
951 * we prevent matches wit
[all...]

Completed in 159 milliseconds

12