| /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);
|
| 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_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_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;
|
| 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;
|
| 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
|
| 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:
|
| 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:
|
| /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
|
| 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...] |
| 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...] |
| 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.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/games/battlestar/ |
| globals.c | 261 char words[NWORD][WORDLEN]; variable in typeref:typename:char[][]
|
