Searched refs:child (Results 1 - 22 of 22) sorted by relevance

/ast/src/lib/libast/sfio/
H A Dsfpopen.c183 int stdio, parent[2], child[2];
202 parent[0] = parent[1] = child[0] = child[1] = -1;
206 if((sflags&SF_RDWR) == SF_RDWR && syspipef(child) < 0)
231 { CLOSE(child[!ckeep]);
232 SETCLOEXEC(child[ckeep]);
237 fd = (sflags&SF_RDWR) == SF_RDWR ? child[ckeep] : -1;
245 case 0 : /* in child process */
255 CLOSE(child[!ckeep]);
262 if((sflags&SF_RDWR) == SF_RDWR && pkeep == child[ckee
[all...]
/ast/src/cmd/tests/sfio/
H A Dtmprdwr.c117 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/libtk/library/demos/
H A Dclrpick.tcl49 foreach child [winfo children $w] {
50 setColor_helper $child $options $color
H A Drolodex13 foreach i [winfo child .] {
H A Dwidget16 eval destroy [winfo child .]
/ast/src/cmd/codexlib/lzh/
H A Dlzh.c85 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/library/
H A Dmenu.tcl687 foreach child [winfo child $w] {
688 switch [winfo class $child] {
690 set char2 [string index [$child cget -text] \
691 [$child cget -underline]]
694 if {[$child cget -state] != "disabled"} {
695 return $child
705 set match [tkMenuFind $child $char]
H A Dpalette.tcl150 foreach child [winfo children $w] {
151 append result ";\n[tkRecolorTree $child c]"
H A Dconsole.tcl326 eval destroy [winfo child .]
/ast/src/cmd/mailx/
H A Dproc.c574 static struct child*
577 register struct child** cpp;
582 if (*cpp || (*cpp = (struct child*)malloc(sizeof(struct child)))) {
591 delchild(register struct child* cp)
593 register struct child** cpp;
601 * Wait for a specific child to die.
606 register struct child* cp = findchild(pid);
622 register struct child* cp = findchild(pid);
H A Dmailx.h397 struct child { struct
398 struct child* link;
658 struct child* children; /* Child list */
/ast/src/cmd/mam/
H A Dmamtst.c51 for (cp = pp->child; cp; cp = cp->sibling)
/ast/src/lib/libmam/
H A Dmam.c325 if (!ppp->child) ppp->child = pp;
326 else if (!ppp->child->sibling) ppp->child->sibling = ppp->child->stail = pp;
327 else ppp->child->stail = ppp->child->stail->sibling = pp;
H A Dmam.h105 struct proc* child; /* child proc list */ member in struct:proc
/ast/src/lib/libcs/
H A Dcslocal.c40 child(int sig) function
59 if ((fun = signal(SIGCHLD, child)) == SIG_DFL) signal(SIGCHLD, fun);
/ast/src/lib/libtk/generic/
H A DtkOption.c27 * 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/tests/
H A Dnameref.sh44 foo.child=child
45 if [[ ${foo.child} != ${bar.child} ]]
46 then err_exit "foo.child=${foo.child} != bar=${bar.child}"
52 name.child=second
60 if [[ ${.foo.bar.child} != child ]]
[all...]
/ast/src/lib/libast/misc/
H A Dprocopen.c129 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/cmd/ksh93/sh/
H A Dparse.c244 static Shnode_t *makeparent(Lex_t *lp, int flag, Shnode_t *child) argument
248 par->fork.forktre = child;
H A Dsubshell.c58 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 */
/ast/src/cmd/sort/
H A Dmain.c301 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/lib/libtk/unix/
H A DtkUnixWm.c64 * 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

Completed in 606 milliseconds