| /frameworks/compile/slang/ |
| slang_rs_metadata_spec_encoder.cpp | 46 llvm::MDString *MDS = llvm::MDString::get(C, S);
48 if (MDS == NULL)
50 Op.push_back(MDS);
|
| /external/llvm/lib/VMCore/ |
| DebugInfo.cpp | 60 if (MDString *MDS = dyn_cast_or_null<MDString>(DbgNode->getOperand(Elt)))
61 return MDS->getString();
[all...] |
| AsmWriter.cpp | [all...] |
| /external/llvm/lib/Bitcode/Writer/ |
| BitcodeWriter.cpp | 599 } else if (const MDString *MDS = dyn_cast<MDString>(Vals[i].first)) {
613 Record.append(MDS->begin(), MDS->end());
677 SmallVector<std::pair<unsigned, MDNode*>, 4> MDs;
682 MDs.clear();
683 I->getAllMetadataOtherThanDebugLoc(MDs);
686 if (MDs.empty()) continue;
690 for (unsigned i = 0, e = MDs.size(); i != e; ++i) {
691 Record.push_back(MDs[i].first);
692 Record.push_back(VE.getValueID(MDs[i].second))
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| BitcodeWriter.cpp | 636 } else if (const MDString *MDS = dyn_cast<MDString>(Vals[i].first)) {
650 Record.append(MDS->begin(), MDS->end());
714 SmallVector<std::pair<unsigned, MDNode*>, 4> MDs;
719 MDs.clear();
720 I->getAllMetadataOtherThanDebugLoc(MDs);
723 if (MDs.empty()) continue;
727 for (unsigned i = 0, e = MDs.size(); i != e; ++i) {
728 Record.push_back(MDs[i].first);
729 Record.push_back(VE.getValueID(MDs[i].second))
[all...] |
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| BitcodeWriter.cpp | 590 } else if (const MDString *MDS = dyn_cast<MDString>(Vals[i].first)) {
604 Record.append(MDS->begin(), MDS->end());
668 SmallVector<std::pair<unsigned, MDNode*>, 4> MDs;
673 MDs.clear();
674 I->getAllMetadataOtherThanDebugLoc(MDs);
677 if (MDs.empty()) continue;
681 for (unsigned i = 0, e = MDs.size(); i != e; ++i) {
682 Record.push_back(MDs[i].first);
683 Record.push_back(VE.getValueID(MDs[i].second))
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineInstr.cpp | [all...] |
| /external/dropbear/libtomcrypt/src/ciphers/twofish/ |
| twofish.c | 45 /* The 4x4 MDS Linear Transform */
47 static const unsigned char MDS[4][4] = {
169 /* computes [y0 y1 y2 y3] = MDS . [x0] */
211 /* Computes [y0 y1 y2 y3] = MDS . [x0 x1 x2 x3] */
317 /* multiply g by a column of the MDS */
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 749 if (MDString* MDS = dyn_cast<MDString>(ProfMD->getOperand(0)))
750 return MDS->getString().equals("branch_weights");
760 if (MDString* MDS = dyn_cast<MDString>(ProfMD->getOperand(0))) {
761 if (MDS->getString().equals("branch_weights")) {
[all...] |
| /external/qemu/ |
| ppc-dis.c | 670 /* The MB or ME field in an MD or MDS form instruction. The high
688 /* The RA field in an D, DS, DQ, X, XO, M, or MDS form instruction. */
723 /* The RB field in an X, XO, M, or MDS form instruction. */
734 /* The RS field in a D, DS, X, XFX, XS, M, MD or MDS form
[all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 662 by the polynomials 5B and EF used in the MDS multiplication. As a result the code is faster and slightly larger. The
663 speed increase is useful when \textit{TWOFISH\_SMALL} is defined since the s-boxes and MDS multiply form the heart of the
[all...] |
