/external/zlib/contrib/iostream2/ |
zstream.h | 44 size_t value() const { return val.word; } 46 struct Val { unsigned char byte; size_t word; } val; member in struct:zstringlen::Val 131 if (val.byte == 255) zs > val.word; 132 else val.word = val.byte; 278 val.byte = 255; val.word = ::strlen(x); 279 if (val.word < 255) zs < (val.byte = val.word);
|
/external/dbus/dbus/ |
dbus-shell.c | 332 * word and it always splits on spaces, not on IFS even 358 * 4) "If the previous character was part of a word, the current 359 * character will be appended to that word." 370 * 6) "The current character will be used as the start of a new word." 373 * - for each token (word), perform portions of word expansion, namely 378 * "If the complete expansion appropriate for a word results in an 381 * original word contained single-quote or double-quote characters." 646 * expansions, we would have to do field splitting on each word 653 * empty word removal, since we know there was no way to introduc [all...] |
/dalvik/vm/mterp/x86/ |
header.S | 59 rOPCODE bl opcode portion of instruction word 60 rINST_HI bh high byte of instruction word, usually contains src/tgt reg names 150 * Fetch the nth instruction word from rPC into rINST. Does not advance 156 * Fetch instruction word indexed (used for branching). 157 * Index is in instruction word units.
|
/external/bluetooth/glib/docs/reference/gobject/ |
glib-mkenums.1 | 152 The enum name with words lowercase and word\-separated by underscores (e\&.g\&. prefix_the_xenum)\&. 157 The enum name with words uppercase and word\-separated by underscores (e\&.g\&. PREFIX_THE_XENUM)\&. 162 The enum name with words uppercase and word\-separated by underscores, prefix stripped (e\&.g\&. THE_XENUM)\&. 167 The enum value name currently being processed with words uppercase and word\-separated by underscores, this is the assumed literal notation of enum values in the C sources (e\&.g\&. PREFIX_THE_XVALUE)\&. 203 >*/\&. Per enum definition, the options "skip" and "flags" can be specified, to indicate this enum definition to be skipped, or for it to be treated as a flags definition, or to specify the common prefix to be stripped from all values to generate value nicknames, respectively\&. The "lowercase_name" option can be used to specify the word separation used in the *_get_type() function\&. For instance, /*< lowercase_name=gnome_vfs_uri_hide_options >*/\&.
|
glib-mkenums.xml | 161 The enum name with words lowercase and word-separated by underscores 169 The enum name with words uppercase and word-separated by underscores 177 The enum name with words uppercase and word-separated by underscores, 186 word-separated by underscores, 242 option can be used to specify the word separation used in the *_get_type()
|
/external/icu4c/common/ |
unormimp.h | 155 * preceded by a 16-bit word with the leading and trailing cc 573 * The norm32Table contains one 32-bit word "norm32" per code point. 630 * is preceded by a 16-bit word that contains the 633 * decomposition string, not counting the cc word. 672 * The first word of a list entry is the back-index, with its bit 15 set if 675 * The second word contains flags in bits 15..13 that determine 676 * if there is a third word and how the combined character is encoded: 677 * 15 set if there is a third word in this list entry 681 * According to these bits 15..14 of the second word, 684 * the second word [all...] |
/external/icu4c/data/brkitr/ |
word.txt | 5 # file: word.txt 7 # ICU Word Break Rules 11 # Note: Updates to word.txt will usually need to be merged into 79 # begins with a group of Format chars, or with a "word" consisting of a single 80 # char that is not in any of the listed word break categories followed by
|
/external/openssl/crypto/camellia/ |
cmll_locl.h | 123 #define SWAP4WORD(word) \ 126 CAMELLIA_SWAP4((word)[0]); \ 127 CAMELLIA_SWAP4((word)[1]); \ 128 CAMELLIA_SWAP4((word)[2]); \ 129 CAMELLIA_SWAP4((word)[3]); \
|
/external/v8/src/ |
dateparser.h | 88 // Read a word (sequence of chars. >= 'A'), fill the given buffer with a 90 // Return word length. 147 // Look up a word in the keyword table and return an index. 148 // 'pre' contains a prefix of the word, zero-padded to size kPrefixLength 149 // and 'len' is the word length.
|
/external/v8/src/ia32/ |
regexp-macro-assembler-ia32.h | 179 // stack pointer (ecx) by a word size and stores the register's value there. 183 // by a word size and stores the value there. 186 // Pops a value from the backtrack stack. Reads the word at the stack pointer 187 // (ecx) and increments it by a word size. 192 // etc., not pushed. The argument count assumes all arguments are word sized.
|
/external/ppp/pppd/ |
auth.c | 126 #define ISWILD(word) (word[0] == '*' && word[1] == 0) 497 wp->word = (char *) (wp + 1); 499 BCOPY(addr, wp->word, l); 519 wp->word = (char *) (wp + 1); 521 BCOPY(number, wp->word, l); 2324 char word[MAXWORDLEN]; local [all...] |
/system/core/sh/ |
sh.1 | 366 Whenever a reserved word may occur (see above), 368 checks the word to see if it matches an alias. 393 word of the line (or after a control operator) is not a reserved word, 411 and the first remaining word is considered the command name and the 601 If the reserved word ! does not precede the pipeline, the exit status is 689 The until command is similar, but has the word 695 for variable in word ... 701 variable set to each word in turn. 719 case word i [all...] |
/external/webkit/WebCore/icu/unicode/ |
ubrk.h | 48 * Word boundary analysis is used by search and replace functions, as 50 * select words with a double click. Word selection provides correct 52 * words. Characters that are not part of a word, such as symbols or 53 * punctuation marks, have word-breaks on both sides. 164 * //print each word in order 176 * //print word at charpos 10 190 /** Word breaks @stable ICU 2.0 */ 202 * please use Word Boundary iterator. 204 * @deprecated ICU 2.8 Use the word break iterator for titlecasing for Unicode 4 and later. 218 * Enum constants for the word break tags returned b [all...] |
/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
OpenWnnDictionaryImplJni.java | 215 * Search a word from dictionaries. 232 * Retrieve a word information. 233 * A word information is stored to the internal work area. To retrieve a detail information, 244 * Retrieve the key string from the current word information. 253 * Retrieve the candidate string from the current word information. 262 * Retrieve the frequency from the current word information. 271 * Retrieve the part of speech at left side from the current word information. 279 * Retrieve the part of speech at right side from the current word information. 328 * Clear the current word information. 335 * Set the part of speech at left side to the current word information [all...] |
/external/srec/srec/crec/ |
srec_context.c | 226 /* after all word additions, we need to "prepare" the context */ 369 wordID wordmap_add_word(wordmap* wmap, const char* word); 374 char *word, *wID_string; local 384 word = strtok(buf, " \n\r\t"); 385 num_chars += strlen(word); 399 word = strtok(buf, " \n\r\t"); 403 // if(strstr(word,SLOTNAME_INDICATOR)) 404 // word = strstr(word,SLOTNAME_INDICATOR); 405 wm_wID = wordmap_add_word(wmap, word); [all...] |
/external/quake/quake/src/QW/client/ |
d_polysa.asm | 295 fldcw ds:word ptr[ceil_cw]
298 fldcw ds:word ptr[single_cw]
483 cmp dx,ds:word ptr[eax+ebp*2]
485 mov ds:word ptr[eax+ebp*2],dx
562 mov cx,ds:word ptr[_r_lstepx]
577 mov dx,ds:word ptr[24+esi]
585 cmp bp,ds:word ptr[ecx]
590 mov ds:word ptr[ecx],bp
602 cmp bp,ds:word ptr[2+ecx]
607 mov ds:word ptr[2+ecx],bp [all...] |
/external/webkit/WebCore/platform/graphics/win/ |
UniscribeController.cpp | 221 Vector<WORD> glyphs; 222 Vector<WORD> clusters; 312 // We special case spaces in two ways when applying word rounding. 326 // Handle justification and word-spacing. 341 // Account for word-spacing. 350 // We adjust the width of the last character of a "word" to ensure an integer width. 351 // Force characters that are used to determine word boundaries for the rounding hack 403 Vector<WORD>& glyphs, Vector<WORD>& clusters,
|
/external/webkit/WebKitTools/Scripts/ |
prepare-ChangeLog | 497 $_ = (join ':', map {s/.*[^[:word:]]//; scalar $_;} @components) . ':'; 500 s/.*[^[:word:]]//; 509 # A function name is the last word before an open parenthesis before the outer 531 my $word = ""; 657 while (m&((?:[[:word:]]+::)*operator(?:[ \t]*\(\)|[^()]*)|[[:word:]:~]+|[(){}:;])|\@(?:implementation|interface|protocol)\s+(\w+)[^{]*&g) { 666 $potential_name = $word unless $in_parentheses || $skip_til_brace_or_semicolon; 750 # Word. 751 $word = $1; 754 $potential_namespace = $word; [all...] |
/external/zlib/contrib/masm686/ |
match.asm | 110 chainlenwmask = 0 ; high word: current chain len
111 ; low word: s->wmask
169 ; It is then shifted into the high word, to make room for the wmask
227 movzx ebx, WORD PTR[edi]
229 movzx ebx, WORD PTR[eax+edi-1]
262 movzx ecx, WORD PTR[edi+ecx*2]
269 movzx eax, WORD PTR[esi+ecx-1]
274 movzx eax, WORD PTR[eax+ecx]
375 movzx ebx, WORD PTR[edi+eax-1]
|
/dalvik/vm/ |
Misc.c | 237 int word, bit; local 240 for (word = 0; word < pBits->storageSize; word++) { 241 if (pBits->storage[word] != 0xffffffff) { 243 * There are unallocated bits in this word. Return the first. 245 bit = ffs(~(pBits->storage[word])) -1; 247 pBits->storage[word] |= 1 << bit; 248 return (word << 5) | bit; 326 int word, bit local [all...] |
/external/srec/srec/Vocabulary/src/ |
VocabularyImpl.c | 288 /* check if I am at the last word or not */ 291 *_next = 0; /* replace split_char with '\0' the word */ 293 _next++; /* point to first char of next word */ 321 /* This function is used from multi-word phrases, such as "mike smith". We 323 of each word. We need to handle the cases of multiple prons for "mike" 398 For each word in a phrase (words separated by spaces) 400 if the complete word is in the dictionary 403 if the word contains '_', split the word into parts 433 LCHAR* curr; /* pointer to current word */ [all...] |
/external/grub/stage2/ |
asm.S | 341 .word 0 /* offset */ 342 .word 0 /* segment */ 598 int15_offset: .word 0 599 int15_segment: .word 0 703 int13_offset: .word 0 704 int13_segment: .word 0 1291 shrl $2, %eax /* Round up to the next word. */ 1787 .word 0 1789 .word 0 [all...] |
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
SHA1_MessageDigestImpl.java | 92 i = 0; // i contains number of beginning word for following loop 103 // - lastWord < 14 - two last, these are 14 & 15, words in 16 word frame are free; 105 // - lastWord = 14 - only one last, namely 15-th, word in frame doesn't contain bytes; 107 // - lastWord > 14 - last word in frame is not full; 116 buffer[15] = 0; // last word in frame is set to "0" 128 // converting 5-word frame into 20 bytes
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/digests/ |
MD4Digest.java | 82 int word, 86 out[outOff] = (byte)word; 87 out[outOff + 1] = (byte)(word >>> 8); 88 out[outOff + 2] = (byte)(word >>> 16); 89 out[outOff + 3] = (byte)(word >>> 24); 262 // reset the offset and clean out the word buffer.
|
MD5Digest.java | 78 int word, 82 out[outOff] = (byte)word; 83 out[outOff + 1] = (byte)(word >>> 8); 84 out[outOff + 2] = (byte)(word >>> 16); 85 out[outOff + 3] = (byte)(word >>> 24); 294 // reset the offset and clean out the word buffer.
|