Lines Matching defs:pass

65  * e) For the UNDEFINED pass (the last pass), we record the maximum
67  * the last pass can also use smaller strxfrm output when possible.
76  * The first pass, which is done at parse time, identifies elements,
83  * The second pass walks over all the items in priority order, noting
88  * The third pass walks over all the weight structures, in priority
93  * The fourth pass just writes the data out.
112  * The "pass" field is used during final resolution to aid in detection
131 	int		pass;
261 			prilist[i].pass = 0;
308 	static int32_t	pass = 0;
311 	pass++;
313 		if (pri->pass == pass) {
323 		pri->pass = pass;
997 add_weight(int32_t ref, int pass)
1013 	if (avl_find(&weights[pass], &srch, &where) != NULL)
1021 	avl_insert(&weights[pass], w, where);
1034 get_weight(int32_t ref, int pass)
1048 	if ((w = avl_find(&weights[pass], &srch, NULL)) == NULL) {
1072 	 * We have to run throught a preliminary pass to identify all the