Home
last modified time | relevance | path

Searched refs:edge_node (Results 1 – 25 of 130) sorted by relevance

123456

/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/tools/partitioner/
H A Dhecmw_mesh_hash_sort.c115 edge_node = in HECMW_mesh_hsort_edge_init()
117 if (edge_node == NULL) { in HECMW_mesh_hsort_edge_init()
121 edge_node->node1 = NULL; in HECMW_mesh_hsort_edge_init()
122 edge_node->node2 = NULL; in HECMW_mesh_hsort_edge_init()
125 if (edge_node->node1 == NULL) { in HECMW_mesh_hsort_edge_init()
305 edge_node->node1 = in HECMW_mesh_hsort_edge_realloc()
311 edge_node->node2 = in HECMW_mesh_hsort_edge_realloc()
503 if (edge_node) { in HECMW_mesh_hsort_edge_final()
507 HECMW_free(edge_node); in HECMW_mesh_hsort_edge_final()
510 edge_node = NULL; in HECMW_mesh_hsort_edge_final()
[all …]
/dports/net/olsrd/olsrd-0.9.8/src/
H A Dolsr_spf.c195 struct avl_node *edge_node; in olsr_spf_relax() local
210 …for (edge_node = avl_walk_first(&tc->edge_tree); edge_node; edge_node = avl_walk_next(edge_node)) { in olsr_spf_relax()
213 struct tc_edge_entry *tc_edge = edge_tree2tc_edge(edge_node); in olsr_spf_relax()
H A Dtc_set.c452 tc_edge->edge_node.key = &tc_edge->T_dest_addr; in olsr_add_tc_edge_entry()
457 avl_insert(&tc->edge_tree, &tc_edge->edge_node, AVL_DUP_NO); in olsr_add_tc_edge_entry()
518 avl_delete(&tc->edge_tree, &tc_edge->edge_node); in olsr_delete_tc_edge_entry()
683 struct avl_node *edge_node; in olsr_lookup_tc_edge() local
685 edge_node = avl_find(&tc->edge_tree, edge_addr); in olsr_lookup_tc_edge()
687 return (edge_node ? edge_tree2tc_edge(edge_node) : NULL); in olsr_lookup_tc_edge()
H A Dtc_set.h63 struct avl_node edge_node; /* edge_tree node in tc_entry */ member
72 AVLNODE2STRUCT(edge_tree2tc_edge, struct tc_edge_entry, edge_node);
/dports/math/libmesh/libmesh-1.6.2/src/geom/
H A Dcell_pyramid.C102 unsigned int edge_node) const in local_edge_node() argument
105 libmesh_assert_less(edge_node, Pyramid5::nodes_per_edge); in local_edge_node()
107 return Pyramid5::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dcell_inf_hex16.C165 unsigned int edge_node) const in local_edge_node() argument
170 libmesh_assert_less (edge_node, InfHex16::nodes_per_edge); in local_edge_node()
173 libmesh_assert(edge < 4 || edge_node < 2); in local_edge_node()
175 return InfHex16::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dcell_prism.C107 unsigned int edge_node) const in local_edge_node() argument
110 libmesh_assert_less(edge_node, Prism6::nodes_per_edge); in local_edge_node()
112 return Prism6::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dcell_tet.C77 unsigned int edge_node) const in local_edge_node() argument
80 libmesh_assert_less (edge_node, Tet4::nodes_per_edge); in local_edge_node()
82 return Tet4::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dcell_inf_prism12.C159 unsigned int edge_node) const in local_edge_node() argument
164 libmesh_assert_less(edge_node, InfPrism12::nodes_per_edge); in local_edge_node()
167 libmesh_assert(edge < 3 || edge_node < 2); in local_edge_node()
169 return InfPrism12::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dcell_inf_prism.C104 unsigned int edge_node) const in local_edge_node() argument
107 libmesh_assert_less(edge_node, InfPrism6::nodes_per_edge); in local_edge_node()
109 return InfPrism6::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dcell_inf_hex18.C186 unsigned int edge_node) const in local_edge_node() argument
191 libmesh_assert_less (edge_node, InfHex18::nodes_per_edge); in local_edge_node()
194 libmesh_assert(edge < 4 || edge_node < 2); in local_edge_node()
196 return InfHex18::edge_nodes_map[edge][edge_node]; in local_edge_node()
H A Dface_inf_quad.C76 unsigned int edge_node) const in local_edge_node() argument
78 return local_side_node(edge, edge_node); in local_edge_node()
H A Dcell_inf_hex.C102 unsigned int edge_node) const in local_edge_node() argument
105 libmesh_assert_less (edge_node, InfHex8::nodes_per_edge); in local_edge_node()
107 return InfHex8::edge_nodes_map[edge][edge_node]; in local_edge_node()
/dports/multimedia/v4l_compat/linux-5.13-rc2/tools/bpf/bpftool/
H A Dcfg.c38 struct edge_node { struct
256 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge()
259 struct edge_node *e; in new_edge()
280 struct edge_node *e; in func_add_bb_edges()
362 struct edge_node *e, *e2; in cfg_destroy()
419 struct edge_node *e; in draw_bb_succ_edges()
/dports/multimedia/libv4l/linux-5.13-rc2/tools/bpf/bpftool/
H A Dcfg.c38 struct edge_node { struct
256 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge()
259 struct edge_node *e; in new_edge()
280 struct edge_node *e; in func_add_bb_edges()
362 struct edge_node *e, *e2; in cfg_destroy()
419 struct edge_node *e; in draw_bb_succ_edges()
/dports/multimedia/v4l-utils/linux-5.13-rc2/tools/bpf/bpftool/
H A Dcfg.c38 struct edge_node { struct
256 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge()
259 struct edge_node *e; in new_edge()
280 struct edge_node *e; in func_add_bb_edges()
362 struct edge_node *e, *e2; in cfg_destroy()
419 struct edge_node *e; in draw_bb_succ_edges()
/dports/graphics/libQGLViewer/libQGLViewer-2.7.2/QGLViewer/VRender/
H A Dgpc.cpp217 class edge_node class
220 edge_node() in edge_node() function in edge_node
334 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
336 edge_node *existing_bound; in insert_bound()
381 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
489 edge_node *e, *edge_table; in build_lmt()
495 MALLOC(edge_table, total_vertices * sizeof(edge_node), "edge table creation", edge_node); in build_lmt()
497 edge_table[k] = edge_node() ; in build_lmt()
628 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
677 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
[all …]
/dports/math/octomap/octomap-1.9.7/octovis/src/extern/QGLViewer/VRender/
H A Dgpc.cpp217 class edge_node class
220 edge_node() in edge_node() function in edge_node
334 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
336 edge_node *existing_bound; in insert_bound()
381 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
489 edge_node *e, *edge_table; in build_lmt()
495 MALLOC(edge_table, total_vertices * sizeof(edge_node), "edge table creation", edge_node); in build_lmt()
497 edge_table[k] = edge_node() ; in build_lmt()
628 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
677 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
[all …]
/dports/devel/hyperscan/hyperscan-5.4.0/src/util/
H A Due2_graph.h204 using edge_node = typename Graph::edge_node; variable
207 explicit edge_descriptor(edge_node *pp) : p(pp), serial(pp->serial) {} in edge_descriptor()
235 edge_node *raw(void) { return p; } in raw()
236 edge_node *p;
262 struct edge_node : public out_edge_hook, public in_edge_hook { struct
263 explicit edge_node(u64a serial_in) : serial(serial_in) { } in edge_node() argument
275 = boost::intrusive::list<edge_node, argument
308 void operator()(edge_node *e) const { in operator()
317 void operator()(edge_node *e) const { in operator()
404 return edge_descriptor(const_cast<edge_node *>(&*super::base()));
[all …]
/dports/math/R-cran-gpclib/gpclib/src/
H A Dgpc.c188 } edge_node; typedef
278 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
280 edge_node *existing_bound; in insert_bound()
325 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
433 edge_node *e, *edge_table; in build_lmt()
439 MALLOC(edge_table, total_vertices * sizeof(edge_node), in build_lmt()
440 "edge table creation", edge_node); in build_lmt()
571 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
620 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
708 edge_node *edge; in build_intersection_table()
[all …]
/dports/science/PETSc/petsc-3.14.1/src/ksp/pc/impls/tfs/
H A Dcomm.c30 static PetscInt edge_node[sizeof(PetscInt)*32]; variable
43 PCTFS_ivec_zero((PetscInt*)edge_node,sizeof(PetscInt)*32); in PCTFS_comm_init()
48 edge_node[PCTFS_i_log2_num_nodes] = PCTFS_my_id ^ PCTFS_floor_num_nodes; in PCTFS_comm_init()
299 dest = edge_node[edge]; in PCTFS_ssgl_radd()
315 dest = edge_node[level-edge-1]; in PCTFS_ssgl_radd()
/dports/math/p5-Math-Geometry-Planar-GPC-PolygonXS/Math-Geometry-Planar-GPC-PolygonXS-0.052/
H A Dgpc.c187 } edge_node; typedef
277 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
279 edge_node *existing_bound; in insert_bound()
324 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
432 edge_node *e, *edge_table; in build_lmt()
438 MALLOC(edge_table, total_vertices * sizeof(edge_node), in build_lmt()
439 "edge table creation", edge_node); in build_lmt()
570 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
619 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
707 edge_node *edge; in build_intersection_table()
[all …]
/dports/graphics/agg/agg-2.5/gpc/
H A Dgpc.c186 } edge_node; typedef
276 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
278 edge_node *existing_bound; in insert_bound()
323 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
431 edge_node *e, *edge_table; in build_lmt()
437 MALLOC(edge_table, total_vertices * sizeof(edge_node), in build_lmt()
438 "edge table creation", edge_node); in build_lmt()
569 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
618 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
706 edge_node *edge; in build_intersection_table()
[all …]
/dports/devel/libgpc/gpc232/
H A Dgpc.c187 } edge_node; typedef
277 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
279 edge_node *existing_bound; in insert_bound()
324 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
432 edge_node *e, *edge_table; in build_lmt()
438 MALLOC(edge_table, total_vertices * sizeof(edge_node), in build_lmt()
439 "edge table creation", edge_node); in build_lmt()
570 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
619 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
707 edge_node *edge; in build_intersection_table()
[all …]
/dports/misc/vxl/vxl-3.3.2/core/vgl/internals/
H A Dgpc.c175 } edge_node; typedef
265 static void insert_bound(edge_node **b, edge_node *e) in insert_bound()
267 edge_node *existing_bound; in insert_bound()
312 static edge_node **bound_list(lmt_node **lmt, double y) in bound_list()
420 edge_node *e, *edge_table; in build_lmt()
426 MALLOC(edge_table, total_vertices * sizeof(edge_node), in build_lmt()
427 "edge table creation", edge_node); in build_lmt()
558 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) in add_edge_to_aet()
607 static void add_intersection(it_node **it, edge_node *edge0, edge_node *edge1, in add_intersection()
695 edge_node *edge; in build_intersection_table()
[all …]

123456