| /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 | handle_colocations.hpp | 206 // these clusters are not the same. Merge of two clusters is necessary in add_turn_to_cluster()
284 typename Clusters,
288 Clusters& clusters, in assign_cluster_to_turns() argument
324 clusters[turn.cluster_id].turn_indices.insert(turn_index); in assign_cluster_to_turns()
330 template <typename Turns, typename Clusters>
331 inline void remove_clusters(Turns& turns, Clusters& clusters) in remove_clusters() argument
333 typename Clusters::iterator it = clusters.begin(); in remove_clusters()
334 while (it != clusters.end()) in remove_clusters()
338 typename Clusters::iterator current_it = it; in remove_clusters()
347 clusters.erase(current_it); in remove_clusters()
[all …]
|
| H A D | traverse.hpp | 66 typename Clusters
73 Clusters& clusters, in apply() argument
80 Turns, Clusters, in apply()
82 > switch_detector(geometry1, geometry2, turns, clusters, in apply()
92 Turns, Clusters, in apply()
96 > trav(geometry1, geometry2, turns, clusters, in apply()
|
| H A D | overlay.hpp | 80 template <typename Clusters, typename Turns>
81 void visit_clusters(Clusters const& , Turns const& ) {} in visit_clusters()
97 typename Clusters
99 …e void get_ring_turn_info(TurnInfoMap& turn_info_map, Turns const& turns, Clusters const& clusters) in get_ring_turn_info() argument
134 typename Clusters::const_iterator mit = clusters.find(turn.cluster_id); in get_ring_turn_info()
135 BOOST_ASSERT(mit != clusters.end()); in get_ring_turn_info()
287 // Define the clusters, mapping cluster_id -> turns in apply()
322 cluster_type clusters; in apply() local
325 clusters, geometry1, geometry2, in apply()
331 visitor.visit_clusters(clusters, turns); in apply()
[all …]
|
| H A D | enrich_intersection_points.hpp | 195 // Blocked operations or uu on clusters (for intersection) in create_map()
196 // should be included, to block potential paths in clusters in create_map()
285 \tparam Clusters type of cluster container
290 \param clusters container containing clusters
301 typename Clusters,
307 Clusters& clusters, in enrich_intersection_points() argument
335 clusters, geometry1, geometry2); in enrich_intersection_points()
354 // a union (during intersection) in uu/cc clusters (e.g. #31,#32,#33) in enrich_intersection_points()
426 // First gather cluster properties (using even clusters with in enrich_intersection_points()
427 // discarded turns - for open turns), then clean up clusters in enrich_intersection_points()
[all …]
|
| H A D | traversal_switch_detector.hpp | 45 typename Clusters,
102 Turns& turns, Clusters& clusters, in traversal_switch_detector()
107 , m_clusters(clusters) in traversal_switch_detector()
130 // Either no cluster (non colocated point), or more clusters in get_isolation()
324 typename Clusters::const_iterator it = m_clusters.find(turn.cluster_id); in connects_same_region()
456 // Iterate through all clusters in iterate()
457 for (typename Clusters::iterator it = m_clusters.begin(); it != m_clusters.end(); ++it) in iterate()
540 … for (typename Clusters::const_iterator it = m_clusters.begin(); it != m_clusters.end(); ++it) in iterate()
563 Clusters& m_clusters;
|
| H A D | traversal_ring_creator.hpp | 44 typename Clusters,
55 Geometry1, Geometry2, Turns, Clusters,
67 Turns& turns, Clusters const& clusters, in traversal_ring_creator()
70 : m_trav(geometry1, geometry2, turns, clusters, in traversal_ring_creator()
76 , m_clusters(clusters) in traversal_ring_creator()
350 Clusters const& m_clusters;
|
| /OK3568_Linux_fs/kernel/fs/ntfs/ |
| H A D | lcnalloc.h | 38 * ntfs_cluster_free - free clusters on an ntfs volume
39 * @ni: ntfs inode whose runlist describes the clusters to free
40 * @start_vcn: vcn in the runlist of @ni at which to start freeing clusters
41 * @count: number of clusters to free or -1 for all clusters
44 * Free @count clusters starting at the cluster @start_vcn in the runlist
47 * If @count is -1, all clusters from @start_vcn to the end of the runlist are
48 * deallocated. Thus, to completely free all clusters in a runlist, use
71 * Return the number of deallocated clusters (not counting sparse ones) on
103 * ntfs_cluster_free_from_rl - free clusters from runlist
104 * @vol: mounted ntfs volume on which to free the clusters
[all …]
|
| H A D | lcnalloc.c | 23 * ntfs_cluster_free_from_rl_nolock - free clusters from runlist
24 * @vol: mounted ntfs volume on which to free the clusters
25 * @rl: runlist describing the clusters to free
27 * Free all the clusters described by the runlist @rl on the volume @vol. In
28 * the case of an error being returned, at least some of the clusters were not
59 * ntfs_cluster_alloc - allocate clusters on an ntfs volume
60 * @vol: mounted ntfs volume on which to allocate the clusters
62 * @count: number of clusters to allocate
63 * @start_lcn: starting lcn at which to allocate the clusters (or -1 if none)
64 * @zone: zone from which to allocate the clusters
[all …]
|
| /OK3568_Linux_fs/kernel/fs/ocfs2/ |
| H A D | ocfs2.h | 433 * How many clusters in our truncate log.
719 u32 clusters) in ocfs2_clusters_to_blocks() argument
724 return (u64)clusters << c_to_b_bits; in ocfs2_clusters_to_blocks()
750 unsigned int clusters; in ocfs2_clusters_for_bytes() local
753 /* OCFS2 just cannot have enough clusters to overflow this */ in ocfs2_clusters_for_bytes()
754 clusters = (unsigned int)(bytes >> cl_bits); in ocfs2_clusters_for_bytes()
756 return clusters; in ocfs2_clusters_for_bytes()
763 unsigned int clusters; in ocfs2_bytes_to_clusters() local
765 clusters = (unsigned int)(bytes >> cl_bits); in ocfs2_bytes_to_clusters()
766 return clusters; in ocfs2_bytes_to_clusters()
[all …]
|
| H A D | resize.c | 172 static int update_backups(struct inode * inode, u32 clusters, char *data) in update_backups() argument
185 if (cluster >= clusters) in update_backups()
215 u32 clusters = 0; in ocfs2_update_super_and_backups() local
233 clusters = le32_to_cpu(super_di->i_clusters); in ocfs2_update_super_and_backups()
242 ret = update_backups(inode, clusters, super_bh->b_data); in ocfs2_update_super_and_backups()
255 * Extend the filesystem to the new number of clusters specified. This entry
391 else if (le16_to_cpu(gd->bg_bits) != input->clusters * cl_bpc) in ocfs2_check_new_group()
393 "input has %u clusters set\n", in ocfs2_check_new_group()
395 le16_to_cpu(gd->bg_bits), input->clusters); in ocfs2_check_new_group()
428 else if (total_clusters + input->clusters < total_clusters) in ocfs2_verify_group_and_input()
[all …]
|
| H A D | ocfs2_trace.h | 505 unsigned int e_cpos, unsigned int clusters),
506 TP_ARGS(owner, cpos, len, index, e_cpos, clusters),
513 __field(unsigned int, clusters)
521 __entry->clusters = clusters;
525 __entry->e_cpos, __entry->clusters)
530 unsigned int clusters, unsigned int depth),
531 TP_ARGS(ino, new_cpos, clusters, depth),
535 __field(unsigned int, clusters)
541 __entry->clusters = clusters;
546 __entry->clusters, __entry->depth)
[all …]
|
| H A D | ocfs2_ioctl.h | 52 __u32 clusters; /* Total number of clusters in this group */ member
53 __u32 frees; /* Total free clusters in this group */
160 __u32 ffs_min; /* Minimum free chunksize in clusters */
165 __u32 iff_chunksize; /* chunksize in clusters(in) */
220 claim new clusters
|
| H A D | ocfs2_fs.h | 42 * Blocks cannot be bigger than clusters, so the maximum blocksize is the
251 #define OCFS2_COMPRBLK_FL FS_COMPRBLK_FL /* One or more compressed clusters */
423 * It describes a range of clusters on disk.
429 /*00*/ __le32 e_cpos; /* Offset into the file, in clusters */
431 __le32 e_int_clusters; /* Clusters covered by all children */
433 __le16 e_leaf_clusters; /* Clusters covered by this
451 __le32 t_clusters; /* Number of total clusters covered */
482 /*00*/ __le16 cl_cpg; /* Clusters per Block Group */
712 __le32 i_used; /* Bits (ie, clusters) used */
713 __le32 i_total; /* Total bits (clusters)
[all …]
|
| H A D | refcounttree.c | 1852 * If we just need to split the header or tail clusters, in ocfs2_split_refcount_rec()
2330 * Mark the already-existing extent at cpos as refcounted for len clusters.
2367 * Given some contiguous physical clusters, calculate what we need
2374 u32 clusters, in ocfs2_calc_refcount_meta_credits() argument
2385 while (clusters) { in ocfs2_calc_refcount_meta_credits()
2387 cpos, clusters, &rec, in ocfs2_calc_refcount_meta_credits()
2417 recs_add, (unsigned long long)cpos, clusters, in ocfs2_calc_refcount_meta_credits()
2422 len = min((u64)cpos + clusters, le64_to_cpu(rec.r_cpos) + in ocfs2_calc_refcount_meta_credits()
2451 if (cpos + clusters < le64_to_cpu(rec.r_cpos) + in ocfs2_calc_refcount_meta_credits()
2459 clusters -= len; in ocfs2_calc_refcount_meta_credits()
[all …]
|
| H A D | reservations.h | 116 * @clen: length (in clusters) of proposed allocation
136 * @cstart: start of allocation in clusters
137 * @clen: end of allocation in clusters.
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/supercluster/0.2.2/include/ |
| H A D | supercluster.hpp | 80 std::uint8_t minZoom = 0; // min zoom to generate clusters on
114 timer(std::to_string(zooms[z].clusters.size()) + " clusters"); in Supercluster()
128 auto const &c = zoom.clusters[id]; in getTile()
164 std::vector<Cluster> clusters; member
173 clusters.push_back({ project(f.geometry.get<GeoJSONPoint>()), 1, i++ }); in Zoom()
176 tree.fill(clusters); in Zoom()
180 for (auto &p : previous.clusters) { in Zoom()
190 auto &b = previous.clusters[id]; in Zoom()
202 clusters.push_back({ weight / double(num_points), num_points, p.id }); in Zoom()
205 tree.fill(clusters); in Zoom()
|
| /OK3568_Linux_fs/kernel/arch/arm/common/ |
| H A D | mcpm_entry.c | 36 mcpm_sync.clusters[cluster].cpus[cpu].cpu = CPU_GOING_DOWN; in __mcpm_cpu_going_down()
37 sync_cache_w(&mcpm_sync.clusters[cluster].cpus[cpu].cpu); in __mcpm_cpu_going_down()
50 mcpm_sync.clusters[cluster].cpus[cpu].cpu = CPU_DOWN; in __mcpm_cpu_down()
51 sync_cache_w(&mcpm_sync.clusters[cluster].cpus[cpu].cpu); in __mcpm_cpu_down()
66 mcpm_sync.clusters[cluster].cluster = state; in __mcpm_outbound_leave_critical()
67 sync_cache_w(&mcpm_sync.clusters[cluster].cluster); in __mcpm_outbound_leave_critical()
85 struct mcpm_sync_struct *c = &mcpm_sync.clusters[cluster]; in __mcpm_outbound_enter_critical()
137 sync_cache_r(&mcpm_sync.clusters[cluster].cluster); in __mcpm_cluster_state()
138 return mcpm_sync.clusters[cluster].cluster; in __mcpm_cluster_state()
436 mcpm_sync.clusters[i].cluster = CLUSTER_DOWN; in mcpm_sync_init()
[all …]
|
| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/ |
| H A D | kmeans_index.h | 527 * tree and return the clusters centers of that clustering.
529 * numClusters = number of clusters to have in the clustering computed
536 throw FLANNException("Number of clusters must be at least 1"); in getClusterCenters()
540 KMeansNodePtr* clusters = new KMeansNodePtr[numClusters]; in getClusterCenters() local
542 int clusterCount = getMinVarianceClusters(root_, clusters, numClusters, variance); in getClusterCenters()
544 Logger::info("Clusters requested: %d, returning %d\n",numClusters, clusterCount); in getClusterCenters()
547 DistanceType* center = clusters[i]->pivot; in getClusterCenters()
552 delete[] clusters; in getClusterCenters()
714 …* TODO: for 1-sized clusters don't store a cluster center (it's the same as the single cluster poi…
758 // assign points to clusters in computeClustering()
[all …]
|
| /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 D | tree-switch-conversion.h | 204 group_cluster (vec<cluster *> &clusters, unsigned start, unsigned end);
229 /* List of simple clusters handled by the group. */
242 jump_table_cluster (vec<cluster *> &clusters, unsigned start, unsigned end) in jump_table_cluster() argument
243 : group_cluster (clusters, start, end) in jump_table_cluster()
255 /* Find jump tables of given CLUSTERS, where all members of the vector
256 are of type simple_cluster. New clusters are returned. */
257 static vec<cluster *> find_jump_tables (vec<cluster *> &clusters);
261 static bool can_be_handled (const vec<cluster *> &clusters, unsigned start,
266 static bool is_beneficial (const vec<cluster *> &clusters, unsigned start,
342 bit_test_cluster (vec<cluster *> &clusters, unsigned start, unsigned end, in bit_test_cluster() argument
[all …]
|
| H A D | digraph.h | 108 /* Abstract base class for splitting dnodes into hierarchical clusters
111 See "Subgraphs and Clusters" within
120 child clusters.
136 /* Recursively dump the cluster, all nodes, and child clusters. */
142 If ROOT_CLUSTER is non-NULL, use it to organize the nodes into clusters. */
161 /* If using clustering, emit all nodes via clusters. */ in dump_dot_to_pp()
193 If ROOT_CLUSTER is non-NULL, use it to organize the nodes into clusters. */
211 If ROOT_CLUSTER is non-NULL, use it to organize the nodes into clusters. */
|
| /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 D | tree-switch-conversion.h | 204 group_cluster (vec<cluster *> &clusters, unsigned start, unsigned end);
229 /* List of simple clusters handled by the group. */
242 jump_table_cluster (vec<cluster *> &clusters, unsigned start, unsigned end) in jump_table_cluster() argument
243 : group_cluster (clusters, start, end) in jump_table_cluster()
255 /* Find jump tables of given CLUSTERS, where all members of the vector
256 are of type simple_cluster. New clusters are returned. */
257 static vec<cluster *> find_jump_tables (vec<cluster *> &clusters);
261 static bool can_be_handled (const vec<cluster *> &clusters, unsigned start,
266 static bool is_beneficial (const vec<cluster *> &clusters, unsigned start,
342 bit_test_cluster (vec<cluster *> &clusters, unsigned start, unsigned end, in bit_test_cluster() argument
[all …]
|
| H A D | digraph.h | 108 /* Abstract base class for splitting dnodes into hierarchical clusters
111 See "Subgraphs and Clusters" within
120 child clusters.
136 /* Recursively dump the cluster, all nodes, and child clusters. */
142 If ROOT_CLUSTER is non-NULL, use it to organize the nodes into clusters. */
161 /* If using clustering, emit all nodes via clusters. */ in dump_dot_to_pp()
193 If ROOT_CLUSTER is non-NULL, use it to organize the nodes into clusters. */
211 If ROOT_CLUSTER is non-NULL, use it to organize the nodes into clusters. */
|
| /OK3568_Linux_fs/kernel/drivers/cpufreq/ |
| H A D | tegra186-cpufreq.c | 53 struct tegra186_cpufreq_cluster *clusters; member
62 struct tegra186_cpufreq_cluster *cluster = &data->clusters[i]; in tegra186_cpufreq_init()
113 struct tegra186_cpufreq_cluster *cluster = &data->clusters[i]; in tegra186_cpufreq_get()
237 data->clusters = devm_kcalloc(&pdev->dev, ARRAY_SIZE(tegra186_clusters), in tegra186_cpufreq_probe()
238 sizeof(*data->clusters), GFP_KERNEL); in tegra186_cpufreq_probe()
239 if (!data->clusters) in tegra186_cpufreq_probe()
255 struct tegra186_cpufreq_cluster *cluster = &data->clusters[i]; in tegra186_cpufreq_probe()
|
| /OK3568_Linux_fs/u-boot/doc/ |
| H A D | README.Heterogeneous-SoCs | 34 Added top level CONFIG to identify presence of HETEROGENUOUS clusters
50 DSP/SC3900 core clusters
60 CONFIG_PPC_CLUSTER_START - Start index of ppc clusters
61 CONFIG_DSP_CLUSTER_START - Start index of dsp clusters
|
| /OK3568_Linux_fs/kernel/fs/ext4/ |
| H A D | balloc.c | 83 /* Return the number of clusters used for file system metadata; this
96 /* This is the number of clusters used by the superblock, in ext4_num_overhead_clusters()
105 * for in the clusters used for the base metadata cluster, or in ext4_num_overhead_clusters()
593 * dirty clusters & root reserved clusters. in ext4_has_free_clusters()
598 /* Hm, nope. Are (enough) root reserved clusters available? */ in ext4_has_free_clusters()
673 * @count: pointer to total number of clusters needed
708 * ext4_count_free_clusters() -- count filesystem free clusters
711 * Adds up the number of free clusters from each block group.
867 * This function returns the number of file system metadata clusters at
|