003 File Manager
Current Path:
/usr/src/contrib/llvm-project/llvm/utils/TableGen
usr
/
src
/
contrib
/
llvm-project
/
llvm
/
utils
/
TableGen
/
📁
..
📄
AsmMatcherEmitter.cpp
(149.98 KB)
📄
AsmWriterEmitter.cpp
(46.29 KB)
📄
AsmWriterInst.cpp
(7.57 KB)
📄
AsmWriterInst.h
(3.83 KB)
📄
Attributes.cpp
(3.12 KB)
📄
CTagsEmitter.cpp
(2.52 KB)
📄
CallingConvEmitter.cpp
(11.74 KB)
📄
CodeEmitterGen.cpp
(22.5 KB)
📄
CodeGenDAGPatterns.cpp
(168.72 KB)
📄
CodeGenDAGPatterns.h
(47.85 KB)
📄
CodeGenHwModes.cpp
(3.45 KB)
📄
CodeGenHwModes.h
(1.84 KB)
📄
CodeGenInstruction.cpp
(30.97 KB)
📄
CodeGenInstruction.h
(13.7 KB)
📄
CodeGenIntrinsics.h
(6.6 KB)
📄
CodeGenMapTable.cpp
(23.38 KB)
📄
CodeGenRegisters.cpp
(90.68 KB)
📄
CodeGenRegisters.h
(29.9 KB)
📄
CodeGenSchedule.cpp
(84.92 KB)
📄
CodeGenSchedule.h
(23.14 KB)
📄
CodeGenTarget.cpp
(32.63 KB)
📄
CodeGenTarget.h
(7.22 KB)
📄
DAGISelEmitter.cpp
(6.92 KB)
📄
DAGISelMatcher.cpp
(13.53 KB)
📄
DAGISelMatcher.h
(37.72 KB)
📄
DAGISelMatcherEmitter.cpp
(37.44 KB)
📄
DAGISelMatcherGen.cpp
(44.06 KB)
📄
DAGISelMatcherOpt.cpp
(17.35 KB)
📄
DFAEmitter.cpp
(13.11 KB)
📄
DFAEmitter.h
(3.96 KB)
📄
DFAPacketizerEmitter.cpp
(13.02 KB)
📄
DirectiveEmitter.cpp
(20.15 KB)
📄
DisassemblerEmitter.cpp
(7.02 KB)
📄
ExegesisEmitter.cpp
(7.39 KB)
📄
FastISelEmitter.cpp
(30.83 KB)
📄
FixedLenDecoderEmitter.cpp
(90.04 KB)
📄
GICombinerEmitter.cpp
(40.12 KB)
📁
GlobalISel
📄
GlobalISelEmitter.cpp
(215.56 KB)
📄
InfoByHwMode.cpp
(6.69 KB)
📄
InfoByHwMode.h
(5.74 KB)
📄
InstrDocsEmitter.cpp
(7.05 KB)
📄
InstrInfoEmitter.cpp
(31.52 KB)
📄
IntrinsicEmitter.cpp
(32.87 KB)
📄
OptEmitter.cpp
(2.9 KB)
📄
OptEmitter.h
(575 B)
📄
OptParserEmitter.cpp
(15.16 KB)
📄
OptRSTEmitter.cpp
(2.71 KB)
📄
PredicateExpander.cpp
(17.39 KB)
📄
PredicateExpander.h
(5.19 KB)
📄
PseudoLoweringEmitter.cpp
(11.8 KB)
📄
RISCVCompressInstEmitter.cpp
(39.23 KB)
📄
RegisterBankEmitter.cpp
(12.52 KB)
📄
RegisterInfoEmitter.cpp
(61.32 KB)
📄
SDNodeProperties.cpp
(1.9 KB)
📄
SDNodeProperties.h
(985 B)
📄
SearchableTableEmitter.cpp
(26.81 KB)
📄
SequenceToOffsetTable.h
(8.49 KB)
📄
SubtargetEmitter.cpp
(70.77 KB)
📄
SubtargetFeatureInfo.cpp
(5.72 KB)
📄
SubtargetFeatureInfo.h
(4.05 KB)
📄
TableGen.cpp
(9.7 KB)
📄
TableGenBackends.h
(4.62 KB)
📄
Types.cpp
(1.46 KB)
📄
Types.h
(900 B)
📄
WebAssemblyDisassemblerEmitter.cpp
(6.79 KB)
📄
WebAssemblyDisassemblerEmitter.h
(980 B)
📄
X86DisassemblerShared.h
(1.88 KB)
📄
X86DisassemblerTables.cpp
(42.64 KB)
📄
X86DisassemblerTables.h
(11.7 KB)
📄
X86EVEX2VEXTablesEmitter.cpp
(8.77 KB)
📄
X86FoldTablesEmitter.cpp
(26.09 KB)
📄
X86ModRMFilters.cpp
(636 B)
📄
X86ModRMFilters.h
(4.69 KB)
📄
X86RecognizableInstr.cpp
(47.05 KB)
📄
X86RecognizableInstr.h
(14.13 KB)
Editing: DFAEmitter.h
//===--------------------- DfaEmitter.h -----------------------------------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // Defines a generic automaton builder. This takes a set of transitions and // states that represent a nondeterministic finite state automaton (NFA) and // emits a determinized DFA in a form that include/llvm/Support/Automaton.h can // drive. // // See file llvm/TableGen/Automaton.td for the TableGen API definition. // //===----------------------------------------------------------------------===// #ifndef LLVM_UTILS_TABLEGEN_DFAEMITTER_H #define LLVM_UTILS_TABLEGEN_DFAEMITTER_H #include "llvm/ADT/SmallVector.h" #include "llvm/ADT/UniqueVector.h" #include <map> #include <set> namespace llvm { class raw_ostream; class StringRef; /// Construct a deterministic finite state automaton from possible /// nondeterministic state and transition data. /// /// The state type is a 64-bit unsigned integer. The generated automaton is /// invariant to the sparsity of the state representation - its size is only /// a function of the cardinality of the set of states. /// /// The inputs to this emitter are considered to define a nondeterministic /// finite state automaton (NFA). This is then converted to a DFA during /// emission. The emitted tables can be used to by /// include/llvm/Support/Automaton.h. class DfaEmitter { public: // The type of an NFA state. The initial state is always zero. using state_type = uint64_t; // The type of an action. using action_type = uint64_t; DfaEmitter() = default; virtual ~DfaEmitter() = default; void addTransition(state_type From, state_type To, action_type A); void emit(StringRef Name, raw_ostream &OS); protected: /// Emit the C++ type of an action to OS. virtual void printActionType(raw_ostream &OS); /// Emit the C++ value of an action A to OS. virtual void printActionValue(action_type A, raw_ostream &OS); private: /// The state type of deterministic states. These are only used internally to /// this class. This is an ID into the DfaStates UniqueVector. using dfa_state_type = unsigned; /// The actual representation of a DFA state, which is a union of one or more /// NFA states. using DfaState = SmallVector<state_type, 4>; /// A DFA transition consists of a set of NFA states transitioning to a /// new set of NFA states. The DfaTransitionInfo tracks, for every /// transitioned-from NFA state, a set of valid transitioned-to states. /// /// Emission of this transition relation allows algorithmic determination of /// the possible candidate NFA paths taken under a given input sequence to /// reach a given DFA state. using DfaTransitionInfo = SmallVector<std::pair<state_type, state_type>, 4>; /// The set of all possible actions. std::set<action_type> Actions; /// The set of nondeterministic transitions. A state-action pair can /// transition to multiple target states. std::map<std::pair<state_type, action_type>, std::vector<state_type>> NfaTransitions; std::set<state_type> NfaStates; unsigned NumNfaTransitions = 0; /// The set of deterministic states. DfaStates.getId(DfaState) returns an ID, /// which is dfa_state_type. Note that because UniqueVector reserves state /// zero, the initial DFA state is always 1. UniqueVector<DfaState> DfaStates; /// The set of deterministic transitions. A state-action pair has only a /// single target state. std::map<std::pair<dfa_state_type, action_type>, std::pair<dfa_state_type, DfaTransitionInfo>> DfaTransitions; /// Visit all NFA states and construct the DFA. void constructDfa(); /// Visit a single DFA state and construct all possible transitions to new DFA /// states. void visitDfaState(const DfaState &DS); }; } // namespace llvm #endif
Upload File
Create Folder