Searched defs:child (Results 1 - 11 of 11) sorted by relevance
| /ast/src/lib/libcs/ |
| H A D | cslocal.c | 40 child(int sig) function
59 if ((fun = signal(SIGCHLD, child)) == SIG_DFL) signal(SIGCHLD, fun);
|
| /ast/src/cmd/tests/sfio/ |
| H A D | tmprdwr.c | 117 int parent[2], child[2]; local
121 if(pipe(parent) < 0 || pipe(child) < 0)
135 disc.recv = child[0];
144 close(child[0]); close(parent[1]);
145 writeprocess(child[1], parent[0], fw);
148 close(child[1]); close(parent[0]);
|
| /ast/src/lib/libast/misc/ |
| H A D | procopen.c | 129 Fd_t child; member in struct:Mod_s::__anon290::__anon291
257 if ((m->arg.fd.child.fd = (short)arg2) != arg1)
261 m->arg.fd.child.flag = fcntl(arg2, F_GETFD, 0);
347 if (m->arg.fd.child.fd != m->arg.fd.parent.fd && m->arg.fd.child.fd != PROC_ARG_NULL)
354 fcntl(m->arg.fd.child.fd, F_DUPFD, m->arg.fd.parent.fd);
358 close(m->arg.fd.child.fd);
359 fcntl(m->save, F_DUPFD, m->arg.fd.child.fd);
361 if (m->arg.fd.child.flag)
362 fcntl(m->arg.fd.child
[all...] |
| /ast/src/lib/libmam/ |
| H A D | mam.h | 105 struct proc* child; /* child proc list */ member in struct:proc
|
| /ast/src/lib/libtk/generic/ |
| H A D | tkOption.c | 27 * child of the parent.
41 } child; member in struct:Element
57 * NODE - Zero means this is a leaf element (the child
324 newEl.child.arrayPtr = NewArray(5);
326 arrayPtrPtr = &((*arrayPtrPtr)->nextToUse[-1].child.arrayPtr);
331 arrayPtrPtr = &(elPtr->child.arrayPtr);
346 newEl.child.valueUid = Tk_GetUid(value);
357 elPtr->child.valueUid = newEl.child.valueUid;
447 return bestPtr->child
[all...] |
| /ast/src/cmd/ksh93/sh/ |
| H A D | subshell.c | 58 Namval_t *child; member in struct:Link
82 pid_t subpid; /* child process id */
177 * The child continues possibly with its standard output replaced by temp file
205 /* this is the child part of the fork */
289 *((Namval_t**)mp) = lp->child;
290 lp->child = mp;
367 for(mp=lp->child; mp; mp=mpnext)
630 /* trap on EXIT not handled by child */
638 if(shp->subshell==0) /* must be child process */
|
| H A D | parse.c | 244 static Shnode_t *makeparent(Lex_t *lp, int flag, Shnode_t *child) argument
248 par->fork.forktre = child;
|
| /ast/src/cmd/sort/ |
| H A D | main.c | 301 int child; /* in child process */ member in struct:Sort_s
1239 if (sp->child || !(fp = rstempwrite(sp->rec, (Sfio_t*)0)))
1263 if (sp->child || !(fp = rstempwrite(sp->rec, (Sfio_t*)0)))
1401 if (sp->verbose && !sp->child)
1407 if (sp->child)
1568 error(ERROR_SYSTEM|3, "not enough child processes");
1570 sp->child = 1;
1608 error(3, "%d child process%s failed", i, i == 1 ? "" : "es");
|
| /ast/src/cmd/codexlib/lzh/ |
| H A D | lzh.c | 85 short child[TREESIZE]; member in struct:State_s
434 if ((k = state->child[i]) < 0)
437 state->child[j] = k;
451 state->child[i] = state->child[j];
461 state->child[i] = state->child[j];
466 state->child[i] = l + 1;
473 if ((j = state->child[i]) < 0)
498 r = state->child[
[all...] |
| /ast/src/lib/libtk/unix/ |
| H A D | tkUnixWm.c | 64 * that is a child of the root window (may
146 * border to upper-left outer corner of child's
3218 TkWindow *nextPtr; /* Coordinates of highest child found so
3249 * Step 3: if the window we've found so far (a child of the root)
3250 * is the virtual root window, then look again to find the child of
3279 * the whole process on that child.
4029 Window w, root, child;
4039 if (XQueryPointer(winPtr->display, w, &root, &child, &rootX, &rootY,
3996 Window w, root, child; local
|
| /ast/src/cmd/mailx/ |
| H A D | mailx.h | 397 struct child { struct
398 struct child* link;
658 struct child* children; /* Child list */
|
Completed in 52 milliseconds