| /external/swiftshader/third_party/subzero/src/ |
| IceLoopAnalyzer.h | 22 Loop(CfgNode *Header, CfgNode *PreHeader, CfgUnorderedSet<SizeT> Body)
24 CfgNode *Header;
25 CfgNode *PreHeader;
|
| IceCfgNode.h | 11 /// \brief Declares the CfgNode class, which represents a single basic block as
25 class CfgNode {
26 CfgNode() = delete;
27 CfgNode(const CfgNode &) = delete;
28 CfgNode &operator=(const CfgNode &) = delete;
31 static CfgNode *create(Cfg *Func, SizeT Number) {
32 return new (Func->allocate<CfgNode>()) CfgNode(Func, Number)
[all...] |
| IceLiveness.h | 72 Variable *getVariable(SizeT LiveIndex, const CfgNode *Node) const;
79 SizeT getNumVarsInNode(const CfgNode *Node) const {
82 SizeT &getNumNonDeadPhis(const CfgNode *Node) {
85 LivenessBV &getLiveIn(const CfgNode *Node) {
90 LivenessBV &getLiveOut(const CfgNode *Node) {
96 LiveBeginEndMap *getLiveBegin(const CfgNode *Node) {
101 LiveBeginEndMap *getLiveEnd(const CfgNode *Node) {
151 /// ScratchBV is a bitvector that can be reused across CfgNode passes, to
|
| IceCfgNode.cpp | 11 /// \brief Implements the CfgNode class, including the complexities of
31 void CfgNode::appendInst(Inst *Instr) {
54 void CfgNode::replaceInEdge(CfgNode *Old, CfgNode *New) {
85 void CfgNode::renumberInstructions() {
95 void CfgNode::computePredecessors() {
96 for (CfgNode *Succ : OutEdges)
100 void CfgNode::computeSuccessors() {
115 void CfgNode::enforcePhiConsistency()
[all...] |
| IcePhiLoweringImpl.h | 33 void prelowerPhis32Bit(TargetT *Target, CfgNode *Node, Cfg *Func) {
47 CfgNode *Label = Phi->getLabel(I);
63 CfgNode *Label = Phi->getLabel(I);
|
| IceSwitchLowering.h | 43 CaseCluster(uint64_t Value, CfgNode *Target)
52 CfgNode *getTarget() const {
73 CfgNode *Target; /// Target for a range.
|
| IceLoopAnalyzer.cpp | 56 explicit LoopNode(CfgNode *BB) : BB(BB) { reset(); }
84 CfgNode *getNode() { return BB; }
87 CfgNode *BB;
137 for (CfgNode *Succ : BB->getOutEdges()) {
154 for (CfgNode *Node : Nodes)
268 CfgNode *Header = nullptr;
271 CfgNode *Cur = Func->getNodes()[NodeIndex];
291 CfgNode *PreHeader = nullptr;
|
| IceInst.h | 125 // implementation, we assert in case some CfgNode is constructed without a
135 virtual bool repointEdges(CfgNode *OldNode, CfgNode *NewNode) {
375 static InstBr *create(Cfg *Func, Operand *Source, CfgNode *TargetTrue,
376 CfgNode *TargetFalse) {
381 static InstBr *create(Cfg *Func, CfgNode *Target) {
389 CfgNode *getTargetTrue() const { return TargetTrue; }
390 CfgNode *getTargetFalse() const { return TargetFalse; }
391 CfgNode *getTargetUnconditional() const {
397 bool repointEdges(CfgNode *OldNode, CfgNode *NewNode) override
[all...] |
| IceCfg.h | 88 void setEntryNode(CfgNode *EntryNode) { Entry = EntryNode; }
89 CfgNode *getEntryNode() const { return Entry; }
93 CfgNode *makeNode();
101 /// String pool for CfgNode::Name values.
188 /// predecessor and successor edges, in the form of CfgNode::InEdges[] and
189 /// CfgNode::OutEdges[].
235 void setCurrentNode(const CfgNode *Node) { CurrentNode = Node; }
237 const CfgNode *getCurrentNode() const { return CurrentNode; }
324 CfgNode *Entry = nullptr; /// entry basic block
330 // Separate string pools for CfgNode and Variable names, due to a combinatio
[all...] |
| IceCfg.cpp | 88 for (CfgNode *Node : getNodes()) {
106 CfgNode *Cfg::makeNode() {
108 auto *Node = CfgNode::create(this, LabelIndex);
184 for (CfgNode *Node : Nodes) {
294 for (CfgNode *Node : Nodes) {
309 CfgNode *Node = Nodes[Index];
311 for (CfgNode *Succ : Node->getOutEdges()) {
330 for (CfgNode *Node : Nodes)
337 for (CfgNode *Node : Nodes)
352 for (CfgNode *Node : Nodes
[all...] |
| IceASanInstrumentation.h | 61 ICE_TLS_DECLARE_FIELD(CfgNode *, CurNode);
|
| IceTargetLoweringX8632.h | 62 void emitGetIP(CfgNode *Node);
|
| IceTargetLoweringX8664.h | 65 void emitGetIP(CfgNode *Node);
|
| IceVariableSplitting.cpp | 47 /// Variable is tagged with the CfgNode that it is valid in, so that we don't
59 const CfgNode *MappedVarNode = nullptr;
64 const CfgNode *LastUseNode = nullptr;
76 void reset(const CfgNode *CurNode) {
151 const CfgNode *Node = nullptr;
171 void setNode(CfgNode *CurNode) {
426 CfgNode *Node = nullptr;
517 for (CfgNode *Node : Func->getNodes()) {
|
| IceInst.cpp | 314 InstBr::InstBr(Cfg *Func, Operand *Source, CfgNode *TargetTrue_,
315 CfgNode *TargetFalse_)
331 InstBr::InstBr(Cfg *Func, CfgNode *Target)
344 bool InstBr::repointEdges(CfgNode *OldNode, CfgNode *NewNode) {
406 void InstPhi::addArgument(Operand *Source, CfgNode *Label) {
414 Operand *InstPhi::getOperandForTarget(CfgNode *Target) const {
425 void InstPhi::clearOperandForTarget(CfgNode *Target) {
439 void InstPhi::livenessPhiOperand(LivenessBV &Live, CfgNode *Target,
507 CfgNode *LabelDefault
[all...] |
| IceInstMIPS32.h | 302 bool repointEdges(CfgNode *, CfgNode *) override { return true; }
804 static InstMIPS32Br *create(Cfg *Func, CfgNode *Target) {
805 constexpr CfgNode *NoCondTarget = nullptr;
811 static InstMIPS32Br *create(Cfg *Func, CfgNode *Target,
813 constexpr CfgNode *NoCondTarget = nullptr;
819 static InstMIPS32Br *create(Cfg *Func, CfgNode *TargetTrue,
820 CfgNode *TargetFalse, Operand *Src0,
827 static InstMIPS32Br *create(Cfg *Func, CfgNode *TargetTrue,
828 CfgNode *TargetFalse, Operand *Src0
[all...] |
| IceTargetLowering.h | 79 void init(CfgNode *Node);
91 CfgNode *getNode() const { return Node; }
115 CfgNode *Node = nullptr;
224 void lowerInst(CfgNode *Node, InstList::iterator Next, InstHighLevel *Instr);
232 virtual bool doBranchOpt(Inst * /*I*/, const CfgNode * /*NextNode*/) {
336 virtual void initNodeForLowering(CfgNode *) {}
337 virtual void addProlog(CfgNode *Node) = 0;
338 virtual void addEpilog(CfgNode *Node) = 0;
|
| IceOperand.h | 639 void addSegment(InstNumberT Start, InstNumberT End, CfgNode *Node = nullptr);
640 void addSegment(RangeElementType Segment, CfgNode *Node = nullptr) {
664 CfgNode *getNodeForSegment(InstNumberT Begin) {
672 CfgUnorderedMap<InstNumberT, CfgNode *> NodeMap;
792 CfgNode *Node = nullptr) {
[all...] |
| IceOperand.cpp | 104 void LiveRange::addSegment(InstNumberT Start, InstNumberT End, CfgNode *Node) {
226 CfgNode *Node, bool IsImplicit) {
282 CfgNode *Node) {
382 CfgNode *EntryNode = Func->getEntryNode();
387 for (CfgNode *Node : Func->getNodes())
391 void VariablesMetadata::addNode(CfgNode *Node) {
527 CfgNode *VariablesMetadata::getLocalUseNode(const Variable *Var) const {
|
| IceTargetLoweringMIPS32.h | 55 void initNodeForLowering(CfgNode *Node) override {
63 bool doBranchOpt(Inst *Instr, const CfgNode *NextNode) override;
182 void _br(CfgNode *Target) { Context.insert<InstMIPS32Br>(Target); }
184 void _br(CfgNode *Target, const InstMIPS32Label *Label) {
188 void _br(CfgNode *TargetTrue, CfgNode *TargetFalse, Operand *Src0,
194 void _br(CfgNode *TargetTrue, CfgNode *TargetFalse, Operand *Src0,
199 void _br(CfgNode *TargetTrue, CfgNode *TargetFalse, Operand *Src0
[all...] |
| IceInstARM32.h | [all...] |
| WasmTranslator.cpp | 145 /// This class wraps either an Operand or a CfgNode.
160 explicit OperandNode(CfgNode *Node)
174 operator CfgNode *() const {
179 llvm::report_fatal_error("This OperandNode is not a CfgNode");
181 return reinterpret_cast<CfgNode *>(Data & ~NODE_FLAG);
197 CfgNode *toCfgNode() const { return static_cast<CfgNode *>(*this); }
208 Out << "(CfgNode*)" << Op.toCfgNode();
300 Node Loop(CfgNode *Entry) {
321 CfgNode *Control = Controls[i]
[all...] |
| IceTargetLoweringARM32.h | 83 void initNodeForLowering(CfgNode *Node) override {
91 bool doBranchOpt(Inst *I, const CfgNode *NextNode) override;
164 void addProlog(CfgNode *Node) override;
165 void addEpilog(CfgNode *Node) override;
362 void _br(CfgNode *TargetTrue, CfgNode *TargetFalse,
366 void _br(CfgNode *Target) { Context.insert<InstARM32Br>(Target); }
367 void _br(CfgNode *Target, CondARM32::Cond Condition) {
575 /// LowerInt1BranchTarget is used by lowerIntForBranch. It wraps a CfgNode, or
580 explicit LowerInt1BranchTarget(CfgNode *const Target
[all...] |
| IceInstrumentation.cpp | 38 for (CfgNode *Node : Func->getNodes()) {
|
| /external/swiftshader/src/Reactor/ |
| Optimizer.cpp | 65 std::unordered_map<Ice::Inst*, Ice::CfgNode*> node;
89 for(Ice::CfgNode *basicBlock : function->getNodes())
111 Ice::CfgNode *entryBlock = function->getEntryNode();
166 Ice::CfgNode *entryBlock = function->getEntryNode();
267 Ice::CfgNode *entryBlock = function->getEntryNode();
290 Ice::CfgNode *singleBasicBlock = node[addressUses.stores[0]];
366 for(Ice::CfgNode *basicBlock : function->getNodes())
|
