HomeSort by: relevance | last modified time | path
    Searched defs:Priority (Results 1 - 25 of 32) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/clang/include/clang/Driver/
Multilib.h 37 int Priority;
41 StringRef IncludeSuffix = {}, int Priority = 0);
81 /// Returns the multilib priority. When more than one multilib matches flags,
82 /// the one with the highest priority is selected, with 0 being the default.
83 int priority() const { return Priority; } function in class:clang::driver::Multilib
  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Inclusions/
IncludeStyle.h 40 /// Then split into groups based on category priority. See
59 /// The priority to assign to this category.
60 int Priority;
61 /// The custom priority to sort before grouping.
66 return Regex == Other.Regex && Priority == Other.Priority &&
92 /// ``IncludeBlocks = IBS_Regroup`` to define the priority in which
93 /// ``#includes`` should be ordered. The value of ``Priority`` defines the
95 /// of different priority. ``SortPriority`` is set to the value of
96 /// ``Priority`` as default if it is not assigned
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/Orc/
ExecutionUtils.h 56 Element(unsigned Priority, Function *Func, Value *Data)
57 : Priority(Priority), Func(Func), Data(Data) {}
59 unsigned Priority;
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
GCNMinRegStrategy.cpp 26 int Priority;
29 : SU(SU_), Priority(Priority_) {}
70 void bumpPredsPriority(const SUnit *SchedSU, int Priority);
71 void releaseSuccessors(const SUnit* SU, int Priority);
138 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });
177 void GCNMinRegScheduler::bumpPredsPriority(const SUnit *SchedSU, int Priority) {
202 << ")'s non-ready successors of " << Priority
203 << " priority in ready queue: ");
206 C.Priority = Priority
    [all...]
SIProgramInfo.h 29 uint32_t Priority = 0;
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyLowerGlobalDtors.cpp 79 // Collect the contents of @llvm.global_dtors, ordered by priority. Within a
80 // priority, sequences of destructors with the same associated object are
91 auto *Priority = dyn_cast<ConstantInt>(CS->getOperand(0));
92 if (!Priority)
94 uint16_t PriorityValue = Priority->getLimitedValue(UINT16_MAX);
140 // For each unique priority level and associated symbol, generate a function
144 uint16_t Priority = PriorityAndMore.first;
154 (Priority != UINT16_MAX ? (Twine(".") + Twine(Priority))
172 (Priority != UINT16_MAX ? (Twine(".") + Twine(Priority)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/
ExecutionUtils.cpp 73 auto *Priority = cast<ConstantInt>(CS->getOperand(0));
77 return Element(Priority->getZExtValue(), Func, Data);
135 CtorDtorsByPriority[CtorDtor.Priority].push_back(
  /src/external/apache2/llvm/dist/llvm/tools/bugpoint/
ExtractFunction.cpp 268 int Priority = CI ? CI->getSExtValue() : 0;
276 M1Tors.push_back(std::make_pair(F, Priority));
280 M2Tors.push_back(std::make_pair(F, Priority));
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGDeclCXX.cpp 570 static std::string getPrioritySuffix(unsigned int Priority) {
571 assert(Priority <= 65535 && "Priority should always be <= 65535.");
573 // Compute the function suffix from priority. Prepend with zeroes to make
575 std::string PrioritySuffix = llvm::utostr(Priority);
597 // Iterate over "chunks" of ctors with same priority and emit each chunk
598 // into separate function. Note - everything is sorted first by priority,
608 unsigned int Priority = I->first.priority;
610 FTy, "_GLOBAL__I_" + getPrioritySuffix(Priority), FI)
    [all...]
CGOpenMPRuntime.h 119 llvm::PointerIntPair<llvm::Value *, 1, bool> Priority;
CodeGenModule.h 107 unsigned int priority; member in struct:clang::CodeGen::OrderGlobalInitsOrStermFinalizers
110 : priority(p), lex_order(l) {}
113 return priority == RHS.priority && lex_order == RHS.lex_order;
117 return std::tie(priority, lex_order) <
118 std::tie(RHS.priority, RHS.lex_order);
290 Structor() : Priority(0), Initializer(nullptr), AssociatedData(nullptr) {}
291 Structor(int Priority, llvm::Constant *Initializer,
293 : Priority(Priority), Initializer(Initializer)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
AsmPrinter.h 408 /// Priority - init priority
412 int Priority = 0;
420 /// Priority.
423 /// @param[out] Structors Sorted Structor structs by Priority.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
MemProfiler.cpp 522 const uint64_t Priority = getCtorAndDtorPriority(TargetTriple);
523 appendToGlobalCtors(M, MemProfCtorFunction, Priority);
  /src/external/apache2/llvm/dist/clang/include/clang/Frontend/
ASTUnit.h 282 /// The priority given to this code-completion result.
283 unsigned Priority;
  /src/external/apache2/llvm/dist/clang/lib/Format/
Format.cpp 2180 int Priority;
2282 return std::tie(Includes[LHSI].Priority, LHSFilenameLower,
2284 std::tie(Includes[RHSI].Priority, RHSFilenameLower,
2289 return std::tie(Includes[LHSI].Priority, Includes[LHSI].Filename) <
2290 std::tie(Includes[RHSI].Priority, Includes[RHSI].Filename);
2411 int Priority = Categories.getSortIncludePriority(
2416 {IncludeName, Line, Prev, Category, Priority});
  /src/external/apache2/llvm/dist/llvm/include/llvm/BinaryFormat/
Minidump.h 223 support::ulittle32_t Priority;
Wasm.h 185 uint32_t Priority;
  /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/
WasmYAML.h 168 uint32_t Priority;
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
AsmWriterEmitter.cpp 822 int Priority = R->getValueAsInt("EmitPriority");
823 if (Priority < 1)
824 continue; // Aliases with priority 0 are never emitted.
828 std::make_pair(CodeGenInstAlias(R, Target), Priority));
  /src/external/apache2/llvm/dist/clang/lib/Frontend/
ASTUnit.cpp 396 CachedResult.Priority = R.Priority;
458 CachedResult.Priority = CCP_NestedNameSpecifier;
492 CachedResult.Priority = R.Priority;
2064 // Adjust priority based on similar type classes.
2065 unsigned Priority = C->Priority;
2069 Priority = getMacroUsagePriority(C->Completion->getTypedText(),
2084 Priority /= CCF_ExactTypeMatch
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/MC/
WasmObjectWriter.cpp 1149 encodeULEB128(StartFunc.first, W->OS); // priority
1816 uint16_t Priority = UINT16_MAX;
1821 ".init_array section priority should start with '.'");
1822 if (WS.getName().substr(PrefixLength + 1).getAsInteger(10, Priority))
1823 report_fatal_error("invalid .init_array section priority");
1847 std::make_pair(Priority, TargetSym.getIndex()));
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp 2497 /// A helper class for sorting ExplodedNodes by priority.
2570 unsigned Priority = 0;
2578 std::tie(PriorityEntry, IsNew) = PriorityMap.insert({Node, Priority});
2579 ++Priority;
2582 assert(PriorityEntry->second <= Priority);
  /src/sys/arch/ibmnws/include/
pnp.h 209 #define S6_Packet 0x30 /* Depend funct start (w/o priority) */
210 #define S6_Packet_priority 0x31 /* Depend funct start (w/ priority) */
233 #define SUBOPTIMAL_CONFIGURATION 0x2 /* Priority byte sub optimal config */
543 unsigned char Priority; /* Optional; if missing then x01; else*/
  /src/sys/arch/prep/include/
pnp.h 209 #define S6_Packet 0x30 /* Depend funct start (w/o priority) */
210 #define S6_Packet_priority 0x31 /* Depend funct start (w/ priority) */
233 #define SUBOPTIMAL_CONFIGURATION 0x2 /* Priority byte sub optimal config */
568 unsigned char Priority; /* Optional; if missing then x01; else*/
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
OpenMPClause.h 5872 /// This represents 'priority' clause in the '#pragma omp ...'
5876 /// #pragma omp task priority(n)
5878 /// In this example directive '#pragma omp teams' has clause 'priority' with
5886 /// Priority number.
5887 Stmt *Priority = nullptr;
5889 /// Set the Priority number.
5891 /// \param E Priority number.
5892 void setPriority(Expr *E) { Priority = E; }
5895 /// Build 'priority' clause.
5897 /// \param Priority Expression associated with this clause
    [all...]

Completed in 60 milliseconds

1 2