| /OK3568_Linux_fs/kernel/include/linux/ |
| H A D | instrumented.h | 18 * Instrument a regular read access. The instrumentation should be inserted 33 * Instrument a regular write access. The instrumentation should be inserted 48 * Instrument a regular write access. The instrumentation should be inserted 63 * Instrument an atomic read access. The instrumentation should be inserted 78 * Instrument an atomic write access. The instrumentation should be inserted 94 * inserted before the actual write happens. 109 * variants). The instrumentation must be inserted before the accesses. 126 * variants). The instrumentation should be inserted before the accesses.
|
| /OK3568_Linux_fs/kernel/drivers/gpu/arm/midgard/ |
| H A D | mali_kbase_mem_profile_debugfs.h | 41 * is inserted. 46 * @param kctx The context whose debugfs file @p data should be inserted to 47 * @param data A NULL-terminated string to be inserted to the debugfs file, 50 * @return 0 if @p data inserted correctly
|
| /OK3568_Linux_fs/kernel/drivers/gpu/arm/bifrost/ |
| H A D | mali_kbase_mem_profile_debugfs.h | 44 * @kctx: The context whose debugfs file @p data should be inserted to 45 * @data: A NULL-terminated string to be inserted to the debugfs file, 50 * is inserted. 55 * Return: 0 if @p data inserted correctly, -EAGAIN in case of error
|
| /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/ |
| H A D | assoc_container.hpp | 250 /// value_types between first_it and last_it will be inserted into 258 /// last_it will be inserted into the container object. 266 /// last_it will be inserted into the container object. r_hash_fn 277 /// last_it will be inserted into the container object. r_hash_fn 290 /// last_it will be inserted into the container object. r_hash_fn 427 /// value_types between first_it and last_it will be inserted into 435 /// last_it will be inserted into the container object. r_hash_fn 444 /// last_it will be inserted into the container object. r_hash_fn 455 /// last_it will be inserted into the container object. r_hash_fn 468 /// last_it will be inserted into the container object. r_hash_fn [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/ |
| H A D | assoc_container.hpp | 250 /// value_types between first_it and last_it will be inserted into 258 /// last_it will be inserted into the container object. 266 /// last_it will be inserted into the container object. r_hash_fn 277 /// last_it will be inserted into the container object. r_hash_fn 290 /// last_it will be inserted into the container object. r_hash_fn 427 /// value_types between first_it and last_it will be inserted into 435 /// last_it will be inserted into the container object. r_hash_fn 444 /// last_it will be inserted into the container object. r_hash_fn 455 /// last_it will be inserted into the container object. r_hash_fn 468 /// last_it will be inserted into the container object. r_hash_fn [all …]
|
| /OK3568_Linux_fs/kernel/drivers/pci/hotplug/ |
| H A D | cpci_hotplug_core.c | 292 * INS bits of the cold-inserted devices. 328 int inserted; in check_slots() local 337 extracted = inserted = 0; in check_slots() 346 warn("slot %s already inserted", in check_slots() 348 inserted++; in check_slots() 353 dbg("%s - slot %s inserted", __func__, slot_name(slot)); in check_slots() 386 inserted++; in check_slots() 419 dbg("inserted=%d, extracted=%d, extracting=%d", in check_slots() 420 inserted, extracted, atomic_read(&extracting)); in check_slots() 421 if (inserted || extracted) in check_slots()
|
| /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/bits/ |
| H A D | unordered_set.h | 365 * to the possibly inserted element, and the second is a bool in _GLIBCXX_VISIBILITY() 366 * that is true if the element was actually inserted. in _GLIBCXX_VISIBILITY() 370 * element is only inserted if it is not already present in the in _GLIBCXX_VISIBILITY() 383 * element should be inserted. in _GLIBCXX_VISIBILITY() 385 * inserted. in _GLIBCXX_VISIBILITY() 409 * @param __x Element to be inserted. in _GLIBCXX_VISIBILITY() 411 * to the possibly inserted element, and the second is a bool in _GLIBCXX_VISIBILITY() 412 * that is true if the element was actually inserted. in _GLIBCXX_VISIBILITY() 416 * inserted if it is not already present in the %unordered_set. in _GLIBCXX_VISIBILITY() 433 * element should be inserted. in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | stl_multiset.h | 446 * inserted. in _GLIBCXX_VISIBILITY() 447 * @return An iterator that points to the inserted element. in _GLIBCXX_VISIBILITY() 451 * multiple copies of the same element can be inserted. in _GLIBCXX_VISIBILITY() 463 * element should be inserted. in _GLIBCXX_VISIBILITY() 465 * inserted. in _GLIBCXX_VISIBILITY() 466 * @return An iterator that points to the inserted element. in _GLIBCXX_VISIBILITY() 470 * multiple copies of the same element can be inserted. in _GLIBCXX_VISIBILITY() 492 * @param __x Element to be inserted. in _GLIBCXX_VISIBILITY() 493 * @return An iterator that points to the inserted element. in _GLIBCXX_VISIBILITY() 497 * multiple copies of the same element can be inserted. in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | unordered_map.h | 375 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 376 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 381 * inserted if its first element (the key) is not already present in the in _GLIBCXX_VISIBILITY() 396 * should be inserted. in _GLIBCXX_VISIBILITY() 457 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 458 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 463 * inserted if its first element (the key) is not already present in the in _GLIBCXX_VISIBILITY() 465 * If a %pair is not inserted, this function has no effect. in _GLIBCXX_VISIBILITY() 509 * should be inserted. in _GLIBCXX_VISIBILITY() 565 * @param __x Pair to be inserted (see std::make_pair for easy in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | stl_map.h | 564 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 565 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 569 * A %map relies on unique keys and thus a %pair is only inserted if its in _GLIBCXX_VISIBILITY() 583 * should be inserted. in _GLIBCXX_VISIBILITY() 678 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 679 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 683 * A %map relies on unique keys and thus a %pair is only inserted if its in _GLIBCXX_VISIBILITY() 685 * If a %pair is not inserted, this function has no effect. in _GLIBCXX_VISIBILITY() 726 * pair should be inserted. in _GLIBCXX_VISIBILITY() 788 * @param __x Pair to be inserted (see std::make_pair for easy in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | stl_multimap.h | 480 * @return An iterator that points to the inserted (key,value) pair. in _GLIBCXX_VISIBILITY() 485 * thus multiple pairs with the same key can be inserted. in _GLIBCXX_VISIBILITY() 498 * should be inserted. in _GLIBCXX_VISIBILITY() 502 * @return An iterator that points to the inserted (key,value) pair. in _GLIBCXX_VISIBILITY() 506 * thus multiple pairs with the same key can be inserted. in _GLIBCXX_VISIBILITY() 527 * @param __x Pair to be inserted (see std::make_pair for easy creation in _GLIBCXX_VISIBILITY() 529 * @return An iterator that points to the inserted (key,value) pair. in _GLIBCXX_VISIBILITY() 533 * thus multiple pairs with the same key can be inserted. in _GLIBCXX_VISIBILITY() 559 * pair should be inserted. in _GLIBCXX_VISIBILITY() 560 * @param __x Pair to be inserted (see std::make_pair for easy creation in _GLIBCXX_VISIBILITY() [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/bits/ |
| H A D | unordered_set.h | 365 * to the possibly inserted element, and the second is a bool in _GLIBCXX_VISIBILITY() 366 * that is true if the element was actually inserted. in _GLIBCXX_VISIBILITY() 370 * element is only inserted if it is not already present in the in _GLIBCXX_VISIBILITY() 383 * element should be inserted. in _GLIBCXX_VISIBILITY() 385 * inserted. in _GLIBCXX_VISIBILITY() 409 * @param __x Element to be inserted. in _GLIBCXX_VISIBILITY() 411 * to the possibly inserted element, and the second is a bool in _GLIBCXX_VISIBILITY() 412 * that is true if the element was actually inserted. in _GLIBCXX_VISIBILITY() 416 * inserted if it is not already present in the %unordered_set. in _GLIBCXX_VISIBILITY() 433 * element should be inserted. in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | stl_multiset.h | 446 * inserted. in _GLIBCXX_VISIBILITY() 447 * @return An iterator that points to the inserted element. in _GLIBCXX_VISIBILITY() 451 * multiple copies of the same element can be inserted. in _GLIBCXX_VISIBILITY() 463 * element should be inserted. in _GLIBCXX_VISIBILITY() 465 * inserted. in _GLIBCXX_VISIBILITY() 466 * @return An iterator that points to the inserted element. in _GLIBCXX_VISIBILITY() 470 * multiple copies of the same element can be inserted. in _GLIBCXX_VISIBILITY() 492 * @param __x Element to be inserted. in _GLIBCXX_VISIBILITY() 493 * @return An iterator that points to the inserted element. in _GLIBCXX_VISIBILITY() 497 * multiple copies of the same element can be inserted. in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | unordered_map.h | 375 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 376 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 381 * inserted if its first element (the key) is not already present in the in _GLIBCXX_VISIBILITY() 396 * should be inserted. in _GLIBCXX_VISIBILITY() 457 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 458 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 463 * inserted if its first element (the key) is not already present in the in _GLIBCXX_VISIBILITY() 465 * If a %pair is not inserted, this function has no effect. in _GLIBCXX_VISIBILITY() 509 * should be inserted. in _GLIBCXX_VISIBILITY() 565 * @param __x Pair to be inserted (see std::make_pair for easy in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | stl_map.h | 564 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 565 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 569 * A %map relies on unique keys and thus a %pair is only inserted if its in _GLIBCXX_VISIBILITY() 583 * should be inserted. in _GLIBCXX_VISIBILITY() 678 * to the possibly inserted pair, and the second is a bool that in _GLIBCXX_VISIBILITY() 679 * is true if the pair was actually inserted. in _GLIBCXX_VISIBILITY() 683 * A %map relies on unique keys and thus a %pair is only inserted if its in _GLIBCXX_VISIBILITY() 685 * If a %pair is not inserted, this function has no effect. in _GLIBCXX_VISIBILITY() 726 * pair should be inserted. in _GLIBCXX_VISIBILITY() 788 * @param __x Pair to be inserted (see std::make_pair for easy in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | stl_multimap.h | 480 * @return An iterator that points to the inserted (key,value) pair. in _GLIBCXX_VISIBILITY() 485 * thus multiple pairs with the same key can be inserted. in _GLIBCXX_VISIBILITY() 498 * should be inserted. in _GLIBCXX_VISIBILITY() 502 * @return An iterator that points to the inserted (key,value) pair. in _GLIBCXX_VISIBILITY() 506 * thus multiple pairs with the same key can be inserted. in _GLIBCXX_VISIBILITY() 527 * @param __x Pair to be inserted (see std::make_pair for easy creation in _GLIBCXX_VISIBILITY() 529 * @return An iterator that points to the inserted (key,value) pair. in _GLIBCXX_VISIBILITY() 533 * thus multiple pairs with the same key can be inserted. in _GLIBCXX_VISIBILITY() 559 * pair should be inserted. in _GLIBCXX_VISIBILITY() 560 * @param __x Pair to be inserted (see std::make_pair for easy creation in _GLIBCXX_VISIBILITY() [all …]
|
| /OK3568_Linux_fs/kernel/sound/oss/dmasound/ |
| H A D | Kconfig | 12 inserted in and removed from the running kernel whenever you 26 inserted in and removed from the running kernel whenever you 40 inserted in and removed from the running kernel whenever you
|
| /OK3568_Linux_fs/kernel/fs/xfs/ |
| H A D | xfs_extfree_item.h | 25 * and EFD being committed and unpinned. This ensures the EFI is inserted into 35 * inserted to the AIL or in the event of failure along the way (e.g., commit 45 * of commit failure or log I/O errors. Note that the EFD is not inserted in the
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/util/ |
| H A D | i18n.hpp | 9 /** Returns whether a line break can be inserted after the character indicated 17 /** Returns whether a line break can be inserted after any character in the 22 /** Returns whether a line break can be inserted after the character indicated
|
| /OK3568_Linux_fs/kernel/block/ |
| H A D | mq-deadline-cgroup.h | 12 * @inserted: Number of inserted requests. 18 local_t inserted; member
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/algorithm/string/ |
| H A D | erase.hpp | 44 \return An output iterator pointing just after the last inserted character or 113 \return An output iterator pointing just after the last inserted character or 181 \return An output iterator pointing just after the last inserted character or 251 \return An output iterator pointing just after the last inserted character or 319 \return An output iterator pointing just after the last inserted character or 392 \return An output iterator pointing just after the last inserted character or 467 \return An output iterator pointing just after the last inserted character or 544 \return An output iterator pointing just after the last inserted character or 612 \return An output iterator pointing just after the last inserted character or 686 \return An output iterator pointing just after the last inserted character or [all …]
|
| H A D | replace.hpp | 47 \return An output iterator pointing just after the last inserted character or 125 \return An output iterator pointing just after the last inserted character or 200 \return An output iterator pointing just after the last inserted character or 278 \return An output iterator pointing just after the last inserted character or 353 \return An output iterator pointing just after the last inserted character or 433 \return An output iterator pointing just after the last inserted character or 515 \return An output iterator pointing just after the last inserted character or 598 \return An output iterator pointing just after the last inserted character or 673 \return An output iterator pointing just after the last inserted character or 755 \return An output iterator pointing just after the last inserted character or [all …]
|
| /OK3568_Linux_fs/kernel/Documentation/driver-api/driver-model/ |
| H A D | binding.rst | 17 inserted into the end of this list. The bus object also contains a 19 for a driver, it is inserted at the end of this list. These are the 56 When a driver is attached to a device, the device is inserted into the
|
| /OK3568_Linux_fs/kernel/fs/reiserfs/ |
| H A D | tail_conversion.c | 38 * new indirect item to be inserted or key in direct2indirect() 45 /* Handle on an unformatted node that will be inserted in the tree. */ in direct2indirect() 68 "pasted or inserted byte exists in " in direct2indirect() 197 * inserted successfully inode is left locked. Return value is always 308 * We have inserted new direct item and must remove last in indirect2direct()
|
| /OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/bus/ |
| H A D | qcom,ebi2.txt | 79 the data bus. They are inserted when reading one CS and switching to another 83 inserted after every write minimum 1. The data out is driven from the time 86 - qcom,xmem-write-delta-cycles: initial latency for write cycles inserted for 88 - qcom,xmem-read-delta-cycles: initial latency for read cycles inserted for the
|