/external/srec/srec/crec/ |
astar.c | 56 The word graph is represented as an arc_token_list, 62 backward though the word graph (ie. forward through the reverse word graph) 67 arc_token* get_arc_for_word(arc_token* atoken, wordID word, 78 /* log_report("Warning: bad thing is happening word=%d\n", word); */ 87 return get_arc_for_word(&root_arc, word, context_void, terminal_word); 90 the word graph has nasty epsilons at the beginning, we'll remove 95 if (atoken->ilabel == word) 101 if (tmp->ilabel == word) [all...] |
priority_q.c | 115 are the same word (obviously ending at the same frame), and with the 116 same word history. This happens for a digit that has multiple end nodes 125 if (token1->word != token2->word) 133 history_for_token1 += word_token_array[token1->backtrace].word * 10000; 140 history_for_token2 += word_token_array[token2->backtrace].word * 10000; 182 /*adds a word token to the priority_q. Returns the index of the word to 208 printf("WORDADD PQ token %d word %d cost %d\n", token_index, token->word, token->cost) [all...] |
/external/kernel-headers/original/asm-x86/ |
bitops_32.h | 38 * restricted to acting on a single-word quantity. 112 * modify other bits in the word. 151 * restricted to acting on a single-word quantity. 357 * __ffs - find first bit in word. 358 * @word: The word to search 362 static inline unsigned long __ffs(unsigned long word) 365 :"=r" (word) 366 :"rm" (word)); 367 return word; [all...] |
/external/opencore/codecs_v2/video/m4v_h263/enc/src/ |
bitstream_io.cpp | 20 /* Change the bitstream parsing algorithm. Use temporary word of 2 or 4 bytes */ 68 stream->word = 0; 125 stream->word <<= Length; 126 stream->word |= Value; /* assuming Value is not larger than Length */ 133 stream->word <<= stream->bitLeft; 135 stream->word |= ((UInt)Value >> Length); 145 stream->word = Value; 199 /* Purpose : save written word into the bitstream buffer. */ 209 UInt word; local 222 word = stream->word 259 UInt word, shift; local 583 UInt word; local [all...] |
/external/icu4c/test/cintltst/ |
cbiapts.c | 135 UBreakIterator *word, *sentence, *line, *character, *b, *bogus; local 153 word = ubrk_open(UBRK_WORD, "en_US", text, u_strlen(text), &status); 158 log_err_status(status, "FAIL: Error in ubrk_open() for word breakiterator: %s\n", myErrorName(status)); 161 log_verbose("PASS: Successfully opened word breakiterator\n"); 225 log_verbose("\nTesting the functions for word\n"); 226 start = ubrk_first(word); 228 log_err("error ubrk_start(word) did not return 0\n"); 229 log_verbose("first (word = %d\n", (int32_t)start); 230 pos=ubrk_next(word); 232 log_err("error ubrk_next(word) did not return 4\n") [all...] |
/external/srec/seti/sltsEngine/src/ |
run_seq_lts.c | 93 SWIsltsResult lts_for_word(LTS *lts, char *word, int word_len, char **output_phone_string, int max_phone_length, int *num_out); 1008 unsigned char word[MAX_WORD_LEN]; local 1060 if (dp->properties[ Left1+j] == LTS_MAXCHAR) { /*assume an unknown character is a word boundary*/ 1079 if (dp->properties[ Right1+j] == LTS_MAXCHAR) { /*assume an unknown character is a word boundary*/ 1091 /*pfprintf(PSTDOUT,"word stuff\n"); */ 1093 /*find word start and end - use unknown character as word boundaries*/ 1102 word[i] = find_letter_index(input_word[i], lm); 1105 /*figure out syllable in word - not really syllables - just looks to see if is or at first or last vowel*/ 1110 if (lm->type[word[i]] == 1) 1677 char word[MAX_WORD_LEN]; local [all...] |
/external/srec/srec/include/ |
srec.h | 50 wordID word; /* alternative word, diff from path b.p. */ member in struct:altword_token_t 69 wtokenID word_backtrace[MAX_HMM]; /* index into word tokens*/ 70 wordID word[MAX_HMM]; /* when the path encounters an output member in struct:fsmarc_token_t 89 wtokenID word_backtrace; /* index into word tokens*/ 90 wordID word; /* when the path encounters an output*/ member in struct:fsmnode_token_t 104 wordID word; /* the word just observed */ member in struct:word_token_t 105 frameID end_time; /* end time of the word just observed, includes trailing silence */ 106 nodeID end_node; /* for backtrace with word graph * [all...] |
astar.h | 29 * Word Graph for Astar * 35 /* 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,
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
DTMStringPool.java | 143 String[] word={ local 162 for(i=0;i<word.length;++i) 164 int j=pool.stringToIndex(word[i]); 170 for(i=0;i<word.length;++i) 172 int j=pool.stringToIndex(word[i]); 178 for(i=0;i<word.length;++i) 181 if(!word[i].equals(w))
|
/development/samples/Wiktionary/src/com/example/android/wiktionary/ |
WordWidget.java | 40 * Define a simple widget that shows the Wiktionary "Word of the day." To build 68 * Regular expression that splits "Word of the day" entry into word 69 * name, word type, and the first description bullet point. 76 * "Word of the day." Will block until the online API returns. 93 // Try querying the Wiktionary API for today's word 122 // Didn't find word of day, so show error message
|
/external/e2fsprogs/misc/ |
ismounted.c | 55 char *word, *next; local 57 word = *buf; 58 if (*word == 0) 61 word = skip_over_blank(word); 62 next = skip_over_word(word); 66 return word;
|
/external/quake/quake/src/WinQuake/ |
mplib.cpp | 24 typedef unsigned short WORD;
88 WORD rtqLen; // Length of buffer, excluding preface
89 WORD rtqUpCtr; // Up Counter of bytes used so far
90 WORD rtqQCtr; // number of nodes attached
91 WORD padding; // DWORD alignment
97 WORD rtqFromDQ;
98 WORD rtqToDQ;
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/digests/ |
SHA224Digest.java | 10 * block word digest 81 int word, 85 out[outOff] = (byte)(word >>> 24); 86 out[outOff + 1] = (byte)(word >>> 16); 87 out[outOff + 2] = (byte)(word >>> 8); 88 out[outOff + 3] = (byte)word; 151 // expand 16 word block into 64 word blocks. 225 // reset the offset and clean out the word buffer.
|
SHA256Digest.java | 11 * block word digest 81 int word, 85 out[outOff] = (byte)(word >>> 24); 86 out[outOff + 1] = (byte)(word >>> 16); 87 out[outOff + 2] = (byte)(word >>> 8); 88 out[outOff + 3] = (byte)word; 154 // expand 16 word block into 64 word blocks. 227 // reset the offset and clean out the word buffer.
|
/external/netperf/ |
netcpu_pstat.c | 65 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/opencore/codecs_v2/audio/mp3/dec/src/asm/ |
pvmp3_dct_9_gcc.s | 176 .word 0x620dbe80 178 .word 0x163a1a80 180 .word 0x7847d900 182 .word 0x87b82700 184 .word 0xd438af00 186 .word 0xadb92280 188 .word 0x91261480 190 .word 0x81f1d200 192 .word 0x6ed9eb80
|
/external/openssl/crypto/bn/asm/ |
mo-586.pl | 292 $word="edi"; 297 &mov ($word,$_bp); 301 &sub ("edx",$word); # see if ap==bp 302 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num] 304 &mov ($word,&DWP(0,$word)); # bp[0] 312 &mul ($word); # ap[j]*bp[0] 322 &mul ($word); # ap[num-1]*bp[0] 323 &mov ($word,$_n0); 327 &imul ($word,&DWP($frame,"esp")); # n0*tp[0 [all...] |
/frameworks/base/media/libstagefright/codecs/mp3dec/src/asm/ |
pvmp3_dct_9_gcc.s | 176 .word 0x620dbe80 178 .word 0x163a1a80 180 .word 0x7847d900 182 .word 0x87b82700 184 .word 0xd438af00 186 .word 0xadb92280 188 .word 0x91261480 190 .word 0x81f1d200 192 .word 0x6ed9eb80
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
ExpandableDictionary.java | 120 public void addWord(String word, int frequency) { 121 addWordRec(mRoots, word, 0, frequency); 124 private void addWordRec(NodeArray children, final String word, 127 final int wordLength = word.length(); 128 final char c = word.charAt(depth); 146 // Terminate this word 155 addWordRec(childNode.children, word, depth + 1, frequency); 183 public synchronized boolean isValidWord(CharSequence word) { 189 final int freq = getWordFrequencyRec(mRoots, word, 0, word.length()) [all...] |
/bionic/libm/i387/ |
s_ceil.S | 45 fstcw -4(%ebp) /* store fpu control word */ 50 fldcw -8(%ebp) /* load modfied control word */ 55 fldcw -4(%ebp) /* restore original control word */
|
s_floor.S | 45 fstcw -4(%ebp) /* store fpu control word */ 50 fldcw -8(%ebp) /* load modfied control word */ 55 fldcw -4(%ebp) /* restore original control word */
|
/dalvik/vm/arch/arm/ |
HintsEABI.c | 30 * The class loader will associate with each method a 32-bit info word 31 * (jniArgInfo) to support JNI calls. The high order 4 bits of this word 51 * F - pad flag -- if set, write a pad word to the stack before copying
|
/dalvik/vm/mterp/x86-atom/ |
OP_DOUBLE_TO_INT.S | 45 fnstcw -2(%esp) # save control word 47 fldcw -2(%esp) # load control word 50 fldcw -2(%esp) # load saved control word
|
OP_FLOAT_TO_INT.S | 45 fnstcw -2(%esp) # save control word 47 fldcw -2(%esp) # load control word 50 fldcw -2(%esp) # load saved control word
|
/external/dropbear/libtommath/ |
bn_mp_mul_2d.c | 62 /* get the higher bits of the current word */ 65 /* shift the current word and OR in the carry */ 69 /* set the carry to the carry bits of the current word */
|