| /OK3568_Linux_fs/buildroot/package/odb/ |
| H A D | 0007-Switch-to-C-11-get-rid-of-auto_ptr-use.patch | 34 …traversal.hxx traversal/class-template.hxx traversal/class.hxx traversal/derived.hxx traversal/ele…
|
| /OK3568_Linux_fs/kernel/Documentation/driver-api/media/ |
| H A D | mc-core.rst | 137 Graph traversal
157 framework provides a depth-first graph traversal API for that purpose.
162 supported by the graph traversal API. To prevent infinite loops, the graph
163 traversal code limits the maximum depth to ``MEDIA_ENTITY_ENUM_MAX_DEPTH``,
166 Drivers initiate a graph traversal by calling
170 traversal at the given entity.
175 When the graph traversal is complete the function will return ``NULL``.
177 Graph traversal can be interrupted at any moment. No cleanup function call
|
| /OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/dpkg/dpkg/ |
| H A D | 0001-Dpkg-Source-Archive-Prevent-directory-traversal-for-.patch | 4 Subject: [PATCH] Dpkg::Source::Archive: Prevent directory traversal for
9 which can lead to directory traversal situations on specially crafted
31 GNU tar would do, but in addition avoiding the directory traversal issue
299 + # directory traversal.
318 + 'expected output directory is empty, directory traversal');
|
| /OK3568_Linux_fs/kernel/Documentation/admin-guide/mm/ |
| H A D | ksm.rst | 137 operations that involve traversal of the virtual mappings that
142 virtual mappings traversal could be for any given KSM
143 page. Slowing down this traversal means there will be higher
149 traversal is not affected by this parameter as these
|
| /OK3568_Linux_fs/buildroot/package/optee-benchmark/ |
| H A D | Config.in | 11 for profiling traversal and execution timings when
|
| /OK3568_Linux_fs/kernel/Documentation/RCU/ |
| H A D | listRCU.rst | 21 The traversal of the list is done using ``for_each_process()`` which is defined
56 pointers and deletion/freeing can happen in parallel with traversal of the list.
123 become list_for_each_entry_rcu(). The **_rcu()** list-traversal primitives
365 during read-side list traversal if the object in concern is pending destruction
437 The key point here is, because RCU-traversal of the ``cancel_list`` happens
438 while objects are being added and removed to the list, sometimes the traversal
|
| H A D | lockdep.rst | 104 traversal primitives check for being called from within an RCU read-side
107 traversal primitives will complain only if the lockdep expression is
|
| H A D | rculist_nulls.rst | 78 object has moved to the end of a new list, the traversal will not
81 new list and restart the list traversal. I think that this can be
|
| H A D | checklist.rst | 149 various "_rcu()" list-traversal primitives, such
152 use rcu_dereference() and the "_rcu()" list-traversal
160 list-traversal primitives can substitute for a good
301 9. All RCU list-traversal primitives, which include
311 The reason that it is permissible to use RCU list-traversal
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-devtools/pugixml/ |
| H A D | pugixml_1.12.bb | 3 DOM-like interface with rich traversal/modification capabilities, \
|
| /OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/dpkg/ |
| H A D | dpkg_1.21.4.bb | 17 file://0001-Dpkg-Source-Archive-Prevent-directory-traversal-for-.patch \
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-networking/recipes-connectivity/miniupnpd/ |
| H A D | miniupnpd_2.1.20191006.bb | 3 which provide NAT traversal services to any UPnP enabled client on \
|
| /OK3568_Linux_fs/buildroot/package/pugixml/ |
| H A D | Config.in | 9 * DOM-like interface with rich traversal/modification
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/detail/ |
| H A D | varray.hpp | 864 typedef typename boost::iterator_traversal<Iterator>::type traversal; in insert() typedef
865 this->insert_dispatch(position, first, last, traversal()); in insert()
949 typedef typename boost::iterator_traversal<Iterator>::type traversal; in assign() typedef
950 this->assign_dispatch(first, last, traversal()); // may throw in assign()
|
| /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 | traversal.hpp | 105 struct traversal struct
120 inline traversal(Geometry1 const& geometry1, Geometry2 const& geometry2, in traversal() argument
|
| H A D | traversal_ring_creator.hpp | 52 typedef traversal
|
| /OK3568_Linux_fs/kernel/scripts/coccinelle/iterators/ |
| H A D | use_after_iter.cocci | 2 /// If list_for_each_entry, etc complete a traversal of the list, the iterator
|
| /OK3568_Linux_fs/u-boot/doc/ |
| H A D | README.bcm7xxx | 11 - ext4 file system traversal
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-networking/recipes-connectivity/vpnc/vpnc/ |
| H A D | long-help | 130 This is only relevant if cisco-udp nat-traversal is used.
|
| /OK3568_Linux_fs/kernel/Documentation/RCU/Design/Memory-Ordering/ |
| H A D | Tree-RCU-Memory-Ordering.rst | 442 Note that traversal passes upwards out of a given ``rcu_node`` structure
445 CPU's traversal stops at a given ``rcu_node`` structure, then there will
446 be a later traversal by another CPU (or perhaps the same one) that
449 remainder of the second CPU's traversal. Applying this line of thought
|
| /OK3568_Linux_fs/kernel/Documentation/locking/ |
| H A D | spinlocks.rst | 84 NOTE! RCU is better for list traversal, but requires careful
|
| /OK3568_Linux_fs/kernel/fs/cramfs/ |
| H A D | README | 25 The order of inode traversal is described as "width-first" (not to be
|
| /OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/go/go-1.18/ |
| H A D | 0002-cmd-go-make-content-based-hash-generation-less-pedan.patch | 77 // as visited in a depth-first post-order traversal.
|
| /OK3568_Linux_fs/kernel/Documentation/filesystems/ |
| H A D | path-lookup.txt | 103 This ensures the RCU list traversal primitives can run over the object without
346 and link for symlink traversal requiring drop.
|
| /OK3568_Linux_fs/kernel/Documentation/networking/ |
| H A D | ipvs-sysctl.rst | 91 - 12 or more - packet traversal
|