/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/wpa_supplicant/ |
H A D | mesh_mpm.c | 175 for (sta = hapd->sta_list; sta; sta = sta->next) { in llid_in_use()
|
H A D | p2p_supplicant_sd.c | 600 adv_data; adv_data = adv_data->next) { in wpas_sd_req_asp()
|
/kernel/linux/linux-5.10/drivers/net/ethernet/intel/i40e/ |
H A D | i40e_main.c | 354 return; /* don't do any new action before the next timeout */ in i40e_tx_timeout() 1819 /* find the next higher power-of-2 of num queue pairs */ in i40e_vsi_setup_queue_map_mqprio() 1986 /* find the next higher power-of-2 of num queue pairs */ in i40e_vsi_setup_queue_map() 2153 * i40e_next_entry - Get the next non-broadcast filter from a list 2154 * @next: pointer to filter in list 2156 * Returns the next non-broadcast filter in the list. Required so that we 2161 struct i40e_new_mac_filter *i40e_next_filter(struct i40e_new_mac_filter *next) in i40e_next_filter() argument 2163 hlist_for_each_entry_continue(next, hlist) { in i40e_next_filter() 2164 if (!is_broadcast_ether_addr(next->f->macaddr)) in i40e_next_filter() 2165 return next; in i40e_next_filter() 4824 u32 next; i40e_vsi_free_irq() local [all...] |
/kernel/linux/linux-6.6/drivers/net/ethernet/intel/i40e/ |
H A D | i40e_main.c | 357 return; /* don't do any new action before the next timeout */ in i40e_tx_timeout() 1940 /* find the next higher power-of-2 of num queue pairs */ in i40e_vsi_setup_queue_map_mqprio() 2107 /* find the next higher power-of-2 of num queue pairs */ in i40e_vsi_setup_queue_map() 2274 * i40e_next_filter - Get the next non-broadcast filter from a list 2275 * @next: pointer to filter in list 2277 * Returns the next non-broadcast filter in the list. Required so that we 2282 struct i40e_new_mac_filter *i40e_next_filter(struct i40e_new_mac_filter *next) in i40e_next_filter() argument 2284 hlist_for_each_entry_continue(next, hlist) { in i40e_next_filter() 2285 if (!is_broadcast_ether_addr(next->f->macaddr)) in i40e_next_filter() 2286 return next; in i40e_next_filter() 5022 u32 next; i40e_vsi_free_irq() local [all...] |
/third_party/typescript/lib/ |
H A D | typingsInstaller.js | 44 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; 49 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; 91 // eslint-disable-next-line @typescript-eslint/no-inferrable-types 113 // eslint-disable-next-line local/no-in-operator 127 // eslint-disable-next-line local/no-in-operator 211 var iterResult = iter.next(); 225 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) { 245 next: function () { 448 next [all...] |
H A D | tsc.js | 44 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; 49 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; 161 var iterResult = iter.next(); 175 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) { 195 next: function () { 384 next: function () { 385 var iterRes = iter.next(); 462 var first = iter.next(); 468 next [all...] |
H A D | typescript.js | 43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; 48 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; 101 // eslint-disable-next-line @typescript-eslint/no-inferrable-types 123 // eslint-disable-next-line local/no-in-operator 137 // eslint-disable-next-line local/no-in-operator 221 var iterResult = iter.next(); 235 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) { 255 next: function () { 458 next [all...] |
H A D | typescriptServices.js | 43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; 48 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; 101 // eslint-disable-next-line @typescript-eslint/no-inferrable-types 123 // eslint-disable-next-line local/no-in-operator 137 // eslint-disable-next-line local/no-in-operator 221 var iterResult = iter.next(); 235 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) { 255 next: function () { 458 next [all...] |
/device/soc/rockchip/common/kernel/drivers/net/wireless/rockchip_wlan/rkwifi/bcmdhd_wifi6/ |
H A D | dhd_linux.c | 217 * created in kernel notifier link list (with 'next' pointing to itself) 229 * created in kernel notifier link list (with 'next' pointing to itself) 917 * created in kernel notifier link list (with 'next' pointing to itself) 1174 dhd_sta_t *sta, *next; in dhd_if_del_sta_list() local 1182 list_for_each_entry_safe(sta, next, &ifp->sta_list, list) { in dhd_if_del_sta_list() 1405 dhd_sta_t *sta, *next; in dhd_del_all_sta() local 1418 list_for_each_entry_safe(sta, next, &ifp->sta_list, list) { in dhd_del_all_sta() 1443 dhd_sta_t *sta, *next; in dhd_del_sta() local 1457 list_for_each_entry_safe(sta, next, &ifp->sta_list, list) { in dhd_del_sta() 1528 dhd_sta_t *sta, *next; in dhd_sta_list_snapshot_free() local [all...] |
/kernel/linux/linux-5.10/drivers/net/wireless/ath/ath10k/ |
H A D | mac.c | 1587 const u8 *next; in ath10k_mac_remove_vendor_ie() local 1602 next = ie + len; in ath10k_mac_remove_vendor_ie() 1604 if (WARN_ON(next > end)) in ath10k_mac_remove_vendor_ie() 1607 memmove(ie, next, end - next); in ath10k_mac_remove_vendor_ie() 4383 * next scan request is submitted. in ath10k_scan_stop() 6771 goto next; in ath10k_mac_bitrate_mask_get_single_rate() 6806 next: in ath10k_mac_bitrate_mask_get_single_rate()
|
/kernel/linux/linux-6.6/drivers/net/wireless/ath/ath10k/ |
H A D | mac.c | 1598 const u8 *next; in ath10k_mac_remove_vendor_ie() local 1613 next = ie + len; in ath10k_mac_remove_vendor_ie() 1615 if (WARN_ON(next > end)) in ath10k_mac_remove_vendor_ie() 1618 memmove(ie, next, end - next); in ath10k_mac_remove_vendor_ie() 4566 * next scan request is submitted. in ath10k_scan_stop() 6920 goto next; in ath10k_mac_bitrate_mask_get_single_rate() 6955 next: in ath10k_mac_bitrate_mask_get_single_rate()
|
/kernel/linux/linux-6.6/drivers/net/ethernet/sun/ |
H A D | niu.c | 38 /* This driver wants to store a link to a "next page" within the 52 struct page *next; /* alias of "mapping" */ member 55 #define niu_next_page(p) container_of(p, union niu_page, page)->next 3540 struct page *next = niu_next_page(page); in niu_rbr_free() local 3550 page = next; in niu_rbr_free() 6462 struct page *next = niu_next_page(page); in niu_reset_buffers() local 6466 page = next; in niu_reset_buffers() 10198 offsetof(union niu_page, next)); in niu_init()
|
/third_party/node/test/fixtures/snapshot/ |
H A D | typescript.js | 43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; 48 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; 103 return { key: key, value: value, next: undefined, prev: undefined }; 119 // Entries without a 'prev' have been removed from the map. Their 'next' 123 entry = entry.next; 147 data.tail.next = entry; 160 if (entry.next) { 161 entry.next.prev = entry.prev; 164 // an entry in the map without a 'next' pointer must be the 'tail'. 169 entry.prev.next [all...] |
/third_party/node/deps/v8/src/api/ |
H A D | api.cc | 729 RegisteredExtension* next = re->next(); in UnregisterAll() local 731 re = next; in UnregisterAll() 934 prev_next_ = current->next; in Initialize() 987 current->limit = current->next; in SealHandleScope() 994 DCHECK_EQ(current->next, current->limit); in ~SealHandleScope() 5564 // units until the buffer capacity is reached, would be exceeded by the next in Unaligned() 9370 // provide a bigger one next time. We do it this way because allocation is not in CopyCodePages() 10543 FullObjectSlot(handle_scope_data_.next)); in IterateThis() 10603 ph->block_next_ = isolate()->handle_scope_data()->next; in DetachPersistent() [all...] |
/kernel/linux/linux-5.10/drivers/scsi/qla2xxx/ |
H A D | qla_os.c | 3613 BUG_ON(base_vha->list.next == &ha->vp_list); in qla2x00_delete_all_vps() 3816 struct list_head *item, *next; in qla24xx_free_purex_list() local 3820 list_for_each_safe(item, next, &list->head) { in qla24xx_free_purex_list() 6246 struct purex_item *item, *next; in qla24xx_process_purex_list() local 6253 list_for_each_entry_safe(item, next, &head, list) { in qla24xx_process_purex_list() 6786 * - NO-OP -- await next ISP-ABORT. Preferred method in qla2x00_do_dpc()
|
/kernel/linux/linux-5.10/drivers/message/fusion/ |
H A D | mptbase.c | 911 mf = list_entry(ioc->FreeQ.next, MPT_FRAME_HDR, in mpt_get_msg_frame() 1124 * @next: nextChainOffset value (u32's) 1125 * @length: length of next SGL segment 1130 mpt_add_chain(void *pAddr, u8 next, u16 length, dma_addr_t dma_addr) in mpt_add_chain() argument 1136 pChain->NextChainOffset = next; in mpt_add_chain() 1144 * @next: nextChainOffset value (u32's) 1145 * @length: length of next SGL segment 1150 mpt_add_chain_64bit(void *pAddr, u8 next, u16 length, dma_addr_t dma_addr) in mpt_add_chain_64bit() argument 1159 pChain->NextChainOffset = next; in mpt_add_chain_64bit()
|
/kernel/linux/linux-6.6/drivers/message/fusion/ |
H A D | mptbase.c | 907 mf = list_entry(ioc->FreeQ.next, MPT_FRAME_HDR, in mpt_get_msg_frame() 1120 * @next: nextChainOffset value (u32's) 1121 * @length: length of next SGL segment 1126 mpt_add_chain(void *pAddr, u8 next, u16 length, dma_addr_t dma_addr) in mpt_add_chain() argument 1132 pChain->NextChainOffset = next; in mpt_add_chain() 1140 * @next: nextChainOffset value (u32's) 1141 * @length: length of next SGL segment 1146 mpt_add_chain_64bit(void *pAddr, u8 next, u16 length, dma_addr_t dma_addr) in mpt_add_chain_64bit() argument 1155 pChain->NextChainOffset = next; in mpt_add_chain_64bit()
|
/kernel/linux/linux-6.6/drivers/android/ |
H A D | binder.c | 468 BUG_ON(work->entry.next && !list_empty(&work->entry)); in binder_enqueue_work_ilocked() 1646 struct binder_transaction *next; in binder_send_failed_reply() local 1681 next = t->from_parent; in binder_send_failed_reply() 1688 if (next == NULL) { in binder_send_failed_reply() 1693 t = next; in binder_send_failed_reply() 3388 * Copy the source user buffer up to the next object in binder_transaction() 3419 * Set offset to the next buffer fragment to be in binder_transaction() 3828 * If buffer for an async transaction, enqueue the next async
|
/kernel/linux/linux-6.6/drivers/scsi/qla2xxx/ |
H A D | qla_os.c | 3787 BUG_ON(base_vha->list.next == &ha->vp_list); in qla2x00_delete_all_vps() 3989 struct purex_item *item, *next; in qla24xx_free_purex_list() local 3993 list_for_each_entry_safe(item, next, &list->head, list) { in qla24xx_free_purex_list() 6489 struct purex_item *item, *next; in qla24xx_process_purex_list() local 6496 list_for_each_entry_safe(item, next, &head, list) { in qla24xx_process_purex_list() 7033 * - NO-OP -- await next ISP-ABORT. Preferred method in qla2x00_do_dpc()
|
/third_party/node/deps/ada/ |
H A D | ada.h | 5539 // Trailing index is always the next character of the current one. 5885 // This next line is required for when parsing a URL like `foo://` in update_base_hostname() 6643 // next line could overflow but unsigned arithmetic has well-defined in set_protocol_as_file() 6840 * Return the next item in the iterator or std::nullopt if done. 6842 inline std::optional<T> next(); 6998 params.erase(std::remove_if(std::next(it), params.end(), find), in set() 7051 inline std::optional<std::string_view> url_search_params_keys_iter::next() { in next() function in ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::url_search_params_keys_iter 7057 inline std::optional<std::string_view> url_search_params_values_iter::next() { in next() function in ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::url_search_params_values_iter 7064 url_search_params_entries_iter::next() { in next() function in ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::url_search_params_entries_iter
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 264 /// As we scan instructions optimizing them, this is the next instruction 578 for (auto &Block : llvm::make_range(std::next(F.begin()), F.end())) in eliminateFallThrough() 655 for (auto &Block : llvm::make_range(std::next(F.begin()), F.end())) in eliminateMostlyEmptyBlocks() 5468 NewBaseInsertPt = std::next(BaseI->getIterator()); in splitLargeGEPOffsets() 5934 CurInstIterator = std::next(And->getIterator()); in optimizeLoadExt() 6072 CurInstIterator = std::next(LastSI->getIterator()); in optimizeSelectInst() 6214 // Instruct OptimizeBlock to skip to the next block. in optimizeSelectInst()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/ |
H A D | MipsISelLowering.cpp | 1275 MIB = BuildMI(MBB, std::next(I), MI.getDebugLoc(), in insertDivByZeroTrap() 1765 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitAtomicBinaryPartword() 1949 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitAtomicCmpSwapPartword() 2294 // Increment the pointer, VAList, to the next vaarg. in lowerVAARG() 2933 // Allocate int register and shadow next int register. If first in CC_MipsO32() 2999 // Return next O32 integer argument register. 4578 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitPseudoSELECT() 4655 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitPseudoD_SELECT()
|
/foundation/graphic/graphic_2d/rosen/modules/render_service_base/src/pipeline/ |
H A D | rs_render_node.cpp | 243 children_.emplace(std::next(children_.begin(), index), child); in AddChild() 283 children_.emplace(std::next(children_.begin(), index), child); in MoveChild() 435 children_.emplace(std::next(children_.begin(), index), child); in AddCrossParentChild() 1186 // Check the next frame's VSync has been requested. If there is no request, add another VSync request in FallbackAnimationsToRoot() 2143 // force update if no next vsync when skip-frame enabled in MarkFilterCacheFlags()
|
/kernel/linux/linux-5.10/drivers/infiniband/hw/hns/ |
H A D | hns_roce_hw_v1.c | 92 for (nreq = 0; wr; ++nreq, wr = wr->next) { in hns_roce_v1_post_send() 362 for (nreq = 0; wr; ++nreq, wr = wr->next) { in hns_roce_v1_post_recv() 1059 send_wr.next = NULL; in hns_roce_v1_send_lp_wqe() 2025 * that match our QP by overwriting them with next entries. in __hns_roce_v1_cq_clean() 2151 * flags = 0; Notification Flag = 1, next in hns_roce_v1_req_notify_cq()
|
/kernel/linux/linux-5.10/drivers/infiniband/hw/qedr/ |
H A D | verbs.c | 660 /* If the given pbl is full storing the pbes, move to next pbl. in qedr_populate_pbls() 3794 wr = wr->next; in qedr_post_send() 3895 * next 4 bytes. in qedr_post_srq_recv() 3902 wr = wr->next; in qedr_post_srq_recv() 4005 wr = wr->next; in qedr_post_recv() 4485 * but chain already point to the next INVALID one in qedr_poll_cq()
|