| /OK3568_Linux_fs/kernel/fs/erofs/ |
| H A D | xattr.c | 19 static inline void xattr_iter_end(struct xattr_iter *it, bool atomic) in xattr_iter_end() argument 23 kunmap(it->page); in xattr_iter_end() 25 kunmap_atomic(it->kaddr); in xattr_iter_end() 27 unlock_page(it->page); in xattr_iter_end() 28 put_page(it->page); in xattr_iter_end() 31 static inline void xattr_iter_end_final(struct xattr_iter *it) in xattr_iter_end_final() argument 33 if (!it->page) in xattr_iter_end_final() 36 xattr_iter_end(it, true); in xattr_iter_end_final() 42 struct xattr_iter it; in init_inode_xattrs() local 95 it.blkaddr = erofs_blknr(iloc(sbi, vi->nid) + vi->inode_isize); in init_inode_xattrs() [all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/io/wkt/ |
| H A D | read.hpp | 72 Iterator const& it, in read_wkt_exception() 78 if (it != end) in read_wkt_exception() 81 source += it->c_str(); in read_wkt_exception() 120 static inline void apply(tokenizer::iterator& it, in apply() 128 bool finished = (it == end || *it == "," || *it == ")"); in apply() 140 : coordinate_cast<coordinate_type>::apply(*it)); in apply() 144 BOOST_THROW_EXCEPTION(read_wkt_exception(blc.what(), it, end, wkt)); in apply() 148 BOOST_THROW_EXCEPTION(read_wkt_exception(e.what(), it, end, wkt)); in apply() 152 BOOST_THROW_EXCEPTION(read_wkt_exception("", it, end, wkt)); in apply() 156 (finished ? it : ++it), end, point, wkt); 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/buffer/ |
| H A D | buffered_piece_collection.hpp | 389 for (iterator_type it = boost::begin(m_turns); in get_occupation() local 390 it != boost::end(m_turns); in get_occupation() 391 ++it) in get_occupation() 393 if (it->location == location_ok) in get_occupation() 398 adapt_mapped_robust_point(occupation_map, *it, distance); in get_occupation() 401 occupation_map[it->get_robust_point()].count++; in get_occupation() 411 for (iterator_type it = boost::begin(m_turns); in get_occupation() local 412 it != boost::end(m_turns); in get_occupation() 413 ++it) in get_occupation() 415 if (it->both(detail::overlay::operation_union)) in get_occupation() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/ |
| H A D | erase_fn_imps.hpp | 150 for (typename inode::iterator it = in clear_imp() local 152 it != static_cast<inode_pointer>(p_nd)->end(); in clear_imp() 153 ++it) in clear_imp() 155 node_pointer p_child =* it; in clear_imp() 170 erase(const_iterator it) in erase() argument 174 if (it == end()) in erase() 175 return it; in erase() 177 const_iterator ret_it = it; in erase() 179 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase() 180 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd)); in erase() [all …]
|
| H A D | debug_fn_imps.hpp | 73 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local 76 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line); in assert_iterators() 77 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators() 78 PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it); in assert_iterators() 89 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) in assert_reverse_iterators() local 93 const_cast<PB_DS_CLASS_C_DEC*>(this)->find_imp(PB_DS_V2F(*it)); in assert_reverse_iterators() 94 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd); in assert_reverse_iterators() 110 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin(); in recursive_count_leafs() local 111 it != static_cast<inode_const_pointer>(p_nd)->end(); in recursive_count_leafs() 112 ++it) in recursive_count_leafs() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/ |
| H A D | erase_fn_imps.hpp | 150 for (typename inode::iterator it = in clear_imp() local 152 it != static_cast<inode_pointer>(p_nd)->end(); in clear_imp() 153 ++it) in clear_imp() 155 node_pointer p_child =* it; in clear_imp() 170 erase(const_iterator it) in erase() argument 174 if (it == end()) in erase() 175 return it; in erase() 177 const_iterator ret_it = it; in erase() 179 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase() 180 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd)); in erase() [all …]
|
| H A D | debug_fn_imps.hpp | 73 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local 76 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line); in assert_iterators() 77 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators() 78 PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it); in assert_iterators() 89 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) in assert_reverse_iterators() local 93 const_cast<PB_DS_CLASS_C_DEC*>(this)->find_imp(PB_DS_V2F(*it)); in assert_reverse_iterators() 94 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd); in assert_reverse_iterators() 110 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin(); in recursive_count_leafs() local 111 it != static_cast<inode_const_pointer>(p_nd)->end(); in recursive_count_leafs() 112 ++it) in recursive_count_leafs() [all …]
|
| /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 | get_left_turns.hpp | 161 for (typename boost::range_iterator<AngleCollection const>::type it = in get_left_turns() local 162 sorted_angles.begin(); it != sorted_angles.end(); ++it) in get_left_turns() 164 if (!it->blocked) in get_left_turns() 166 if (it->incoming) in get_left_turns() 168 good_incoming.insert(it->turn_index); in get_left_turns() 172 good_outgoing.insert(it->turn_index); in get_left_turns() 182 for (typename boost::range_iterator<AngleCollection const>::type it = in get_left_turns() local 183 sorted_angles.begin(); it != sorted_angles.end(); ++it) in get_left_turns() 185 if (good_incoming.count(it->turn_index) == 0 in get_left_turns() 186 || good_outgoing.count(it->turn_index) == 0) in get_left_turns() [all …]
|
| /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 | aggregate_operations.hpp | 63 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in all_equal() local 64 it != rings.end(); ++it) in all_equal() 66 if (it->direction != dir_type) in all_equal() 86 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in has_only() local 87 it != rings.end(); ++it) in has_only() 89 const ring_with_direction& rwd = *it; in has_only() 103 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in has_only_both() local 104 it != rings.end(); ++it) in has_only_both() 106 const ring_with_direction& rwd = *it; in has_only_both() 117 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in is_isolated() local [all …]
|
| H A D | assign_parents.hpp | 255 for (map_iterator_type it = boost::begin(ring_map); in assign_parents() local 256 it != boost::end(ring_map); ++it, ++index) in assign_parents() 258 vector[index] = helper(it->first, it->second.get_area()); in assign_parents() 260 switch(it->first.source_index) in assign_parents() 263 geometry::envelope(get_ring<tag1>::apply(it->first, geometry1), in assign_parents() 267 geometry::envelope(get_ring<tag2>::apply(it->first, geometry2), in assign_parents() 271 geometry::envelope(get_ring<void>::apply(it->first, collection), in assign_parents() 304 for (vector_iterator_type it = boost::begin(vector); in assign_parents() local 305 it != boost::end(vector); ++it, ++index) in assign_parents() 309 ring_info_type& inner = ring_map[it->id]; in assign_parents() [all …]
|
| H A D | traversal_switch_detector.hpp | 124 … for (typename connection_map::const_iterator it = properties.connected_region_counts.begin(); in get_isolation() local 125 all_colocated && it != properties.connected_region_counts.end(); ++it) in get_isolation() 127 connection_properties const& cprop = it->second; in get_isolation() 158 … for (typename connection_map::const_iterator it = properties.connected_region_counts.begin(); in get_isolation() local 159 it != properties.connected_region_counts.end(); ++it) in get_isolation() 161 signed_size_type const region_id = it->first; in get_isolation() 162 connection_properties const& cprop = it->second; in get_isolation() 210 for (typename region_connection_map::iterator it = m_connected_regions.begin(); in get_isolated_regions() local 211 it != m_connected_regions.end(); ++it) in get_isolated_regions() 213 region_properties& properties = it->second; in get_isolated_regions() [all …]
|
| H A D | handle_colocations.hpp | 154 typename ClusterPerSegment::const_iterator it in get_cluster_id() local 157 if (it == cluster_per_segment.end()) in get_cluster_id() 161 return it->second; in get_cluster_id() 296 for (typename boost::range_iterator<Turns>::type it = turns.begin(); in assign_cluster_to_turns() local 297 it != turns.end(); ++it, ++turn_index) in assign_cluster_to_turns() 299 turn_type& turn = *it; in assign_cluster_to_turns() 313 typename ClusterPerSegment::const_iterator it = cluster_per_segment.find(seg_frac); in assign_cluster_to_turns() local 314 if (it != cluster_per_segment.end()) in assign_cluster_to_turns() 318 && turn.cluster_id != it->second) in assign_cluster_to_turns() 323 turn.cluster_id = it->second; in assign_cluster_to_turns() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/splay_tree_/ |
| H A D | erase_fn_imps.hpp | 48 point_iterator it = find(r_key); in erase() local 49 if (it == base_type::end()) in erase() 51 erase(it); in erase() 58 erase(iterator it) in erase() argument 61 if (it == base_type::end()) in erase() 62 return it; in erase() 63 iterator ret_it = it; in erase() 65 erase_node(it.m_p_nd); in erase() 73 erase(reverse_iterator it) in erase() argument 76 if (it.m_p_nd == base_type::m_p_head) in erase() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/splay_tree_/ |
| H A D | erase_fn_imps.hpp | 48 point_iterator it = find(r_key); in erase() local 49 if (it == base_type::end()) in erase() 51 erase(it); in erase() 58 erase(iterator it) in erase() argument 61 if (it == base_type::end()) in erase() 62 return it; in erase() 63 iterator ret_it = it; in erase() 65 erase_node(it.m_p_nd); in erase() 73 erase(reverse_iterator it) in erase() argument 76 if (it.m_p_nd == base_type::m_p_head) in erase() [all …]
|
| /OK3568_Linux_fs/buildroot/dl/stressapptest/git/src/ |
| H A D | sat.cc | 483 for (WorkerVector::const_iterator it = fill_vector.begin(); in InitializePages() local 484 it != fill_vector.end(); ++it) in InitializePages() 485 (*it)->SpawnThread(); in InitializePages() 488 for (WorkerVector::const_iterator it = fill_vector.begin(); in InitializePages() local 489 it != fill_vector.end(); ++it) { in InitializePages() 490 (*it)->JoinThread(); in InitializePages() 491 if ((*it)->GetStatus() != 1) { in InitializePages() 493 (*it)->ThreadID(), (*it)->GetStatus(), in InitializePages() 494 (*it)->GetRunDurationUSec() * 1.0/1000000); in InitializePages() 498 delete (*it); in InitializePages() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/ |
| H A D | debug_map_base.hpp | 178 iterator it = find(r_key); in erase_existing() 179 if (it == m_keys.end()) in erase_existing() 184 m_keys.erase(it); in erase_existing() 263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it) in find() local 264 if (m_eq(*it, r_key)) in find() 265 return it; in find() 275 iterator it = m_keys.begin(); in find() 276 while (it != m_keys.end()) in find() 278 if (m_eq(*it, r_key)) in find() 279 return it; in find() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/ |
| H A D | debug_map_base.hpp | 178 iterator it = find(r_key); in erase_existing() 179 if (it == m_keys.end()) in erase_existing() 184 m_keys.erase(it); in erase_existing() 263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it) in find() local 264 if (m_eq(*it, r_key)) in find() 265 return it; in find() 275 iterator it = m_keys.begin(); in find() 276 while (it != m_keys.end()) in find() 278 if (m_eq(*it, r_key)) in find() 279 return it; in find() [all …]
|
| /OK3568_Linux_fs/kernel/include/linux/ceph/ |
| H A D | messenger.h | 92 #define __ceph_bio_iter_advance_step(it, n, STEP) do { \ argument 96 BUG_ON(!(it)->iter.bi_size); \ 97 __cur_n = min((it)->iter.bi_size, __n); \ 99 bio_advance_iter((it)->bio, &(it)->iter, __cur_n); \ 100 if (!(it)->iter.bi_size && (it)->bio->bi_next) { \ 102 (it)->bio = (it)->bio->bi_next; \ 103 (it)->iter = (it)->bio->bi_iter; \ 112 #define ceph_bio_iter_advance(it, n) \ argument 113 __ceph_bio_iter_advance_step(it, n, 0) 118 #define ceph_bio_iter_advance_step(it, n, BVEC_STEP) \ argument [all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/vendor/nunicode/src/libnu/ |
| H A D | strings.c | 6 static ssize_t _nu_strlen(const char *encoded, const char *limit, nu_read_iterator_t it) { in _nu_strlen() argument 12 p = it(p, &u); in _nu_strlen() 24 static ssize_t _nu_bytelen(const uint32_t *unicode, const uint32_t *limit, nu_write_iterator_t it) { in _nu_bytelen() argument 35 size_t byte_len = (size_t)it(*p, 0); in _nu_bytelen() 44 static ssize_t _nu_strbytelen(const char *encoded, const char *limit, nu_read_iterator_t it) { in _nu_strbytelen() argument 49 const char *np = it(p, &u); in _nu_strbytelen() 65 ssize_t nu_strlen(const char *encoded, nu_read_iterator_t it) { in nu_strlen() argument 66 return _nu_strlen(encoded, NU_UNLIMITED, it); in nu_strlen() 69 ssize_t nu_bytelen(const uint32_t *unicode, nu_write_iterator_t it) { in nu_bytelen() argument 70 return _nu_bytelen(unicode, NU_UNLIMITED, it); in nu_bytelen() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/tree_policy/ |
| H A D | order_statistics_imp.hpp | 48 node_iterator it = node_begin(); in find_by_order() local 51 while (it != end_it) in find_by_order() 53 node_iterator l_it = it.get_l_child(); in find_by_order() 57 return *it; in find_by_order() 59 it = l_it; in find_by_order() 63 it = it.get_r_child(); in find_by_order() 81 node_const_iterator it = node_begin(); in order_of_key() local 86 while (it != end_it) in order_of_key() 88 node_const_iterator l_it = it.get_l_child(); in order_of_key() 90 if (r_cmp_fn(r_key, this->extract_key(*(*it)))) in order_of_key() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/tree_policy/ |
| H A D | order_statistics_imp.hpp | 48 node_iterator it = node_begin(); in find_by_order() local 51 while (it != end_it) in find_by_order() 53 node_iterator l_it = it.get_l_child(); in find_by_order() 57 return *it; in find_by_order() 59 it = l_it; in find_by_order() 63 it = it.get_r_child(); in find_by_order() 81 node_const_iterator it = node_begin(); in order_of_key() local 86 while (it != end_it) in order_of_key() 88 node_const_iterator l_it = it.get_l_child(); in order_of_key() 90 if (r_cmp_fn(r_key, this->extract_key(*(*it)))) in order_of_key() [all …]
|
| /OK3568_Linux_fs/external/xserver/Xext/ |
| H A D | hashtable.c | 75 BucketPtr it, tmp; in ht_destroy() local 78 xorg_list_for_each_entry_safe(it, tmp, &ht->buckets[c], l) { in ht_destroy() 79 xorg_list_del(&it->l); in ht_destroy() 80 free(it->key); in ht_destroy() 81 free(it->data); in ht_destroy() 82 free(it); in ht_destroy() 105 BucketPtr it, tmp; in double_size() local 106 xorg_list_for_each_entry_safe(it, tmp, &ht->buckets[c], l) { in double_size() 108 &newBuckets[ht->hash(ht->cdata, it->key, newBucketBits)]; in double_size() 109 xorg_list_del(&it->l); in double_size() [all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/envelope/ |
| H A D | range.hpp | 66 Iterator it = first; in apply() local 67 if (it != last) in apply() 70 dispatch::envelope<value_type>::apply(*it, mbr, strategy); in apply() 73 for (++it; it != last; ++it) in apply() 75 dispatch::expand<Box, value_type>::apply(mbr, *it, strategy); in apply() 103 for (iterator_type it = boost::begin(multirange); in apply() local 104 it != boost::end(multirange); in apply() 105 ++it) in apply() 107 if (! geometry::is_empty(*it)) in apply() 112 EnvelopePolicy::apply(*it, helper_mbr, strategy); in apply() [all …]
|
| /OK3568_Linux_fs/kernel/fs/cifs/ |
| H A D | dfs_cache.h | 40 const struct dfs_cache_tgt_iterator *it); 43 const struct dfs_cache_tgt_iterator *it); 45 const struct dfs_cache_tgt_iterator *it, 52 extern int dfs_cache_get_tgt_share(char *path, const struct dfs_cache_tgt_iterator *it, 57 struct dfs_cache_tgt_iterator *it) in dfs_cache_get_next_tgt() argument 59 if (!tl || list_empty(&tl->tl_list) || !it || in dfs_cache_get_next_tgt() 60 list_is_last(&it->it_list, &tl->tl_list)) in dfs_cache_get_next_tgt() 62 return list_next_entry(it, it_list); in dfs_cache_get_next_tgt() 77 struct dfs_cache_tgt_iterator *it, *nit; in dfs_cache_free_tgts() local 81 list_for_each_entry_safe(it, nit, &tl->tl_list, it_list) { in dfs_cache_free_tgts() [all …]
|
| /OK3568_Linux_fs/kernel/drivers/gpu/drm/nouveau/nvkm/subdev/mmu/ |
| H A D | vmm.c | 98 nvkm_vmm_trace(struct nvkm_vmm_iter *it, char *buf) in nvkm_vmm_trace() argument 101 for (lvl = it->max; lvl >= 0; lvl--) { in nvkm_vmm_trace() 102 if (lvl >= it->lvl) in nvkm_vmm_trace() 103 buf += sprintf(buf, "%05x:", it->pte[lvl]); in nvkm_vmm_trace() 120 nvkm_vmm_flush_mark(struct nvkm_vmm_iter *it) in nvkm_vmm_flush_mark() argument 122 it->flush = min(it->flush, it->max - it->lvl); in nvkm_vmm_flush_mark() 126 nvkm_vmm_flush(struct nvkm_vmm_iter *it) in nvkm_vmm_flush() argument 128 if (it->flush != NVKM_VMM_LEVELS_MAX) { in nvkm_vmm_flush() 129 if (it->vmm->func->flush) { in nvkm_vmm_flush() 130 TRA(it, "flush: %d", it->flush); in nvkm_vmm_flush() [all …]
|