| /llvm-project-15.0.7/llvm/tools/llvm-diff/lib/ |
| H A D | DifferenceEngine.h | 38 Engine.consumer.enterContext(L, R); in Context() 42 Engine.consumer.exitContext(); in ~Context() 60 DifferenceEngine(Consumer &consumer) in DifferenceEngine() argument 61 : consumer(consumer), globalValueOracle(nullptr) {} in DifferenceEngine() 66 consumer.log(text); in log() 69 return LogBuilder(consumer, text); in logf() 71 Consumer& getConsumer() const { return consumer; } in getConsumer() 85 Consumer &consumer;
|
| H A D | DiffLog.h | 29 Consumer *consumer; variable 40 LogBuilder(Consumer &c, StringRef Format) : consumer(&c), Format(Format) {} in LogBuilder() 42 : consumer(L.consumer), Format(L.Format), in LogBuilder() 44 L.consumer = nullptr; in LogBuilder() 64 Consumer &consumer; variable 67 DiffLogBuilder(Consumer &c) : consumer(c) {} in DiffLogBuilder()
|
| H A D | DiffLog.cpp | 20 if (consumer) in ~LogBuilder() 21 consumer->logf(*this); in ~LogBuilder() 29 DiffLogBuilder::~DiffLogBuilder() { consumer.logd(*this); } in ~DiffLogBuilder()
|
| /llvm-project-15.0.7/polly/lib/External/isl/interface/ |
| H A D | extract_interface.cc | 510 gen = new python_generator(SM, consumer.exported_types, in generate() 511 consumer.exported_functions, consumer.functions); in generate() 513 gen = new plain_cpp_generator(SM, consumer.exported_types, in generate() 514 consumer.exported_functions, consumer.functions); in generate() 516 gen = new plain_cpp_generator(SM, consumer.exported_types, in generate() 517 consumer.exported_functions, consumer.functions, true); in generate() 520 consumer.exported_functions, consumer.functions); in generate() 523 consumer.exported_functions, consumer.functions); in generate() 579 MyASTConsumer consumer; in main() local 580 Sema *sema = new Sema(PP, Clang->getASTContext(), consumer); in main() [all …]
|
| /llvm-project-15.0.7/mlir/test/python/ir/ |
| H A D | operation.py | 216 assert len(consumer.operands) == 2 243 assert len(consumer.operands) == 5 244 for left, right in zip(consumer.operands, consumer.operands[::-1][::-1]): 252 full_slice = consumer.operands[:] 258 first_two = consumer.operands[0:2] 264 last_two = consumer.operands[3:] 271 even = consumer.operands[::2] 301 assert len(consumer.operands) == 1 302 type = consumer.operands[0].type 306 print(consumer.operands[0]) [all …]
|
| /llvm-project-15.0.7/mlir/test/lib/Dialect/Linalg/ |
| H A D | TestLinalgElementwiseFusion.cpp | 39 const OpOperand &consumer) { in setFusedOpOperandLimit() argument 43 addOperands(consumer.getOwner(), fusedOpOperands); in setFusedOpOperandLimit() 128 [](const OpResult &producer, OpOperand &consumer) { in runOnOperation() argument 136 dyn_cast<tensor::ExpandShapeOp>(consumer.getOwner())) { in runOnOperation() 166 OpOperand &consumer) -> bool { in runOnOperation() argument 169 return consumer.getOperandNumber(); in runOnOperation()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Linalg/Transforms/ |
| H A D | ElementwiseOpFusion.cpp | 81 if (!consumer.isInputTensor(consumerOpOperand)) in areElementwiseOpsFusable() 105 if ((consumer.getNumReductionLoops())) { in areElementwiseOpsFusable() 115 llvm::zip(consumer->getOperands(), consumer.getIndexingMapsArray())) { in areElementwiseOpsFusable() 175 assert(consumer.isInputTensor(consumerOpOperand) && in generateFusedElementwiseOpRegion() 203 .take_front(consumer.getNumInputs()) in generateFusedElementwiseOpRegion() 259 assert(consumer.isInputTensor(consumerOpOperand) && in fuseElementwiseOpsImpl() 266 consumer->getNumOperands()); in fuseElementwiseOpsImpl() 268 consumer->getNumOperands()); in fuseElementwiseOpsImpl() 319 consumer.getLoc(), consumer->getResultTypes(), in fuseElementwiseOpsImpl() 323 consumer.iterator_types(), in fuseElementwiseOpsImpl() [all …]
|
| H A D | Fusion.cpp | 209 LinalgOp consumer) { in isStructurallyFusableProducer() argument 212 assert(consumer.hasBufferSemantics() && in isStructurallyFusableProducer() 220 if (!dom.dominates(producer->getBlock(), consumer->getBlock())) { in isStructurallyFusableProducer() 230 LinalgOp consumer, in isProducerLastWriteOfView() argument 235 assert(consumer.hasBufferSemantics() && in isProducerLastWriteOfView() 239 if (!isStructurallyFusableProducer(producer, consumedView, consumer)) { in isProducerLastWriteOfView() 245 if (!graph.findCoveringWrites(producer, consumer, consumedView).empty()) { in isProducerLastWriteOfView() 254 LinalgOp consumer, Value consumedView, in isFusableInto() argument 258 assert(consumer.hasBufferSemantics() && in isFusableInto() 260 if (!isProducerLastWriteOfView(graph, consumer, consumedView, producer)) in isFusableInto() [all …]
|
| H A D | ConstantFold.cpp | 126 OpOperand *consumer = genericOp.getInputOperand(i); in matchAndRewrite() local 127 OpResult producer = consumer->get().cast<OpResult>(); in matchAndRewrite() 128 if (!controlFn(producer, *consumer)) in matchAndRewrite()
|
| /llvm-project-15.0.7/llvm/test/MC/Hexagon/ |
| H A D | new-value-check.s | 6 # CHECK-STRICT: :10:3: note: Register producer has the opposite predicate sense as consumer 7 # CHECK-RELAXED: :10:3: note: Register producer has the opposite predicate sense as consumer 25 # CHECK-STRICT: :28:3: note: Register producer is predicated and consumer is unconditional 32 …ECK-STRICT: :36:3: note: Register producer does not use the same predicate register as the consumer 40 # CHECK-STRICT: :43:3: note: Register producer is predicated and consumer is unconditional
|
| /llvm-project-15.0.7/llvm/test/CodeGen/SPIRV/instructions/ |
| H A D | nested-composites.ll | 5 ; CHECK-DAG: OpName [[CONSUMER:%.+]] "consumer" 26 %ret = call i32 @consumer(%ty2 %agg) 55 define i32 @consumer(%ty2 %agg) {
|
| /llvm-project-15.0.7/mlir/test/Dialect/Transform/ |
| H A D | ops-invalid.mlir | 101 // expected-error @below {{result #0 has more than one potential consumer}} 113 // expected-error @below {{result #0 has more than one potential consumer}} 128 // expected-error @below {{result #0 has more than one potential consumer}} 143 // expected-error @below {{result #0 has more than one potential consumer}} 192 // expected-error @below {{result #0 has more than one potential consumer}}
|
| /llvm-project-15.0.7/mlir/test/IR/ |
| H A D | operation-equality.mlir | 167 "test.consumer"(%0#0, %0#1) : (i32, i32) -> () 171 "test.consumer"(%0#0, %0#1) : (i32, i32) -> () 181 "test.consumer"(%0#0, %0#1) : (i32, i32) -> () 185 "test.consumer"(%0#1, %0#0) : (i32, i32) -> ()
|
| /llvm-project-15.0.7/llvm/test/MC/Hexagon/PacketRules/ |
| H A D | newvalue_producers.s | 30 # CHECK: 28:3: note: Register producer has the opposite predicate sense as consumer 35 # CHECK: 33:3: note: Register producer is predicated and consumer is unconditional 40 # CHECK: 38:3: note: Register producer is predicated and consumer is unconditional
|
| /llvm-project-15.0.7/clang/unittests/Tooling/ |
| H A D | TransformerTest.cpp | 129 Transformer::ChangeSetConsumer consumer() { in consumer() function in __anon7c89a2a40111::ClangRefactoringTestBase 382 consumer()); in TEST_F() 614 consumer()); in TEST_F() 631 consumer()); in TEST_F() 801 consumer()); in TEST_F() 1071 consumer()); in TEST_F() 1086 consumer()); in TEST_F() 1100 consumer()); in TEST_F() 1114 consumer()); in TEST_F() 1613 consumer()); in TEST_F() [all …]
|
| /llvm-project-15.0.7/clang/lib/Frontend/ |
| H A D | ChainedIncludesSource.cpp | 163 auto consumer = std::make_unique<PCHGenerator>( in createChainedIncludesSource() local 167 consumer->GetASTMutationListener()); in createChainedIncludesSource() 168 Clang->setASTConsumer(std::move(consumer)); in createChainedIncludesSource()
|
| /llvm-project-15.0.7/mlir/test/Transforms/ |
| H A D | loop-fusion-4.mlir | 8 // Expects fusion of producer into consumer at depth 4 and subsequent removal of 46 // Expects fusion of producer into consumer at depth 2 and subsequent removal of 74 // Expects fusion of producer into consumer at depth 1 and source loop to not
|
| /llvm-project-15.0.7/llvm/docs/PDB/ |
| H A D | HashTable.rst | 15 a consumer to read a list of values and reconstruct the hash table on the fly. 19 value type is a uint32. The only requirement is that the producer and consumer
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/ |
| H A D | regalloc-liveout-undef.mir | 3 # If there is no consumer of the live intervals, the live intervals pass
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Linalg/Utils/ |
| H A D | Utils.h | 171 LinalgOp consumer, Value consumedView, 177 bool isFusableInto(const LinalgDependenceGraph &graph, LinalgOp consumer,
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/ |
| H A D | peephole-callee-save-regalloc.mir | 5 # the register class of the consumer.
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Affine/ |
| H A D | Passes.td | 50 combines two fusion strategies: producer-consumer fusion and sibling fusion. 51 Producer-consumer fusion is aimed at fusing pairs of loops where the first 63 Example 1: Producer-consumer fusion. 169 " \"greedy\", \"Perform greedy (both producer-consumer and sibling) fusion\"), " 171 "\"producer\", \"Perform only producer-consumer fusion\"), "
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | bundle-latency.mir | 4 # Check that we move consumer further from producer, even if one of them is in a bundle.
|
| /llvm-project-15.0.7/llvm/test/Object/X86/ |
| H A D | irsymtab.ll | 8 ; RUN: env LLVM_OVERRIDE_PRODUCER=consumer llvm-lto2 dump-symtab %t | FileCheck --check-prefix=SYMT…
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonInstrFormats.td | 97 let TSFlags{14} = isNewValue; // New-value consumer insn. 301 let TSFlags{10} = isNewValue; // New-value consumer insn.
|