| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaCodeComplete.cpp | 62 /// A container of code-completion results.
74 /// The actual results we have found.
75 std::vector<Result> Results;
120 // 1 -> 2 elements: create the vector of results and push in the
148 /// results.
151 /// The semantic analysis object for which results are being
161 /// results that are not desirable.
196 /// The completion context in which we are gathering results.
239 /// results.
245 /// Set the filter used for code-completion results
[all...] |
| CodeCompleteConsumer.cpp | 536 Sema &SemaRef, CodeCompletionContext Context, CodeCompletionResult *Results,
538 std::stable_sort(Results, Results + NumResults);
547 if (!Filter.empty() && isResultFilteredOut(Filter, Results[I]))
550 switch (Results[I].Kind) {
552 OS << *Results[I].Declaration;
555 if (Results[I].Hidden)
557 if (Results[I].InBaseClass)
559 if (Results[I].Availability ==
565 if (CodeCompletionString *CCS = Results[I].CreateCodeCompletionString
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeVectorOps.cpp | 77 /// Assuming the node is legal, "legalize" the results.
80 /// Make sure Results are legal and update the translation cache.
82 MutableArrayRef<SDValue> Results);
84 /// Wrapper to interface LowerOperation with a vector of Results.
86 /// returns true. If return is true and the Results are empty, then the
88 bool LowerOperationWrapper(SDNode *N, SmallVectorImpl<SDValue> &Results);
97 void Expand(SDNode *Node, SmallVectorImpl<SDValue> &Results);
101 void ExpandFP_TO_UINT(SDNode *Node, SmallVectorImpl<SDValue> &Results);
105 void ExpandUINT_TO_FLOAT(SDNode *Node, SmallVectorImpl<SDValue> &Results);
140 void ExpandFSUB(SDNode *Node, SmallVectorImpl<SDValue> &Results);
[all...] |
| LegalizeDAG.cpp | 142 SmallVectorImpl<SDValue> &Results);
153 SmallVectorImpl<SDValue> &Results);
154 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
155 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
165 SmallVectorImpl<SDValue> &Results);
175 SmallVectorImpl<SDValue> &Results);
177 SmallVectorImpl<SDValue> &Results);
1251 // FIXME: The handling for custom lowering with multiple results is
1646 SmallVectorImpl<SDValue> &Results) {
1680 Results.push_back(Tmp1)
[all...] |
| /src/sys/external/bsd/acpica/dist/dispatcher/ |
| dscontrol.c | 315 if ((ACPI_GET_DESCRIPTOR_TYPE (WalkState->Results->Results.ObjDesc[0]) ==
317 ((WalkState->Results->Results.ObjDesc [0])->Common.Type ==
319 ((WalkState->Results->Results.ObjDesc [0])->Reference.Class !=
323 &WalkState->Results->Results.ObjDesc [0], WalkState);
330 WalkState->ReturnDesc = WalkState->Results->Results.ObjDesc [0]
[all...] |
| dswstate.c | 90 State = WalkState->Results;
96 ACPI_ERROR ((AE_INFO, "No results on result stack"));
119 *Object = State->Results.ObjDesc [Index];
127 State->Results.ObjDesc [Index] = NULL;
195 State = WalkState->Results;
213 State->Results.ObjDesc [Index] = Object;
263 AcpiUtPushGenericState (&WalkState->Results, State);
269 ACPI_DEBUG_PRINT ((ACPI_DB_EXEC, "Results=%p State=%p\n",
300 if (WalkState->Results == NULL)
313 State = AcpiUtPopGenericState (&WalkState->Results);
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/libclang/ |
| CIndexCodeCompletion.cpp | 274 /// the code-completion results.
277 /// Allocator used to store globally cached code-completion results.
281 /// Allocator used to store code completion results.
312 unsigned clang_getCompletionNumFixIts(CXCodeCompleteResults *results,
314 AllocatedCXCodeCompleteResults *allocated_results = (AllocatedCXCodeCompleteResults *)results;
322 CXString clang_getCompletionFixIt(CXCodeCompleteResults *results,
326 AllocatedCXCodeCompleteResults *allocated_results = (AllocatedCXCodeCompleteResults *)results;
369 fprintf(stderr, "+++ %u completion results\n",
374 delete [] Results;
380 fprintf(stderr, "--- %u completion results\n"
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ |
| AllTUsExecution.cpp | 38 Results.addResult(Key, Value);
43 return Results.AllKVResults();
48 Results.forEachResult(Callback);
52 InMemoryToolResults Results;
67 : Compilations(Compilations), Results(new ThreadSafeToolResults),
68 Context(Results.get()), ThreadCount(ThreadCount) {}
75 Results(new ThreadSafeToolResults), Context(Results.get()),
173 "Tool results are stored in memory.");
|
| StandaloneExecution.cpp | 36 Context(&Results), ArgsAdjuster(getDefaultArgumentsAdjusters()) {
48 Context(&Results), ArgsAdjuster(getDefaultArgumentsAdjusters()) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyMachineFunctionInfo.cpp | 54 SmallVectorImpl<MVT> &Results) {
55 computeLegalValueVTs(ContextFunc, TM, Ty->getReturnType(), Results);
58 if (Results.size() > 1 &&
64 Results.clear();
100 llvm::signatureFromMVTs(const SmallVectorImpl<MVT> &Results,
103 valTypesFromMVTs(Results, Sig->Returns);
117 Results.push_back(EVT(VT).getEVTString());
146 for (auto VT : YamlMFI.Results)
|
| WebAssemblyMachineFunctionInfo.h | 37 std::vector<MVT> Results;
84 void addResult(MVT VT) { Results.push_back(VT); }
85 const std::vector<MVT> &getResults() const { return Results; }
89 Results.clear();
177 SmallVectorImpl<MVT> &Results);
183 signatureFromMVTs(const SmallVectorImpl<MVT> &Results,
192 std::vector<FlowStringValue> Results;
208 YamlIO.mapOptional("results", MFI.Results, std::vector<FlowStringValue>());
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAGHVX.cpp | 614 // Support for building selection results (output instructions that are
838 void materialize(const ResultStack &Results);
846 OpRef concat(OpRef Va, OpRef Vb, ResultStack &Results);
847 OpRef packs(ShuffleMask SM, OpRef Va, OpRef Vb, ResultStack &Results,
849 OpRef packp(ShuffleMask SM, OpRef Va, OpRef Vb, ResultStack &Results,
852 ResultStack &Results);
854 ResultStack &Results);
856 OpRef shuffs1(ShuffleMask SM, OpRef Va, ResultStack &Results);
857 OpRef shuffs2(ShuffleMask SM, OpRef Va, OpRef Vb, ResultStack &Results);
858 OpRef shuffp1(ShuffleMask SM, OpRef Va, ResultStack &Results);
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/test/ |
| user_counters_test.cc | 40 void CheckSimple(Results const& e) {
79 void CheckBytesAndItemsPSec(Results const& e) {
114 void CheckRate(Results const& e) {
145 void CheckThreads(Results const& e) {
175 void CheckAvgThreads(Results const& e) {
206 void CheckAvgThreadsRate(Results const& e) {
|
| output_test.h | 64 // ------------------------- Results checking ------------------------------ //
67 // Call this macro to register a benchmark for checking its results. This
69 // results of a benchmark. This is done only after verifying that the output
78 struct Results;
79 typedef std::function< void(Results const&) > ResultsCheckFn;
83 // Class holding the results of a benchmark.
85 struct Results {
92 Results(const std::string& n) : name(n) {}
136 T Results::GetAs(const char* entry_name) const {
|
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ |
| Execution.h | 17 // `ToolResults` is an interface that abstracts how results are stored e.g.
44 /// Results should be string key-value pairs. For example, a refactoring tool
56 /// Stores the key-value results in memory. It maintains the lifetime of
58 /// set of different results, or a large set of duplicated results.
76 /// compilation and results.
81 /// Initializes a context. This does not take ownership of `Results`.
82 explicit ExecutionContext(ToolResults *Results) : Results(Results) {}
[all...] |
| AllTUsExecution.h | 10 // compilation database. Tool results are deuplicated by the result key.
56 ToolResults *getToolResults() override { return Results.get(); }
66 std::unique_ptr<ToolResults> Results;
|
| StandaloneExecution.h | 69 ToolResults *getToolResults() override { return &Results; }
91 InMemoryToolResults Results;
|
| /src/sys/external/bsd/gnu-efi/dist/inc/ia64/ |
| efilibplat.h | 69 OUT rArg *Results OPTIONAL
78 OUT rArg *Results OPTIONAL
|
| /src/sys/external/bsd/gnu-efi/dist/lib/ia64/ |
| salpal.c | 280 OUT rArg *Results OPTIONAL
290 if (Results) {
291 CopyMem (Results, &ReturnValue, sizeof(rArg));
301 OUT rArg *Results OPTIONAL
314 if (Results)
315 CopyMem (Results, &ReturnValue, sizeof(rArg));
332 if (Results)
333 CopyMem (Results, &ReturnValue, sizeof(rArg));
|
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/test/ |
| user_counters_test.cc | 47 void CheckSimple(Results const& e) {
91 void CheckBytesAndItemsPSec(Results const& e) {
130 void CheckRate(Results const& e) {
167 void CheckThreads(Results const& e) {
203 void CheckAvgThreads(Results const& e) {
240 void CheckAvgThreadsRate(Results const& e) {
276 void CheckIterationInvariant(Results const& e) {
317 void CheckIsIterationInvariantRate(Results const& e) {
356 void CheckAvgIterations(Results const& e) {
394 void CheckAvgIterationsRate(Results const& e)
[all...] |
| output_test.h | 71 // ------------------------- Results checking ------------------------------ //
74 // Call this macro to register a benchmark for checking its results. This
76 // results of a benchmark. This is done only after verifying that the output
85 struct Results;
86 typedef std::function<void(Results const&)> ResultsCheckFn;
90 // Class holding the results of a benchmark.
92 struct Results {
98 Results(const std::string& n) : name(n) {}
144 T Results::GetAs(const char* entry_name) const {
|
| user_counters_tabular_test.cc | 91 void CheckTabular(Results const& e) {
139 void CheckTabularRate(Results const& e) {
183 void CheckSet0(Results const& e) {
218 void CheckSet1(Results const& e) {
257 void CheckSet2(Results const& e) {
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-account.cpp | 104 static cl::opt<int> AccountTop("top", cl::desc("only show the top N results"),
302 static void sortByKey(std::vector<TupleType> &Results, F Fn) {
304 llvm::sort(Results, [=](const TupleType &L, const TupleType &R) {
311 std::vector<TupleType> Results;
312 Results.reserve(FunctionLatencies.size());
316 Results.emplace_back(FuncId, Timings.size(), getStats(Timings));
317 auto &Row = std::get<2>(Results.back());
335 sortByKey(Results, [](const TupleType &X) { return std::get<0>(X); });
338 sortByKey(Results, [](const TupleType &X) { return std::get<1>(X); });
341 sortByKey(Results, [](const TupleType &X) { return std::get<2>(X).Min; })
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| Lookup.h | 39 /// Represents the results of name lookup.
41 /// An instance of the LookupResult class captures the results of a
45 /// results occurred for a given lookup.
70 /// Name lookup results in an ambiguity; use
77 /// Name lookup results in an ambiguity because multiple
91 /// Name lookup results in an ambiguity because multiple
105 /// Name lookup results in an ambiguity because multiple definitions
120 /// Name lookup results in an ambiguity because an entity with a
138 /// A little identifier for flagging temporary lookup results.
312 /// Determines if the results are overloaded
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/ |
| SerialSnippetGenerator.cpp | 164 std::vector<CodeTemplate> Results;
170 EC.Description, Results);
171 if (!Results.empty())
174 if (Results.empty())
177 return std::move(Results);
|
