OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:NId
(Results
1 - 9
of
9
) sorted by null
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
147
void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId
NId
) {
148
VRegToNodeId[VReg] =
NId
;
299
void handleAddNode(NodeId
NId
) {
300
assert(G.getNodeCosts(
NId
).getLength() > 1 &&
302
G.getNodeMetadata(
NId
).setup(G.getNodeCosts(
NId
));
305
void handleRemoveNode(NodeId
NId
) {}
306
void handleSetNodeCosts(NodeId
NId
, const Vector& newCosts) {}
313
void handleDisconnectEdge(EdgeId EId, NodeId
NId
) {
314
NodeMetadata& NMd = G.getNodeMetadata(
NId
);
[
all
...]
SelectionDAGNodes.h
854
int
NId
= N->getNodeId();
855
// If we Invalidated the Id, reconstruct original
NId
.
856
if (
NId
< -1)
857
NId
= -(
NId
+ 1);
863
if (TopologicalPrune && M->getOpcode() != ISD::TokenFactor && (
NId
> 0) &&
864
(MId > 0) && (MId <
NId
)) {
[
all
...]
/external/llvm/include/llvm/CodeGen/PBQP/
Graph.h
126
void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId
NId
) {
127
if (
NId
== NIds[0])
130
assert(
NId
== NIds[1] && "Edge does not connect
NId
.");
140
void setAdjEdgeIdx(NodeId
NId
, typename NodeEntry::AdjEdgeIdx NewIdx) {
141
if (
NId
== NIds[0])
144
assert(
NId
== NIds[1] && "Edge not connected to
NId
");
157
void disconnectFrom(Graph &G, NodeId
NId
) {
158
if (
NId
== NIds[0]
[
all
...]
ReductionRules.h
29
void applyR1(GraphT &G, typename GraphT::NodeId
NId
) {
36
assert(G.getNodeDegree(
NId
) == 1 &&
39
EdgeId EId = *G.adjEdgeIds(
NId
).begin();
40
NodeId MId = G.getEdgeOtherNodeId(EId,
NId
);
43
const Vector &XCosts = G.getNodeCosts(
NId
);
47
if (
NId
== G.getEdgeNode1Id(EId)) {
73
void applyR2(GraphT &G, typename GraphT::NodeId
NId
) {
80
assert(G.getNodeDegree(
NId
) == 2 &&
83
const Vector &XCosts = G.getNodeCosts(
NId
);
85
typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(
NId
).begin()
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
Graph.h
124
void setAdjEdgeIdx(NodeId
NId
, typename NodeEntry::AdjEdgeIdx NewIdx) {
125
if (
NId
== NIds[0])
128
assert(
NId
== NIds[1] && "Edge not connected to
NId
");
141
void disconnectFrom(Graph &G, NodeId
NId
) {
142
if (
NId
== NIds[0])
145
assert(
NId
== NIds[1] && "Edge does not connect
NId
");
181
NodeEntry &getNode(NodeId
NId
) {
182
assert(
NId
< Nodes.size() && "Out of bound NodeId")
[
all
...]
ReductionRules.h
31
void applyR1(GraphT &G, typename GraphT::NodeId
NId
) {
38
assert(G.getNodeDegree(
NId
) == 1 &&
41
EdgeId EId = *G.adjEdgeIds(
NId
).begin();
42
NodeId MId = G.getEdgeOtherNodeId(EId,
NId
);
45
const Vector &XCosts = G.getNodeCosts(
NId
);
49
if (
NId
== G.getEdgeNode1Id(EId)) {
75
void applyR2(GraphT &G, typename GraphT::NodeId
NId
) {
82
assert(G.getNodeDegree(
NId
) == 2 &&
85
const Vector &XCosts = G.getNodeCosts(
NId
);
87
typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(
NId
).begin()
[
all
...]
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
155
void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId
NId
) {
156
VRegToNodeId[VReg] =
NId
;
359
void handleAddNode(NodeId
NId
) {
360
assert(G.getNodeCosts(
NId
).getLength() > 1 &&
362
G.getNodeMetadata(
NId
).setup(G.getNodeCosts(
NId
));
364
void handleRemoveNode(NodeId
NId
) {}
365
void handleSetNodeCosts(NodeId
NId
, const Vector& newCosts) {}
377
void handleDisconnectEdge(EdgeId EId, NodeId
NId
) {
378
NodeMetadata& NMd = G.getNodeMetadata(
NId
);
[
all
...]
/external/llvm/lib/CodeGen/
RegAllocPBQP.cpp
170
for (auto
NId
: G.nodeIds()) {
172
LIS.getInterval(G.getNodeMetadata(
NId
).getVReg()).weight;
177
PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(
NId
));
179
G.setNodeCosts(
NId
, std::move(NodeCosts));
195
bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId
NId
,
198
const auto *NRegs = &G.getNodeMetadata(
NId
).getAllowedRegs();
210
void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId
NId
,
213
const auto *NRegs = &G.getNodeMetadata(
NId
).getAllowedRegs();
304
for (auto
NId
: G.nodeIds()) {
305
unsigned VReg = G.getNodeMetadata(
NId
).getVReg()
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
RegAllocPBQP.cpp
201
for (auto
NId
: G.nodeIds()) {
203
LIS.getInterval(G.getNodeMetadata(
NId
).getVReg()).weight;
208
PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(
NId
));
210
G.setNodeCosts(
NId
, std::move(NodeCosts));
225
bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId
NId
,
228
const auto *NRegs = &G.getNodeMetadata(
NId
).getAllowedRegs();
240
void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId
NId
,
243
const auto *NRegs = &G.getNodeMetadata(
NId
).getAllowedRegs();
334
for (auto
NId
: G.nodeIds()) {
335
unsigned VReg = G.getNodeMetadata(
NId
).getVReg()
[
all
...]
Completed in 387 milliseconds