Searched refs:complexity (Results 1 – 25 of 41) sorted by relevance
12
48 softlink. The advantage is that for all the complexity of your /conf
168 added complexity actually makes it easier to manage multiple
653 unsigned complexity, unsigned uid) in PatternToMatch() argument655 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {} in PatternToMatch()
123 ensure that this program works correctly. However, the complexity
117 # This complexity would not be needed for negative leap seconds (if they
65 ;; reduce the complexity of cpu+fpu, reducing space.
96 Note that these models are in order of implementation complexity and
268 environment, but nevertheless have only fairly low complexity. These292 Most of the algorithmic complexity in the library lives in these569 To hold down complexity, do make your code data-driven. Especially, if
123 # This complexity would not be needed for negative leap seconds (if they
277 E. The next level of complexity is a Switched Fabric. The following topology
166 CVS. Is it worth the cost (in terms of complexity or any other
94 This is the reason for most of the complexity in the logic - if one side
29 // Make sure that complexity is more than the CONST32 pattern in
3201 // We need a complexity of 120 here to overide preceeding handling of3223 // We need a complexity of 120 here to overide preceeding handling of3251 // We need a complexity of 120 here to overide preceeding handling of
2612 // The complexity of the above is 13 (gleaned from HexagonGenDAGIsel.inc)2613 // So this complexity below is comfortably higher to allow for choosing the below.
1447 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)1685 int complexity; member
311 optional. Because of the complexity of this reading, it is available
351 // Added complexity passed onto matching pattern.
3037 (OMP_ATOMIC_CHECK (NODE)->exp.complexity)
660 in the order of increasing complexity and/or decreasing necessity (to say that
179 Due to their complexity we have delayed discussion of two of the most powerful
1214 // Use added complexity so these patterns are preferred to the VALU patterns.
156 before processing them. This complexity is therefore unnecessary and
224 complexity for retrieval operations using binary search is
1329 Program complexity grows until it exceeds the capability