| /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
70 * 1) it is not enough to contain erofs_xattr_ibody_header then 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()
135 // Note that it is much slower than atof. However, it is more standard 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()
[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 | 212 … signed_size_type last_segment_index; // no segment-identifier - it is the same as first_seg_id
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()
[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 | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
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()
[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 | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
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()
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/admin-guide/pm/ |
| H A D | cpuidle.rst | 20 a program is suspended and instructions belonging to it are not fetched from
25 it is an opportunity to save energy.
39 (program) from memory and executing them, but it need not work this way
43 program) at a time, it is a CPU. In that case, if the hardware is asked to
46 Second, if the processor is multi-core, each core in it is able to follow at
52 enter an idle state, that applies to the core that asked for it in the first
53 place, but it also may apply to a larger unit (say a "package" or a "cluster")
54 that the core belongs to (in fact, it may apply to an entire hierarchy of larger
57 remaining core asks the processor to enter an idle state, that may trigger it
70 by one of them, the hardware thread (or CPU) that asked for it is stopped, but
[all …]
|
| H A D | cpufreq.rst | 28 In some situations it is desirable or even necessary to run the program as fast
31 available). In some other cases, however, it may not be necessary to execute
33 relatively long time without utilizing it entirely may be regarded as wasteful.
34 It also may not be physically possible to maintain maximum CPU capacity for too
44 to as CPU performance scaling or CPU frequency scaling (because it involves
56 interfaces for all platforms that support CPU performance scaling. It defines
71 platform-independent form in the majority of cases, so it should be possible
79 interface it comes from and may not be easily represented in an abstract,
90 control the P-state of multiple CPUs at the same time and writing to it affects
111 It is only possible to register one scaling driver at a time, so the scaling
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/process/ |
| H A D | management-style.rst | 7 on who you ask) management style for the linux kernel. It's meant to
14 to do with reality. It started as a lark, but that doesn't mean that it
17 Btw, when talking about "kernel manager", it's all about the technical
24 People", and NOT read it. Burn it, it's a great symbolic gesture.
27 making it painfully obvious to the questioner that we don't have a clue
39 manager must be to make it. That's very deep and obvious, but it's not
60 It helps to realize that the key difference between a big decision and a
75 It turns out that since nobody would be stupid enough to ever really let
76 a kernel manager have huge fiscal responsibility **anyway**, it's usually
83 you made a year ago wasn't a big decision after all, since it could be
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/iterator/detail/ |
| H A D | segmented_iterator.hpp | 42 //auto deref(it)
44 // return deref(begin(car(it.context)))
46 template <typename It>
51 typename It::context_type::car_type::begin_type
56 static type call(It const& it) in call()
58 return *it.context.car.first; in call()
62 //auto deref_data(it)
64 // return deref_data(begin(car(it.context)))
66 template <typename It>
71 typename It::context_type::car_type::begin_type
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/filesystems/ |
| H A D | path-lookup.rst | 12 It has subsequently been updated to reflect changes in the kernel
22 exploration is needed to discover, is that it is complex. There are
25 acquainted with such complexity and has tools to help manage it. One
51 It is tempting to describe the second kind as starting with a
53 slashes and components, it can be empty, in other words. This is
55 in Linux permit it when the ``AT_EMPTY_PATH`` flag is given. For
57 can execute it by calling `execveat() <execveat_>`_ passing
62 it must identify a directory that already exists, otherwise an error
66 calls interpret it quite differently (e.g. some create it, some do
67 not), but it might not even exist: neither the empty pathname nor the
[all …]
|
| H A D | hpfs.rst | 15 is taken from it
24 Set owner/group/mode for files that do not have it specified in extended
33 - there is a list of text extensions (I thing it's better to not convert
35 change it in the source. Original readonly HPFS contained some strange
36 heuristic algorithm that I removed. I thing it's danger to let the
42 danger. I tried to write it so that it won't crash if check=normal on
44 used for debugging (for example it checks if file is allocated in
45 bitmaps when accessing it).
49 When to mark filesystem dirty so that OS/2 checks it.
72 access it under names 'a.', 'a..', 'a . . . ' etc.
[all …]
|
| H A D | porting.rst | 58 informative error value to report). Call it foo_fill_super(). Now declare::
89 it by internal locking (most of filesystems couldn't care less) - you
98 and ->readdir() are called without BKL now. Grab it on entry, drop upon return
109 individual fs sb_op functions. If you don't need it, remove it.
116 free to drop it...
130 an existing filesystem, set it according to ->fs_flags::
136 FS_LITTER is gone - just remove it from fs_flags.
143 went in - and hadn't been documented ;-/). Just remove it from fs_flags
163 Briefly it allows for the definition of decode_fh and encode_fh operations
168 It is planned that this will be required for exporting once the code
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/accessibility/speakup/ |
| H A D | Kconfig | 8 This is the Speakup screen reader. Think of it as a
10 kernel, it can speak everything on the text console from
54 synthesizer. You can say y to build it into the kernel,
55 or m to build it as a module. See the configuration
63 synthesizer. You can say y to build it into the kernel,
64 or m to build it as a module. See the configuration
71 synthesizer. You can say y to build it into the kernel,
72 or m to build it as a module. See the configuration
79 You can say y to build it into the kernel, or m to
80 build it as a module. See the configuration help on the
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/ABI/testing/ |
| H A D | sysfs-class-watchdog | 5 It is a read only file. It contains status of the watchdog
6 device at boot. It is equivalent to WDIOC_GETBOOTSTATUS of
13 It is a read only file. It contains identity string of
20 It is a read/write file. While reading, it gives '1'
22 it gives '0'. Writing a '1' to the file enables the
32 It is a read only file. It gives active/inactive status of
39 It is a read only file. It contains watchdog device's
40 internal status bits. It is equivalent to WDIOC_GETSTATUS
47 It is a read only file. It contains value of time left for
48 reset generation. It is equivalent to WDIOC_GETTIMELEFT of
[all …]
|
| /OK3568_Linux_fs/kernel/net/netfilter/ipvs/ |
| H A D | Kconfig | 24 If you want to compile it in kernel, say Y. To compile it as a
59 performance on it. You can adapt the table size yourself, according
60 to your virtual server application. It is good to set the table size
65 should be not far less than 200x200, it is good to set the table
120 If you want to compile it in kernel, say Y. To compile it as a
133 If you want to compile it in kernel, say Y. To compile it as a
143 If you want to compile it in kernel, say Y. To compile it as a
153 If you want to compile it in kernel, say Y. To compile it as a
163 If you want to compile it in kernel, say Y. To compile it as a
174 If you want to compile it in kernel, say Y. To compile it as a
[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/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/info/ |
| H A D | cppinternals.info | 35 The GNU C preprocessor is implemented as a library, "cpplib", so it can
37 integrated with the C, C++ and Objective-C front ends. It is also
42 The library has been written to be re-entrant, so that it can be used
43 to preprocess many files simultaneously if necessary. It has also been
49 some of the tricky issues. It is intended that, along with the comments
80 it.
83 the bare minimum necessary, and then to keep it there. This makes clear
98 The lexer is contained in the file 'lex.c'. It is a hand-coded lexer,
99 and not implemented as a state machine. It can understand C, C++ and
103 them as they are encountered in a single pass of the input file. It
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/info/ |
| H A D | cppinternals.info | 35 The GNU C preprocessor is implemented as a library, "cpplib", so it can
37 integrated with the C, C++ and Objective-C front ends. It is also
42 The library has been written to be re-entrant, so that it can be used
43 to preprocess many files simultaneously if necessary. It has also been
49 some of the tricky issues. It is intended that, along with the comments
80 it.
83 the bare minimum necessary, and then to keep it there. This makes clear
98 The lexer is contained in the file 'lex.c'. It is a hand-coded lexer,
99 and not implemented as a state machine. It can understand C, C++ and
103 them as they are encountered in a single pass of the input file. It
[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 | 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()
153 // It is isolated if there is only one connection, or if there are more connections but all 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()
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/algorithm/query/detail/ |
| H A D | any.hpp | 65 template <typename It, typename F>
67 static bool call(It const& it, F f) in call()
70 f(*it) || in call()
71 f(*fusion::advance_c<1>(it))|| in call()
72 f(*fusion::advance_c<2>(it)) || in call()
73 f(*fusion::advance_c<3>(it)) || in call()
74 detail::unrolled_any<N-4>::call(fusion::advance_c<4>(it), f); in call()
81 template <typename It, typename F>
83 static bool call(It const& it, F f) in call()
86 f(*it) || in call()
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/algorithm/iteration/detail/ |
| H A D | fold.hpp | 23 # define BOOST_FUSION_FOLD_IMPL_FIRST_IT_META_TRANSFORM(IT) \ argument
24 typename fusion::result_of::prior<IT>::type
25 # define BOOST_FUSION_FOLD_IMPL_FIRST_IT_TRANSFORM(IT) fusion::prior(IT) argument
35 # define BOOST_FUSION_FOLD_IMPL_FIRST_IT_META_TRANSFORM(IT) IT argument
36 # define BOOST_FUSION_FOLD_IMPL_FIRST_IT_TRANSFORM(IT) IT argument
39 # define BOOST_FUSION_FOLD_IMPL_INVOKE_IT_META_TRANSFORM(IT) IT& argument
40 # define BOOST_FUSION_FOLD_IMPL_INVOKE_IT_TRANSFORM(IT) IT argument
42 # define BOOST_FUSION_FOLD_IMPL_INVOKE_IT_META_TRANSFORM(IT) \ argument
43 typename fusion::result_of::deref<IT>::type
44 # define BOOST_FUSION_FOLD_IMPL_INVOKE_IT_TRANSFORM(IT) fusion::deref(IT) argument
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/power/ |
| H A D | pci.rst | 34 Usually, a device is put into a low-power state when it is underutilized or
35 completely inactive. However, when it is necessary to use the device once
36 again, it has to be put back into the "fully functional" state (full-power
53 to put the device that sent it into the full-power state. However, the PCI Bus
56 It is assumed that the platform firmware will perform this task and therefore,
57 even though a PCI device is set up to generate PMEs, it also may be necessary to
63 preparing the device to generate wakeup signals. In that case, however, it
75 introduced between the PCI 2.1 and PCI 2.2 Specifications. It defined a
80 but it is mandatory for PCI Express devices. If a device supports the PCI PM
81 Spec, it has an 8 byte power management capability field in its PCI
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/host_include/openssl/ |
| H A D | bytestring.h | 31 // like TLS and ASN.1 from it.
58 // CBS_init sets |cbs| to point to |data|. It does not take ownership of
62 // CBS_skip advances |cbs| by |len| bytes. It returns one on success and zero
74 // OPENSSL_free. It returns one on success and zero on allocation failure. On
81 // with OPENSSL_free. It returns one on success and zero on allocation
93 // starting at |data|. If they're equal, it returns one, otherwise zero. If the
94 // lengths match, it uses a constant-time comparison.
98 // CBS_get_u8 sets |*out| to the next uint8_t from |cbs| and advances |cbs|. It
103 // advances |cbs|. It returns one on success and zero on error.
107 // advances |cbs|. It returns one on success and zero on error.
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/host_include/openssl/ |
| H A D | bytestring.h | 31 // like TLS and ASN.1 from it.
58 // CBS_init sets |cbs| to point to |data|. It does not take ownership of
62 // CBS_skip advances |cbs| by |len| bytes. It returns one on success and zero
74 // OPENSSL_free. It returns one on success and zero on allocation failure. On
81 // with OPENSSL_free. It returns one on success and zero on allocation
93 // starting at |data|. If they're equal, it returns one, otherwise zero. If the
94 // lengths match, it uses a constant-time comparison.
98 // CBS_get_u8 sets |*out| to the next uint8_t from |cbs| and advances |cbs|. It
103 // advances |cbs|. It returns one on success and zero on error.
107 // advances |cbs|. It returns one on success and zero on error.
[all …]
|