OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:EId
(Results
1 - 5
of
5
) sorted by null
/external/llvm/include/llvm/CodeGen/PBQP/
Graph.h
74
AdjEdgeIdx addAdjEdgeId(EdgeId
EId
) {
76
AdjEdgeIds.push_back(
EId
);
193
EdgeEntry& getEdge(EdgeId
EId
) { return Edges[
EId
]; }
194
const EdgeEntry& getEdge(EdgeId
EId
) const { return Edges[
EId
]; }
212
EdgeId
EId
= 0;
214
EId
= FreeEdgeIds.back();
216
Edges[
EId
] = std::move(E);
218
EId
= Edges.size()
[
all
...]
RegAllocSolver.h
167
void handleAddEdge(EdgeId
EId
) {
168
handleReconnectEdge(
EId
, G.getEdgeNode1Id(
EId
));
169
handleReconnectEdge(
EId
, G.getEdgeNode2Id(
EId
));
172
void handleRemoveEdge(EdgeId
EId
) {
173
handleDisconnectEdge(
EId
, G.getEdgeNode1Id(
EId
));
174
handleDisconnectEdge(
EId
, G.getEdgeNode2Id(
EId
));
[
all
...]
ReductionRules.h
38
EdgeId
EId
= *G.adjEdgeIds(NId).begin();
39
NodeId MId = G.getEdgeOtherNodeId(
EId
, NId);
41
const Matrix &ECosts = G.getEdgeCosts(
EId
);
46
if (NId == G.getEdgeNode1Id(
EId
)) {
68
G.disconnectEdge(
EId
, MId);
172
for (auto
EId
: G.adjEdgeIds(NId)) {
173
const Matrix& edgeCosts = G.getEdgeCosts(
EId
);
174
if (NId == G.getEdgeNode1Id(
EId
)) {
175
NodeId mId = G.getEdgeNode2Id(
EId
);
178
NodeId mId = G.getEdgeNode1Id(
EId
);
[
all
...]
/cts/suite/audio_quality/lib/include/task/
TaskProcess.h
65
EId
,
78
return (mType ==
EId
);
/cts/suite/audio_quality/lib/src/task/
TaskProcess.cpp
85
if ((paramTypes != NULL) && paramTypes[i] && (list[i].getType() !=
EId
)) {
89
if ((paramTypes != NULL) && !paramTypes[i] && (list[i].getType() ==
EId
)) {
94
case
EId
: {
266
Param param(
EId
, item[1]);
331
ASSERT((type == TaskProcess::
EId
) || (type == TaskProcess::EVal));
349
ASSERT((mType == TaskProcess::
EId
) || (mType == TaskProcess::EVal));
Completed in 89 milliseconds