Home
last modified time | relevance | path

Searched refs:edge_list (Results 1 – 16 of 16) sorted by relevance

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dcfganal.h26 struct edge_list struct
54 struct edge_list * create_edge_list (void);
55 void free_edge_list (struct edge_list *);
56 void print_edge_list (FILE *, struct edge_list *);
57 void verify_edge_list (FILE *, struct edge_list *);
59 int find_edge_index (struct edge_list *, basic_block, basic_block);
H A Dlcm.h23 extern struct edge_list *pre_edge_lcm_avs (int, sbitmap *, sbitmap *,
26 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *,
30 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dcfganal.h26 struct edge_list struct
54 struct edge_list * create_edge_list (void);
55 void free_edge_list (struct edge_list *);
56 void print_edge_list (FILE *, struct edge_list *);
57 void verify_edge_list (FILE *, struct edge_list *);
59 int find_edge_index (struct edge_list *, basic_block, basic_block);
H A Dlcm.h23 extern struct edge_list *pre_edge_lcm_avs (int, sbitmap *, sbitmap *,
26 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *,
30 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dedge.hpp65 using edge_list = std::vector<edge<T>>; typedef
68 using edge_list_itr = typename edge_list<T>::iterator;
104 edge_list<T> const& edges) { in operator <<()
H A Dlocal_minimum_util.hpp27 void start_list_on_local_maximum(edge_list<T>& edges) { in start_list_on_local_maximum()
62 bound<T> create_bound_towards_minimum(edge_list<T>& edges) { in create_bound_towards_minimum()
116 bound<T> create_bound_towards_maximum(edge_list<T>& edges) { in create_bound_towards_maximum()
204 void add_ring_to_local_minima_list(edge_list<T>& edges, in add_ring_to_local_minima_list()
H A Dbuild_local_minima_list.hpp16 edge_list<T1> new_edges; in add_linear_ring()
H A Dbound.hpp22 edge_list<T> edges;
H A Dbuild_edges.hpp29 bool build_edge_list(mapbox::geometry::linear_ring<T2> const& path_geometry, edge_list<T1>& edges) { in build_edge_list()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/sweep/
H A Dsweep_context.cpp108 edge_list.push_back(new Edge(*polyline[i], *polyline[j])); in InitEdges()
210 for (unsigned int i = 0; i < edge_list.size(); i++) { in ~SweepContext()
211 delete edge_list[i]; in ~SweepContext()
H A Dsweep_context.h97 std::vector<Edge*> edge_list; variable
H A Dsweep.cpp56 for (unsigned int i = 0; i < point.edge_list.size(); i++) { in SweepPoints()
57 EdgeEvent(tcx, point.edge_list[i], node); in SweepPoints()
/OK3568_Linux_fs/kernel/drivers/interconnect/
H A Dcore.c183 struct list_head edge_list; in path_find() local
189 INIT_LIST_HEAD(&edge_list); in path_find()
199 list_splice_init(&edge_list, &visited_list); in path_find()
216 list_add_tail(&tmp->search_list, &edge_list); in path_find()
224 list_splice_init(&edge_list, &traverse_list); in path_find()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/common/
H A Dshapes.h57 std::vector<Edge*> edge_list; member
143 q->edge_list.push_back(this); in Edge()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/
H A Dgtype.state23024 (!type struct 1392 nil gc_unused "edge_list"nil
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/
H A Dgtype.state23058 (!type struct 1394 nil gc_unused "edge_list"nil