/freebsd/sys/contrib/ck/include/ |
H A D | ck_rwcohort.h | 42 #define CK_RWCOHORT_WP_NAME(N) ck_rwcohort_wp_##N argument 45 #define CK_RWCOHORT_WP_READ_LOCK(N, RW, C, GC, LC) \ argument 47 #define CK_RWCOHORT_WP_READ_UNLOCK(N, RW, C, GC, LC) \ argument 49 #define CK_RWCOHORT_WP_WRITE_LOCK(N, RW, C, GC, LC) \ argument 51 #define CK_RWCOHORT_WP_WRITE_UNLOCK(N, RW, C, GC, LC) \ argument 55 #define CK_RWCOHORT_WP_PROTOTYPE(N) \ argument 146 #define CK_RWCOHORT_RP_NAME(N) ck_rwcohort_rp_##N argument 149 #define CK_RWCOHORT_RP_READ_LOCK(N, RW, C, GC, LC) \ argument 153 #define CK_RWCOHORT_RP_WRITE_LOCK(N, RW, C, GC, LC) \ argument 159 #define CK_RWCOHORT_RP_PROTOTYPE(N) \ argument [all …]
|
H A D | ck_cohort.h | 48 #define CK_COHORT_NAME(N) ck_cohort_##N argument 49 #define CK_COHORT_INSTANCE(N) struct CK_COHORT_NAME(N) argument 50 #define CK_COHORT_INIT(N, C, GL, LL, P) ck_cohort_##N##_init(C, GL, LL, P) argument 51 #define CK_COHORT_LOCK(N, C, GC, LC) ck_cohort_##N##_lock(C, GC, LC) argument 52 #define CK_COHORT_UNLOCK(N, C, GC, LC) ck_cohort_##N##_unlock(C, GC, LC) argument 53 #define CK_COHORT_TRYLOCK(N, C, GLC, LLC, LUC) ck_cohort_##N##_trylock(C, GLC, LLC, LUC) argument 54 #define CK_COHORT_LOCKED(N, C, GC, LC) ck_cohort_##N##_locked(C, GC, LC) argument 56 #define CK_COHORT_PROTOTYPE(N, GL, GU, GI, LL, LU, LI) \ argument 125 #define CK_COHORT_TRYLOCK_PROTOTYPE(N, GL, GU, GI, GTL, LL, LU, LI, LTL) \ argument
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeFloatTypes.cpp | 1463 void DAGTypeLegalizer::ExpandFloatRes_FCEIL(SDNode *N, in ExpandFloatRes_FCEIL() 1481 void DAGTypeLegalizer::ExpandFloatRes_FCOS(SDNode *N, in ExpandFloatRes_FCOS() 1499 void DAGTypeLegalizer::ExpandFloatRes_FEXP(SDNode *N, in ExpandFloatRes_FEXP() 1507 void DAGTypeLegalizer::ExpandFloatRes_FEXP2(SDNode *N, in ExpandFloatRes_FEXP2() 1532 void DAGTypeLegalizer::ExpandFloatRes_FLOG(SDNode *N, in ExpandFloatRes_FLOG() 1540 void DAGTypeLegalizer::ExpandFloatRes_FLOG2(SDNode *N, in ExpandFloatRes_FLOG2() 1634 void DAGTypeLegalizer::ExpandFloatRes_FPOW(SDNode *N, in ExpandFloatRes_FPOW() 1642 void DAGTypeLegalizer::ExpandFloatRes_FPOWI(SDNode *N, in ExpandFloatRes_FPOWI() 1663 void DAGTypeLegalizer::ExpandFloatRes_FREM(SDNode *N, in ExpandFloatRes_FREM() 1671 void DAGTypeLegalizer::ExpandFloatRes_FRINT(SDNode *N, in ExpandFloatRes_FRINT() [all …]
|
H A D | LegalizeIntegerTypes.cpp | 3566 void DAGTypeLegalizer::ExpandIntRes_BSWAP(SDNode *N, in ExpandIntRes_BSWAP() 3647 void DAGTypeLegalizer::ExpandIntRes_CTLZ(SDNode *N, in ExpandIntRes_CTLZ() 3667 void DAGTypeLegalizer::ExpandIntRes_CTPOP(SDNode *N, in ExpandIntRes_CTPOP() 3678 void DAGTypeLegalizer::ExpandIntRes_CTTZ(SDNode *N, in ExpandIntRes_CTTZ() 3984 void DAGTypeLegalizer::ExpandIntRes_MUL(SDNode *N, in ExpandIntRes_MUL() 4390 void DAGTypeLegalizer::ExpandIntRes_SDIV(SDNode *N, in ExpandIntRes_SDIV() 4523 void DAGTypeLegalizer::ExpandIntRes_Shift(SDNode *N, in ExpandIntRes_Shift() 4703 void DAGTypeLegalizer::ExpandIntRes_SREM(SDNode *N, in ExpandIntRes_SREM() 4743 void DAGTypeLegalizer::ExpandIntRes_XMULO(SDNode *N, in ExpandIntRes_XMULO() 4881 void DAGTypeLegalizer::ExpandIntRes_UDIV(SDNode *N, in ExpandIntRes_UDIV() [all …]
|
H A D | LegalizeTypesGeneric.cpp | 34 void DAGTypeLegalizer::ExpandRes_MERGE_VALUES(SDNode *N, unsigned ResNo, in ExpandRes_MERGE_VALUES() 190 void DAGTypeLegalizer::ExpandRes_BUILD_PAIR(SDNode *N, SDValue &Lo, in ExpandRes_BUILD_PAIR() 247 void DAGTypeLegalizer::ExpandRes_NormalLoad(SDNode *N, SDValue &Lo, in ExpandRes_NormalLoad() 332 SDValue DAGTypeLegalizer::ExpandOp_BITCAST(SDNode *N) { in ExpandOp_BITCAST() 368 SDValue DAGTypeLegalizer::ExpandOp_BUILD_VECTOR(SDNode *N) { in ExpandOp_BUILD_VECTOR() 400 SDValue DAGTypeLegalizer::ExpandOp_EXTRACT_ELEMENT(SDNode *N) { in ExpandOp_EXTRACT_ELEMENT() 406 SDValue DAGTypeLegalizer::ExpandOp_INSERT_VECTOR_ELT(SDNode *N) { in ExpandOp_INSERT_VECTOR_ELT() 442 SDValue DAGTypeLegalizer::ExpandOp_SCALAR_TO_VECTOR(SDNode *N) { in ExpandOp_SCALAR_TO_VECTOR() 554 void DAGTypeLegalizer::SplitRes_SELECT_CC(SDNode *N, SDValue &Lo, in SplitRes_SELECT_CC() 574 void DAGTypeLegalizer::SplitVecRes_AssertZext(SDNode *N, SDValue &Lo, in SplitVecRes_AssertZext() [all …]
|
H A D | LegalizeVectorTypes.cpp | 209 SDValue DAGTypeLegalizer::ScalarizeVecRes_BinOp(SDNode *N) { in ScalarizeVecRes_BinOp() 224 SDValue DAGTypeLegalizer::ScalarizeVecRes_FIX(SDNode *N) { in ScalarizeVecRes_FIX() 2459 auto &&IsConstant = [](const SDValue &N) { in SplitVecRes_VECTOR_SHUFFLE() 3918 SDValue DAGTypeLegalizer::SplitVecOp_VSETCC(SDNode *N) { in SplitVecOp_VSETCC() 4854 SDValue DAGTypeLegalizer::WidenVecRes_XRINT(SDNode *N) { in WidenVecRes_XRINT() 5339 SDValue DAGTypeLegalizer::WidenVecRes_LOAD(SDNode *N) { in WidenVecRes_LOAD() 5582 static inline EVT getSETCCOperandType(SDValue N) { in getSETCCOperandType() 5590 static inline bool isSETCCorConvertedSETCC(SDValue N) { in isSETCCorConvertedSETCC() 5679 SDValue DAGTypeLegalizer::WidenVSELECTMask(SDNode *N) { in WidenVSELECTMask() 6469 SDValue DAGTypeLegalizer::WidenVecOp_STORE(SDNode *N) { in WidenVecOp_STORE() [all …]
|
/freebsd/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangOpcodesEmitter.cpp | 60 void Enumerate(const Record *R, StringRef N, in Enumerate() 90 StringRef N = Opcode->getValueAsString("Name"); in run() local 129 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitInterp() local 146 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitInterp() local 196 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEmitter() local 202 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitEmitter() local 208 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEmitter() local 261 for (size_t I = 0, N = Types->size(); I < N; ++I) in EmitGroup() local 277 for (size_t I = 0, N = Types->size(); I < N; ++I) in EmitGroup() local 279 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitGroup() local [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | DirectedGraph.h | 32 explicit DGEdge(NodeType &N) : TargetNode(N) {} in DGEdge() 55 void setTargetNode(const NodeType &N) { TargetNode = N; } in setTargetNode() 84 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode() 133 bool hasEdgeTo(const NodeType &N) const { in hasEdgeTo() 149 bool isEqualTo(const NodeType &N) const { return this == &N; } in isEqualTo() 159 const_iterator findEdgeTo(const NodeType &N) const { in findEdgeTo() 183 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph() 207 const_iterator findNode(const NodeType &N) const { in findNode() 211 iterator findNode(const NodeType &N) { in findNode() 217 bool addNode(NodeType &N) { in addNode() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | DiagnosticPrinter.cpp | 53 DiagnosticPrinter &DiagnosticPrinterRawOStream::operator<<(unsigned long N) { in operator <<() 57 DiagnosticPrinter &DiagnosticPrinterRawOStream::operator<<(long N) { in operator <<() 63 unsigned long long N) { in operator <<() 68 DiagnosticPrinter &DiagnosticPrinterRawOStream::operator<<(long long N) { in operator <<() 78 DiagnosticPrinter &DiagnosticPrinterRawOStream::operator<<(unsigned int N) { in operator <<() 83 DiagnosticPrinter &DiagnosticPrinterRawOStream::operator<<(int N) { in operator <<() 88 DiagnosticPrinter &DiagnosticPrinterRawOStream::operator<<(double N) { in operator <<()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/ |
H A D | MsgPackDocument.h | 266 void push_back(DocNode N) { in push_back() 309 auto N = DocNode(&KindAndDocs[size_t(Type::Empty)]); in getEmptyNode() local 315 auto N = DocNode(&KindAndDocs[size_t(Type::Nil)]); in getNode() local 321 auto N = DocNode(&KindAndDocs[size_t(Type::Int)]); in getNode() local 328 auto N = DocNode(&KindAndDocs[size_t(Type::Int)]); in getNode() local 335 auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]); in getNode() local 342 auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]); in getNode() local 356 auto N = DocNode(&KindAndDocs[size_t(Type::Float)]); in getNode() local 366 auto N = DocNode(&KindAndDocs[size_t(Type::String)]); variable 390 auto N = DocNode(&KindAndDocs[size_t(Type::Map)]); in getMapNode() local [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | NativeFormatting.cpp | 26 static int format_to_buffer(T Value, char (&Buffer)[N]) { in format_to_buffer() 56 static void write_unsigned_impl(raw_ostream &S, T N, size_t MinDigits, in write_unsigned_impl() 79 static void write_unsigned(raw_ostream &S, T N, size_t MinDigits, in write_unsigned() 90 static void write_signed(raw_ostream &S, T N, size_t MinDigits, in write_signed() 105 void llvm::write_integer(raw_ostream &S, unsigned int N, size_t MinDigits, in write_integer() 110 void llvm::write_integer(raw_ostream &S, int N, size_t MinDigits, in write_integer() 115 void llvm::write_integer(raw_ostream &S, unsigned long N, size_t MinDigits, in write_integer() 120 void llvm::write_integer(raw_ostream &S, long N, size_t MinDigits, in write_integer() 130 void llvm::write_integer(raw_ostream &S, long long N, size_t MinDigits, in write_integer() 135 void llvm::write_hex(raw_ostream &S, uint64_t N, HexPrintStyle Style, in write_hex() [all …]
|
H A D | BalancedPartitioning.cpp | 123 for (auto &N : Nodes) in bisect() local 143 llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; }); in bisect() 171 for (auto &N : Nodes) in runIterations() local 176 for (auto &N : Nodes) in runIterations() local 183 for (auto &N : Nodes) in runIterations() local 189 for (auto &N : Nodes) { in runIterations() local 233 for (auto &N : Nodes) { in runIteration() local 268 bool BalancedPartitioning::moveFunctionNode(BPFunctionNode &N, in moveFunctionNode() 310 for (auto &N : llvm::make_range(Nodes.begin(), NodesMid)) in split() local 312 for (auto &N : llvm::make_range(NodesMid, Nodes.end())) in split() local [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | RecordSerialization.cpp | 51 int8_t N; in consume() local 58 int16_t N; in consume() local 65 uint16_t N; in consume() local 72 int32_t N; in consume() local 79 uint32_t N; in consume() local 86 int64_t N; in consume() local 93 uint64_t N; in consume() local 116 APSInt N; in consume_numeric() local
|
/freebsd/crypto/openssl/crypto/srp/ |
H A D | srp_lib.c | 26 static BIGNUM *srp_Calc_xy(const BIGNUM *x, const BIGNUM *y, const BIGNUM *N, in srp_Calc_xy() 55 static BIGNUM *srp_Calc_k(const BIGNUM *N, const BIGNUM *g, in srp_Calc_k() 63 BIGNUM *SRP_Calc_u_ex(const BIGNUM *A, const BIGNUM *B, const BIGNUM *N, in SRP_Calc_u_ex() 70 BIGNUM *SRP_Calc_u(const BIGNUM *A, const BIGNUM *B, const BIGNUM *N) in SRP_Calc_u() 77 const BIGNUM *b, const BIGNUM *N) in SRP_Calc_server_key() 106 BIGNUM *SRP_Calc_B_ex(const BIGNUM *b, const BIGNUM *N, const BIGNUM *g, in SRP_Calc_B_ex() 138 BIGNUM *SRP_Calc_B(const BIGNUM *b, const BIGNUM *N, const BIGNUM *g, in SRP_Calc_B() 196 BIGNUM *SRP_Calc_A(const BIGNUM *a, const BIGNUM *N, const BIGNUM *g) in SRP_Calc_A() 266 int SRP_Verify_B_mod_N(const BIGNUM *B, const BIGNUM *N) in SRP_Verify_B_mod_N() 287 int SRP_Verify_A_mod_N(const BIGNUM *A, const BIGNUM *N) in SRP_Verify_A_mod_N() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsISelDAGToDAG.cpp | 157 bool MipsDAGToDAGISel::selectVSplat(SDNode *N, APInt &Imm, in selectVSplat() 163 bool MipsDAGToDAGISel::selectVSplatUimm1(SDValue N, SDValue &Imm) const { in selectVSplatUimm1() 168 bool MipsDAGToDAGISel::selectVSplatUimm2(SDValue N, SDValue &Imm) const { in selectVSplatUimm2() 173 bool MipsDAGToDAGISel::selectVSplatUimm3(SDValue N, SDValue &Imm) const { in selectVSplatUimm3() 178 bool MipsDAGToDAGISel::selectVSplatUimm4(SDValue N, SDValue &Imm) const { in selectVSplatUimm4() 183 bool MipsDAGToDAGISel::selectVSplatUimm5(SDValue N, SDValue &Imm) const { in selectVSplatUimm5() 188 bool MipsDAGToDAGISel::selectVSplatUimm6(SDValue N, SDValue &Imm) const { in selectVSplatUimm6() 193 bool MipsDAGToDAGISel::selectVSplatUimm8(SDValue N, SDValue &Imm) const { in selectVSplatUimm8() 198 bool MipsDAGToDAGISel::selectVSplatSimm5(SDValue N, SDValue &Imm) const { in selectVSplatSimm5() 213 bool MipsDAGToDAGISel::selectVSplatMaskL(SDValue N, SDValue &Imm) const { in selectVSplatMaskL() [all …]
|
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/aarch64/ |
H A D | lse.S | 66 #define N 0x000000 macro 73 #define N 0x800000 macro 80 #define N 0x400000 macro 87 #define N 0xc00000 macro 96 #define N 0x800000 macro 102 #define N 0xc00000 macro 110 #define x(N) GLUE2(x, N) argument 111 #define w(N) GLUE2(w, N) argument 113 #define s(N) w(N) argument 115 #define s(N) x(N) argument
|
/freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
H A D | Tree.cpp | 19 static void traverse(const syntax::Node *N, in traverse() 27 static void traverse(syntax::Node *N, in traverse() 29 traverse(static_cast<const syntax::Node *>(N), [&](const syntax::Node *N) { in traverse() 108 for (auto *N = New; N; N = N->NextSibling) { in replaceChildRangeLowLevel() local 114 auto Reachable = [](Node *From, Node *N) { in replaceChildRangeLowLevel() 138 for (auto *N = Begin; N != End;) { in replaceChildRangeLowLevel() local 165 for (auto *N = New; N != nullptr; N = N->NextSibling) { in replaceChildRangeLowLevel() local 174 static void dumpNode(raw_ostream &OS, const syntax::Node *N, in dumpNode() 176 auto DumpExtraInfo = [&OS](const syntax::Node *N) { in dumpNode() 230 traverse(this, [&](const syntax::Node *N) { in dumpTokens() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelDAGToDAG.cpp | 163 bool SelectExtractHigh(SDValue N, SDValue &Res) { in SelectExtractHigh() 208 bool SelectDupZeroOrUndef(SDValue N) { in SelectDupZeroOrUndef() 228 bool SelectDupZero(SDValue N) { in SelectDupZero() 244 bool SelectDupNegativeZero(SDValue N) { in SelectDupNegativeZero() 272 bool SelectSVEArithImm(SDValue N, SDValue &Imm) { in SelectSVEArithImm() 293 bool SelectCntImm(SDValue N, SDValue &Imm) { in SelectCntImm() 314 bool SelectEXTImm(SDValue N, SDValue &Imm) { in SelectEXTImm() 330 bool ImmToReg(SDValue N, SDValue &Imm) { in ImmToReg() 941 auto isDef32 = [](SDValue N) { in SelectArithExtendedRegister() 994 static bool isWorthFoldingADDlow(SDValue N) { in isWorthFoldingADDlow() [all …]
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | CombinerUtils.h | 24 inline bool isSpecificDef(const Init &N, StringRef Def) { in isSpecificDef() 35 inline Record *getDefOfSubClass(const Init &N, StringRef Cls) { in getDefOfSubClass() 46 inline const DagInit *getDagWithSpecificOperator(const Init &N, in getDagWithSpecificOperator() 60 inline const DagInit *getDagWithOperatorOfSubClass(const Init &N, in getDagWithOperatorOfSubClass()
|
/freebsd/contrib/libarchive/libarchive/ |
H A D | archive_rb.h | 52 #define ARCHIVE_RB_TREE_NEXT(T, N) \ argument 54 #define ARCHIVE_RB_TREE_PREV(T, N) \ argument 56 #define ARCHIVE_RB_TREE_FOREACH(N, T) \ argument 59 #define ARCHIVE_RB_TREE_FOREACH_REVERSE(N, T) \ argument 62 #define ARCHIVE_RB_TREE_FOREACH_SAFE(N, T, S) \ argument 66 #define ARCHIVE_RB_TREE_FOREACH_REVERSE_SAFE(N, T, S) \ argument
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.h | 233 static bool classof(const Matcher *N) { in classof() 258 static bool classof(const Matcher *N) { in classof() 290 static bool classof(const Matcher *N) { in classof() 306 static bool classof(const Matcher *N) { in classof() 322 static bool classof(const Matcher *N) { in classof() 340 static bool classof(const Matcher *N) { in classof() 377 static bool classof(const Matcher *N) { in classof() 397 static bool classof(const Matcher *N) { in classof() 421 static bool classof(const Matcher *N) { in classof() 444 static bool classof(const Matcher *N) { in classof() [all …]
|
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | WorkList.h | 34 WorkListUnit(ExplodedNode *N, BlockCounter C, in WorkListUnit() 41 explicit WorkListUnit(ExplodedNode *N, BlockCounter C) in WorkListUnit() 68 void enqueue(ExplodedNode *N, const CFGBlock *B, unsigned idx) { in enqueue() 72 void enqueue(ExplodedNode *N) { in enqueue()
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DDG.cpp | 81 raw_ostream &llvm::operator<<(raw_ostream &OS, const DDGNode &N) { in operator <<() 91 for (const DDGNode *N : Nodes) in operator <<() local 113 SimpleDDGNode::SimpleDDGNode(const SimpleDDGNode &N) in SimpleDDGNode() 120 SimpleDDGNode::SimpleDDGNode(SimpleDDGNode &&N) in SimpleDDGNode() function in SimpleDDGNode 138 PiBlockDDGNode::PiBlockDDGNode(const PiBlockDDGNode &N) in PiBlockDDGNode() 144 PiBlockDDGNode::PiBlockDDGNode(PiBlockDDGNode &&N) in PiBlockDDGNode() function in PiBlockDDGNode 213 for (auto *N : Nodes) { in ~DataDependenceGraph() local 220 bool DataDependenceGraph::addNode(DDGNode &N) { in addNode()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DDG.h | 59 DDGNode(DDGNode &&N) : DDGNodeBase(std::move(N)), Kind(N.Kind) {} in DDGNode() function 97 RootDDGNode(RootDDGNode &&N) : DDGNode(std::move(N)) {} in RootDDGNode() function 101 static bool classof(const DDGNode *N) { in classof() 104 static bool classof(const RootDDGNode *N) { return true; } in classof() 141 static bool classof(const DDGNode *N) { in classof() 145 static bool classof(const SimpleDDGNode *N) { return true; } in classof() 199 static bool classof(const DDGNode *N) { in classof() 225 DDGEdge(DDGNode &N, EdgeKind K) : DDGEdgeBase(N), Kind(K) {} in DDGEdge() 261 DependenceGraphInfo(const std::string &N, const DependenceInfo &DepInfo) in DependenceGraphInfo() 389 const NodeListType &getNodesInPiBlock(const DDGNode &N) final { in getNodesInPiBlock()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | ScaledNumber.h | 431 static uint64_t getHalf(uint64_t N) { return (N >> 1) + (N & 1); } in getHalf() 433 static std::pair<uint64_t, bool> splitSigned(int64_t N) { in splitSigned() 527 static ScaledNumber getInverse(uint64_t N) { in getInverse() 530 static ScaledNumber getFraction(DigitsType N, DigitsType D) { in getFraction() 655 uint64_t scaleByInverse(uint64_t N) const { in scaleByInverse() 660 int64_t scale(int64_t N) const { in scale() 664 int64_t scaleByInverse(int64_t N) const { in scaleByInverse() 672 int compareTo(uint64_t N) const { in compareTo() 701 static ScaledNumber adjustToWidth(uint64_t N, int32_t Shift) { in adjustToWidth() 771 uint64_t ScaledNumber<DigitsT>::scale(uint64_t N) const { in scale() [all …]
|