Lines Matching defs:priority

47  * priority elsewhere in the table is taken as an index into the
57  * (O is reserved for the ignore priority.)  This means sort levels
59  * priority level in fewer bits, which makes the strxfrm output
63  * figure out how many bytes to expand a numeric priority into.
77  * substitutions, and such, and records them in priority order.  As
80  * priority's value has been resolved, or whether it is still a
83  * The second pass walks over all the items in priority order, noting
86  * weights are stashed in an AVL tree sorted by relative "priority".
88  * The third pass walks over all the weight structures, in priority
101  * is known about the priority.  (For example, when new entries are created
105  * RESOLVED is used for an entry where the priority indicates the final
114  * priority dependent on <A>.)
117 	UNKNOWN,	/* priority is totally unknown */
118 	RESOLVED,	/* priority value fully resolved */
119 	REFER		/* priority is a reference (index) */
128 typedef struct priority {
139  * way to reference a priority.
181  * Substitution entries.  The key is itself a priority.  Note that
183  * fully resolved priority for the key, because creation of
184  * substitutions creates a resolved priority at the same time.
233  * Some initial priority values.
570 	/* advance the priority/weight */
711 			 * current relative priority.
942 	 * We are using the current (unique) priority as a search key
1098 	 * occurs in priority.