| /system/update_engine/payload_generator/ |
| graph_types.cc | 21 const Vertex::Index Vertex::kInvalidIndex = static_cast<Vertex::Index>(-1);
|
| tarjan.h | 25 // component containing the vertex passed in.
38 void Execute(Vertex::Index vertex,
40 std::vector<Vertex::Index>* out);
42 void Tarjan(Vertex::Index vertex, Graph* graph);
44 Vertex::Index index_;
45 Vertex::Index required_vertex_;
46 std::vector<Vertex::Index> stack_;
47 std::vector<std::vector<Vertex::Index>> components_
[all...] |
| graph_utils.h | 38 void AddReadBeforeDep(Vertex* src,
39 Vertex::Index dst,
41 void AddReadBeforeDepExtents(Vertex* src,
42 Vertex::Index dst,
45 void DropWriteBeforeDeps(Vertex::EdgeMap* edge_map);
48 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
|
| cycle_breaker.h | 52 void Unblock(Vertex::Index u);
53 bool Circuit(Vertex::Index vertex, Vertex::Index depth);
57 Vertex::Index current_vertex_; // "s" in the paper
58 std::vector<Vertex::Index> stack_; // the stack variable in the paper
|
| graph_types.h | 53 struct Vertex {
54 Vertex() :
60 typedef std::map<std::vector<Vertex>::size_type, EdgeProperties> EdgeMap;
65 // When considering this vertex within a subgraph, subgraph_edges stores
67 typedef std::set<std::vector<Vertex>::size_type> SubgraphEdgeMap;
71 std::vector<Vertex>::size_type index;
72 std::vector<Vertex>::size_type lowlink;
74 // Other Vertex properties:
77 typedef std::vector<Vertex>::size_type Index;
78 static const Vertex::Index kInvalidIndex
[all...] |
| topological_sort.cc | 31 set<Vertex::Index>* visited_nodes,
32 vector<Vertex::Index>* nodes,
33 Vertex::Index node) {
39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin();
48 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) {
49 set<Vertex::Index> visited_nodes;
51 for (Vertex::Index i = 0; i < graph.size(); i++) {
|
| topological_sort.h | 38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| topological_sort_unittest.cc | 54 const Vertex::Index n_a = counter++;
55 const Vertex::Index n_b = counter++;
56 const Vertex::Index n_c = counter++;
57 const Vertex::Index n_d = counter++;
58 const Vertex::Index n_e = counter++;
59 const Vertex::Index n_f = counter++;
60 const Vertex::Index n_g = counter++;
61 const Vertex::Index n_h = counter++;
62 const Vertex::Index n_i = counter++;
63 const Vertex::Index n_j = counter++
[all...] |
| inplace_generator.h | 37 // nodes old_src -> old_dst by creating new vertex new_vertex. The new
46 Vertex::Index new_vertex;
47 Vertex::Index old_src;
48 Vertex::Index old_dst;
59 // each of which has a corresponding vertex in a graph.
60 // A Block object tells which vertex will read or write this block
64 Block() : reader(Vertex::kInvalidIndex), writer(Vertex::kInvalidIndex) {}
65 Vertex::Index reader;
66 Vertex::Index writer
[all...] |
| tarjan.cc | 31 const vector<Vertex>::size_type kInvalidIndex = -1;
34 void TarjanAlgorithm::Execute(Vertex::Index vertex,
36 vector<Vertex::Index>* out) {
42 required_vertex_ = vertex;
44 Tarjan(vertex, graph);
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) {
50 CHECK_EQ((*graph)[vertex].index, kInvalidIndex);
51 (*graph)[vertex].index = index_
[all...] |
| tarjan_unittest.cc | 37 const Vertex::Index n_a = 0;
38 const Vertex::Index n_b = 1;
39 const Vertex::Index n_c = 2;
40 const Vertex::Index n_d = 3;
41 const Vertex::Index n_e = 4;
42 const Vertex::Index n_f = 5;
43 const Vertex::Index n_g = 6;
44 const Vertex::Index n_h = 7;
64 for (Vertex::Index i = n_a; i <= n_e; i++) {
65 vector<Vertex::Index> vertex_indexes
[all...] |
| cycle_breaker_unittest.cc | 40 for (Vertex& vertex : *graph) {
41 vertex.aop.op.set_type(InstallOperation::MOVE);
50 const Vertex::Index n_a = counter++;
51 const Vertex::Index n_b = counter++;
52 const Vertex::Index n_c = counter++;
53 const Vertex::Index n_d = counter++;
54 const Vertex::Index n_e = counter++;
55 const Vertex::Index n_f = counter++;
56 const Vertex::Index n_g = counter++
[all...] |
| graph_utils.cc | 50 void AddReadBeforeDep(Vertex* src,
51 Vertex::Index dst,
53 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst);
56 pair<Vertex::EdgeMap::iterator, bool> result =
64 void AddReadBeforeDepExtents(Vertex* src,
65 Vertex::Index dst,
79 void DropWriteBeforeDeps(Vertex::EdgeMap* edge_map) {
81 for (Vertex::EdgeMap::iterator it = edge_map->begin();
95 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index) {
113 void DumpOutEdges(const Vertex::EdgeMap& out_edges)
[all...] |
| cycle_breaker.cc | 48 // strong (-ly connected) component K with least vertex in subgraph
50 // We arbitrarily order each vertex by its index in the graph. Thus,
52 // and looking for the strongly connected component with vertex s.
74 // Calculate SCC (strongly connected component) with vertex i.
75 vector<Vertex::Index> component_indexes;
79 for (vector<Vertex::Index>::iterator it = component_indexes.begin();
82 for (vector<Vertex::Index>::iterator jt = component_indexes.begin();
109 static_cast<vector<Vertex::Index>::size_type>(2));
113 for (vector<Vertex::Index>::const_iterator it = stack_.begin();
133 void CycleBreaker::Unblock(Vertex::Index u)
[all...] |
| inplace_generator.cc | 89 // Compares the operations in the vertex a and b of graph_.
102 for (const Vertex& v : graph) {
108 Vertex* vertex,
113 ExpandExtents(vertex->aop.op.src_extents());
125 for (auto& edge_prop_pair : vertex->out_edges) {
134 vertex->aop.op.clear_src_extents();
136 StoreExtents(new_extents, vertex->aop.op.mutable_src_extents());
155 // create vertex to copy original->scratch
213 if (blocks[i].reader == Vertex::kInvalidIndex |
709 Vertex::Index vertex = existing_vertex; local
782 const Vertex& vertex = graph[vertex_index]; local
[all...] |
| /external/clang/test/CodeGenCXX/ |
| debug-info-template-array.cpp | 9 struct Vertex {};
13 unique_ptr<Vertex<2>[]> v = unique_ptr<Vertex<2>[]>();
|
| /external/swiftshader/src/Renderer/ |
| Triangle.hpp | 18 #include "Vertex.hpp"
24 Vertex V0;
25 Vertex V1;
26 Vertex V2;
|
| Primitive.hpp | 18 #include "Vertex.hpp"
25 Vertex v0;
26 Vertex v1;
27 Vertex v2;
|
| Vertex.hpp | 26 // Default vertex output semantics
62 ALIGN(16, struct Vertex
95 static_assert((sizeof(Vertex) & 0x0000000F) == 0, "Vertex size not a multiple of 16 bytes (alignment requirement)");
|
| /cts/tests/tests/opengl/src/android/opengl/cts/ |
| Vertex.java | 18 public class Vertex {
|
| /libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
| AdjacencyList.java | 37 * type <code>Vertex</code>. A <code>Vertex</code> describes one possible or
39 * <code>Certificate</code>. Specifically, a <code>Vertex</code> object
42 * <code>Vertex</code> doesn't continue the attempted build path.
65 * objects of type <code>Vertex</code>.
66 * A <code>BuildStep</code> contains a <code>Vertex</code> and a result code,
80 * @see sun.security.provider.certpath.Vertex
91 private List<List<Vertex>> mOrigList;
98 * <code>Vertex</code> objects
100 public AdjacencyList(List<List<Vertex>> list)
[all...] |
| /frameworks/base/libs/hwui/ |
| Vertex.h | 29 * Simple structure to describe a vertex with a position and a texture.
31 struct Vertex {
43 static inline void set(Vertex* vertex, float x, float y) {
44 vertex->x = x;
45 vertex->y = y;
48 static inline void set(Vertex* vertex, Vector2 val) {
49 set(vertex, val.x, val.y);
52 static inline void copyWithOffset(Vertex* vertex, const Vertex& src, float x, float y)
[all...] |
| PathTessellator.h | 22 #include "Vertex.h"
74 * vertex approximation, and correct AA ramp offsetting.
88 * vertex approximation, and correct AA ramp offsetting
102 * vertex approximation, and correct AA ramp offsetting
116 std::vector<Vertex> &outputVertices);
120 const PathApproximationInfo& approximationInfo, std::vector<Vertex> &outputVertices);
131 std::vector<Vertex> &outputVertices, int depth = 0);
143 std::vector<Vertex> &outputVertices, int depth = 0);
|
| PathTessellator.cpp | 39 #include "Vertex.h"
83 * Produces a pseudo-normal for a vertex, given the normals of the two incoming lines. If the offset
84 * from each vertex in a perimeter is calculated, the resultant lines connecting the offset vertices
173 bounds->outset(fabs(inverseScaleX) * (0.5f + Vertex::GeometryFudgeFactor()),
174 fabs(inverseScaleY) * (0.5f + Vertex::GeometryFudgeFactor()));
177 bounds->outset(halfStrokeWidth + fabs(inverseScaleX) * Vertex::GeometryFudgeFactor(),
178 halfStrokeWidth + fabs(inverseScaleY) * Vertex::GeometryFudgeFactor());
183 void getFillVerticesFromPerimeter(const std::vector<Vertex>& perimeter,
185 Vertex* buffer = vertexBuffer.alloc<Vertex>(perimeter.size())
[all...] |
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 27 * 6) Triangulate the monotone polygons directly into a vertex buffer (polys_to_triangles()).
39 * The vertex sorting in step (3) is a merge sort, since it plays well with the linked list
43 * sweep line has crossed the top vertex, but not the bottom vertex. It's sorted
45 * have been seen, so the "lower" top vertex of the two). If the top vertices are equal
47 * "upper" bottom vertex.
56 * neighbouring edges at the top or bottom vertex. This is handled by merging the
60 * the active edge list to the vertex before they occur (rewind() during merging,
95 struct Vertex;
137 * an individual Vertex from the path mesh may belong to multipl
[all...] |
