Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 7 of 7) sorted by relevance

/system/core/libpixelflinger/
Dtrap.cpp650 triangle_dump_edges( Edge* edges, in triangle_dump_edges() argument
654 for ( ; count > 0; count--, edges++ ) in triangle_dump_edges()
655 edge_dump( edges ); in triangle_dump_edges()
663 Edge* edges, in edge_setup() argument
672 Edge* edge = edges + *pcount; in edge_setup()
765 Edge edges[3]; in trianglex_big() local
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax ); in trianglex_big()
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax ); in trianglex_big()
772 edge_setup( edges, &num_edges, v1, v2, ymin, ymax ); in trianglex_big()
777 Edge* left = &edges[0]; in trianglex_big()
[all …]
/system/update_engine/payload_generator/
Dinplace_generator.h94 const std::set<Edge>& edges,
Dinplace_generator.cc140 const set<Edge>& edges, in CutEdges() argument
144 cuts.reserve(edges.size()); in CutEdges()
147 for (const Edge& edge : edges) { in CutEdges()
/system/media/audio_utils/
DDoxyfile2259 # root by following a path via at most 3 edges will be shown. Nodes that lay
2274 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
DDoxyfile.orig2259 # root by following a path via at most 3 edges will be shown. Nodes that lay
2274 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
/system/chre/pal/doc/
DDoxyfile2362 # root by following a path via at most 3 edges will be shown. Nodes that lay
2377 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
/system/chre/chre_api/doc/
DDoxyfile2362 # root by following a path via at most 3 edges will be shown. Nodes that lay
2377 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to