Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 2703) sorted by relevance

12345678910>>...109

/src/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.h81 bool IgnoreNodeResults(SDNode *N) const { in IgnoreNodeResults() argument
82 return N->getOpcode() == ISD::TargetConstant || in IgnoreNodeResults()
83 N->getOpcode() == ISD::Register; in IgnoreNodeResults()
209 SDNode *AnalyzeNewNode(SDNode *N);
219 bool CustomLowerNode(SDNode *N, EVT VT, bool LegalizeResult);
220 bool CustomWidenLowerNode(SDNode *N, EVT VT);
225 SDValue DisintegrateMERGE_VALUES(SDNode *N, unsigned ResNo);
301 SDValue PromoteIntOpVectorReduction(SDNode *N, SDValue V);
304 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
305 SDValue PromoteIntRes_MERGE_VALUES(SDNode *N, unsigned ResNo);
[all …]
H A DLegalizeFloatTypes.cpp51 void DAGTypeLegalizer::SoftenFloatResult(SDNode *N, unsigned ResNo) { in SoftenFloatResult() argument
52 LLVM_DEBUG(dbgs() << "Soften float result " << ResNo << ": "; N->dump(&DAG)); in SoftenFloatResult()
55 switch (N->getOpcode()) { in SoftenFloatResult()
60 N->dump(&DAG); dbgs() << "\n"; in SoftenFloatResult()
64 case ISD::EXTRACT_ELEMENT: R = SoftenFloatRes_EXTRACT_ELEMENT(N); break; in SoftenFloatResult()
65 case ISD::ARITH_FENCE: R = SoftenFloatRes_ARITH_FENCE(N); break; in SoftenFloatResult()
66 case ISD::MERGE_VALUES:R = SoftenFloatRes_MERGE_VALUES(N, ResNo); break; in SoftenFloatResult()
67 case ISD::BITCAST: R = SoftenFloatRes_BITCAST(N); break; in SoftenFloatResult()
68 case ISD::BUILD_PAIR: R = SoftenFloatRes_BUILD_PAIR(N); break; in SoftenFloatResult()
69 case ISD::ConstantFP: R = SoftenFloatRes_ConstantFP(N); break; in SoftenFloatResult()
[all …]
H A DLegalizeIntegerTypes.cpp41 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) { in PromoteIntegerResult() argument
42 LLVM_DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG)); in PromoteIntegerResult()
46 if (CustomLowerNode(N, N->getValueType(ResNo), true)) { in PromoteIntegerResult()
51 switch (N->getOpcode()) { in PromoteIntegerResult()
55 N->dump(&DAG); dbgs() << "\n"; in PromoteIntegerResult()
58 case ISD::MERGE_VALUES:Res = PromoteIntRes_MERGE_VALUES(N, ResNo); break; in PromoteIntegerResult()
59 case ISD::AssertSext: Res = PromoteIntRes_AssertSext(N); break; in PromoteIntegerResult()
60 case ISD::AssertZext: Res = PromoteIntRes_AssertZext(N); break; in PromoteIntegerResult()
61 case ISD::BITCAST: Res = PromoteIntRes_BITCAST(N); break; in PromoteIntegerResult()
63 case ISD::BITREVERSE: Res = PromoteIntRes_BITREVERSE(N); break; in PromoteIntegerResult()
[all …]
H A DLegalizeVectorTypes.cpp41 void DAGTypeLegalizer::ScalarizeVectorResult(SDNode *N, unsigned ResNo) { in ScalarizeVectorResult() argument
43 N->dump(&DAG)); in ScalarizeVectorResult()
46 switch (N->getOpcode()) { in ScalarizeVectorResult()
50 N->dump(&DAG); in ScalarizeVectorResult()
56 case ISD::MERGE_VALUES: R = ScalarizeVecRes_MERGE_VALUES(N, ResNo);break; in ScalarizeVectorResult()
57 case ISD::BITCAST: R = ScalarizeVecRes_BITCAST(N); break; in ScalarizeVectorResult()
58 case ISD::BUILD_VECTOR: R = ScalarizeVecRes_BUILD_VECTOR(N); break; in ScalarizeVectorResult()
59 case ISD::EXTRACT_SUBVECTOR: R = ScalarizeVecRes_EXTRACT_SUBVECTOR(N); break; in ScalarizeVectorResult()
60 case ISD::FP_ROUND: R = ScalarizeVecRes_FP_ROUND(N); break; in ScalarizeVectorResult()
64 R = ScalarizeVecRes_UnaryOpWithExtraInput(N); in ScalarizeVectorResult()
[all …]
/src/contrib/arm-optimized-routines/math/
H A Dexp2f_data.c10 #define N (1 << EXP2F_TABLE_BITS) macro
17 #if N == 8
20 #elif N == 16
25 #elif N == 32
34 #elif N == 64
53 .shift_scaled = 0x1.8p+52 / N,
55 #if N == 8
57 #elif N == 16
59 #elif N == 32
61 #elif N == 64
[all …]
H A Dexp_data.c10 #define N (1 << EXP_TABLE_BITS) macro
14 .invln2N = 0x1.71547652b82fep0 * N,
15 .invlog10_2N = 0x1.a934f0979a371p1 * N,
17 #if N == 64
20 #elif N == 128
23 #elif N == 256
26 #elif N == 512
30 .neglog10_2hiN = -0x1.3441350ap-2 / N,
31 .neglog10_2loN = 0x1.0c0219dc1da99p-39 / N,
40 #if N == 64 && EXP_POLY_ORDER == 5 && !EXP_POLY_WIDE
[all …]
/src/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
46 ck_rwcohort_wp_##N##_read_lock(RW, C, GC, LC)
47 #define CK_RWCOHORT_WP_READ_UNLOCK(N, RW, C, GC, LC) \ argument
48 ck_rwcohort_wp_##N##_read_unlock(RW)
49 #define CK_RWCOHORT_WP_WRITE_LOCK(N, RW, C, GC, LC) \ argument
50 ck_rwcohort_wp_##N##_write_lock(RW, C, GC, LC)
51 #define CK_RWCOHORT_WP_WRITE_UNLOCK(N, RW, C, GC, LC) \ argument
[all …]
/src/sbin/pfctl/
H A Dpf.os140 # N - NOP option
203 16384:64:0:60:M512,N,W%2,N,N,T: AIX:4.3:3:AIX 4.3.3-5.2
204 16384:64:0:60:M512,N,W%2,N,N,T: AIX:5.1-5.2::AIX 4.3.3-5.2
205 32768:64:0:60:M512,N,W%2,N,N,T: AIX:4.3:3:AIX 4.3.3-5.2
206 32768:64:0:60:M512,N,W%2,N,N,T: AIX:5.1-5.2::AIX 4.3.3-5.2
207 65535:64:0:60:M512,N,W%2,N,N,T: AIX:4.3:3:AIX 4.3.3-5.2
208 65535:64:0:60:M512,N,W%2,N,N,T: AIX:5.1-5.2::AIX 4.3.3-5.2
209 65535:64:0:64:M*,N,W1,N,N,T,N,N,S: AIX:5.3:ML1:AIX 5.3 ML1
222 S4:64:1:60:M1360,S,T,N,W0: Linux:google::Linux (Google crawlbot)
224 S2:64:1:60:M*,S,T,N,W0: Linux:2.4::Linux 2.4 (big boy)
[all …]
/src/crypto/heimdal/lib/wind/
H A DUnicodeData.txt1 0000;<control>;Cc;0;BN;;;;;N;NULL;;;;
2 0001;<control>;Cc;0;BN;;;;;N;START OF HEADING;;;;
3 0002;<control>;Cc;0;BN;;;;;N;START OF TEXT;;;;
4 0003;<control>;Cc;0;BN;;;;;N;END OF TEXT;;;;
5 0004;<control>;Cc;0;BN;;;;;N;END OF TRANSMISSION;;;;
6 0005;<control>;Cc;0;BN;;;;;N;ENQUIRY;;;;
7 0006;<control>;Cc;0;BN;;;;;N;ACKNOWLEDGE;;;;
8 0007;<control>;Cc;0;BN;;;;;N;BELL;;;;
9 0008;<control>;Cc;0;BN;;;;;N;BACKSPACE;;;;
10 0009;<control>;Cc;0;S;;;;;N;CHARACTER TABULATION;;;;
[all …]
/src/crypto/krb5/src/lib/krb5/unicode/
H A DUnicodeData.txt1 0000;<control>;Cc;0;BN;;;;;N;NULL;;;;
2 0001;<control>;Cc;0;BN;;;;;N;START OF HEADING;;;;
3 0002;<control>;Cc;0;BN;;;;;N;START OF TEXT;;;;
4 0003;<control>;Cc;0;BN;;;;;N;END OF TEXT;;;;
5 0004;<control>;Cc;0;BN;;;;;N;END OF TRANSMISSION;;;;
6 0005;<control>;Cc;0;BN;;;;;N;ENQUIRY;;;;
7 0006;<control>;Cc;0;BN;;;;;N;ACKNOWLEDGE;;;;
8 0007;<control>;Cc;0;BN;;;;;N;BELL;;;;
9 0008;<control>;Cc;0;BN;;;;;N;BACKSPACE;;;;
10 0009;<control>;Cc;0;S;;;;;N;CHARACTER TABULATION;;;;
[all …]
/src/usr.bin/bmake/tests/
H A Dcommon.sh40 N=1
41 while [ ${N} -le ${TEST_N} ] ; do
42 if ! skip_test ${N} ; then
43 if [ ! -f ${OUTPUT_DIR}/status.${N} -o \
44 ! -f ${OUTPUT_DIR}/stdout.${N} -o \
45 ! -f ${OUTPUT_DIR}/stderr.${N} ] ; then
46 echo "Test ${SUBDIR}/${N} no yet run"
50 N=$((N + 1))
264 N=1
265 while [ ${N} -le ${TEST_N} ] ; do
[all …]
/src/crypto/openssl/test/recipes/10-test_bn_data/
H A Dbnshift.txt1216 # These test vectors satisfy A * 2^N = LShift.
1222 N = 1
1226 N = 2
1230 N = 3
1234 N = 4
1238 N = 5
1242 N = 6
1246 N = 7
1250 N = 8
1254 N = 9
[all …]
/src/contrib/llvm-project/llvm/include/llvm/Support/
H A DBranchProbability.h32 uint32_t N; variable
40 explicit BranchProbability(uint32_t n) : N(n) {} in BranchProbability()
43 BranchProbability() : N(UnknownN) {} in BranchProbability()
46 bool isZero() const { return N == 0; } in isZero()
47 bool isUnknown() const { return N == UnknownN; } in isUnknown()
54 static BranchProbability getRaw(uint32_t N) { return BranchProbability(N); } in getRaw() argument
65 uint32_t getNumerator() const { return N; } in getNumerator()
69 BranchProbability getCompl() const { return BranchProbability(D - N); } in getCompl()
92 assert(N != UnknownN && RHS.N != UnknownN &&
95 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N;
[all …]
/src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAG.h57 void Select(SDNode *N) override;
60 inline bool SelectAddrGA(SDValue &N, SDValue &R);
61 inline bool SelectAddrGP(SDValue &N, SDValue &R);
62 inline bool SelectAnyImm(SDValue &N, SDValue &R);
63 inline bool SelectAnyInt(SDValue &N, SDValue &R);
64 bool SelectAnyImmediate(SDValue &N, SDValue &R, Align Alignment);
65 bool SelectGlobalAddress(SDValue &N, SDValue &R, bool UseGP, Align Alignment);
66 bool SelectAddrFI(SDValue &N, SDValue &R);
67 bool DetectUseSxtw(SDValue &N, SDValue &R);
69 inline bool SelectAnyImm0(SDValue &N, SDValue &R);
[all …]
H A DHexagonISelDAGToDAG.cpp141 auto getExt64 = [this,ExtType] (MachineSDNode *N, const SDLoc &dl) in INITIALIZE_PASS()
146 Zero, SDValue(N, 0)); in INITIALIZE_PASS()
150 SDValue(N, 0)); in INITIALIZE_PASS()
151 return N; in INITIALIZE_PASS()
261 bool HexagonDAGToDAGISel::tryLoadOfLoadIntrinsic(LoadSDNode *N) { in tryLoadOfLoadIntrinsic() argument
275 SDValue Ch = N->getOperand(0); in tryLoadOfLoadIntrinsic()
276 SDValue Loc = N->getOperand(1); in tryLoadOfLoadIntrinsic()
305 if (N->getExtensionType() != IntExt) in tryLoadOfLoadIntrinsic()
315 SDValue F[] = { SDValue(N,0), SDValue(N,1), SDValue(C,0), SDValue(C,1) }; in tryLoadOfLoadIntrinsic()
455 void HexagonDAGToDAGISel::SelectLoad(SDNode *N) { in SelectLoad() argument
[all …]
/src/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelDAGToDAG.cpp82 void Select(SDNode *N) override;
88 bool hasNoVMLxHazardUse(SDNode *N) const;
91 bool SelectRegShifterOperand(SDValue N, SDValue &A,
94 bool SelectImmShifterOperand(SDValue N, SDValue &A,
96 bool SelectShiftRegShifterOperand(SDValue N, SDValue &A, SDValue &B, in SelectShiftRegShifterOperand() argument
99 return SelectRegShifterOperand(N, A, B, C, false); in SelectShiftRegShifterOperand()
101 bool SelectShiftImmShifterOperand(SDValue N, SDValue &A, SDValue &B) { in SelectShiftImmShifterOperand() argument
103 return SelectImmShifterOperand(N, A, B, false); in SelectShiftImmShifterOperand()
105 bool SelectShiftImmShifterOperandOneUse(SDValue N, SDValue &A, SDValue &B) { in SelectShiftImmShifterOperandOneUse() argument
106 if (!N.hasOneUse()) in SelectShiftImmShifterOperandOneUse()
[all …]
/src/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelMatcherGen.cpp116 void EmitMatchCode(const TreePatternNode &N, TreePatternNode &NodeNoTypes);
117 void EmitLeafMatchCode(const TreePatternNode &N);
118 void EmitOperatorMatchCode(const TreePatternNode &N,
134 void EmitResultOperand(const TreePatternNode &N,
136 void EmitResultOfNamedOperand(const TreePatternNode &N,
138 void EmitResultLeafAsOperand(const TreePatternNode &N,
140 void EmitResultInstructionAsOperand(const TreePatternNode &N,
142 void EmitResultSDNodeXFormAsOperand(const TreePatternNode &N,
201 void MatcherGen::EmitLeafMatchCode(const TreePatternNode &N) { in EmitLeafMatchCode() argument
202 assert(N.isLeaf() && "Not a leaf?"); in EmitLeafMatchCode()
[all …]
/src/contrib/llvm-project/clang/utils/TableGen/
H A DClangOpcodesEmitter.cpp35 void EmitEnum(raw_ostream &OS, StringRef N, const Record *R);
38 void EmitInterp(raw_ostream &OS, StringRef N, const Record *R);
41 void EmitDisasm(raw_ostream &OS, StringRef N, const Record *R);
44 void EmitEmitter(raw_ostream &OS, StringRef N, const Record *R);
47 void EmitProto(raw_ostream &OS, StringRef N, const Record *R);
50 void EmitGroup(raw_ostream &OS, StringRef N, const Record *R);
53 void EmitEval(raw_ostream &OS, StringRef N, const Record *R);
58 void Enumerate(const Record *R, StringRef N, in Enumerate() argument
81 Rec(0, N); in Enumerate()
89 StringRef N = Opcode->getValueAsString("Name"); in run() local
[all …]
H A DClangSyntaxEmitter.cpp50 for (NodeType &N : AllTypes) { in Hierarchy()
51 llvm::sort(N.Derived, [](const NodeType *L, const NodeType *R) { in Hierarchy()
55 assert(N.Record->isSubClassOf("Alternatives") || in Hierarchy()
56 N.Record->isSubClassOf("External") || N.Derived.empty()); in Hierarchy()
57 assert(!N.Record->isSubClassOf("Alternatives") || !N.Derived.empty()); in Hierarchy()
104 const Hierarchy::NodeType &firstConcrete(const Hierarchy::NodeType &N) { in firstConcrete() argument
105 return N.Derived.empty() ? N : firstConcrete(*N.Derived.front()); in firstConcrete()
107 const Hierarchy::NodeType &lastConcrete(const Hierarchy::NodeType &N) { in lastConcrete() argument
108 return N.Derived.empty() ? N : lastConcrete(*N.Derived.back()); in lastConcrete()
148 H.visit([&](const Hierarchy::NodeType &N) { in EmitClangSyntaxNodeList() argument
[all …]
/src/crypto/krb5/src/lib/krb5/unicode/ucdata/
H A DMUTTUCData.txt212 E900;DEVANAGARI KSHA LIGATURE;Lo;0;L;0915 094D 0937;;;;N;;;;;
213 E901;DEVANAGARI GNYA LIGATURE;Lo;0;L;091C 094D 091E;;;;N;;;;;
214 E902;DEVANAGARI TTA LIGATURE;Lo;0;L;0924 094D 0924;;;;N;;;;;
215 E903;DEVANAGARI TRA LIGATURE;Lo;0;L;0924 094D 0930;;;;N;;;;;
216 E904;DEVANAGARI SHCHA LIGATURE;Lo;0;L;0936 094D 091B;;;;N;;;;;
217 E905;DEVANAGARI SHRA LIGATURE;Lo;0;L;0936 094D 0930;;;;N;;;;;
218 E906;DEVANAGARI SHVA LIGATURE;Lo;0;L;0936 094D 0935;;;;N;;;;;
219 E907;DEVANAGARI KRA LIGATURE;Lo;0;L;;;;;N;;;;;
220 E908;DEVANAGARI JRA LIGATURE;Lo;0;L;;;;;N;;;;;
221 E909;DEVANAGARI ZRA LIGATURE;Lo;0;L;;;;;N;;;;;
[all …]
/src/contrib/libarchive/libarchive/
H A Darchive_rb.h52 #define ARCHIVE_RB_TREE_NEXT(T, N) \ argument
53 __archive_rb_tree_iterate((T), (N), ARCHIVE_RB_DIR_RIGHT)
54 #define ARCHIVE_RB_TREE_PREV(T, N) \ argument
55 __archive_rb_tree_iterate((T), (N), ARCHIVE_RB_DIR_LEFT)
56 #define ARCHIVE_RB_TREE_FOREACH(N, T) \ argument
57 for ((N) = ARCHIVE_RB_TREE_MIN(T); (N); \
58 (N) = ARCHIVE_RB_TREE_NEXT((T), (N)))
59 #define ARCHIVE_RB_TREE_FOREACH_REVERSE(N, T) \ argument
60 for ((N) = ARCHIVE_RB_TREE_MAX(T); (N); \
61 (N) = ARCHIVE_RB_TREE_PREV((T), (N)))
[all …]
/src/contrib/libpcap/
H A Dscanner.l157 N ([0-9]+|(0X|0x)[0-9A-Fa-f]+)
215 V6604 {W}:{W}:{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
217 V6504 ::{W}:{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
218 V6514 {W}::{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
219 V6524 {W}:{W}::{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
220 V6534 {W}:{W}:{W}::{W}:{W}:{N}\.{N}\.{N}\.{N}
221 V6544 {W}:{W}:{W}:{W}::{W}:{N}\.{N}\.{N}\.{N}
222 V6554 {W}:{W}:{W}:{W}:{W}::{N}\.{N}\.{N}\.{N}
224 V6404 ::{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
225 V6414 {W}::{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
[all …]
/src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h132 static NodeRef getEntryNode(VPBlockDeepTraversalWrapper<VPBlockBase *> N) {
133 return N.getEntry();
136 static inline ChildIteratorType child_begin(NodeRef N) {
137 return ChildIteratorType(N);
140 static inline ChildIteratorType child_end(NodeRef N) {
141 return ChildIteratorType::end(N);
151 getEntryNode(VPBlockDeepTraversalWrapper<const VPBlockBase *> N) {
152 return N.getEntry();
155 static inline ChildIteratorType child_begin(NodeRef N) {
156 return ChildIteratorType(N);
[all …]
/src/contrib/llvm-project/llvm/lib/Target/LoongArch/
H A DLoongArchISelDAGToDAG.cpp232 bool LoongArchDAGToDAGISel::selectShiftMask(SDValue N, unsigned ShiftWidth, in selectShiftMask() argument
237 if (N.getOpcode() == ISD::AND && isa<ConstantSDNode>(N.getOperand(1))) { in selectShiftMask()
238 const APInt &AndMask = N->getConstantOperandAPInt(1); in selectShiftMask()
246 ShAmt = N.getOperand(0); in selectShiftMask()
252 KnownBits Known = CurDAG->computeKnownBits(N->getOperand(0)); in selectShiftMask()
254 ShAmt = N.getOperand(0); in selectShiftMask()
257 } else if (N.getOpcode() == LoongArchISD::BSTRPICK) { in selectShiftMask()
261 assert(isa<ConstantSDNode>(N.getOperand(1)) && "Illegal msb operand!"); in selectShiftMask()
262 assert(isa<ConstantSDNode>(N.getOperand(2)) && "Illegal lsb operand!"); in selectShiftMask()
263 uint64_t msb = N.getConstantOperandVal(1), lsb = N.getConstantOperandVal(2); in selectShiftMask()
[all …]
/src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h32 explicit DGEdge(NodeType &N) : TargetNode(N) {} in DGEdge() argument
55 void setTargetNode(const NodeType &N) { TargetNode = N; } in setTargetNode() argument
83 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode() argument
84 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode() argument
86 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &N) {
87 Edges = N.Edges;
90 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &&N) {
91 Edges = std::move(N.Edges);
97 friend bool operator==(const NodeType &M, const NodeType &N) {
98 return M.isEqualTo(N);
[all …]

12345678910>>...109