HomeSort by relevance Sort by last modified time
    Searched defs:MID (Results 1 - 6 of 6) sorted by null

  /external/llvm/lib/CodeGen/
DFAPacketizer.cpp 66 bool DFAPacketizer::canReserveResources(const llvm::MCInstrDesc *MID) {
67 unsigned InsnClass = MID->getSchedClass();
78 void DFAPacketizer::reserveResources(const llvm::MCInstrDesc *MID) {
79 unsigned InsnClass = MID->getSchedClass();
92 const llvm::MCInstrDesc &MID = MI->getDesc();
93 return canReserveResources(&MID);
99 const llvm::MCInstrDesc &MID = MI->getDesc();
100 reserveResources(&MID);
MachineLICM.cpp     [all...]
  /external/llvm/lib/AsmParser/
LLParser.cpp 601 unsigned MID = 0;
602 if (ParseMDNodeID(Result, MID)) return true;
609 ForwardRefMDNodes[MID] = std::make_pair(FwdNode, Lex.getLoc());
611 if (NumberedMetadata.size() <= MID)
612 NumberedMetadata.resize(MID+1);
613 NumberedMetadata[MID] = FwdNode;
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonInstrInfo.cpp 589 const MCInstrDesc &MID = MI->getDesc();
590 const uint64_t F = MID.TSFlags;
    [all...]
  /external/clang/lib/Frontend/
ASTUnit.cpp     [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
HashMapTest.java 512 int MID = 10000;
513 for (int i = 0; i < MID; i++) {
520 for (int i = MID; i < HI; i++) {

Completed in 218 milliseconds