Home
last modified time | relevance | path

Searched refs:word_length (Results 1 – 5 of 5) sorted by relevance

/external/srtp/crypto/math/
Ddatatypes.c485 const int word_length = x->length >> 5; in bitvector_left_shift() local
493 for (i=0; i < word_length - base_index; i++) in bitvector_left_shift()
496 for (i=0; i < word_length - base_index - 1; i++) in bitvector_left_shift()
499 x->word[word_length - base_index-1] = x->word[word_length-1] >> bit_index; in bitvector_left_shift()
503 for (i = word_length - base_index; i < word_length; i++) in bitvector_left_shift()
/external/llvm/test/CodeGen/X86/
D2008-03-10-RegAllocInfLoop.ll6 define x86_stdcallcc i32 @parse_backslash(i8** inreg %word, i32* inreg %word_length, i32* inreg …
11 …%tmp26 = call fastcc i8* @w_addchar( i8* null, i32* %word_length, i32* %max_length, i8 signext %t…
/external/google-breakpad/src/processor/
Dstackwalk_common.cc123 int word_length = 0; in PrintStackContents() local
126 word_length = 4; in PrintStackContents()
136 word_length = 8; in PrintStackContents()
148 word_length = 4; in PrintStackContents()
158 word_length = 8; in PrintStackContents()
170 if (!word_length || !stack_begin || !stack_end) in PrintStackContents()
177 if (word_length == 4) in PrintStackContents()
203 address += word_length) { in PrintStackContents()
207 if (word_length == 4) { in PrintStackContents()
225 if (word_length == 4) { in PrintStackContents()
Dminidump.cc333 size_t word_length = UTF16codeunits(utf16_data, max_word_length); in ConvertUTF16BufferToUTF8String() local
334 if (word_length > 0) { in ConvertUTF16BufferToUTF8String()
335 size_t byte_length = word_length * sizeof(utf16_data[0]); in ConvertUTF16BufferToUTF8String()
336 vector<uint16_t> utf16_vector(word_length); in ConvertUTF16BufferToUTF8String()
/external/srtp/googlepatches/
Dvidyo-3-srtp-ws.patch288 + const int word_length = x->length >> 5;
296 + for (i=0; i < word_length - base_index; i++)
299 + for (i=0; i < word_length - base_index - 1; i++)
302 + x->word[word_length - base_index-1] = x->word[word_length-1] >> bit_index;
306 + for (i = word_length - base_index; i < word_length; i++)