Searched refs:word (Results 76 - 100 of 401) sorted by relevance

1234567891011>>

/external/ppp/pppd/
H A Dpppcrypt.c42 unsigned int word; local
44 word = (unsigned)input[startBit / 8] << 8;
45 word |= (unsigned)input[startBit / 8 + 1];
47 word >>= 15 - (startBit % 8 + 7);
49 return word & 0xFE;
/external/srec/srec/crec/
H A Dastar_pphash.c44 ie see whether the word history is the same */
58 diff = parp1->word - parp2->word;
83 hashval = (hashval << 10) + parp->word;
86 if (parp->word != MAXwordID)
87 hashval = hashval * 64 + parp->word + hashval % 65536;
/external/e2fsprogs/misc/
H A De2initrd_helper.c181 char *word, *next; local
183 word = *buf;
184 if (*word == 0)
187 word = skip_over_blank(word);
188 next = skip_over_word(word);
192 return word;
195 static void parse_escape(char *word) argument
200 if (!word)
203 for (p = word,
[all...]
/external/icu4c/test/intltest/
H A Dthcoll.cpp90 // Loop through each word in the dictionary and compare it to the previous
91 // word. They should be in sorted order.
93 UnicodeString lastWord, word; local
96 while (names.readLineSkippingComments(word, ec, FALSE) && U_SUCCESS(ec)) {
102 logln((UnicodeString)"Word " + wordCount + ": " + IntlTest::prettify(word, str));
106 Collator::EComparisonResult result = coll->compare(lastWord, word);
107 doTest(coll, lastWord, word, result);
109 lastWord = word;
137 // Loop through each word in the dictionary and compare it to the previous
138 // word
140 UnicodeString lastWord, word; local
[all...]
/external/bison/lib/
H A Dabitset.c29 of words. Any unused bits in the last word must be zero. */
55 bitset_word word; local
57 word = ABITSET_WORDS (src)[0];
60 if (!word)
68 word >>= bitno;
71 of the word of interest. */
75 for (count = 0; word; bitno++)
77 if (word & 1)
79 word >>= 1;
84 for (count = 0; word; bitn
172 bitset_word word; local
211 bitset_word word; local
[all...]
H A Dlbitset.c578 bitset_word word; local
618 of the word of interest. */
628 word =
631 for (; word; bcount--)
633 if (word & BITSET_MSB)
642 word <<= 1;
671 bitset_word word; local
715 word = srcp[windex - elt->index] >> (bitno % BITSET_WORD_BITS);
717 for (; word; bitno++)
719 if (word
1394 bitset_word word; local
[all...]
H A Debitset.c600 of the word of interest. */
618 bitset_word word; local
620 word = srcp[woffset] << (BITSET_WORD_BITS - 1 - bcount);
622 for (; word; bcount--)
624 if (word & BITSET_MSB)
633 word <<= 1;
664 bitset_word word; local
692 word = srcp[windex - woffset] >> (bitno % BITSET_WORD_BITS);
694 for (; word; bitno++)
696 if (word
[all...]
/external/zlib/src/contrib/gcc_gvmat64/
H A Dgvmat64.S230 //;;; It is then shifted into the high word, to make room for the wmask
289 movzx r12d,word ptr [r9]
290 movzx ebx, word ptr [r9 + r11 - 1]
298 cmp bx,word ptr [rsi + r8 - 1]
306 movzx r8d, word ptr [rdi + r8*2]
318 cmp bx,word ptr [rsi + r8 - 1]
326 movzx r8d, word ptr [rdi + r8*2]
337 cmp bx,word ptr [rsi + r8 - 1]
345 movzx r8d, word ptr [rdi + r8*2]
357 cmp bx,word pt
[all...]
/external/srtp/crypto/math/
H A Ddatatypes.c339 /* copy each word from left size to right side */
346 /* set each word to the "or" of the two bit-shifted words */
426 v->word = NULL;
428 v->word = (uint32_t*)crypto_alloc(l);
429 if (v->word == NULL) {
430 v->word = NULL;
446 if (v->word != NULL)
447 crypto_free(v->word);
448 v->word = NULL;
456 memset(x->word,
[all...]
/external/srec/srec/include/
H A Dsrec_context.h43 /* todo: for dynamic vocabs, a word should eventually be replaced
44 not so much "char* word" but "wordblock* head", Jean to merge
124 /* caching for add word, because FST_AddWordToSlot() is often sequentially
137 wordmap *olabels; /* word labels */
140 /* word graph, for a-star */
196 const char* word,
222 int wordmap_whether_in_rule(wordmap* wmap, wordID word, wordID rule);
223 wordID wordmap_find_index(wordmap* wmap, const char* word);
224 wordID wordmap_find_index_in_rule(wordmap* wmap, const char* word, wordID rule);
228 wordID wordmap_add_word(wordmap* wmap, const char* word);
[all...]
H A Dastar.h35 /* an arc_token is used for the word graph, this implementation
75 wordID word; /* quick access to word (wta[token_index].word) */ member in struct:partial_path_t
125 arc_token* get_arc_for_word(arc_token* atoken, wordID word, void* context_void,
128 arc_token* get_arc_for_word_without_slot_annotation(arc_token* atoken, const char* word,
/external/webkit/Source/WebKit2/UIProcess/win/
H A DWebTextCheckerClient.cpp148 void WebTextCheckerClient::guessesForWord(uint64_t tag, const String& word, Vector<String>& guesses) argument
153 RefPtr<ImmutableArray> wkGuesses = adoptRef(toImpl(m_client.guessesForWord(tag, toAPI(word.impl()), m_client.clientInfo)));
159 void WebTextCheckerClient::learnWord(uint64_t tag, const String& word) argument
164 m_client.learnWord(tag, toAPI(word.impl()), m_client.clientInfo);
167 void WebTextCheckerClient::ignoreWord(uint64_t tag, const String& word) argument
172 m_client.ignoreWord(tag, toAPI(word.impl()), m_client.clientInfo);
/external/qemu/distrib/sdl-1.2.15/src/video/
H A Dmath_private.h27 n0 = ((*(int*)&one)>>29)^1; * index of high word *
28 ix0 = *(n0+(int*)&x); * high word of x *
29 ix1 = *((1-n0)+(int*)&x); * low word of x *
137 u_int32_t word; member in union:__anon10701
146 (i) = gf_u.word; \
154 sf_u.word = (i); \
/external/jmonkeyengine/engine/src/bullet-common/com/jme3/bullet/control/ragdoll/
H A DRagdollPreset.java91 public void addSynonym(String word, int score) { argument
92 put(word.toLowerCase(), score);
95 public int getScore(String word) { argument
97 String searchWord = word.toLowerCase();
/external/quake/quake/src/QW/client/
H A Dsurf16.asm284 mov ax,ds:word ptr[12345678h+eax*2]
287 mov ds:word ptr[edi],ax
288 mov cx,ds:word ptr[12345678h+ecx*2]
290 mov ds:word ptr[2+edi],cx
298 mov ax,ds:word ptr[12345678h+eax*2]
301 mov ds:word ptr[edi],ax
302 mov cx,ds:word ptr[12345678h+ecx*2]
304 mov ds:word ptr[2+edi],cx
312 mov ax,ds:word ptr[12345678h+eax*2]
315 mov ds:word pt
[all...]
/external/srec/srec/Semproc/include/
H A DSR_SemanticGraph.h56 * @param ilabels Input word labels to be used when building the graph (The should be the same as
57 * the output word labels from the recognition graph/context.)
81 * Adds a word to the semantic graph at the specified slot. Tag may be defined or NULL.
85 * @param word Word to add.
86 * @param word Semantic Tag for the word.
87 * @param maybeMultiMeaning Indicates that we MAY be adding alternate multiple meanings a previously added word
89 ESR_ReturnCode(*addWordToSlot)(struct SR_SemanticGraph_t* self, const LCHAR* slot, const LCHAR* word, const LCHAR* tag, const ESR_BOOL maybeMultiMeaning);
/external/valgrind/main/exp-bbv/tests/arm-linux/
H A Dmillion.S27 count: .word 333332
/external/webkit/Tools/DumpRenderTree/chromium/
H A DMockSpellCheck.h57 // position of the first invalid word to misspelledOffset, and the length of
58 // the first invalid word to misspelledLength, respectively.
65 void fillSuggestionList(const WebKit::WebString& word, Vector<WebKit::WebString>* suggestions);
/external/grub/stage2/
H A Dstart_eltorito.S285 .word 0 /* +2 Block count */
286 .word 0 /* +4 Offset of buffer */
287 .word 0 /* +6 Segment of buffer */
294 .word 16 /* Max sectors per transfer (32Kb) */
306 .word 0
307 .word 0
318 .word 0
320 .word (STAGE2_SIZE + ISO_SECTOR_SIZE - 1) >> ISO_SECTOR_BITS
324 .word (STAGE_ADDR + SECTOR_SIZE) >> 4
/external/netperf/
H A Dnetcpu_pstat.c65 long word[2]; member in union:overlay_u
77 overlay->word[0] = psp[i].psp_idlecycles.psc_hi;
78 overlay->word[1] = psp[i].psp_idlecycles.psc_lo;
145 long word[2]; member in union:overlay_u
148 overlay->word[0] = psp[j].psp_idlecycles.psc_hi;
149 overlay->word[1] = psp[j].psp_idlecycles.psc_lo;
181 long word[2]; member in union:overlay_u
184 overlay->word[0] = psp[j].psp_idlecycles.psc_hi;
185 overlay->word[1] = psp[j].psp_idlecycles.psc_lo;
/external/libffi/src/pa/
H A Dhpux32.S307 .word L$ECIE1-L$SCIE1 ;# Length of Common Information Entry
309 .word 0x0 ;# CIE Identifier Tag
321 .word L$EFDE1-L$ASFDE1 ;# FDE Length
323 .word L$ASFDE1-L$frame1 ;# FDE CIE offset
324 .word L$FB1 ;# FDE initial location
325 .word L$FE1-L$FB1 ;# FDE address range
328 .word L$CFI11-L$FB1
336 .word L$CFI12-L$CFI11
341 .word L$CFI13-L$CFI12
349 .word
[all...]
H A Dlinux.S296 .word .LECIE1-.LSCIE1 ;# Length of Common Information Entry
298 .word 0x0 ;# CIE Identifier Tag
310 .word .LEFDE1-.LASFDE1 ;# FDE Length
312 .word .LASFDE1-.Lframe1 ;# FDE CIE offset
313 .word .LFB1 ;# FDE initial location
314 .word .LFE1-.LFB1 ;# FDE address range
317 .word .LCFI11-.LFB1
325 .word .LCFI12-.LCFI11
330 .word .LCFI13-.LCFI12
338 .word
[all...]
/external/jpeg/
H A Djmemdosa.asm59 mov word ptr [bx],ax ; save the handle
88 mov bx,word ptr [bp+6] ; file handle
120 mov bx,word ptr [bp+6] ; file handle
121 mov dx,word ptr [bp+8] ; LS offset
122 mov cx,word ptr [bp+10] ; MS offset
154 mov bx,word ptr [bp+6] ; file handle
156 mov cx,word ptr [bp+12] ; number of bytes
160 cmp ax,word ptr [bp+12] ; make sure all bytes were read
192 mov bx,word ptr [bp+6] ; file handle
194 mov cx,word pt
[all...]
/external/qemu/distrib/jpeg-6b/
H A Djmemdosa.asm59 mov word ptr [bx],ax ; save the handle
88 mov bx,word ptr [bp+6] ; file handle
120 mov bx,word ptr [bp+6] ; file handle
121 mov dx,word ptr [bp+8] ; LS offset
122 mov cx,word ptr [bp+10] ; MS offset
154 mov bx,word ptr [bp+6] ; file handle
156 mov cx,word ptr [bp+12] ; number of bytes
160 cmp ax,word ptr [bp+12] ; make sure all bytes were read
192 mov bx,word ptr [bp+6] ; file handle
194 mov cx,word pt
[all...]
/external/chromium/chrome/browser/
H A Dspellcheck_host_impl.h20 // * Adding a word to the custom dictionary;
51 virtual void AddWord(const std::string& word);
91 void WriteWordToCustomDictionary(const std::string& word);

Completed in 529 milliseconds

1234567891011>>