Home
last modified time | relevance | path

Searched full:edge (Results 1 – 25 of 2130) sorted by relevance

12345678910>>...86

/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.h87 /* Redirect edge E to the given basic block B and update underlying program
88 representation. Returns edge representing redirected branch (that may not
90 if edge is not easily redirectable for whatever reason. */
91 edge (*redirect_edge_and_branch) (edge e, basic_block b);
94 newly created forwarder basic block is returned. The edge must
96 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
98 /* Returns true if it is possible to remove the edge by redirecting it
99 to the destination of the other edge going from its source. */
118 /* Predict edge E using PREDICTOR to given PROBABILITY. */
119 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
[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);
70 /* Return estimated size of the inline sequence of 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()
83 /* Return lower bound on estimated callee growth after inlining EDGE. */
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()
[all …]
H A Dbasic-block.h25 /* Control flow edge information. */
28 /* The two blocks at the ends of the edge. */ in class()
32 /* Instructions queued on the edge. */ in class()
41 /* Location of any goto implicit in the edge. */ in class()
44 /* The index number corresponding to this edge in the edge vector in class()
51 /* Return count of edge E. */ in class()
55 /* Masks for edge.flags. */
63 /* Bit mask for all edge flags. */
66 /* The following four flags all indicate something special about an edge.
67 Test the edge flags on EDGE_COMPLEX to detect all forms of "strange"
[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.h24 /* Location to track pending stmt for edge insertion. */
44 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);
[all …]
H A Dcfg-flags.def100 /* Masks for edge.flags.
103 NAME is the name of the edge flag. A flag EDGE_#NAME will be
114 this means that the edge cannot be split. */
117 /* Edge out of a basic block that ends with a CALL_INSN with abnormal
123 /* Exception edge. Exception handling edges represent possible control
128 /* Never merge blocks via this edge. This is used for exception handling,
133 /* Not a real edge. This is used to connect parts of the CFG that do
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
139 are hints that this edge may be part of a loop in the CFG. */
142 /* Edge in a part of the CFG that is an irreducible loop. */
[all …]
/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.h87 /* Redirect edge E to the given basic block B and update underlying program
88 representation. Returns edge representing redirected branch (that may not
90 if edge is not easily redirectable for whatever reason. */
91 edge (*redirect_edge_and_branch) (edge e, basic_block b);
94 newly created forwarder basic block is returned. The edge must
96 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
98 /* Returns true if it is possible to remove the edge by redirecting it
99 to the destination of the other edge going from its source. */
118 /* Predict edge E using PREDICTOR to given PROBABILITY. */
119 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
[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);
70 /* Return estimated size of the inline sequence of 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()
83 /* Return lower bound on estimated callee growth after inlining EDGE. */
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()
[all …]
H A Dbasic-block.h25 /* Control flow edge information. */
28 /* The two blocks at the ends of the edge. */ in class()
32 /* Instructions queued on the edge. */ in class()
41 /* Location of any goto implicit in the edge. */ in class()
44 /* The index number corresponding to this edge in the edge vector in class()
51 /* Return count of edge E. */ in class()
55 /* Masks for edge.flags. */
63 /* Bit mask for all edge flags. */
66 /* The following four flags all indicate something special about an edge.
67 Test the edge flags on EDGE_COMPLEX to detect all forms of "strange"
[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.h24 /* Location to track pending stmt for edge insertion. */
44 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);
[all …]
H A Dcfg-flags.def100 /* Masks for edge.flags.
103 NAME is the name of the edge flag. A flag EDGE_#NAME will be
114 this means that the edge cannot be split. */
117 /* Edge out of a basic block that ends with a CALL_INSN with abnormal
123 /* Exception edge. Exception handling edges represent possible control
128 /* Never merge blocks via this edge. This is used for exception handling,
133 /* Not a real edge. This is used to connect parts of the CFG that do
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
139 are hints that this edge may be part of a loop in the CFG. */
142 /* Edge in a part of the CFG that is an irreducible loop. */
[all …]
/OK3568_Linux_fs/kernel/drivers/rpmsg/
H A Dqcom_smd.c97 * @dev: device associated with this edge
98 * @name: name of this edge
99 * @of_node: of_node handle for information related to this edge
100 * @edge_id: identifier of this edge
102 * @irq: interrupt for signals on this edge
108 * @channels: list of all channels detected on this edge
114 * @state_work: work item for edge state changes
163 struct qcom_smd_edge *edge; member
178 * @edge: qcom_smd_edge this channel is living on
200 struct qcom_smd_edge *edge; member
[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 DConfig.in.options56 bool "aarch64 glibc bleeding-edge 2020.08-1"
74 glibc C library. This is a bleeding-edge version, which
106 bool "aarch64 musl bleeding-edge 2020.08-1"
122 musl C library. This is a bleeding-edge version, which
151 bool "aarch64 uclibc bleeding-edge 2020.08-1"
167 uclibc C library. This is a bleeding-edge version, which
197 bool "aarch64be glibc bleeding-edge 2020.08-1"
215 glibc C library. This is a bleeding-edge version, which
247 bool "aarch64be uclibc bleeding-edge 2020.08-1"
263 uclibc C library. This is a bleeding-edge version, which
[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/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()
150 // that will cross edge in EdgeEvent()
348 // If this is a Constrained Edge or a Delaunay Edge(only during recursive legalization) in Legalize()
358 // Lets mark this shared edge as Delaunay in Legalize()
362 // Lets rotate shared edge one vertex CW to legalize it in Legalize()
[all …]
H A Dsweep.h36 * "FlipScan" Constrained Edge Algorithm invented by Thomas �hl�n, thahlen@gmail.com
49 struct Edge;
92 * @param edge
95 void EdgeEvent(SweepContext& tcx, Edge* edge, Node* node);
143 * @return true if d is inside circle, false if on circle edge
215 void FillEdgeEvent(SweepContext& tcx, Edge* edge, Node* node);
217 void FillRightAboveEdgeEvent(SweepContext& tcx, Edge* edge, Node* node);
219 void FillRightBelowEdgeEvent(SweepContext& tcx, Edge* edge, Node& node);
221 void FillRightConcaveEdgeEvent(SweepContext& tcx, Edge* edge, Node& node);
223 void FillRightConvexEdgeEvent(SweepContext& tcx, Edge* edge, Node& node);
[all …]
/OK3568_Linux_fs/kernel/drivers/staging/media/atomisp/pci/isp/kernels/eed1_8/
H A Dia_css_eed1_8_types.h20 * CSS-API header file for Edge Enhanced Demosaic parameters.
33 /* Number of segments + 1 segment used in edge reliability enhancement
39 /* Edge Enhanced Demosaic configuration
63 s32 coring_pos0; /** Positive Edge Coring Threshold in dark region. */
64 s32 coring_pos1; /** Positive Edge Coring Threshold in bright region. */
65 s32 coring_neg0; /** Negative Edge Coring Threshold in dark region. */
66 s32 coring_neg1; /** Negative Edge Coring Threshold in bright region. */
69 s32 gain_pos0; /** Gain for Positive Edge in dark region. */
70 s32 gain_pos1; /** Gain for Positive Edge in bright region. */
71 s32 gain_neg0; /** Gain for Negative Edge in dark region. */
[all …]
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-support/pxaregs/pxaregs-1.14/
H A Dpxaregs.c98 { "PWER_WE0", 0x40F0000C, 0, 0x00000001, 'd', "PM wake up due to GPIO 0 edge detect enabled" },
99 { "PWER_WE1", 0x40F0000C, 1, 0x00000001, 'd', "PM wake up due to GPIO 1 edge detect enabled" },
100 { "PWER_WE2", 0x40F0000C, 2, 0x00000001, 'd', "PM wake up due to GPIO 2 edge detect enabled" },
101 { "PWER_WE3", 0x40F0000C, 3, 0x00000001, 'd', "PM wake up due to GPIO 3 edge detect enabled" },
102 { "PWER_WE4", 0x40F0000C, 4, 0x00000001, 'd', "PM wake up due to GPIO 4 edge detect enabled" },
103 { "PWER_WE5", 0x40F0000C, 5, 0x00000001, 'd', "PM wake up due to GPIO 5 edge detect enabled" },
104 { "PWER_WE6", 0x40F0000C, 6, 0x00000001, 'd', "PM wake up due to GPIO 6 edge detect enabled" },
105 { "PWER_WE7", 0x40F0000C, 7, 0x00000001, 'd', "PM wake up due to GPIO 7 edge detect enabled" },
106 { "PWER_WE8", 0x40F0000C, 8, 0x00000001, 'd', "PM wake up due to GPIO 8 edge detect enabled" },
107 { "PWER_WE9", 0x40F0000C, 9, 0x00000001, 'd', "PM wake up due to GPIO 9 edge detect enabled" },
[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() function
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.hpp3 #include <mapbox/geometry/wagyu/edge.hpp>
17 inline void reverse_horizontal(edge<T>& e) { in reverse_horizontal()
20 // adjoining lower edge. [Helpful in the process_horizontal() method.] 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()
[all …]
/OK3568_Linux_fs/external/xserver/mi/
H A Dmipoly.c65 * Insert the given edge into the edge table. First we must find the correct
66 * bucket in the Edge table, then find the right slot in the bucket. Finally,
78 * find the right bucket to put the edge into in miInsertEdgeInET()
109 * now insert the edge in the right bucket in miInsertEdgeInET()
141 * This routine creates the edge table for scan converting polygons.
142 * The Edge Table (ET) looks like:
157 * per scanline at which an edge is initially entered.
175 * initialize the Active Edge Table in miCreateETandAET()
183 * initialize the Edge Table. in miCreateETandAET()
195 * a time -- these make up one edge of the polygon. in miCreateETandAET()
[all …]
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/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 …]

12345678910>>...86