HomeSort by: relevance | last modified time | path
    Searched refs:RU (Results 1 - 25 of 28) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
SummaryView.cpp 57 for (const std::pair<uint64_t, ResourceUsage> &RU : Desc.Resources) {
58 if (RU.second.size()) {
59 unsigned ProcResID = ResIdx2ProcResID[getResourceStateIndex(RU.first)];
60 ProcResourceUsage[ProcResID] += RU.second.size();
ResourcePressureView.cpp 184 const ResourceCycles &RU = R.value();
185 if (RU.getNumerator() == 0)
189 double Usage = RU / Executions;
  /src/external/apache2/llvm/dist/llvm/lib/Support/Unix/
Process.inc 60 struct rusage RU;
61 ::getrusage(RUSAGE_SELF, &RU);
62 return { toDuration(RU.ru_utime), toDuration(RU.ru_stime) };
  /src/external/apache2/llvm/dist/llvm/tools/verify-uselistorder/
verify-uselistorder.cpp 319 auto RU = R->use_begin(), RE = R->use_end();
321 skipUnmappedUsers(RU, RE, RM);
324 if (RU == RE) {
328 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) {
332 if (LU->getOperandNo() != RU->getOperandNo()) {
337 skipUnmappedUsers(++RU, RE, RM);
339 if (RU != RE) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineTraceMetrics.h 83 LiveRegUnit(unsigned RU) : RegUnit(RU) {}
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenRegisters.h 684 RegUnit &RU = RegUnits.back();
685 RU.Roots[0] = R0;
686 RU.Roots[1] = R1;
687 RU.Artificial = R0->Artificial;
689 RU.Artificial |= R1->Artificial;
SubtargetEmitter.cpp 632 Record *const RU =
634 for (unsigned J = 0; J < RU->getValueAsInt("NumUnits"); ++J) {
635 OS << " " << ProcModel.getProcResourceIdx(RU) << ", ";
791 for (Record *RU : ResUnits) {
792 NumUnits += RU->getValueAsInt("NumUnits");
793 SubUnitsOffset += RU->getValueAsInt("NumUnits");
RegisterInfoEmitter.cpp 250 const RegUnit &RU = RegBank.getRegUnit(UnitIdx);
251 assert(RU.Weight < 256 && "RegUnit too heavy");
252 OS << RU.Weight << ", ";
CodeGenRegisters.cpp 1089 const RegUnit &RU = RegBank.getRegUnit(*UnitI);
1090 if (!RU.Artificial)
2072 for (unsigned RU : RegUnits) {
2073 if (SUI == RU) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
BitTracker.cpp 825 RegisterRef RU = PI.getOperand(i);
826 RegisterCell ResC = ME.getCell(RU, Map);
828 dbgs() << " input reg: " << printReg(RU.Reg, &ME.TRI, RU.Sub)
857 RegisterRef RU(MO);
858 dbgs() << " input reg: " << printReg(RU.Reg, &ME.TRI, RU.Sub)
859 << " cell: " << ME.getCell(RU, Map) << "\n";
HexagonVectorLoopCarriedReuse.cpp 157 raw_ostream &operator<<(raw_ostream &OS, const ReuseValue &RU) {
159 OS << "Instruction to Replace: " << *(RU.Inst2Replace) << "\n";
160 OS << "Backedge Instruction: " << *(RU.BackedgeInst) << "\n";
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegisterScavenging.cpp 123 for (unsigned RU = 0, RUEnd = TRI->getNumRegUnits(); RU != RUEnd; ++RU) {
124 for (MCRegUnitRootIterator RURI(RU, TRI); RURI.isValid(); ++RURI) {
126 TmpRegUnits.set(RU);
LiveIntervals.cpp 706 SmallVector<std::pair<const LiveRange*, LiveRange::const_iterator>, 8> RU;
718 RU.clear();
724 RU.push_back(std::make_pair(&RURange, RURange.find(LI.begin()->end)));
745 for (auto &RUP : RU) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/MC/
MCRegisterInfo.h 687 unsigned RU = MCRI->get(Reg).RegUnits;
688 unsigned Scale = RU & 15;
689 unsigned Offset = RU >> 4;
  /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/
ValueEnumerator.cpp 218 const Use *RU = R.first;
219 if (LU == RU)
223 auto RID = OM.lookup(RU->getUser()).first;
252 return LU->getOperandNo() < RU->getOperandNo();
253 return LU->getOperandNo() > RU->getOperandNo();
  /src/sys/net/
if_llatbl.h 131 LLE_LOCK_TRACE(RU, (lle)); \
  /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/
MUTTUCData.txt 226 E90E;DEVANAGARI RU LIGATURE;Lo;0;L;;;;;N;;;;;
  /src/external/gpl3/gcc/dist/gcc/cp/
module.cc 6572 #define RU(X) ((X) = u ())
6601 RU (t->type_common.precision);
6602 RU (t->type_common.contains_placeholder_bits);
6604 RU (t->type_common.align);
6619 RU (t->decl_common.off_align);
6620 RU (t->decl_common.align);
6761 RU (t->label_decl.label_decl_uid);
6762 RU (t->label_decl.eh_landing_pad_nr);
6859 RU (t->omp_clause.subcode.map_kind);
6947 RU (((lang_tree_node *)t)->lambda_expression.discriminator_scope)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/cp/
module.cc 6338 #define RU(X) ((X) = u ())
6367 RU (t->type_common.precision);
6368 RU (t->type_common.contains_placeholder_bits);
6370 RU (t->type_common.align);
6385 RU (t->decl_common.off_align);
6386 RU (t->decl_common.align);
6520 RU (t->label_decl.label_decl_uid);
6521 RU (t->label_decl.eh_landing_pad_nr);
6595 RU (t->omp_clause.subcode.map_kind);
6681 RU (((lang_tree_node *)t)->lambda_expression.discriminator)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
AsmWriter.cpp 211 const Use *RU = R.first;
212 if (LU == RU)
216 auto RID = OM.lookup(RU->getUser()).first;
236 return LU->getOperandNo() < RU->getOperandNo();
237 return LU->getOperandNo() > RU->getOperandNo();
  /src/external/gpl3/gdb.old/dist/gdb/
ada-lang.c 6730 ULONGEST RU;
6738 RU = 0;
6741 RU = RU * 10 + (str[k] - '0');
6748 *R = (-(LONGEST) (RU - 1)) - 1;
6752 *R = (LONGEST) RU;
6755 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6757 in most implementations). When RU>0, the locution in the then branc
    [all...]
  /src/external/gpl3/gdb/dist/gdb/
ada-lang.c 6729 ULONGEST RU;
6737 RU = 0;
6740 RU = RU * 10 + (str[k] - '0');
6747 *R = (-(LONGEST) (RU - 1)) - 1;
6751 *R = (LONGEST) RU;
6754 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6756 in most implementations). When RU>0, the locution in the then branc
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 6511 RegisterUsage RU;
6673 RU.LoopInvariantRegs = Invariant;
6674 RU.MaxLocalUsers = MaxUsages[i];
6675 RUs[i] = RU;
  /src/crypto/external/apache2/openssl/dist/test/recipes/30-test_evp_data/
evppkey_ecdh.txt 3457 4ZWt/RU/ktdJCDUbL4xO2pTtsJFtG1PAILXuyu0aX8OKIz5IMFh7su40ibO0KlqG
  /src/crypto/external/bsd/openssl/dist/test/recipes/30-test_evp_data/
evppkey_ecdh.txt 3441 4ZWt/RU/ktdJCDUbL4xO2pTtsJFtG1PAILXuyu0aX8OKIz5IMFh7su40ibO0KlqG

Completed in 145 milliseconds

1 2