Lines Matching full:dependency

43 ///              Instruction                     Dependency Information
50 /// +----> 2.    vhaddps %xmm3, %xmm3, %xmm4     ## REGISTER dependency:  %xmm3
60 /// A dependency graph is used internally to track dependencies between nodes.
67 /// ranked based on their "criticality". A dependency is considered to be
180 // A dependency edge.
184   // Dependency edge descriptor.
186   // It specifies the dependency type, as well as the edge cost in cycles.
187   struct Dependency {  struct
192   Dependency Dep;
202 // A dependency graph used by the bottleneck analysis to describe data
210 // internally to rank dependency based on their impact on the runtime
211 // performance (see field DependencyEdge::Dependency::Cost). In general, the  argument
214 // The cost of a dependency is a function of both the latency and the number of
215 // cycles where the dependency has been seen as critical (i.e. contributing to
239                      DependencyEdge::Dependency &&DE);
315   // Used to populate the dependency graph DG.