| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/overlay/ |
| H A D | get_turn_info_ll.hpp | 127 if ( tp.operations[0].operation == operation_blocked ) in apply()
129 tp.operations[1].is_collinear = true; in apply()
131 if ( tp.operations[1].operation == operation_blocked ) in apply()
133 tp.operations[0].is_collinear = true; in apply()
137 tp.operations[0].operation, in apply()
138 tp.operations[1].operation); in apply()
150 replace_operations_i(tp.operations[0].operation, tp.operations[1].operation); in apply()
177 if ( tp.operations[0].operation == operation_blocked in apply()
178 && tp.operations[1].operation == operation_blocked ) in apply()
183 tp.operations[0].operation = operation_union; in apply()
[all …]
|
| H A D | get_turn_info_la.hpp | 131 if ( tp.operations[1].operation == operation_blocked ) in apply()
133 tp.operations[0].is_collinear = true; in apply()
137 tp.operations[0].operation, in apply()
138 tp.operations[1].operation); in apply()
141 calculate_spike_operation(tp.operations[0].operation, in apply()
155 replace_operations_i(tp.operations[0].operation, tp.operations[1].operation); in apply()
176 if ( tp.operations[1].operation == operation_blocked ) in apply()
178 tp.operations[0].is_collinear = true; in apply()
188 if ( tp.operations[0].operation == operation_blocked ) in apply()
195 tp.operations[0].is_collinear = true; in apply()
[all …]
|
| H A D | enrich_intersection_points.hpp | 69 inline void enrich_sort(Operations& operations, in enrich_sort() argument
77 std::sort(boost::begin(operations), in enrich_sort()
78 boost::end(operations), in enrich_sort()
92 inline void enrich_assign(Operations& operations, Turns& turns) in enrich_assign() argument
99 if (operations.size() > 0) in enrich_assign()
104 geometry::ever_circling_range_iterator<Operations const> next(operations); in enrich_assign()
107 for (iterator_type it = boost::begin(operations); in enrich_assign()
108 it != boost::end(operations); ++it) in enrich_assign()
111 op_type& op = turn.operations[it->operation_index]; in enrich_assign()
124 && op.seg_id == turns[next->turn_index].operations[next->operation_index].seg_id) in enrich_assign()
[all …]
|
| H A D | get_turn_info.hpp | 91 ti.operations[0].operation = op; in both()
92 ti.operations[1].operation = op; in both()
99 ti.operations[0].operation = condition in ui_else_iu()
101 ti.operations[1].operation = condition in ui_else_iu()
122 ti.operations[0].fraction = info.fractions[index].robust_ra; in assign_point()
123 ti.operations[1].fraction = info.fractions[index].robust_rb; in assign_point()
181 ti.operations[index].operation = operation_union; in apply()
182 ti.operations[1 - index].operation = operation_intersection; in apply()
210 ti.operations[index].operation = operation_union; in apply()
211 ti.operations[1 - index].operation = operation_intersection; in apply()
[all …]
|
| H A D | handle_colocations.hpp | 100 = left_turn.operations[left.op_index]; in operator ()()
103 = right_turn.operations[right.op_index]; in operator ()()
134 = left_turn.operations[1 - left.op_index]; in operator ()()
137 = right_turn.operations[1 - right.op_index]; in operator ()()
179 signed_size_type cid0 = get_cluster_id(turn.operations[0], cluster_per_segment); in add_turn_to_cluster()
180 signed_size_type cid1 = get_cluster_id(turn.operations[1], cluster_per_segment); in add_turn_to_cluster()
185 add_cluster_id(turn.operations[0], cluster_per_segment, cluster_id); in add_turn_to_cluster()
186 add_cluster_id(turn.operations[1], cluster_per_segment, cluster_id); in add_turn_to_cluster()
191 add_cluster_id(turn.operations[0], cluster_per_segment, cid1); in add_turn_to_cluster()
196 add_cluster_id(turn.operations[1], cluster_per_segment, cid0); in add_turn_to_cluster()
[all …]
|
| H A D | get_turn_info_for_endpoint.hpp | 437 operations = operations_of_equal(side_calc); in handle_internal() local
442 if ( operations_both(operations, operation_continue) ) in handle_internal()
457 …BOOST_GEOMETRY_ASSERT(operations_combination(operations, operation_intersection, operation_union)); in handle_internal()
490 operations = operations_of_equal(side_calc); in handle_internal() local
495 if ( operations_both(operations, operation_continue) ) in handle_internal()
510 …BOOST_GEOMETRY_ASSERT(operations_combination(operations, operation_intersection, operation_union)); in handle_internal()
561 tp.operations[0].operation = op0; in assign()
562 tp.operations[1].operation = op1; in assign()
563 tp.operations[0].position = pos0; in assign()
564 tp.operations[1].position = pos1; in assign()
[all …]
|
| H A D | check_enrich.hpp | 50 << " operations: " << operation_char(meta_turn.turn->operations[0].operation) in display()
51 << operation_char(meta_turn.turn->operations[1].operation) in display()
52 << " travels to " << meta_turn.turn->operations[0].enriched.travels_to_ip_index in display()
53 << " and " << meta_turn.turn->operations[1].enriched.travels_to_ip_index in display()
67 int const ip_index = meta_turn.turn->operations[op_index].enriched.travels_to_ip_index; in check_detailed()
80 && (meta_turns[ip_index].turn->operations[op_index].operation == operation_continue in check_detailed()
81 || meta_turns[ip_index].turn->operations[op_index].operation == for_operation) in check_detailed()
93 && meta_turns[ip_index].turn->operations[other_index].operation == for_operation) in check_detailed()
141 && it->turn->operations[i].operation == for_operation) in check_graph()
|
| H A D | traversal.hpp | 58 << " of: " << operation_char(turn.operations[0].operation) in debug_traverse()
59 << operation_char(turn.operations[1].operation) in debug_traverse()
144 turn_operation_type& op = turn.operations[i]; in finalize_visit_info()
168 turn_operation_type& op = turn.operations[i]; in set_visited_in_cluster()
184 turn_operation_type& turn_op = turn.operations[i]; in set_visited()
279 turn_operation_type const& op = turn.operations[i]; in select_cc_operation()
317 turn_operation_type const& op = turn.operations[i]; in select_noncc_operation()
353 debug_traverse(turn, turn.operations[selected_op_index], "Accepted"); in select_operation()
363 if (turn.operations[i].visited.started()) in starting_operation_index()
375 if (! turn.operations[i].visited.finished()) in both_finished()
[all …]
|
| H A D | turn_info.hpp | 101 Container operations; member
120 return this->operations[0].operation == type in has()
121 || this->operations[1].operation == type; in has()
145 return this->operations[0].operation == type1 in has12()
146 && this->operations[1].operation == type2 in has12()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/relate/ |
| H A D | linear_areal.hpp | 335 || prev_seg_id_ptr->multi_index != it->operations[1].seg_id.multi_index ) in apply()
338 if ( it->operations[1].seg_id.ring_index > -1 ) in apply()
366 && prev_seg_id_ptr->ring_index + 1 < it->operations[1].seg_id.ring_index ) in apply()
374 prev_seg_id_ptr = boost::addressof(it->operations[1].seg_id); in apply()
459 return left.operations[0].seg_id == right.operations[0].seg_id in operator ()()
460 && left.operations[0].fraction == right.operations[0].fraction; in operator ()()
470 && left.operations[1].seg_id.multi_index == right.operations[1].seg_id.multi_index; in operator ()()
483 int least_priority = op_to_priority(first->operations[0]); in operator ()()
486 int priority = op_to_priority(it->operations[0]); in operator ()()
506 … return left.operations[1].seg_id.multi_index == right.operations[1].seg_id.multi_index ? in operator ()()
[all …]
|
| H A D | turns.hpp | 162 return op_to_int(left.operations[OpId]) < op_to_int(right.operations[OpId]); in operator ()()
181 segment_identifier const& left_other_seg_id = left.operations[other_op_id].seg_id; in operator ()()
182 segment_identifier const& right_other_seg_id = right.operations[other_op_id].seg_id; in operator ()()
185 operation_type const& left_operation = left.operations[OpId]; in operator ()()
186 operation_type const& right_operation = right.operations[OpId]; in operator ()()
216 segment_identifier const& left_other_seg_id = left.operations[other_op_id].seg_id; in operator ()()
217 segment_identifier const& right_other_seg_id = right.operations[other_op_id].seg_id; in operator ()()
220 operation_type const& left_operation = left.operations[OpId]; in operator ()()
221 operation_type const& right_operation = right.operations[OpId]; in operator ()()
264 return left.operations[other_op_id].seg_id.multi_index in operator ()()
[all …]
|
| H A D | linear_linear.hpp | 223 if ( it->operations[0].operation == overlay::operation_intersection in apply()
224 || it->operations[1].operation == overlay::operation_intersection ) in apply()
228 else if ( ( it->operations[0].operation == overlay::operation_union in apply()
229 || it->operations[0].operation == overlay::operation_blocked in apply()
230 || it->operations[1].operation == overlay::operation_union in apply()
231 || it->operations[1].operation == overlay::operation_blocked ) in apply()
232 && it->operations[0].position == overlay::position_middle in apply()
233 && it->operations[1].position == overlay::position_middle ) in apply()
277 overlay::operation_type const op = it->operations[op_id].operation; in apply()
279 segment_identifier const& seg_id = it->operations[op_id].seg_id; in apply()
[all …]
|
| H A D | areal_areal.hpp | 381 overlay::operation_type const op = turn.operations[OpId].operation; in per_turn()
450 overlay::operation_type const op = it->operations[op_id].operation; in apply()
460 segment_identifier const& seg_id = it->operations[op_id].seg_id; in apply()
514 if ( it->operations[other_op_id].operation != overlay::operation_intersection ) in apply()
720 if ( it->operations[0].operation == overlay::operation_intersection in turns()
721 && it->operations[1].operation == overlay::operation_intersection ) in turns()
725 else if ( it->operations[0].operation == overlay::operation_union in turns()
726 && it->operations[1].operation == overlay::operation_union ) in turns()
787 if ( prev->operations[OpId].seg_id.multi_index in apply()
788 == first->operations[OpId].seg_id.multi_index ) in apply()
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/turns/ |
| H A D | compare_turns.hpp | 66 segment_identifier const& left_other_seg_id = left.operations[other_op_id].seg_id; in use_other_id()
67 segment_identifier const& right_other_seg_id = right.operations[other_op_id].seg_id; in use_other_id()
82 return use_operation(left.operations[OpId], right.operations[OpId]); in use_other_id()
89 geometry::math::equals(left.operations[OpId].fraction, in use_fraction()
90 right.operations[OpId].fraction) in use_fraction()
94 (left.operations[OpId].fraction < right.operations[OpId].fraction) in use_fraction()
101 segment_identifier const& sl = left.operations[OpId].seg_id; in operator ()()
102 segment_identifier const& sr = right.operations[OpId].seg_id; in operator ()()
|
| H A D | remove_duplicate_turns.hpp | 41 && t1.operations[0].seg_id == t2.operations[0].seg_id in operator ()()
42 && t1.operations[1].seg_id == t2.operations[1].seg_id; in operator ()()
|
| /OK3568_Linux_fs/kernel/Documentation/ |
| H A D | atomic_bitops.txt | 5 While our bitmap_{}() functions are non-atomic, we have a number of operations
12 The single bit operations are:
18 RMW atomic operations without return value:
23 RMW atomic operations with return value:
33 All RMW atomic operations have a '__' prefixed variant which is non-atomic.
47 The test_and_{}_bit() operations return the original value of the bit.
55 - non-RMW operations are unordered;
57 - RMW operations that have no return value are unordered;
59 - RMW operations that have a return value are fully ordered.
61 - RMW operations that are conditional are unordered on FAILURE,
[all …]
|
| H A D | atomic_t.txt | 5 RMW operations between CPUs (atomic operations on MMIO are not supported and
20 RMW atomic operations:
85 the Non-RMW operations of atomic_t, you do not in fact need atomic_t at all
138 - plain operations without return value: atomic_{}()
140 - operations which return the modified value: atomic_{}_return()
142 these are limited to the arithmetic operations because those are
146 - operations which return the original value: atomic_fetch_{}()
148 - swap operations: xchg(), cmpxchg() and try_cmpxchg()
150 - misc; the special purpose operations that are commonly used and would,
155 All these operations are SMP atomic; that is, the operations (for a single
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/is_valid/ |
| H A D | debug_print_turns.hpp | 34 << geometry::operation_char(turn.operations[0].operation) in debug_print_turn()
36 << geometry::operation_char(turn.operations[1].operation) in debug_print_turn()
38 << turn.operations[0].seg_id.multi_index in debug_print_turn()
40 << turn.operations[1].seg_id.multi_index in debug_print_turn()
42 << turn.operations[0].seg_id.ring_index in debug_print_turn()
44 << turn.operations[1].seg_id.ring_index in debug_print_turn()
46 << turn.operations[0].seg_id.segment_index in debug_print_turn()
48 << turn.operations[1].seg_id.segment_index in debug_print_turn()
|
| H A D | is_acceptable_turn.hpp | 95 && turn.operations[0].operation == operation in check_turn()
96 && turn.operations[1].operation == operation; in check_turn()
106 if ( turn.operations[0].seg_id.ring_index in apply()
107 == turn.operations[1].seg_id.ring_index ) in apply()
134 if ( turn.operations[0].seg_id.multi_index in apply()
135 == turn.operations[1].seg_id.multi_index ) in apply()
|
| /OK3568_Linux_fs/u-boot/drivers/fpga/ |
| H A D | xilinx.c | 136 if (!desc->operations || !desc->operations->load) { in xilinx_load()
141 return desc->operations->load(desc, buf, bsize, bstype); in xilinx_load()
153 if (!desc->operations || !desc->operations->loadfs) { in xilinx_loadfs()
158 return desc->operations->loadfs(desc, buf, bsize, fpga_fsinfo); in xilinx_loadfs()
169 if (!desc->operations || !desc->operations->dump) { in xilinx_dump()
174 return desc->operations->dump(desc, buf, bsize); in xilinx_dump()
246 if (desc->operations && desc->operations->info) in xilinx_info()
247 desc->operations->info(desc); in xilinx_info()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/is_simple/ |
| H A D | linear.hpp | 69 (turn.operations[0].seg_id.segment_index == 0 in check_segment_indices()
70 && turn.operations[1].seg_id.segment_index == last_index) in check_segment_indices()
72 (turn.operations[0].seg_id.segment_index == 0 in check_segment_indices()
73 && turn.operations[1].seg_id.segment_index == last_index); in check_segment_indices()
99 && turn.operations[0].fraction.is_zero(); in apply()
139 turn.operations[0].fraction.is_zero(); in is_closing_point_of()
167 range::at(m_multilinestring, turn.operations[0].seg_id.multi_index); in apply()
170 range::at(m_multilinestring, turn.operations[1].seg_id.multi_index); in apply()
172 if (turn.operations[0].seg_id.multi_index in apply()
173 == turn.operations[1].seg_id.multi_index) in apply()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/ |
| H A D | has_self_intersections.hpp | 94 info.operations[0].operation == detail::overlay::operation_union in has_self_intersections()
95 && info.operations[1].operation == detail::overlay::operation_union; in has_self_intersections()
97 info.operations[0].operation == detail::overlay::operation_intersection in has_self_intersections()
98 && info.operations[1].operation == detail::overlay::operation_intersection; in has_self_intersections()
115 std::cout << " " << operation_char(info.operations[i].operation); in has_self_intersections()
116 std::cout << " " << info.operations[i].seg_id; in has_self_intersections()
|
| /OK3568_Linux_fs/kernel/Documentation/core-api/ |
| H A D | this_cpu_ops.rst | 2 this_cpu operations
8 this_cpu operations are a way of optimizing access to per cpu
14 this_cpu operations add a per cpu variable offset to the processor
24 Read-modify-write operations are of particular interest. Frequently
39 (remote write operations) of local RMW operations via this_cpu_*.
41 The main use of the this_cpu operations has been to optimize counter
42 operations.
44 The following this_cpu() operations with implied preemption protection
45 are defined. These operations can be used without worrying about
65 Inner working of this_cpu operations
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/arm/ |
| H A D | firmware.rst | 2 Interface for registering and calling firmware-specific operations for ARM
10 operations and call them when needed.
12 Firmware operations can be specified by filling in a struct firmware_ops
21 There is a default, empty set of operations provided, so there is no need to
22 set anything if platform does not require firmware operations.
33 Example of registering firmware operations::
52 /* other operations not available on platformX */
|
| /OK3568_Linux_fs/kernel/Documentation/virt/ |
| H A D | paravirt_ops.rst | 11 hypervisors. It allows each hypervisor to override critical operations and
15 pv_ops provides a set of function pointers which represent operations
18 time by enabling binary patching of the low-ops critical operations
21 pv_ops operations are classified into three categories:
24 These operations correspond to high level functionality where it is
28 Usually these operations correspond to low level critical instructions. They
|