Searched defs:first (Results 126 - 150 of 355) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/cmd/file/
H A Dmagicutils.c198 * tables: mtab1, if first = 1; mtab2 otherwise.
203 * Two magic tables may need to be created. The first
210 * def_position_tests(). The parameter "first" would
223 f_mkmtab(char *magfile, int cflg, int first) argument
234 if (first) {
512 if (first) {
533 * Since there may be two sets of magic tables, first = 1
534 * for the first magic table (mtab1) and 0 for the second magic
538 f_ckmtab(char *buf, int bufsize, int first) argument
550 if (first) {
1098 f_getmaxoffset(int first) argument
[all...]
/illumos-gate/usr/src/cmd/sgs/lex/common/
H A Dsub2.c35 static void first(int v);
186 first(v);
196 first(right[p]);
231 first(int v) function
263 first(left[v]);
264 first(right[v]);
268 first(left[v]);
277 first(left[v]);
298 first(left[v]);
301 first(lef
[all...]
/illumos-gate/usr/src/cmd/avs/dsstat/
H A Dsndr_stats.c356 int first = 1; local
456 printQueueStats(first, cur->cur_set);
462 if (first) {
464 first = 0;
488 printQueueStats(first, cur->cur_set);
494 if (first) {
496 first = 0;
827 printQueueStats(int first, kstat_t *cur_set) argument
831 if (! first) {
/illumos-gate/usr/src/cmd/awk/
H A Db.c345 first(Node *p) function
360 if (first(left(p)) == 0)
365 (void) first(left(p));
368 if (first(left(p)) == 0 && first(right(p)) == 0)
372 b = first(right(p));
373 if (first(left(p)) == 0 || b == 0)
377 ERROR "unknown type %d in first", type(p) FATAL;
393 (void) first(v);
404 if (first(righ
[all...]
/illumos-gate/usr/src/cmd/svr4pkg/pkgmk/
H A Dsplpkgmap.c56 #define ERR_INFOFIRST "information file <%s> must appear on first part"
57 #define ERR_INFOSPACE "all install files must appear on first part"
71 int first; member in struct:class_type
260 * initialize first volume
265 * reserve room on first volume for pkgmap
277 * place installation files on first volume!
352 if (cl[i].first == 0)
353 cl[i].last = cl[i].first = (i ? cl[i-1].last : 1);
360 f[j].ept->volno = cl[i].first;
593 if (!cl[i].first || (vo
[all...]
/illumos-gate/usr/src/uts/common/io/ib/clients/rdsv3/
H A Dib_send.c509 ix = 1; /* first data sgl is at 1 */
544 * This can be called multiple times for a given message. The first time
563 struct rdsv3_ib_send_work *first; local
626 /* map the message the first time we see it */
688 * should call rdsv3_ib_ring_alloc first.
702 first = send;
850 "ic %p first %p nwr: %d ret %d:%d",
851 ic, first, i, ret, posted);
1003 /* map the message the first time we see it */
/illumos-gate/usr/src/uts/sparc/os/
H A Dsyscall.c1107 kthread_t *first; local
1111 t = first = p->p_tlist;
1114 } while ((t = t->t_forw) != first);
1124 kthread_t *first; local
1128 t = first = p->p_tlist;
1131 } while ((t = t->t_forw) != first);
1141 kthread_t *first; local
1145 t = first = p->p_tlist;
1149 } while ((t = t->t_forw) != first);
1163 kthread_t *first; local
1225 kthread_t *first; local
[all...]
/illumos-gate/usr/src/uts/common/fs/smbsrv/
H A Dsmb2_dispatch.c1241 smb_kstat_req_t *ksr, int first, int nreq)
1247 last = first + nreq - 1;
1249 if ((first < SMB2__NCMDS) && (last < SMB2__NCMDS)) {
1250 for (i = first; i <= last; i++, ksr++) {
1240 smb2_dispatch_stats_update(smb_server_t *sv, smb_kstat_req_t *ksr, int first, int nreq) argument
H A Dsmb_dispatch.c33 * smb_com a byte, the "first" command
59 * first parameters, or the andx_com of the just
70 * first parameters, or the andx_com of the just
78 * smb_com a byte, the "first" command, corresponds
121 * first parameters, or the andx_com of the just
132 * first parameters, or the andx_com of the just
1258 smb_kstat_req_t *ksr, int first, int nreq)
1264 last = first + nreq - 1;
1266 if ((first < SMB_COM_NUM) && (last < SMB_COM_NUM)) {
1267 for (i = first;
1257 smb_dispatch_stats_update(smb_server_t *sv, smb_kstat_req_t *ksr, int first, int nreq) argument
[all...]
/illumos-gate/usr/src/common/avl/
H A Davl.c978 void *first; local
982 * Initial calls go to the first node or it's right descendant.
985 first = avl_first(tree);
990 if (first == NULL) {
995 node = AVL_DATA2NODE(first, off);
/illumos-gate/usr/src/lib/libzfs/common/
H A Dlibzfs_iter.c449 boolean_t first; member in struct:iter_dependents_arg
461 boolean_t first = ida->first; local
462 ida->first = B_FALSE;
507 if (!first && err == 0)
524 ida.first = B_TRUE;
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dvdev_queue.c59 * The scheduler selects the next operation to issue by first looking for an
499 * (lio->io_offset + lio->io_size) minus start of the first (fio->io_offset).
509 zio_t *first, *last, *aio, *dio, *mandatory, *nio; local
519 first = last = zio;
537 mandatory = (first->io_flags & ZIO_FLAG_OPTIONAL) ? NULL : first;
543 while ((dio = AVL_PREV(t, first)) != NULL &&
546 IO_GAP(dio, first) <= maxgap) {
547 first = dio;
548 if (mandatory == NULL && !(first
[all...]
/illumos-gate/usr/src/test/os-tests/tests/file-locking/
H A Druntests.c519 flock_log("Acquiring first two shared locks...");
561 lock_style_t first, second; local
565 for (first = (lock_style_t)0; first < LSTYLE_LAST; first++) {
567 flock_test_exclusive(first, second,
569 flock_test_exclusive(first, second,
575 for (first = (lock_style_t)0; first < LSTYLE_LAST; first
[all...]
/illumos-gate/usr/src/lib/nsswitch/nis/common/
H A Dgetnetgrent.c213 * want fast insertion and pop-first, so a linked list will do fine).
214 * If we insert at the head, we get a depth-first search; insertion
215 * at the tail gives breadth-first (?), which seems preferable (?).
292 /* Insert in expansion list (insert at end for breadth-first search */
304 struct netgrnam *first; local
306 if ((first = ngt->expand_first) == 0) {
309 if ((ngt->expand_first = first->expand_next) == 0) {
312 return (first->name);
/illumos-gate/usr/src/lib/libresolv2/common/nameser/
H A Dns_name.c520 int n, l, first = 1; local
575 (dstp - msg) < 0x4000 && first) {
578 first = 0;
818 /* Recurse to get rest of name done first. */
916 *\li dnptrs is the pointer to the first name on the list,
/illumos-gate/usr/src/lib/libcurses/screen/
H A Dwrefresh.c357 * Three schemes of coloring are allowed. The first is the usual
671 bool first = FALSE; local
685 first = TRUE;
691 tempx = first ? video_attrx : wx;
992 /* set the video attr of the first char here */
1019 /* set the video attr of the first char here */
/illumos-gate/usr/src/lib/libtecla/common/
H A Dcplmatch.c92 * The new_CplFileConf() constructor sets the integer first member of
114 int file_start; /* The index in the input line of the first character */
432 const char *first, *last; /* The first and last matching suffixes */ local
448 * Given that the array of matches is sorted, the first and last
453 first = result->matches[0].suffix;
456 * Find the point at which the first and last matching strings
457 * first difffer.
459 while(*first && *first
[all...]
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dm_cc.c73 * The conversion stops at the end of string or the first WEOF.
119 * The conversion stops at the end of string or the first WEOF. Return the
200 * If 0 < n, set a new multibyte string and convert the first character,
428 /* Find spacing character and place in as first element. */
461 * Return the first column of a multi-column character, in window.
498 int first, width; local
500 first = __m_cc_first(w, y, x);
503 return ((first + width) == (x + 1));
546 /* Write the first column of the character. */
570 /* Mark this as the first colum
[all...]
/illumos-gate/usr/src/lib/libnisdb/
H A Ddb_mindex.cc78 reset(); /* get rid of data structures first */
422 * Returns the first entry found in the table by setting 'answer' to
427 db_mindex::first(entryp *where, entry_object ** answer) function in class:db_mindex
437 READLOCK(this, DB_LOCK_ERROR, "r db_mindex::first");
438 READLOCK2(table, DB_LOCK_ERROR, "r table db_mindex::first", this);
450 "ru db_mindex::first LDAP",
451 "ru table db_mindex::first LDAP");
462 "ru db_mindex::first", "ru table db_mindex::first");
526 * the results of the first/nex
546 db_mindex::first(db_query *q, function in class:db_mindex
[all...]
H A Dldap_util.c675 int first = 1, i; local
691 if (first) {
692 first = 0;
697 first = 1;
774 * there will be no escapes. Process rapidly up to first escape.
/illumos-gate/usr/src/lib/libpkg/common/
H A Dpkgserv.c254 int first = B_TRUE; local
313 if (!first || mode == NEVER)
316 first = B_FALSE;
/illumos-gate/usr/src/lib/libc/port/locale/
H A Dengine.c509 for (;;) { /* find first matching branch */
704 for (;;) { /* find first matching branch */
1034 case OCH_: /* mark the first two branches */
1076 int first = 1; local
1086 (void) fprintf(d, "%s%d", (first) ? "\t" : ", ", i);
1087 first = 0;
/illumos-gate/usr/src/lib/libcmd/common/
H A Djoin.c214 getolist(Join_t* jp, const char* first, char** arglist) argument
216 register const char* cp = first;
239 error(2,"%s: invalid field list",first);
608 /* output join field first */
/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/
H A Drequest.c1077 int first; local
1080 first = 1;
1084 first = 0;
1093 if ( first ) {
/illumos-gate/usr/src/lib/abi/apptrace/common/
H A Dapptrace.c265 * fcntl with F_DUPFD returns first available >= arg3
334 static int first = 1; local
338 * If this is the first time in, then l_name is the app
342 if (first && bindfrom_list == NULL) {
344 first = 0;

Completed in 514 milliseconds

1234567891011>>