| /kernel/linux/linux-5.10/tools/bpf/bpftool/ |
| H A D | cfg.c | 256 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge() function
284 e = new_edge(bb, bb_next(bb), EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
290 e = new_edge(bb_prev(bb), bb, EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
298 e = new_edge(bb, NULL, EDGE_FLAG_EMPTY); in func_add_bb_edges()
322 e = new_edge(bb, NULL, EDGE_FLAG_JUMP); in func_add_bb_edges()
|
| /kernel/linux/linux-6.6/tools/bpf/bpftool/ |
| H A D | cfg.c | 256 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge() function
284 e = new_edge(bb, bb_next(bb), EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
290 e = new_edge(bb_prev(bb), bb, EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
298 e = new_edge(bb, NULL, EDGE_FLAG_EMPTY); in func_add_bb_edges()
322 e = new_edge(bb, NULL, EDGE_FLAG_JUMP); in func_add_bb_edges()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| H A D | graphcycles_test.cc | 254 Edge new_edge; in TEST() local
255 new_edge.from = nodes[from]; in TEST()
256 new_edge.to = nodes[to]; in TEST()
257 edges.push_back(new_edge); in TEST()
|
| /third_party/mesa3d/src/gallium/auxiliary/draw/ |
| H A D | draw_pipe_clip.c | 458 boolean *new_edge; in do_clip_tri() local
469 new_edge = &outEdges[outcount]; in do_clip_tri()
491 *new_edge = TRUE; in do_clip_tri()
496 *new_edge = *edge_prev; in do_clip_tri()
514 *new_edge = *edge_prev; in do_clip_tri()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | relocation.c | 545 struct btrfs_backref_edge *new_edge; in clone_backref_node() local
585 new_edge = btrfs_backref_alloc_edge(cache); in clone_backref_node()
586 if (!new_edge) in clone_backref_node()
589 btrfs_backref_link_edge(new_edge, edge->node[LOWER], in clone_backref_node()
602 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
603 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
604 &new_edge->node[LOWER]->upper); in clone_backref_node()
610 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
612 list_del(&new_edge->list[UPPER]); in clone_backref_node()
613 btrfs_backref_free_edge(cache, new_edge); in clone_backref_node()
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | relocation.c | 558 struct btrfs_backref_edge *new_edge; in clone_backref_node() local
598 new_edge = btrfs_backref_alloc_edge(cache); in clone_backref_node()
599 if (!new_edge) in clone_backref_node()
602 btrfs_backref_link_edge(new_edge, edge->node[LOWER], in clone_backref_node()
615 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
616 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
617 &new_edge->node[LOWER]->upper); in clone_backref_node()
623 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
625 list_del(&new_edge->list[UPPER]); in clone_backref_node()
626 btrfs_backref_free_edge(cache, new_edge); in clone_backref_node()
[all...] |
| /third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/ |
| H A D | esextcTessellationShaderVertexSpacing.cpp | 195 _tess_edge new_edge(run.outer[1], run.outer[1], 1.0f); in getEdgesForIsolinesTessellation()
197 new_edge.points.push_back(new_item); in getEdgesForIsolinesTessellation()
199 result.push_back(new_edge); in getEdgesForIsolinesTessellation()
|
| /third_party/rust/crates/memchr/bench/data/code/ |
| H A D | rust-library.rs | 29648 let common_edge = unsafe { Handle::new_edge(self, lower_edge_idx) }; in search_tree_for_bifurcation()
29674 let edge = unsafe { Handle::new_edge(self, edge_idx) }; in find_lower_bound_edge()
29688 let edge = unsafe { Handle::new_edge(self, edge_idx) }; in find_upper_bound_edge()
29708 IndexResult::Edge(idx) => GoDown(unsafe { Handle::new_edge(self, idx) }), in search_node()
33810 let mut lower_edge = unsafe { Handle::new_edge(ptr::read(&node), lower_edge_idx) }; in find_leaf_edges_spanning_range()
33811 let mut upper_edge = unsafe { Handle::new_edge(node, upper_edge_idx) }; in find_leaf_edges_spanning_range()
38707 pub unsafe fn new_edge(node: NodeRef<BorrowType, K, V, NodeType>, idx: usize) -> Self { new_edge() functions
[all...] |