| /xsrc/external/mit/libXt/dist/src/ |
| SetSens.c | 93 children's ancestor_sensitive; else do nothing as children's
98 WidgetList children; local
100 children = ((CompositeWidget) widget)->composite.children;
102 SetAncestorSensitive(children[i], ancestor_sensitive);
124 children's ancestor_sensitive; else do nothing as children's
129 WidgetList children; local
131 children = ((CompositeWidget) widget)->composite.children
[all...] |
| Composite.c | 79 XtOffsetOf(CompositeRec, composite.children), XtRImmediate, NULL},
227 XtFree((char *) cw->composite.children);
236 register WidgetList children; local
239 children = cw->composite.children;
249 cw->composite.children = children =
250 XtReallocArray(children, cw->composite.num_slots,
253 /* Ripple children up one space from "position" */
255 children[i] = children[i - 1]
[all...] |
| ResConfig.c | 283 * all children if applicable. (eg. App*Form.background must apply
284 * background to all children of the Form widget)
308 Widget *children; local
311 * Recursively search through the children
313 num_children = _locate_children(w, &children);
318 if (XtIsWidget(children[i]) && XtIsWidget(w))
320 children[i]->core.name, w->core.name);
324 if (!XtIsWidget(children[i]))
325 fprintf(stderr, "children[%d] is NOT a widget\n", i);
330 _set_resource_values(children[i], resource, value, last_part)
368 Widget *children; local
823 Widget *children; local
[all...] |
| Manage.c | 82 UnmanageChildren(WidgetList children,
111 child = children[i];
122 "Not all children have same parent in UnmanageChildren",
163 XtUnmanageChildren(WidgetList children, Cardinal num_children)
174 if (children[0] == NULL) {
181 app = XtWidgetToApplicationContext(children[0]);
184 parent = children[0]->core.parent;
189 UnmanageChildren(children, num_children, parent, &ii,
191 hookobj = XtHooksOfDisplay(XtDisplayOfObject(children[0]));
197 call_data.event_data = (XtPointer) children;
[all...] |
| /xsrc/external/mit/libX11/dist/src/ |
| QuTree.c | 38 Window **children, /* RETURN */
53 *children = (Window *) NULL;
55 *children = Xmallocarray(rep.nChildren, sizeof(Window));
56 if (! *children) {
63 _XRead32 (dpy, (long *) *children, nbytes);
|
| /xsrc/external/mit/xorg-server/dist/test/ |
| list.c | 41 struct xorg_list children; member in struct:parent
62 xorg_list_init(&parent.children);
68 assert(xorg_list_is_empty(&parent.children));
78 xorg_list_init(&parent.children);
80 xorg_list_add(&child[0].node, &parent.children);
81 assert(!xorg_list_is_empty(&parent.children));
83 c = xorg_list_first_entry(&parent.children, struct child, node);
88 xorg_list_add(&child[1].node, &parent.children);
89 c = xorg_list_first_entry(&parent.children, struct child, node);
93 xorg_list_add(&child[2].node, &parent.children);
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/ |
| optimize.c | 102 cond->children[0] = prev_branch->cond;
104 gpir_node_add_dep(&cond->node, cond->children[0], GPIR_DEP_INPUT);
127 if (alu->children[0]->op == gpir_op_not) {
129 gpir_alu_node *child = gpir_node_to_alu(alu->children[0]);
130 replace = child->children[0];
131 } else if (alu->children[0]->op == gpir_op_ge ||
132 alu->children[0]->op == gpir_op_lt) {
136 gpir_alu_node *child = gpir_node_to_alu(alu->children[0]);
137 gpir_op op = alu->children[0]->op == gpir_op_ge ?
140 new->children[0] = child->children[0]
[all...] |
| lower.c | 127 gpir_node *child = neg->children[0];
152 if (alu->children[i] == node) {
155 alu->children[i] = child;
175 gpir_node *child = alu->children[0];
182 preexp2->children[0] = child;
194 complex2->children[0] = child;
221 impl->children[0] = child;
227 complex1->children[0] = &impl->node;
228 complex1->children[1] = &complex2->node;
229 complex1->children[2] = child
[all...] |
| codegen.c | 100 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
101 code->mul0_src1 = gpir_get_alu_input(node, alu->children[1]);
119 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
124 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
125 code->mul0_src1 = gpir_get_alu_input(node, alu->children[1]);
130 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
136 code->mul0_src0 = gpir_get_alu_input(node, alu->children[2]);
137 code->mul0_src1 = gpir_get_alu_input(node, alu->children[0]);
160 code->mul1_src0 = gpir_get_alu_input(node, alu->children[0]);
161 code->mul1_src1 = gpir_get_alu_input(node, alu->children[1])
[all...] |
| /xsrc/external/mit/libXmu/dist/src/ |
| ClientWin.c | 71 Window *children; local
80 if (!XQueryTree(dpy, win, &root, &parent, &children, &nchildren))
84 XGetWindowProperty(dpy, children[i], WM_STATE, 0, 0, False,
90 inf = children[i];
93 inf = TryChildren(dpy, children[i], WM_STATE);
94 if (children)
95 XFree(children);
|
| /xsrc/external/mit/freetype/dist/src/tools/ |
| glnames.py | 5020 # which creates a large trie where each node has only one children.
5040 # - The letter is followed by a children count and the value of the
5044 # 127 children.
5049 # num_children 7 Number of children. Can be 0 only if
5054 # children, which must be sorted in increasing order of their first
5065 self.children = {}
5078 if self.children.has_key( letter ):
5079 child = self.children[letter]
5082 self.children[letter] = child
5087 # optimize all children firs
[all...] |
| /xsrc/external/mit/xdm/dist/xdm/ |
| reset.c | 61 Window root, parent, *children; local
65 while (XQueryTree (dpy, window, &root, &parent, &children, &nchildren)
69 Debug ("XKillClient 0x%lx\n", (unsigned long)children[child]);
70 XKillClient (dpy, children[child]);
72 XFree ((char *)children);
|
| /xsrc/external/mit/transset/dist/ |
| clientwin.c | 70 * Children are searched in top-down stacking order.
77 Window *children; local
81 if (!XQueryTree(dpy, win, &root, &parent, &children, &n_children))
83 if (!children)
89 if (!Window_Is_Viewable(dpy, children[i])) {
90 children[i] = None; /* Don't bother descending into this one */
93 if (!Window_Has_Property(dpy, children[i], atom_wm_state))
97 win = children[i];
101 /* No children matched, now descend into each child */
103 if (children[i] == None
[all...] |
| dsimple.c | 261 Window *children, dummy; local
269 if (!XQueryTree (disp, top, &dummy, &dummy, &children, &nchildren))
273 w = Window_With_Name (disp, children[i], name);
277 if (children)
278 XFree (children);
293 Window *children, dummy; local
302 if (!XQueryTree (disp, top, &dummy, &dummy, &children, &nchildren))
306 w = Window_With_Name_Regex_Recurse (disp, children[i], reg_name);
310 if (children)
311 XFree (children);
[all...] |
| /xsrc/external/mit/xprop/dist/ |
| clientwin.c | 70 * Children are searched in top-down stacking order.
77 Window *children; local
81 if (!XQueryTree(dpy, win, &root, &parent, &children, &n_children))
83 if (!children)
89 if (!Window_Is_Viewable(dpy, children[i])) {
90 children[i] = None; /* Don't bother descending into this one */
93 if (!Window_Has_Property(dpy, children[i], atom_wm_state))
97 win = children[i];
101 /* No children matched, now descend into each child */
103 if (children[i] == None
[all...] |
| /xsrc/external/mit/xwd/dist/ |
| clientwin.c | 70 * Children are searched in top-down stacking order.
77 Window *children; local
81 if (!XQueryTree(dpy, win, &root, &parent, &children, &n_children))
83 if (!children)
89 if (!Window_Is_Viewable(dpy, children[i])) {
90 children[i] = None; /* Don't bother descending into this one */
93 if (!Window_Has_Property(dpy, children[i], atom_wm_state))
97 win = children[i];
101 /* No children matched, now descend into each child */
103 if (children[i] == None
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/gp/ |
| lower.c | 39 alu->children[0] = child;
40 alu->children[1] = child2;
66 alu->children[0] = w;
227 gpir_node *child = neg->children[0];
252 if (alu->children[i] == node) {
255 alu->children[i] = child;
275 gpir_node *child = alu->children[0];
281 complex2->children[0] = child;
302 impl->children[0] = child;
309 alu->children[0] = &impl->node
[all...] |
| codegen.c | 98 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
99 code->mul0_src1 = gpir_get_alu_input(node, alu->children[1]);
116 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
121 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
122 code->mul0_src1 = gpir_get_alu_input(node, alu->children[1]);
127 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]);
133 code->mul0_src0 = gpir_get_alu_input(node, alu->children[2]);
134 code->mul0_src1 = gpir_get_alu_input(node, alu->children[0]);
157 code->mul1_src0 = gpir_get_alu_input(node, alu->children[0]);
158 code->mul1_src1 = gpir_get_alu_input(node, alu->children[1])
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/amd/vulkan/ |
| radv_acceleration_structure.h | 92 uint32_t children[4]; member in struct:radv_bvh_box16_node
97 uint32_t children[4]; member in struct:radv_bvh_box32_node
|
| /xsrc/external/mit/xwininfo/dist/ |
| clientwin.c | 83 * Children are searched in top-down stacking order.
91 xcb_window_t *children; local
104 children = xcb_query_tree_children (tree);
109 if (!Window_Is_Viewable(dpy, children[i])) {
111 children[i] = XCB_WINDOW_NONE;
114 if (!Window_Has_Property(dpy, children[i], atom_wm_state))
118 win = children[i];
122 /* No children matched, now descend into each child */
124 if (children[i] == XCB_WINDOW_NONE)
126 win = Find_Client_In_Children(dpy, children[i])
[all...] |
| /xsrc/external/mit/x11perf/dist/ |
| do_movewin.c | 26 static Window *children; variable
45 children = malloc(p->objects * sizeof (Window));
54 children[i] = XCreateSimpleWindow(xp->d, xp->w,
74 XMoveWindow(xp->d, children[j],
84 free(children);
98 XResizeWindow(xp->d, children[j],
108 children = malloc (p->objects * sizeof (Window));
112 children[i] = XCreateSimpleWindow (xp->d, xp->w,
135 free(children);
148 children = malloc(p->objects * sizeof (Window))
[all...] |
| /xsrc/external/mit/MesaGLUT/dist/src/glut/beos/ |
| glutGet.cpp | 70 GlutWindow *children = gState.currentWindow->children; local
71 while (children) {
73 children = children->siblings;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/swr/rasterizer/common/ |
| rdtsc_buckets.h | 135 if (bt.pCurrent->children.size() < mBuckets.size())
137 bt.pCurrent->children.resize(mBuckets.size());
139 BUCKET& child = bt.pCurrent->children[id];
191 if (bt.pCurrent->children.size() < mBuckets.size())
193 bt.pCurrent->children.resize(mBuckets.size());
195 BUCKET& child = bt.pCurrent->children[id];
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/rasterizer/common/ |
| rdtsc_buckets.h | 125 if (bt.pCurrent->children.size() < mBuckets.size())
127 bt.pCurrent->children.resize(mBuckets.size());
129 BUCKET& child = bt.pCurrent->children[id];
181 if (bt.pCurrent->children.size() < mBuckets.size())
183 bt.pCurrent->children.resize(mBuckets.size());
185 BUCKET& child = bt.pCurrent->children[id];
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| sparse_array.c | 78 uintptr_t *children = _util_sparse_array_node_data(node); local
81 if (children[i])
82 _util_sparse_array_node_finish(arr, children[i]);
177 uintptr_t *children = node_data; local
178 uintptr_t child = p_atomic_read(&children[child_idx]);
182 child = _util_sparse_array_set_or_free_node(&children[child_idx],
201 uintptr_t *children = _util_sparse_array_node_data(node); local
204 if (children[i])
205 validate_node_level(arr, children[i], level - 1);
|
