Lines Matching refs:suff
129 int pref, suff; /* length of prefix and suffix */
589 i > len[0] - suff ? i + len[1] - len[0]:
1975 for (suff = 0; (suff < len[0] - pref) &&
1976 (suff < len[1] - pref) &&
1977 (file[0][len[0] - suff].value ==
1978 file[1][len[1] - suff].value);
1979 suff++)
1982 /* decremnt suff by 2 iff suff >= 2, ensure that suff is never < 0 */
1983 if (suff >= 2)
1984 suff -= 2;
1988 slen[j] = len[j] - pref - suff;