OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Edges
(Results
1 - 13
of
13
) sorted by null
/external/llvm/include/llvm/CodeGen/PBQP/
Graph.h
189
EdgeVector
Edges
;
203
EdgeEntry& getEdge(EdgeId EId) { return
Edges
[EId]; }
204
const EdgeEntry& getEdge(EdgeId EId) const { return
Edges
[EId]; }
226
Edges
[EId] = std::move(E);
228
EId =
Edges
.size();
229
Edges
.push_back(std::move(E));
281
: CurEId(CurEId), EndEId(G.
Edges
.size()), FreeEdgeIds(G.FreeEdgeIds) {
321
EdgeItr end() const { return EdgeItr(G.
Edges
.size(), G); }
322
bool empty() const { return G.
Edges
.empty(); }
324
return G.
Edges
.size() - G.FreeEdgeIds.size()
[
all
...]
/external/llvm/lib/Analysis/
CFLAliasAnalysis.cpp
113
// \brief
Edges
can be one of four "weights" -- each weight must have an inverse
119
// two
edges
, but having a distinction bought us nothing.
155
// \brief Gets the
edges
our graph should have, based on an Instruction*
349
// Adding
edges
between arguments for arguments that may end up aliasing
518
std::vector<Edge>
Edges
;
531
// \brief Iterator for
edges
. Because this graph is bidirected, we don't
532
// allow modification of the
edges
using this iterator. Additionally, the
533
// iterator becomes invalid if you add
edges
to or from the node you're
534
// getting the
edges
of.
573
EdgeIterable(const std::vector<Edge> &
Edges
)
[
all
...]
BlockFrequencyInfoImpl.cpp
134
// Sort so
edges
to the same node are adjacent.
139
// Combine adjacent
edges
.
590
Irr.
Edges
.push_back(&SuccIrr);
591
SuccIrr.
Edges
.push_front(&Irr);
655
// Skip forward
edges
.
740
// reflect the masses flowing through back
edges
.
/external/llvm/lib/Transforms/Instrumentation/
PGOInstrumentation.cpp
18
// those
edges
not on the spanning tree. Knuth proves this method instruments
19
// the minimum number of
edges
.
22
//
edges
have higher frequencies (more likely to execute). The idea is to
23
// instrument those less frequently executed
edges
to reduce the runtime
77
STATISTIC(NumOfPGOInstrument, "Number of
edges
instrumented.");
78
STATISTIC(NumOfPGOEdge, "Number of
edges
.");
171
// This class implements the CFG
edges
. Note the CFG can be a multi-graph.
172
// So there might be multiple
edges
with same SrcBB and DestBB.
203
// This class implements the CFG
edges
. Note the CFG can be a multi-graph.
225
// Dump
edges
and BB information
[
all
...]
GCOVProfiling.cpp
12
// to records the
edges
between blocks that run and emit a complementary "gcda"
97
// Modify the program to track transitions along
edges
and call into the
112
// pred block number for certain non-trivial
edges
.
241
// function, number of lines belonging to each block, and a set of
edges
to
288
// Only allow copy before
edges
and lines have been added. After that,
289
// there are inter-block pointers (eg:
edges
) that won't take kindly to
309
// set of blocks and a map of
edges
between blocks. This is the only GCOV
389
// Emit
edges
between blocks.
586
unsigned
Edges
= 0;
590
++
Edges
;
[
all
...]
/external/llvm/lib/CodeGen/
AggressiveAntiDepBreaker.cpp
251
/// AntiDepEdges - Return in
Edges
the anti- and output- dependencies
253
static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>&
Edges
) {
259
Edges
.push_back(&*P);
277
// other types of
edges
.
788
// Attempt to break anti-dependence
edges
. Walk the instructions
809
// The dependence
edges
that represent anti- and output-
811
std::vector<const SDep *>
Edges
;
813
AntiDepEdges(PathSU,
Edges
);
829
for (unsigned i = 0, e =
Edges
.size(); i != e; ++i) {
830
const SDep *Edge =
Edges
[i]
[
all
...]
/prebuilts/tools/linux-x86_64/kythe/proto/
xref.proto
45
// facts/
edges
for node". A node is extensionally defined by its facts and
46
//
edges
, so a node without any facts or
edges
is not considered to exist.
49
// TODO(schroederc): break off Nodes/
Edges
into a separate service
54
//
Edges
returns a subset of the outbound
edges
for each of a set of
56
rpc
Edges
(EdgesRequest) returns (EdgesReply) {}
58
// Decorations returns an index of the nodes and
edges
associated with a
119
// The tickets of the source nodes for which
edges
are requested.
123
// The kinds of outbound
edges
that should be returned for each matchin
[
all
...]
/external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h
203
ExitMap Exits; ///< Successor
edges
(and weights).
274
/// there are no irreducible
edges
to Node, then it will have complexity
322
/// All
edges
in the original function are 32-bit. However, exit
edges
from
367
/// Combines multiple
edges
to the same \a Weight::TargetNode and scales
389
/// \brief Add all
edges
out of a packaged loop to the distribution.
391
/// Adds all
edges
from LocalLoopHead to Dist. Calls addToDist() to add each
541
/// graphs for most
edges
, but getting others from \a LoopData::ExitMap. The
557
std::deque<const IrrNode *>
Edges
;
561
iterator pred_begin() const { return
Edges
.begin();
[
all
...]
/external/llvm/lib/IR/
GCOV.cpp
165
// read
edges
.
183
Edges
.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst]));
184
GCOVEdge *Edge =
Edges
.back().get();
307
errs() << "Unexpected number of
edges
(in " << Name << ").\n";
316
errs() << "Unexpected number of
edges
(in " << Name << ").\n";
374
/// destination has no outgoing
edges
, also update that block's count too.
383
/// sortDstEdges - Sort destination
edges
by block number, nop if already
403
dbgs() << "\tSource
Edges
: ";
409
dbgs() << "\tDestination
Edges
: ";
/external/llvm/include/llvm/Support/
GCOV.h
293
SmallVector<std::unique_ptr<GCOVEdge>, 16>
Edges
;
/external/llvm/lib/Transforms/Scalar/
JumpThreading.cpp
211
// back
edges
. This works for normal cases but not for unreachable blocks as
229
//
edges
which simplifies the CFG.
348
///
edges
across a loop header. For example, threading a jump from outside the
357
SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32>
Edges
;
358
FindFunctionBackedges(F,
Edges
);
360
for (unsigned i = 0, e =
Edges
.size(); i != e; ++i)
361
LoopHeaders.insert(const_cast<BasicBlock*>(
Edges
[i].second));
[
all
...]
/external/opencv3/modules/cudalegacy/src/cuda/
ccomponetns.cu
129
enum
Edges
{ UP = 1, DOWN = 2, LEFT = 4, RIGHT = 8, EMPTY = 0xF0 };
208
void computeEdges(const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream)
216
computeConnectivity<T, Int_t><<<grid, block, 0, stream>>>(static_cast<const PtrStepSz<T> >(image),
edges
, inInt);
223
template void computeEdges<uchar> (const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream);
224
template void computeEdges<uchar3> (const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream);
225
template void computeEdges<uchar4> (const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream);
226
template void computeEdges<ushort> (const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream);
227
template void computeEdges<ushort3>(const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream);
228
template void computeEdges<ushort4>(const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream);
229
template void computeEdges<int> (const PtrStepSzb& image, PtrStepSzb
edges
, const float4& lo, const float4& hi, cudaStream_t stream)
[
all
...]
/external/ImageMagick/www/api/
morphology.php
254
<dd> Peak:radius1,radius2 Find any peak larger than the pixels the fall between the two radii. The default ring of pixels is as per "Ring".
Edges
Find flat orthogonal
edges
of a binary shape Corners Find 90 degree corners of a binary shape Diagonals:type A special kernel to thin the 'outside' of diagonals LineEnds:type Find end points of lines (for pruning a skeletion) Two types of lines ends (default to both) can be searched for Type 0: All line ends Type 1: single kernel for 4-conneected line ends Type 2: single kernel for simple line ends LineJunctions Find three line junctions (within a skeletion) Type 0: all line junctions Type 1: Y Junction kernel Type 2: Diagonal T Junction kernel Type 3: Orthogonal T Junction kernel Type 4: Diagonal X Junction kernel Type 5: Orthogonal + Junction kernel Ridges:type Find single pixel ridges or thin lines Type 1: Fine single pixel thick lines and ridges Type 2: Find two pixel thick lines and ridges ConvexHull Octagonal Thickening Kernel, to generate convex hulls of 45 degrees Skeleton:type Traditional skeleton generating kernels. Type 1: Tradional Skeleton kernel (4 connected skeleton) Type 2: HIPR2 Skeleton kernel (8 connected skeleton) Type 3: Thinning skeleton based on a ressearch paper by Dan S. Bloomberg (Default Type) ThinSE:type A huge variety of Thinning Kernels designed to preserve conectivity. many other kernel sets use these kernels as source definitions. Type numbers are 41-49, 81-89, 481, and 482 which are based on the super and sub notations used in the source research paper. </dd>
[
all
...]
Completed in 794 milliseconds