/* $XConsortium: WidgetNode.c,v 1.4 90/12/19 18:16:32 converse Exp $ */ /* Copyright (c) 1989 X Consortium Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of the X Consortium shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from the X Consortium. */ /* * Author: Jim Fulton, MIT X Consortium */ #include #include #include #include #include #include static char *binsearch (key, base, nelems, elemsize, compar) char *key; /* template of object to find */ char *base; /* beginning of array */ int nelems; /* number of elements in array */ int elemsize; /* sizeof an element */ int (*compar)(); /* qsort-style compare function */ { int lower = 0, upper = nelems - 1; while (lower <= upper) { int middle = (lower + upper) / 2; char *p = base + middle * elemsize; int res = (*compar) (p, key); if (res < 0) { lower = middle + 1; } else if (res == 0) { return p; } else { upper = middle - 1; } } return NULL; } static int compare_resource_entries (a, b) register char *a, *b; { return strcmp (((XtResourceList)a)->resource_name, ((XtResourceList)b)->resource_name); } static XmuWidgetNode *find_resource (node, name, cons) XmuWidgetNode *node; char *name; Bool cons; { register XmuWidgetNode *sup; XtResource res; #define reslist ((char *) (cons ? sup->constraints : sup->resources)) #define nreslist (int) (cons ? sup->nconstraints : sup->nresources) res.resource_name = name; for (sup = node->superclass; sup && (XtResourceList) binsearch ((char *) &res, reslist, nreslist, sizeof(XtResource), compare_resource_entries); node = sup, sup = sup->superclass) ; #undef reslist #undef nreslist return node; } static void mark_resource_owner (node) register XmuWidgetNode *node; { register int i; XtResourceList childres; childres = node->resources; for (i = 0; i < node->nresources; i++, childres++) { node->resourcewn[i] = find_resource (node, childres->resource_name, False); } childres = node->constraints; for (i = 0; i < node->nconstraints; i++, childres++) { node->constraintwn[i] = find_resource (node, childres->resource_name, True); } } /* * Public Interfaces */ void XmuWnInitializeNodes (nodearray, nnodes) XmuWidgetNode *nodearray; int nnodes; { int i; XmuWidgetNode *wn; /* * Assume that the node array is in alphabetic order, so we need to * search backwards to make sure that the children are listed forward. */ for (i = nnodes - 1, wn = nodearray + (nnodes - 1); i >= 0; i--, wn--) { WidgetClass superclass = XmuWnSuperclass(wn); int j; XmuWidgetNode *swn; int lablen = strlen (wn->label); int namelen = strlen (XmuWnClassname(wn)); wn->lowered_label = XtMalloc (lablen + namelen + 2); if (!wn->lowered_label) { fprintf (stderr, "%s: unable to allocate %d bytes for widget name\n", "XmuWnInitializeNodes"); exit (1); } wn->lowered_classname = wn->lowered_label + (lablen + 1); XmuCopyISOLatin1Lowered (wn->lowered_label, wn->label); XmuCopyISOLatin1Lowered (wn->lowered_classname, XmuWnClassname(wn)); wn->superclass = NULL; wn->have_resources = False; wn->resources = NULL; wn->resourcewn = NULL; wn->nresources = 0; wn->constraints = NULL; wn->constraintwn = NULL; wn->nconstraints = 0; wn->data = (XtPointer) NULL; /* * walk up the superclass chain */ while (superclass) { for (j = 0, swn = nodearray; j < nnodes; j++, swn++) { if (superclass == XmuWnClass(swn)) { wn->superclass = swn; goto done; /* stupid C language */ } } /* * Hmm, we have a hidden superclass (such as in core in R4); just * ignore it and keep on walking */ superclass = superclass->core_class.superclass; } done: if (wn->superclass) { wn->siblings = wn->superclass->children; wn->superclass->children = wn; } } return; } void XmuWnFetchResources (node, toplevel, topnode) XmuWidgetNode *node; Widget toplevel; XmuWidgetNode *topnode; { Widget dummy; XmuWidgetNode *wn; if (node->have_resources) return; dummy = XtCreateWidget (node->label, XmuWnClass(node), toplevel, NULL, ZERO); if (dummy) XtDestroyWidget (dummy); /* * walk up tree geting resources; since we've instantiated the widget, * we know that all of our superclasses have been initialized */ for (wn = node; wn && !wn->have_resources; wn = wn->superclass) { XtGetResourceList (XmuWnClass(wn), &wn->resources, &wn->nresources); if (wn->resources) { qsort ((char *) wn->resources, wn->nresources, sizeof(XtResource), compare_resource_entries); } wn->resourcewn = (XmuWidgetNode **) XtCalloc (wn->nresources, sizeof (XmuWidgetNode *)); if (!wn->resourcewn) { fprintf (stderr, "%s: unable to calloc %d %d byte widget node ptrs\n", "XmuWnFetchResources",wn->nresources, sizeof (XmuWidgetNode *)); exit (1); } XtGetConstraintResourceList (XmuWnClass(wn), &wn->constraints, &wn->nconstraints); if (wn->constraints) { qsort ((char *) wn->constraints, wn->nconstraints, sizeof(XtResource), compare_resource_entries); } wn->constraintwn = (XmuWidgetNode **) XtCalloc (wn->nconstraints, sizeof (XmuWidgetNode *)); if (!wn->constraintwn) { fprintf (stderr, "%s: unable to calloc %d %d byte widget node ptrs\n", "XmuWnFetchResources", wn->nconstraints, sizeof (XmuWidgetNode *)); exit (1); } wn->have_resources = True; if (wn == topnode) break; } /* * Walk up tree removing all resources that appear in superclass; we can * mash the resource list in place since it was copied out of widget. */ for (wn = node; wn; wn = wn->superclass) { mark_resource_owner (wn); if (wn == topnode) break; } return; } int XmuWnCountOwnedResources (node, ownernode, cons) XmuWidgetNode *node, *ownernode; Bool cons; { register int i; XmuWidgetNode **wn = (cons ? node->constraintwn : node->resourcewn); int nmatches = 0; for (i = (cons ? node->nconstraints : node->nresources); i > 0; i--, wn++) if (*wn == ownernode) nmatches++; return nmatches; } #if NeedFunctionPrototypes XmuWidgetNode *XmuWnNameToNode (XmuWidgetNode *nodelist, int nnodes, _Xconst char *name) #else XmuWidgetNode *XmuWnNameToNode (nodelist, nnodes, name) XmuWidgetNode *nodelist; int nnodes; char *name; #endif { int i; XmuWidgetNode *wn; char tmp[1024]; XmuCopyISOLatin1Lowered (tmp, name); for (i = 0, wn = nodelist; i < nnodes; i++, wn++) { if (strcmp (tmp, wn->lowered_label) == 0 || strcmp (tmp, wn->lowered_classname) == 0) return wn; } return NULL; }