| /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/lib/libc/inet/ |
| 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]);
|
| inet_cidr_ntop.c | 178 u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; local in function:inet_cidr_ntop_ipv6
191 memset(words, '\0', sizeof words);
193 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
199 if (words[i] == 0) {
236 (best.len == 7 && words[7] != 0x0001) ||
237 (best.len == 5 && words[5] == 0xffff))) {
254 tp += SPRINTF((tp, "%x", words[i]));
|
| 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_net_pton.c | 280 int words; local in function:inet_net_pton_ipv6
347 words = (bits + 15) / 16;
348 if (words < 2)
349 words = 2;
351 words = 8;
352 endp = tmp + 2 * words;
|
| /src/sys/netinet6/ |
| in6_cksum.c | 50 uint16_t words[16]; member in union:in6_cksum::__anonf1628337010a
98 w = u.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/make/unit-tests/ |
| modmisc.mk | 20 all: mod-break-many-words
49 # modifiers, but not by the :@ modifier since it explicitly skips empty words.
60 mod-break-many-words:
|
| moderrs.mk | 17 all: words-{1,2,3}
68 words-1:
71 words-2:
75 words-3:
|
| /src/common/lib/libc/string/ |
| memset2.c | 146 * (since there are no full words to fill). Then we
169 * Simply fill memory one word at time (for as many full words we have
176 * We didn't subtract out the full words we just filled since we know
177 * by the time we get here we will have less than a words worth to
239 memword_t words[4]; member in union:__anonc9960ea8010a
|
| /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/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/ |
| 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...] |
| str.h | 59 /* The result of splitting a string into words. */
60 typedef struct Words {
61 char **words; member in struct:Words
64 } Words;
66 /* The result of splitting a string into words. */
68 Substring *words; member in struct:SubstringWords
302 Words Str_Words(const char *, bool);
305 Words_Free(Words w)
307 free(w.words);
317 w->words = NULL
[all...] |
| compat.c | 340 Words words = Str_Words(cmd, false); local in function:Compat_RunCommand
341 mav = words.words;
342 bp = words.freeIt;
|
| /src/games/battlestar/ |
| globals.c | 261 char words[NWORD][WORDLEN]; variable in typeref:typename:char[][]
|
| /src/sbin/cgdconfig/ |
| utils.c | 66 * this function returns a dynamically sized char ** of the words
71 words(const char *line, int *num) function in typeref:typename:char **
|
| /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/sys/external/bsd/drm2/dist/include/uapi/drm/ |
| tegra_drm.h | 308 * @words:
310 * Number of 32-bit words in this command buffer.
312 __u32 words; member in struct:drm_tegra_cmdbuf
|
| /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...] |
| emacs.c | 1735 char **words; local in function:x_expand
1743 &start, &end, &words, &is_command);
1753 if (x_escape(words[i], strlen(words[i]), x_emacs_putbuf) < 0 ||
1771 char **words; local in function:do_complete
1778 &start, &end, &words, &is_command);
1786 x_print_expansions(nwords, words, is_command);
1788 x_free_words(nwords, words);
1793 nlen = x_longest_prefix(nwords, words);
1798 x_escape(words[0], nlen, x_emacs_putbuf)
[all...] |
| vi.c | 1946 char **words; local in function:expand_word
1963 &start, &end, &words, (int *) 0);
1974 if (x_escape(words[i], strlen(words[i]), x_vi_putbuf) != 0) {
2002 char **words; local in function:complete_word
2030 &start, &end, &words, &is_command);
2041 x_print_expansions(nwords, words, is_command);
2042 x_free_words(nwords, words);
2050 match = words[count]
2051 + x_basename(words[count], (char *) 0)
2109 char **words; local in function:print_expansions
[all...] |
| /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/sys/arch/sparc/dev/ |
| cgfourteen.c | 730 /* Copy by words */
1286 int line, cnt, pre, words; local in function:cg14_rectfill
1310 words = uimin(32, cnt >> 2);
1311 sxm(SX_STS, pptr, 8, words - 1);
1312 pptr += words << 2;
1313 cnt -= words << 2;
1349 int line, cnt, pre, words, pwrds = 0, post, reg; local in function:cg14_invert
1369 words = (wi + pre + 3) >> 2;
1370 cnt = words - pwrds;
1375 sxm(SX_LD, pptr, 8, words - 1)
1431 int num, words, skip; local in function:cg14_bitblt
[all...] |
| /src/sys/dev/marvell/ |
| mvxpsec.c | 3558 uint32_t *words; local in function:mvxpsec_dump_packet_desc
3563 words = &mv_p->pkt_header.desc.acc_desc_dword0;
3564 mvxpsec_dump_acc_config(name, words[0]);
3565 mvxpsec_dump_acc_encdata(name, words[1], words[2]);
3566 mvxpsec_dump_acc_enclen(name, words[2]);
3567 mvxpsec_dump_acc_enckey(name, words[3]);
3568 mvxpsec_dump_acc_enciv(name, words[4]);
3569 mvxpsec_dump_acc_macsrc(name, words[5]);
3570 mvxpsec_dump_acc_macdst(name, words[6])
[all...] |
