Home
last modified time | relevance | path

Searched refs:bytecode (Results 1 – 25 of 28) sorted by relevance

12

/llvm-project-15.0.7/mlir/lib/Rewrite/
H A DPatternApplicator.cpp26 if (const PDLByteCode *bytecode = frozenPatternList.getPDLByteCode()) { in PatternApplicator() local
28 bytecode->initializeMutableState(*mutableByteCodeState); in PatternApplicator()
55 if (const PDLByteCode *bytecode = frozenPatternList.getPDLByteCode()) { in applyCostModel() local
56 for (const auto &it : llvm::enumerate(bytecode->getPatterns())) in applyCostModel()
120 if (const PDLByteCode *bytecode = frozenPatternList.getPDLByteCode()) { in walkAllPatterns() local
121 for (const Pattern &it : bytecode->getPatterns()) in walkAllPatterns()
135 const PDLByteCode *bytecode = frozenPatternList.getPDLByteCode(); in matchAndRewrite() local
136 if (bytecode) in matchAndRewrite()
137 bytecode->match(op, rewriter, pdlMatches, *mutableByteCodeState); in matchAndRewrite()
194 bytecode->rewrite(rewriter, *pdlMatch, *mutableByteCodeState); in matchAndRewrite()
H A DByteCode.cpp336 : bytecode(bytecode), generator(generator) {} in ByteCodeWriter()
339 void append(ByteCodeField field) { bytecode.push_back(field); } in append()
340 void append(OpCode opCode) { bytecode.push_back(opCode); } in append()
349 bytecode.append({fieldParts[0], fieldParts[1]}); in append()
357 unresolvedSuccessorRefs[successor].push_back(bytecode.size()); in append()
370 bytecode.push_back(values.size()); in appendPDLValueList()
399 bytecode.push_back(static_cast<ByteCodeField>(kind)); in appendPDLValueKind()
408 bytecode.push_back(generator.getMemIndex(value)); in append()
415 bytecode.push_back(llvm::size(range)); in append()
435 bytecode.append(fieldParts, fieldParts + numParts); in appendInline()
[all …]
/llvm-project-15.0.7/llvm/docs/HistoricalNotes/
H A D2000-12-06-MeetingSummary.txt4 We met to discuss the LLVM instruction format and bytecode representation:
20 bytecode would have to parse and handle it. This would slow down the
38 1. Including dominator information in the LLVM bytecode
42 in the LLVM bytecode program. Basic blocks could be numbered according
43 to the order of occurrence in the bytecode representation.
66 runtime to skip information that it didn't understand in a bytecode
H A D2001-02-13-Reference-MemoryResponse.txt34 > no way to represent this in either the bytecode or assembly.
35 > B. When parsing assembly/bytecode, we effectively have to do a full
42 how big the bytecode files are before expanding them further. I am pretty
43 keen to explore the implications of LLVM for mobile devices. Both bytecode
H A D2001-02-13-Reference-Memory.txt30 no way to represent this in either the bytecode or assembly.
31 B. When parsing assembly/bytecode, we effectively have to do a full
36 bytecode to get around this... what do you think?
H A D2001-02-09-AdveCommentsResponse.txt59 > - it could make the bytecode significantly larger because there could
86 No, it isn't. Remember that the bytecode encoding saves value slots into
87 the bytecode instructions themselves, not constant values. This is
H A D2003-06-26-Reoptimizer2.txt57 2. Run opt -lowerswitch -paths -emitfuncs on the bytecode.
H A D2001-02-09-AdveComments.txt41 - it could make the bytecode significantly larger because there could
H A D2003-06-25-Reoptimizer1.txt6 We use opt to do Bytecode-to-bytecode instrumentation. Look at
H A D2000-11-18-EarlyDesignIdeasResp.txt26 * Java bytecode is used as our "safe" representation (to avoid
/llvm-project-15.0.7/llvm/test/Assembler/
H A D2002-08-16-ConstExprInlined.ll1 ; In this testcase, the bytecode reader or writer is not correctly handling the
7 ; disassembling this would be good, but in addition to that, the bytecode
H A D2004-10-22-BCWriterUndefBug.ll1 ;; The bytecode writer was trying to treat undef values as ConstantArray's when
H A D2002-08-19-BytecodeReader.ll1 ; Testcase that seems to break the bytecode reader. This comes from the
/llvm-project-15.0.7/llvm/test/Verifier/
H A Dnon-integer-gep-index.ll8 ; impossible to load from .ll file. Hence in this test we use bytecode input.
/llvm-project-15.0.7/llvm/test/Integer/
H A Dbasictest_bt.ll6 ; Test "stripped" format where nothing is symbolic... this is how the bytecode
H A Dconstpointer_bt.ll7 ; declared and involves an icky bytecode encoding. There is no meaningful
/llvm-project-15.0.7/llvm/test/Feature/
H A Dbasictest.ll5 ; Test "stripped" format where nothing is symbolic... this is how the bytecode
H A Dconstpointer.ll7 ; declared and involves an icky bytecode encoding. There is no meaningful
/llvm-project-15.0.7/clang/docs/
H A DConstantInterpreter.rst23 backends: one to generate bytecode for functions (``ByteCodeEmitter``) and
25 generating bytecode (``EvalEmitter``). All functions are compiled to
26 bytecode, while toplevel expressions used in constant contexts are directly
27 evaluated since the bytecode would never be reused. This mechanism aims to
211 Descriptors are generated at bytecode compilation time and contain information
371 * Continue-after-failure: a form of exception handling at the bytecode
/llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/
H A Dswitch-in-loop.ll4 ;; bytecode interpreter) lowers reasonably without any irreducible
/llvm-project-15.0.7/llvm/test/Object/
H A Darchive-extract.test1 ; This test just makes sure that llvm-ar can extract bytecode members
/llvm-project-15.0.7/llvm/docs/
H A DCFIVerify.rst62 are not implemented due to a lack of information provided by the bytecode.
/llvm-project-15.0.7/llvm/test/Transforms/SampleProfile/
H A Dgcc-simple.ll18 ; This test was compiled down to bytecode at -O0 to avoid inlining foo() into
/llvm-project-15.0.7/mlir/test/Integration/Dialect/PDL/CPU/
H A Dmultiroot.mlir1 // RUN: mlir-opt %s -allow-unregistered-dialect -test-pdl-bytecode-pass -split-input-file | FileCh…
/llvm-project-15.0.7/mlir/include/mlir/Dialect/PDLInterp/IR/
H A DPDLInterpOps.td599 In the bytecode interpreter, this operation is implemented by looping over
600 the values and, for each selection, running the bytecode until we reach

12