Home
last modified time | relevance | path

Searched defs:N (Results 1 – 25 of 1076) sorted by relevance

12345678910>>...44

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeFloatTypes.cpp51 void DAGTypeLegalizer::SoftenFloatResult(SDNode *N, unsigned ResNo) { in SoftenFloatResult()
190 SDValue DAGTypeLegalizer::SoftenFloatRes_Unary(SDNode *N, RTLIB::Libcall LC) { in SoftenFloatRes_Unary()
209 SDValue DAGTypeLegalizer::SoftenFloatRes_Binary(SDNode *N, RTLIB::Libcall LC) { in SoftenFloatRes_Binary()
230 SDValue DAGTypeLegalizer::SoftenFloatRes_BITCAST(SDNode *N) { in SoftenFloatRes_BITCAST()
234 SDValue DAGTypeLegalizer::SoftenFloatRes_FREEZE(SDNode *N) { in SoftenFloatRes_FREEZE()
240 SDValue DAGTypeLegalizer::SoftenFloatRes_ARITH_FENCE(SDNode *N) { in SoftenFloatRes_ARITH_FENCE()
247 SDValue DAGTypeLegalizer::SoftenFloatRes_MERGE_VALUES(SDNode *N, in SoftenFloatRes_MERGE_VALUES()
253 SDValue DAGTypeLegalizer::SoftenFloatRes_BUILD_PAIR(SDNode *N) { in SoftenFloatRes_BUILD_PAIR()
262 SDValue DAGTypeLegalizer::SoftenFloatRes_ConstantFP(SDNode *N) { in SoftenFloatRes_ConstantFP()
286 SDValue DAGTypeLegalizer::SoftenFloatRes_EXTRACT_ELEMENT(SDNode *N) { in SoftenFloatRes_EXTRACT_ELEMENT()
[all …]
H A DLegalizeIntegerTypes.cpp41 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) { in PromoteIntegerResult()
367 SDValue DAGTypeLegalizer::PromoteIntRes_MERGE_VALUES(SDNode *N, in PromoteIntRes_MERGE_VALUES()
373 SDValue DAGTypeLegalizer::PromoteIntRes_AssertSext(SDNode *N) { in PromoteIntRes_AssertSext()
380 SDValue DAGTypeLegalizer::PromoteIntRes_AssertZext(SDNode *N) { in PromoteIntRes_AssertZext()
387 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic0(AtomicSDNode *N) { in PromoteIntRes_Atomic0()
416 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic1(AtomicSDNode *N) { in PromoteIntRes_Atomic1()
428 SDValue DAGTypeLegalizer::PromoteIntRes_AtomicCmpSwap(AtomicSDNode *N, in PromoteIntRes_AtomicCmpSwap()
479 SDValue DAGTypeLegalizer::PromoteIntRes_BITCAST(SDNode *N) { in PromoteIntRes_BITCAST()
604 SDValue DAGTypeLegalizer::PromoteIntRes_FREEZE(SDNode *N) { in PromoteIntRes_FREEZE()
610 SDValue DAGTypeLegalizer::PromoteIntRes_BSWAP(SDNode *N) { in PromoteIntRes_BSWAP()
[all …]
H A DLegalizeTypesGeneric.cpp34 void DAGTypeLegalizer::ExpandRes_MERGE_VALUES(SDNode *N, unsigned ResNo, in ExpandRes_MERGE_VALUES()
40 void DAGTypeLegalizer::ExpandRes_BITCAST(SDNode *N, SDValue &Lo, SDValue &Hi) { in ExpandRes_BITCAST()
190 void DAGTypeLegalizer::ExpandRes_BUILD_PAIR(SDNode *N, SDValue &Lo, in ExpandRes_BUILD_PAIR()
197 void DAGTypeLegalizer::ExpandRes_EXTRACT_ELEMENT(SDNode *N, SDValue &Lo, in ExpandRes_EXTRACT_ELEMENT()
208 void DAGTypeLegalizer::ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo, in ExpandRes_EXTRACT_VECTOR_ELT()
247 void DAGTypeLegalizer::ExpandRes_NormalLoad(SDNode *N, SDValue &Lo, in ExpandRes_NormalLoad()
286 void DAGTypeLegalizer::ExpandRes_VAARG(SDNode *N, SDValue &Lo, SDValue &Hi) { in ExpandRes_VAARG()
331 SDValue DAGTypeLegalizer::ExpandOp_BITCAST(SDNode *N) { in ExpandOp_BITCAST()
367 SDValue DAGTypeLegalizer::ExpandOp_BUILD_VECTOR(SDNode *N) { in ExpandOp_BUILD_VECTOR()
408 SDValue DAGTypeLegalizer::ExpandOp_EXTRACT_ELEMENT(SDNode *N) { in ExpandOp_EXTRACT_ELEMENT()
[all …]
H A DLegalizeVectorTypes.cpp41 void DAGTypeLegalizer::ScalarizeVectorResult(SDNode *N, unsigned ResNo) { in ScalarizeVectorResult()
246 SDValue DAGTypeLegalizer::ScalarizeVecRes_BinOp(SDNode *N) { in ScalarizeVecRes_BinOp()
253 SDValue DAGTypeLegalizer::ScalarizeVecRes_CMP(SDNode *N) { in ScalarizeVecRes_CMP()
272 SDValue DAGTypeLegalizer::ScalarizeVecRes_TernaryOp(SDNode *N) { in ScalarizeVecRes_TernaryOp()
280 SDValue DAGTypeLegalizer::ScalarizeVecRes_FIX(SDNode *N) { in ScalarizeVecRes_FIX()
289 DAGTypeLegalizer::ScalarizeVecRes_UnaryOpWithTwoResults(SDNode *N, in ScalarizeVecRes_UnaryOpWithTwoResults()
318 SDValue DAGTypeLegalizer::ScalarizeVecRes_StrictFPOp(SDNode *N) { in ScalarizeVecRes_StrictFPOp()
355 SDValue DAGTypeLegalizer::ScalarizeVecRes_OverflowOp(SDNode *N, in ScalarizeVecRes_OverflowOp()
393 SDValue DAGTypeLegalizer::ScalarizeVecRes_MERGE_VALUES(SDNode *N, in ScalarizeVecRes_MERGE_VALUES()
399 SDValue DAGTypeLegalizer::ScalarizeVecRes_BITCAST(SDNode *N) { in ScalarizeVecRes_BITCAST()
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_rwcohort.h42 #define CK_RWCOHORT_WP_NAME(N) ck_rwcohort_wp_##N argument
43 #define CK_RWCOHORT_WP_INSTANCE(N) struct CK_RWCOHORT_WP_NAME(N) argument
44 #define CK_RWCOHORT_WP_INIT(N, RW, WL) ck_rwcohort_wp_##N##_init(RW, WL) 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
147 #define CK_RWCOHORT_RP_INSTANCE(N) struct CK_RWCOHORT_RP_NAME(N) argument
[all …]
H A Dck_cohort.h48 #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/clang/utils/TableGen/
H A DClangOpcodesEmitter.cpp58 void Enumerate(const Record *R, StringRef N, in Enumerate()
89 StringRef N = Opcode->getValueAsString("Name"); in run() local
103 void ClangOpcodesEmitter::EmitEnum(raw_ostream &OS, StringRef N, in EmitEnum()
112 void ClangOpcodesEmitter::EmitInterp(raw_ostream &OS, StringRef N, in EmitInterp()
128 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitInterp() local
149 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitInterp() local
169 void ClangOpcodesEmitter::EmitDisasm(raw_ostream &OS, StringRef N, in EmitDisasm()
184 void ClangOpcodesEmitter::EmitEmitter(raw_ostream &OS, StringRef N, in EmitEmitter()
195 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitEmitter() local
207 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitEmitter() local
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h32 explicit DGEdge(NodeType &N) : TargetNode(N) {} in DGEdge()
55 void setTargetNode(const NodeType &N) { TargetNode = N; } in setTargetNode()
83 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode()
84 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode()
117 bool findEdgesTo(const NodeType &N, SmallVectorImpl<EdgeType *> &EL) const { in findEdgesTo()
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()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.h90 bool selectShiftMaskXLen(SDValue N, SDValue &ShAmt) { in selectShiftMaskXLen()
93 bool selectShiftMask32(SDValue N, SDValue &ShAmt) { in selectShiftMask32()
98 bool selectSETNE(SDValue N, SDValue &Val) { in selectSETNE()
101 bool selectSETEQ(SDValue N, SDValue &Val) { in selectSETEQ()
106 template <unsigned Bits> bool selectSExtBits(SDValue N, SDValue &Val) { in selectSExtBits()
110 template <unsigned Bits> bool selectZExtBits(SDValue N, SDValue &Val) { in selectZExtBits()
115 template <unsigned ShAmt> bool selectSHXADDOp(SDValue N, SDValue &Val) { in selectSHXADDOp()
120 template <unsigned ShAmt> bool selectSHXADD_UWOp(SDValue N, SDValue &Val) { in selectSHXADD_UWOp()
142 template <unsigned Bits> bool selectVSplatUimmBits(SDValue N, SDValue &Val) { in selectVSplatUimmBits()
155 template <unsigned Width> bool selectRVVSimm5(SDValue N, SDValue &Imm) { in selectRVVSimm5()
/freebsd/contrib/llvm-project/lldb/source/Core/
H A DDemangledNameInfo.cpp116 void TrackingOutputBuffer::printLeft(const Node &N) { in printLeft()
135 void TrackingOutputBuffer::printRight(const Node &N) { in printRight()
148 void TrackingOutputBuffer::printLeftImpl(const FunctionType &N) { in printLeftImpl()
153 void TrackingOutputBuffer::printRightImpl(const FunctionType &N) { in printRightImpl()
158 void TrackingOutputBuffer::printLeftImpl(const FunctionEncoding &N) { in printLeftImpl()
173 void TrackingOutputBuffer::printRightImpl(const FunctionEncoding &N) { in printRightImpl()
216 void TrackingOutputBuffer::printLeftImpl(const NestedName &N) { in printLeftImpl()
224 void TrackingOutputBuffer::printLeftImpl(const NameWithTemplateArgs &N) { in printLeftImpl()
/freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DMsgPackDocument.h229 MapDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Map); } in MapDocNode()
259 ArrayDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Array); } in ArrayDocNode()
267 void push_back(DocNode N) { in push_back()
310 auto N = DocNode(&KindAndDocs[size_t(Type::Empty)]); in getEmptyNode() local
316 auto N = DocNode(&KindAndDocs[size_t(Type::Nil)]); in getNode() local
322 auto N = DocNode(&KindAndDocs[size_t(Type::Int)]); in getNode() local
329 auto N = DocNode(&KindAndDocs[size_t(Type::Int)]); in getNode() local
336 auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]); in getNode() local
343 auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]); in getNode() local
350 auto N = DocNode(&KindAndDocs[size_t(Type::Boolean)]); in getNode() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DDiagnosticPrinter.cpp53 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/lib/Support/
H A DNativeFormatting.cpp25 static int format_to_buffer(T Value, char (&Buffer)[N]) { in format_to_buffer()
55 static void write_unsigned_impl(raw_ostream &S, T N, size_t MinDigits, in write_unsigned_impl()
78 static void write_unsigned(raw_ostream &S, T N, size_t MinDigits, in write_unsigned()
89 static void write_signed(raw_ostream &S, T N, size_t MinDigits, in write_signed()
104 void llvm::write_integer(raw_ostream &S, unsigned int N, size_t MinDigits, in write_integer()
109 void llvm::write_integer(raw_ostream &S, int N, size_t MinDigits, in write_integer()
114 void llvm::write_integer(raw_ostream &S, unsigned long N, size_t MinDigits, in write_integer()
119 void llvm::write_integer(raw_ostream &S, long N, size_t MinDigits, in write_integer()
124 void llvm::write_integer(raw_ostream &S, unsigned long long N, size_t MinDigits, in write_integer()
129 void llvm::write_integer(raw_ostream &S, long long N, size_t MinDigits, in write_integer()
[all …]
H A DBalancedPartitioning.cpp124 for (auto &N : Nodes) in bisect() local
144 llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; }); in bisect()
173 for (auto &N : Nodes) in runIterations() local
178 for (auto &N : Nodes) in runIterations() local
186 for (auto &N : Nodes) in runIterations() local
192 for (auto &N : Nodes) { in runIterations() local
236 for (auto &N : Nodes) { in runIteration() local
271 bool BalancedPartitioning::moveFunctionNode(BPFunctionNode &N, in moveFunctionNode()
313 for (auto &N : llvm::make_range(Nodes.begin(), NodesMid)) in split() local
315 for (auto &N : llvm::make_range(NodesMid, Nodes.end())) in split() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DRecordSerialization.cpp51 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; consume() local
86 int64_t N; consume() local
93 uint64_t N; consume() local
116 APSInt N; consume_numeric() local
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DScheduler.cpp17 for (auto *N : drop_begin(Nodes)) { in getTop() local
26 for (auto *N : drop_begin(Nodes)) { in getBot() local
34 for (auto *N : Nodes) { in cluster() local
44 for (auto *N : Nodes) in dump() local
91 auto *N = DAG.getNode(I); in notifyCreateInstr() local
192 for (auto *N : make_early_inc_range(Retry)) { in tryScheduleUntil() local
213 auto *N = DAG.getNode(I); in getBndlSchedState() local
259 auto *N = DAG.getNode(I); in trimSchedule() local
273 auto *N = DAG.getNode(&I); in trimSchedule() local
284 auto *N = DAG.getNode(&I); in trimSchedule() local
[all …]
/freebsd/crypto/openssl/crypto/srp/
H A Dsrp_lib.c26 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()
136 BIGNUM *SRP_Calc_B(const BIGNUM *b, const BIGNUM *N, const BIGNUM *g, in SRP_Calc_B()
194 BIGNUM *SRP_Calc_A(const BIGNUM *a, const BIGNUM *N, const BIGNUM *g) in SRP_Calc_A()
210 BIGNUM *SRP_Calc_client_key_ex(const BIGNUM *N, const BIGNUM *B, const BIGNUM *g, in SRP_Calc_client_key_ex()
255 BIGNUM *SRP_Calc_client_key(const BIGNUM *N, const BIGNUM *B, const BIGNUM *g, in SRP_Calc_client_key()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/aarch64/
H A Dlse.S66 #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 DTree.cpp18 static void traverse(const syntax::Node *N, in traverse()
26 static void traverse(syntax::Node *N, in traverse()
28 traverse(static_cast<const syntax::Node *>(N), [&](const syntax::Node *N) { in traverse()
107 for (auto *N = New; N; N = N->NextSibling) { in replaceChildRangeLowLevel() local
113 auto Reachable = [](Node *From, Node *N) { in replaceChildRangeLowLevel()
137 for (auto *N = Begin; N != End;) { in replaceChildRangeLowLevel() local
164 for (auto *N = New; N != nullptr; N = N->NextSibling) { in replaceChildRangeLowLevel() local
173 static void dumpNode(raw_ostream &OS, const syntax::Node *N, in dumpNode()
175 auto DumpExtraInfo = [&OS](const syntax::Node *N) { in dumpNode()
229 traverse(this, [&](const syntax::Node *N) { in dumpTokens()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ISelDAGToDAG.cpp78 bool SelectArithShiftedRegister(SDValue N, SDValue &Reg, SDValue &Shift) { in SelectArithShiftedRegister()
81 bool SelectLogicalShiftedRegister(SDValue N, SDValue &Reg, SDValue &Shift) { in SelectLogicalShiftedRegister()
84 bool SelectAddrModeIndexed7S8(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexed7S8()
87 bool SelectAddrModeIndexed7S16(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexed7S16()
90 bool SelectAddrModeIndexed7S32(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexed7S32()
93 bool SelectAddrModeIndexed7S64(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexed7S64()
96 bool SelectAddrModeIndexed7S128(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexed7S128()
99 bool SelectAddrModeIndexedS9S128(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexedS9S128()
102 bool SelectAddrModeIndexedU6S128(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexedU6S128()
105 bool SelectAddrModeIndexed8(SDValue N, SDValue &Base, SDValue &OffImm) { in SelectAddrModeIndexed8()
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DDAGISelMatcher.h214 void resetChild(unsigned i, Matcher *N) { in resetChild()
234 static bool classof(const Matcher *N) { return N->getKind() == Scope; } in classof()
258 static bool classof(const Matcher *N) { return N->getKind() == RecordNode; } in classof()
289 static bool classof(const Matcher *N) { return N->getKind() == RecordChild; } in classof()
303 static bool classof(const Matcher *N) { return N->getKind() == RecordMemRef; } in classof()
316 static bool classof(const Matcher *N) { in classof()
335 static bool classof(const Matcher *N) { return N->getKind() == MoveChild; } in classof()
355 static bool classof(const Matcher *N) { return N->getKind() == MoveSibling; } in classof()
370 static bool classof(const Matcher *N) { return N->getKind() == MoveParent; } in classof()
389 static bool classof(const Matcher *N) { return N->getKind() == CheckSame; } in classof()
[all …]
/freebsd/contrib/libarchive/libarchive/
H A Darchive_rb.h52 #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/Common/GlobalISel/
H A DCombinerUtils.h24 inline bool isSpecificDef(const Init &N, StringRef Def) { in isSpecificDef()
35 inline const 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/crypto/krb5/src/plugins/kdb/db2/libdb2/hash/
H A Dpage.h42 #define HI(N) ((u_int16_t)(((N) & HI_MASK) >> 16)) argument
43 #define LO(N) ((u_int16_t)((N) & LO_MASK)) argument
109 #define DATA_OFF(P, N) \ argument
111 #define KEY_OFF(P, N) \ argument
114 #define KEY(P, N) (((PAGE8 *)(P)) + KEY_OFF((P), (N))) argument
115 #define DATA(P, N) (((PAGE8 *)(P)) + DATA_OFF((P), (N))) argument
128 #define PAGE_META(N) (((N) + 3) * sizeof(u_int16_t)) argument
130 #define ISBIG(N, P) (((N) > ((P)->hdr.bsize * MINFILL)) ? 1 : 0) argument
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDDG.cpp81 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()

12345678910>>...44