Searched refs:words (Results 1 - 25 of 80) sorted by relevance

1234

/haiku-fatelf/src/bin/network/ftp/
H A Dcomplete.c74 * Otherwise, list choices. words is assumed to be filtered
79 * words stringlist containing possible matches
83 complete_ambiguous(char *word, int list, StringList *words) argument
91 if (words->sl_cur == 0)
94 if (words->sl_cur == 1) { /* only once choice available */
95 p = words->sl_str[0] + wordlen;
107 lastmatch = words->sl_str[0];
109 for (i = 1 ; i < words->sl_cur ; i++) {
110 for (j = wordlen ; j < strlen(words->sl_str[i]); j++)
111 if (lastmatch[j] != words
139 StringList *words; local
168 StringList *words; local
251 StringList *words; local
282 StringList *words; local
[all...]
/haiku-fatelf/src/bin/bash/
H A Dlist.c49 wlist_walk (words, function)
50 WORD_LIST *words;
53 for ( ; words; words = words->next)
54 if ((*function) (words->word->word) < 0)
H A Dpcomplib.c60 ret->words = (char *)NULL;
78 FREE (cs->words);
102 new->words = STRDUP (cs->words);
/haiku-fatelf/src/add-ons/kernel/network/protocols/ipv6/
H A Dipv6_utils.cpp62 uint16 words[NS_IN6ADDRSZ / NS_INT16SZ]; local
71 memset(words, '\0', sizeof words);
73 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
79 if (words[i] == 0) {
117 (best.len == 7 && words[7] != 0x0001) ||
118 (best.len == 5 && words[5] == 0xffff))) {
125 tp += SPRINTF((tp, "%x", words[i]));
/haiku-fatelf/src/bin/coreutils/lib/
H A Dinet_ntop.c147 unsigned int words[NS_IN6ADDRSZ / NS_INT16SZ]; local
155 memset (words, '\0', sizeof words);
157 words[i / 2] = (src[i] << 8) | src[i + 1];
162 if (words[i] == 0)
205 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
213 int len = sprintf (tp, "%x", words[i]);
/haiku-fatelf/src/add-ons/kernel/drivers/network/ipro1000/dev/e1000/
H A De1000_nvm.h50 s32 e1000_read_nvm_spi(struct e1000_hw *hw, u16 offset, u16 words, u16 *data);
52 u16 words, u16 *data);
53 s32 e1000_read_nvm_eerd(struct e1000_hw *hw, u16 offset, u16 words,
58 u16 words, u16 *data);
59 s32 e1000_write_nvm_spi(struct e1000_hw *hw, u16 offset, u16 words,
H A De1000_i210.c42 static s32 e1000_write_nvm_srwr(struct e1000_hw *hw, u16 offset, u16 words,
46 static s32 e1000_read_nvm_i211(struct e1000_hw *hw, u16 offset, u16 words,
220 * @words: number of words to read
226 s32 e1000_read_nvm_srrd_i210(struct e1000_hw *hw, u16 offset, u16 words, argument
237 for (i = 0; i < words; i += E1000_EERD_EEWR_MAX_COUNT) {
238 count = (words - i) / E1000_EERD_EEWR_MAX_COUNT > 0 ?
239 E1000_EERD_EEWR_MAX_COUNT : (words - i);
259 * @words: number of words t
271 e1000_write_nvm_srwr_i210(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
312 e1000_write_nvm_srwr(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
367 e1000_read_nvm_i211(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
[all...]
H A De1000_i210.h42 u16 words, u16 *data);
44 u16 words, u16 *data);
H A De1000_nvm.c438 * @words: number of words to read
443 s32 e1000_read_nvm_spi(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
454 * A check for invalid values: offset too large, too many words,
455 * and not enough words.
457 if ((offset >= nvm->word_size) || (words > (nvm->word_size - offset)) ||
458 (words == 0)) {
486 for (i = 0; i < words; i++) {
502 * @words: number of words t
507 e1000_read_nvm_microwire(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
566 e1000_read_nvm_eerd(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
614 e1000_write_nvm_spi(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
698 e1000_write_nvm_microwire(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
[all...]
/haiku-fatelf/src/bin/network/tcpdump/
H A Dprint-smb.c173 print_trans2(const u_char *words, const u_char *dat, const u_char *buf, const u_char *maxbuf) argument
178 const u_char *w = words + 1;
182 TCHECK(words[0]);
191 if (words[0] == 0) {
206 if (words[0] == 8) {
207 smb_fdata(words + 1,
212 smb_fdata(words + 1,
214 words + 1 + 14 * 2, unicodestr);
219 smb_fdata(words + 1,
221 words
336 print_trans(const u_char *words, const u_char *data1, const u_char *buf, const u_char *maxbuf) argument
398 print_negprot(const u_char *words, const u_char *data, const u_char *buf _U_, const u_char *maxbuf) argument
439 print_sesssetup(const u_char *words, const u_char *data, const u_char *buf _U_, const u_char *maxbuf) argument
483 print_lockingandx(const u_char *words, const u_char *data, const u_char *buf _U_, const u_char *maxbuf) argument
801 const u_char *words, *maxwords, *data; local
[all...]
/haiku-fatelf/src/kits/network/libbind/inet/
H A Dinet_net_ntop.c179 int words; local
206 /* how many words need to be displayed in output */
207 words = (bits + 15) / 16;
208 if (words == 1)
209 words = 2;
213 for (i = 0; i < (words * 2); i += 2) {
232 if (zero_l != words && zero_s == 0 && ((zero_l == 6) ||
237 /* Format whole words. */
238 for (p = 0; p < words; p++) {
243 if (p == words
[all...]
H A Dinet_ntop.c128 u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; local
136 memset(words, '\0', sizeof words);
138 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
144 if (words[i] == 0) {
181 (best.len == 7 && words[7] != 0x0001) ||
182 (best.len == 5 && words[5] == 0xffff))) {
188 tp += SPRINTF((tp, "%x", words[i]));
H A Dinet_cidr_ntop.c164 u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; local
177 memset(words, '\0', sizeof words);
179 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
185 if (words[i] == 0) {
222 (best.len == 7 && words[7] != 0x0001) ||
223 (best.len == 5 && words[5] == 0xffff))) {
240 tp += SPRINTF((tp, "%x", words[i]));
H A Dinet_net_pton.c273 int words; local
340 words = (bits + 15) / 16;
341 if (words < 2)
342 words = 2;
344 words = 8;
345 endp = tmp + 2 * words;
/haiku-fatelf/src/bin/network/tcpdump/missing/
H A Dinet_ntop.c118 u_long words [IN6ADDRSZ / INT16SZ]; local
125 memset (words, 0, sizeof(words));
127 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3));
133 if (words[i] == 0)
173 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
183 tp += sprintf (tp, "%lX", words[i]);
/haiku-fatelf/src/bin/gdb/opcodes/
H A Darc-dis.c53 a = state->words[1]; \
62 flag = BIT (state->words[0], 8); \
63 state->nullifyMode = BITS (state->words[0], 5, 6); \
64 cond = BITS (state->words[0], 0, 4); \
73 cond = BITS (state->words[0], 0, 4); \
92 field = FIELDD (state->words[0]); \
100 fieldA = FIELDA (state->words[0]); \
112 fieldB = FIELDB (state->words[0]); \
120 fieldC = FIELDC (state->words[0]); \
142 #define NEXT_WORD(x) (offset += 4, state->words[
[all...]
H A Darc-dis.h65 unsigned long words[2]; member in struct:arcDisState
/haiku-fatelf/src/add-ons/kernel/debugger/hangman/
H A Dhangman.c46 char words[MAX_CACHED_WORDS][MAX_LETTERS+1]; variable
124 memset((void *)words, 0, sizeof(words));
158 strncpy(&(words[current][0]), &(bigbuffer[beg]), end - beg);
167 dprintf("%s\n", words[current]);
180 memset((void *)words, 0, sizeof(words));
203 strncpy(&(words[current][0]), &(p[beg]), end - beg);
212 dprintf("%s\n", words[current]);
236 while (words[curren
[all...]
/haiku-fatelf/src/add-ons/kernel/debugger/qrencode/
H A Dqrinput.c412 int words, i, ret; local
433 words = entry->size / 3;
434 for(i=0; i<words; i++) {
443 if(entry->size - words * 3 == 1) {
444 val = entry->data[words*3] - '0';
447 } else if(entry->size - words * 3 == 2) {
448 val = (entry->data[words*3 ] - '0') * 10;
449 val += (entry->data[words*3+1] - '0');
525 int words, i, ret; local
547 words
827 int ret, words; local
1056 int words, ret; local
1193 int bits, maxbits, words, maxwords, i, ret; local
1258 int bits, maxbits, words, maxwords, i, ret, termbits; local
[all...]
H A Dqrspec.c48 int words; //< Data capacity (bytes) member in struct:__anon1470
103 return qrspecCapacity[version].words - qrspecCapacity[version].ec[level];
114 int words; local
117 words = qrspecCapacity[i].words - qrspecCapacity[i].ec[level];
118 if(words >= size) return i;
165 int words; local
177 words = (1 << bits) - 1;
179 words *= 2; // the number of bytes is required
182 return words;
[all...]
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/ppc/
H A Dsysdep.h155 #define EALIGN_W_0 /* No words to insert. */
164 /* EALIGN is like ENTRY, but does alignment to 'words'*4 bytes
167 #define EALIGN(name, alignt, words) \
175 EALIGN_W_##words; \
178 #define EALIGN(name, alignt, words) \
182 EALIGN_W_##words; \
/haiku-fatelf/src/bin/coreutils/src/
H A Dwc.c1 /* wc - print the number of lines, words, and bytes in files
56 /* Cumulative number of lines, words, chars and bytes in all files so far.
97 {"words", no_argument, NULL, 'w'},
131 -w, --words print the word counts\n\
144 uintmax_t words,
161 printf (format_int, number_width, umaxtostr (words, buf));
183 /* Count words. FILE_X is the name of the file (or NULL for standard
192 uintmax_t lines, words, chars, bytes, linelength;
196 lines = words = chars = bytes = linelength = 0;
256 but not chars or words
142 write_counts(uintmax_t lines, uintmax_t words, uintmax_t chars, uintmax_t bytes, uintmax_t linelength, const char *file) argument
191 uintmax_t lines, words, chars, bytes, linelength; local
[all...]
/haiku-fatelf/data/etc/bash_completion.d/
H A Dgit360 # This function can be used to access a tokenized list of words
396 # re-assemble words to complete.
450 words)
451 words=("${words_[@]}")
471 words)
472 words=("${COMP_WORDS[@]}")
742 local cur words cword
743 _get_comp_words_by_ref -n =: cur words cword
744 local cmd="${words[1]}"
747 i="${words[
[all...]
/haiku-fatelf/src/add-ons/accelerants/vmware/
H A DCursor.c20 uint32* words = (uint32*)scanline; local
25 FifoWrite(words[i]);
/haiku-fatelf/src/tests/system/libroot/posix/bonnie++-1.03d/
H A Dbonnie++.cpp434 int words; local
462 for(words = 0; words < num_chunks; words++)
514 for(words = 0; words < num_chunks; words++)
542 for(words = 0; words < num_chunks; words
[all...]

Completed in 257 milliseconds

1234