Searched refs:chain (Results 1 - 20 of 20) sorted by relevance

/darwin-on-arm/xnu/bsd/netkey/
H A Dkeydb.h55 LIST_ENTRY(secashead) chain; member in struct:secashead
66 /* SA chain */
77 LIST_ENTRY(secasvar) chain; member in struct:secasvar
128 LIST_ENTRY(secreg) chain; member in struct:secreg
136 LIST_ENTRY(secacq) chain; member in struct:secacq
H A Dkey.c331 (!((elm)->chain.le_next == NULL && (elm)->chain.le_prev == NULL))
683 LIST_FOREACH(sp, &sptree[dir], chain) {
737 LIST_FOREACH(sp, &sptree[dir], chain) {
877 LIST_FOREACH(sah, &sahtree, chain) {
947 nextsav = LIST_NEXT(sav, chain);
1284 LIST_FOREACH(sah, &sahtree, chain) {
1340 nextsav = LIST_NEXT(currsav, chain);
1562 LIST_REMOVE(sp, chain);
1597 LIST_FOREACH(sp, &sptree[spidx->dir], chain) {
[all...]
/darwin-on-arm/xnu/bsd/netinet/
H A Dip_encap.h66 LIST_ENTRY(encaptab) chain; member in struct:encaptab
H A Dip_encap.c194 for (ep = LIST_FIRST(&encaptab); ep; ep = LIST_NEXT(ep, chain)) {
290 for (ep = LIST_FIRST(&encaptab); ep; ep = LIST_NEXT(ep, chain)) {
337 LIST_INSERT_HEAD(&encaptab, ep, chain);
372 for (ep = LIST_FIRST(&encaptab); ep; ep = LIST_NEXT(ep, chain)) {
461 for (p = LIST_FIRST(&encaptab); p; p = LIST_NEXT(p, chain)) {
463 LIST_REMOVE(p, chain);
H A Dip_fw2_compat.h123 struct ip_fw_chain_compat *chain ; /* pointer to parent rule */ member in struct:ipfw_dyn_rule_compat
229 user32_addr_t chain ; /* pointer to parent rule */ member in struct:ipfw_dyn_rule_compat_32
243 user64_addr_t chain ; /* pointer to parent rule */ member in struct:ipfw_dyn_rule_compat_64
274 #define IP_FW_F_COMMAND_COMPAT 0x000000ff /* Mask for type of chain entry: */
446 #define IP_OLD_FW_F_COMMAND 0x000000ff /* Mask for type of chain entry: */
H A Dip_fw.h189 struct ip_fw_chain *chain ; /* pointer to parent rule */ member in struct:ipfw_dyn_rule
201 #define IP_FW_F_COMMAND 0x000000ff /* Mask for type of chain entry: */
H A Dtcp_output.c1390 * to m_copym_with_hdrs are still valid... if the head of the socket chain has
1391 * changed (due to an incoming ACK for instance), or the offset into the chain we
1986 boolean_t chain; local
2075 * Don't send down a chain of packets when:
2081 chain = tcp_packet_chaining > 1
2094 if (!chain) {
2102 * down to IP, the head of the chain might change and
2119 if (chain || error) {
2121 * If we sent down a chain then we are done since
2123 * we need to free the rest of the chain ourselve
[all...]
H A Dip_fw2.c152 MALLOC_DEFINE(M_IPFW, "IpFw/IpAcct", "IpFw/IpAcct chain's");
719 dyn_rule_vers1->chain = (user32_addr_t)(p->rule->rulenum);
754 dyn_rule_vers1->chain = (user64_addr_t) p->rule->rulenum;
1265 * unlink a dynamic rule from a chain. prev is a pointer to
1539 * the third parameter is the parent rule and not the chain.
2001 * Clear packet chain if we find one here.
2867 print_chain(struct ip_fw **chain) argument
2869 struct ip_fw *rule = *chain;
2976 * Deletes all rules from a chain (except rules in set RESVD_SET
2981 free_chain(struct ip_fw **chain, in argument
3020 del_entry(struct ip_fw **chain, u_int32_t arg) argument
[all...]
/darwin-on-arm/xnu/iokit/Kernel/
H A DIOPMPowerStateQueue.cpp78 queue_enter(&queueHead, entry, PowerEventEntry *, chain);
93 queue_remove_first(&queueHead, entry, PowerEventEntry *, chain);
H A DIOPMPowerStateQueue.h44 queue_chain_t chain; member in struct:IOPMPowerStateQueue::PowerEventEntry
H A DIOServicePrivate.h114 queue_chain_t chain; member in class:_IOServiceInterestNotifier
H A DIOService.cpp1432 queue_element(entry, notify, _IOServiceInterestNotifier *, chain);
1544 enqueue(&notifyList->fCommandChain, &notify->chain);
1568 queue_element(entry, notify, _IOServiceInterestNotifier *, chain);
1622 if( queue_next( &chain )) {
1623 remqueue(&chain);
1624 queue_next( &chain) = queue_prev( &chain) = 0;
H A DIOPMrootDomain.cpp236 queue_chain_t chain; member in struct:AggressivesRequest
1473 queue_iterate(&aggressivesQueue, entry, AggressivesRequest *, chain)
1488 queue_enter(&aggressivesQueue, request, AggressivesRequest *, chain);
1538 queue_iterate(&aggressivesQueue, entry, AggressivesRequest *, chain)
1616 queue_enter(&aggressivesQueue, request, AggressivesRequest *, chain);
1670 queue_remove_first(&aggressivesQueue, request, AggressivesRequest *, chain);
1746 queue_enter(&joinedQueue, request, AggressivesRequest *, chain);
1817 queue_remove_first(joinedQueue, request, AggressivesRequest *, chain);
/darwin-on-arm/xnu/bsd/netinet6/
H A Dip6_fw.c129 MALLOC_DEFINE(M_IP6FW, "Ip6Fw/Ip6Acct", "Ip6Fw/Ip6Acct chain's");
561 struct ip6_fw_chain *chain; local
579 * Go down the chain, looking for enlightment
584 chain = LIST_FIRST(&ip6_fw_chain);
589 while (chain && (chain->rule->fw_number <= skipto)) {
590 chain = LIST_NEXT(chain, chain);
592 if (! chain) got
[all...]
H A Dipsec.h80 LIST_ENTRY(secpolicy) chain; member in struct:secpolicy
111 /* If NULL, it means the end of chain. */
128 LIST_ENTRY(secspacq) chain; member in struct:secspacq
H A Dip6_fw.h238 LIST_ENTRY(ip6_fw_chain) chain; member in struct:ip6_fw_chain
250 #define IPV6_FW_F_COMMAND 0x0070 /* Mask for type of chain entry: */
/darwin-on-arm/xnu/bsd/net/
H A Dkpi_protocol.c51 int chain; member in struct:proto_input_entry
138 entry->chain = chains;
247 if (entry->chain) {
289 if (entry->chain) {
H A Dif_utun_crypto.h263 LIST_ENTRY(utun_crypto_keys) chain; member in struct:utun_crypto_keys
271 LIST_HEAD(chain, utun_crypto_keys) keys_listhead;
H A Dif_utun_crypto.c240 LIST_INSERT_HEAD(&crypto_ctx->keys_listhead, crypto_keys, chain);
309 nxt_crypto_keys = (__typeof__(nxt_crypto_keys))LIST_NEXT(cur_crypto_keys, chain);
317 LIST_REMOVE(cur_crypto_keys, chain);
H A Dif_utun_crypto_ipsec.c222 nextsav = LIST_NEXT(sav, chain);
396 nextsav = LIST_NEXT(sav, chain);
598 nxt_crypto_keys = (__typeof__(nxt_crypto_keys))LIST_NEXT(cur_crypto_keys, chain);
612 LIST_REMOVE(cur_crypto_keys, chain);
732 // split the mbuf chain to put the ip header and payloads in separate mbufs
799 // split the mbuf chain to put the ip header and payloads in separate mbufs
828 // split the mbuf chain to put the ip header and payloads in separate mbufs
896 // split the mbuf chain to put the ip header and payloads in separate mbufs

Completed in 183 milliseconds