Home
last modified time | relevance | path

Searched full:words (Results 1 – 25 of 1771) sorted by relevance

12345678910>>...71

/freebsd/crypto/openssh/
H A Dmdoc2man.awk45 retval=retval words[++w]
72 nwords=split($0,words)
75 if(match(words[w],"^Li|Pf$")) {
77 } else if(match(words[w],"^Xo$")) {
82 } else if(match(words[w],"^Xc$")) {
88 } else if(match(words[w],"^Bd$")) {
90 if(match(words[w+1],"-literal")) {
95 } else if(match(words[w],"^Ed$")) {
98 } else if(match(words[w],"^Ns$")) {
103 } else if(match(words[w],"^No$")) {
[all …]
/freebsd/contrib/atf/atf-c++/detail/
H A Dtext_test.cpp69 std::vector< std::string > words; in ATF_TEST_CASE_BODY() local
72 words.clear(); in ATF_TEST_CASE_BODY()
73 str = join(words, ","); in ATF_TEST_CASE_BODY()
76 words.clear(); in ATF_TEST_CASE_BODY()
77 words.push_back(""); in ATF_TEST_CASE_BODY()
78 str = join(words, ","); in ATF_TEST_CASE_BODY()
81 words.clear(); in ATF_TEST_CASE_BODY()
82 words.push_back(""); in ATF_TEST_CASE_BODY()
83 words.push_back(""); in ATF_TEST_CASE_BODY()
84 str = join(words, ","); in ATF_TEST_CASE_BODY()
[all …]
/freebsd/contrib/atf/atf-c/detail/
H A Dtext_test.c50 array_size(const char *words[]) in array_size() argument
56 for (word = words; *word != NULL; word++) in array_size()
64 check_split(const char *str, const char *delim, const char *words[]) in check_split() argument
73 printf("Expecting %zd words\n", array_size(words)); in check_split()
74 ATF_CHECK_EQ(atf_list_size(&list), array_size(words)); in check_split()
76 for (word = words, i = 0; *word != NULL; word++, i++) { in check_split()
77 printf("Word at position %zd should be '%s'\n", i, words[i]); in check_split()
78 ATF_CHECK_STREQ((const char *)atf_list_index_c(&list, i), words[i]); in check_split()
238 const char *words[] = { NULL }; in ATF_TC_BODY() local
239 check_split("", " ", words); in ATF_TC_BODY()
[all …]
/freebsd/contrib/bmake/
H A Dstr.c107 * 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; in Substring_Words() local
136 /* words_buf holds the words, separated by '\0'. */ in Substring_Words()
141 words = bmake_malloc((words_cap + 1) * sizeof(words[0])); in Substring_Words()
191 * end of a token -- make sure there's enough words in Substring_Words()
200 words = bmake_realloc(words, in Substring_Words()
201 (words_cap + 1) * sizeof(words[0])); in Substring_Words()
203 words[words_len++] = in Substring_Words()
[all …]
/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-to-separator.mk3 # Tests for the :ts variable modifier, which joins the words of the variable
6 WORDS= one two three four five six
8 # The words are separated by a single space, just as usual.
9 .if ${WORDS:ts } != "one two three four five six"
14 .if ${WORDS:ts,} != "one,two,three,four,five,six"
19 .if ${WORDS:ts/:tu} != "ONE/TWO/THREE/FOUR/FIVE/SIX"
25 .if ${WORDS:ts::tu} != "ONE:TWO:THREE:FOUR:FIVE:SIX"
29 # When there is just a colon but no other character, the words are
32 .if ${WORDS:ts:tu} != "ONETWOTHREEFOURFIVESIX"
38 # split into words. Beware of separating the words using a single or double
[all …]
H A Dvarmod-match.mk3 # Tests for the ':M' modifier, which keeps only those words that match the
34 # '*' matches 0 or more characters. The whole pattern matches all words that
84 # Only keep words that start with an uppercase letter.
89 # Only keep words that start with a character other than an uppercase letter.
138 # Without the 'b' in the below words, the backslash would end a word and thus
139 # influence how the string is split into words.
140 WORDS= a\b a[\]b ab a\\b
141 .if ${WORDS:Ma[\]b} != "a\\b"
149 WORDS= [ ] [] \] ]]
150 .if ${WORDS:M[[-]]} != "[] \\] ]]"
[all …]
H A Dvarmod-subst.mk10 WORDS= sequences of letters
14 .if ${WORDS:S,,,} != ${WORDS}
19 .if ${WORDS:S,e,*,1} != "s*quences of letters"
25 .if ${WORDS:S,f,*,1} != "sequences o* letters"
30 .if ${WORDS:S,e,*,} != "s*quences of l*tters"
35 .if ${WORDS:S,e,*,g} != "s*qu*nc*s of l*tt*rs"
41 .if ${WORDS:S,^sequ,occurr,} != "occurrences of letters"
47 .if ${WORDS:S,^of,with,} != "sequences with letters"
52 .if ${WORDS:S,^office,does not match,} != ${WORDS}
58 .if ${WORDS:S,f$,r,} != "sequences or letters"
[all …]
H A Dvarmod-order-shuffle.mk3 # Tests for the :Ox variable modifier, which returns the words of the
15 WORDS= one two three four five six seven eight nine ten
24 shuffled1:= ${WORDS:Ox}
25 shuffled2:= ${WORDS:Ox}
31 shuffled1:= ${WORDS:O:Ox}
32 shuffled2:= ${WORDS:O:Ox}
38 sorted:= ${WORDS:Ox:O}
39 .if ${sorted} != ${WORDS:O}
40 . error ${sorted} != ${WORDS:O}
H A Dvarmod-match.exp2 while evaluating variable "WORDS" with value "a a["
4 while evaluating variable "WORDS" with value "a a[ aX"
6 while evaluating variable "WORDS" with value "- + x xx 0 1 2 3 4 [x1-3"
8 …while evaluating variable "WORDS" with value "- + x xx 0 1 2 3 4 00 01 10 11 000 001 010 011 100 1…
10 while evaluating variable "WORDS" with value "- + x xx 0 1 2 3 4 [x1-3"
12 while evaluating variable "WORDS" with value "\\ \a x\"
14 while evaluating variable "WORDS" with value "[x- x x- y"
16 while evaluating variable "WORDS" with value "[x- x x- y yyyyy"
H A Dvarmod-order-string.mk3 # 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
/freebsd/contrib/llvm-project/llvm/lib/Target/MSP430/Disassembler/
H A DMSP430Disassembler.cpp205 static const uint8_t *getDecoderTable(AddrMode SrcAM, unsigned Words) { in getDecoderTable() argument
206 assert(0 < Words && Words < 4 && "Incorrect number of words"); in getDecoderTable()
211 assert(Words < 3 && "Incorrect number of words"); in getDecoderTable()
212 return Words == 2 ? DecoderTableAlpha32 : DecoderTableAlpha16; in getDecoderTable()
214 assert(Words < 3 && "Incorrect number of words"); in getDecoderTable()
215 return Words == 2 ? DecoderTableBeta32 : DecoderTableBeta16; in getDecoderTable()
220 assert(Words > 1 && "Incorrect number of words"); in getDecoderTable()
221 return Words == 2 ? DecoderTableGamma32 : DecoderTableGamma48; in getDecoderTable()
224 assert(Words < 3 && "Incorrect number of words"); in getDecoderTable()
225 return Words == 2 ? DecoderTableDelta32 : DecoderTableDelta16; in getDecoderTable()
[all …]
/freebsd/contrib/tnftp/src/
H A Dcomplete.c77 * Otherwise, list choices. words is assumed to be filtered
82 * words stringlist containing possible matches
86 complete_ambiguous(char *word, int list, StringList *words) in complete_ambiguous() argument
94 if (words->sl_cur == 0) in complete_ambiguous()
97 if (words->sl_cur == 1) { /* only once choice available */ in complete_ambiguous()
98 p = words->sl_str[0] + wordlen; in complete_ambiguous()
110 lastmatch = words->sl_str[0]; in complete_ambiguous()
112 for (i = 1 ; i < words->sl_cur ; i++) { in complete_ambiguous()
113 for (j = wordlen ; j < strlen(words->sl_str[i]); j++) in complete_ambiguous()
114 if (lastmatch[j] != words->sl_str[i][j]) in complete_ambiguous()
[all …]
/freebsd/sys/dev/isci/scil/
H A Dintel_ata.h341 U16 retired1[2]; // words 04-05
343 U16 reserved_for_compact_flash1[2]; // words 07-08
346 U16 retired2[2]; // words 20-21
348 U8 firmware_revision[ATA_IDENTIFY_FW_REVISION_LEN]; // words 23-26
349 U8 model_number[ATA_IDENTIFY_MODEL_NUMBER_LEN]; // words 27-46
354 U16 obsolete5[2]; // words 51-52
356 U16 obsolete6[5]; // words 54-58 Used to be:
362 U8 total_num_sectors[4]; // words 60-61
372 U16 reserved2[4]; // words 71-74
396 U16 stream_performance_granularity[2]; // words 98-99
[all …]
/freebsd/sys/dev/ixl/
H A Di40e_nvm.c61 /* Switching to words (sr_size contains power of 2KB) */ in i40e_init_nvm()
252 * @module_pointer: module pointer location in words from the NVM beginning
253 * @offset: offset in words from module start
254 * @words: number of words to write
255 * @data: buffer with words to write to the Shadow RAM
258 * Writes a 16 bit words buffer to the Shadow RAM using the admin command.
262 u16 words, void *data, in i40e_read_nvm_aq() argument
278 if ((offset + words) > hw->nvm.sr_size) in i40e_read_nvm_aq()
281 (offset + words), hw->nvm.sr_size); in i40e_read_nvm_aq()
282 else if (words > I40E_SR_SECTOR_SIZE_IN_WORDS) in i40e_read_nvm_aq()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/net/can/
H A Dbosch,m_can.yaml70 11-bit Filter 0-128 elements / 0-128 words
71 29-bit Filter 0-64 elements / 0-128 words
72 Rx FIFO 0 0-64 elements / 0-1152 words
73 Rx FIFO 1 0-64 elements / 0-1152 words
74 Rx Buffers 0-64 elements / 0-1152 words
75 Tx Event FIFO 0-32 elements / 0-64 words
76 Tx Buffers 0-32 elements / 0-576 words
86 - description: 11-bit Filter 0-128 elements / 0-128 words
89 - description: 29-bit Filter 0-64 elements / 0-128 words
92 - description: Rx FIFO 0 0-64 elements / 0-1152 words
[all …]
/freebsd/contrib/bearssl/src/symcipher/
H A Daes_pwr8.c59 * v1 = constant -8 / +8, copied into four words in key_schedule_128()
61 * v3 = Rcon (x4 words) in key_schedule_128()
62 * v6 = constant 8, copied into four words in key_schedule_128()
63 * v7 = constant 0x11B, copied into four words in key_schedule_128()
64 * v8 = constant for byteswapping words in key_schedule_128()
110 /* XOR words for next subkey */ in key_schedule_128()
168 * v1 = constant -8 / +8, copied into four words in key_schedule_192()
170 * v5 = Rcon (x4 words) (already shifted on big-endian) in key_schedule_192()
171 * v6 = constant 8, copied into four words in key_schedule_192()
172 * v8 = constant for byteswapping words in key_schedule_192()
[all …]
/freebsd/tools/tools/notescheck/
H A Dnotescheck.py215 # Split a line into words on whitespace with the exception that quoted
233 words = []
236 words.append(group)
240 words.append(word)
242 return words
248 words = tokenize(line)
251 if words[0] == 'include':
255 if words[1] == 'standard':
259 if words[1] != 'optional' and words[1] != 'mandatory':
262 # Drop the first two words and begin parsing keywords and devices.
[all …]
/freebsd/stand/man/
H A Dloader_4th.876 is initialized, the builtin words are added to its vocabulary, and
139 words.
206 All builtin words are state-smart, immediate words.
211 If compiled, the builtin words expect to find, at execution time, the
259 back to execute the builtin words.
266 The words available to
271 Forth standard words, extra
273 words, extra
275 words, and the builtin commands;
279 Forth standard words are listed in the
[all …]
/freebsd/lib/libc/gen/
H A Dwordexp.337 .Fn wordexp "const char * restrict words" "wordexp_t * restrict we" "int flags"
44 .Fa words
45 and places the list of words into the
49 and the number of words into
57 Append the words to those generated by a previous call to
70 .Fa words .
96 size_t we_wordc; /* count of words matched */
97 char **we_wordv; /* pointer to list of words */
120 .Fa words
149 .Fa words .
/freebsd/contrib/cortex-strings/src/arm/
H A Dmemcpy.S166 vld1.8 {d0}, [src]! /* 14 words to go. */
168 vld1.8 {d0}, [src]! /* 12 words to go. */
170 vld1.8 {d0}, [src]! /* 10 words to go. */
172 vld1.8 {d0}, [src]! /* 8 words to go. */
174 vld1.8 {d0}, [src]! /* 6 words to go. */
176 vld1.8 {d0}, [src]! /* 4 words to go. */
178 vld1.8 {d0}, [src]! /* 2 words to go. */
185 /* Copy up to 15 full words of data. May not be aligned. */
194 ldr tmp1, [src, #-60] /* 15 words to go. */
197 ldr tmp1, [src, #-56] /* 14 words to go. */
[all …]
/freebsd/contrib/arm-optimized-routines/string/arm/
H A Dmemcpy.S136 vld1.8 {d0}, [src]! /* 14 words to go. */
138 vld1.8 {d0}, [src]! /* 12 words to go. */
140 vld1.8 {d0}, [src]! /* 10 words to go. */
142 vld1.8 {d0}, [src]! /* 8 words to go. */
144 vld1.8 {d0}, [src]! /* 6 words to go. */
146 vld1.8 {d0}, [src]! /* 4 words to go. */
148 vld1.8 {d0}, [src]! /* 2 words to go. */
155 /* Copy up to 15 full words of data. May not be aligned. */
164 ldr tmp1, [src, #-60] /* 15 words to go. */
167 ldr tmp1, [src, #-56] /* 14 words to go. */
[all …]
/freebsd/contrib/kyua/utils/cmdline/
H A Doptions_test.cpp300 const cmdline::list_option::option_type words = in ATF_TEST_CASE_BODY() local
302 ATF_REQUIRE(words.empty()); in ATF_TEST_CASE_BODY()
307 const cmdline::list_option::option_type words = in ATF_TEST_CASE_BODY() local
309 ATF_REQUIRE_EQ(1, words.size()); in ATF_TEST_CASE_BODY()
310 ATF_REQUIRE_EQ("foo", words[0]); in ATF_TEST_CASE_BODY()
315 const cmdline::list_option::option_type words = in ATF_TEST_CASE_BODY() local
317 ATF_REQUIRE_EQ(3, words.size()); in ATF_TEST_CASE_BODY()
318 ATF_REQUIRE_EQ("foo", words[0]); in ATF_TEST_CASE_BODY()
319 ATF_REQUIRE_EQ("bar", words[1]); in ATF_TEST_CASE_BODY()
320 ATF_REQUIRE_EQ("baz", words[2]); in ATF_TEST_CASE_BODY()
[all …]
/freebsd/usr.sbin/traceroute6/
H A Dtraceroute6.840 .Bk -words
43 .Bk -words
46 .Bk -words
49 .Bk -words
52 .Bk -words
55 .Bk -words
58 .Bk -words
61 .Bk -words
64 .Bk -words
67 .Bk -words
[all …]
/freebsd/contrib/bearssl/T0/
H A DWord.cs29 * A "word" is a function with a name. Words can be either native or
30 * interpreted; native words are implemented as some in-compiler special
33 * Some native words (not all of them) have a C implementation and can
34 * thus be part of the generated C code. Native words with no C
36 * the case for words that support the syntax (e.g. 'if').
49 * Immediate words are executed immediately when encountered in the
64 * Words are allocated slot numbers when output code is generated.
86 * words.
104 * All words may have an explicit C implementations. To be part
113 * Get all words referenced from this one. This implies
/freebsd/sys/dev/e1000/
H A De1000_nvm.c442 * @words: number of words to read
447 s32 e1000_read_nvm_spi(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) in e1000_read_nvm_spi() argument
457 /* A check for invalid values: offset too large, too many words, in e1000_read_nvm_spi()
458 * and not enough words. in e1000_read_nvm_spi()
460 if ((offset >= nvm->word_size) || (words > (nvm->word_size - offset)) || in e1000_read_nvm_spi()
461 (words == 0)) { in e1000_read_nvm_spi()
487 for (i = 0; i < words; i++) { in e1000_read_nvm_spi()
502 * @words: number of words to read
507 s32 e1000_read_nvm_microwire(struct e1000_hw *hw, u16 offset, u16 words, in e1000_read_nvm_microwire() argument
517 /* A check for invalid values: offset too large, too many words, in e1000_read_nvm_microwire()
[all …]

12345678910>>...71