Lines Matching defs:pass
84 * e) For the UNDEFINED pass (the last pass), we record the maximum
86 * the last pass can also use smaller strxfrm output when possible.
95 * The first pass, which is done at parse time, identifies elements,
102 * The second pass walks over all the items in priority order, noting
107 * The third pass walks over all the weight structures, in priority
112 * The fourth pass just writes the data out.
131 * The "pass" field is used during final resolution to aid in detection
150 int pass;
283 prilist[i].pass = 0;
330 static int32_t pass = 0;
333 pass++;
335 if (pri->pass == pass) {
345 pri->pass = pass;
1026 add_weight(int32_t ref, int pass)
1041 if (RB_FIND(weights, &weights[pass], &srch) != NULL)
1049 RB_INSERT(weights, &weights[pass], w);
1062 get_weight(int32_t ref, int pass)
1076 if ((w = RB_FIND(weights, &weights[pass], &srch)) == NULL) {
1130 * We have to run through a preliminary pass to identify all the