Searched refs:lendiff (Results 1 – 2 of 2) sorted by relevance
1898 int slen=0, k=0, j=0, lendiff=0; in remove_overlapping_subtrees() local1905 lendiff = strlen(listin[k]) - strlen(listin[j]); in remove_overlapping_subtrees()1907 if ((lendiff > 0) && (strcasecmp((listin[k])+lendiff, listin[j])==0)) { in remove_overlapping_subtrees()1919 } else if ((lendiff < 0) && (strcasecmp((listin[j])+abs(lendiff), listin[k])==0)) { in remove_overlapping_subtrees()1932 if ((lendiff == 0) && (strcasecmp(listin[j], listin[k])==0)) { in remove_overlapping_subtrees()
860 int i, lendiff; in big_sub_pos_high() local863 lendiff = aa->len - bb->len; in big_sub_pos_high()864 res1.size = result->size - lendiff; in big_sub_pos_high()866 res1.value = result->value + lendiff; in big_sub_pos_high()867 aa1.size = aa->size - lendiff; in big_sub_pos_high()868 aa1.value = aa->value + lendiff; in big_sub_pos_high()873 for (i = 0; i < lendiff; i++) { in big_sub_pos_high()889 int lendiff; in big_cmp_abs_high() local892 lendiff = aa->len - bb->len; in big_cmp_abs_high()894 aa1.size = aa->size - lendiff; in big_cmp_abs_high()[all …]