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 524 unsigned MID = 0;
525 if (ParseUInt32(MID))
529 if (NumberedMetadata.count(MID)) {
530 Result = NumberedMetadata[MID];
535 auto &FwdRef = ForwardRefMDNodes[MID];
539 NumberedMetadata[MID].reset(Result);
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonInstrInfo.cpp 679 const MCInstrDesc &MID = MI->getDesc();
680 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 2678 milliseconds