HomeSort by relevance Sort by last modified time
    Searched defs:word (Results 1 - 25 of 284) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/CodeGen/
2010-07-14-overconservative-align.c 4 int word; member in struct:s
13 s->word = 0;
named_reg_global.c 16 } word; member in struct:p4_Thread
44 return (*p4TH).word.len;
  /external/deqp-deps/SPIRV-Tools/source/
parsed_operand.cpp 33 const uint32_t word = inst.words[operand.offset]; local
37 *out << int32_t(word);
40 *out << word; local
45 uint16_t(word & 0xFFFF));
48 *out << spvtools::utils::FloatProxy<float>(word);
55 // Multi-word numbers are presented with lower order words first.
57 uint64_t(word) | (uint64_t(inst.words[operand.offset + 1]) << 32);
  /external/epid-sdk/epid/member/tiny/math/unittests/internal/
onetimepad-test.cc 124 uint32_t word; local
125 EXPECT_EQ(0, OneTimePad::Generate(&word, 32, &otp));
126 EXPECT_NE(0, OneTimePad::Generate(&word, 32, &otp));
127 EXPECT_THROW(OneTimePad::Generate(&word, 32, &otp), std::runtime_error);
  /external/llvm/test/MC/ARM/
directive-literals.s 21 word: label
22 .word 3
24 @ CHECK-LABEL: word
  /external/swiftshader/third_party/SPIRV-Tools/source/
parsed_operand.cpp 33 const uint32_t word = inst.words[operand.offset]; local
37 *out << int32_t(word);
40 *out << word; local
45 uint16_t(word & 0xFFFF));
48 *out << spvtools::utils::FloatProxy<float>(word);
55 // Multi-word numbers are presented with lower order words first.
57 uint64_t(word) | (uint64_t(inst.words[operand.offset + 1]) << 32);
  /external/swiftshader/third_party/llvm-7.0/llvm/test/MC/ARM/
directive-literals.s 21 word: label
22 .word 3
24 @ CHECK-LABEL: word
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
cryptmodule.c 17 char *word, *salt; local
22 if (!PyArg_ParseTuple(args, "ss:crypt", &word, &salt)) {
27 return Py_BuildValue("s", crypt(word, salt));
32 "crypt(word, salt) -> string\n\
33 word will usually be a user's password. salt is a 2-character string\n\
  /external/deqp-deps/SPIRV-Tools/test/
opcode_make_test.cpp 20 // A sampling of word counts. Covers extreme points well, and all bit
35 uint32_t word = 0; local
36 word |= uint32_t(opcode);
37 word |= uint32_t(wordCount) << 16;
38 EXPECT_EQ(word, spvOpcodeMake(wordCount, SpvOp(opcode)));
opcode_split_test.cpp 21 uint32_t word = spvOpcodeMake(42, (SpvOp)23); local
24 spvOpcodeSplit(word, &wordCount, &opcode);
fix_word_test.cpp 27 uint32_t word = 0x53780921; local
28 ASSERT_EQ(word, spvFixWord(word, endian));
38 uint32_t word = 0x53780921; local
40 ASSERT_EQ(result, spvFixWord(word, endian));
  /external/python/cpython2/Modules/
cryptmodule.c 17 char *word, *salt; local
22 if (!PyArg_ParseTuple(args, "ss:crypt", &word, &salt)) {
27 return Py_BuildValue("s", crypt(word, salt));
32 "crypt(word, salt) -> string\n\
33 word will usually be a user's password. salt is a 2-character string\n\
  /external/python/cpython3/Modules/clinic/
_cryptmodule.c.h 6 "crypt($module, word, salt, /)\n"
9 "Hash a *word* with the given *salt* and return the hashed password.\n"
11 "*word* will usually be a user\'s password. *salt* (either a random 2 or 16\n"
14 "results for a given *word*.");
20 crypt_crypt_impl(PyObject *module, const char *word, const char *salt);
26 const char *word; local
30 &word, &salt)) {
33 return_value = crypt_crypt_impl(module, word, salt);
  /external/swiftshader/third_party/SPIRV-Tools/test/
opcode_make_test.cpp 20 // A sampling of word counts. Covers extreme points well, and all bit
35 uint32_t word = 0; local
36 word |= uint32_t(opcode);
37 word |= uint32_t(wordCount) << 16;
38 EXPECT_EQ(word, spvOpcodeMake(wordCount, SpvOp(opcode)));
opcode_split_test.cpp 21 uint32_t word = spvOpcodeMake(42, (SpvOp)23); local
24 spvOpcodeSplit(word, &wordCount, &opcode);
fix_word_test.cpp 27 uint32_t word = 0x53780921; local
28 ASSERT_EQ(word, spvFixWord(word, endian));
38 uint32_t word = 0x53780921; local
40 ASSERT_EQ(result, spvFixWord(word, endian));
  /device/google/contexthub/lib/nanohub/
softcrc.c 45 uint32_t word; local
48 // word by word crc32
54 // zero pad last word if required
56 for (i *= 4, word = 0; i < size; i++)
57 word |= (*data8++) << ((i & 0x3) * 8);
58 crc = crcOneWord(crc, word, 8);
  /device/google/contexthub/util/stm32_flash/
stm32f4_crc.c 48 uint32_t word; local
52 /* word by word crc32 */
57 /* zero pad last word if required */
59 for (i*=4, word=0; i<length; i++)
60 word |= buffer[i] << ((i & 0x3) * 8);
61 crc = crc32_word(crc, word);
  /external/libpng/contrib/mips-msa/
linux.c 33 char word[10]; local
44 word[i++] = ch;
48 int val = strcmp(string, word);
54 memset(word, 0, 10);
  /device/google/contexthub/firmware/lib/libc/
bcopy.c 40 * sizeof(word) MUST BE A POWER OF TWO
43 typedef int word; /* "word" used for optimal copy speed */ typedef
45 #define wsize sizeof(word)
104 TLOOP(*(word *)dst = *(word *)src; src += wsize; dst += wsize);
125 TLOOP(src -= wsize; dst -= wsize; *(word *)dst = *(word *)src);
  /external/freetype/src/gzip/
inftrees.h 26 } word; /* 16-bit, 8 bytes for 32-bit int's) */ member in struct:inflate_huft_s
  /external/ltp/testcases/kernel/controllers/freezer/
timed_forkbomb.c 57 char *word; local
58 while (scanf("%as", &word) < 1) {
60 free(word);
  /external/swiftshader/src/Pipeline/
SpirvShader.hpp 52 uint32_t word(uint32_t n) const function in class:sw::SpirvShader::InsnIterator
  /external/toybox/toys/other/
fmt.c 71 char *word = line+idx; local
73 // Measure this word (unicode width) and end
76 count = utf8len(word);
84 printf(" %s"+!(TT.pos!=TT.level), word);
  /external/v8/src/regexp/
regexp-macro-assembler-irregexp-inl.h 18 uint32_t word = ((twenty_four_bits << BYTECODE_SHIFT) | byte); local
23 *reinterpret_cast<uint32_t*>(buffer_.start() + pc_) = word;
28 void RegExpMacroAssemblerIrregexp::Emit16(uint32_t word) {
33 *reinterpret_cast<uint16_t*>(buffer_.start() + pc_) = word;
38 void RegExpMacroAssemblerIrregexp::Emit8(uint32_t word) {
43 *reinterpret_cast<unsigned char*>(buffer_.start() + pc_) = word;
48 void RegExpMacroAssemblerIrregexp::Emit32(uint32_t word) {
53 *reinterpret_cast<uint32_t*>(buffer_.start() + pc_) = word;

Completed in 1879 milliseconds

1 2 3 4 5 6 7 8 91011>>