| /llvm-project/llvm/test/ExecutionEngine/JITLink/x86-64/ |
| H A D | LocalDependencyPropagation.s | 7 # Check that simplification eliminates dependencies on symbols in this unit,
8 # and correctly propagates dependencies on symbols outside the unit (including
15 # CHECK-NEXT: Initial dependencies:
16 # CHECK-DAG: Symbols: { _foo }, Dependencies: { (main, { _external_func }) }
17 # CHECK-DAG: Symbols: { _baz }, Dependencies: { (main, { _foo }) }
18 # CHECK: Simplified dependencies:
19 # CHECK-DAG: Symbols: { _foo }, Dependencies: { (main, { _external_func }) }
20 # CHECK-DAG: Symbols: { _baz }, Dependencies: { (main, { _external_func }) }
|
| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | DAGDeltaAlgorithm.h | 23 /// removing any single element not required by the dependencies on the other
26 /// The DAG should be used to represent dependencies in the changes which are
35 /// substantially fewer tests with appropriate dependencies. \see DeltaAlgorithm
53 /// \p Dependencies edges by executing \see ExecuteOneTest() on subsets of
55 /// predicate and the input \p Dependencies.
59 /// \param Dependencies The list of dependencies amongst changes. For each
60 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
63 /// dependencies.
65 const std::vector<edge_ty> &Dependencies);
|
| /llvm-project/lldb/tools/lldb-dap/ |
| H A D | package-lock.json | 28 "dependencies": { object
41 "dependencies": { object
65 "dependencies": { object
78 "dependencies": { object
90 "dependencies": { object
120 "dependencies": { object
146 "dependencies": { object
160 "dependencies": { object
181 "dependencies": { object
195 "dependencies" object
233 "dependencies": { global() object
243 "dependencies": { global() object
258 "dependencies": { global() object
295 "dependencies": { global() object
313 "dependencies": { global() object
351 "dependencies": { global() object
368 "dependencies": { global() object
393 "dependencies": { global() object
412 "dependencies": { global() object
426 "dependencies": { global() object
440 "dependencies": { global() object
461 "dependencies": { global() object
485 "dependencies": { global() object
515 "dependencies": { global() object
543 "dependencies": { global() object
561 "dependencies": { global() object
586 "dependencies": { global() object
610 "dependencies": { global() object
636 "dependencies": { global() object
651 "dependencies": { global() object
666 "dependencies": { global() object
706 "dependencies": { global() object
737 "dependencies": { global() object
759 "dependencies": { global() object
788 "dependencies": { global() object
809 "dependencies": { global() object
845 "dependencies": { global() object
857 "dependencies": { global() object
876 "dependencies": { global() object
909 "dependencies": { global() object
958 "dependencies": { global() object
977 "dependencies": { global() object
986 "dependencies": { global() object
998 "dependencies": { global() object
1054 "dependencies": { global() object
1103 "dependencies": { global() object
1122 "dependencies": { global() object
1143 "dependencies": { global() object
1152 "dependencies": { global() object
1170 "dependencies": { global() object
1182 "dependencies": { global() object
1211 "dependencies": { global() object
1252 "dependencies": { global() object
1269 "dependencies": { global() object
1279 "dependencies": { global() object
1295 "dependencies": { global() object
1310 "dependencies": { global() object
1323 "dependencies": { global() object
1337 "dependencies": { global() object
1379 "dependencies": { global() object
1394 "dependencies": { global() object
1409 "dependencies": { global() object
1459 "dependencies": { global() object
1471 "dependencies": { global() object
1490 "dependencies": { global() object
1503 "dependencies": { global() object
1516 "dependencies": { global() object
1532 "dependencies": { global() object
1563 "dependencies": { global() object
1575 "dependencies": { global() object
1636 "dependencies": { global() object
1664 "dependencies": { global() object
1674 "dependencies": { global() object
[all...] |
| /llvm-project/clang/include/clang/Tooling/DependencyScanning/ |
| H A D | ModuleDepCollector.h | 32 namespace dependencies {
127 /// A collection of prebuilt modular dependencies this module directly depends
128 /// on, not including transitive dependencies.
132 /// including transitive dependencies.
142 /// Invokes \c Cb for all file dependencies of this module. Each provided
158 /// including transitive dependencies.
171 /// transitive modular dependencies and passes everything to the
198 /// Adds direct modular dependencies that have already been built to the
206 /// Traverses the previously collected direct modular dependencies to discover
207 /// transitive modular dependencies an
[all...] |
| H A D | DependencyScanningTool.h | 25 namespace dependencies {
31 /// Graph of modular dependencies.
34 /// The full dependencies and module graph for a specific input.
36 /// The graph of direct and transitive modular dependencies.
45 /// directly depends on, not including transitive dependencies.
49 /// on, not including transitive dependencies.
53 /// transitive dependencies.
63 /// should make the dependencies between commands explicit to enable parallel
121 /// modular dependencies and return the information needed for explicit build.
130 /// arguments for dependencies
[all...] |
| H A D | DependencyScanningService.h | 17 namespace dependencies {
20 /// dependencies.
22 /// This mode is used to compute the dependencies by running the preprocessor
26 /// This mode is used to compute the dependencies by running the preprocessor
108 } // end namespace dependencies
|
| /llvm-project/openmp/runtime/tools/ |
| H A D | check-depends.py | 28 """Get list of dependencies from readelf"""
44 """Get list of dependencies from otool"""
106 parser = argparse.ArgumentParser(description="Check library dependencies")
117 ' dependencies (or "none"). checks the specified'
118 " library has only expected dependencies.",
123 # Get dependencies
135 # If bare output specified, then just print the dependencies one per line
140 # Calculate unexpected dependencies if expected list specified
151 print_info_line("Dependencies:")
155 print_error_line("Unexpected Dependencies:")
[all …]
|
| /llvm-project/mlir/include/mlir/Dialect/Bufferization/Transforms/ |
| H A D | BufferViewFlowAnalysis.h | 17 /// A straight-forward alias analysis which ensures that all dependencies of all
31 /// Find all immediate dependencies this value could potentially have.
33 return dependencies.find(value); in find()
36 /// Returns the begin iterator to iterate over all dependencies.
37 ValueMapT::const_iterator begin() const { return dependencies.begin(); } in begin()
40 ValueMapT::const_iterator end() const { return dependencies.end(); } in end()
43 /// dependencies on this value that can potentially be later in the execution
72 /// dependencies.
75 /// Maps values to all immediate dependencies this value can have.
76 ValueMapT dependencies; variable
|
| /llvm-project/clang/lib/StaticAnalyzer/Frontend/ |
| H A D | CheckerRegistry.cpp | 153 for (auto &DepPair : Data.Dependencies) { in CheckerRegistry()
155 // Some assertions to enforce that strong dependencies are relations in in CheckerRegistry()
156 // between purely modeling checkers, and weak dependencies are about in CheckerRegistry()
161 "A strong dependency mustn't have weak dependencies!"); in CheckerRegistry()
199 /// Collects weak dependencies in \p enabledData.Checkers.
207 // invocation. Weak dependencies will not enable their unspecified strong in initializeRegistry()
208 // depenencies, but its only after resolving strong dependencies for all in initializeRegistry()
219 if (!collectStrongDependencies(Checker.Dependencies, Mgr, Deps, in initializeRegistry()
221 // If we failed to enable any of the dependencies, don't enable this in initializeRegistry()
246 if (!collectStrongDependencies(Checker.Dependencies, Mgr, Deps, in initializeRegistry()
[all …]
|
| /llvm-project/clang/include/clang/StaticAnalyzer/Checkers/ |
| H A D | Checkers.td | 207 Dependencies<[CallAndMessageModeling]>;
224 Dependencies<[DereferenceModeling]>;
250 Dependencies<[StackAddrEscapeBase]>,
305 Dependencies<[StackAddrEscapeBase]>,
315 Dependencies<[PthreadLockBase]>,
338 Dependencies<[NullabilityBase]>,
344 Dependencies<[NullabilityBase]>,
349 Dependencies<[NullabilityBase]>,
355 Dependencies<[NullabilityBase]>,
361 Dependencies<[NullabilityBas
[all...] |
| H A D | CheckerBase.td | 113 list<Checker> Dependencies;
126 /// Describes (strong) dependencies in between checkers. This is important for
129 /// enabled if none of its dependencies (transitively) is disabled. Dependencies
137 /// Dependencies<[MallocBase]>;
138 class Dependencies<list<Checker> Deps = []> {
139 list<Checker> Dependencies = Deps;
143 /// Unlike strong dependencies, this expresses dependencies in between
|
| /llvm-project/llvm/utils/vscode/llvm/ |
| H A D | package-lock.json | 26 "dependencies": { object
47 "dependencies": { object
73 "dependencies": { object
85 "dependencies": { object
100 "dependencies": { object
119 "dependencies": { object
133 "dependencies": { object
203 "dependencies": { object
223 "dependencies": { object
244 "dependencies": { object
[all …]
|
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUSplitModule.cpp | 24 /// - Graph representation of the module and of the dependencies that
391 /// accounting for any dependencies that may need to be imported as well.
399 /// their dependencies, you are guaranteed to visit all nodes in the graph at
436 /// rules regarding dependencies traversal. in doPartitioning()
953 /// aggregated cost of all dependencies in common between \p Entry and that
1085 // Explore assigning to the kernel that contains the most dependencies in
1424 // their dependencies accurately.
385 DenseSet<const Function *> Dependencies; global() member
|
| /llvm-project/clang/utils/analyzer/ |
| H A D | Dockerfile | 14 # test system dependencies
24 # box2d dependencies
32 # symengine dependencies
37 # simbody dependencies
41 # drogon dependencies
46 # tmux dependencies
|
| /llvm-project/mlir/utils/vscode/ |
| H A D | package-lock.json | 10 "dependencies": { object
60 "dependencies": { object
97 "dependencies": { object
110 "dependencies": { object
132 "dependencies": { object
143 "dependencies": { object
164 "dependencies": { object
180 "dependencies": { object
223 "dependencies": { object
245 "dependencies": { object
[all …]
|
| /llvm-project/mlir/lib/Dialect/Bufferization/Transforms/ |
| H A D | BufferViewFlowAnalysis.cpp | 52 return resolveValues(dependencies, rootValue); in resolve()
62 for (auto &entry : dependencies) in remove()
67 dependencies[to] = dependencies[from]; in rename()
68 dependencies.erase(from); in rename()
70 for (auto &[_, value] : dependencies) { in rename()
79 /// dependencies. It iterates over all blocks, gets their predecessors,
84 // Registers all dependencies of the given values. in build()
85 auto registerDependencies = [&](ValueRange values, ValueRange dependencies) { in build() argument
86 for (auto [value, dep] : llvm::zip_equal(values, dependencies)) { in build()
87 this->dependencies[value].insert(dep); in build()
[all …]
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/misc/ |
| H A D | header-include-cycle.rst | 6 Check detects cyclic ``#include`` dependencies between user-defined headers.
32 dependencies between header files, also known as "include cycles".
38 user-defined headers and their dependencies. It focuses solely on detecting
39 include cycles while disregarding other types or function dependencies.
47 that header files are organized in a way that avoids cyclic dependencies,
50 It's worth noting that only user-defined headers their dependencies are analyzed,
|
| /llvm-project/clang/lib/Tooling/DependencyScanning/ |
| H A D | DependencyScanningTool.cpp | 15 using namespace dependencies;
23 /// Prints out all of the gathered dependencies into a string.
34 Dependencies.push_back(std::string(File)); in handleFileDependency()
51 ArrayRef<std::string> Dependencies) in printDependencies() argument
53 for (const auto &Dep : Dependencies) in printDependencies()
63 DependencyPrinter Generator(*Opts, Dependencies); in printDependencies()
69 std::vector<std::string> Dependencies; member in __anona138d6050111::MakeDependencyPrinterConsumer
172 TU.FileDeps = std::move(Dependencies); in takeTranslationUnitDeps()
|
| /llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SDNodeDbgValue.h | 142 // SDNode dependencies will be calculated as SDNodes that appear in
157 ArrayRef<SDDbgOperand> L, ArrayRef<SDNode *> Dependencies, in SDDbgValue() argument
161 NumAdditionalDependencies(Dependencies.size()), in SDDbgValue()
162 AdditionalDependencies(Alloc.Allocate<SDNode *>(Dependencies.size())), in SDDbgValue()
168 std::copy(Dependencies.begin(), Dependencies.end(), AdditionalDependencies); in SDDbgValue()
195 SmallVector<SDNode *> Dependencies; in getSDNodes() local
198 Dependencies.push_back(DbgOp.getSDNode()); in getSDNodes()
200 Dependencies.push_back(Node); in getSDNodes()
201 return Dependencies; in getSDNodes()
|
| /llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.h | 13 /// identify problematic data dependencies and processor resource interferences.
22 /// Data Dependencies: [ 1.42% ]
23 /// - Register Dependencies [ 1.42% ]
24 /// - Memory Dependencies [ 0.00% ]
60 /// A dependency graph is used internally to track dependencies between nodes.
62 /// and edges of the graph represent data dependencies or processor resource
203 // dependencies and processor resource interferences between instructions.
206 // input assembly sequence. Edges of the graph represent dependencies between
218 // Loop carried dependencies are carefully expanded by the bottleneck analysis
306 // Cycles where backpressure increased because of data dependencies
[all...] |
| /llvm-project/mlir/utils/tree-sitter-mlir/ |
| H A D | package-lock.json | 11 "dependencies": { object
30 "dependencies": { object
45 "dependencies": { object
64 "dependencies": { object
80 "dependencies": { object
97 "dependencies": { object
|
| /llvm-project/llvm/lib/ExecutionEngine/Orc/ |
| H A D | ObjectLinkingLayer.cpp | 603 DenseSet<Block *> Dependencies; computeBlockNonLocalDeps() member
|
| /llvm-project/llvm/docs/DependenceGraphs/ |
| H A D | index.rst | 23 dependencies between individual instructions. Each node in such a graph
63 DDG, but it is capable of representing both data dependencies and
64 control-flow dependencies between program elements such as
81 The graph build algorithm considers dependencies between elements of
82 a given set of instructions or basic blocks. Any dependencies coming
133 …* dependencies. In this implementation *memory* edges represent the *flow-*, *anti-*, *output-*, a…
|
| /llvm-project/libclc/cmake/modules/ |
| H A D | AddLibclc.cmake | 12 # * DEPENDENCIES <string> ...
13 # List of extra dependencies to inject
21 "EXTRA_OPTS;DEPENDENCIES"
85 # * DEPENDENCIES <string> ...
86 # List of extra dependencies to inject
91 "INPUTS;DEPENDENCIES"
215 # from these link dependencies will be internalized during linking.
258 DEPENDENCIES generate_convert.cl clspv-generate_convert.cl
279 DEPENDENCIES ${builtins_comp_lib_tgt}
289 DEPENDENCIES
[all...] |
| /llvm-project/clang/lib/Frontend/ |
| H A D | DependencyGraph.cpp | 36 DependencyMap Dependencies; member in __anon5b0d5c6d0111::DependencyGraphCallback
87 Dependencies[*FromFile].push_back(*File); in InclusionDirective()
105 Dependencies[*FromFile].push_back(*File); in EmbedDirective()
127 OS << "digraph \"dependencies\" {\n"; in OutputGraphFile()
142 for (DependencyMap::iterator F = Dependencies.begin(), in OutputGraphFile()
143 FEnd = Dependencies.end(); in OutputGraphFile()
|