| /llvm-project-15.0.7/clang/test/SemaCXX/ |
| H A D | builtin-operator-new-delete.cpp | 67 void *NP = 0; variable 77 …__builtin_operator_new(NP); // expected-error {{no matching function for call… in test_arg_types() 78 …__builtin_operator_new(NP, std::align_val_t(0)); // expected-error {{no matching function for call… in test_arg_types() 82 …int y = __builtin_operator_delete(NP); // expected-error {{cannot initialize a variable of typ… in test_return_type() 100 __builtin_operator_delete(NP, 4); in test_sized_delete() 102 …__builtin_operator_delete(NP, 4); // expected-error {{call to '__builtin_operator_delete' selects … in test_sized_delete() 113 …__builtin_operator_delete(NP, false); // expected-error {{call to '__builtin_operator_delete' sele… in test_non_usual() 130 __builtin_operator_delete(NP, cvt); // expected-error {{call to 'operator delete' is ambiguous}} in test_ambiguous() 142 …__builtin_operator_delete(NP, tag); // expected-error {{no matching function for call to 'operator… in test_no_matching_fn()
|
| H A D | runtimediag-ppe.cpp | 11 int& NP(int); 12 void test1() { (void)typeid(NP(1 << 32)); } in test1()
|
| H A D | destructor.cpp | 226 struct NP {}; struct 270 NP* np = new NP(); in nowarnnonpoly() 274 NP* np = new NP[4]; in nowarnnonpoly()
|
| /llvm-project-15.0.7/clang/test/CXX/temp/temp.arg/temp.arg.nontype/ |
| H A D | p1-11.cpp | 58 template<std::nullptr_t np> struct NP { // expected-note 2{{template parameter is declared here}} struct 59 NP<np> *np2; argument 62 NP<nullptr> np1; 63 NP<np> np2; 64 NP<get_nullptr()> np3; 65 NP<0> np4; // expected-error{{null non-type template argument must be cast to template parameter ty… 67 NP<i> np5; // expected-error{{non-type template argument of type 'const int' cannot be converted to…
|
| /llvm-project-15.0.7/llvm/utils/lit/tests/Inputs/shtest-shell/ |
| H A D | valid-shell.txt | 139 # RUN: cat -v %S/cat_nonprinting.bin | FileCheck --check-prefix=NP-CAT-OUTPUT %s 140 # NP-CAT-OUTPUT: ^@^A^B^C^D^E^F^G ^H 141 # NP-CAT-OUTPUT-NEXT: ^K^L^M^N^O^P^Q^R^S 142 # NP-CAT-OUTPUT-NEXT: ^T^U^V^W^X^Y^Z^[^\^]^^^_ !"#$%&' 143 # NP-CAT-OUTPUT-NEXT: ()*+,-./0123456789:; 144 # NP-CAT-OUTPUT-NEXT: <=>?@ABCDEFGHIJKLMNO 145 # NP-CAT-OUTPUT-NEXT: PQRSTUVWXYZ[\]^_`abc 146 # NP-CAT-OUTPUT-NEXT: defghijklmnopqrstuvw 147 # NP-CAT-OUTPUT-NEXT: xyz{|}~^?M-^@M-^AM-^BM-^CM-^DM-^EM-^FM-^GM-^HM-^IM-^JM-^K 149 # NP-CAT-OUTPUT-NEXT: M- M-!M-"M-#M-$M-%M-&M-'M-(M-)M-*M-+M-,M--M-.M-/M-0M-1M-2M-3 [all …]
|
| /llvm-project-15.0.7/clang/test/SemaObjCXX/ |
| H A D | arc-ppe.mm | 11 int& NP(void*); function 12 void test1() { (void)typeid(NP((void*)(id*)0)); }
|
| /llvm-project-15.0.7/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 513 NodeAndParent NP = DFSStack.back(); in deepCopyInto() local 514 DCHECK_NE(NP.Node, nullptr); in deepCopyInto() 515 DCHECK_NE(NP.NewNode, nullptr); in deepCopyInto() 517 for (const auto Callee : NP.Node->Callees) { in deepCopyInto() 519 NP.NewNode, NodeIdPairArray(*O.NodeIdPairAllocator), in deepCopyInto() 524 if (UNLIKELY(NP.NewNode->Callees.AppendEmplace(NewNode, Callee.FId) == in deepCopyInto()
|
| /llvm-project-15.0.7/llvm/lib/Target/AVR/ |
| H A D | AVRISelDAGToDAG.cpp | 388 auto *NP = CurDAG->getMachineNode(AVR::LDIRdK, DL, MVT::i8, NC); in select() local 390 Ptr, SDValue(NP, 0)); in select() 403 auto *NP = CurDAG->getMachineNode(AVR::LDIRdK, DL, MVT::i8, NC); in select() local 405 Ptr, SDValue(NP, 0)); in select() 416 auto *NP = CurDAG->getMachineNode(AVR::LDIRdK, DL, MVT::i8, NC); in select() local 418 MVT::Other, Ptr, SDValue(NP, 0)); in select()
|
| /llvm-project-15.0.7/mlir/test/Target/LLVMIR/Import/ |
| H A D | constant-aggregate.ll | 16 ; CHECK: %[[NP:.+]] = llvm.mlir.null : !llvm.ptr<struct<"SimpleAggType", (i32, i8, i16, i32)>> 28 ; CHECK: %[[CHAIN5:.+]] = llvm.insertvalue %[[NP]], %[[CHAIN4]][1 : i32]
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | ilist_iterator.h | 84 explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {}
|
| /llvm-project-15.0.7/mlir/test/Dialect/SparseTensor/ |
| H A D | conversion.mlir | 134 // CHECK: %[[NP:.*]] = llvm.mlir.null : !llvm.ptr<i8> 135 …*]] = call @newSparseTensor(%[[X]], %[[Y]], %[[Z]], %{{.*}}, %{{.*}}, %{{.*}}, %[[Empty]], %[[NP]]) 190 // CHECK: %[[NP:.*]] = llvm.mlir.null : !llvm.ptr<i8> 191 … = call @newSparseTensor(%[[X]], %[[Y]], %[[Z]], %{{.*}}, %{{.*}}, %{{.*}}, %[[EmptyCOO]], %[[NP]]) 276 // CHECK: %[[NP:.*]] = llvm.mlir.null : !llvm.ptr<i8> 277 … = call @newSparseTensor(%[[X]], %[[Y]], %[[Z]], %{{.*}}, %{{.*}}, %{{.*}}, %[[EmptyCOO]], %[[NP]]) 310 // CHECK: %[[NP:.*]] = llvm.mlir.null : !llvm.ptr<i8> 311 … = call @newSparseTensor(%[[X]], %[[Y]], %[[Z]], %{{.*}}, %{{.*}}, %{{.*}}, %[[EmptyCOO]], %[[NP]]) 349 // CHECK: %[[NP:.*]] = llvm.mlir.null : !llvm.ptr<i8> 350 … = call @newSparseTensor(%[[X]], %[[Y]], %[[Z]], %{{.*}}, %{{.*}}, %{{.*}}, %[[EmptyCOO]], %[[NP]])
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | PromoteMemoryToRegister.cpp | 282 unsigned &NP = BBNumPreds[BB]; in getNumPreds() local 283 if (NP == 0) in getNumPreds() 284 NP = pred_size(BB) + 1; in getNumPreds() 285 return NP - 1; in getNumPreds()
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCInstrMMA.td | 144 def NP : XX3Form_AT3_XAB6< 161 def PM#NAME#NP : 188 def NP : XX3Form_AT3_XAB6<opcode, !or(xo, 0x40), (outs acc:$AT), 226 def PM#NAME#NP : 270 def PM#NAME#NP :
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | TargetPassConfig.cpp | 380 Pass *NP = Pass::createPass(InsertedPassID.getID()); in getInsertedPass() local 381 assert(NP && "Pass ID not registered"); in getInsertedPass() 382 return NP; in getInsertedPass()
|
| H A D | RDFGraph.cpp | 266 unsigned NP = BB->pred_size(); in operator <<() local 278 << " --- preds(" << NP << "): "; in operator <<()
|
| /llvm-project-15.0.7/llvm/test/Transforms/LICM/ |
| H A D | explicit_guards.ll | 85 ; CHECK-NEXT: [[N:%.*]] = load i32, i32* [[NP:%.*]]
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonExpandCondsets.cpp | 876 unsigned Ox = 0, NP = MI.getNumOperands(); in predicateAt() local 878 while (Ox < NP) { in predicateAt() 889 while (Ox < NP) { in predicateAt()
|
| H A D | HexagonCommonGEP.cpp | 502 NodePair NP = node_pair(N1, N2); in node_eq() local 503 NodePairSet::iterator FEq = Eq.find(NP); in node_eq() 506 NodePairSet::iterator FNe = Ne.find(NP); in node_eq()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | MemorySSA.cpp | 787 const DefPath *NP = &N; in defPathIndex() local 788 assert(!Paths.empty() && NP >= &Paths.front() && NP <= &Paths.back() && in defPathIndex() 790 return NP - &Paths.front(); in defPathIndex()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 2076 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority() local 2077 return (NP > 0) ? NP : 0; in getNodePriority()
|
| /llvm-project-15.0.7/clang/lib/AST/ |
| H A D | Decl.cpp | 3631 unsigned NP = getNumParams(); in getParametersSourceRange() local 3634 if (NP == 0 && EllipsisLoc.isInvalid()) in getParametersSourceRange() 3638 NP > 0 ? ParamInfo[0]->getSourceRange().getBegin() : EllipsisLoc; in getParametersSourceRange() 3641 : ParamInfo[NP - 1]->getSourceRange().getEnd(); in getParametersSourceRange()
|
| /llvm-project-15.0.7/llvm/lib/Target/SystemZ/ |
| H A D | SystemZInstrInfo.td | 86 "Z", "NZ", "P", "NP", "M", "NM", "LH", "NLH", "O", "NO" ] in { 565 "Z", "NZ", "P", "NP", "M", "NM", "LH", "NLH", "O", "NO" ] in { 606 "Z", "NZ", "P", "NP", "M", "NM", "LH", "NLH", "O", "NO" ] in { 637 "Z", "NZ", "P", "NP", "M", "NM", "LH", "NLH", "O", "NO" ] in { 2412 "Z", "NZ", "P", "NP", "M", "NM", "LH", "NLH", "O", "NO" ] in {
|
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64SchedExynosM5.td | 647 def : InstRW<[M5WriteA1W], (instregex "^CCM[NP]W[ir]$")>; 648 def : InstRW<[M5WriteA1X], (instregex "^CCM[NP]X[ir]$")>;
|
| /llvm-project-15.0.7/llvm/lib/Target/M68k/ |
| H A D | M68kInstrFormats.td | 94 /// suffix NP means non-padded
|
| /llvm-project-15.0.7/mlir/docs/Rationale/ |
| H A D | RationaleGenericDAGRewriter.md | 243 tile pattern matching is NP complete. Additionally, we would like to support
|