2 * Copyright (c) 1996-1999 Whistle Communications, Inc.
5 * Subject to the following obligations and disclaimer of warranty, use and
6 * redistribution of this software, in source or object code forms, with or
7 * without modifications are expressly permitted by Whistle Communications;
8 * provided, however, that:
9 * 1. Any and all reproductions of the source or object code must include the
10 * copyright notice above and the following disclaimer of warranties; and
11 * 2. No rights are granted, in any manner or form, to use Whistle
12 * Communications, Inc. trademarks, including the mark "WHISTLE
13 * COMMUNICATIONS" on advertising, endorsements, or otherwise except as
14 * such appears in the above copyright notice or in the software.
16 * THIS SOFTWARE IS BEING PROVIDED BY WHISTLE COMMUNICATIONS "AS IS", AND
17 * TO THE MAXIMUM EXTENT PERMITTED BY LAW, WHISTLE COMMUNICATIONS MAKES NO
18 * REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, REGARDING THIS SOFTWARE,
19 * INCLUDING WITHOUT LIMITATION, ANY AND ALL IMPLIED WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT.
21 * WHISTLE COMMUNICATIONS DOES NOT WARRANT, GUARANTEE, OR MAKE ANY
22 * REPRESENTATIONS REGARDING THE USE OF, OR THE RESULTS OF THE USE OF THIS
23 * SOFTWARE IN TERMS OF ITS CORRECTNESS, ACCURACY, RELIABILITY OR OTHERWISE.
24 * IN NO EVENT SHALL WHISTLE COMMUNICATIONS BE LIABLE FOR ANY DAMAGES
25 * RESULTING FROM OR ARISING OUT OF ANY USE OF THIS SOFTWARE, INCLUDING
26 * WITHOUT LIMITATION, ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
27 * PUNITIVE, OR CONSEQUENTIAL DAMAGES, PROCUREMENT OF SUBSTITUTE GOODS OR
28 * SERVICES, LOSS OF USE, DATA OR PROFITS, HOWEVER CAUSED AND UNDER ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 * THIS SOFTWARE, EVEN IF WHISTLE COMMUNICATIONS IS ADVISED OF THE POSSIBILITY
34 * Authors: Julian Elischer <julian@freebsd.org>
35 * Archie Cobbs <archie@freebsd.org>
38 * $Whistle: ng_base.c,v 1.39 1999/01/28 23:54:53 julian Exp $
42 * This file implements the base netgraph code.
45 #include <sys/param.h>
46 #include <sys/systm.h>
47 #include <sys/ctype.h>
50 #include <sys/kernel.h>
51 #include <sys/kthread.h>
53 #include <sys/limits.h>
55 #include <sys/malloc.h>
58 #include <sys/epoch.h>
59 #include <sys/queue.h>
60 #include <sys/refcount.h>
61 #include <sys/rwlock.h>
63 #include <sys/sysctl.h>
64 #include <sys/syslog.h>
65 #include <sys/unistd.h>
66 #include <machine/cpu.h>
69 #include <machine/stack.h>
71 #include <net/netisr.h>
74 #include <netgraph/ng_message.h>
75 #include <netgraph/netgraph.h>
76 #include <netgraph/ng_parse.h>
78 MODULE_VERSION(netgraph, NG_ABI_VERSION);
80 /* Mutex to protect topology events. */
81 static struct rwlock ng_topo_lock;
82 #define TOPOLOGY_RLOCK() rw_rlock(&ng_topo_lock)
83 #define TOPOLOGY_RUNLOCK() rw_runlock(&ng_topo_lock)
84 #define TOPOLOGY_WLOCK() rw_wlock(&ng_topo_lock)
85 #define TOPOLOGY_WUNLOCK() rw_wunlock(&ng_topo_lock)
86 #define TOPOLOGY_NOTOWNED() rw_assert(&ng_topo_lock, RA_UNLOCKED)
89 static struct mtx ng_nodelist_mtx; /* protects global node/hook lists */
90 static struct mtx ngq_mtx; /* protects the queue item list */
92 static SLIST_HEAD(, ng_node) ng_allnodes;
93 static LIST_HEAD(, ng_node) ng_freenodes; /* in debug, we never free() them */
94 static SLIST_HEAD(, ng_hook) ng_allhooks;
95 static LIST_HEAD(, ng_hook) ng_freehooks; /* in debug, we never free() them */
97 static void ng_dumpitems(void);
98 static void ng_dumpnodes(void);
99 static void ng_dumphooks(void);
101 #endif /* NETGRAPH_DEBUG */
103 * DEAD versions of the structures.
104 * In order to avoid races, it is sometimes necessary to point
105 * at SOMETHING even though theoretically, the current entity is
106 * INVALID. Use these to avoid these races.
108 struct ng_type ng_deadtype = {
112 NULL, /* constructor */
119 NULL, /* disconnect */
123 struct ng_node ng_deadnode = {
130 LIST_HEAD_INITIALIZER(ng_deadnode.nd_hooks),
131 {}, /* all_nodes list entry */
132 {}, /* id hashtable list entry */
135 {}, /* should never use! (should hang) */
136 {}, /* workqueue entry */
137 STAILQ_HEAD_INITIALIZER(ng_deadnode.nd_input_queue.queue),
141 #ifdef NETGRAPH_DEBUG
146 #endif /* NETGRAPH_DEBUG */
149 struct ng_hook ng_deadhook = {
152 HK_INVALID | HK_DEAD,
153 0, /* undefined data link type */
154 &ng_deadhook, /* Peer is self */
155 &ng_deadnode, /* attached to deadnode */
157 NULL, /* override rcvmsg() */
158 NULL, /* override rcvdata() */
159 1, /* refs always >= 1 */
160 #ifdef NETGRAPH_DEBUG
165 #endif /* NETGRAPH_DEBUG */
169 * END DEAD STRUCTURES
171 /* List nodes with unallocated work */
172 static STAILQ_HEAD(, ng_node) ng_worklist = STAILQ_HEAD_INITIALIZER(ng_worklist);
173 static struct mtx ng_worklist_mtx; /* MUST LOCK NODE FIRST */
175 /* List of installed types */
176 static LIST_HEAD(, ng_type) ng_typelist;
177 static struct rwlock ng_typelist_lock;
178 #define TYPELIST_RLOCK() rw_rlock(&ng_typelist_lock)
179 #define TYPELIST_RUNLOCK() rw_runlock(&ng_typelist_lock)
180 #define TYPELIST_WLOCK() rw_wlock(&ng_typelist_lock)
181 #define TYPELIST_WUNLOCK() rw_wunlock(&ng_typelist_lock)
183 /* Hash related definitions. */
184 LIST_HEAD(nodehash, ng_node);
185 VNET_DEFINE_STATIC(struct nodehash *, ng_ID_hash);
186 VNET_DEFINE_STATIC(u_long, ng_ID_hmask);
187 VNET_DEFINE_STATIC(u_long, ng_nodes);
188 VNET_DEFINE_STATIC(struct nodehash *, ng_name_hash);
189 VNET_DEFINE_STATIC(u_long, ng_name_hmask);
190 VNET_DEFINE_STATIC(u_long, ng_named_nodes);
191 #define V_ng_ID_hash VNET(ng_ID_hash)
192 #define V_ng_ID_hmask VNET(ng_ID_hmask)
193 #define V_ng_nodes VNET(ng_nodes)
194 #define V_ng_name_hash VNET(ng_name_hash)
195 #define V_ng_name_hmask VNET(ng_name_hmask)
196 #define V_ng_named_nodes VNET(ng_named_nodes)
198 static struct rwlock ng_idhash_lock;
199 #define IDHASH_RLOCK() rw_rlock(&ng_idhash_lock)
200 #define IDHASH_RUNLOCK() rw_runlock(&ng_idhash_lock)
201 #define IDHASH_WLOCK() rw_wlock(&ng_idhash_lock)
202 #define IDHASH_WUNLOCK() rw_wunlock(&ng_idhash_lock)
204 /* Method to find a node.. used twice so do it here */
205 #define NG_IDHASH_FN(ID) ((ID) % (V_ng_ID_hmask + 1))
206 #define NG_IDHASH_FIND(ID, node) \
208 rw_assert(&ng_idhash_lock, RA_LOCKED); \
209 LIST_FOREACH(node, &V_ng_ID_hash[NG_IDHASH_FN(ID)], \
211 if (NG_NODE_IS_VALID(node) \
212 && (NG_NODE_ID(node) == ID)) { \
218 static struct rwlock ng_namehash_lock;
219 #define NAMEHASH_RLOCK() rw_rlock(&ng_namehash_lock)
220 #define NAMEHASH_RUNLOCK() rw_runlock(&ng_namehash_lock)
221 #define NAMEHASH_WLOCK() rw_wlock(&ng_namehash_lock)
222 #define NAMEHASH_WUNLOCK() rw_wunlock(&ng_namehash_lock)
224 /* Internal functions */
225 static int ng_add_hook(node_p node, const char *name, hook_p * hookp);
226 static int ng_generic_msg(node_p here, item_p item, hook_p lasthook);
227 static ng_ID_t ng_decodeidname(const char *name);
228 static int ngb_mod_event(module_t mod, int event, void *data);
229 static void ng_worklist_add(node_p node);
230 static void ngthread(void *);
231 static int ng_apply_item(node_p node, item_p item, int rw);
232 static void ng_flush_input_queue(node_p node);
233 static node_p ng_ID2noderef(ng_ID_t ID);
234 static int ng_con_nodes(item_p item, node_p node, const char *name,
235 node_p node2, const char *name2);
236 static int ng_con_part2(node_p node, item_p item, hook_p hook);
237 static int ng_con_part3(node_p node, item_p item, hook_p hook);
238 static int ng_mkpeer(node_p node, const char *name, const char *name2,
240 static void ng_name_rehash(void);
241 static void ng_ID_rehash(void);
243 /* Imported, these used to be externally visible, some may go back. */
244 void ng_destroy_hook(hook_p hook);
245 int ng_path2noderef(node_p here, const char *path,
246 node_p *dest, hook_p *lasthook);
247 int ng_make_node(const char *type, node_p *nodepp);
248 int ng_path_parse(char *addr, char **node, char **path, char **hook);
249 void ng_rmnode(node_p node, hook_p dummy1, void *dummy2, int dummy3);
250 void ng_unname(node_p node);
252 /* Our own netgraph malloc type */
253 MALLOC_DEFINE(M_NETGRAPH, "netgraph", "netgraph structures and ctrl messages");
254 MALLOC_DEFINE(M_NETGRAPH_MSG, "netgraph_msg", "netgraph name storage");
255 static MALLOC_DEFINE(M_NETGRAPH_HOOK, "netgraph_hook",
256 "netgraph hook structures");
257 static MALLOC_DEFINE(M_NETGRAPH_NODE, "netgraph_node",
258 "netgraph node structures");
259 static MALLOC_DEFINE(M_NETGRAPH_ITEM, "netgraph_item",
260 "netgraph item structures");
262 /* Should not be visible outside this file */
264 #define _NG_ALLOC_HOOK(hook) \
265 hook = malloc(sizeof(*hook), M_NETGRAPH_HOOK, M_NOWAIT | M_ZERO)
266 #define _NG_ALLOC_NODE(node) \
267 node = malloc(sizeof(*node), M_NETGRAPH_NODE, M_NOWAIT | M_ZERO)
269 #define NG_QUEUE_LOCK_INIT(n) \
270 mtx_init(&(n)->q_mtx, "ng_node", NULL, MTX_DEF)
271 #define NG_QUEUE_LOCK(n) \
272 mtx_lock(&(n)->q_mtx)
273 #define NG_QUEUE_UNLOCK(n) \
274 mtx_unlock(&(n)->q_mtx)
275 #define NG_WORKLIST_LOCK_INIT() \
276 mtx_init(&ng_worklist_mtx, "ng_worklist", NULL, MTX_DEF)
277 #define NG_WORKLIST_LOCK() \
278 mtx_lock(&ng_worklist_mtx)
279 #define NG_WORKLIST_UNLOCK() \
280 mtx_unlock(&ng_worklist_mtx)
281 #define NG_WORKLIST_SLEEP() \
282 mtx_sleep(&ng_worklist, &ng_worklist_mtx, PI_NET, "sleep", 0)
283 #define NG_WORKLIST_WAKEUP() \
284 wakeup_one(&ng_worklist)
286 #ifdef NETGRAPH_DEBUG /*----------------------------------------------*/
289 * In an attempt to help track reference count screwups
290 * we do not free objects back to the malloc system, but keep them
291 * in a local cache where we can examine them and keep information safely
292 * after they have been freed.
293 * We use this scheme for nodes and hooks, and to some extent for items.
295 static __inline hook_p
299 SLIST_ENTRY(ng_hook) temp;
300 mtx_lock(&ng_nodelist_mtx);
301 hook = LIST_FIRST(&ng_freehooks);
303 LIST_REMOVE(hook, hk_hooks);
304 bcopy(&hook->hk_all, &temp, sizeof(temp));
305 bzero(hook, sizeof(struct ng_hook));
306 bcopy(&temp, &hook->hk_all, sizeof(temp));
307 mtx_unlock(&ng_nodelist_mtx);
308 hook->hk_magic = HK_MAGIC;
310 mtx_unlock(&ng_nodelist_mtx);
311 _NG_ALLOC_HOOK(hook);
313 hook->hk_magic = HK_MAGIC;
314 mtx_lock(&ng_nodelist_mtx);
315 SLIST_INSERT_HEAD(&ng_allhooks, hook, hk_all);
316 mtx_unlock(&ng_nodelist_mtx);
322 static __inline node_p
326 SLIST_ENTRY(ng_node) temp;
327 mtx_lock(&ng_nodelist_mtx);
328 node = LIST_FIRST(&ng_freenodes);
330 LIST_REMOVE(node, nd_nodes);
331 bcopy(&node->nd_all, &temp, sizeof(temp));
332 bzero(node, sizeof(struct ng_node));
333 bcopy(&temp, &node->nd_all, sizeof(temp));
334 mtx_unlock(&ng_nodelist_mtx);
335 node->nd_magic = ND_MAGIC;
337 mtx_unlock(&ng_nodelist_mtx);
338 _NG_ALLOC_NODE(node);
340 node->nd_magic = ND_MAGIC;
341 mtx_lock(&ng_nodelist_mtx);
342 SLIST_INSERT_HEAD(&ng_allnodes, node, nd_all);
343 mtx_unlock(&ng_nodelist_mtx);
349 #define NG_ALLOC_HOOK(hook) do { (hook) = ng_alloc_hook(); } while (0)
350 #define NG_ALLOC_NODE(node) do { (node) = ng_alloc_node(); } while (0)
352 #define NG_FREE_HOOK(hook) \
354 mtx_lock(&ng_nodelist_mtx); \
355 LIST_INSERT_HEAD(&ng_freehooks, hook, hk_hooks); \
356 hook->hk_magic = 0; \
357 mtx_unlock(&ng_nodelist_mtx); \
360 #define NG_FREE_NODE(node) \
362 mtx_lock(&ng_nodelist_mtx); \
363 LIST_INSERT_HEAD(&ng_freenodes, node, nd_nodes); \
364 node->nd_magic = 0; \
365 mtx_unlock(&ng_nodelist_mtx); \
368 #else /* NETGRAPH_DEBUG */ /*----------------------------------------------*/
370 #define NG_ALLOC_HOOK(hook) _NG_ALLOC_HOOK(hook)
371 #define NG_ALLOC_NODE(node) _NG_ALLOC_NODE(node)
373 #define NG_FREE_HOOK(hook) do { free((hook), M_NETGRAPH_HOOK); } while (0)
374 #define NG_FREE_NODE(node) do { free((node), M_NETGRAPH_NODE); } while (0)
376 #endif /* NETGRAPH_DEBUG */ /*----------------------------------------------*/
378 /* Set this to kdb_enter("X") to catch all errors as they occur */
383 VNET_DEFINE_STATIC(ng_ID_t, nextID) = 1;
384 #define V_nextID VNET(nextID)
387 #define CHECK_DATA_MBUF(m) do { \
392 for (total = 0, n = (m); n != NULL; n = n->m_next) { \
394 if (n->m_nextpkt != NULL) \
395 panic("%s: m_nextpkt", __func__); \
398 if ((m)->m_pkthdr.len != total) { \
399 panic("%s: %d != %d", \
400 __func__, (m)->m_pkthdr.len, total); \
404 #define CHECK_DATA_MBUF(m)
407 #define ERROUT(x) do { error = (x); goto done; } while (0)
409 /************************************************************************
410 Parse type definitions for generic messages
411 ************************************************************************/
413 /* Handy structure parse type defining macro */
414 #define DEFINE_PARSE_STRUCT_TYPE(lo, up, args) \
415 static const struct ng_parse_struct_field \
416 ng_ ## lo ## _type_fields[] = NG_GENERIC_ ## up ## _INFO args; \
417 static const struct ng_parse_type ng_generic_ ## lo ## _type = { \
418 &ng_parse_struct_type, \
419 &ng_ ## lo ## _type_fields \
422 DEFINE_PARSE_STRUCT_TYPE(mkpeer, MKPEER, ());
423 DEFINE_PARSE_STRUCT_TYPE(connect, CONNECT, ());
424 DEFINE_PARSE_STRUCT_TYPE(name, NAME, ());
425 DEFINE_PARSE_STRUCT_TYPE(rmhook, RMHOOK, ());
426 DEFINE_PARSE_STRUCT_TYPE(nodeinfo, NODEINFO, ());
427 DEFINE_PARSE_STRUCT_TYPE(typeinfo, TYPEINFO, ());
428 DEFINE_PARSE_STRUCT_TYPE(linkinfo, LINKINFO, (&ng_generic_nodeinfo_type));
430 /* Get length of an array when the length is stored as a 32 bit
431 value immediately preceding the array -- as with struct namelist
432 and struct typelist. */
434 ng_generic_list_getLength(const struct ng_parse_type *type,
435 const u_char *start, const u_char *buf)
437 return *((const u_int32_t *)(buf - 4));
440 /* Get length of the array of struct linkinfo inside a struct hooklist */
442 ng_generic_linkinfo_getLength(const struct ng_parse_type *type,
443 const u_char *start, const u_char *buf)
445 const struct hooklist *hl = (const struct hooklist *)start;
447 return hl->nodeinfo.hooks;
450 /* Array type for a variable length array of struct namelist */
451 static const struct ng_parse_array_info ng_nodeinfoarray_type_info = {
452 &ng_generic_nodeinfo_type,
453 &ng_generic_list_getLength
455 static const struct ng_parse_type ng_generic_nodeinfoarray_type = {
456 &ng_parse_array_type,
457 &ng_nodeinfoarray_type_info
460 /* Array type for a variable length array of struct typelist */
461 static const struct ng_parse_array_info ng_typeinfoarray_type_info = {
462 &ng_generic_typeinfo_type,
463 &ng_generic_list_getLength
465 static const struct ng_parse_type ng_generic_typeinfoarray_type = {
466 &ng_parse_array_type,
467 &ng_typeinfoarray_type_info
470 /* Array type for array of struct linkinfo in struct hooklist */
471 static const struct ng_parse_array_info ng_generic_linkinfo_array_type_info = {
472 &ng_generic_linkinfo_type,
473 &ng_generic_linkinfo_getLength
475 static const struct ng_parse_type ng_generic_linkinfo_array_type = {
476 &ng_parse_array_type,
477 &ng_generic_linkinfo_array_type_info
480 DEFINE_PARSE_STRUCT_TYPE(typelist, TYPELIST, (&ng_generic_typeinfoarray_type));
481 DEFINE_PARSE_STRUCT_TYPE(hooklist, HOOKLIST,
482 (&ng_generic_nodeinfo_type, &ng_generic_linkinfo_array_type));
483 DEFINE_PARSE_STRUCT_TYPE(listnodes, LISTNODES,
484 (&ng_generic_nodeinfoarray_type));
486 /* List of commands and how to convert arguments to/from ASCII */
487 static const struct ng_cmdlist ng_generic_cmds[] = {
499 &ng_generic_mkpeer_type,
506 &ng_generic_connect_type,
513 &ng_generic_name_type,
520 &ng_generic_rmhook_type,
528 &ng_generic_nodeinfo_type
535 &ng_generic_hooklist_type
542 &ng_generic_listnodes_type /* same as NGM_LISTNODES */
549 &ng_generic_listnodes_type
556 &ng_generic_typelist_type
563 &ng_parse_string_type
570 &ng_parse_string_type
576 &ng_parse_ng_mesg_type,
577 &ng_parse_ng_mesg_type
583 &ng_parse_ng_mesg_type,
584 &ng_parse_ng_mesg_type
589 /************************************************************************
591 ************************************************************************/
594 * Instantiate a node of the requested type
597 ng_make_node(const char *typename, node_p *nodepp)
599 struct ng_type *type;
602 /* Check that the type makes sense */
603 if (typename == NULL) {
608 /* Locate the node type. If we fail we return. Do not try to load
611 if ((type = ng_findtype(typename)) == NULL)
615 * If we have a constructor, then make the node and
616 * call the constructor to do type specific initialisation.
618 if (type->constructor != NULL) {
619 if ((error = ng_make_node_common(type, nodepp)) == 0) {
620 if ((error = ((*type->constructor)(*nodepp))) != 0) {
621 NG_NODE_UNREF(*nodepp);
626 * Node has no constructor. We cannot ask for one
627 * to be made. It must be brought into existence by
628 * some external agency. The external agency should
629 * call ng_make_node_common() directly to get the
630 * netgraph part initialised.
639 * Generic node creation. Called by node initialisation for externally
640 * instantiated nodes (e.g. hardware, sockets, etc ).
641 * The returned node has a reference count of 1.
644 ng_make_node_common(struct ng_type *type, node_p *nodepp)
648 /* Require the node type to have been already installed */
649 if (ng_findtype(type->name) == NULL) {
654 /* Make a node and try attach it to the type */
660 node->nd_type = type;
662 node->nd_vnet = curvnet;
664 NG_NODE_REF(node); /* note reference */
667 NG_QUEUE_LOCK_INIT(&node->nd_input_queue);
668 STAILQ_INIT(&node->nd_input_queue.queue);
669 node->nd_input_queue.q_flags = 0;
671 /* Initialize hook list for new node */
672 LIST_INIT(&node->nd_hooks);
674 /* Get an ID and put us in the hash chain. */
676 for (;;) { /* wrap protection, even if silly */
678 node->nd_ID = V_nextID++; /* 137/sec for 1 year before wrap */
680 /* Is there a problem with the new number? */
681 NG_IDHASH_FIND(node->nd_ID, node2); /* already taken? */
682 if ((node->nd_ID != 0) && (node2 == NULL)) {
687 if (V_ng_nodes * 2 > V_ng_ID_hmask)
689 LIST_INSERT_HEAD(&V_ng_ID_hash[NG_IDHASH_FN(node->nd_ID)], node,
699 * Forceably start the shutdown process on a node. Either call
700 * its shutdown method, or do the default shutdown if there is
701 * no type-specific method.
703 * We can only be called from a shutdown message, so we know we have
704 * a writer lock, and therefore exclusive access. It also means
705 * that we should not be on the work queue, but we check anyhow.
707 * Persistent node types must have a type-specific method which
708 * allocates a new node in which case, this one is irretrievably going away,
709 * or cleans up anything it needs, and just makes the node valid again,
710 * in which case we allow the node to survive.
712 * XXX We need to think of how to tell a persistent node that we
713 * REALLY need to go away because the hardware has gone or we
714 * are rebooting.... etc.
717 ng_rmnode(node_p node, hook_p dummy1, void *dummy2, int dummy3)
721 /* Check if it's already shutting down */
722 if ((node->nd_flags & NGF_CLOSING) != 0)
725 if (node == &ng_deadnode) {
726 printf ("shutdown called on deadnode\n");
730 /* Add an extra reference so it doesn't go away during this */
734 * Mark it invalid so any newcomers know not to try use it
735 * Also add our own mark so we can't recurse
736 * note that NGF_INVALID does not do this as it's also set during
739 node->nd_flags |= NGF_INVALID|NGF_CLOSING;
741 /* If node has its pre-shutdown method, then call it first*/
742 if (node->nd_type && node->nd_type->close)
743 (*node->nd_type->close)(node);
745 /* Notify all remaining connected nodes to disconnect */
746 while ((hook = LIST_FIRST(&node->nd_hooks)) != NULL)
747 ng_destroy_hook(hook);
750 * Drain the input queue forceably.
751 * it has no hooks so what's it going to do, bleed on someone?
752 * Theoretically we came here from a queue entry that was added
753 * Just before the queue was closed, so it should be empty anyway.
754 * Also removes us from worklist if needed.
756 ng_flush_input_queue(node);
758 /* Ask the type if it has anything to do in this case */
759 if (node->nd_type && node->nd_type->shutdown) {
760 (*node->nd_type->shutdown)(node);
761 if (NG_NODE_IS_VALID(node)) {
763 * Well, blow me down if the node code hasn't declared
764 * that it doesn't want to die.
765 * Presumably it is a persistent node.
766 * If we REALLY want it to go away,
767 * e.g. hardware going away,
768 * Our caller should set NGF_REALLY_DIE in nd_flags.
770 node->nd_flags &= ~(NGF_INVALID|NGF_CLOSING);
771 NG_NODE_UNREF(node); /* Assume they still have theirs */
774 } else { /* do the default thing */
778 ng_unname(node); /* basically a NOP these days */
781 * Remove extra reference, possibly the last
782 * Possible other holders of references may include
783 * timeout callouts, but theoretically the node's supposed to
784 * have cancelled them. Possibly hardware dependencies may
785 * force a driver to 'linger' with a reference.
791 * Remove a reference to the node, possibly the last.
792 * deadnode always acts as it were the last.
795 ng_unref_node(node_p node)
798 if (node == &ng_deadnode)
801 CURVNET_SET(node->nd_vnet);
803 if (refcount_release(&node->nd_refs)) { /* we were the last */
805 node->nd_type->refs--; /* XXX maybe should get types lock? */
807 if (NG_NODE_HAS_NAME(node)) {
809 LIST_REMOVE(node, nd_nodes);
815 LIST_REMOVE(node, nd_idnodes);
818 mtx_destroy(&node->nd_input_queue.q_mtx);
824 /************************************************************************
826 ************************************************************************/
828 ng_ID2noderef(ng_ID_t ID)
833 NG_IDHASH_FIND(ID, node);
841 ng_node2ID(node_cp node)
843 return (node ? NG_NODE_ID(node) : 0);
846 /************************************************************************
848 ************************************************************************/
851 * Assign a node a name.
854 ng_name_node(node_p node, const char *name)
860 /* Rename without change is a noop */
861 if (strcmp(NG_NODE_NAME(node), name) == 0)
864 /* Check the name is valid */
865 for (i = 0; i < NG_NODESIZ; i++) {
866 if (name[i] == '\0' || name[i] == '.' || name[i] == ':')
869 if (i == 0 || name[i] != '\0') {
873 if (ng_decodeidname(name) != 0) { /* valid IDs not allowed here */
879 if (V_ng_named_nodes * 2 > V_ng_name_hmask)
882 hash = hash32_str(name, HASHINIT) & V_ng_name_hmask;
883 /* Check the name isn't already being used. */
884 LIST_FOREACH(node2, &V_ng_name_hash[hash], nd_nodes)
885 if (NG_NODE_IS_VALID(node2) &&
886 (strcmp(NG_NODE_NAME(node2), name) == 0)) {
891 if (NG_NODE_HAS_NAME(node))
892 LIST_REMOVE(node, nd_nodes);
896 strlcpy(NG_NODE_NAME(node), name, NG_NODESIZ);
897 /* Update name hash. */
898 LIST_INSERT_HEAD(&V_ng_name_hash[hash], node, nd_nodes);
905 * Find a node by absolute name. The name should NOT end with ':'
906 * The name "." means "this node" and "[xxx]" means "the node
907 * with ID (ie, at address) xxx".
909 * Returns the node if found, else NULL.
910 * Eventually should add something faster than a sequential search.
911 * Note it acquires a reference on the node so you can be sure it's still
915 ng_name2noderef(node_p here, const char *name)
921 /* "." means "this node" */
922 if (strcmp(name, ".") == 0) {
927 /* Check for name-by-ID */
928 if ((temp = ng_decodeidname(name)) != 0) {
929 return (ng_ID2noderef(temp));
932 /* Find node by name. */
933 hash = hash32_str(name, HASHINIT) & V_ng_name_hmask;
935 LIST_FOREACH(node, &V_ng_name_hash[hash], nd_nodes)
936 if (NG_NODE_IS_VALID(node) &&
937 (strcmp(NG_NODE_NAME(node), name) == 0)) {
947 * Decode an ID name, eg. "[f03034de]". Returns 0 if the
948 * string is not valid, otherwise returns the value.
951 ng_decodeidname(const char *name)
953 const int len = strlen(name);
957 /* Check for proper length, brackets, no leading junk */
958 if ((len < 3) || (name[0] != '[') || (name[len - 1] != ']') ||
959 (!isxdigit(name[1])))
963 val = strtoul(name + 1, &eptr, 16);
964 if ((eptr - name != len - 1) || (val == ULONG_MAX) || (val == 0))
967 return ((ng_ID_t)val);
971 * Remove a name from a node. This should only be called
972 * when shutting down and removing the node.
975 ng_unname(node_p node)
980 * Allocate a bigger name hash.
985 struct nodehash *new;
991 new = hashinit_flags((V_ng_name_hmask + 1) * 2, M_NETGRAPH_NODE, &hmask,
996 for (i = 0; i <= V_ng_name_hmask; i++)
997 LIST_FOREACH_SAFE(node, &V_ng_name_hash[i], nd_nodes, node2) {
999 LIST_REMOVE(node, nd_nodes);
1001 hash = hash32_str(NG_NODE_NAME(node), HASHINIT) & hmask;
1002 LIST_INSERT_HEAD(&new[hash], node, nd_nodes);
1005 hashdestroy(V_ng_name_hash, M_NETGRAPH_NODE, V_ng_name_hmask);
1006 V_ng_name_hash = new;
1007 V_ng_name_hmask = hmask;
1011 * Allocate a bigger ID hash.
1016 struct nodehash *new;
1022 new = hashinit_flags((V_ng_ID_hmask + 1) * 2, M_NETGRAPH_NODE, &hmask,
1027 for (i = 0; i <= V_ng_ID_hmask; i++)
1028 LIST_FOREACH_SAFE(node, &V_ng_ID_hash[i], nd_idnodes, node2) {
1030 LIST_REMOVE(node, nd_idnodes);
1032 hash = (node->nd_ID % (hmask + 1));
1033 LIST_INSERT_HEAD(&new[hash], node, nd_idnodes);
1036 hashdestroy(V_ng_ID_hash, M_NETGRAPH_NODE, V_ng_name_hmask);
1038 V_ng_ID_hmask = hmask;
1041 /************************************************************************
1043 Names are not optional. Hooks are always connected, except for a
1044 brief moment within these routines. On invalidation or during creation
1045 they are connected to the 'dead' hook.
1046 ************************************************************************/
1049 * Remove a hook reference
1052 ng_unref_hook(hook_p hook)
1055 if (hook == &ng_deadhook)
1058 if (refcount_release(&hook->hk_refs)) { /* we were the last */
1059 if (_NG_HOOK_NODE(hook)) /* it'll probably be ng_deadnode */
1060 _NG_NODE_UNREF((_NG_HOOK_NODE(hook)));
1066 * Add an unconnected hook to a node. Only used internally.
1067 * Assumes node is locked. (XXX not yet true )
1070 ng_add_hook(node_p node, const char *name, hook_p *hookp)
1075 /* Check that the given name is good */
1080 if (ng_findhook(node, name) != NULL) {
1085 /* Allocate the hook and link it up */
1086 NG_ALLOC_HOOK(hook);
1091 hook->hk_refs = 1; /* add a reference for us to return */
1092 hook->hk_flags = HK_INVALID;
1093 hook->hk_peer = &ng_deadhook; /* start off this way */
1094 hook->hk_node = node;
1095 NG_NODE_REF(node); /* each hook counts as a reference */
1098 strlcpy(NG_HOOK_NAME(hook), name, NG_HOOKSIZ);
1101 * Check if the node type code has something to say about it
1102 * If it fails, the unref of the hook will also unref the node.
1104 if (node->nd_type->newhook != NULL) {
1105 if ((error = (*node->nd_type->newhook)(node, hook, name))) {
1106 NG_HOOK_UNREF(hook); /* this frees the hook */
1111 * The 'type' agrees so far, so go ahead and link it in.
1112 * We'll ask again later when we actually connect the hooks.
1114 LIST_INSERT_HEAD(&node->nd_hooks, hook, hk_hooks);
1115 node->nd_numhooks++;
1116 NG_HOOK_REF(hook); /* one for the node */
1126 * Node types may supply their own optimized routines for finding
1127 * hooks. If none is supplied, we just do a linear search.
1128 * XXX Possibly we should add a reference to the hook?
1131 ng_findhook(node_p node, const char *name)
1135 if (node->nd_type->findhook != NULL)
1136 return (*node->nd_type->findhook)(node, name);
1137 LIST_FOREACH(hook, &node->nd_hooks, hk_hooks) {
1138 if (NG_HOOK_IS_VALID(hook) &&
1139 (strcmp(NG_HOOK_NAME(hook), name) == 0))
1148 * As hooks are always attached, this really destroys two hooks.
1149 * The one given, and the one attached to it. Disconnect the hooks
1150 * from each other first. We reconnect the peer hook to the 'dead'
1151 * hook so that it can still exist after we depart. We then
1152 * send the peer its own destroy message. This ensures that we only
1153 * interact with the peer's structures when it is locked processing that
1154 * message. We hold a reference to the peer hook so we are guaranteed that
1155 * the peer hook and node are still going to exist until
1156 * we are finished there as the hook holds a ref on the node.
1157 * We run this same code again on the peer hook, but that time it is already
1158 * attached to the 'dead' hook.
1160 * This routine is called at all stages of hook creation
1161 * on error detection and must be able to handle any such stage.
1164 ng_destroy_hook(hook_p hook)
1169 if (hook == &ng_deadhook) { /* better safe than sorry */
1170 printf("ng_destroy_hook called on deadhook\n");
1175 * Protect divorce process with mutex, to avoid races on
1176 * simultaneous disconnect.
1180 hook->hk_flags |= HK_INVALID;
1182 peer = NG_HOOK_PEER(hook);
1183 node = NG_HOOK_NODE(hook);
1185 if (peer && (peer != &ng_deadhook)) {
1187 * Set the peer to point to ng_deadhook
1188 * from this moment on we are effectively independent it.
1189 * send it an rmhook message of its own.
1191 peer->hk_peer = &ng_deadhook; /* They no longer know us */
1192 hook->hk_peer = &ng_deadhook; /* Nor us, them */
1193 if (NG_HOOK_NODE(peer) == &ng_deadnode) {
1195 * If it's already divorced from a node,
1201 ng_rmhook_self(peer); /* Send it a surprise */
1203 NG_HOOK_UNREF(peer); /* account for peer link */
1204 NG_HOOK_UNREF(hook); /* account for peer link */
1208 TOPOLOGY_NOTOWNED();
1211 * Remove the hook from the node's list to avoid possible recursion
1212 * in case the disconnection results in node shutdown.
1214 if (node == &ng_deadnode) { /* happens if called from ng_con_nodes() */
1217 LIST_REMOVE(hook, hk_hooks);
1218 node->nd_numhooks--;
1219 if (node->nd_type->disconnect) {
1221 * The type handler may elect to destroy the node so don't
1222 * trust its existence after this point. (except
1223 * that we still hold a reference on it. (which we
1224 * inherrited from the hook we are destroying)
1226 (*node->nd_type->disconnect) (hook);
1230 * Note that because we will point to ng_deadnode, the original node
1231 * is not decremented automatically so we do that manually.
1233 _NG_HOOK_NODE(hook) = &ng_deadnode;
1234 NG_NODE_UNREF(node); /* We no longer point to it so adjust count */
1235 NG_HOOK_UNREF(hook); /* Account for linkage (in list) to node */
1239 * Take two hooks on a node and merge the connection so that the given node
1240 * is effectively bypassed.
1243 ng_bypass(hook_p hook1, hook_p hook2)
1245 if (hook1->hk_node != hook2->hk_node) {
1250 if (NG_HOOK_NOT_VALID(hook1) || NG_HOOK_NOT_VALID(hook2)) {
1254 hook1->hk_peer->hk_peer = hook2->hk_peer;
1255 hook2->hk_peer->hk_peer = hook1->hk_peer;
1257 hook1->hk_peer = &ng_deadhook;
1258 hook2->hk_peer = &ng_deadhook;
1261 NG_HOOK_UNREF(hook1);
1262 NG_HOOK_UNREF(hook2);
1264 /* XXX If we ever cache methods on hooks update them as well */
1265 ng_destroy_hook(hook1);
1266 ng_destroy_hook(hook2);
1271 * Install a new netgraph type
1274 ng_newtype(struct ng_type *tp)
1276 const size_t namelen = strlen(tp->name);
1278 /* Check version and type name fields */
1279 if ((tp->version != NG_ABI_VERSION) || (namelen == 0) ||
1280 (namelen >= NG_TYPESIZ)) {
1282 if (tp->version != NG_ABI_VERSION) {
1283 printf("Netgraph: Node type rejected. ABI mismatch. "
1284 "Suggest recompile\n");
1289 /* Check for name collision */
1290 if (ng_findtype(tp->name) != NULL) {
1295 /* Link in new type */
1297 LIST_INSERT_HEAD(&ng_typelist, tp, types);
1298 tp->refs = 1; /* first ref is linked list */
1304 * unlink a netgraph type
1305 * If no examples exist
1308 ng_rmtype(struct ng_type *tp)
1310 /* Check for name collision */
1311 if (tp->refs != 1) {
1318 LIST_REMOVE(tp, types);
1324 * Look for a type of the name given
1327 ng_findtype(const char *typename)
1329 struct ng_type *type;
1332 LIST_FOREACH(type, &ng_typelist, types) {
1333 if (strcmp(type->name, typename) == 0)
1340 /************************************************************************
1342 ************************************************************************/
1344 * Connect two nodes using the specified hooks, using queued functions.
1347 ng_con_part3(node_p node, item_p item, hook_p hook)
1352 * When we run, we know that the node 'node' is locked for us.
1353 * Our caller has a reference on the hook.
1354 * Our caller has a reference on the node.
1355 * (In this case our caller is ng_apply_item() ).
1356 * The peer hook has a reference on the hook.
1357 * We are all set up except for the final call to the node, and
1358 * the clearing of the INVALID flag.
1360 if (NG_HOOK_NODE(hook) == &ng_deadnode) {
1362 * The node must have been freed again since we last visited
1363 * here. ng_destry_hook() has this effect but nothing else does.
1364 * We should just release our references and
1365 * free anything we can think of.
1366 * Since we know it's been destroyed, and it's our caller
1367 * that holds the references, just return.
1371 if (hook->hk_node->nd_type->connect) {
1372 if ((error = (*hook->hk_node->nd_type->connect) (hook))) {
1373 ng_destroy_hook(hook); /* also zaps peer */
1374 printf("failed in ng_con_part3()\n");
1379 * XXX this is wrong for SMP. Possibly we need
1380 * to separate out 'create' and 'invalid' flags.
1381 * should only set flags on hooks we have locked under our node.
1383 hook->hk_flags &= ~HK_INVALID;
1390 ng_con_part2(node_p node, item_p item, hook_p hook)
1396 * When we run, we know that the node 'node' is locked for us.
1397 * Our caller has a reference on the hook.
1398 * Our caller has a reference on the node.
1399 * (In this case our caller is ng_apply_item() ).
1400 * The peer hook has a reference on the hook.
1401 * our node pointer points to the 'dead' node.
1402 * First check the hook name is unique.
1403 * Should not happen because we checked before queueing this.
1405 if (ng_findhook(node, NG_HOOK_NAME(hook)) != NULL) {
1407 ng_destroy_hook(hook); /* should destroy peer too */
1408 printf("failed in ng_con_part2()\n");
1412 * Check if the node type code has something to say about it
1413 * If it fails, the unref of the hook will also unref the attached node,
1414 * however since that node is 'ng_deadnode' this will do nothing.
1415 * The peer hook will also be destroyed.
1417 if (node->nd_type->newhook != NULL) {
1418 if ((error = (*node->nd_type->newhook)(node, hook,
1420 ng_destroy_hook(hook); /* should destroy peer too */
1421 printf("failed in ng_con_part2()\n");
1427 * The 'type' agrees so far, so go ahead and link it in.
1428 * We'll ask again later when we actually connect the hooks.
1430 hook->hk_node = node; /* just overwrite ng_deadnode */
1431 NG_NODE_REF(node); /* each hook counts as a reference */
1432 LIST_INSERT_HEAD(&node->nd_hooks, hook, hk_hooks);
1433 node->nd_numhooks++;
1434 NG_HOOK_REF(hook); /* one for the node */
1437 * We now have a symmetrical situation, where both hooks have been
1438 * linked to their nodes, the newhook methods have been called
1439 * And the references are all correct. The hooks are still marked
1440 * as invalid, as we have not called the 'connect' methods
1442 * We can call the local one immediately as we have the
1443 * node locked, but we need to queue the remote one.
1445 if (hook->hk_node->nd_type->connect) {
1446 if ((error = (*hook->hk_node->nd_type->connect) (hook))) {
1447 ng_destroy_hook(hook); /* also zaps peer */
1448 printf("failed in ng_con_part2(A)\n");
1454 * Acquire topo mutex to avoid race with ng_destroy_hook().
1457 peer = hook->hk_peer;
1458 if (peer == &ng_deadhook) {
1460 printf("failed in ng_con_part2(B)\n");
1461 ng_destroy_hook(hook);
1466 if ((error = ng_send_fn2(peer->hk_node, peer, item, &ng_con_part3,
1467 NULL, 0, NG_REUSE_ITEM))) {
1468 printf("failed in ng_con_part2(C)\n");
1469 ng_destroy_hook(hook); /* also zaps peer */
1470 return (error); /* item was consumed. */
1472 hook->hk_flags &= ~HK_INVALID; /* need both to be able to work */
1473 return (0); /* item was consumed. */
1480 * Connect this node with another node. We assume that this node is
1481 * currently locked, as we are only called from an NGM_CONNECT message.
1484 ng_con_nodes(item_p item, node_p node, const char *name,
1485 node_p node2, const char *name2)
1491 if (ng_findhook(node2, name2) != NULL) {
1494 if ((error = ng_add_hook(node, name, &hook))) /* gives us a ref */
1496 /* Allocate the other hook and link it up */
1497 NG_ALLOC_HOOK(hook2);
1498 if (hook2 == NULL) {
1500 ng_destroy_hook(hook); /* XXX check ref counts so far */
1501 NG_HOOK_UNREF(hook); /* including our ref */
1504 hook2->hk_refs = 1; /* start with a reference for us. */
1505 hook2->hk_flags = HK_INVALID;
1506 hook2->hk_peer = hook; /* Link the two together */
1507 hook->hk_peer = hook2;
1508 NG_HOOK_REF(hook); /* Add a ref for the peer to each*/
1510 hook2->hk_node = &ng_deadnode;
1511 strlcpy(NG_HOOK_NAME(hook2), name2, NG_HOOKSIZ);
1514 * Queue the function above.
1515 * Procesing continues in that function in the lock context of
1518 if ((error = ng_send_fn2(node2, hook2, item, &ng_con_part2, NULL, 0,
1520 printf("failed in ng_con_nodes(): %d\n", error);
1521 ng_destroy_hook(hook); /* also zaps peer */
1524 NG_HOOK_UNREF(hook); /* Let each hook go if it wants to */
1525 NG_HOOK_UNREF(hook2);
1530 * Make a peer and connect.
1531 * We assume that the local node is locked.
1532 * The new node probably doesn't need a lock until
1533 * it has a hook, because it cannot really have any work until then,
1534 * but we should think about it a bit more.
1536 * The problem may come if the other node also fires up
1537 * some hardware or a timer or some other source of activation,
1538 * also it may already get a command msg via it's ID.
1540 * We could use the same method as ng_con_nodes() but we'd have
1541 * to add ability to remove the node when failing. (Not hard, just
1542 * make arg1 point to the node to remove).
1543 * Unless of course we just ignore failure to connect and leave
1544 * an unconnected node?
1547 ng_mkpeer(node_p node, const char *name, const char *name2, char *type)
1550 hook_p hook1, hook2;
1553 if ((error = ng_make_node(type, &node2))) {
1557 if ((error = ng_add_hook(node, name, &hook1))) { /* gives us a ref */
1558 ng_rmnode(node2, NULL, NULL, 0);
1562 if ((error = ng_add_hook(node2, name2, &hook2))) {
1563 ng_rmnode(node2, NULL, NULL, 0);
1564 ng_destroy_hook(hook1);
1565 NG_HOOK_UNREF(hook1);
1570 * Actually link the two hooks together.
1572 hook1->hk_peer = hook2;
1573 hook2->hk_peer = hook1;
1575 /* Each hook is referenced by the other */
1579 /* Give each node the opportunity to veto the pending connection */
1580 if (hook1->hk_node->nd_type->connect) {
1581 error = (*hook1->hk_node->nd_type->connect) (hook1);
1584 if ((error == 0) && hook2->hk_node->nd_type->connect) {
1585 error = (*hook2->hk_node->nd_type->connect) (hook2);
1589 * drop the references we were holding on the two hooks.
1592 ng_destroy_hook(hook2); /* also zaps hook1 */
1593 ng_rmnode(node2, NULL, NULL, 0);
1595 /* As a last act, allow the hooks to be used */
1596 hook1->hk_flags &= ~HK_INVALID;
1597 hook2->hk_flags &= ~HK_INVALID;
1599 NG_HOOK_UNREF(hook1);
1600 NG_HOOK_UNREF(hook2);
1604 /************************************************************************
1605 Utility routines to send self messages
1606 ************************************************************************/
1608 /* Shut this node down as soon as everyone is clear of it */
1609 /* Should add arg "immediately" to jump the queue */
1611 ng_rmnode_self(node_p node)
1615 if (node == &ng_deadnode)
1617 node->nd_flags |= NGF_INVALID;
1618 if (node->nd_flags & NGF_CLOSING)
1621 error = ng_send_fn(node, NULL, &ng_rmnode, NULL, 0);
1626 ng_rmhook_part2(node_p node, hook_p hook, void *arg1, int arg2)
1628 ng_destroy_hook(hook);
1633 ng_rmhook_self(hook_p hook)
1636 node_p node = NG_HOOK_NODE(hook);
1638 if (node == &ng_deadnode)
1641 error = ng_send_fn(node, hook, &ng_rmhook_part2, NULL, 0);
1645 /***********************************************************************
1646 * Parse and verify a string of the form: <NODE:><PATH>
1648 * Such a string can refer to a specific node or a specific hook
1649 * on a specific node, depending on how you look at it. In the
1650 * latter case, the PATH component must not end in a dot.
1652 * Both <NODE:> and <PATH> are optional. The <PATH> is a string
1653 * of hook names separated by dots. This breaks out the original
1654 * string, setting *nodep to "NODE" (or NULL if none) and *pathp
1655 * to "PATH" (or NULL if degenerate). Also, *hookp will point to
1656 * the final hook component of <PATH>, if any, otherwise NULL.
1658 * This returns -1 if the path is malformed. The char ** are optional.
1659 ***********************************************************************/
1661 ng_path_parse(char *addr, char **nodep, char **pathp, char **hookp)
1663 char *node, *path, *hook;
1667 * Extract absolute NODE, if any
1669 for (path = addr; *path && *path != ':'; path++);
1671 node = addr; /* Here's the NODE */
1672 *path++ = '\0'; /* Here's the PATH */
1674 /* Node name must not be empty */
1678 /* A name of "." is OK; otherwise '.' not allowed */
1679 if (strcmp(node, ".") != 0) {
1680 for (k = 0; node[k]; k++)
1685 node = NULL; /* No absolute NODE */
1686 path = addr; /* Here's the PATH */
1689 /* Snoop for illegal characters in PATH */
1690 for (k = 0; path[k]; k++)
1694 /* Check for no repeated dots in PATH */
1695 for (k = 0; path[k]; k++)
1696 if (path[k] == '.' && path[k + 1] == '.')
1699 /* Remove extra (degenerate) dots from beginning or end of PATH */
1702 if (*path && path[strlen(path) - 1] == '.')
1703 path[strlen(path) - 1] = 0;
1705 /* If PATH has a dot, then we're not talking about a hook */
1707 for (hook = path, k = 0; path[k]; k++)
1708 if (path[k] == '.') {
1726 * Given a path, which may be absolute or relative, and a starting node,
1727 * return the destination node.
1730 ng_path2noderef(node_p here, const char *address, node_p *destp,
1733 char fullpath[NG_PATHSIZ];
1734 char *nodename, *path;
1735 node_p node, oldnode;
1738 if (destp == NULL) {
1744 /* Make a writable copy of address for ng_path_parse() */
1745 strncpy(fullpath, address, sizeof(fullpath) - 1);
1746 fullpath[sizeof(fullpath) - 1] = '\0';
1748 /* Parse out node and sequence of hooks */
1749 if (ng_path_parse(fullpath, &nodename, &path, NULL) < 0) {
1755 * For an absolute address, jump to the starting node.
1756 * Note that this holds a reference on the node for us.
1757 * Don't forget to drop the reference if we don't need it.
1760 node = ng_name2noderef(here, nodename);
1775 if (lasthook != NULL)
1782 * Now follow the sequence of hooks
1784 * XXXGL: The path may demolish as we go the sequence, but if
1785 * we hold the topology mutex at critical places, then, I hope,
1786 * we would always have valid pointers in hand, although the
1787 * path behind us may no longer exist.
1794 * Break out the next path segment. Replace the dot we just
1795 * found with a NUL; "path" points to the next segment (or the
1798 for (segment = path; *path != '\0'; path++) {
1805 /* We have a segment, so look for a hook by that name */
1806 hook = ng_findhook(node, segment);
1809 /* Can't get there from here... */
1810 if (hook == NULL || NG_HOOK_PEER(hook) == NULL ||
1811 NG_HOOK_NOT_VALID(hook) ||
1812 NG_HOOK_NOT_VALID(NG_HOOK_PEER(hook))) {
1814 NG_NODE_UNREF(node);
1820 * Hop on over to the next node
1822 * Big race conditions here as hooks and nodes go away
1823 * *** Idea.. store an ng_ID_t in each hook and use that
1824 * instead of the direct hook in this crawl?
1827 if ((node = NG_PEER_NODE(hook)))
1828 NG_NODE_REF(node); /* XXX RACE */
1829 NG_NODE_UNREF(oldnode); /* XXX another race */
1830 if (NG_NODE_NOT_VALID(node)) {
1831 NG_NODE_UNREF(node); /* XXX more races */
1837 if (*path == '\0') {
1838 if (lasthook != NULL) {
1840 *lasthook = NG_HOOK_PEER(hook);
1841 NG_HOOK_REF(*lasthook);
1853 /***************************************************************\
1854 * Input queue handling.
1855 * All activities are submitted to the node via the input queue
1856 * which implements a multiple-reader/single-writer gate.
1857 * Items which cannot be handled immediately are queued.
1859 * read-write queue locking inline functions *
1860 \***************************************************************/
1862 static __inline void ng_queue_rw(node_p node, item_p item, int rw);
1863 static __inline item_p ng_dequeue(node_p node, int *rw);
1864 static __inline item_p ng_acquire_read(node_p node, item_p item);
1865 static __inline item_p ng_acquire_write(node_p node, item_p item);
1866 static __inline void ng_leave_read(node_p node);
1867 static __inline void ng_leave_write(node_p node);
1870 * Definition of the bits fields in the ng_queue flag word.
1871 * Defined here rather than in netgraph.h because no-one should fiddle
1874 * The ordering here may be important! don't shuffle these.
1877 Safety Barrier--------+ (adjustable to suit taste) (not used yet)
1880 +-------+-------+-------+-------+-------+-------+-------+-------+
1881 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
1882 | |A|c|t|i|v|e| |R|e|a|d|e|r| |C|o|u|n|t| | | | | | | | | |P|A|
1883 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |O|W|
1884 +-------+-------+-------+-------+-------+-------+-------+-------+
1885 \___________________________ ____________________________/ | |
1887 [active reader count] | |
1889 Operation Pending -------------------------------+ |
1891 Active Writer ---------------------------------------+
1893 Node queue has such semantics:
1894 - All flags modifications are atomic.
1895 - Reader count can be incremented only if there is no writer or pending flags.
1896 As soon as this can't be done with single operation, it is implemented with
1897 spin loop and atomic_cmpset().
1898 - Writer flag can be set only if there is no any bits set.
1899 It is implemented with atomic_cmpset().
1900 - Pending flag can be set any time, but to avoid collision on queue processing
1901 all queue fields are protected by the mutex.
1902 - Queue processing thread reads queue holding the mutex, but releases it while
1903 processing. When queue is empty pending flag is removed.
1906 #define WRITER_ACTIVE 0x00000001
1907 #define OP_PENDING 0x00000002
1908 #define READER_INCREMENT 0x00000004
1909 #define READER_MASK 0xfffffffc /* Not valid if WRITER_ACTIVE is set */
1910 #define SAFETY_BARRIER 0x00100000 /* 128K items queued should be enough */
1912 /* Defines of more elaborate states on the queue */
1913 /* Mask of bits a new read cares about */
1914 #define NGQ_RMASK (WRITER_ACTIVE|OP_PENDING)
1916 /* Mask of bits a new write cares about */
1917 #define NGQ_WMASK (NGQ_RMASK|READER_MASK)
1919 /* Test to decide if there is something on the queue. */
1920 #define QUEUE_ACTIVE(QP) ((QP)->q_flags & OP_PENDING)
1922 /* How to decide what the next queued item is. */
1923 #define HEAD_IS_READER(QP) NGI_QUEUED_READER(STAILQ_FIRST(&(QP)->queue))
1924 #define HEAD_IS_WRITER(QP) NGI_QUEUED_WRITER(STAILQ_FIRST(&(QP)->queue)) /* notused */
1926 /* Read the status to decide if the next item on the queue can now run. */
1927 #define QUEUED_READER_CAN_PROCEED(QP) \
1928 (((QP)->q_flags & (NGQ_RMASK & ~OP_PENDING)) == 0)
1929 #define QUEUED_WRITER_CAN_PROCEED(QP) \
1930 (((QP)->q_flags & (NGQ_WMASK & ~OP_PENDING)) == 0)
1932 /* Is there a chance of getting ANY work off the queue? */
1933 #define NEXT_QUEUED_ITEM_CAN_PROCEED(QP) \
1934 ((HEAD_IS_READER(QP)) ? QUEUED_READER_CAN_PROCEED(QP) : \
1935 QUEUED_WRITER_CAN_PROCEED(QP))
1940 #define NGQ2_WORKQ 0x00000001
1943 * Taking into account the current state of the queue and node, possibly take
1944 * the next entry off the queue and return it. Return NULL if there was
1945 * nothing we could return, either because there really was nothing there, or
1946 * because the node was in a state where it cannot yet process the next item
1949 static __inline item_p
1950 ng_dequeue(node_p node, int *rw)
1953 struct ng_queue *ngq = &node->nd_input_queue;
1955 /* This MUST be called with the mutex held. */
1956 mtx_assert(&ngq->q_mtx, MA_OWNED);
1958 /* If there is nothing queued, then just return. */
1959 if (!QUEUE_ACTIVE(ngq)) {
1960 CTR4(KTR_NET, "%20s: node [%x] (%p) queue empty; "
1961 "queue flags 0x%lx", __func__,
1962 node->nd_ID, node, ngq->q_flags);
1967 * From here, we can assume there is a head item.
1968 * We need to find out what it is and if it can be dequeued, given
1969 * the current state of the node.
1971 if (HEAD_IS_READER(ngq)) {
1973 long t = ngq->q_flags;
1974 if (t & WRITER_ACTIVE) {
1975 /* There is writer, reader can't proceed. */
1976 CTR4(KTR_NET, "%20s: node [%x] (%p) queued "
1977 "reader can't proceed; queue flags 0x%lx",
1978 __func__, node->nd_ID, node, t);
1981 if (atomic_cmpset_acq_int(&ngq->q_flags, t,
1982 t + READER_INCREMENT))
1986 /* We have got reader lock for the node. */
1988 } else if (atomic_cmpset_acq_int(&ngq->q_flags, OP_PENDING,
1989 OP_PENDING + WRITER_ACTIVE)) {
1990 /* We have got writer lock for the node. */
1993 /* There is somebody other, writer can't proceed. */
1994 CTR4(KTR_NET, "%20s: node [%x] (%p) queued writer can't "
1995 "proceed; queue flags 0x%lx", __func__, node->nd_ID, node,
2001 * Now we dequeue the request (whatever it may be) and correct the
2002 * pending flags and the next and last pointers.
2004 item = STAILQ_FIRST(&ngq->queue);
2005 STAILQ_REMOVE_HEAD(&ngq->queue, el_next);
2006 if (STAILQ_EMPTY(&ngq->queue))
2007 atomic_clear_int(&ngq->q_flags, OP_PENDING);
2008 CTR6(KTR_NET, "%20s: node [%x] (%p) returning item %p as %s; queue "
2009 "flags 0x%lx", __func__, node->nd_ID, node, item, *rw ? "WRITER" :
2010 "READER", ngq->q_flags);
2015 * Queue a packet to be picked up later by someone else.
2016 * If the queue could be run now, add node to the queue handler's worklist.
2018 static __inline void
2019 ng_queue_rw(node_p node, item_p item, int rw)
2021 struct ng_queue *ngq = &node->nd_input_queue;
2023 NGI_SET_WRITER(item);
2025 NGI_SET_READER(item);
2029 /* Set OP_PENDING flag and enqueue the item. */
2030 atomic_set_int(&ngq->q_flags, OP_PENDING);
2031 STAILQ_INSERT_TAIL(&ngq->queue, item, el_next);
2033 CTR5(KTR_NET, "%20s: node [%x] (%p) queued item %p as %s", __func__,
2034 node->nd_ID, node, item, rw ? "WRITER" : "READER" );
2037 * We can take the worklist lock with the node locked
2038 * BUT NOT THE REVERSE!
2040 if (NEXT_QUEUED_ITEM_CAN_PROCEED(ngq))
2041 ng_worklist_add(node);
2042 NG_QUEUE_UNLOCK(ngq);
2045 /* Acquire reader lock on node. If node is busy, queue the packet. */
2046 static __inline item_p
2047 ng_acquire_read(node_p node, item_p item)
2049 KASSERT(node != &ng_deadnode,
2050 ("%s: working on deadnode", __func__));
2052 /* Reader needs node without writer and pending items. */
2054 long t = node->nd_input_queue.q_flags;
2056 break; /* Node is not ready for reader. */
2057 if (atomic_cmpset_acq_int(&node->nd_input_queue.q_flags, t,
2058 t + READER_INCREMENT)) {
2059 /* Successfully grabbed node */
2060 CTR4(KTR_NET, "%20s: node [%x] (%p) acquired item %p",
2061 __func__, node->nd_ID, node, item);
2067 /* Queue the request for later. */
2068 ng_queue_rw(node, item, NGQRW_R);
2073 /* Acquire writer lock on node. If node is busy, queue the packet. */
2074 static __inline item_p
2075 ng_acquire_write(node_p node, item_p item)
2077 KASSERT(node != &ng_deadnode,
2078 ("%s: working on deadnode", __func__));
2080 /* Writer needs completely idle node. */
2081 if (atomic_cmpset_acq_int(&node->nd_input_queue.q_flags, 0,
2083 /* Successfully grabbed node */
2084 CTR4(KTR_NET, "%20s: node [%x] (%p) acquired item %p",
2085 __func__, node->nd_ID, node, item);
2089 /* Queue the request for later. */
2090 ng_queue_rw(node, item, NGQRW_W);
2096 static __inline item_p
2097 ng_upgrade_write(node_p node, item_p item)
2099 struct ng_queue *ngq = &node->nd_input_queue;
2100 KASSERT(node != &ng_deadnode,
2101 ("%s: working on deadnode", __func__));
2103 NGI_SET_WRITER(item);
2108 * There will never be no readers as we are there ourselves.
2109 * Set the WRITER_ACTIVE flags ASAP to block out fast track readers.
2110 * The caller we are running from will call ng_leave_read()
2111 * soon, so we must account for that. We must leave again with the
2112 * READER lock. If we find other readers, then
2113 * queue the request for later. However "later" may be rignt now
2114 * if there are no readers. We don't really care if there are queued
2115 * items as we will bypass them anyhow.
2117 atomic_add_int(&ngq->q_flags, WRITER_ACTIVE - READER_INCREMENT);
2118 if ((ngq->q_flags & (NGQ_WMASK & ~OP_PENDING)) == WRITER_ACTIVE) {
2119 NG_QUEUE_UNLOCK(ngq);
2121 /* It's just us, act on the item. */
2122 /* will NOT drop writer lock when done */
2123 ng_apply_item(node, item, 0);
2126 * Having acted on the item, atomically
2127 * downgrade back to READER and finish up.
2129 atomic_add_int(&ngq->q_flags, READER_INCREMENT - WRITER_ACTIVE);
2131 /* Our caller will call ng_leave_read() */
2135 * It's not just us active, so queue us AT THE HEAD.
2136 * "Why?" I hear you ask.
2137 * Put us at the head of the queue as we've already been
2138 * through it once. If there is nothing else waiting,
2139 * set the correct flags.
2141 if (STAILQ_EMPTY(&ngq->queue)) {
2142 /* We've gone from, 0 to 1 item in the queue */
2143 atomic_set_int(&ngq->q_flags, OP_PENDING);
2145 CTR3(KTR_NET, "%20s: node [%x] (%p) set OP_PENDING", __func__,
2148 STAILQ_INSERT_HEAD(&ngq->queue, item, el_next);
2149 CTR4(KTR_NET, "%20s: node [%x] (%p) requeued item %p as WRITER",
2150 __func__, node->nd_ID, node, item );
2152 /* Reverse what we did above. That downgrades us back to reader */
2153 atomic_add_int(&ngq->q_flags, READER_INCREMENT - WRITER_ACTIVE);
2154 if (QUEUE_ACTIVE(ngq) && NEXT_QUEUED_ITEM_CAN_PROCEED(ngq))
2155 ng_worklist_add(node);
2156 NG_QUEUE_UNLOCK(ngq);
2162 /* Release reader lock. */
2163 static __inline void
2164 ng_leave_read(node_p node)
2166 atomic_subtract_rel_int(&node->nd_input_queue.q_flags, READER_INCREMENT);
2169 /* Release writer lock. */
2170 static __inline void
2171 ng_leave_write(node_p node)
2173 atomic_clear_rel_int(&node->nd_input_queue.q_flags, WRITER_ACTIVE);
2176 /* Purge node queue. Called on node shutdown. */
2178 ng_flush_input_queue(node_p node)
2180 struct ng_queue *ngq = &node->nd_input_queue;
2184 while ((item = STAILQ_FIRST(&ngq->queue)) != NULL) {
2185 STAILQ_REMOVE_HEAD(&ngq->queue, el_next);
2186 if (STAILQ_EMPTY(&ngq->queue))
2187 atomic_clear_int(&ngq->q_flags, OP_PENDING);
2188 NG_QUEUE_UNLOCK(ngq);
2190 /* If the item is supplying a callback, call it with an error */
2191 if (item->apply != NULL) {
2192 if (item->depth == 1)
2193 item->apply->error = ENOENT;
2194 if (refcount_release(&item->apply->refs)) {
2195 (*item->apply->apply)(item->apply->context,
2196 item->apply->error);
2202 NG_QUEUE_UNLOCK(ngq);
2205 /***********************************************************************
2206 * Externally visible method for sending or queueing messages or data.
2207 ***********************************************************************/
2210 * The module code should have filled out the item correctly by this stage:
2212 * reference to destination node.
2213 * Reference to destination rcv hook if relevant.
2214 * apply pointer must be or NULL or reference valid struct ng_apply_info.
2219 * ID of original sender node. (return address)
2225 * The nodes have several routines and macros to help with this task:
2229 ng_snd_item(item_p item, int flags)
2234 struct ng_queue *ngq;
2237 /* We are sending item, so it must be present! */
2238 KASSERT(item != NULL, ("ng_snd_item: item is NULL"));
2240 #ifdef NETGRAPH_DEBUG
2241 _ngi_check(item, __FILE__, __LINE__);
2244 /* Item was sent once more, postpone apply() call. */
2246 refcount_acquire(&item->apply->refs);
2248 node = NGI_NODE(item);
2249 /* Node is never optional. */
2250 KASSERT(node != NULL, ("ng_snd_item: node is NULL"));
2252 hook = NGI_HOOK(item);
2253 /* Valid hook and mbuf are mandatory for data. */
2254 if ((item->el_flags & NGQF_TYPE) == NGQF_DATA) {
2255 KASSERT(hook != NULL, ("ng_snd_item: hook for data is NULL"));
2256 if (NGI_M(item) == NULL)
2258 CHECK_DATA_MBUF(NGI_M(item));
2262 * If the item or the node specifies single threading, force
2263 * writer semantics. Similarly, the node may say one hook always
2264 * produces writers. These are overrides.
2266 if (((item->el_flags & NGQF_RW) == NGQF_WRITER) ||
2267 (node->nd_flags & NGF_FORCE_WRITER) ||
2268 (hook && (hook->hk_flags & HK_FORCE_WRITER))) {
2275 * If sender or receiver requests queued delivery, or call graph
2276 * loops back from outbound to inbound path, or stack usage
2277 * level is dangerous - enqueue message.
2279 if ((flags & NG_QUEUE) || (hook && (hook->hk_flags & HK_QUEUE))) {
2281 } else if (hook && (hook->hk_flags & HK_TO_INBOUND) &&
2282 curthread->td_ng_outbound) {
2288 * Most of netgraph nodes have small stack consumption and
2289 * for them 25% of free stack space is more than enough.
2290 * Nodes/hooks with higher stack usage should be marked as
2291 * HI_STACK. For them 50% of stack will be guaranteed then.
2292 * XXX: Values 25% and 50% are completely empirical.
2295 GET_STACK_USAGE(st, su);
2297 if ((sl * 4 < st) || ((sl * 2 < st) &&
2298 ((node->nd_flags & NGF_HI_STACK) || (hook &&
2299 (hook->hk_flags & HK_HI_STACK)))))
2304 /* Put it on the queue for that node*/
2305 ng_queue_rw(node, item, rw);
2306 return ((flags & NG_PROGRESS) ? EINPROGRESS : 0);
2310 * We already decided how we will be queueud or treated.
2311 * Try get the appropriate operating permission.
2314 item = ng_acquire_read(node, item);
2316 item = ng_acquire_write(node, item);
2318 /* Item was queued while trying to get permission. */
2320 return ((flags & NG_PROGRESS) ? EINPROGRESS : 0);
2322 NGI_GET_NODE(item, node); /* zaps stored node */
2325 error = ng_apply_item(node, item, rw); /* drops r/w lock when done */
2327 /* If something is waiting on queue and ready, schedule it. */
2328 ngq = &node->nd_input_queue;
2329 if (QUEUE_ACTIVE(ngq)) {
2331 if (QUEUE_ACTIVE(ngq) && NEXT_QUEUED_ITEM_CAN_PROCEED(ngq))
2332 ng_worklist_add(node);
2333 NG_QUEUE_UNLOCK(ngq);
2337 * Node may go away as soon as we remove the reference.
2338 * Whatever we do, DO NOT access the node again!
2340 NG_NODE_UNREF(node);
2345 /* If was not sent, apply callback here. */
2346 if (item->apply != NULL) {
2347 if (item->depth == 0 && error != 0)
2348 item->apply->error = error;
2349 if (refcount_release(&item->apply->refs)) {
2350 (*item->apply->apply)(item->apply->context,
2351 item->apply->error);
2360 * We have an item that was possibly queued somewhere.
2361 * It should contain all the information needed
2362 * to run it on the appropriate node/hook.
2363 * If there is apply pointer and we own the last reference, call apply().
2366 ng_apply_item(node_p node, item_p item, int rw)
2369 ng_rcvdata_t *rcvdata;
2370 ng_rcvmsg_t *rcvmsg;
2371 struct ng_apply_info *apply;
2372 int error = 0, depth;
2374 /* Node and item are never optional. */
2375 KASSERT(node != NULL, ("ng_apply_item: node is NULL"));
2376 KASSERT(item != NULL, ("ng_apply_item: item is NULL"));
2378 NGI_GET_HOOK(item, hook); /* clears stored hook */
2379 #ifdef NETGRAPH_DEBUG
2380 _ngi_check(item, __FILE__, __LINE__);
2383 apply = item->apply;
2384 depth = item->depth;
2386 switch (item->el_flags & NGQF_TYPE) {
2389 * Check things are still ok as when we were queued.
2391 KASSERT(hook != NULL, ("ng_apply_item: hook for data is NULL"));
2392 if (NG_HOOK_NOT_VALID(hook) ||
2393 NG_NODE_NOT_VALID(node)) {
2399 * If no receive method, just silently drop it.
2400 * Give preference to the hook over-ride method.
2402 if ((!(rcvdata = hook->hk_rcvdata)) &&
2403 (!(rcvdata = NG_HOOK_NODE(hook)->nd_type->rcvdata))) {
2408 error = (*rcvdata)(hook, item);
2411 if (hook && NG_HOOK_NOT_VALID(hook)) {
2413 * The hook has been zapped then we can't use it.
2414 * Immediately drop its reference.
2415 * The message may not need it.
2417 NG_HOOK_UNREF(hook);
2421 * Similarly, if the node is a zombie there is
2422 * nothing we can do with it, drop everything.
2424 if (NG_NODE_NOT_VALID(node)) {
2431 * Call the appropriate message handler for the object.
2432 * It is up to the message handler to free the message.
2433 * If it's a generic message, handle it generically,
2434 * otherwise call the type's message handler (if it exists).
2435 * XXX (race). Remember that a queued message may
2436 * reference a node or hook that has just been
2437 * invalidated. It will exist as the queue code
2438 * is holding a reference, but..
2440 if ((NGI_MSG(item)->header.typecookie == NGM_GENERIC_COOKIE) &&
2441 ((NGI_MSG(item)->header.flags & NGF_RESP) == 0)) {
2442 error = ng_generic_msg(node, item, hook);
2445 if (((!hook) || (!(rcvmsg = hook->hk_rcvmsg))) &&
2446 (!(rcvmsg = node->nd_type->rcvmsg))) {
2452 error = (*rcvmsg)(node, item, hook);
2457 * In the case of the shutdown message we allow it to hit
2458 * even if the node is invalid.
2460 if (NG_NODE_NOT_VALID(node) &&
2461 NGI_FN(item) != &ng_rmnode) {
2467 /* Same is about some internal functions and invalid hook. */
2468 if (hook && NG_HOOK_NOT_VALID(hook) &&
2469 NGI_FN2(item) != &ng_con_part2 &&
2470 NGI_FN2(item) != &ng_con_part3 &&
2471 NGI_FN(item) != &ng_rmhook_part2) {
2478 if ((item->el_flags & NGQF_TYPE) == NGQF_FN) {
2479 (*NGI_FN(item))(node, hook, NGI_ARG1(item),
2482 } else /* it is NGQF_FN2 */
2483 error = (*NGI_FN2(item))(node, item, hook);
2487 * We held references on some of the resources
2488 * that we took from the item. Now that we have
2489 * finished doing everything, drop those references.
2492 NG_HOOK_UNREF(hook);
2495 ng_leave_read(node);
2497 ng_leave_write(node);
2499 /* Apply callback. */
2500 if (apply != NULL) {
2501 if (depth == 1 && error != 0)
2502 apply->error = error;
2503 if (refcount_release(&apply->refs))
2504 (*apply->apply)(apply->context, apply->error);
2510 /***********************************************************************
2511 * Implement the 'generic' control messages
2512 ***********************************************************************/
2514 ng_generic_msg(node_p here, item_p item, hook_p lasthook)
2517 struct ng_mesg *msg;
2518 struct ng_mesg *resp = NULL;
2520 NGI_GET_MSG(item, msg);
2521 if (msg->header.typecookie != NGM_GENERIC_COOKIE) {
2526 switch (msg->header.cmd) {
2528 ng_rmnode(here, NULL, NULL, 0);
2532 struct ngm_mkpeer *const mkp = (struct ngm_mkpeer *) msg->data;
2534 if (msg->header.arglen != sizeof(*mkp)) {
2539 mkp->type[sizeof(mkp->type) - 1] = '\0';
2540 mkp->ourhook[sizeof(mkp->ourhook) - 1] = '\0';
2541 mkp->peerhook[sizeof(mkp->peerhook) - 1] = '\0';
2542 error = ng_mkpeer(here, mkp->ourhook, mkp->peerhook, mkp->type);
2547 struct ngm_connect *const con =
2548 (struct ngm_connect *) msg->data;
2551 if (msg->header.arglen != sizeof(*con)) {
2556 con->path[sizeof(con->path) - 1] = '\0';
2557 con->ourhook[sizeof(con->ourhook) - 1] = '\0';
2558 con->peerhook[sizeof(con->peerhook) - 1] = '\0';
2559 /* Don't forget we get a reference.. */
2560 error = ng_path2noderef(here, con->path, &node2, NULL);
2563 error = ng_con_nodes(item, here, con->ourhook,
2564 node2, con->peerhook);
2565 NG_NODE_UNREF(node2);
2570 struct ngm_name *const nam = (struct ngm_name *) msg->data;
2572 if (msg->header.arglen != sizeof(*nam)) {
2577 nam->name[sizeof(nam->name) - 1] = '\0';
2578 error = ng_name_node(here, nam->name);
2583 struct ngm_rmhook *const rmh = (struct ngm_rmhook *) msg->data;
2586 if (msg->header.arglen != sizeof(*rmh)) {
2591 rmh->ourhook[sizeof(rmh->ourhook) - 1] = '\0';
2592 if ((hook = ng_findhook(here, rmh->ourhook)) != NULL)
2593 ng_destroy_hook(hook);
2598 struct nodeinfo *ni;
2600 NG_MKRESPONSE(resp, msg, sizeof(*ni), M_NOWAIT);
2606 /* Fill in node info */
2607 ni = (struct nodeinfo *) resp->data;
2608 if (NG_NODE_HAS_NAME(here))
2609 strcpy(ni->name, NG_NODE_NAME(here));
2610 strcpy(ni->type, here->nd_type->name);
2611 ni->id = ng_node2ID(here);
2612 ni->hooks = here->nd_numhooks;
2617 const int nhooks = here->nd_numhooks;
2618 struct hooklist *hl;
2619 struct nodeinfo *ni;
2622 /* Get response struct */
2623 NG_MKRESPONSE(resp, msg, sizeof(*hl) +
2624 (nhooks * sizeof(struct linkinfo)), M_NOWAIT);
2629 hl = (struct hooklist *) resp->data;
2632 /* Fill in node info */
2633 if (NG_NODE_HAS_NAME(here))
2634 strcpy(ni->name, NG_NODE_NAME(here));
2635 strcpy(ni->type, here->nd_type->name);
2636 ni->id = ng_node2ID(here);
2638 /* Cycle through the linked list of hooks */
2640 LIST_FOREACH(hook, &here->nd_hooks, hk_hooks) {
2641 struct linkinfo *const link = &hl->link[ni->hooks];
2643 if (ni->hooks >= nhooks) {
2644 log(LOG_ERR, "%s: number of %s changed\n",
2648 if (NG_HOOK_NOT_VALID(hook))
2650 strcpy(link->ourhook, NG_HOOK_NAME(hook));
2651 strcpy(link->peerhook, NG_PEER_HOOK_NAME(hook));
2652 if (NG_PEER_NODE_NAME(hook)[0] != '\0')
2653 strcpy(link->nodeinfo.name,
2654 NG_PEER_NODE_NAME(hook));
2655 strcpy(link->nodeinfo.type,
2656 NG_PEER_NODE(hook)->nd_type->name);
2657 link->nodeinfo.id = ng_node2ID(NG_PEER_NODE(hook));
2658 link->nodeinfo.hooks = NG_PEER_NODE(hook)->nd_numhooks;
2666 struct namelist *nl;
2671 /* Get response struct. */
2672 NG_MKRESPONSE(resp, msg, sizeof(*nl) +
2673 (V_ng_nodes * sizeof(struct nodeinfo)), M_NOWAIT);
2679 nl = (struct namelist *) resp->data;
2681 /* Cycle through the lists of nodes. */
2683 for (i = 0; i <= V_ng_ID_hmask; i++) {
2684 LIST_FOREACH(node, &V_ng_ID_hash[i], nd_idnodes) {
2685 struct nodeinfo *const np =
2686 &nl->nodeinfo[nl->numnames];
2688 if (NG_NODE_NOT_VALID(node))
2690 if (NG_NODE_HAS_NAME(node))
2691 strcpy(np->name, NG_NODE_NAME(node));
2692 strcpy(np->type, node->nd_type->name);
2693 np->id = ng_node2ID(node);
2694 np->hooks = node->nd_numhooks;
2695 KASSERT(nl->numnames < V_ng_nodes,
2696 ("%s: no space", __func__));
2705 struct namelist *nl;
2710 /* Get response struct. */
2711 NG_MKRESPONSE(resp, msg, sizeof(*nl) +
2712 (V_ng_named_nodes * sizeof(struct nodeinfo)), M_NOWAIT);
2718 nl = (struct namelist *) resp->data;
2720 /* Cycle through the lists of nodes. */
2722 for (i = 0; i <= V_ng_name_hmask; i++) {
2723 LIST_FOREACH(node, &V_ng_name_hash[i], nd_nodes) {
2724 struct nodeinfo *const np =
2725 &nl->nodeinfo[nl->numnames];
2727 if (NG_NODE_NOT_VALID(node))
2729 strcpy(np->name, NG_NODE_NAME(node));
2730 strcpy(np->type, node->nd_type->name);
2731 np->id = ng_node2ID(node);
2732 np->hooks = node->nd_numhooks;
2733 KASSERT(nl->numnames < V_ng_named_nodes,
2734 ("%s: no space", __func__));
2744 struct typelist *tl;
2745 struct ng_type *type;
2749 /* Count number of types */
2750 LIST_FOREACH(type, &ng_typelist, types)
2753 /* Get response struct */
2754 NG_MKRESPONSE(resp, msg, sizeof(*tl) +
2755 (num * sizeof(struct typeinfo)), M_NOWAIT);
2761 tl = (struct typelist *) resp->data;
2763 /* Cycle through the linked list of types */
2765 LIST_FOREACH(type, &ng_typelist, types) {
2766 struct typeinfo *const tp = &tl->typeinfo[tl->numtypes];
2768 strcpy(tp->type_name, type->name);
2769 tp->numnodes = type->refs - 1; /* don't count list */
2770 KASSERT(tl->numtypes < num, ("%s: no space", __func__));
2777 case NGM_BINARY2ASCII:
2780 const struct ng_parse_type *argstype;
2781 const struct ng_cmdlist *c;
2782 struct ng_mesg *binary, *ascii;
2784 /* Data area must contain a valid netgraph message */
2785 binary = (struct ng_mesg *)msg->data;
2786 if (msg->header.arglen < sizeof(struct ng_mesg) ||
2787 (msg->header.arglen - sizeof(struct ng_mesg) <
2788 binary->header.arglen)) {
2794 /* Get a response message with lots of room */
2795 NG_MKRESPONSE(resp, msg, sizeof(*ascii) + bufSize, M_NOWAIT);
2800 ascii = (struct ng_mesg *)resp->data;
2802 /* Copy binary message header to response message payload */
2803 bcopy(binary, ascii, sizeof(*binary));
2805 /* Find command by matching typecookie and command number */
2806 for (c = here->nd_type->cmdlist; c != NULL && c->name != NULL;
2808 if (binary->header.typecookie == c->cookie &&
2809 binary->header.cmd == c->cmd)
2812 if (c == NULL || c->name == NULL) {
2813 for (c = ng_generic_cmds; c->name != NULL; c++) {
2814 if (binary->header.typecookie == c->cookie &&
2815 binary->header.cmd == c->cmd)
2818 if (c->name == NULL) {
2825 /* Convert command name to ASCII */
2826 snprintf(ascii->header.cmdstr, sizeof(ascii->header.cmdstr),
2829 /* Convert command arguments to ASCII */
2830 argstype = (binary->header.flags & NGF_RESP) ?
2831 c->respType : c->mesgType;
2832 if (argstype == NULL) {
2833 *ascii->data = '\0';
2835 error = ng_unparse(argstype, (u_char *)binary->data,
2836 ascii->data, bufSize);
2837 if (error == ERANGE) {
2847 /* Return the result as struct ng_mesg plus ASCII string */
2848 bufSize = strlen(ascii->data) + 1;
2849 ascii->header.arglen = bufSize;
2850 resp->header.arglen = sizeof(*ascii) + bufSize;
2854 case NGM_ASCII2BINARY:
2856 int bufSize = 20 * 1024; /* XXX hard coded constant */
2857 const struct ng_cmdlist *c;
2858 const struct ng_parse_type *argstype;
2859 struct ng_mesg *ascii, *binary;
2862 /* Data area must contain at least a struct ng_mesg + '\0' */
2863 ascii = (struct ng_mesg *)msg->data;
2864 if ((msg->header.arglen < sizeof(*ascii) + 1) ||
2865 (ascii->header.arglen < 1) ||
2866 (msg->header.arglen < sizeof(*ascii) +
2867 ascii->header.arglen)) {
2872 ascii->data[ascii->header.arglen - 1] = '\0';
2874 /* Get a response message with lots of room */
2875 NG_MKRESPONSE(resp, msg, sizeof(*binary) + bufSize, M_NOWAIT);
2880 binary = (struct ng_mesg *)resp->data;
2882 /* Copy ASCII message header to response message payload */
2883 bcopy(ascii, binary, sizeof(*ascii));
2885 /* Find command by matching ASCII command string */
2886 for (c = here->nd_type->cmdlist;
2887 c != NULL && c->name != NULL; c++) {
2888 if (strcmp(ascii->header.cmdstr, c->name) == 0)
2891 if (c == NULL || c->name == NULL) {
2892 for (c = ng_generic_cmds; c->name != NULL; c++) {
2893 if (strcmp(ascii->header.cmdstr, c->name) == 0)
2896 if (c->name == NULL) {
2903 /* Convert command name to binary */
2904 binary->header.cmd = c->cmd;
2905 binary->header.typecookie = c->cookie;
2907 /* Convert command arguments to binary */
2908 argstype = (binary->header.flags & NGF_RESP) ?
2909 c->respType : c->mesgType;
2910 if (argstype == NULL) {
2913 if ((error = ng_parse(argstype, ascii->data, &off,
2914 (u_char *)binary->data, &bufSize)) != 0) {
2920 /* Return the result */
2921 binary->header.arglen = bufSize;
2922 resp->header.arglen = sizeof(*binary) + bufSize;
2926 case NGM_TEXT_CONFIG:
2927 case NGM_TEXT_STATUS:
2929 * This one is tricky as it passes the command down to the
2930 * actual node, even though it is a generic type command.
2931 * This means we must assume that the item/msg is already freed
2932 * when control passes back to us.
2934 if (here->nd_type->rcvmsg != NULL) {
2935 NGI_MSG(item) = msg; /* put it back as we found it */
2936 return((*here->nd_type->rcvmsg)(here, item, lasthook));
2938 /* Fall through if rcvmsg not supported */
2944 * Sometimes a generic message may be statically allocated
2945 * to avoid problems with allocating when in tight memory situations.
2946 * Don't free it if it is so.
2947 * I break them apart here, because erros may cause a free if the item
2948 * in which case we'd be doing it twice.
2949 * they are kept together above, to simplify freeing.
2952 NG_RESPOND_MSG(error, here, item, resp);
2957 /************************************************************************
2958 Queue element get/free routines
2959 ************************************************************************/
2961 uma_zone_t ng_qzone;
2962 uma_zone_t ng_qdzone;
2963 static int numthreads = 0; /* number of queue threads */
2964 static int maxalloc = 4096;/* limit the damage of a leak */
2965 static int maxdata = 4096; /* limit the damage of a DoS */
2967 SYSCTL_INT(_net_graph, OID_AUTO, threads, CTLFLAG_RDTUN, &numthreads,
2968 0, "Number of queue processing threads");
2969 SYSCTL_INT(_net_graph, OID_AUTO, maxalloc, CTLFLAG_RDTUN, &maxalloc,
2970 0, "Maximum number of non-data queue items to allocate");
2971 SYSCTL_INT(_net_graph, OID_AUTO, maxdata, CTLFLAG_RDTUN, &maxdata,
2972 0, "Maximum number of data queue items to allocate");
2974 #ifdef NETGRAPH_DEBUG
2975 static TAILQ_HEAD(, ng_item) ng_itemlist = TAILQ_HEAD_INITIALIZER(ng_itemlist);
2976 static int allocated; /* number of items malloc'd */
2980 * Get a queue entry.
2981 * This is usually called when a packet first enters netgraph.
2982 * By definition, this is usually from an interrupt, or from a user.
2983 * Users are not so important, but try be quick for the times that it's
2986 static __inline item_p
2987 ng_alloc_item(int type, int flags)
2991 KASSERT(((type & ~NGQF_TYPE) == 0),
2992 ("%s: incorrect item type: %d", __func__, type));
2994 item = uma_zalloc((type == NGQF_DATA) ? ng_qdzone : ng_qzone,
2995 ((flags & NG_WAITOK) ? M_WAITOK : M_NOWAIT) | M_ZERO);
2998 item->el_flags = type;
2999 #ifdef NETGRAPH_DEBUG
3001 TAILQ_INSERT_TAIL(&ng_itemlist, item, all);
3003 mtx_unlock(&ngq_mtx);
3011 * Release a queue entry
3014 ng_free_item(item_p item)
3017 * The item may hold resources on its own. We need to free
3018 * these before we can free the item. What they are depends upon
3019 * what kind of item it is. it is important that nodes zero
3020 * out pointers to resources that they remove from the item
3021 * or we release them again here.
3023 switch (item->el_flags & NGQF_TYPE) {
3025 /* If we have an mbuf still attached.. */
3026 NG_FREE_M(_NGI_M(item));
3029 _NGI_RETADDR(item) = 0;
3030 NG_FREE_MSG(_NGI_MSG(item));
3034 /* nothing to free really, */
3035 _NGI_FN(item) = NULL;
3036 _NGI_ARG1(item) = NULL;
3037 _NGI_ARG2(item) = 0;
3040 /* If we still have a node or hook referenced... */
3041 _NGI_CLR_NODE(item);
3042 _NGI_CLR_HOOK(item);
3044 #ifdef NETGRAPH_DEBUG
3046 TAILQ_REMOVE(&ng_itemlist, item, all);
3048 mtx_unlock(&ngq_mtx);
3050 uma_zfree(((item->el_flags & NGQF_TYPE) == NGQF_DATA) ?
3051 ng_qdzone : ng_qzone, item);
3055 * Change type of the queue entry.
3056 * Possibly reallocates it from another UMA zone.
3058 static __inline item_p
3059 ng_realloc_item(item_p pitem, int type, int flags)
3064 KASSERT((pitem != NULL), ("%s: can't reallocate NULL", __func__));
3065 KASSERT(((type & ~NGQF_TYPE) == 0),
3066 ("%s: incorrect item type: %d", __func__, type));
3068 from = ((pitem->el_flags & NGQF_TYPE) == NGQF_DATA);
3069 to = (type == NGQF_DATA);
3071 /* If reallocation is required do it and copy item. */
3072 if ((item = ng_alloc_item(type, flags)) == NULL) {
3073 ng_free_item(pitem);
3077 ng_free_item(pitem);
3080 item->el_flags = (item->el_flags & ~NGQF_TYPE) | type;
3085 /************************************************************************
3087 ************************************************************************/
3090 * Handle the loading/unloading of a netgraph node type module
3093 ng_mod_event(module_t mod, int event, void *data)
3095 struct ng_type *const type = data;
3101 /* Register new netgraph node type */
3102 if ((error = ng_newtype(type)) != 0)
3105 /* Call type specific code */
3106 if (type->mod_event != NULL)
3107 if ((error = (*type->mod_event)(mod, event, data))) {
3109 type->refs--; /* undo it */
3110 LIST_REMOVE(type, types);
3116 if (type->refs > 1) { /* make sure no nodes exist! */
3119 if (type->refs == 0) /* failed load, nothing to undo */
3121 if (type->mod_event != NULL) { /* check with type */
3122 error = (*type->mod_event)(mod, event, data);
3123 if (error != 0) /* type refuses.. */
3127 LIST_REMOVE(type, types);
3133 if (type->mod_event != NULL)
3134 error = (*type->mod_event)(mod, event, data);
3136 error = EOPNOTSUPP; /* XXX ? */
3143 vnet_netgraph_init(const void *unused __unused)
3146 /* We start with small hashes, but they can grow. */
3147 V_ng_ID_hash = hashinit(16, M_NETGRAPH_NODE, &V_ng_ID_hmask);
3148 V_ng_name_hash = hashinit(16, M_NETGRAPH_NODE, &V_ng_name_hmask);
3150 VNET_SYSINIT(vnet_netgraph_init, SI_SUB_NETGRAPH, SI_ORDER_FIRST,
3151 vnet_netgraph_init, NULL);
3155 vnet_netgraph_uninit(const void *unused __unused)
3157 node_p node = NULL, last_killed = NULL;
3161 /* Find a node to kill */
3163 for (i = 0; i <= V_ng_ID_hmask; i++) {
3164 LIST_FOREACH(node, &V_ng_ID_hash[i], nd_idnodes) {
3165 if (node != &ng_deadnode) {
3175 /* Attempt to kill it only if it is a regular node */
3177 if (node == last_killed) {
3178 if (node->nd_flags & NGF_REALLY_DIE)
3179 panic("ng node %s won't die",
3181 /* The node persisted itself. Try again. */
3182 node->nd_flags |= NGF_REALLY_DIE;
3184 ng_rmnode(node, NULL, NULL, 0);
3185 NG_NODE_UNREF(node);
3188 } while (node != NULL);
3190 hashdestroy(V_ng_name_hash, M_NETGRAPH_NODE, V_ng_name_hmask);
3191 hashdestroy(V_ng_ID_hash, M_NETGRAPH_NODE, V_ng_ID_hmask);
3193 VNET_SYSUNINIT(vnet_netgraph_uninit, SI_SUB_NETGRAPH, SI_ORDER_FIRST,
3194 vnet_netgraph_uninit, NULL);
3198 * Handle loading and unloading for this code.
3199 * The only thing we need to link into is the NETISR strucure.
3202 ngb_mod_event(module_t mod, int event, void *data)
3210 /* Initialize everything. */
3211 NG_WORKLIST_LOCK_INIT();
3212 rw_init(&ng_typelist_lock, "netgraph types");
3213 rw_init(&ng_idhash_lock, "netgraph idhash");
3214 rw_init(&ng_namehash_lock, "netgraph namehash");
3215 rw_init(&ng_topo_lock, "netgraph topology mutex");
3216 #ifdef NETGRAPH_DEBUG
3217 mtx_init(&ng_nodelist_mtx, "netgraph nodelist mutex", NULL,
3219 mtx_init(&ngq_mtx, "netgraph item list mutex", NULL,
3222 ng_qzone = uma_zcreate("NetGraph items", sizeof(struct ng_item),
3223 NULL, NULL, NULL, NULL, UMA_ALIGN_CACHE, 0);
3224 uma_zone_set_max(ng_qzone, maxalloc);
3225 ng_qdzone = uma_zcreate("NetGraph data items",
3226 sizeof(struct ng_item), NULL, NULL, NULL, NULL,
3227 UMA_ALIGN_CACHE, 0);
3228 uma_zone_set_max(ng_qdzone, maxdata);
3229 /* Autoconfigure number of threads. */
3230 if (numthreads <= 0)
3231 numthreads = mp_ncpus;
3232 /* Create threads. */
3233 p = NULL; /* start with no process */
3234 for (i = 0; i < numthreads; i++) {
3235 if (kproc_kthread_add(ngthread, NULL, &p, &td,
3236 RFHIGHPID, 0, "ng_queue", "ng_queue%d", i)) {
3243 /* You can't unload it because an interface may be using it. */
3253 static moduledata_t netgraph_mod = {
3258 DECLARE_MODULE(netgraph, netgraph_mod, SI_SUB_NETGRAPH, SI_ORDER_FIRST);
3259 SYSCTL_NODE(_net, OID_AUTO, graph, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
3261 SYSCTL_INT(_net_graph, OID_AUTO, abi_version, CTLFLAG_RD, SYSCTL_NULL_INT_PTR, NG_ABI_VERSION,"");
3262 SYSCTL_INT(_net_graph, OID_AUTO, msg_version, CTLFLAG_RD, SYSCTL_NULL_INT_PTR, NG_VERSION, "");
3264 #ifdef NETGRAPH_DEBUG
3266 dumphook (hook_p hook, char *file, int line)
3268 printf("hook: name %s, %d refs, Last touched:\n",
3269 _NG_HOOK_NAME(hook), hook->hk_refs);
3270 printf(" Last active @ %s, line %d\n",
3271 hook->lastfile, hook->lastline);
3273 printf(" problem discovered at file %s, line %d\n", file, line);
3281 dumpnode(node_p node, char *file, int line)
3283 printf("node: ID [%x]: type '%s', %d hooks, flags 0x%x, %d refs, %s:\n",
3284 _NG_NODE_ID(node), node->nd_type->name,
3285 node->nd_numhooks, node->nd_flags,
3286 node->nd_refs, node->nd_name);
3287 printf(" Last active @ %s, line %d\n",
3288 node->lastfile, node->lastline);
3290 printf(" problem discovered at file %s, line %d\n", file, line);
3298 dumpitem(item_p item, char *file, int line)
3300 printf(" ACTIVE item, last used at %s, line %d",
3301 item->lastfile, item->lastline);
3302 switch(item->el_flags & NGQF_TYPE) {
3304 printf(" - [data]\n");
3307 printf(" - retaddr[%d]:\n", _NGI_RETADDR(item));
3310 printf(" - fn@%p (%p, %p, %p, %d (%x))\n",
3314 item->body.fn.fn_arg1,
3315 item->body.fn.fn_arg2,
3316 item->body.fn.fn_arg2);
3319 printf(" - fn2@%p (%p, %p, %p, %d (%x))\n",
3323 item->body.fn.fn_arg1,
3324 item->body.fn.fn_arg2,
3325 item->body.fn.fn_arg2);
3329 printf(" problem discovered at file %s, line %d\n", file, line);
3330 if (_NGI_NODE(item)) {
3331 printf("node %p ([%x])\n",
3332 _NGI_NODE(item), ng_node2ID(_NGI_NODE(item)));
3342 TAILQ_FOREACH(item, &ng_itemlist, all) {
3343 printf("[%d] ", i++);
3344 dumpitem(item, NULL, 0);
3353 mtx_lock(&ng_nodelist_mtx);
3354 SLIST_FOREACH(node, &ng_allnodes, nd_all) {
3355 printf("[%d] ", i++);
3356 dumpnode(node, NULL, 0);
3358 mtx_unlock(&ng_nodelist_mtx);
3366 mtx_lock(&ng_nodelist_mtx);
3367 SLIST_FOREACH(hook, &ng_allhooks, hk_all) {
3368 printf("[%d] ", i++);
3369 dumphook(hook, NULL, 0);
3371 mtx_unlock(&ng_nodelist_mtx);
3375 sysctl_debug_ng_dump_items(SYSCTL_HANDLER_ARGS)
3381 error = sysctl_handle_int(oidp, &val, 0, req);
3382 if (error != 0 || req->newptr == NULL)
3392 SYSCTL_PROC(_debug, OID_AUTO, ng_dump_items,
3393 CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_MPSAFE, 0, sizeof(int),
3394 sysctl_debug_ng_dump_items, "I",
3395 "Number of allocated items");
3396 #endif /* NETGRAPH_DEBUG */
3398 /***********************************************************************
3400 **********************************************************************/
3402 * Pick a node off the list of nodes with work,
3403 * try get an item to process off it. Remove the node from the list.
3409 struct epoch_tracker et;
3412 /* Get node from the worklist. */
3414 while ((node = STAILQ_FIRST(&ng_worklist)) == NULL)
3415 NG_WORKLIST_SLEEP();
3416 STAILQ_REMOVE_HEAD(&ng_worklist, nd_input_queue.q_work);
3417 NG_WORKLIST_UNLOCK();
3418 CURVNET_SET(node->nd_vnet);
3419 CTR3(KTR_NET, "%20s: node [%x] (%p) taken off worklist",
3420 __func__, node->nd_ID, node);
3422 * We have the node. We also take over the reference
3423 * that the list had on it.
3424 * Now process as much as you can, until it won't
3425 * let you have another item off the queue.
3426 * All this time, keep the reference
3427 * that lets us be sure that the node still exists.
3428 * Let the reference go at the last minute.
3430 NET_EPOCH_ENTER(et);
3435 NG_QUEUE_LOCK(&node->nd_input_queue);
3436 item = ng_dequeue(node, &rw);
3438 node->nd_input_queue.q_flags2 &= ~NGQ2_WORKQ;
3439 NG_QUEUE_UNLOCK(&node->nd_input_queue);
3440 break; /* go look for another node */
3442 NG_QUEUE_UNLOCK(&node->nd_input_queue);
3443 NGI_GET_NODE(item, node); /* zaps stored node */
3445 if ((item->el_flags & NGQF_TYPE) == NGQF_MESG) {
3447 * NGQF_MESG items should never be processed in
3448 * NET_EPOCH context. So, temporary exit from EPOCH.
3451 ng_apply_item(node, item, rw);
3452 NET_EPOCH_ENTER(et);
3454 ng_apply_item(node, item, rw);
3457 NG_NODE_UNREF(node);
3461 NG_NODE_UNREF(node);
3468 * It's possible that a debugging NG_NODE_REF may need
3469 * to be outside the mutex zone
3472 ng_worklist_add(node_p node)
3475 mtx_assert(&node->nd_input_queue.q_mtx, MA_OWNED);
3477 if ((node->nd_input_queue.q_flags2 & NGQ2_WORKQ) == 0) {
3479 * If we are not already on the work queue,
3482 node->nd_input_queue.q_flags2 |= NGQ2_WORKQ;
3483 NG_NODE_REF(node); /* XXX safe in mutex? */
3485 STAILQ_INSERT_TAIL(&ng_worklist, node, nd_input_queue.q_work);
3486 NG_WORKLIST_UNLOCK();
3487 CTR3(KTR_NET, "%20s: node [%x] (%p) put on worklist", __func__,
3489 NG_WORKLIST_WAKEUP();
3491 CTR3(KTR_NET, "%20s: node [%x] (%p) already on worklist",
3492 __func__, node->nd_ID, node);
3496 /***********************************************************************
3497 * Externally useable functions to set up a queue item ready for sending
3498 ***********************************************************************/
3500 #ifdef NETGRAPH_DEBUG
3501 #define ITEM_DEBUG_CHECKS \
3503 if (NGI_NODE(item) ) { \
3504 printf("item already has node"); \
3505 kdb_enter(KDB_WHY_NETGRAPH, "has node"); \
3506 NGI_CLR_NODE(item); \
3508 if (NGI_HOOK(item) ) { \
3509 printf("item already has hook"); \
3510 kdb_enter(KDB_WHY_NETGRAPH, "has hook"); \
3511 NGI_CLR_HOOK(item); \
3515 #define ITEM_DEBUG_CHECKS
3519 * Put mbuf into the item.
3520 * Hook and node references will be removed when the item is dequeued.
3522 * (XXX) Unsafe because no reference held by peer on remote node.
3523 * remote node might go away in this timescale.
3524 * We know the hooks can't go away because that would require getting
3525 * a writer item on both nodes and we must have at least a reader
3526 * here to be able to do this.
3527 * Note that the hook loaded is the REMOTE hook.
3529 * This is possibly in the critical path for new data.
3532 ng_package_data(struct mbuf *m, int flags)
3536 if ((item = ng_alloc_item(NGQF_DATA, flags)) == NULL) {
3541 item->el_flags |= NGQF_READER;
3547 * Allocate a queue item and put items into it..
3548 * Evaluate the address as this will be needed to queue it and
3549 * to work out what some of the fields should be.
3550 * Hook and node references will be removed when the item is dequeued.
3554 ng_package_msg(struct ng_mesg *msg, int flags)
3558 if ((item = ng_alloc_item(NGQF_MESG, flags)) == NULL) {
3563 /* Messages items count as writers unless explicitly exempted. */
3564 if (msg->header.cmd & NGM_READONLY)
3565 item->el_flags |= NGQF_READER;
3567 item->el_flags |= NGQF_WRITER;
3569 * Set the current lasthook into the queue item
3571 NGI_MSG(item) = msg;
3572 NGI_RETADDR(item) = 0;
3576 #define SET_RETADDR(item, here, retaddr) \
3577 do { /* Data or fn items don't have retaddrs */ \
3578 if ((item->el_flags & NGQF_TYPE) == NGQF_MESG) { \
3580 NGI_RETADDR(item) = retaddr; \
3583 * The old return address should be ok. \
3584 * If there isn't one, use the address \
3587 if (NGI_RETADDR(item) == 0) { \
3589 = ng_node2ID(here); \
3596 ng_address_hook(node_p here, item_p item, hook_p hook, ng_ID_t retaddr)
3602 * Quick sanity check..
3603 * Since a hook holds a reference on its node, once we know
3604 * that the peer is still connected (even if invalid,) we know
3605 * that the peer node is present, though maybe invalid.
3608 if ((hook == NULL) || NG_HOOK_NOT_VALID(hook) ||
3609 NG_HOOK_NOT_VALID(peer = NG_HOOK_PEER(hook)) ||
3610 NG_NODE_NOT_VALID(peernode = NG_PEER_NODE(hook))) {
3618 * Transfer our interest to the other (peer) end.
3621 NG_NODE_REF(peernode);
3622 NGI_SET_HOOK(item, peer);
3623 NGI_SET_NODE(item, peernode);
3624 SET_RETADDR(item, here, retaddr);
3632 ng_address_path(node_p here, item_p item, const char *address, ng_ID_t retaddr)
3640 * Note that ng_path2noderef increments the reference count
3641 * on the node for us if it finds one. So we don't have to.
3643 error = ng_path2noderef(here, address, &dest, &hook);
3648 NGI_SET_NODE(item, dest);
3650 NGI_SET_HOOK(item, hook);
3652 SET_RETADDR(item, here, retaddr);
3657 ng_address_ID(node_p here, item_p item, ng_ID_t ID, ng_ID_t retaddr)
3663 * Find the target node.
3665 dest = ng_ID2noderef(ID); /* GETS REFERENCE! */
3671 /* Fill out the contents */
3672 NGI_SET_NODE(item, dest);
3674 SET_RETADDR(item, here, retaddr);
3679 * special case to send a message to self (e.g. destroy node)
3680 * Possibly indicate an arrival hook too.
3681 * Useful for removing that hook :-)
3684 ng_package_msg_self(node_p here, hook_p hook, struct ng_mesg *msg)
3689 * Find the target node.
3690 * If there is a HOOK argument, then use that in preference
3693 if ((item = ng_alloc_item(NGQF_MESG, NG_NOFLAGS)) == NULL) {
3698 /* Fill out the contents */
3699 item->el_flags |= NGQF_WRITER;
3701 NGI_SET_NODE(item, here);
3704 NGI_SET_HOOK(item, hook);
3706 NGI_MSG(item) = msg;
3707 NGI_RETADDR(item) = ng_node2ID(here);
3712 * Send ng_item_fn function call to the specified node.
3716 ng_send_fn(node_p node, hook_p hook, ng_item_fn *fn, void * arg1, int arg2)
3719 return ng_send_fn1(node, hook, fn, arg1, arg2, NG_NOFLAGS);
3723 ng_send_fn1(node_p node, hook_p hook, ng_item_fn *fn, void * arg1, int arg2,
3728 if ((item = ng_alloc_item(NGQF_FN, flags)) == NULL) {
3731 item->el_flags |= NGQF_WRITER;
3732 NG_NODE_REF(node); /* and one for the item */
3733 NGI_SET_NODE(item, node);
3736 NGI_SET_HOOK(item, hook);
3739 NGI_ARG1(item) = arg1;
3740 NGI_ARG2(item) = arg2;
3741 return(ng_snd_item(item, flags));
3745 * Send ng_item_fn2 function call to the specified node.
3747 * If an optional pitem parameter is supplied, its apply
3748 * callback will be copied to the new item. If also NG_REUSE_ITEM
3749 * flag is set, no new item will be allocated, but pitem will
3753 ng_send_fn2(node_p node, hook_p hook, item_p pitem, ng_item_fn2 *fn, void *arg1,
3754 int arg2, int flags)
3758 KASSERT((pitem != NULL || (flags & NG_REUSE_ITEM) == 0),
3759 ("%s: NG_REUSE_ITEM but no pitem", __func__));
3762 * Allocate a new item if no supplied or
3763 * if we can't use supplied one.
3765 if (pitem == NULL || (flags & NG_REUSE_ITEM) == 0) {
3766 if ((item = ng_alloc_item(NGQF_FN2, flags)) == NULL)
3769 item->apply = pitem->apply;
3771 if ((item = ng_realloc_item(pitem, NGQF_FN2, flags)) == NULL)
3775 item->el_flags = (item->el_flags & ~NGQF_RW) | NGQF_WRITER;
3776 NG_NODE_REF(node); /* and one for the item */
3777 NGI_SET_NODE(item, node);
3780 NGI_SET_HOOK(item, hook);
3783 NGI_ARG1(item) = arg1;
3784 NGI_ARG2(item) = arg2;
3785 return(ng_snd_item(item, flags));
3789 * Official timeout routines for Netgraph nodes.
3792 ng_callout_trampoline(void *arg)
3794 struct epoch_tracker et;
3797 NET_EPOCH_ENTER(et);
3798 CURVNET_SET(NGI_NODE(item)->nd_vnet);
3799 ng_snd_item(item, 0);
3805 ng_callout(struct callout *c, node_p node, hook_p hook, int ticks,
3806 ng_item_fn *fn, void * arg1, int arg2)
3810 if ((item = ng_alloc_item(NGQF_FN, NG_NOFLAGS)) == NULL)
3813 item->el_flags |= NGQF_WRITER;
3814 NG_NODE_REF(node); /* and one for the item */
3815 NGI_SET_NODE(item, node);
3818 NGI_SET_HOOK(item, hook);
3821 NGI_ARG1(item) = arg1;
3822 NGI_ARG2(item) = arg2;
3824 if (callout_reset(c, ticks, &ng_callout_trampoline, item) == 1 &&
3826 NG_FREE_ITEM(oitem);
3831 * Free references and item if callout_stop/callout_drain returned 1,
3832 * meaning that callout was successfully stopped and now references
3836 ng_uncallout_internal(struct callout *c, node_p node)
3841 if ((c->c_func == &ng_callout_trampoline) &&
3842 (item != NULL) && (NGI_NODE(item) == node)) {
3844 * We successfully removed it from the queue before it ran
3845 * So now we need to unreference everything that was
3846 * given extra references. (NG_FREE_ITEM does this).
3854 /* A special modified version of callout_stop() */
3856 ng_uncallout(struct callout *c, node_p node)
3860 rval = callout_stop(c);
3863 * XXXGL: in case if callout is already running and next
3864 * invocation is scheduled at the same time, callout_stop()
3865 * returns 0. See d153eeee97d. In this case netgraph(4) would
3866 * leak resources. However, no nodes are known to induce such
3869 ng_uncallout_internal(c, node);
3874 /* A special modified version of callout_drain() */
3876 ng_uncallout_drain(struct callout *c, node_p node)
3880 rval = callout_drain(c);
3882 ng_uncallout_internal(c, node);
3888 * Set the address, if none given, give the node here.
3891 ng_replace_retaddr(node_p here, item_p item, ng_ID_t retaddr)
3894 NGI_RETADDR(item) = retaddr;
3897 * The old return address should be ok.
3898 * If there isn't one, use the address here.
3900 NGI_RETADDR(item) = ng_node2ID(here);