Lines Matching defs:bettermatch
10600 int bettermatch, currcount;
10604 bettermatch = BetterMatchForName(&question->qname, namecount, &curr->domain, currcount, bestmatchlen);
10605 // Take the first best match. If there are multiple equally good matches (bettermatch = 0), we take
10607 if (bettermatch == 1)
10712 int bettermatch, currcount;
10747 bettermatch = BetterMatchForName(&question->qname, namecount, &curr->domain, currcount, bestmatchlen);
10749 // If we found a better match (bettermatch == 1) then clear all the bits
10753 if ((bettermatch == 1) || (bettermatch == 0))
10756 if (bettermatch)
10791 int bettermatch, currcount;
10836 bettermatch = BetterMatchForName(name, namecount, &curr->domain, currcount, bestmatchlen);
10838 bettermatch = 0;
10840 // If we found a better match (bettermatch == 1) then we don't need to
10844 if ((bettermatch == 1) || ((bettermatch == 0) && currPenaltyTime < bestPenaltyTime))