| /src/sys/external/bsd/acpica/dist/executer/ |
| exmisc.c | 348 int Compare;
451 /* Lexicographic compare: compare the data bytes */
453 Compare = memcmp (Operand0->Buffer.Pointer,
464 (Compare == 0))
474 if (Compare > 0)
479 if (Compare < 0)
484 /* Bytes match (to shortest length), compare lengths */
494 if (Compare > 0)
498 if (Compare < 0
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Serialization/ |
| ContinuousRangeMap.h | 50 struct Compare {
76 iterator I = llvm::lower_bound(Rep, Val, Compare());
94 iterator I = llvm::upper_bound(Rep, K, Compare());
120 llvm::sort(Self.Rep, Compare());
|
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Integral.h | 30 /// Helper to compare two comparable types.
32 ComparisonCategoryResult Compare(const T &X, const T &Y) {
134 ComparisonCategoryResult compare(const Integral &RHS) const { function in class:clang::interp::Integral
135 return Compare(V, RHS.V);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| CalledValuePropagation.cpp | 64 struct Compare {
74 assert(llvm::is_sorted(this->Functions, Compare()));
159 std::back_inserter(Union), CVPLatticeVal::Compare{});
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopFlatten.cpp | 148 // Find Compare and make sure it is valid
149 ICmpInst *Compare = dyn_cast<ICmpInst>(BackBranch->getCondition());
150 if (!Compare || !IsValidPredicate(Compare->getUnsignedPredicate()) ||
151 Compare->hasNUsesOrMore(2)) {
155 IterationInstructions.insert(Compare);
156 LLVM_DEBUG(dbgs() << "Found comparison: "; Compare->dump());
158 // Find increment and limit from the compare
160 if (match(Compare->getOperand(0),
162 Increment = dyn_cast<BinaryOperator>(Compare->getOperand(0))
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/MC/ |
| MCInstrDesc.h | 158 Compare,
332 bool isCompare() const { return Flags & (1ULL << MCID::Compare); }
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 633 struct Compare {
642 Compare>
1545 const bool Different = DT.compare(FreshTree);
1604 // Simplist check is to compare against a new tree. This will also
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/ |
| gtest.h | 1551 static AssertionResult Compare(const char* lhs_expression,
1563 static AssertionResult Compare(const char* lhs_expression,
1571 static AssertionResult Compare(
2007 // are related, not how their content is related. To compare two C
2028 EXPECT_PRED_FORMAT2(::testing::internal::EqHelper::Compare, val1, val2)
2041 ASSERT_PRED_FORMAT2(::testing::internal::EqHelper::Compare, val1, val2)
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 1500 static bool Compare(const MachineOperand *const &A,
1520 // FIXME: Don't compare everything twice. Maybe use C++20 three way
1524 Compare))
1527 BaseOps.begin(), BaseOps.end(), Compare))
3059 // Do not compare the magnitude of pressure changes between top and bottom
3208 // We only compare a subset of features when comparing nodes between
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAG.cpp | 1662 static bool Compare(const WeightedLeaf &A, const WeightedLeaf &B) {
1703 std::pop_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1720 std::push_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1763 std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1790 std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
|
| /src/external/apache2/llvm/dist/clang/lib/Serialization/ |
| ASTReaderDecl.cpp | 4367 const ObjCCategoriesInfo Compare = { LocalID, 0 };
4371 Compare);
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| Verifier.cpp | 5331 // Compare intrinsics carry an extra predicate metadata operand.
5682 auto Compare = [GetScope](IntrinsicInst *Lhs, IntrinsicInst *Rhs) {
5686 llvm::sort(NoAliasScopeDecls, Compare);
|
| /src/external/gpl3/gdb/dist/sim/mips/ |
| sim-main.h | 769 #define Compare(op1,op2,fmt,cond,cc) \
|
| /src/external/gpl3/gdb.old/dist/sim/mips/ |
| sim-main.h | 769 #define Compare(op1,op2,fmt,cond,cc) \
|
