Lines Matching defs:suffix
186 cpl->result.suffix = NULL;
274 * suffix const char * The appropriately quoted string that could
296 int word_start, int word_end, const char *suffix,
307 if(!suffix)
331 * new suffix.
333 len = strlen(suffix);
344 strlcpy(string + word_end - word_start, suffix, len + 1);
350 match->suffix = string + word_end - word_start;
353 * Record the continuation suffix.
415 return strcmp(m1->suffix, m2->suffix);
420 * and record a pointer to it in cpl->result.suffix. Note that this has
421 * the side effect of sorting the matches into suffix order.
433 int length; /* The length of the common suffix */
444 * Sort th matches into suffix order.
453 first = result->matches[0].suffix;
454 last = result->matches[result->nmatch - 1].suffix;
464 * How long is the common suffix?
466 length = first - result->matches[0].suffix;
468 * Allocate memory to record the common suffix.
470 result->suffix = _sg_alloc_string(cpl->sg, length);
471 if(!result->suffix) {
473 "Insufficient memory to record common completion suffix.",
478 * Record the common suffix.
480 strncpy(result->suffix, result->matches[0].suffix, length);
481 result->suffix[length] = '\0';
501 cpl->result.suffix = NULL;
581 * If there is more than one match, discard the continuation suffix.
1132 * How long are the completion and type-suffix strings?
1142 * Write the type suffix, if any.