Searched refs:children (Results 1 - 12 of 12) sorted by relevance

/ast/src/lib/libtk/library/
H A Dfocus.tcl32 set children [winfo children $cur]
39 if {$i < [llength $children]} {
40 set cur [lindex $children $i]
57 set children [winfo children $parent]
58 set i [lsearch -exact $children $cur]
87 set children [winfo children $cur]
88 set i [llength $children]
[all...]
H A Dpalette.tcl150 foreach child [winfo children $w] {
H A Dmenu.tcl593 set buttons [winfo children [winfo parent $w]]
/ast/src/lib/libcs/
H A Dcslocal.c37 static int children; variable
43 children++;
58 children = 0;
60 else if (children) children++;
77 while (--children > 0)
/ast/src/lib/libtk/generic/
H A DtkTextBTree.c49 * (children are lines, not nodes). */
50 union { /* First in linked list of children. */
53 } children; member in struct:Node
54 int numChildren; /* Number of children of this node. */
60 * Upper and lower bounds on how many children a node may have:
233 rootPtr->children.linePtr = linePtr;
318 while (nodePtr->children.linePtr != NULL) {
319 linePtr = nodePtr->children.linePtr;
320 nodePtr->children.linePtr = linePtr->nextPtr;
331 while (nodePtr->children
[all...]
/ast/src/lib/libast/misc/
H A Dftwalk.c57 register int children; local
73 if (children = flags & FTW_CHILDREN)
93 if (children && (e = fts_children(f, 0)))
124 if (children)
H A Dfts.c67 unsigned char children; \
987 * FTS_D or FTS_DNX, about to read children
1001 fts->nostat = fts->children > 1 || f->fts_info == FTS_DNX;
1002 fts->cpname = fts->cd && !fts->nostat || !fts->children && !fts->comparf;
1092 else if (fts->children || f->fts_info == FTS_D || f->fts_info == FTS_SL)
1123 if (fts->children)
1325 if (fts->children > 1 && i)
1343 fts->children = 0;
1491 fts->children = ((flags | fts->flags) & FTS_NOSTAT) ? 2 : 1;
/ast/src/lib/libtk/library/demos/
H A Dclrpick.tcl49 foreach child [winfo children $w] {
/ast/src/cmd/std/
H A Dps.c50 " Implied by \b--children\b, \b--parents\b, and \b--tree\b.]"
52 "[C:children?Display the process tree hierarchy, including the children"
98 "[r|R:recursive?Recursively list the children of all selected processes.]"
103 " children of all selected processes, in the \bCMD\b field list.]"
200 struct Ps_s* children; /* child list */ member in struct:Ps_s
201 struct Ps_s* lastchild; /* end of children */
213 int children; /* recursively list all children*/ member in struct:State_s
1011 * ps() a process and its children
[all...]
/ast/src/cmd/mailx/
H A Dproc.c579 for (cpp = &state.children; *cpp && (*cpp)->pid != pid;
595 for (cpp = &state.children; *cpp != cp; cpp = &(*cpp)->link) ;
H A Dmailx.h658 struct child* children; /* Child list */ member in struct:__anon136
/ast/src/lib/libtk/unix/
H A DtkUnixWm.c2066 Window vRoot, ancestor, *children, dummy2, *virtualRootPtr;
2151 &children, &dummy) == 0) {
2155 XFree((char *) children);
3277 * At each level, scan through all the children to find the highest
3666 Window *children;
3722 &children, &numChildren) != 0) {
3729 if (children[i] == window) {
3732 if (children[i] == changes.sibling) {
3762 if ((XGetWindowAttributes(winPtr->display, children[desiredIndex],
3773 XFree((char *) children);
2056 Window vRoot, ancestor, *children, dummy2, *virtualRootPtr; local
3636 Window *children; local
[all...]

Completed in 83 milliseconds