/kernel/linux/linux-6.6/drivers/gpu/drm/i915/gt/ |
H A D | intel_gt_buffer_pool.c | 45 struct list_head *list = &pool->cache_list[n]; in pool_free_older_than() local 47 if (list_empty(list)) in pool_free_older_than() 54 list_for_each_prev(pos, list) { in pool_free_older_than() 70 if (!list_is_last(pos, list)) in pool_free_older_than() 71 __list_del_many(pos, list); in pool_free_older_than() 76 active |= !list_empty(list); in pool_free_older_than() 104 struct list_head *list = bucket_for_size(pool, node->obj->base.size); in pool_retire() local 117 list_add_rcu(&node->link, list); in pool_retire() 176 struct list_head *list; in intel_gt_get_buffer_pool() local 180 list in intel_gt_get_buffer_pool() [all...] |
/kernel/linux/linux-6.6/tools/testing/radix-tree/ |
H A D | linux.c | 121 void kmem_cache_free_bulk(struct kmem_cache *cachep, size_t size, void **list) in kmem_cache_free_bulk() argument 124 pr_debug("Bulk free %p[0-%lu]\n", list, size - 1); in kmem_cache_free_bulk() 128 kmem_cache_free_locked(cachep, list[i]); in kmem_cache_free_bulk() 214 void *list[12]; in test_kmem_cache_bulk() local 224 list[i] = kmem_cache_alloc(test_cache, __GFP_DIRECT_RECLAIM); in test_kmem_cache_bulk() 227 kmem_cache_free(test_cache, list[i]); in test_kmem_cache_bulk() 230 kmem_cache_alloc_bulk(test_cache, __GFP_DIRECT_RECLAIM, 5, list); in test_kmem_cache_bulk() 231 kmem_cache_free_bulk(test_cache, 5, list); in test_kmem_cache_bulk() 234 list[i] = kmem_cache_alloc(test_cache, __GFP_DIRECT_RECLAIM); in test_kmem_cache_bulk() 237 kmem_cache_free(test_cache, list[ in test_kmem_cache_bulk() [all...] |
/third_party/libwebsockets/lib/tls/mbedtls/ |
H A D | mbedtls-session.c | 28 lws_dll2_t list; member 44 (unsigned int)(ts->list.owner->count - 1)); in __lws_tls_session_destroy() 48 lws_dll2_remove(&ts->list); /* vh lock */ in __lws_tls_session_destroy() 58 lws_tls_scm_t *ts = lws_container_of(p, lws_tls_scm_t, list); in __lws_tls_session_lookup_by_name() 103 /* keep our session list sorted in lru -> mru order */ in lws_tls_reuse_session() 105 lws_dll2_remove(&ts->list); in lws_tls_reuse_session() 106 lws_dll2_add_tail(&ts->list, &wsi->a.vhost->tls_sessions); in lws_tls_reuse_session() 131 lws_tls_scm_t *ts = lws_container_of(d, lws_tls_scm_t, list); in lws_tls_session_destroy_dll() 149 struct lws_vhost *vh = lws_container_of(ts->list.owner, in lws_tls_session_expiry_cb() 203 lws_tls_scm_t, list); in lws_tls_session_new_mbedtls() [all...] |
/third_party/ltp/tools/sparse/sparse-src/ |
H A D | sort.c | 78 a = l->list[0]; in verify_seq_sorted() 88 b = l->list[i]; in verify_seq_sorted() 100 memcpy ((b)->list, buffer, nr * sizeof (void *)); \ 108 memcpy ((b)->list, buffer, nbuf * sizeof (void *)); \ 115 // of the merged list. 227 struct ptr_list *head = *plist, *list = head; in sort_list() local 235 array_sort(list->list, list->nr, cmp); in sort_list() 237 verify_seq_sorted (list, in sort_list() [all...] |
/third_party/node/deps/v8/src/heap/ |
H A D | objects-visiting.cc | 28 Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) { in VisitWeakList() argument 34 while (list != undefined) { in VisitWeakList() 35 // Check whether to keep the candidate in the list. in VisitWeakList() 36 T candidate = T::cast(list); in VisitWeakList() 38 Object retained = retainer->RetainAs(list); in VisitWeakList() 41 list = WeakListVisitor<T>::WeakNext(candidate); in VisitWeakList() 45 // First element in the list. in VisitWeakList() 48 // Subsequent elements in the list. in VisitWeakList() 72 // Terminate the list if there is one or more elements. in VisitWeakList() 78 static void ClearWeakList(Heap* heap, Object list) { in ClearWeakList() argument [all...] |
/kernel/linux/linux-5.10/drivers/usb/gadget/function/ |
H A D | f_printer.c | 25 #include <linux/list.h> 267 list_del_init(&req->list); /* Remode from Active List */ in rx_complete() 274 list_add_tail(&req->list, &dev->rx_buffers); in rx_complete() 277 list_add(&req->list, &dev->rx_reqs); in rx_complete() 285 list_add(&req->list, &dev->rx_reqs); in rx_complete() 291 list_add(&req->list, &dev->rx_reqs); in rx_complete() 300 list_add(&req->list, &dev->rx_reqs); in rx_complete() 324 /* Take the request struct off the active list and put it on the in tx_complete() 325 * free list. in tx_complete() 327 list_del_init(&req->list); in tx_complete() [all...] |
/kernel/linux/linux-6.6/tools/testing/selftests/netfilter/ |
H A D | nft_nat.sh | 86 ip netns exec $ns nft list counter inet filter $counter 1>&2 94 cnt=$(ip netns exec $ns nft list counter inet filter ns0in | grep -q "packets 1 bytes 84") 99 cnt=$(ip netns exec $ns nft list counter inet filter ns0out | grep -q "packets 1 bytes 84") 106 cnt=$(ip netns exec $ns nft list counter inet filter ns0in6 | grep -q "$expect") 111 cnt=$(ip netns exec $ns nft list counter inet filter ns0out6 | grep -q "$expect") 125 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0in | grep -q "packets 0 bytes 0") 131 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0in6 | grep -q "packets 0 bytes 0") 137 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0out | grep -q "packets 0 bytes 0") 142 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0out6 | grep -q "packets 0 bytes 0") 150 cnt=$(ip netns exec "$ns0" nft list counte [all...] |
/foundation/arkui/ace_engine/frameworks/core/common/lru/ |
H A D | count_limit_lru.h | 19 #include <list> 39 static void CacheWithCountLimitLRU(const std::string& key, const T& cacheObj, std::list<CacheNode<T>>& cacheList, 40 std::unordered_map<std::string, typename std::list<CacheNode<T>>::iterator>& cache, 44 static T GetCacheObjWithCountLimitLRU(const std::string& key, std::list<CacheNode<T>>& cacheList, 45 std::unordered_map<std::string, typename std::list<CacheNode<T>>::iterator>& cache); 48 static void RemoveCacheObjFromCountLimitLRU(const std::string& key, std::list<CacheNode<T>>& cacheList, 49 std::unordered_map<std::string, typename std::list<CacheNode<T>>::iterator>& cache);
|
/foundation/resourceschedule/ffrt/src/sched/ |
H A D | task_runqueue.h | 36 LinkedList list; member in ffrt::RunQueue 45 list.PushBack(entry->node); 51 if (list.Empty()) { 54 auto node = list.PopFront(); 76 list.PushBack(*node); 82 list.Delete(*node); 88 return list.Empty();
|
/foundation/communication/netmanager_base/interfaces/innerkits/netconnclient/include/ |
H A D | http_proxy.h | 20 #include <list> 35 HttpProxy(std::string host, uint16_t port, const std::list<std::string> &exclusionList); 39 [[nodiscard]] std::list<std::string> GetExclusionList() const; 52 void inline SetExclusionList(const std::list<std::string> &list) in SetExclusionList() argument 54 exclusionList_ = list; in SetExclusionList() 75 std::list<std::string> exclusionList_;
|
/foundation/distributeddatamgr/kv_store/frameworks/innerkitsimpl/distributeddatafwk/src/ |
H A D | kvstore_observer_nb_impl.h | 19 #include <list> 40 std::list<DistributedDB::Entry> insertList = data.GetEntriesInserted(); in OnChange() 41 std::list<DistributedDB::Entry> updateList = data.GetEntriesUpdated(); in OnChange() 42 std::list<DistributedDB::Entry> deletedList = data.GetEntriesDeleted(); in OnChange() 44 std::list<Entry> insertListTmp; in OnChange() 45 std::list<Entry> updateListTmp; in OnChange() 46 std::list<Entry> deletedListTmp; in OnChange()
|
/kernel/linux/linux-5.10/drivers/net/phy/ |
H A D | mii_timestamper.c | 13 struct list_head list; member 35 INIT_LIST_HEAD(&desc->list); in register_mii_tstamp_controller() 40 list_add_tail(&mii_timestamping_devices, &desc->list); in register_mii_tstamp_controller() 59 desc = list_entry(this, struct mii_timestamping_desc, list); in unregister_mii_tstamp_controller() 61 list_del_init(&desc->list); in unregister_mii_tstamp_controller() 87 desc = list_entry(this, struct mii_timestamping_desc, list); in register_mii_timestamper() 123 desc = list_entry(this, struct mii_timestamping_desc, list); in unregister_mii_timestamper()
|
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/aio_suspend/ |
H A D | 3-1.c | 12 * The list array may contain NULL pointers which are ignored. 17 * - prepare suspend list with NULL pointers 18 * - call aio_suspend with this list 48 const struct aiocb *list[NENT]; in main() local 80 memset(&list, 0, sizeof(list)); in main() 81 list[2] = &aiocb[0]; in main() 82 list[5] = &aiocb[1]; in main() 83 list[6] = &aiocb[2]; in main() 85 if (aio_suspend(list, NEN in main() [all...] |
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/unittest/common/interfaces/ |
H A D | distributeddb_interfaces_query_test.cpp | 29 bool CheckQueryContainer(Query &query, std::list<QueryObjNode> &checkList) in CheckQueryContainer() 31 const std::list<QueryObjNode> queryList = GetQueryInfo::GetQueryExpression(query).GetQueryExpression(); in CheckQueryContainer() 53 std::list<QueryObjNode> CreateCheckList(QueryObjType operFlag, const std::string &fieldName, const T &queryValue) in CreateCheckList() 59 std::list<QueryObjNode> result{{operFlag, fieldName, QueryValueType::VALUE_TYPE_BOOL, values}}; in CreateCheckList() 62 std::list<QueryObjNode> result{{operFlag, fieldName, QueryValueType::VALUE_TYPE_INTEGER, values}}; in CreateCheckList() 65 std::list<QueryObjNode> result{{operFlag, fieldName, QueryValueType::VALUE_TYPE_LONG, values}}; in CreateCheckList() 68 std::list<QueryObjNode> result{{operFlag, fieldName, QueryValueType::VALUE_TYPE_DOUBLE, values}}; in CreateCheckList() 71 std::list<QueryObjNode> result{{operFlag, fieldName, QueryValueType::VALUE_TYPE_STRING, values}}; in CreateCheckList() 74 std::list<QueryObjNode> result{{operFlag, fieldName, QueryValueType::VALUE_TYPE_INVALID, values}}; in CreateCheckList() 82 std::list<QueryObjNod in CheckQueryCompareOper() [all...] |
/kernel/linux/linux-5.10/drivers/gpu/drm/omapdrm/dss/ |
H A D | base.c | 9 #include <linux/list.h> 56 list_add_tail(&dssdev->list, &omapdss_devices_list); in omapdss_device_register() 64 list_del(&dssdev->list); in omapdss_device_unregister() 76 list_for_each_entry(dssdev, &omapdss_devices_list, list) { in omapdss_device_is_registered() 112 list_for_each_entry(dssdev, &omapdss_devices_list, list) { in omapdss_find_device_by_node() 127 struct list_head *list; in omapdss_device_next_output() local 140 list = from ? &from->list : &omapdss_devices_list; in omapdss_device_next_output() 142 list_for_each_entry(dssdev, list, list) { in omapdss_device_next_output() 270 struct list_head list; global() member [all...] |
/third_party/libdrm/freedreno/kgsl/ |
H A D | kgsl_pipe.c | 124 /* add buffer to submit list when it is referenced in cmdstream: */ 130 struct list_head *list = &kgsl_bo->list[pipe->id]; in kgsl_pipe_add_submit() local 131 if (LIST_IS_EMPTY(list)) { in kgsl_pipe_add_submit() 134 list_del(list); in kgsl_pipe_add_submit() 136 list_addtail(list, &kgsl_pipe->submit_list); in kgsl_pipe_add_submit() 139 /* prepare buffers on submit list before flush: */ 148 LIST_FOR_EACH_ENTRY(kgsl_bo, &kgsl_pipe->submit_list, list[pipe->id]) { in kgsl_pipe_pre_submit() 155 /* process buffers on submit list after flush: */ 162 LIST_FOR_EACH_ENTRY_SAFE(kgsl_bo, tmp, &kgsl_pipe->submit_list, list[pip in kgsl_pipe_post_submit() 163 struct list_head *list = &kgsl_bo->list[pipe->id]; kgsl_pipe_post_submit() local 182 struct list_head *list = &kgsl_bo->list[pipe->id]; kgsl_pipe_process_pending() local [all...] |
/third_party/python/Lib/test/ |
H A D | test_shlex.py | 195 result = list(s) 211 result = list(s) 226 result = list(s) 239 result = list(s) 248 result = list(s) 253 result = list(s) 280 self.assertEqual(list(s), ['a', '_', 'b', '__', 'c']) 287 self.assertEqual(list(s), ['a', '&&', 'b', '|', '|', 'c']) 292 self.assertEqual(list(s), ['a', '&&', 'b', '||', 'c']) 298 self.assertEqual(list( [all...] |
/kernel/linux/linux-5.10/include/linux/ |
H A D | rhashtable.h | 10 * Rewritten with rehash code from br_multicast plus single list 37 * of the right list. 465 * This hash chain list-traversal primitive allows for the looped code to 466 * remove the loop cursor from the list. 484 * This hash chain list-traversal primitive may safely run concurrently with 500 * This hash chain list-traversal primitive may safely run concurrently with 519 * This hash chain list-traversal primitive may safely run concurrently with 537 * This hash chain list-traversal primitive may safely run concurrently with 547 * rhl_for_each_rcu - iterate over rcu hash table list 549 * @list 734 struct rhlist_head *list; __rhashtable_insert_fast() local 781 struct rhlist_head *list; __rhashtable_insert_fast() local 848 rhltable_insert_key( struct rhltable *hlt, const void *key, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert_key() argument 871 rhltable_insert( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert() argument 1005 struct rhlist_head *list; __rhashtable_remove_fast_one() local 1130 rhltable_remove( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_remove() argument [all...] |
/kernel/linux/linux-6.6/include/linux/ |
H A D | rhashtable.h | 10 * Rewritten with rehash code from br_multicast plus single list 37 * of the right list. 473 * This hash chain list-traversal primitive allows for the looped code to 474 * remove the loop cursor from the list. 492 * This hash chain list-traversal primitive may safely run concurrently with 508 * This hash chain list-traversal primitive may safely run concurrently with 527 * This hash chain list-traversal primitive may safely run concurrently with 545 * This hash chain list-traversal primitive may safely run concurrently with 555 * rhl_for_each_rcu - iterate over rcu hash table list 557 * @list 743 struct rhlist_head *list; __rhashtable_insert_fast() local 790 struct rhlist_head *list; __rhashtable_insert_fast() local 857 rhltable_insert_key( struct rhltable *hlt, const void *key, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert_key() argument 880 rhltable_insert( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert() argument 1015 struct rhlist_head *list; __rhashtable_remove_fast_one() local 1140 rhltable_remove( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_remove() argument [all...] |
/kernel/liteos_a/kernel/extended/plimit/ |
H A D | los_devicelimit.c | 7 * 1. Redistributions of source code must retain the above copyright notice, this list of 10 * 2. Redistributions in binary form must reproduce the above copyright notice, this list 68 LOS_DL_LIST_FOR_EACH_ENTRY_SAFE(delItem, tmpItem, &devLimit->accessList, DevAccessItem, list) { in DevAccessListDelete() 69 LOS_ListDelete(&delItem->list); in DevAccessListDelete() 90 LOS_DL_LIST_FOR_EACH_ENTRY(tmpItem, &devLimitSrc->accessList, DevAccessItem, list) { in DevLimitCopyAccess() 96 LOS_ListTailInsert(&devLimitDest->accessList, &newItem->list); in DevLimitCopyAccess() 234 STATIC BOOL DevLimitMatchItemPartial(LOS_DL_LIST *list, DevAccessItem *item) in DevLimitMatchItemPartial() argument 236 if ((list == NULL) || (item == NULL)) { in DevLimitMatchItemPartial() 239 if (LOS_ListEmpty(list)) { in DevLimitMatchItemPartial() 243 LOS_DL_LIST_FOR_EACH_ENTRY(walk, list, DevAccessIte in DevLimitMatchItemPartial() 267 DevLimitMatchItem(LOS_DL_LIST *list, DevAccessItem *item) DevLimitMatchItem() argument [all...] |
/third_party/node/deps/v8/src/zone/ |
H A D | zone-chunk-list.h | 21 // A zone-backed hybrid of a vector and a linked list. Use it if you need a 31 // This list will maintain a doubly-linked list of chunks. When a chunk is 44 // The list will not allocate a starting chunk. Use if you expect your 45 // list to remain empty in many cases. 47 // The list will start with a small initial chunk. Subsequent chunks will 50 // The list will start with one chunk at maximum size. Use this if you 51 // expect your list to contain many items to avoid growing chunks. 75 // Will push a separate chunk to the front of the chunk-list. 81 // Cuts the last list element 217 Begin(ChunkList* list) Begin() argument 234 End(ChunkList* list) End() argument [all...] |
/third_party/node/test/cctest/ |
H A D | test_util.cc | 21 List list; in TEST() local 22 EXPECT_TRUE(list.IsEmpty()); in TEST() 27 list.PushBack(&one); in TEST() 28 EXPECT_FALSE(list.IsEmpty()); in TEST() 32 List::Iterator it = list.begin(); in TEST() 33 EXPECT_NE(list.end(), it); in TEST() 36 EXPECT_FALSE(it != list.end()); // Iterator only implements != operator. in TEST() 40 list.PushBack(&two); in TEST() 43 List::Iterator it = list.begin(); in TEST() 44 EXPECT_NE(list in TEST() [all...] |
/kernel/linux/linux-6.6/drivers/usb/gadget/function/ |
H A D | f_printer.c | 25 #include <linux/list.h> 272 list_del_init(&req->list); /* Remode from Active List */ in rx_complete() 279 list_add_tail(&req->list, &dev->rx_buffers); in rx_complete() 282 list_add(&req->list, &dev->rx_reqs); in rx_complete() 290 list_add(&req->list, &dev->rx_reqs); in rx_complete() 296 list_add(&req->list, &dev->rx_reqs); in rx_complete() 305 list_add(&req->list, &dev->rx_reqs); in rx_complete() 329 /* Take the request struct off the active list and put it on the in tx_complete() 330 * free list. in tx_complete() 332 list_del_init(&req->list); in tx_complete() [all...] |
/foundation/communication/netmanager_base/test/netcommon/unittest/net_common_test/ |
H A D | net_manager_center_test.cpp | 48 inline int32_t GetIfaceNames(NetBearType bearerType, std::list<std::string> &ifaceNames) override 148 std::list<std::string> list; in HWTEST_F() local 149 std::for_each(BEAR_TYPE_LIST.begin(), BEAR_TYPE_LIST.end(), [this, &list](const auto &type) { in HWTEST_F() 150 int32_t ret = instance_.GetIfaceNames(type, list); in HWTEST_F() 151 std::cout << "TYPE:" << type << "LIST_SIZE:" << list.size() << std::endl; in HWTEST_F() 153 EXPECT_TRUE(list.empty()); in HWTEST_F() 154 list.clear(); in HWTEST_F() 160 std::list<std::string> list; in HWTEST_F() local 170 std::list<std::string> list; HWTEST_F() local 184 std::list<std::string> list; HWTEST_F() local 475 std::list<std::string> list; HWTEST_F() local [all...] |
/foundation/communication/dsoftbus/components/nstackx/nstackx_core/dfile/core/ |
H A D | nstackx_file_list.c | 35 if (!(fileList->list[0].flags & NSTACKX_FLAGS_FILE_NAME_ACK)) { in FileListAllFileNameAcked() 44 if (!(fileList->list[i].flags & NSTACKX_FLAGS_FILE_NAME_ACK)) { in FileListAllFileNameAcked() 67 if (!(fileList->list[0].flags & NSTACKX_FLAGS_FILE_NAME_RECEIVED)) { in FileListAllFileNameReceived() 76 if (!(fileList->list[i].flags & NSTACKX_FLAGS_FILE_NAME_RECEIVED)) { in FileListAllFileNameReceived() 90 if (!(fileList->list[0].flags & NSTACKX_FLAGS_FILE_RECEIVE_SUCCESS)) { in FileListAllFileReceived() 98 if (!(fileList->list[i].flags & NSTACKX_FLAGS_FILE_RECEIVE_SUCCESS)) { in FileListAllFileReceived() 119 if (fileList->list != NULL) { in FileListSetSendFileList() 120 DFILE_LOGE(TAG, "invalid fileList->list"); in FileListSetSendFileList() 154 fileList->list = entryList; in FileListSetSendFileList() 159 /* Something wrong, clear file list */ in FileListSetSendFileList() [all...] |