/external/clang/test/CodeGenCXX/ |
H A D | reference-in-block-args.cpp | 6 struct ST { struct 11 void OUTER_BLOCK(void (^fixer)(ST& ref)) { 12 ST ref = {2, 100}; 21 OUTER_BLOCK(^(ST &ref) {
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreTargetTransformInfo.h | 33 const XCoreSubtarget *ST; member in class:llvm::XCoreTTIImpl 36 const XCoreSubtarget *getST() const { return ST; } 41 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl()), 42 TLI(ST->getTargetLowering()) {} 46 : BaseT(static_cast<const BaseT &>(Arg)), ST(Arg.ST), TLI(Arg.TLI) {} 48 : BaseT(std::move(static_cast<BaseT &>(Arg))), ST(std::move(Arg.ST)),
|
/external/clang/test/OpenMP/ |
H A D | for_schedule_messages.cpp | 12 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 23 for (int i = ST; [all...] |
H A D | for_simd_schedule_messages.cpp | 12 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 23 for (int i = ST; [all...] |
H A D | parallel_for_schedule_messages.cpp | 12 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 23 for (int i = ST; [all...] |
H A D | parallel_for_simd_schedule_messages.cpp | 12 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 23 for (int i = ST; [all...] |
H A D | target_parallel_for_schedule_messages.cpp | 12 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 23 for (int i = ST; [all...] |
H A D | target_parallel_for_simd_simdlen_messages.cpp | 17 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 20 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 26 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 32 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 35 #pragma omp target parallel for simd simdlen (ST // expecte [all...] |
H A D | for_ordered_clause.cpp | 17 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 20 for (int i = ST; i < N; i++) 21 argv[0][i] = argv[0][i] - argv[0][i - ST]; 23 for (int i = ST; i < N; i++) 24 argv[0][i] = argv[0][i] - argv[0][i - ST]; 26 for (int i = ST; i < N; i++) 27 argv[0][i] = argv[0][i] - argv[0][i - ST]; 32 for (int i = ST; i < N; i++) 33 argv[0][i] = argv[0][i] - argv[0][i - ST]; 35 #pragma omp for ordered(ST // expecte [all...] |
H A D | distribute_collapse_messages.cpp | 12 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 24 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 26 #pragma omp distribute collapse (ST // expecte [all...] |
H A D | distribute_parallel_for_collapse_messages.cpp | 17 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 22 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 26 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 37 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 41 #pragma omp distribute parallel for collapse (ST // expecte [all...] |
H A D | distribute_parallel_for_simd_collapse_messages.cpp | 17 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 22 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 26 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 37 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 41 #pragma omp distribute parallel for simd collapse (ST // expecte [all...] |
H A D | distribute_parallel_for_simd_safelen_messages.cpp | 17 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 23 for (int i = ST; i < N; i++) 24 argv[0][i] = argv[0][i] - argv[0][i-ST]; 29 for (int i = ST; i < N; i++) 30 argv[0][i] = argv[0][i] - argv[0][i-ST]; 35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; 40 for (int i = ST; i < N; i++) 41 argv[0][i] = argv[0][i] - argv[0][i-ST]; 45 #pragma omp distribute parallel for simd safelen (ST // expecte [all...] |
H A D | distribute_parallel_for_simd_simdlen_messages.cpp | 17 template <class T, typename S, int N, int ST> // expected-note {{declared here}} 22 for (int i = ST; i < N; i++) 23 argv[0][i] = argv[0][i] - argv[0][i-ST]; 28 for (int i = ST; i < N; i++) 29 argv[0][i] = argv[0][i] - argv[0][i-ST]; 34 for (int i = ST; i < N; i++) 35 argv[0][i] = argv[0][i] - argv[0][i-ST]; 43 for (int i = ST; i < N; i++) 44 argv[0][i] = argv[0][i] - argv[0][i-ST]; 49 #pragma omp distribute parallel for simd simdlen (ST // expecte [all...] |
/external/syslinux/gnu-efi/gnu-efi-3.0/apps/ |
H A D | t5.c | 10 WaitForSingleEvent(ST->ConIn->WaitForKey, 0); 11 uefi_call_wrapper(ST->ConOut->OutputString, 2, ST->ConOut, L"\n\n");
|
H A D | t7.c | 15 WaitForSingleEvent(ST->ConIn->WaitForKey, 0); 17 uefi_call_wrapper(ST->ConOut->OutputString, 2, ST->ConOut, L"\n\n"); 19 efi_status = uefi_call_wrapper(ST->ConIn->ReadKeyStroke, 2, ST->ConIn, &efi_input_key);
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | Message.java | 30 import org.stringtemplate.v4.ST; 43 public ST msgST; 45 public ST locationST; 46 public ST reportST; 47 public ST messageFormatST; 87 public ST getMessageTemplate() { return new ST(msgST); } 92 public ST getLocationTemplate() { return new ST(locationST); } 94 public String toString(ST messageS [all...] |
H A D | LeftRecursionCyclesMessage.java | 30 import org.stringtemplate.v4.ST; 47 ST st = getMessageTemplate();
|
/external/llvm/lib/CodeGen/ |
H A D | BasicTargetTransformInfo.cpp | 37 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl(F)), 38 TLI(ST->getTargetLowering()) {}
|
/external/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUMCInstLower.h | 23 const AMDGPUSubtarget &ST; member in class:llvm::AMDGPUMCInstLower 26 AMDGPUMCInstLower(MCContext &ctx, const AMDGPUSubtarget &ST);
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonTargetTransformInfo.h | 32 const HexagonSubtarget *ST; member in class:llvm::HexagonTTIImpl 35 const HexagonSubtarget *getST() const { return ST; } 40 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl(F)), 41 TLI(ST->getTargetLowering()) {} 45 : BaseT(static_cast<const BaseT &>(Arg)), ST(Arg.ST), TLI(Arg.TLI) {} 47 : BaseT(std::move(static_cast<BaseT &>(Arg))), ST(std::move(Arg.ST)),
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXTargetTransformInfo.h | 33 const NVPTXSubtarget *ST; member in class:llvm::NVPTXTTIImpl 36 const NVPTXSubtarget *getST() const { return ST; }; 41 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl()), 42 TLI(ST->getTargetLowering()) {} 46 : BaseT(static_cast<const BaseT &>(Arg)), ST(Arg.ST), TLI(Arg.TLI) {} 48 : BaseT(std::move(static_cast<BaseT &>(Arg))), ST(std::move(Arg.ST)),
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZTargetTransformInfo.h | 24 const SystemZSubtarget *ST; member in class:llvm::SystemZTTIImpl 27 const SystemZSubtarget *getST() const { return ST; } 32 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl(F)), 33 TLI(ST->getTargetLowering()) {} 37 : BaseT(static_cast<const BaseT &>(Arg)), ST(Arg.ST), TLI(Arg.TLI) {} 39 : BaseT(std::move(static_cast<BaseT &>(Arg))), ST(std::move(Arg.ST)),
|
/external/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyTargetTransformInfo.h | 34 const WebAssemblySubtarget *ST; member in class:llvm::final 37 const WebAssemblySubtarget *getST() const { return ST; } 42 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl(F)), 43 TLI(ST->getTargetLowering()) {} 47 : BaseT(static_cast<const BaseT &>(Arg)), ST(Arg.ST), TLI(Arg.TLI) {} 49 : BaseT(std::move(static_cast<BaseT &>(Arg))), ST(std::move(Arg.ST)),
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.h | 33 const ARMSubtarget *ST; member in class:llvm::ARMTTIImpl 40 const ARMSubtarget *getST() const { return ST; } 45 : BaseT(TM, F.getParent()->getDataLayout()), ST(TM->getSubtargetImpl(F)), 46 TLI(ST->getTargetLowering()) {} 50 : BaseT(static_cast<const BaseT &>(Arg)), ST(Arg.ST), TLI(Arg.TLI) {} 52 : BaseT(std::move(static_cast<BaseT &>(Arg))), ST(std::move(Arg.ST)), 61 return !ST->isTargetDarwin(); 82 if (ST [all...] |