Home
last modified time | relevance | path

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

12345678910>>...50

/openbsd/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeFloatTypes.cpp1376 void DAGTypeLegalizer::ExpandFloatRes_FCEIL(SDNode *N, in ExpandFloatRes_FCEIL()
1394 void DAGTypeLegalizer::ExpandFloatRes_FCOS(SDNode *N, in ExpandFloatRes_FCOS()
1412 void DAGTypeLegalizer::ExpandFloatRes_FEXP(SDNode *N, in ExpandFloatRes_FEXP()
1420 void DAGTypeLegalizer::ExpandFloatRes_FEXP2(SDNode *N, in ExpandFloatRes_FEXP2()
1436 void DAGTypeLegalizer::ExpandFloatRes_FLOG(SDNode *N, in ExpandFloatRes_FLOG()
1444 void DAGTypeLegalizer::ExpandFloatRes_FLOG2(SDNode *N, in ExpandFloatRes_FLOG2()
1538 void DAGTypeLegalizer::ExpandFloatRes_FPOW(SDNode *N, in ExpandFloatRes_FPOW()
1546 void DAGTypeLegalizer::ExpandFloatRes_FPOWI(SDNode *N, in ExpandFloatRes_FPOWI()
1562 void DAGTypeLegalizer::ExpandFloatRes_FREM(SDNode *N, in ExpandFloatRes_FREM()
1570 void DAGTypeLegalizer::ExpandFloatRes_FRINT(SDNode *N, in ExpandFloatRes_FRINT()
[all …]
H A DLegalizeIntegerTypes.cpp3263 void DAGTypeLegalizer::ExpandIntRes_BSWAP(SDNode *N, in ExpandIntRes_BSWAP()
3344 void DAGTypeLegalizer::ExpandIntRes_CTLZ(SDNode *N, in ExpandIntRes_CTLZ()
3364 void DAGTypeLegalizer::ExpandIntRes_CTPOP(SDNode *N, in ExpandIntRes_CTPOP()
3375 void DAGTypeLegalizer::ExpandIntRes_CTTZ(SDNode *N, in ExpandIntRes_CTTZ()
3709 void DAGTypeLegalizer::ExpandIntRes_MUL(SDNode *N, in ExpandIntRes_MUL()
4115 void DAGTypeLegalizer::ExpandIntRes_SDIV(SDNode *N, in ExpandIntRes_SDIV()
4248 void DAGTypeLegalizer::ExpandIntRes_Shift(SDNode *N, in ExpandIntRes_Shift()
4428 void DAGTypeLegalizer::ExpandIntRes_SREM(SDNode *N, in ExpandIntRes_SREM()
4468 void DAGTypeLegalizer::ExpandIntRes_XMULO(SDNode *N, in ExpandIntRes_XMULO()
4606 void DAGTypeLegalizer::ExpandIntRes_UDIV(SDNode *N, in ExpandIntRes_UDIV()
[all …]
H A DLegalizeTypesGeneric.cpp34 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()
197 void DAGTypeLegalizer::ExpandRes_EXTRACT_ELEMENT(SDNode *N, SDValue &Lo, in ExpandRes_EXTRACT_ELEMENT()
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()
[all …]
H A DLegalizeVectorTypes.cpp201 SDValue DAGTypeLegalizer::ScalarizeVecRes_BinOp(SDNode *N) { in ScalarizeVecRes_BinOp()
216 SDValue DAGTypeLegalizer::ScalarizeVecRes_FIX(SDNode *N) { in ScalarizeVecRes_FIX()
2365 auto &&IsConstant = [](const SDValue &N) { in SplitVecRes_VECTOR_SHUFFLE()
3736 SDValue DAGTypeLegalizer::SplitVecOp_VSETCC(SDNode *N) { in SplitVecOp_VSETCC()
4754 SDValue DAGTypeLegalizer::WidenVecRes_POWI(SDNode *N) { in WidenVecRes_POWI()
5090 SDValue DAGTypeLegalizer::WidenVecRes_LOAD(SDNode *N) { in WidenVecRes_LOAD()
5335 static inline EVT getSETCCOperandType(SDValue N) { in getSETCCOperandType()
5343 static inline bool isSETCCorConvertedSETCC(SDValue N) { in isSETCCorConvertedSETCC()
5432 SDValue DAGTypeLegalizer::WidenVSELECTMask(SDNode *N) { in WidenVSELECTMask()
6184 SDValue DAGTypeLegalizer::WidenVecOp_STORE(SDNode *N) { in WidenVecOp_STORE()
[all …]
/openbsd/gnu/llvm/libcxx/benchmarks/
H A DGenerateInput.h51 inline std::vector<IntT> getDuplicateIntegerInputs(size_t N) { in getDuplicateIntegerInputs()
57 inline std::vector<IntT> getSortedIntegerInputs(size_t N) { in getSortedIntegerInputs()
65 std::vector<IntT> getSortedLargeIntegerInputs(size_t N) { in getSortedLargeIntegerInputs()
74 std::vector<IntT> getSortedTopBitsIntegerInputs(size_t N) { in getSortedTopBitsIntegerInputs()
81 inline std::vector<IntT> getReverseSortedIntegerInputs(size_t N) { in getReverseSortedIntegerInputs()
92 std::vector<IntT> getPipeOrganIntegerInputs(size_t N) { in getPipeOrganIntegerInputs()
101 std::vector<IntT> getRandomIntegerInputs(size_t N) { in getRandomIntegerInputs()
109 inline std::vector<std::string> getDuplicateStringInputs(size_t N) { in getDuplicateStringInputs()
114 inline std::vector<std::string> getRandomStringInputs(size_t N) { in getRandomStringInputs()
122 inline std::vector<std::string> getSortedStringInputs(size_t N) { in getSortedStringInputs()
[all …]
/openbsd/gnu/llvm/clang/utils/TableGen/
H A DClangOpcodesEmitter.cpp61 StringRef N, in Enumerate()
91 StringRef N = Opcode->getValueAsString("Name"); in run() local
127 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitInterp() local
143 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitInterp() local
191 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEmitter() local
203 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEmitter() local
252 for (size_t I = 0, N = Types->size(); I < N; ++I) in EmitGroup() local
268 for (size_t I = 0, N = Types->size(); I < N; ++I) in EmitGroup() local
270 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitGroup() local
334 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEval() local
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dregs.h74 #define REG_N_REFS(N) (VARRAY_REG (reg_n_info, N)->refs) argument
78 #define REG_FREQ(N) (VARRAY_REG (reg_n_info, N)->freq) argument
102 #define REG_N_SETS(N) (VARRAY_REG (reg_n_info, N)->sets) argument
110 #define REG_N_DEATHS(N) (VARRAY_REG (reg_n_info, N)->deaths) argument
114 #define PSEUDO_REGNO_SIZE(N) \ argument
120 #define PSEUDO_REGNO_BYTES(N) \ argument
125 #define PSEUDO_REGNO_MODE(N) GET_MODE (regno_reg_rtx[N]) argument
129 #define REG_N_CALLS_CROSSED(N) (VARRAY_REG (reg_n_info, N)->calls_crossed) argument
146 #define REG_LIVE_LENGTH(N) (VARRAY_REG (reg_n_info, N)->live_length) argument
178 #define REGNO_FIRST_UID(N) (VARRAY_REG (reg_n_info, N)->first_uid) argument
[all …]
H A Dvarray.h229 #define VARRAY_CHECK(VA, N, T) __extension__ \ argument
236 #define VARRAY_CHECK(VA, N, T) ((VA)->data.T[N]) argument
258 #define VARRAY_CHAR(VA, N) VARRAY_CHECK (VA, N, c) argument
259 #define VARRAY_UCHAR(VA, N) VARRAY_CHECK (VA, N, uc) argument
260 #define VARRAY_SHORT(VA, N) VARRAY_CHECK (VA, N, s) argument
262 #define VARRAY_INT(VA, N) VARRAY_CHECK (VA, N, i) argument
263 #define VARRAY_UINT(VA, N) VARRAY_CHECK (VA, N, u) argument
264 #define VARRAY_LONG(VA, N) VARRAY_CHECK (VA, N, l) argument
270 #define VARRAY_RTX(VA, N) VARRAY_CHECK (VA, N, rtx) argument
274 #define VARRAY_REG(VA, N) VARRAY_CHECK (VA, N, reg) argument
[all …]
/openbsd/gnu/gcc/gcc/
H A Dregs.h77 #define REG_N_REFS(N) (VEC_index (reg_info_p, reg_n_info, N)->refs) argument
81 #define REG_FREQ(N) (VEC_index (reg_info_p, reg_n_info, N)->freq) argument
105 #define REG_N_SETS(N) (VEC_index (reg_info_p, reg_n_info, N)->sets) argument
113 #define REG_N_DEATHS(N) (VEC_index (reg_info_p, reg_n_info, N)->deaths) argument
117 #define PSEUDO_REGNO_SIZE(N) \ argument
123 #define PSEUDO_REGNO_BYTES(N) \ argument
128 #define PSEUDO_REGNO_MODE(N) GET_MODE (regno_reg_rtx[N]) argument
132 #define REG_N_CALLS_CROSSED(N) \ argument
138 #define REG_N_THROWING_CALLS_CROSSED(N) \ argument
156 #define REG_LIVE_LENGTH(N) \ argument
[all …]
H A Dvarray.h203 #define VARRAY_GROW(VA, N) ((VA) = varray_grow (VA, N)) argument
221 #define VARRAY_CHECK(VA, N, T) __extension__ \ argument
237 #define VARRAY_CHECK(VA, N, T) ((VA)->data.T[N]) argument
253 #define VARRAY_CHAR(VA, N) VARRAY_CHECK (VA, N, vdt_c) argument
255 #define VARRAY_SHORT(VA, N) VARRAY_CHECK (VA, N, vdt_s) argument
257 #define VARRAY_INT(VA, N) VARRAY_CHECK (VA, N, vdt_i) argument
258 #define VARRAY_UINT(VA, N) VARRAY_CHECK (VA, N, vdt_u) argument
259 #define VARRAY_LONG(VA, N) VARRAY_CHECK (VA, N, vdt_l) argument
266 #define VARRAY_RTX(VA, N) VARRAY_CHECK (VA, N, vdt_rtx) argument
271 #define VARRAY_BB(VA, N) VARRAY_CHECK (VA, N, vdt_bb) argument
[all …]
H A Drtl.h455 #define RTL_CHECK1(RTX, N, C1) __extension__ \ argument
478 #define RTL_CHECKC1(RTX, N, C) __extension__ \ argument
500 #define XWINT(RTX, N) __extension__ \ argument
511 #define XCWINT(RTX, N, C) __extension__ \ argument
518 #define XCMWINT(RTX, N, C, M) __extension__ \ argument
571 #define XWINT(RTX, N) ((RTX)->u.hwint[N]) argument
572 #define XCWINT(RTX, N, C) ((RTX)->u.hwint[N]) argument
706 #define X0ANY(RTX, N) RTL_CHECK1 (RTX, N, '0') argument
1027 #define COSTS_N_INSNS(N) ((N) * 4) argument
1086 #define ASM_OPERANDS_INPUT_CONSTRAINT(RTX, N) \ argument
[all …]
/openbsd/gnu/llvm/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()
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 …]
/openbsd/gnu/llvm/llvm/include/llvm/BinaryFormat/
H A DMsgPackDocument.h260 void push_back(DocNode N) { in push_back()
303 auto N = DocNode(&KindAndDocs[size_t(Type::Empty)]); in getEmptyNode() local
309 auto N = DocNode(&KindAndDocs[size_t(Type::Nil)]); in getNode() local
315 auto N = DocNode(&KindAndDocs[size_t(Type::Int)]); in getNode() local
322 auto N = DocNode(&KindAndDocs[size_t(Type::Int)]); in getNode() local
329 auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]); in getNode() local
336 auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]); in getNode() local
350 auto N = DocNode(&KindAndDocs[size_t(Type::Float)]); in getNode() local
360 auto N = DocNode(&KindAndDocs[size_t(Type::String)]); variable
373 auto N = DocNode(&KindAndDocs[size_t(Type::Map)]); in getMapNode() local
[all …]
/openbsd/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64ISelDAGToDAG.cpp165 bool SelectExtractHigh(SDValue N, SDValue &Res) { in SelectExtractHigh()
210 bool SelectDupZeroOrUndef(SDValue N) { in SelectDupZeroOrUndef()
230 bool SelectDupZero(SDValue N) { in SelectDupZero()
257 bool SelectSVELogicalImm(SDValue N, SDValue &Imm) { in SelectSVELogicalImm()
262 bool SelectSVEArithImm(SDValue N, SDValue &Imm) { in SelectSVEArithImm()
267 bool SelectSVEShiftImm(SDValue N, SDValue &Imm) { in SelectSVEShiftImm()
283 bool SelectCntImm(SDValue N, SDValue &Imm) { in SelectCntImm()
304 bool SelectEXTImm(SDValue N, SDValue &Imm) { in SelectEXTImm()
999 auto isDef32 = [](SDValue N) { in SelectArithExtendedRegister()
1052 static bool isWorthFoldingADDlow(SDValue N) { in isWorthFoldingADDlow()
[all …]
/openbsd/gnu/gcc/libgomp/testsuite/libgomp.fortran/appendix-a/
H A Da.15.1.f902 SUBROUTINE WORK(N) argument
3 INTEGER N local
5 SUBROUTINE SUB3(N) argument
6 INTEGER N local
17 SUBROUTINE SUB1(N) argument
18 INTEGER N local
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/execute/
H A Dva-arg-22.c23 #define D(N) typedef struct { char x[N]; } A##N; argument
31 #define D(N) A##N a##N; in foo() argument
42 #define D(N) \ in foo() argument
55 #define D(N) A##N a##N; in main() argument
62 #define D(N) \ in main() argument
71 #define D(N) , a##N in main() argument
H A D20021120-1.c2 #define OP1(L, N, R, I, J) L N##I##J R argument
3 #define OP2(L, N, R, I) \ argument
6 #define OP(L, N, R) \ argument
11 #define DECLARE(N) OP (, N,) argument
15 #define COPYIN(N, ADDR) OP (, N, = *(ADDR++)) argument
18 #define COPYOUT(N, ADDR) OP (*(ADDR++) =, N,) argument
22 #define ADD(N, ADDR) OP (, N, += *(ADDR++)) argument
/openbsd/gnu/llvm/llvm/lib/Support/
H A DNativeFormatting.cpp26 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()
82 static void write_unsigned(raw_ostream &S, T N, size_t MinDigits, in write_unsigned()
93 static void write_signed(raw_ostream &S, T N, size_t MinDigits, in write_signed()
108 void llvm::write_integer(raw_ostream &S, unsigned int N, size_t MinDigits, in write_integer()
113 void llvm::write_integer(raw_ostream &S, int N, size_t MinDigits, in write_integer()
118 void llvm::write_integer(raw_ostream &S, unsigned long N, size_t MinDigits, in write_integer()
123 void llvm::write_integer(raw_ostream &S, long N, size_t MinDigits, in write_integer()
133 void llvm::write_integer(raw_ostream &S, long long N, size_t MinDigits, in write_integer()
138 void llvm::write_hex(raw_ostream &S, uint64_t N, HexPrintStyle Style, in write_hex()
[all …]
/openbsd/gnu/llvm/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 <<()
/openbsd/gnu/llvm/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; in consume() local
86 int64_t N; in consume() local
93 uint64_t N; in consume() local
116 APSInt N; in consume_numeric() local
/openbsd/gnu/llvm/llvm/lib/Target/Mips/
H A DMipsISelDAGToDAG.cpp155 bool MipsDAGToDAGISel::selectVSplat(SDNode *N, APInt &Imm, in selectVSplat()
161 bool MipsDAGToDAGISel::selectVSplatUimm1(SDValue N, SDValue &Imm) const { in selectVSplatUimm1()
166 bool MipsDAGToDAGISel::selectVSplatUimm2(SDValue N, SDValue &Imm) const { in selectVSplatUimm2()
171 bool MipsDAGToDAGISel::selectVSplatUimm3(SDValue N, SDValue &Imm) const { in selectVSplatUimm3()
176 bool MipsDAGToDAGISel::selectVSplatUimm4(SDValue N, SDValue &Imm) const { in selectVSplatUimm4()
181 bool MipsDAGToDAGISel::selectVSplatUimm5(SDValue N, SDValue &Imm) const { in selectVSplatUimm5()
186 bool MipsDAGToDAGISel::selectVSplatUimm6(SDValue N, SDValue &Imm) const { in selectVSplatUimm6()
191 bool MipsDAGToDAGISel::selectVSplatUimm8(SDValue N, SDValue &Imm) const { in selectVSplatUimm8()
196 bool MipsDAGToDAGISel::selectVSplatSimm5(SDValue N, SDValue &Imm) const { in selectVSplatSimm5()
211 bool MipsDAGToDAGISel::selectVSplatMaskL(SDValue N, SDValue &Imm) const { in selectVSplatMaskL()
[all …]
/openbsd/gnu/llvm/clang/lib/Tooling/Syntax/
H A DTree.cpp19 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 …]
/openbsd/gnu/llvm/llvm/utils/TableGen/
H A DDAGISelMatcher.h222 static bool classof(const Matcher *N) { in classof()
247 static bool classof(const Matcher *N) { in classof()
279 static bool classof(const Matcher *N) { in classof()
295 static bool classof(const Matcher *N) { in classof()
311 static bool classof(const Matcher *N) { in classof()
329 static bool classof(const Matcher *N) { in classof()
346 static bool classof(const Matcher *N) { in classof()
366 static bool classof(const Matcher *N) { in classof()
390 static bool classof(const Matcher *N) { in classof()
413 static bool classof(const Matcher *N) { in classof()
[all …]
/openbsd/gnu/llvm/clang/utils/ABITest/
H A DEnumeration.py55 def getNthPairInfo(N): argument
81 def getNthPair(N): argument
85 def getNthPairBounded(N,W=aleph0,H=aleph0,useDivmod=False): argument
129 def getNthPairBoundedChecked(N,W=aleph0,H=aleph0,useDivmod=False,GNP=getNthPairBounded): argument
134 def getNthNTuple(N, W, H=aleph0, useLeftToRight=False): argument
156 def getNthNTupleChecked(N, W, H=aleph0, useLeftToRight=False, GNT=getNthNTuple): argument
163 def getNthTuple(N, maxSize=aleph0, maxElement=aleph0, useDivmod=False, useLeftToRight=False): argument
181 def getNthTupleChecked(N, maxSize=aleph0, maxElement=aleph0, argument
190 def getNthPairVariableBounds(N, bounds): argument
223 def getNthPairVariableBoundsChecked(N, bounds, GNVP=getNthPairVariableBounds): argument
/openbsd/gnu/llvm/compiler-rt/lib/builtins/aarch64/
H A Dlse.S66 #define N 0x000000 macro
72 #define N 0x800000 macro
78 #define N 0x400000 macro
84 #define N 0xc00000 macro
90 #define x(N) GLUE2(x, N) argument
91 #define w(N) GLUE2(w, N) argument
93 #define s(N) w(N) argument
95 #define s(N) x(N) argument

12345678910>>...50