Home
last modified time | relevance | path

Searched refs:edge (Results 1 – 25 of 557) sorted by relevance

12345678910>>...23

/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 Dcfghooks.h91 edge (*redirect_edge_and_branch) (edge e, basic_block b);
96 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
119 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
133 basic_block (*split_edge) (edge);
134 void (*make_forwarder_block) (edge);
137 void (*tidy_fallthru_edge) (edge);
140 basic_block (*force_nonfallthru) (edge);
161 void (*execute_on_growing_pred) (edge);
165 void (*execute_on_shrinking_pred) (edge);
169 bool (*cfg_hook_duplicate_loop_to_header_edge) (class loop *, edge,
[all …]
H A Dipa-inline.h48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
73 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size() argument
77 || (entry = edge_growth_cache->get (edge)) == NULL in estimate_edge_size()
79 return do_estimate_edge_size (edge); in estimate_edge_size()
86 estimate_min_edge_growth (struct cgraph_edge *edge) in estimate_min_edge_growth() argument
88 ipa_call_summary *s = ipa_call_summaries->get (edge); in estimate_min_edge_growth()
89 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in estimate_min_edge_growth()
96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() argument
[all …]
H A Dcfgloopmanip.h35 extern edge mfb_kj_edge;
37 extern bool remove_path (edge, bool * = NULL, bitmap = NULL);
42 extern edge create_empty_if_region_on_edge (edge, tree);
43 extern class loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
45 extern class loop *loopify (edge, edge,
46 basic_block, edge, edge, bool,
54 extern bool duplicate_loop_to_header_edge (class loop *, edge,
55 unsigned, sbitmap, edge,
56 vec<edge> *, int);
57 extern bool mfb_keep_just (edge);
H A Dtree-cfg.h44 extern edge find_taken_edge (basic_block, tree);
59 extern bool assert_unreachable_fallthru_edge_p (edge);
69 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
70 extern basic_block split_edge_bb_loc (edge);
71 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
73 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
93 extern void remove_edge_and_dominated_blocks (edge);
104 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
106 extern edge find_taken_edge_switch_expr (const gswitch *switch_stmt, tree val);
113 edge *, edge *);
[all …]
H A Dpredict.h58 extern bool maybe_hot_edge_p (edge);
60 extern bool probably_never_executed_edge_p (struct function *, edge);
67 extern bool optimize_edge_for_size_p (edge);
68 extern bool optimize_edge_for_speed_p (edge);
75 extern bool predictable_edge_p (edge);
77 extern void rtl_profile_for_edge (edge);
84 extern void rtl_predict_edge (edge, enum br_predictor, int);
85 extern void gimple_predict_edge (edge, enum br_predictor, int);
86 extern void remove_predictions_associated_with_edge (edge);
87 extern void predict_edge_def (edge, enum br_predictor, enum prediction);
[all …]
H A Dtree-ssa.h34 extern void redirect_edge_var_map_add (edge, tree, tree, location_t);
35 extern void redirect_edge_var_map_clear (edge);
36 extern void redirect_edge_var_map_dup (edge, edge);
37 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge);
39 extern edge ssa_redirect_edge (edge, basic_block);
40 extern void flush_pending_stmts (edge);
H A Dcfg.h91 extern edge unchecked_make_edge (basic_block, basic_block, int);
92 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
93 extern edge make_edge (basic_block, basic_block, int);
94 extern edge make_single_succ_edge (basic_block, basic_block, int);
95 extern void remove_edge_raw (edge);
96 extern void redirect_edge_succ (edge, basic_block);
97 extern void redirect_edge_pred (edge, basic_block);
99 extern void dump_edge_info (FILE *, edge, dump_flags_t, int);
105 extern void alloc_aux_for_edge (edge, int);
113 extern void update_bb_profile_for_threading (basic_block, profile_count, edge);
/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 Dcfghooks.h91 edge (*redirect_edge_and_branch) (edge e, basic_block b);
96 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
119 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
133 basic_block (*split_edge) (edge);
134 void (*make_forwarder_block) (edge);
137 void (*tidy_fallthru_edge) (edge);
140 basic_block (*force_nonfallthru) (edge);
161 void (*execute_on_growing_pred) (edge);
165 void (*execute_on_shrinking_pred) (edge);
169 bool (*cfg_hook_duplicate_loop_to_header_edge) (class loop *, edge,
[all …]
H A Dipa-inline.h48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
73 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size() argument
77 || (entry = edge_growth_cache->get (edge)) == NULL in estimate_edge_size()
79 return do_estimate_edge_size (edge); in estimate_edge_size()
86 estimate_min_edge_growth (struct cgraph_edge *edge) in estimate_min_edge_growth() argument
88 ipa_call_summary *s = ipa_call_summaries->get (edge); in estimate_min_edge_growth()
89 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in estimate_min_edge_growth()
96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() argument
[all …]
H A Dcfgloopmanip.h35 extern edge mfb_kj_edge;
37 extern bool remove_path (edge, bool * = NULL, bitmap = NULL);
42 extern edge create_empty_if_region_on_edge (edge, tree);
43 extern class loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
45 extern class loop *loopify (edge, edge,
46 basic_block, edge, edge, bool,
54 extern bool duplicate_loop_to_header_edge (class loop *, edge,
55 unsigned, sbitmap, edge,
56 vec<edge> *, int);
57 extern bool mfb_keep_just (edge);
H A Dtree-cfg.h44 extern edge find_taken_edge (basic_block, tree);
59 extern bool assert_unreachable_fallthru_edge_p (edge);
69 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
70 extern basic_block split_edge_bb_loc (edge);
71 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
73 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
93 extern void remove_edge_and_dominated_blocks (edge);
104 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
106 extern edge find_taken_edge_switch_expr (const gswitch *switch_stmt, tree val);
113 edge *, edge *);
[all …]
H A Dpredict.h58 extern bool maybe_hot_edge_p (edge);
60 extern bool probably_never_executed_edge_p (struct function *, edge);
67 extern bool optimize_edge_for_size_p (edge);
68 extern bool optimize_edge_for_speed_p (edge);
75 extern bool predictable_edge_p (edge);
77 extern void rtl_profile_for_edge (edge);
84 extern void rtl_predict_edge (edge, enum br_predictor, int);
85 extern void gimple_predict_edge (edge, enum br_predictor, int);
86 extern void remove_predictions_associated_with_edge (edge);
87 extern void predict_edge_def (edge, enum br_predictor, enum prediction);
[all …]
H A Dtree-ssa.h34 extern void redirect_edge_var_map_add (edge, tree, tree, location_t);
35 extern void redirect_edge_var_map_clear (edge);
36 extern void redirect_edge_var_map_dup (edge, edge);
37 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge);
39 extern edge ssa_redirect_edge (edge, basic_block);
40 extern void flush_pending_stmts (edge);
H A Dcfg.h91 extern edge unchecked_make_edge (basic_block, basic_block, int);
92 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
93 extern edge make_edge (basic_block, basic_block, int);
94 extern edge make_single_succ_edge (basic_block, basic_block, int);
95 extern void remove_edge_raw (edge);
96 extern void redirect_edge_succ (edge, basic_block);
97 extern void redirect_edge_pred (edge, basic_block);
99 extern void dump_edge_info (FILE *, edge, dump_flags_t, int);
105 extern void alloc_aux_for_edge (edge, int);
113 extern void update_bb_profile_for_threading (basic_block, profile_count, edge);
/OK3568_Linux_fs/kernel/drivers/rpmsg/
H A Dqcom_smd.c163 struct qcom_smd_edge *edge; member
200 struct qcom_smd_edge *edge; member
372 struct qcom_smd_edge *edge = channel->edge; in qcom_smd_signal_channel() local
374 if (edge->mbox_chan) { in qcom_smd_signal_channel()
380 mbox_send_message(edge->mbox_chan, NULL); in qcom_smd_signal_channel()
381 mbox_client_txdone(edge->mbox_chan, 0); in qcom_smd_signal_channel()
383 regmap_write(edge->ipc_regmap, edge->ipc_offset, BIT(edge->ipc_bit)); in qcom_smd_signal_channel()
444 struct qcom_smd_edge *edge = channel->edge; in qcom_smd_channel_set_state() local
450 dev_dbg(&edge->dev, "set_state(%s, %d)\n", channel->name, state); in qcom_smd_channel_set_state()
644 struct qcom_smd_edge *edge = data; in qcom_smd_edge_intr() local
[all …]
/OK3568_Linux_fs/buildroot/toolchain/toolchain-external/toolchain-external-bootlin/
H A Dtoolchain-external-bootlin.hash3 …n.com/downloads/releases/toolchains/aarch64/tarballs/aarch64--glibc--bleeding-edge-2020.08-1.sha256
4 …3b0e2f902d055aecc2755eba10c0011927788a38faee8fc9aa aarch64--glibc--bleeding-edge-2020.08-1.tar.bz2
7 …in.com/downloads/releases/toolchains/aarch64/tarballs/aarch64--musl--bleeding-edge-2020.08-1.sha256
8 …d0fbc526529789791de1cf98b918ff812e779f8400d40b6c048 aarch64--musl--bleeding-edge-2020.08-1.tar.bz2
11 ….com/downloads/releases/toolchains/aarch64/tarballs/aarch64--uclibc--bleeding-edge-2020.08-1.sha256
12 …35dd09d9a016a1d6d9d7bb0e96ffcc5565e0aa483a46ea3db aarch64--uclibc--bleeding-edge-2020.08-1.tar.bz2
15 …m/downloads/releases/toolchains/aarch64be/tarballs/aarch64be--glibc--bleeding-edge-2020.08-1.sha256
16 …7bb82bdd79d7647ccabe193126cc59ff9721a573d8870510 aarch64be--glibc--bleeding-edge-2020.08-1.tar.bz2
19 …/downloads/releases/toolchains/aarch64be/tarballs/aarch64be--uclibc--bleeding-edge-2020.08-1.sha256
20 …9b5d18943398e51ae1c36d075cf8fba90ea050a29cad747 aarch64be--uclibc--bleeding-edge-2020.08-1.tar.bz2
[all …]
H A Dtoolchain-external-bootlin.mk11 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = aarch64--glibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_VERS…
23 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = aarch64--musl--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_VERSI…
35 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = aarch64--uclibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_VER…
47 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = aarch64be--glibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_VE…
59 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = aarch64be--uclibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_V…
71 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = arcle-750d--uclibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_…
83 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = arcle-hs38--glibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_V…
95 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = arcle-hs38--uclibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_…
107 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = armv5-eabi--glibc--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_V…
119 TOOLCHAIN_EXTERNAL_BOOTLIN_SOURCE = armv5-eabi--musl--bleeding-edge-$(TOOLCHAIN_EXTERNAL_BOOTLIN_VE…
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dedge.hpp26 struct edge { struct
31 edge(edge<T>&& e) noexcept : bot(std::move(e.bot)), top(std::move(e.top)), dx(std::move(e.dx)) { in edge() function
34 edge& operator=(edge<T>&& e) noexcept { in operator =() argument
42 edge(mapbox::geometry::point<T2> const& current, in edge() argument
62 using edge_ptr = edge<T>*;
65 using edge_list = std::vector<edge<T>>;
71 bool slopes_equal(edge<T> const& e1, edge<T> const& e2) { in slopes_equal()
77 inline bool is_horizontal(edge<T> const& e) { in is_horizontal()
82 inline double get_current_x(edge<T> const& edge, const T current_y) { in get_current_x() argument
83 if (current_y == edge.top.y) { in get_current_x()
[all …]
H A Dlocal_minimum_util.hpp17 inline void reverse_horizontal(edge<T>& e) { in reverse_horizontal()
35 auto edge = edges.begin(); in start_list_on_local_maximum() local
39 while (edge != edges.end()) { in start_list_on_local_maximum()
40 edge_is_horizontal = is_horizontal(*edge); in start_list_on_local_maximum()
41 if ((!prev_edge_is_horizontal && !edge_is_horizontal && edge->top == prev_edge->top)) { in start_list_on_local_maximum()
46 (edge->top == prev_edge->bot || edge->top == prev_edge->top)) { in start_list_on_local_maximum()
51 (prev_edge->top == edge->top || prev_edge->top == edge->bot)) { in start_list_on_local_maximum()
55 prev_edge = edge; in start_list_on_local_maximum()
56 ++edge; in start_list_on_local_maximum()
58 std::rotate(edges.begin(), edge, edges.end()); in start_list_on_local_maximum()
[all …]
H A Dring_util.hpp103 inline T get_edge_min_x(edge<T> const& edge, const T current_y) { in get_edge_min_x() argument
104 if (is_horizontal(edge)) { in get_edge_min_x()
105 if (edge.bot.x < edge.top.x) { in get_edge_min_x()
106 return edge.bot.x; in get_edge_min_x()
108 return edge.top.x; in get_edge_min_x()
110 } else if (edge.dx > 0.0) { in get_edge_min_x()
111 if (current_y == edge.top.y) { in get_edge_min_x()
112 return edge.top.x; in get_edge_min_x()
114 double lower_range_y = static_cast<double>(current_y - edge.bot.y) - 0.5; in get_edge_min_x()
115 double return_val = static_cast<double>(edge.bot.x) + edge.dx * lower_range_y; in get_edge_min_x()
[all …]
/OK3568_Linux_fs/kernel/drivers/media/rc/
H A Dgpio-ir-tx.c73 ktime_t edge; in gpio_ir_tx_unmodulated() local
78 edge = ktime_get(); in gpio_ir_tx_unmodulated()
83 edge = ktime_add_us(edge, txbuf[i]); in gpio_ir_tx_unmodulated()
84 delay_until(edge); in gpio_ir_tx_unmodulated()
93 ktime_t edge; in gpio_ir_tx_modulated() local
110 edge = ktime_get(); in gpio_ir_tx_modulated()
115 edge = ktime_add_us(edge, txbuf[i]); in gpio_ir_tx_modulated()
116 delay_until(edge); in gpio_ir_tx_modulated()
119 ktime_t last = ktime_add_us(edge, txbuf[i]); in gpio_ir_tx_modulated()
123 edge = ktime_add_ns(edge, pulse); in gpio_ir_tx_modulated()
[all …]
/OK3568_Linux_fs/external/xserver/mi/
H A Dmifillarc.c129 miGetArcEdge(xArc * arc, miSliceEdgePtr edge, int k, Bool top, Bool left) in miGetArcEdge() argument
141 xady = k + y * edge->dx; in miGetArcEdge()
143 edge->x = -((-xady) / edge->dy + 1); in miGetArcEdge()
145 edge->x = (xady - 1) / edge->dy; in miGetArcEdge()
146 edge->e = xady - edge->x * edge->dy; in miGetArcEdge()
147 if ((top && (edge->dx < 0)) || (!top && (edge->dx > 0))) in miGetArcEdge()
148 edge->e = edge->dy - edge->e + 1; in miGetArcEdge()
150 edge->x++; in miGetArcEdge()
151 edge->x += arc->x + (arc->width >> 1); in miGetArcEdge()
152 if (edge->dx > 0) { in miGetArcEdge()
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/sweep/
H A Dsweep.cpp92 void Sweep::EdgeEvent(SweepContext& tcx, Edge* edge, Node* node) in EdgeEvent() argument
94 tcx.edge_event.constrained_edge = edge; in EdgeEvent()
95 tcx.edge_event.right = (edge->p->x > edge->q->x); in EdgeEvent()
97 if (IsEdgeSideOfTriangle(*node->triangle, *edge->p, *edge->q)) { in EdgeEvent()
104 FillEdgeEvent(tcx, edge, node); in EdgeEvent()
105 EdgeEvent(tcx, *edge->p, *edge->q, node->triangle, *edge->q); in EdgeEvent()
566 void Sweep::FillEdgeEvent(SweepContext& tcx, Edge* edge, Node* node) in FillEdgeEvent() argument
569 FillRightAboveEdgeEvent(tcx, edge, node); in FillEdgeEvent()
571 FillLeftAboveEdgeEvent(tcx, edge, node); in FillEdgeEvent()
575 void Sweep::FillRightAboveEdgeEvent(SweepContext& tcx, Edge* edge, Node* node) in FillRightAboveEdgeEvent() argument
[all …]
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/stitching/detail/
H A Dutil_inl.hpp60 std::list<GraphEdge>::const_iterator edge = edges_[i].begin(); in forEach() local
61 for (; edge != edges_[i].end(); ++edge) in forEach()
62 body(*edge); in forEach()
82 std::list<GraphEdge>::const_iterator edge = edges_[vertex].begin(); in walkBreadthFirst() local
83 for (; edge != edges_[vertex].end(); ++edge) in walkBreadthFirst()
85 if (!was[edge->to]) in walkBreadthFirst()
87 body(*edge); in walkBreadthFirst()
88 was[edge->to] = true; in walkBreadthFirst()
89 vertices.push(edge->to); in walkBreadthFirst()
/OK3568_Linux_fs/external/xserver/hw/xfree86/common/
H A Dxf86Cursor.c329 FindEdge(xf86EdgePtr edge, int val) in FindEdge() argument
331 while (edge && (edge->end <= val)) in FindEdge()
332 edge = edge->next; in FindEdge()
334 if (edge && (edge->start <= val)) in FindEdge()
335 return edge; in FindEdge()
348 xf86EdgePtr edge; in xf86CursorOffScreen() local
361 if ((edge = xf86ScreenLayout[(*pScreen)->myNum].left)) in xf86CursorOffScreen()
362 edge = FindEdge(edge, tmp); in xf86CursorOffScreen()
364 if (!edge) in xf86CursorOffScreen()
367 *x += edge->offset.x; in xf86CursorOffScreen()
[all …]

12345678910>>...23