Lines Matching refs:node
48 #include "node.h"
56 * @max: largest 'upper' in this node subtree
57 * @local_publ: list of identical publications made from this node
59 * @all_publ: all publications identical to this one, whatever node and scope
121 * @n: the root node of service range rbtree for searching
125 * Return: the leftmost service range node in the rbtree that overlaps the
141 /* A leftmost overlap range node must be one in the left
149 /* No one in the left subtree can match, return if this node is
171 * @n: a node in service range rbtree from which the searching starts
175 * Return: the next service range node to the given node in the rbtree that
187 /* A next overlap range node must be one in the right
189 * successor (- an ancestor) of this node cannot
195 * ancestor of this node which is parent of a left-hand child.
337 u32 node = p->sk.node;
351 if (_p->key == key && (!_p->sk.node || _p->sk.node == node)) {
354 node, p->sk.ref, key);
359 if (in_own_node(net, p->sk.node))
388 u32 node = sk->node;
391 if (p->key != key || (node && node != p->sk.node))
543 sk->node, sk->ref, key);
554 * On entry, a non-zero 'sk->node' indicates the node where we want lookup to be
559 * - If lookup is deferred to another node, leave 'sk->node' unchanged and
561 * - If lookup is successful, set the 'sk->node' and 'sk->ref' (== portid) which
565 * Note that for legacy users (node configured with Z.C.N address format) the
566 * 'closest-first' lookup algorithm must be maintained, i.e., if sk.node is 0
583 if (!tipc_in_scope(legacy, sk->node, self))
594 if (sk->node == self) {
600 } else if (legacy && !sk->node && !list_empty(&r->local_publ)) {
625 * destination socket/node pairs matching the given address.
654 if (p->sk.ref == exclude && p->sk.node == self)
656 tipc_dest_push(dsts, p->sk.node, p->sk.ref);
670 /* tipc_nametbl_lookup_mcast_sockets(): look up node local destinaton sockets
701 * the given address. Used in sending node.
703 * Returns a list of nodes, including own node if applicable
720 tipc_nlist_add(nodes, p->sk.node);
749 tipc_group_add_member(grp, p->sk.node, p->sk.ref,
1003 if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_NODE, p->sk.node))
1141 struct tipc_dest *tipc_dest_find(struct list_head *l, u32 node, u32 port)
1146 if (dst->node == node && dst->port == port)
1152 bool tipc_dest_push(struct list_head *l, u32 node, u32 port)
1156 if (tipc_dest_find(l, node, port))
1162 dst->node = node;
1168 bool tipc_dest_pop(struct list_head *l, u32 *node, u32 *port)
1177 if (node)
1178 *node = dst->node;
1184 bool tipc_dest_del(struct list_head *l, u32 node, u32 port)
1188 dst = tipc_dest_find(l, node, port);