Home
last modified time | relevance | path

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

12345678910>>...145

/openbsd/src/sys/dev/hid/
Dhidcc.c121 #define N(usage, name, key, raw) macro
123 N(0x0001, "Consumer Control", 0, 0)
124 N(0x0002, "Numeric Key Pad", 0, 0)
125 N(0x0003, "Programmable Buttons", 0, 0)
126 N(0x0004, "Microphone", 0, 0)
127 N(0x0005, "Headphone", 0, 0)
128 N(0x0006, "Graphic Equalizer", 0, 0)
130 N(0x0020, "+10", 0, 0)
131 N(0x0021, "+100", 0, 0)
132 N(0x0022, "AM/PM", 0, 0)
[all …]
/openbsd/src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.h80 bool IgnoreNodeResults(SDNode *N) const { in IgnoreNodeResults() argument
81 return N->getOpcode() == ISD::TargetConstant || in IgnoreNodeResults()
82 N->getOpcode() == ISD::Register; in IgnoreNodeResults()
210 SDNode *AnalyzeNewNode(SDNode *N);
220 bool CustomLowerNode(SDNode *N, EVT VT, bool LegalizeResult);
221 bool CustomWidenLowerNode(SDNode *N, EVT VT);
226 SDValue DisintegrateMERGE_VALUES(SDNode *N, unsigned ResNo);
295 SDValue PromoteIntOpVectorReduction(SDNode *N, SDValue V);
298 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
299 SDValue PromoteIntRes_MERGE_VALUES(SDNode *N, unsigned ResNo);
[all …]
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()
56 switch (N->getOpcode()) { in SoftenFloatResult()
60 N->dump(&DAG); dbgs() << "\n"; in SoftenFloatResult()
64 case ISD::ARITH_FENCE: R = SoftenFloatRes_ARITH_FENCE(N); break; in SoftenFloatResult()
65 case ISD::MERGE_VALUES:R = SoftenFloatRes_MERGE_VALUES(N, ResNo); break; in SoftenFloatResult()
66 case ISD::BITCAST: R = SoftenFloatRes_BITCAST(N); break; in SoftenFloatResult()
67 case ISD::BUILD_PAIR: R = SoftenFloatRes_BUILD_PAIR(N); break; in SoftenFloatResult()
68 case ISD::ConstantFP: R = SoftenFloatRes_ConstantFP(N); break; in SoftenFloatResult()
70 R = SoftenFloatRes_EXTRACT_VECTOR_ELT(N, ResNo); break; in SoftenFloatResult()
[all …]
DLegalizeIntegerTypes.cpp40 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) { in PromoteIntegerResult() argument
41 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()
62 case ISD::BITREVERSE: Res = PromoteIntRes_BITREVERSE(N); break; in PromoteIntegerResult()
[all …]
DLegalizeVectorTypes.cpp40 void DAGTypeLegalizer::ScalarizeVectorResult(SDNode *N, unsigned ResNo) { in ScalarizeVectorResult() argument
41 LLVM_DEBUG(dbgs() << "Scalarize node result " << ResNo << ": "; N->dump(&DAG); in ScalarizeVectorResult()
45 switch (N->getOpcode()) { in ScalarizeVectorResult()
49 N->dump(&DAG); in ScalarizeVectorResult()
55 case ISD::MERGE_VALUES: R = ScalarizeVecRes_MERGE_VALUES(N, ResNo);break; in ScalarizeVectorResult()
56 case ISD::BITCAST: R = ScalarizeVecRes_BITCAST(N); break; in ScalarizeVectorResult()
57 case ISD::BUILD_VECTOR: R = ScalarizeVecRes_BUILD_VECTOR(N); break; in ScalarizeVectorResult()
58 case ISD::EXTRACT_SUBVECTOR: R = ScalarizeVecRes_EXTRACT_SUBVECTOR(N); break; in ScalarizeVectorResult()
59 case ISD::FP_ROUND: R = ScalarizeVecRes_FP_ROUND(N); break; in ScalarizeVectorResult()
60 case ISD::FPOWI: R = ScalarizeVecRes_FPOWI(N); break; in ScalarizeVectorResult()
[all …]
/openbsd/src/gnu/usr.bin/perl/lib/unicore/
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 …]
DEastAsianWidth.txt18 # "A", "F", "H", "N", "Na", "W"
20 # explicitly are given the value "N".
42 # @missing: 0000..10FFFF; N
43 0000..001F;N # Cc [32] <control-0000>..<control-001F>
71 007F;N # Cc <control-007F>
72 0080..009F;N # Cc [32] <control-0080>..<control-009F>
73 00A0;N # Zs NO-BREAK SPACE
81 00A9;N # So COPYRIGHT SIGN
83 00AB;N # Pi LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
92 00B5;N # Ll MICRO SIGN
[all …]
/openbsd/src/gnu/usr.bin/perl/dist/Tie-File/t/
D43_synopsis.t22 my $N = 1;
24 print "ok $N - use Tie::File\n"; $N++;
31 ? print "ok $N - $desc\n"
32 : print "not ok $N - $desc\n";
33 $N++;
37 ? print "ok $N - $desc\n"
38 : print "not ok $N - $desc\n";
39 $N++;
43 ? print "ok $N - $desc\n"
44 : print "not ok $N - $desc\n";
[all …]
D41_heap.t31 my ($N, @R, $Q, $ar) = (1);
34 print "ok $N\n";
35 $N++;
44 print "ok $N\n";
45 $N++;
57 print $good ? "ok $N\n" : "not ok $N\n";
58 $N++;
71 ? "ok $N\n" : "not ok $N \# expected ($iota), got (@R)\n";
72 $N++;
76 print ! defined $n ? "ok $N\n" : "not ok $N \# expected UNDEF, got $n";
[all …]
D15_pushpop.t24 my $N = 1;
26 print "ok $N\n"; $N++; # partial credit just for showing up
30 print $o ? "ok $N\n" : "not ok $N\n";
31 $N++;
38 print $n == 3 ? "ok $N\n" : "not ok $N # size is $n, should be 3\n";
39 $N++;
43 print $n == 5 ? "ok $N\n" : "not ok $N # size is $n, should be 5\n";
44 $N++;
49 print $n == 5 ? "ok $N\n" : "not ok $N # size is $n, should be 5\n";
50 $N++;
[all …]
D40_abs_cache.t30 my ($N, @R, $Q, $ar) = (1);
33 print "ok $N\n";
34 $N++;
37 print "ok $N\n";
38 $N++;
52 print $good ? "ok $N\n" : "not ok $N\n";
53 $N++;
67 ? "ok $N\n" : "not ok $N \# expected ($iota), got (@R)\n";
68 $N++;
73 print ! defined $n ? "ok $N\n" : "not ok $N \# expected UNDEF, got $n";
[all …]
D08_ro.t14 my $N = 1;
17 print "ok $N\n"; $N++;
24 print $o ? "ok $N\n" : "not ok $N\n";
25 $N++;
27 $#a == $#items ? print "ok $N\n" : print "not ok $N\n";
28 $N++;
31 ("$items[$i]$:" eq $a[$i]) ? print "ok $N\n" : print "not ok $N\n";
32 $N++;
55 print $a[0] eq "Malformed$:" ? "ok $N\n" : "not ok $N\n"; $N++;
56 print $good ? "ok $N\n" : "not ok $N # $warn\n"; $good = 1; $N++;
[all …]
/openbsd/src/etc/
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 …]
/openbsd/src/regress/usr.sbin/bgpd/integrationtests/
Dmaxattr.test1.ok3 origin validation state: N = not-found, V = valid, ! = invalid
8 * N-? 10.12.60.0/24 10.12.57.2 100 0 4200000001 4200000002 i
9 * N-? 10.12.61.0/24 10.12.57.2 100 0 4200000001 4200000002 i
10 * N-? 10.12.62.0/24 10.12.57.2 100 0 4200000001 4200000002 i
11 * N-? 10.12.63.0/24 10.12.57.2 100 0 4200000001 4200000002 i
12 * N-? 10.12.64.0/24 10.12.57.2 100 0 4200000001 4200000002 i
13 * N-? 10.12.65.0/24 10.12.57.2 100 0 4200000001 4200000002 i
14 * N-? 10.12.66.0/24 10.12.57.2 100 0 4200000001 4200000002 i
15 * N-? 2001:db8:60::/48 2001:db8:57::2 100 0 4200000001 4200000002 i
16 * N-? 2001:db8:61::/48 2001:db8:57::2 100 0 4200000001 4200000002 i
[all …]
Dmaxattr.test2.ok3 origin validation state: N = not-found, V = valid, ! = invalid
8 * N-? 10.12.60.0/24 10.12.57.2 100 0 4200000001 4200000002 i
9 * N-? 10.12.61.0/24 10.12.57.2 100 0 4200000001 4200000002 i
10 * N-? 10.12.62.0/24 10.12.57.2 100 0 4200000001 4200000001 4200000002 i
11 * N-? 10.12.63.0/24 10.12.57.2 100 0 4200000001 4200000001 4200000001 4200000…
12 * N-? 10.12.64.0/24 10.12.57.2 100 0 4200000001 4200000002 i
13 * N-? 10.12.65.0/24 10.12.57.2 100 0 4200000001 4200000002 i
14 * N-? 10.12.66.0/24 10.12.57.2 100 0 4200000001 4200000002 i
15 * N-? 2001:db8:60::/48 2001:db8:57::2 100 0 4200000001 4200000002 i
16 * N-? 2001:db8:61::/48 2001:db8:57::2 100 0 4200000001 4200000002 i
[all …]
Daddpath.rdomain2.ok3 origin validation state: N = not-found, V = valid, ! = invalid
8 *> N-? 2.0.1.0/24 192.0.2.21 100 2 2 i
9 *> N-? 2.0.2.0/24 192.0.2.21 100 2 2 i
10 * N-? 2.0.2.0/24 192.0.2.31 100 3 3 i
11 *> N-? 2.0.3.0/24 192.0.2.21 100 2 2 i
12 * N-? 2.0.3.0/24 192.0.2.31 100 3 3 i
13 * N-? 2.0.3.0/24 192.0.2.41 100 4 4 i
14 *> N-? 2.0.4.0/24 192.0.2.21 100 2 2 i
15 * N-? 2.0.4.0/24 192.0.2.31 100 3 3 i
16 * N-? 2.0.4.0/24 192.0.2.41 100 4 4 i
[all …]
/openbsd/src/gnu/usr.bin/binutils/opcodes/
Dmmix-opc.c77 #define N mmix_type_normal macro
97 {"fcmp", O (1), OP (regs), N},
98 {"flot", Z (8), OP (roundregs_z), N},
100 {"fun", O (2), OP (regs), N},
101 {"feql", O (3), OP (regs), N},
102 {"flotu", Z (10), OP (roundregs_z), N},
104 {"fadd", O (4), OP (regs), N},
105 {"fix", O (5), OP (roundregs), N},
106 {"sflot", Z (12), OP (roundregs_z), N},
108 {"fsub", O (6), OP (regs), N},
[all …]
/openbsd/src/gnu/usr.bin/binutils-2.17/opcodes/
Dmmix-opc.c77 #define N mmix_type_normal macro
97 {"fcmp", O (1), OP (regs), N},
98 {"flot", Z (8), OP (roundregs_z), N},
100 {"fun", O (2), OP (regs), N},
101 {"feql", O (3), OP (regs), N},
102 {"flotu", Z (10), OP (roundregs_z), N},
104 {"fadd", O (4), OP (regs), N},
105 {"fix", O (5), OP (roundregs), N},
106 {"sflot", Z (12), OP (roundregs_z), N},
108 {"fsub", O (6), OP (regs), N},
[all …]
/openbsd/src/gnu/usr.bin/gcc/gcc/testsuite/gcc.dg/
Dstruct-by-value-1.c5 #define T(N) \ argument
6 struct S##N { unsigned char i[N]; }; \
7 struct S##N g1s##N, g2s##N, g3s##N; \
10 init##N (struct S##N *p, int i) \
13 for (j = 0; j < N; j++) \
18 check##N (struct S##N *p, int i) \
21 for (j = 0; j < N; j++) \
26 test##N (struct S##N s1, struct S##N s2, \
27 struct S##N s3) \
29 check##N (&s1, 64); \
[all …]
/openbsd/src/gnu/usr.bin/perl/lib/unicore/extracted/
DDEastAsianWidth.txt15 # have the value Neutral (N).
44 0000..001F ; N # Cc [32] <control-0000>..<control-001F>
45 007F..009F ; N # Cc [33] <control-007F>..<control-009F>
46 00A0 ; N # Zs NO-BREAK SPACE
47 00A9 ; N # So COPYRIGHT SIGN
48 00AB ; N # Pi LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
49 00B5 ; N # L& MICRO SIGN
50 00BB ; N # Pf RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK
51 00C0..00C5 ; N # L& [6] LATIN CAPITAL LETTER A WITH GRAVE..LATIN CAPITAL LETTER A WITH RING AB…
52 00C7..00CF ; N # L& [9] LATIN CAPITAL LETTER C WITH CEDILLA..LATIN CAPITAL LETTER I WITH DIAER…
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/Support/
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 …]
/openbsd/src/lib/libpcap/
Dscanner.l80 N ([0-9]+|(0X|0x)[0-9A-Fa-f]+)
136 V6604 {W}:{W}:{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
138 V6504 ::{W}:{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
139 V6514 {W}::{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
140 V6524 {W}:{W}::{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
141 V6534 {W}:{W}:{W}::{W}:{W}:{N}\.{N}\.{N}\.{N}
142 V6544 {W}:{W}:{W}:{W}::{W}:{N}\.{N}\.{N}\.{N}
143 V6554 {W}:{W}:{W}:{W}:{W}::{N}\.{N}\.{N}\.{N}
145 V6404 ::{W}:{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
146 V6414 {W}::{W}:{W}:{W}:{N}\.{N}\.{N}\.{N}
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/Hexagon/
DHexagonISelDAGToDAG.h59 void Select(SDNode *N) override;
62 inline bool SelectAddrGA(SDValue &N, SDValue &R);
63 inline bool SelectAddrGP(SDValue &N, SDValue &R);
64 inline bool SelectAnyImm(SDValue &N, SDValue &R);
65 inline bool SelectAnyInt(SDValue &N, SDValue &R);
66 bool SelectAnyImmediate(SDValue &N, SDValue &R, Align Alignment);
67 bool SelectGlobalAddress(SDValue &N, SDValue &R, bool UseGP, Align Alignment);
68 bool SelectAddrFI(SDValue &N, SDValue &R);
69 bool DetectUseSxtw(SDValue &N, SDValue &R);
71 inline bool SelectAnyImm0(SDValue &N, SDValue &R);
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/testsuite/25_algorithms/
Dbinary_search.cc28 const int N = sizeof(A) / sizeof(int); variable
50 const int last = A[N - 1]; in test01()
52 const int* p = lower_bound(A, A + N, 3); in test01()
55 const int* q = lower_bound(A, A + N, first); in test01()
58 const int* r = lower_bound(A, A + N, last); in test01()
59 VERIFY(r == A + N - 1); in test01()
61 const int* s = lower_bound(A, A + N, 4); in test01()
64 const int* t = lower_bound(C, C + N, 3, gt()); in test01()
67 const int* u = lower_bound(C, C + N, first, gt()); in test01()
68 VERIFY(u == C + N - 1); in test01()
[all …]
Dsort.cc29 const int N = sizeof(A) / sizeof(int); variable
68 int s1[N]; in test01()
69 std::copy(B, B + N, s1); in test01()
70 VERIFY(std::equal(s1, s1 + N, B)); in test01()
72 std::sort(s1, s1 + N); in test01()
73 VERIFY(std::equal(s1, s1 + N, A)); in test01()
77 std::sort(s1, s1 + N, gt); in test01()
78 VERIFY(std::equal(s1, s1 + N, C)); in test01()
85 int s1[N]; in test02()
86 std::copy(A, A + N, s1); in test02()
[all …]

12345678910>>...145