| /src/sys/arch/hpc/hpc/ |
| platid_copyright.awk | 37 words = ""
41 words=sprintf("%s%s\n", words, $0)
48 printf("%s", words)
51 words = ""
|
| /src/usr.bin/make/ |
| str.c | 107 * Fracture a string into an array of words (as delineated by tabs or spaces)
117 * Returns the fractured words, which must be freed later using Words_Free,
118 * unless the returned Words.words was NULL.
126 Substring *words; local in function:Substring_Words
136 /* words_buf holds the words, separated by '\0'. */
141 words = bmake_malloc((words_cap + 1) * sizeof(words[0]));
191 * end of a token -- make sure there's enough words
200 words = bmake_realloc(words
279 Words words; local in function:Str_Words
[all...] |
| /src/sys/lib/libsa/ |
| byteorder.c | 52 uint32_t words[2]; member in union:__anonc92d9a1c030a
162 un.words[BE64_HI] = sa_htobe32(val >> 32);
163 un.words[BE64_LO] = sa_htobe32(val & 0xffffffffU);
173 un.words[LE64_HI] = sa_htole32(val >> 32);
174 un.words[LE64_LO] = sa_htole32(val & 0xffffffffU);
186 un.words[BE64_HI] = sa_be32toh(un.words[BE64_HI]);
187 un.words[BE64_LO] = sa_be32toh(un.words[BE64_LO]);
189 rv = (((uint64_t)un.words[BE64_HI]) << 32)
[all...] |
| /src/share/dict/ |
| Makefile | 4 # Missing: connectives, words
10 LINKS= ${FILESDIR}/web2 ${FILESDIR}/words
|
| /src/sys/fs/efs/ |
| efs_extent.h | 42 uint32_t words[2]; member in union:efs_dextent::__anon0ee8471b010a
46 #define ex_words ex_muddle.words
|
| /src/usr.bin/ftp/ |
| complete.c | 70 * Otherwise, list choices. words is assumed to be filtered
75 * words stringlist containing possible matches
79 complete_ambiguous(char *word, int list, StringList *words)
87 if (words->sl_cur == 0)
90 if (words->sl_cur == 1) { /* only once choice available */
91 p = words->sl_str[0] + wordlen;
102 lastmatch = words->sl_str[0];
104 for (i = 1 ; i < words->sl_cur ; i++) {
105 for (j = wordlen; j < strlen(words->sl_str[i]); j++)
106 if (lastmatch[j] != words->sl_str[i][j]
134 StringList *words; local in function:complete_command
163 StringList *words; local in function:complete_local
246 StringList *words; local in function:complete_option
277 StringList *words; local in function:complete_remote
[all...] |
| /src/usr.bin/make/unit-tests/ |
| varmod-unique.mk | 4 # words.
7 . warning The modifier ':u' only merges _adjacent_ duplicate words.
11 . warning The modifier ':u' must merge adjacent duplicate words.
31 . warning The modifier ':u' must merge _all_ adjacent duplicate words.
35 . warning The modifier ':u' must normalize whitespace between the words.
39 . warning Duplicate words at the beginning must be merged.
43 . warning Duplicate words at the end must be merged.
|
| varmod-order-string.mk | 3 # Tests for the :O variable modifier, which returns the words, sorted in
6 # Simple words are sorted lexicographically.
7 WORDS= one two three four five six seven eight nine ten
8 .if ${WORDS:O} != "eight five four nine one seven six ten three two"
9 . error ${WORDS:O}
12 # Double quotes and single quotes delimit words, while backticks are just
21 # To sort the words numerically, use ':On' instead; since var.c 1.939 from
|
| varmod-to-many-words.mk | 1 # $NetBSD: varmod-to-many-words.mk,v 1.3 2020/12/20 23:29:50 rillig Exp $
3 # Tests for the :tw modifier, which treats the variable as many words,
|
| varmod-to-upper.mk | 3 # Tests for the :tu variable modifier, which returns the words in the
19 # not as a list of words. Therefore, the adjacent spaces are preserved.
|
| /src/distrib/sets/ |
| join.awk | 31 # Similar to join(1), this reads a list of words from F1
85 words[f1] = $0
92 f1 in words \
95 print words[f1] $0
|
| /src/games/battlestar/ |
| parse.c | 108 if ((wp = lookup(words[n])) == NULL) {
123 strlcpy(words[i - 1], words[i], WORDLEN);
129 if (wordvalue[n] == AND && words[n][0] == ','
143 strlcpy(words[i - 1], words[i], WORDLEN);
166 strcpy(tmpword, words[n - 1]);
167 strlcpy(words[n - 1], words[n + 1], WORDLEN);
168 strcpy(words[n + 1], tmpword)
[all...] |
| /src/sys/dev/ |
| dev_verbose.c | 40 dev_untokenstring(const char *words, const uint32_t *token, char *buf,
48 newlen = strlcat(buf, words + *token, len - 2);
60 dev_findvendor(char *buf, size_t len, const char *words, size_t nwords,
68 return dev_untokenstring(words, &vendors[n + 1],
81 dev_findproduct(char *buf, size_t len, const char *words, size_t nwords,
89 return dev_untokenstring(words, &products[n + 2],
|
| devlist2h.awk | 141 if (words[$f, 1] == 0) {
146 words[$f, 1] = nwords;
147 words[$f, 2] = l;
152 wordlist[words[$f, 1], 2]++;
153 vendors[nvendors, i] = words[$f, 1];
203 if (words[$f, 1] == 0) {
208 words[$f, 2] = l;
209 words[$f, 1] = nwords;
214 productlen += words[$f, 2] + 1;
215 wordlist[words[$f, 1], 2]++
[all...] |
| /src/lib/libm/src/ |
| s_nan.c | 65 _scan_nan(uint32_t *words, int num_words, const char *s)
68 int bitpos; /* index into words (in bits) */
70 memset(words, 0, num_words * sizeof(*words));
80 /* Scan backwards, filling in the bits in words[] as we go. */
88 words[bitpos / 32] |= digittoint(s[si]) << (bitpos % 32);
|
| /src/usr.sbin/gspa/gspa/ |
| gsp_pseu.c | 50 u_int16_t words[2]; local in function:pseudo
95 words[0] = val;
97 words[1] = val >> 16;
98 putcode(words, 2);
102 putcode(words, 1);
|
| /src/usr.bin/mail/ |
| complete.c | 88 * List words in stringlist, vertically arranged
239 * Otherwise, list choices. words is assumed to be filtered
244 * words stringlist containing possible matches
248 complete_ambiguous(EditLine *el, char *word, int dolist, StringList *words)
255 if (words->sl_cur == 0)
258 if (words->sl_cur == 1) { /* only once choice available */
259 p = words->sl_str[0] + wordlen;
271 lastmatch = words->sl_str[0];
273 for (i = 1; i < words->sl_cur; i++) {
274 for (j = wordlen; j < strlen(words->sl_str[i]); j++
304 StringList *words; local in function:complete_command
333 StringList *words; local in function:complete_filename
496 StringList *words; local in function:complete_executable
555 StringList *words; local in function:complete_set
594 StringList *words; local in function:complete_alias
640 StringList *words; local in function:complete_smopts
701 StringList *words; local in function:complete_thread_key
1029 StringList *words; local in function:mime_enc_complete
[all...] |
| /src/bin/ksh/ |
| edit.c | 454 x_print_expansions(nwords, words, is_command)
456 char *const *words;
469 && (prefix_len = x_longest_prefix(nwords, words)) > 0)
475 prefix_len = x_basename(words[0], (char *) 0);
478 if (x_basename(words[i] + prefix_len, (char *) 0)
484 && !ISDIRSEP(words[0][prefix_len - 1]))
489 XPput(l, words[i] + prefix_len);
499 pr_list(use_copy ? (char **) XPptrv(l) : words);
520 char **words; local in function:x_file_glob
545 * Convert "foo*" (toglob) to an array of strings (words)
665 char **words = (char **) XPptrv(w); local in function:x_command_glob
690 char **words = (char **) XPptrv(w); local in function:x_command_glob
785 char **words; local in function:x_cf_glob
960 char **words; local in function:glob_path
[all...] |
| edit.h | 56 void x_print_expansions ARGS((int nwords, char *const *words, int is_command));
59 int x_longest_prefix ARGS((int nwords, char *const *words));
61 void x_free_words ARGS((int nwords, char **words));
|
| /src/lib/libc/arch/x86_64/string/ |
| swab.S | 22 testq $7,%rdx # copy first group of 1 to 7 words
31 L2: shrq $3,%rdx # copy remainder 8 words at a time
|
| /src/lib/libc/inet/ |
| inet_net_ntop.c | 181 size_t words; local in function:inet_net_ntop_ipv6
208 /* how many words need to be displayed in output */
209 words = (bits + 15) / 16;
210 if (words == 1)
211 words = 2;
215 for (i = 0; i < (words * 2); i += 2) {
234 if (zero_l != words && zero_s == 0 && ((zero_l == 6) ||
239 /* Format whole words. */
240 for (p = 0; p < words; p++) {
245 if (p == words - 1
[all...] |
| inet_ntop.c | 136 u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; local in function:inet_ntop6
148 memset(words, '\0', sizeof words);
150 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
156 if (words[i] == 0) {
198 (best.len == 7 && words[7] != 0x0001) ||
199 (best.len == 5 && words[5] == 0xffff))) {
205 advance = snprintf(tp, (size_t)(ep - tp), "%x", words[i]);
|
| /src/common/dist/zlib/ |
| crc32.c | 35 A CRC of a message is computed on N braids of words in the message, where
38 indices in the array of words: 0, 3, 6, ..., 1, 4, 7, ..., and 2, 5, 8, ...
573 #define Z_BATCH 3990 /* number of words in a batch */
575 #define Z_BATCH_MIN 800 /* fewest words in a final batch */
603 /* Prepare to compute the CRC on full 64-bit words word[0..num-1]. */
609 instruction per cycle. Each CRC is calculated on Z_BATCH words. The
628 /* Do one last smaller batch with the remaining words, if there are enough
650 /* Compute the CRC on any remaining words. */
713 z_word_t const *words; local in function:crc32_z
726 words = (z_word_t const *)buf
[all...] |
| /src/usr.bin/vndcompress/ |
| Makefile | 18 head -c 512 < /usr/share/dict/words > ${.TARGET}.tmp \
25 head -c 5120 < /usr/share/dict/words > ${.TARGET}.tmp \
32 head -c 12345 < /usr/share/dict/words > ${.TARGET}.tmp \
40 head -c 54321 < /usr/share/dict/words \
46 head -c 65536 < /usr/share/dict/words > ${.TARGET}.tmp \
51 head -c 655360 < /usr/share/dict/words > ${.TARGET}.tmp \
58 head -c $$((65536 + 512)) < /usr/share/dict/words > ${.TARGET}.tmp \
65 head -c 123456 < /usr/share/dict/words > ${.TARGET}.tmp \
71 head -c 512 < /usr/share/dict/words > ${.TARGET}.tmp \
77 head -c 5120 < /usr/share/dict/words > ${.TARGET}.tmp
[all...] |
| /src/lib/libc/arch/m68k/string/ |
| swab.S | 9 lsrl #1,%d0 | count is in bytes; we need words
|
