Searched refs:first (Results 226 - 250 of 539) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/uts/common/io/
H A Dconsms.c803 ws->id = 0; /* the first wheel */
1146 * msg->msg_rsp_list, reply upper layer using the first
1222 consms_response_t *first; local
1249 * Since we have use the first M_COPYIN/M_COPYOUT
1253 first = msg->msg_rsp_list;
1254 rsp = first->rsp_next;
1257 for (rsp = first->rsp_next; rsp != NULL; ) {
1268 /* the first one */
1269 (void) putq(WR(first->rsp_queue), mp);
1270 kmem_free(first, sizeo
[all...]
/illumos-gate/usr/src/cmd/oawk/
H A Db.c261 first(NODE *p) /* collects initially active leaves of p into setvec */ function
279 if (first(left(p)) == 0)
284 first(left(p));
287 if (first(left(p)) == 0 && first(right(p)) == 0)
291 b = first(right(p));
292 if (first(left(p)) == 0 || b == 0)
296 error(FATAL, "unknown type %d in first\n", type(p));
312 case PLUS: first(v);
323 if (first(righ
[all...]
/illumos-gate/usr/src/cmd/itadm/
H A Ditadm.c816 boolean_t first = B_TRUE; local
898 if (!script && first) {
901 first = B_FALSE;
1372 * Create the portal group and first portal
1432 boolean_t first = B_TRUE; local
1461 if (!script && first) {
1464 first = B_FALSE;
1727 boolean_t first = B_TRUE; local
1769 if (!script && first) {
1772 first
[all...]
/illumos-gate/usr/src/uts/intel/dtrace/
H A Dfasttrap_isa.c204 * In 64-bit mode, the first six arguments are stored in
234 size_t first = MIN(len, PAGESIZE - (pc & PAGEOFFSET)); local
247 if (uread(p, &instr[0], first, pc) != 0)
249 if (len > first &&
250 uread(p, &instr[first], len - first, pc + first) != 0) {
251 bzero(&instr[first], len - first);
252 len = first;
[all...]
/illumos-gate/usr/src/lib/libc/sparc/gen/
H A Dstrncpy.s60 ! This implementation works by first aligning the src ptr and
117 srl %i1, 24, %g1 ! first byte
162 stw %g0, [%l0] ! store first word
180 stb %g0, [%l0] ! store first byte
203 srl %i1, 24, %g1 ! first byte
243 stb %g1, [%l0] ! store first byte
H A Dstrlen.s120 bz,pn %icc, .done ! first byte zero
H A Dstrncmp.s121 andcc %i4, %l0, %g0 ! check if first byte was zero
166 andcc %i4, %l0, %g0 ! check if first byte was zero
210 andcc %i4, %l0, %g0 ! check if first byte was zero
247 andcc %i4, %l0, %g0 ! check if first byte was zero
/illumos-gate/usr/src/lib/brand/shared/zone/
H A Dcommon.ksh710 first=1
714 if [[ $first == 1 ]]; then
716 first=0
747 # The first argument specifies the type of image: archive, directory or stdin.
/illumos-gate/usr/src/cmd/mailx/
H A Daux.c599 int first = 1, wint = 0; local
632 if (first) {
634 first = 0;
H A Dcmd2.c67 * If any arguments were given, print the first message
68 * identified by the first argument. If no arguments are given,
93 * If this is the first command, select message 1.
156 *msgvec = first(0, MMNORM);
185 * by the sender of the first message in the msglist.
231 *msgvec = first(0, MMNORM);
376 *msgvec = first(0, MMNORM);
566 last = first(0, MDELETED);
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dmdi.c515 int i, linel = 8, first = 1; local
522 if (!first) {
525 first = 0;
/illumos-gate/usr/src/cmd/mdb/common/modules/scsi_vhci/
H A Dscsi_vhci.c375 int i, linel = 8, first = 1; local
382 if (!first) {
385 first = 0;
/illumos-gate/usr/src/cmd/fs.d/autofs/
H A Dautomount.c117 * Read in the values from SMF first before we check
347 * Optionally return the first
351 find_mount(mntpnt, first)
353 int first;
362 if (first)
/illumos-gate/usr/src/cmd/sgs/elfedit/common/
H A Delfconst.c343 * Should be called on first call to elfedit_const_to_atoui(). Does the
498 static int first = 1; local
504 if (first) {
506 first = 0;
/illumos-gate/usr/src/cmd/bnu/
H A Dct.c46 * and returns a pointer to the first digit in the string.
141 first = TRUE; local
243 for (count = 0;; count++) { /* count will be wait time after first
258 if (!first) { /* not the first time in loop */
272 first = FALSE;
364 * reads the first character, the lock file will be gone
H A Duucp.c450 static int first = 1; local
452 if (first) {
453 first = 0;
/illumos-gate/usr/src/cmd/sgs/rtld.4.x/
H A Ddiv.s174 ! first divide step without thinking. BUT, the others are conditional,
176 ! order bit set in the first step, just falling into the regular
177 ! division loop will mess up the first time around.
H A Drem.s173 ! first divide step without thinking. BUT, the others are conditional,
175 ! order bit set in the first step, just falling into the regular
176 ! division loop will mess up the first time around.
/illumos-gate/usr/src/tools/pmodes/
H A Dpmodes.c317 * the first field is the path, the second the type, the
386 /* Skip first column for non-prototype (i.e., pkgmap) files */
507 int cnt = 0, first = 0; local
512 first = tmp - name;
516 if (tmp - name > first - 4)
/illumos-gate/usr/src/lib/libast/common/uwin/
H A Drcmd.c323 int first = 1; local
352 if (first == 1) {
357 first = 0;
/illumos-gate/usr/src/uts/sparc/dtrace/
H A Dfbt.c391 uint32_t first = *instr; local
404 if (FBT_IS_SAVE(first)) {
405 *tinstr++ = first;
432 if (FBT_IS_SAVE(first)) {
442 uint32_t delay = first;
449 if (FBT_IS_BA(first) || FBT_IS_BAPCC(first)) {
457 if (FBT_IS_BA(first)) {
466 if ((first & FBT_OP_MASK) != FBT_OP0 ||
467 (first
[all...]
/illumos-gate/usr/src/cmd/dfs.cmds/sharectl/
H A Dsharectl.c130 int first = 1; local
184 if (!first)
186 first = 0;
/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/libnisdb/
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/libc/i386/gen/
H A Dwsncmp.s42 movl 8(%esp),%esi / %esi = first string

Completed in 214 milliseconds

1234567891011>>