/dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
H A D | ipa-inline-transform.c | 246 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 277 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 287 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 327 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
H A D | ipa-inline-transform.c | 246 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 277 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 287 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 327 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/lang/gcc10/gcc-10.3.0/gcc/ |
H A D | ipa-inline-transform.c | 246 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 277 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 287 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 327 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/math/chaco/Chaco-2.2/code/connect/ |
H A D | connected.c | 20 struct edgeslist *new_edges;/* list of edges connecting graph */ local 69 struct edgeslist *new_edges;/* list of edges connecting graph */ local
|
H A D | add_edges.c | 10 void add_edges(graph, new_edges, old_edges, old_ewgts, using_ewgts) in add_edges() argument
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
H A D | ipa-inline-transform.c | 255 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 286 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 296 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 336 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
H A D | ipa-inline-transform.c | 255 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 286 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 296 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 336 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/ |
H A D | ipa-inline-transform.c | 255 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 286 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 296 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 336 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
H A D | ipa-inline-transform.c | 255 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() 286 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() 296 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() 336 vec<cgraph_edge *> *new_edges, in inline_call()
|
/dports/databases/postgis30/postgis-3.0.4/deps/wagyu/include/mapbox/geometry/wagyu/ |
H A D | build_local_minima_list.hpp | 16 edge_list<T1> new_edges; in add_linear_ring() local
|
/dports/databases/postgis31/postgis-3.1.4/deps/wagyu/include/mapbox/geometry/wagyu/ |
H A D | build_local_minima_list.hpp | 16 edge_list<T1> new_edges; in add_linear_ring() local
|
/dports/databases/postgis32/postgis-3.2.0/deps/wagyu/include/mapbox/geometry/wagyu/ |
H A D | build_local_minima_list.hpp | 16 edge_list<T1> new_edges; in add_linear_ring() local
|
/dports/devel/spark/spark-2.1.1/examples/src/main/python/ |
H A D | transitive_closure.py | 66 new_edges = tc.join(edges).map(lambda __a_b: (__a_b[1][1], __a_b[1][0])) variable
|
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/ |
H A D | add_edges_w_string.R | 145 create_edge_df(
|
H A D | add_node.R | 276 create_edge_df(
|
/dports/graphics/R-cran-s2/s2/src/s2/ |
H A D | s2builderutil_lax_polygon_layer.cc | 116 vector<Edge>* new_edges, in DiscardEdges() 145 vector<Edge> new_edges; in BuildDirected() local
|
/dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
H A D | s2builderutil_lax_polygon_layer.cc | 116 vector<Edge>* new_edges, in DiscardEdges() 145 vector<Edge> new_edges; in BuildDirected() local
|
/dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
H A D | s2builderutil_lax_polygon_layer.cc | 116 vector<Edge>* new_edges, in DiscardEdges() 145 vector<Edge> new_edges; in BuildDirected() local
|
/dports/math/igraph/igraph-0.9.5/src/games/ |
H A D | barabasi.c | 76 long int bagsize, start_nodes, start_edges, new_edges, no_of_edges; in igraph_i_barabasi_game_bag() local 189 long int start_nodes, start_edges, new_edges, no_of_edges; in igraph_i_barabasi_game_psumtree_multiple() local 296 long int start_nodes, start_edges, new_edges, no_of_edges; in igraph_i_barabasi_game_psumtree() local
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/CIPLabeler/configs/ |
H A D | Configuration.cpp | 46 std::vector<Edge *> new_edges; in removeInternalEdges() local
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
H A D | mesh_validate.cc | 137 MutableSpan<MEdge> new_edges, in serialize_and_initialize_deduplicated_edges() 253 MutableSpan<MEdge> new_edges{ in BKE_mesh_calc_edges() local
|
/dports/graphics/gegl/gegl-0.4.34/subprojects/poly2tri-c/poly2tri-c/refine/ |
H A D | cdt.c | 83 P2trVEdgeSet *new_edges = p2tr_vedge_set_new (); in p2tr_cdt_new() local 450 GList *fan = NULL, *new_edges = NULL; in p2tr_cdt_split_edge() local
|
/dports/lang/gcc48/gcc-4.8.5/gcc/ |
H A D | ipa-inline-transform.c | 202 vec<cgraph_edge_p> *new_edges, in inline_call()
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
H A D | ipa-inline-transform.c | 202 vec<cgraph_edge_p> *new_edges, in inline_call()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
H A D | ipa-inline-transform.c | 224 vec<cgraph_edge_p> *new_edges, in inline_call()
|