HomeSort by relevance Sort by last modified time
    Searched refs:words (Results 101 - 125 of 1016) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/openssh/openbsd-compat/
inet_ntop.c 120 u_int words[IN6ADDRSZ / INT16SZ]; local
129 memset(words, '\0', sizeof words);
131 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
135 if (words[i] == 0) {
179 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
185 advance = snprintf(tp, ep - tp, "%x", words[i]);
  /external/python/cpython2/Demo/scripts/
markov.py 45 print '-w: words'
50 print 'in words by whitespace, then reconcatenated with'
51 print 'exactly one space separating words.'
83 words = para.split()
84 if words:
86 data = tuple(words)
88 data = ' '.join(words)
106 words = data
108 words = data.split()
111 for w in words
    [all...]
  /external/tcpdump/
addrtostr.c 116 u_long words [IN6ADDRSZ / INT16SZ]; local
123 memset (words, 0, sizeof(words));
125 words[i/2] |= (srcaddr[i] << ((1 - (i % 2)) << 3));
133 if (words[i] == 0)
183 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
195 snprintfed = snprintf (dp, space_left, "%lx", words[i]);
print-smb.c 173 const u_char *words, const u_char *dat, const u_char *buf, const u_char *maxbuf)
178 const u_char *w = words + 1;
182 ND_TCHECK(words[0]);
191 if (words[0] == 0) {
206 if (words[0] == 8) {
207 smb_fdata(ndo, words + 1,
212 smb_fdata(ndo, words + 1,
214 words + 1 + 14 * 2, unicodestr);
219 smb_fdata(ndo, words + 1,
221 words + 1 + 10 * 2, unicodestr)
801 const u_char *words, *maxwords, *data; local
    [all...]
  /test/vts/drivers/hal/libcodecoverage/
GcdaFile.cpp 101 const unsigned* GcdaFile::ReadWords(unsigned words) {
107 if (excess < words) {
112 if (gcov_var_.length + words > gcov_var_.alloc) {
113 Allocate(gcov_var_.length + words);
119 if (gcov_var_.length < words) {
120 gcov_var_.overread += words - gcov_var_.length;
126 gcov_var_.offset += words;
  /prebuilts/go/darwin-x86/doc/codewalk/
markov.go 18 and suffixes, or "chain": (This table assumes a prefix length of two words.)
43 The prefix and output lengths can be specified using the -prefix and -words
59 // Prefix is a Markov chain prefix of one or more words.
74 // A prefix is a string of prefixLen words joined with spaces.
81 // NewChain returns a new Chain with prefixes of prefixLen words.
102 // Generate returns a string of at most n words generated from Chain.
105 var words []string
112 words = append(words, next)
115 return strings.Join(words, " ")
    [all...]
  /prebuilts/go/linux-x86/doc/codewalk/
markov.go 18 and suffixes, or "chain": (This table assumes a prefix length of two words.)
43 The prefix and output lengths can be specified using the -prefix and -words
59 // Prefix is a Markov chain prefix of one or more words.
74 // A prefix is a string of prefixLen words joined with spaces.
81 // NewChain returns a new Chain with prefixes of prefixLen words.
102 // Generate returns a string of at most n words generated from Chain.
105 var words []string
112 words = append(words, next)
115 return strings.Join(words, " ")
    [all...]
  /toolchain/binutils/binutils-2.25/opcodes/
arc-dis.c 75 a = state->words[1]; \
84 flag = BIT (state->words[0], 8); \
85 state->nullifyMode = BITS (state->words[0], 5, 6); \
86 cond = BITS (state->words[0], 0, 4); \
95 cond = BITS (state->words[0], 0, 4); \
114 field = FIELDD (state->words[0]); \
122 fieldA = FIELDA (state->words[0]); \
134 fieldB = FIELDB (state->words[0]); \
142 fieldC = FIELDC (state->words[0]); \
164 #define NEXT_WORD(x) (offset += 4, state->words[x]
    [all...]
arc-dis.h 66 unsigned long words[2]; member in struct:arcDisState
  /frameworks/rs/rsov/compiler/
RSSPIRVWriter.cpp 97 std::vector<uint32_t> words(str.size() / 4);
99 memcpy(words.data(), str.data(), str.size());
107 auto wordsOut = spiritPasses.run(words, &error);
  /prebuilts/go/darwin-x86/src/runtime/
memclr_mipsx.s 42 BEQ R1, R6, words
54 words: label
58 JMP words
  /prebuilts/go/linux-x86/src/runtime/
memclr_mipsx.s 42 BEQ R1, R6, words
54 words: label
58 JMP words
  /device/google/contexthub/firmware/os/cpu/cortexm4/inc/cpu/
atomicBitset.h 26 uint32_t words[]; member in struct:AtomicBitset
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/freeze/
parsesetup.py 73 words = line.split()
74 if words:
75 modules[words[0]] = words[1:]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/scripts/
ifdef.py 68 words = tmp.split()
69 keyword = words[0]
73 if keyword in ('ifdef', 'ifndef') and len(words) == 2:
78 word = words[1]
  /external/ImageMagick/PerlMagick/demo/
annotate_words.pl 5 # Take the internal string, split it into words and try to annotate each
6 # individual word correctly, so as to control spacing between the words
25 my (@words) = split ' ',$str;
26 #print join "\n",@words,"\n";
30 foreach my $word (@words){
  /external/autotest/client/tests/unixbench5/
unixbench5.py 80 # being the actual result. Make sure there are at least that words
82 words = line.lower().split()
83 if len(words) >= 6:
84 key = re.sub('\W', '', '_'.join(words[:-6]))
85 keyval[key + suffix] = words[-6]
  /external/jline/src/src/main/java/jline/
SimpleCompletor.java 15 * list of completion words.
83 List words = new LinkedList(); local
88 tok.hasMoreTokens(); words.add(tok.nextToken())) {
93 return (String[]) words.toArray(new String[words.size()]);
  /external/openssh/
mdoc2man.awk 47 retval=retval words[++w]
74 nwords=split($0,words)
77 if(match(words[w],"^Li|Pf$")) {
79 } else if(match(words[w],"^Xo$")) {
84 } else if(match(words[w],"^Xc$")) {
90 } else if(match(words[w],"^Bd$")) {
92 if(match(words[w+1],"-literal")) {
97 } else if(match(words[w],"^Ed$")) {
100 } else if(match(words[w],"^Ns$")) {
105 } else if(match(words[w],"^No$"))
    [all...]
  /external/python/cpython2/Modules/_ctypes/libffi/src/powerpc/
asm.h 84 #define EALIGN_W_0 /* No words to insert. */
93 /* EALIGN is like ENTRY, but does alignment to 'words'*4 bytes
96 #define EALIGN(name, alignt, words) \
104 EALIGN_W_##words; \
107 #define EALIGN(name, alignt, words) \
111 EALIGN_W_##words; \
  /external/python/cpython2/Tools/freeze/
parsesetup.py 73 words = line.split()
74 if words:
75 modules[words[0]] = words[1:]
  /external/python/cpython2/Tools/scripts/
ifdef.py 68 words = tmp.split()
69 keyword = words[0]
73 if keyword in ('ifdef', 'ifndef') and len(words) == 2:
78 word = words[1]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
brokw-2.s 1 ; Tests the broken-word function, two words.
  /prebuilts/go/darwin-x86/src/cmd/go/
generate.go 249 words := g.split(string(buf))
250 if len(words) == 0 {
253 if words[0] == "-command" {
254 g.setShorthand(words)
259 fmt.Fprintf(os.Stderr, "%s\n", strings.Join(words, " "))
264 g.exec(words)
289 // split breaks the line into words, evaluating quoted
294 var words []string
301 Words:
321 words = append(words, word
    [all...]
  /prebuilts/go/linux-x86/src/cmd/go/
generate.go 249 words := g.split(string(buf))
250 if len(words) == 0 {
253 if words[0] == "-command" {
254 g.setShorthand(words)
259 fmt.Fprintf(os.Stderr, "%s\n", strings.Join(words, " "))
264 g.exec(words)
289 // split breaks the line into words, evaluating quoted
294 var words []string
301 Words:
321 words = append(words, word
    [all...]

Completed in 226 milliseconds

1 2 3 45 6 7 8 91011>>