Lines Matching full:prefix_len
228 int prefix_len;
236 (prefix_len = x_longest_prefix(nwords, words)) > 0) {
241 prefix_len = x_basename(words[0], NULL);
244 if (x_basename(words[i] + prefix_len, NULL) >
245 prefix_len)
249 while (prefix_len > 0 && words[0][prefix_len - 1] != '/')
250 prefix_len--;
254 XPput(l, words[i] + prefix_len);
679 size_t j, prefix_len;
685 prefix_len = strlen(words[0]);
687 for (j = 0, p = words[i]; j < prefix_len; j++)
689 prefix_len = j;
692 /* false for nwords==1 as 0 = words[0][prefix_len] then */
693 if (UTFMODE && prefix_len && (words[0][prefix_len] & 0xC0) == 0x80)
694 while (prefix_len && (words[0][prefix_len] & 0xC0) != 0xC0)
695 --prefix_len;
696 return (prefix_len);
