/llvm-project/compiler-rt/lib/xray/tests/unit/ |
H A D | buffer_queue_test.cpp | 63 Buf.Generation = Buffers.generation(); in TEST() 139 ASSERT_NE(B0.Generation, B1.Generation); in TEST() 141 // We stash the current generation, for use later. in TEST() 142 auto PrevGen = B1.Generation; in TEST() 145 // first "generation" would still be accepted in the new generation... in TEST() 158 // Here we ensure that the generation is different from the previous in TEST() 159 // generation. in TEST() 160 EXPECT_NE(B0.Generation, PrevGen); in TEST() 161 EXPECT_EQ(B1.Generation, B1.Generation); in TEST() 176 // of a new generation, and allow those to get new buffers. This is in TEST() [all …]
|
/llvm-project/compiler-rt/lib/xray/ |
H A D | xray_buffer_queue.cpp | 109 // At this point we increment the generation number to associate the buffers in init() 110 // to the new generation. in init() 111 atomic_fetch_add(&Generation, 1, memory_order_acq_rel); in init() 128 Buf.Generation = generation(); in init() 157 Generation{0} { 179 Buf.Generation = generation(); in getBuffer() 190 if (Buf.Generation != generation() || LiveBuffers == 0) { in releaseBuffer()
|
H A D | xray_fdr_controller.h | 47 return B.Data != nullptr && B.Generation == BQ->generation() && in hasSpace() 154 if (B.Generation != BQ->generation()) in recordPreamble() 171 if (B.Generation != BQ->generation()) in recordPreamble() 191 if (B.Generation != BQ->generation()) in rewindRecords() 210 if (B.Generation != BQ->generation()) in rewindRecords() 217 if (B.Generation != BQ->generation()) in rewindRecords()
|
H A D | xray_buffer_queue.h | 56 uint64_t Generation{0}; 162 // We use a generation number to identify buffers and which generation they're 164 atomic_uint64_t Generation; variable 223 /// Initializes the buffer queue, starting a new generation. We can re-set the 236 uint64_t generation() const { in generation() function 237 return atomic_load(&Generation, memory_order_acquire); in generation()
|
/llvm-project/llvm/test/CodeGen/PowerPC/ |
H A D | mcm-obj.ll | 27 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO_DS for 50 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO for 56 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO_DS for 72 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO for 78 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO_DS for 89 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO for 95 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO_DS for 111 ; Verify generation of relocations foraccessing variable ti. 129 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO_DS for 183 ; Verify generation of R_PPC64_TOC16_HA and R_PPC64_TOC16_LO_DS for
|
/llvm-project/mlir/include/mlir/Dialect/GPU/TransformOps/ |
H A D | Utils.h | 80 /// used for indexing rewrites as well as 3D sizes for predicate generation. 82 /// used for indexing rewrites as well as 1D sizes for predicate generation. 89 /// used for indexing rewrites as well as 3D sizes for predicate generation. 91 /// used for indexing rewrites as well as 1D sizes for predicate generation. 102 /// used for indexing rewrites as well as 3D sizes for predicate generation. 104 /// used for indexing rewrites as well as 1D sizes for predicate generation. 113 /// used for indexing rewrites as well as 3D sizes for predicate generation. 115 /// used for indexing rewrites as well as 1D sizes for predicate generation.
|
/llvm-project/mlir/docs/Rationale/ |
H A D | RationaleSimplifiedPolyhedralForm.md | 228 out after code generation. With the simplified form, transformations have to do 229 parts of code generation inline with their transformation: instead of simply 283 ### Simplicity of code generation 292 come out during code generation. Code generation from ISL shows that it is 303 generation into the transformations themselves - this is sometimes trivial, 305 the code generation algorithms themselves be library functions that 312 more advanced cases like skewing, e.g. for DMA data movement generation. 322 question (see "Cost of code generation"). 324 ### Cost of code generation 326 State of the art polyhedral code generation is [all …]
|
/llvm-project/clang/docs/HLSL/ |
H A D | EntryFunctions.rst | 23 implications on code generation. 30 specified name. This allows code generation for entry functions to always key 34 In code generation, two functions are generated. One is the user defined 36 linkage following normal function code generation. 39 ``void(void)`` function that isn't name mangled. In code generation we generate
|
/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | CodeGenCommonISel.h | 28 /// Protector Generation. This is now also ported be shared with GlobalISel, 31 /// High Level Overview of ISel Stack Protector Generation: 34 /// generation. This necessitated splitting basic blocks at the IR level to 42 /// stack, if we could delay the generation of the stack protector check until 48 /// 1. Preserve the architecture independence of stack protector generation. 52 /// generation. 91 /// generation, allow for the normal IR level stack protector check 92 /// generation to continue. 95 /// generation: 177 /// As a result of stack protector generation, w [all...] |
/llvm-project/clang/test/Driver/ |
H A D | hlsl-lang-targets-spirv.hlsl | 35 …HECK-NO-OS: error: Vulkan environment is required as OS in target '{{.*}}' for HLSL code generation 36 …K-BAD-OS: error: Vulkan environment '{{.*}}' in target '{{.*}}' is invalid for HLSL code generation 37 …-NO-ENV: error: shader stage is required as environment in target '{{.*}}' for HLSL code generation 38 … CHECK-BAD-ENV: error: shader stage '{{.*}}' in target '{{.*}}' is invalid for HLSL code generation 39 // CHECK-BAD-TARGET: error: HLSL code generation is unsupported for target '{{.*}}'
|
H A D | hlsl-lang-targets.hlsl | 46 // CHECK-NO-OS: error: shader model is required as OS in target '{{.*}}' for HLSL code generation 47 // CHECK-BAD-OS: error: shader model '{{.*}}' in target '{{.*}}' is invalid for HLSL code generation 48 …-NO-ENV: error: shader stage is required as environment in target '{{.*}}' for HLSL code generation 49 … CHECK-BAD-ENV: error: shader stage '{{.*}}' in target '{{.*}}' is invalid for HLSL code generation 51 // CHECK-BAD-TARGET: error: HLSL code generation is unsupported for target '{{.*}}'
|
/llvm-project/libc/utils/HdrGen/ |
H A D | README.md |
|
/llvm-project/mlir/docs/Dialects/ |
H A D | TOSA.md | 37 order to bound the design of hardware, operator kernels, code generation 50 code generation and hardware development. It therefore incorporates precision 87 the construction of code generation for that operation, or decisions on the 96 the tensors are no longer necessary for code generation. 106 quantization information, to later backend code generation steps.
|
/llvm-project/flang/docs/ |
H A D | DebugGeneration.md | 1 # Debug Generation 6 compilers and debuggers. The LLVM infrastructure supports debug info generation 11 We can break the work for debug generation into two separate tasks: 12 1) Line Table generation 13 2) Full debug generation 25 ## Line Table Generation 44 ## Full Debug Generation 50 Debug metadata generation can be broken down in 2 steps. 59 creating `LLVM::GlobalOp`. Another example will be generation of `DbgDeclareOp` 425 info generation appropriately. [all …]
|
/llvm-project/llvm/docs/ |
H A D | MCJITDesignAndImplementation.rst | 11 objects throughout the code generation and dynamic loading process. 47 module. Code generation is deferred until either the 52 Code Generation 55 When code generation is triggered, as described above, MCJIT will first 65 The PassManager::run call causes the MC code generation mechanisms to emit 79 Once an object image has been obtained, either through code generation or
|
/llvm-project/mlir/lib/Dialect/SparseTensor/Transforms/Utils/ |
H A D | CodegenEnv.h | 1 //===- CodegenEnv.h - Code generation environment class ---------*- C++ -*-===// 9 // This header file defines the code generation environment class. 28 /// The code generation environment class aggregates a number of data 29 /// structures that are needed during the code generation phase of 37 /// Constructs a code generation environment which can be 118 // Code generation environment verify functions.
|
/llvm-project/polly/lib/External/isl/ |
H A D | isl_ast_build_private.h | 16 * corresponding to the context of the AST generation and the constraints 18 * When an isl_ast_build is first created, outside any AST generation, 20 * generation phase is initiated that the domain of the isl_ast_build 32 * of the current AST generation. 65 * used in a nested AST generation should the schedule be non-injective. 120 * of the AST generation. 136 * "loop_type" originally contains loop AST generation types for
|
H A D | isl_schedule_band.c | 365 /* Return the loop AST generation type for the band member of "band" 384 /* Set the loop AST generation type for the band member of "band" 420 /* Return the loop AST generation type for the band member of "band" 439 /* Set the loop AST generation type for the band member of "band" 493 * These can be used to encode loop AST generation options of the given type. 513 /* Add encodings of the "n" loop AST generation options "type" to "options". 631 /* Does "set" encode a loop AST generation option? 655 /* Does "set" encode a loop AST generation option for the isolated part? 692 /* Does "options" encode any loop AST generation options 700 /* Does "options" encode any loop AST generation options? [all …]
|
H A D | ChangeLog | 87 - optionally detect min/max expressions during AST generation 115 - deprecate separation_class AST generation option 161 - make code generation output the same on Solaris 168 - make code generation output independent of endianness 175 - add code generation
|
/llvm-project/clang/test/CodeGen/ |
H A D | mips-madd4.c | 42 // FIXME: Zero has been explicitly placed to force generation of a positive in nmadd_s() 54 // FIXME: Zero has been explicitly placed to force generation of a positive in nmsub_s() 66 // FIXME: Zero has been explicitly placed to force generation of a positive in nmadd_d() 78 // FIXME: Zero has been explicitly placed to force generation of a positive in nmsub_d()
|
/llvm-project/clang/include/clang/InstallAPI/ |
H A D | Context.h | 62 /// generation. 66 /// include their declarations for TextAPI generation. 71 /// generation. 79 // HeaderType::Unknown, they are not used for TextAPI generation.
|
/llvm-project/llvm/docs/tutorial/MyFirstLanguageFrontend/ |
H A D | LangImpl03.rst | 2 Kaleidoscope: Code generation to LLVM IR 25 Code Generation Setup 29 First we define virtual code generation (codegen) methods in each AST 71 parser, which will be used to report errors found during code generation 86 The static variables will be used during code generation. ``TheContext`` 115 Expression Code Generation 239 Code generation for function calls is quite straightforward with LLVM. The code 258 Function Code Generation 261 Code generation for prototypes and functions must handle a number of 263 generation, bu [all...] |
/llvm-project/clang/lib/AST/ |
H A D | ExternalASTSource.cpp | 119 // Make sure the generation of the topmost external source for the context is in incrementGeneration() 125 // FIXME: Only bump the generation counter if the current generation number in incrementGeneration() 128 llvm::report_fatal_error("generation counter overflowed", false);
|
/llvm-project/libc/docs/dev/ |
H A D | header_generation.rst | 176 During the header generation process errors like the one above may occur
|
/llvm-project/polly/www/ |
H A D | index.html | 81 <h4>AST Generation Paper published in TOPLAS</h4> 83 generation techniques used in Polly. This discussion gives not only an 90 while issues like the generation of the correct loop structure and loop 95 support enables the generation of predicated code e.g. in the context of 100 generation for core computations. 101 <li><b>AST generation with modulo constraints:</b> We discuss how modulo 110 <a href="https://www.grosser.es#pub-polyhedral-AST-generation"> 111 <em>Polyhedral AST generation is more than scanning polyhedra</em></a><br /> 226 need to link directly to GMP (if isl is used for code generation). Currently 355 polybench 2.0 with vectorization and OpenMP code generation</ [all...] |