OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:EdgeData
(Results
1 - 3
of
3
) sorted by null
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h
101
struct
EdgeData
{
107
EdgeData
() : worst(0), reverseWorst(0), isUpToDate(false) {}
195
EdgeData
&ed = getHeuristicEdgeData(eItr);
267
EdgeData
&ed = getHeuristicEdgeData(eItr);
301
EdgeData
& getHeuristicEdgeData(Graph::EdgeItr eItr) {
308
EdgeData
&ed = getHeuristicEdgeData(eItr);
356
EdgeData
&ed = getHeuristicEdgeData(eItr);
364
EdgeData
::UnsafeArray &unsafe =
383
EdgeData
&ed = getHeuristicEdgeData(eItr);
391
EdgeData
::UnsafeArray &unsafe
[
all
...]
/external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h
41
typedef typename HImpl::
EdgeData
HeuristicEdgeData;
82
class
EdgeData
{
112
typedef std::list<
EdgeData
> EdgeDataList;
165
EdgeData
&eData = getSolverEdgeData(eItr);
372
edgeDataList.push_back(
EdgeData
());
398
EdgeData
& getSolverEdgeData(Graph::EdgeItr eItr) {
399
return *static_cast<
EdgeData
*>(g.getEdgeData(eItr));
403
EdgeData
&eData = getSolverEdgeData(eItr);
426
edgeDataList.push_back(
EdgeData
());
/external/llvm/lib/Analysis/
MemoryBuiltins.cpp
585
SizeOffsetType
EdgeData
= compute(PHI.getIncomingValue(i));
586
if (!bothKnown(
EdgeData
) ||
EdgeData
!= Ret)
773
SizeOffsetEvalType
EdgeData
= compute_(PHI.getIncomingValue(i));
775
if (!bothKnown(
EdgeData
)) {
782
SizePHI->addIncoming(
EdgeData
.first, PHI.getIncomingBlock(i));
783
OffsetPHI->addIncoming(
EdgeData
.second, PHI.getIncomingBlock(i));
Completed in 918 milliseconds