Cross Reference: /xsrc/external/mit/libX11/dist/src/Xrm.c

Lines Matching defs:tight
106 Within an LTable, for a given name, the tight value always precedes the
108 the tight value.
111 in the order tight NTable, loose NTable, tight LTable, loose LTable.
131     unsigned int	tight:1;	/* 1 if it is a tight binding */
152     unsigned int	tight:1;	/* 1 if it is a tight binding */
634 		if (!fentry->tight && tentry->tight) {
638 		if (fentry->tight != tentry->tight) {
718 		    (!fentry->tight && tentry->tight &&
725 		    fentry->tight != tentry->tight) {
864 	table->tight = 1; /* arbitrary */
893 		if (!table->tight)
896 		if (table->tight) {
915 	    /* if want loose and have tight, bump to next entry */
916 	    if (entry && *bindings == XrmBindLoosely && entry->tight)
919 		(*bindings == XrmBindTightly) == entry->tight) {
948 	    table->tight = 1;
950 	    table->tight = 0;
964 	entry->tight = 1;
966 	entry->tight = 0;
1290 		 * will be loose, otherwise it will be tight.
1715     closure->bindings[level] = (table->table.tight ?
1725 	    if (entry->tight && !tightOk)
1727 	    closure->bindings[level] = (entry->tight ?
1767 		closure->bindings[level] = (entry->tight ?
1799 /* find entries named ename, leafness leaf, tight or loose, and call get */
1804 	    if (!leaf && !entry->tight && entry->next && \
1805 		entry->next->name == q && entry->next->tight && \
1812 	    if (entry->tight && (entry = entry->next) && \
1820 	    if (entry->tight && (entry = entry->next) && \
1830     if (entry && entry->tight && (entry = entry->next) && entry->name != q) \
1844     closure->bindings[level] = (table->tight ?
1871 		    if (!entry->tight && entry->name != q &&
1888 	ITIGHTLOOSE(*names);   /* do name, tight and loose */
1889 	ITIGHTLOOSE(*classes); /* do class, tight and loose */
1891 	    ITIGHTLOOSE(XrmQANY); /* do ANY, tight and loose */
1918 	if (entry->tight && !table->tight)
1922 	if (!entry || !entry->tight)
1932     if (entry->tight && entry == table->next && (entry = entry->next) &&
2089 /* find entries named ename, leafness leaf, tight or loose, and call get */
2094 	    if (!leaf && !entry->tight && entry->next && \
2095 		entry->next->name == q && entry->next->tight && \
2101 	    if (entry->tight && (entry = entry->next) && \
2109 	    if (entry->tight && (entry = entry->next) && \
2119     if (entry && entry->tight && (entry = entry->next) && entry->name != q) \
2131 /* add tight/loose entry to the search list, return True if list is full */
2194     GTIGHTLOOSE(*names, AppendLooseLEntry);   /* do name, tight and loose */
2195     GTIGHTLOOSE(*classes, AppendLooseLEntry); /* do class, tight and loose */
2197 	GTIGHTLOOSE(XrmQANY, AppendLooseLEntry); /* do ANY, tight and loose */
2221 	if (entry->tight && !table->tight)
2225 	if (!entry || !entry->tight)
2234     if (entry->tight && entry == table->next && (entry = entry->next) &&
2297 /* find tight or loose entry */
2311 	if (!entry->tight) \
2331 		VTIGHTLOOSE(name);  /* do name, tight and loose */
2332 		VTIGHTLOOSE(class); /* do class, tight and loose */
2345 		VTIGHTLOOSE(name); /* tight and loose */
2373 /* look for a tight/loose value */
2423     if (entry && entry->tight && (entry = entry->next) && entry->name != q) \
2474     GTIGHTLOOSE(*names, GetLooseVEntry);   /* do name, tight and loose */
2475     GTIGHTLOOSE(*classes, GetLooseVEntry); /* do class, tight and loose */
2477 	GTIGHTLOOSE(XrmQANY, GetLooseVEntry); /* do ANY, tight and loose */
2502 	if (table->tight && !otable->tight)
2506 	if (!table || !table->tight)
2515     if (table->tight && table == otable->next) {