| /freebsd-src/share/man/man7/ |
| H A D | ports.7 | 55 It also recursively handles dependencies \(em other pieces of software
188 any dependencies of the current port.
219 Install missing dependencies from packages instead of building them.
231 config for this port and all its dependencies.
239 config for this port and all its dependencies.
247 for this port and all its dependencies using
251 dependencies).
253 Fetch the distfiles of the port and all its dependencies.
258 Print a list of all the direct compile or run dependencies for this port.
260 Print a list of all recursive dependencies fo
[all...] |
| /freebsd-src/contrib/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);
|
| /freebsd-src/contrib/libucl/tests/schema/ |
| H A D | dependencies.json | 3 "description": "dependencies",
5 "dependencies": {"bar": ["foo"]} object
36 "description": "multiple dependencies",
38 "dependencies": {"quux": ["foo", "bar"]} object
52 "description": "with dependencies",
67 "description": "missing both dependencies",
74 "description": "multiple dependencies subschema",
76 "dependencies": { object
|
| /freebsd-src/contrib/llvm-project/clang/include/clang/Tooling/DependencyScanning/ |
| H A D | ModuleDepCollector.h | 32 namespace dependencies {
124 /// on, not including transitive dependencies.
131 /// A collection of prebuilt modular dependencies this module directly depends
132 /// on, not including transitive dependencies.
136 /// including transitive dependencies.
163 /// transitive modular dependencies and passes everything to the
190 /// Adds direct modular dependencies that have already been built to the
198 /// Traverses the previously collected direct modular dependencies to discover
199 /// transitive modular dependencies and fills the parent \c ModuleDepCollector
216 /// Collects modular and non-modular dependencies o
[all...] |
| H A D | DependencyScanningTool.h | 24 namespace dependencies {
30 /// Graph of modular dependencies.
33 /// The full dependencies and module graph for a specific input.
35 /// The graph of direct and transitive modular dependencies.
44 /// directly depends on, not including transitive dependencies.
48 /// on, not including transitive dependencies.
52 /// transitive dependencies.
62 /// should make the dependencies between commands explicit to enable parallel
120 /// modular dependencies and return the information needed for explicit build.
129 /// 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
104 } // end namespace dependencies
|
| H A D | DependencyScanningWorker.h | 28 namespace dependencies {
77 /// The worker computes the dependencies for the input files by preprocessing
86 /// and report the discovered dependencies to the provided consumer. If \p
87 /// ModuleName isn't empty, this function reports the dependencies of module
124 } // end namespace dependencies
|
| /freebsd-src/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/ |
| H A D | Checkers.td | 210 Dependencies<[CallAndMessageModeling]>;
247 Dependencies<[StackAddrEscapeBase]>,
311 Dependencies<[StackAddrEscapeBase]>,
321 Dependencies<[PthreadLockBase]>,
344 Dependencies<[NullabilityBase]>,
350 Dependencies<[NullabilityBase]>,
355 Dependencies<[NullabilityBase]>,
361 Dependencies<[NullabilityBase]>,
367 Dependencies<[NullabilityBase]>,
471 Dependencies<[CStringModelin
[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
|
| /freebsd-src/contrib/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 …]
|
| /freebsd-src/contrib/bsnmp/lib/ |
| H A D | bsnmpagent.3 | 324 The callback may create dependencies or finalizers (see below).
327 interdependent table columns dependencies may be necessary.
333 After this all the dependencies are freed
339 are executed in the order in which the dependencies were created with an
341 If any of the dependencies fails, all the
342 committed dependencies are called again in the opposite order
347 At the end the dependencies are freed and the finalizers are called with
357 Now the dependencies are freed and the finalizers are called
366 There are to mechanisms to help in complex SET operations: dependencies and
389 created dependencies), the size of the structure to allocate and
[all …]
|
| /freebsd-src/contrib/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 __anond87279640111::MakeDependencyPrinterConsumer
172 TU.FileDeps = std::move(Dependencies); in takeTranslationUnitDeps()
|
| /freebsd-src/contrib/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()
|
| /freebsd-src/contrib/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 …]
|
| /freebsd-src/tools/kerneldoc/subsys/ |
| H A D | README | 11 The file 'Dependencies' contains dependencies for the .tag files.
14 the necessary dependencies to the file 'Dependencies'.
|
| /freebsd-src/contrib/llvm-project/clang/include/clang/Frontend/ |
| H A D | DependencyOutputOptions.h | 37 unsigned IncludeSystemHeaders : 1; ///< Include system header dependencies.
47 unsigned IncludeModuleFiles : 1; ///< Include module file dependencies.
79 /// A list of extra dependencies (filename and kind) to be used for every
83 /// The file to write GraphViz-formatted header dependencies to.
86 /// The directory to copy module dependencies to when collecting them.
|
| H A D | Utils.h | 59 /// An interface for collecting the dependencies of a compilation. Users should
61 /// dependencies.
69 ArrayRef<std::string> getDependencies() const { return Dependencies; } in getDependencies()
72 /// to the list of dependencies.
91 /// Return true if the filename was added to the list of dependencies, false
97 std::vector<std::string> Dependencies; variable
134 /// Collects the dependencies for imported modules into a directory. Users
|
| /freebsd-src/sbin/rcorder/ |
| H A D | rcorder.8 | 56 shell) which indicate the dependencies the files have upon certain
141 lines, in which case it has no dependencies.
142 There must be at least one file with no dependencies in the set of
201 .It "%s was seen in circular dependencies for %d times."
204 Start with files having biggest counter when fighting with broken dependencies.
221 Edges and nodes where circular dependencies were detected are drawn bold red.
|
| /freebsd-src/contrib/llvm-project/clang/lib/Frontend/ |
| H A D | DependencyGraph.cpp | 36 DependencyMap Dependencies; member in __anon95dd62ec0111::DependencyGraphCallback
87 Dependencies[*FromFile].push_back(*File);
105 Dependencies[*FromFile].push_back(*File); in OutputGraphFile()
127 OS << "digraph \"dependencies\" {\n"; in OutputGraphFile()
142 for (DependencyMap::iterator F = Dependencies.begin(),
143 FEnd = Dependencies.end();
|
| /freebsd-src/usr.bin/mkdep/ |
| H A D | mkdep.1 | 45 file dependencies which are written into the file ``.depend''.
78 Write the include file dependencies to
84 to produce dependencies of the form:
116 File containing list of dependencies.
|
| /freebsd-src/tools/build/options/ |
| H A D | WITH_DIRDEPS_BUILD | 18 computing a graph of tree dependencies from the current origin.
21 skips checking dirdep dependencies and will only build in the current
42 and package so that their dependencies can be tracked.
|
| /freebsd-src/usr.bin/ldd/ |
| H A D | ldd.1 | 7 .Nd list dynamic object dependencies
22 dependencies that are the result of needed shared objects which themselves
50 lists the dependencies of an executable by setting
|
| /freebsd-src/usr.bin/clang/llvm-mca/ |
| H A D | llvm-mca.1 | 642 of loop carried dependencies. Block throughput is superiorly limited by the
645 In the absence of loop\-carried data dependencies, the observed IPC tends to a
652 data dependencies, the observed \(aquOps Per Cycle\(aq should tend to a theoretical
668 are no loop\-carried dependencies, the observed \fIuOps Per Cycle\fP is expected to
682 executed per clock cycle in the absence of operand dependencies. In this
812 help diagnose performance bottlenecks caused by long data dependencies and
850 vhaddps. Long data dependencies negatively impact the ILP (Instruction Level
853 In the dot\-product example, there are anti\-dependencies introduced by
854 instructions from different iterations. However, those dependencies can be
859 the presence of long latency instructions and potentially long data dependencies
[all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/DWARFLinker/Parallel/ |
| H A D | DependencyTracker.h | 23 /// This class discovers DIEs dependencies: marks "live" DIEs, marks DIE
38 /// Returns true if all dependencies are correctly discovered. Inter-CU
39 /// dependencies cannot be discovered if referenced CU is not analyzed yet.
45 /// Check if dependencies have incompatible placement.
266 /// List of entries dependencies.
267 RootEntriesListTy Dependencies; variable
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
| H A D | Scheduler.h | 91 // dependencies can be added to the PendingSet.
95 // the presence of bottlenecks caused by data dependencies, the PendingSet can
96 // be inspected to identify problematic data dependencies between
100 // available, and all memory dependencies are met. Instructions that are
197 /// dependencies.
247 /// identify bottlenecks caused by data dependencies. Vector RegDeps is
249 /// register dependencies. Vector MemDeps is populated by instructions that
250 /// were not issued because of unsolved memory dependencies.
|