Lines Matching refs:words
75 whitespace-delimited words. */
96 /* When matching by words, the empty string should match
114 /* If we're substituting only by fully matched words,
115 or only at the ends of words, check that this case qualifies. */
425 If the two arguments have a different number of words,
426 the excess words are just output separated by blanks. */
683 char *words = argv[0]; /* Use a temp variable for find_next_token */
684 char *p = find_next_token (&words, &i);
696 char *words = argv[0]; /* Use a temp variable for find_next_token */
700 while ((t = find_next_token (&words, &i)))
941 int words = 0;
946 /* Chop ARGV[0] up into patterns to match against the words. */
969 /* Chop ARGV[1] up into words to match against the patterns. */
987 words++;
992 hashing = (literals >= 2 && (literals * words) >= 10);
995 hash_init (&a_word_table, words, a_word_hash_1, a_word_hash_2, a_word_hash_cmp);
1004 if (words)
1008 /* Run each pattern through the words, killing words. */
1032 /* Output the words that matched (or didn't, for filter-out). */
1135 chop argv[0] into words, and sort them.
1140 char **words = 0;
1144 /* Chop ARGV[0] into words and put them in WORDS. */
1155 words = (char **) xrealloc ((char *) words,
1158 words[wordi++] = savestring (p, len);
1164 /* Now sort the list of words. */
1165 qsort ((char *) words, wordi, sizeof (char *), alpha_compare);
1170 len = strlen (words[i]);
1171 if (i == wordi - 1 || strlen (words[i + 1]) != len
1172 || strcmp (words[i], words[i + 1]))
1174 o = variable_buffer_output (o, words[i], len);
1177 free (words[i]);
1182 free (words);
2080 { STRING_SIZE_TUPLE("words"), 0, 1, 1, func_words},
