ng_base.c revision 170035
1/* 2 * ng_base.c 3 */ 4 5/*- 6 * Copyright (c) 1996-1999 Whistle Communications, Inc. 7 * All rights reserved. 8 * 9 * Subject to the following obligations and disclaimer of warranty, use and 10 * redistribution of this software, in source or object code forms, with or 11 * without modifications are expressly permitted by Whistle Communications; 12 * provided, however, that: 13 * 1. Any and all reproductions of the source or object code must include the 14 * copyright notice above and the following disclaimer of warranties; and 15 * 2. No rights are granted, in any manner or form, to use Whistle 16 * Communications, Inc. trademarks, including the mark "WHISTLE 17 * COMMUNICATIONS" on advertising, endorsements, or otherwise except as 18 * such appears in the above copyright notice or in the software. 19 * 20 * THIS SOFTWARE IS BEING PROVIDED BY WHISTLE COMMUNICATIONS "AS IS", AND 21 * TO THE MAXIMUM EXTENT PERMITTED BY LAW, WHISTLE COMMUNICATIONS MAKES NO 22 * REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, REGARDING THIS SOFTWARE, 23 * INCLUDING WITHOUT LIMITATION, ANY AND ALL IMPLIED WARRANTIES OF 24 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT. 25 * WHISTLE COMMUNICATIONS DOES NOT WARRANT, GUARANTEE, OR MAKE ANY 26 * REPRESENTATIONS REGARDING THE USE OF, OR THE RESULTS OF THE USE OF THIS 27 * SOFTWARE IN TERMS OF ITS CORRECTNESS, ACCURACY, RELIABILITY OR OTHERWISE. 28 * IN NO EVENT SHALL WHISTLE COMMUNICATIONS BE LIABLE FOR ANY DAMAGES 29 * RESULTING FROM OR ARISING OUT OF ANY USE OF THIS SOFTWARE, INCLUDING 30 * WITHOUT LIMITATION, ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, 31 * PUNITIVE, OR CONSEQUENTIAL DAMAGES, PROCUREMENT OF SUBSTITUTE GOODS OR 32 * SERVICES, LOSS OF USE, DATA OR PROFITS, HOWEVER CAUSED AND UNDER ANY 33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 35 * THIS SOFTWARE, EVEN IF WHISTLE COMMUNICATIONS IS ADVISED OF THE POSSIBILITY 36 * OF SUCH DAMAGE. 37 * 38 * Authors: Julian Elischer <julian@freebsd.org> 39 * Archie Cobbs <archie@freebsd.org> 40 * 41 * $FreeBSD: head/sys/netgraph/ng_base.c 170035 2007-05-27 20:50:23Z rwatson $ 42 * $Whistle: ng_base.c,v 1.39 1999/01/28 23:54:53 julian Exp $ 43 */ 44 45/* 46 * This file implements the base netgraph code. 47 */ 48 49#include <sys/param.h> 50#include <sys/systm.h> 51#include <sys/ctype.h> 52#include <sys/errno.h> 53#include <sys/kdb.h> 54#include <sys/kernel.h> 55#include <sys/ktr.h> 56#include <sys/limits.h> 57#include <sys/malloc.h> 58#include <sys/mbuf.h> 59#include <sys/queue.h> 60#include <sys/sysctl.h> 61#include <sys/syslog.h> 62 63#include <net/netisr.h> 64 65#include <netgraph/ng_message.h> 66#include <netgraph/netgraph.h> 67#include <netgraph/ng_parse.h> 68 69MODULE_VERSION(netgraph, NG_ABI_VERSION); 70 71/* List of all active nodes */ 72static LIST_HEAD(, ng_node) ng_nodelist; 73static struct mtx ng_nodelist_mtx; 74 75/* Mutex to protect topology events. */ 76static struct mtx ng_topo_mtx; 77 78#ifdef NETGRAPH_DEBUG 79static struct mtx ngq_mtx; /* protects the queue item list */ 80 81static SLIST_HEAD(, ng_node) ng_allnodes; 82static LIST_HEAD(, ng_node) ng_freenodes; /* in debug, we never free() them */ 83static SLIST_HEAD(, ng_hook) ng_allhooks; 84static LIST_HEAD(, ng_hook) ng_freehooks; /* in debug, we never free() them */ 85 86static void ng_dumpitems(void); 87static void ng_dumpnodes(void); 88static void ng_dumphooks(void); 89 90#endif /* NETGRAPH_DEBUG */ 91/* 92 * DEAD versions of the structures. 93 * In order to avoid races, it is sometimes neccesary to point 94 * at SOMETHING even though theoretically, the current entity is 95 * INVALID. Use these to avoid these races. 96 */ 97struct ng_type ng_deadtype = { 98 NG_ABI_VERSION, 99 "dead", 100 NULL, /* modevent */ 101 NULL, /* constructor */ 102 NULL, /* rcvmsg */ 103 NULL, /* shutdown */ 104 NULL, /* newhook */ 105 NULL, /* findhook */ 106 NULL, /* connect */ 107 NULL, /* rcvdata */ 108 NULL, /* disconnect */ 109 NULL, /* cmdlist */ 110}; 111 112struct ng_node ng_deadnode = { 113 "dead", 114 &ng_deadtype, 115 NGF_INVALID, 116 1, /* refs */ 117 0, /* numhooks */ 118 NULL, /* private */ 119 0, /* ID */ 120 LIST_HEAD_INITIALIZER(ng_deadnode.hooks), 121 {}, /* all_nodes list entry */ 122 {}, /* id hashtable list entry */ 123 {}, /* workqueue entry */ 124 { 0, 125 {}, /* should never use! (should hang) */ 126 NULL, 127 &ng_deadnode.nd_input_queue.queue, 128 &ng_deadnode 129 }, 130#ifdef NETGRAPH_DEBUG 131 ND_MAGIC, 132 __FILE__, 133 __LINE__, 134 {NULL} 135#endif /* NETGRAPH_DEBUG */ 136}; 137 138struct ng_hook ng_deadhook = { 139 "dead", 140 NULL, /* private */ 141 HK_INVALID | HK_DEAD, 142 1, /* refs always >= 1 */ 143 0, /* undefined data link type */ 144 &ng_deadhook, /* Peer is self */ 145 &ng_deadnode, /* attached to deadnode */ 146 {}, /* hooks list */ 147 NULL, /* override rcvmsg() */ 148 NULL, /* override rcvdata() */ 149#ifdef NETGRAPH_DEBUG 150 HK_MAGIC, 151 __FILE__, 152 __LINE__, 153 {NULL} 154#endif /* NETGRAPH_DEBUG */ 155}; 156 157/* 158 * END DEAD STRUCTURES 159 */ 160/* List nodes with unallocated work */ 161static TAILQ_HEAD(, ng_node) ng_worklist = TAILQ_HEAD_INITIALIZER(ng_worklist); 162static struct mtx ng_worklist_mtx; /* MUST LOCK NODE FIRST */ 163 164/* List of installed types */ 165static LIST_HEAD(, ng_type) ng_typelist; 166static struct mtx ng_typelist_mtx; 167 168/* Hash related definitions */ 169/* XXX Don't need to initialise them because it's a LIST */ 170#define NG_ID_HASH_SIZE 32 /* most systems wont need even this many */ 171static LIST_HEAD(, ng_node) ng_ID_hash[NG_ID_HASH_SIZE]; 172static struct mtx ng_idhash_mtx; 173/* Method to find a node.. used twice so do it here */ 174#define NG_IDHASH_FN(ID) ((ID) % (NG_ID_HASH_SIZE)) 175#define NG_IDHASH_FIND(ID, node) \ 176 do { \ 177 mtx_assert(&ng_idhash_mtx, MA_OWNED); \ 178 LIST_FOREACH(node, &ng_ID_hash[NG_IDHASH_FN(ID)], \ 179 nd_idnodes) { \ 180 if (NG_NODE_IS_VALID(node) \ 181 && (NG_NODE_ID(node) == ID)) { \ 182 break; \ 183 } \ 184 } \ 185 } while (0) 186 187 188/* Internal functions */ 189static int ng_add_hook(node_p node, const char *name, hook_p * hookp); 190static int ng_generic_msg(node_p here, item_p item, hook_p lasthook); 191static ng_ID_t ng_decodeidname(const char *name); 192static int ngb_mod_event(module_t mod, int event, void *data); 193static void ng_worklist_remove(node_p node); 194static void ngintr(void); 195static void ng_apply_item(node_p node, item_p item, int rw); 196static void ng_flush_input_queue(struct ng_queue * ngq); 197static void ng_setisr(node_p node); 198static node_p ng_ID2noderef(ng_ID_t ID); 199static int ng_con_nodes(node_p node, const char *name, node_p node2, 200 const char *name2); 201static void ng_con_part2(node_p node, hook_p hook, void *arg1, int arg2); 202static void ng_con_part3(node_p node, hook_p hook, void *arg1, int arg2); 203static int ng_mkpeer(node_p node, const char *name, 204 const char *name2, char *type); 205 206/* Imported, these used to be externally visible, some may go back. */ 207void ng_destroy_hook(hook_p hook); 208node_p ng_name2noderef(node_p node, const char *name); 209int ng_path2noderef(node_p here, const char *path, 210 node_p *dest, hook_p *lasthook); 211int ng_make_node(const char *type, node_p *nodepp); 212int ng_path_parse(char *addr, char **node, char **path, char **hook); 213void ng_rmnode(node_p node, hook_p dummy1, void *dummy2, int dummy3); 214void ng_unname(node_p node); 215 216 217/* Our own netgraph malloc type */ 218MALLOC_DEFINE(M_NETGRAPH, "netgraph", "netgraph structures and ctrl messages"); 219MALLOC_DEFINE(M_NETGRAPH_HOOK, "netgraph_hook", "netgraph hook structures"); 220MALLOC_DEFINE(M_NETGRAPH_NODE, "netgraph_node", "netgraph node structures"); 221MALLOC_DEFINE(M_NETGRAPH_ITEM, "netgraph_item", "netgraph item structures"); 222MALLOC_DEFINE(M_NETGRAPH_MSG, "netgraph_msg", "netgraph name storage"); 223 224/* Should not be visible outside this file */ 225 226#define _NG_ALLOC_HOOK(hook) \ 227 MALLOC(hook, hook_p, sizeof(*hook), M_NETGRAPH_HOOK, M_NOWAIT | M_ZERO) 228#define _NG_ALLOC_NODE(node) \ 229 MALLOC(node, node_p, sizeof(*node), M_NETGRAPH_NODE, M_NOWAIT | M_ZERO) 230 231#define NG_QUEUE_LOCK_INIT(n) \ 232 mtx_init(&(n)->q_mtx, "ng_node", NULL, MTX_DEF) 233#define NG_QUEUE_LOCK(n) \ 234 mtx_lock(&(n)->q_mtx) 235#define NG_QUEUE_UNLOCK(n) \ 236 mtx_unlock(&(n)->q_mtx) 237#define NG_WORKLIST_LOCK_INIT() \ 238 mtx_init(&ng_worklist_mtx, "ng_worklist", NULL, MTX_DEF) 239#define NG_WORKLIST_LOCK() \ 240 mtx_lock(&ng_worklist_mtx) 241#define NG_WORKLIST_UNLOCK() \ 242 mtx_unlock(&ng_worklist_mtx) 243 244#ifdef NETGRAPH_DEBUG /*----------------------------------------------*/ 245/* 246 * In debug mode: 247 * In an attempt to help track reference count screwups 248 * we do not free objects back to the malloc system, but keep them 249 * in a local cache where we can examine them and keep information safely 250 * after they have been freed. 251 * We use this scheme for nodes and hooks, and to some extent for items. 252 */ 253static __inline hook_p 254ng_alloc_hook(void) 255{ 256 hook_p hook; 257 SLIST_ENTRY(ng_hook) temp; 258 mtx_lock(&ng_nodelist_mtx); 259 hook = LIST_FIRST(&ng_freehooks); 260 if (hook) { 261 LIST_REMOVE(hook, hk_hooks); 262 bcopy(&hook->hk_all, &temp, sizeof(temp)); 263 bzero(hook, sizeof(struct ng_hook)); 264 bcopy(&temp, &hook->hk_all, sizeof(temp)); 265 mtx_unlock(&ng_nodelist_mtx); 266 hook->hk_magic = HK_MAGIC; 267 } else { 268 mtx_unlock(&ng_nodelist_mtx); 269 _NG_ALLOC_HOOK(hook); 270 if (hook) { 271 hook->hk_magic = HK_MAGIC; 272 mtx_lock(&ng_nodelist_mtx); 273 SLIST_INSERT_HEAD(&ng_allhooks, hook, hk_all); 274 mtx_unlock(&ng_nodelist_mtx); 275 } 276 } 277 return (hook); 278} 279 280static __inline node_p 281ng_alloc_node(void) 282{ 283 node_p node; 284 SLIST_ENTRY(ng_node) temp; 285 mtx_lock(&ng_nodelist_mtx); 286 node = LIST_FIRST(&ng_freenodes); 287 if (node) { 288 LIST_REMOVE(node, nd_nodes); 289 bcopy(&node->nd_all, &temp, sizeof(temp)); 290 bzero(node, sizeof(struct ng_node)); 291 bcopy(&temp, &node->nd_all, sizeof(temp)); 292 mtx_unlock(&ng_nodelist_mtx); 293 node->nd_magic = ND_MAGIC; 294 } else { 295 mtx_unlock(&ng_nodelist_mtx); 296 _NG_ALLOC_NODE(node); 297 if (node) { 298 node->nd_magic = ND_MAGIC; 299 mtx_lock(&ng_nodelist_mtx); 300 SLIST_INSERT_HEAD(&ng_allnodes, node, nd_all); 301 mtx_unlock(&ng_nodelist_mtx); 302 } 303 } 304 return (node); 305} 306 307#define NG_ALLOC_HOOK(hook) do { (hook) = ng_alloc_hook(); } while (0) 308#define NG_ALLOC_NODE(node) do { (node) = ng_alloc_node(); } while (0) 309 310 311#define NG_FREE_HOOK(hook) \ 312 do { \ 313 mtx_lock(&ng_nodelist_mtx); \ 314 LIST_INSERT_HEAD(&ng_freehooks, hook, hk_hooks); \ 315 hook->hk_magic = 0; \ 316 mtx_unlock(&ng_nodelist_mtx); \ 317 } while (0) 318 319#define NG_FREE_NODE(node) \ 320 do { \ 321 mtx_lock(&ng_nodelist_mtx); \ 322 LIST_INSERT_HEAD(&ng_freenodes, node, nd_nodes); \ 323 node->nd_magic = 0; \ 324 mtx_unlock(&ng_nodelist_mtx); \ 325 } while (0) 326 327#else /* NETGRAPH_DEBUG */ /*----------------------------------------------*/ 328 329#define NG_ALLOC_HOOK(hook) _NG_ALLOC_HOOK(hook) 330#define NG_ALLOC_NODE(node) _NG_ALLOC_NODE(node) 331 332#define NG_FREE_HOOK(hook) do { FREE((hook), M_NETGRAPH_HOOK); } while (0) 333#define NG_FREE_NODE(node) do { FREE((node), M_NETGRAPH_NODE); } while (0) 334 335#endif /* NETGRAPH_DEBUG */ /*----------------------------------------------*/ 336 337/* Set this to kdb_enter("X") to catch all errors as they occur */ 338#ifndef TRAP_ERROR 339#define TRAP_ERROR() 340#endif 341 342static ng_ID_t nextID = 1; 343 344#ifdef INVARIANTS 345#define CHECK_DATA_MBUF(m) do { \ 346 struct mbuf *n; \ 347 int total; \ 348 \ 349 M_ASSERTPKTHDR(m); \ 350 for (total = 0, n = (m); n != NULL; n = n->m_next) { \ 351 total += n->m_len; \ 352 if (n->m_nextpkt != NULL) \ 353 panic("%s: m_nextpkt", __func__); \ 354 } \ 355 \ 356 if ((m)->m_pkthdr.len != total) { \ 357 panic("%s: %d != %d", \ 358 __func__, (m)->m_pkthdr.len, total); \ 359 } \ 360 } while (0) 361#else 362#define CHECK_DATA_MBUF(m) 363#endif 364 365 366/************************************************************************ 367 Parse type definitions for generic messages 368************************************************************************/ 369 370/* Handy structure parse type defining macro */ 371#define DEFINE_PARSE_STRUCT_TYPE(lo, up, args) \ 372static const struct ng_parse_struct_field \ 373 ng_ ## lo ## _type_fields[] = NG_GENERIC_ ## up ## _INFO args; \ 374static const struct ng_parse_type ng_generic_ ## lo ## _type = { \ 375 &ng_parse_struct_type, \ 376 &ng_ ## lo ## _type_fields \ 377} 378 379DEFINE_PARSE_STRUCT_TYPE(mkpeer, MKPEER, ()); 380DEFINE_PARSE_STRUCT_TYPE(connect, CONNECT, ()); 381DEFINE_PARSE_STRUCT_TYPE(name, NAME, ()); 382DEFINE_PARSE_STRUCT_TYPE(rmhook, RMHOOK, ()); 383DEFINE_PARSE_STRUCT_TYPE(nodeinfo, NODEINFO, ()); 384DEFINE_PARSE_STRUCT_TYPE(typeinfo, TYPEINFO, ()); 385DEFINE_PARSE_STRUCT_TYPE(linkinfo, LINKINFO, (&ng_generic_nodeinfo_type)); 386 387/* Get length of an array when the length is stored as a 32 bit 388 value immediately preceding the array -- as with struct namelist 389 and struct typelist. */ 390static int 391ng_generic_list_getLength(const struct ng_parse_type *type, 392 const u_char *start, const u_char *buf) 393{ 394 return *((const u_int32_t *)(buf - 4)); 395} 396 397/* Get length of the array of struct linkinfo inside a struct hooklist */ 398static int 399ng_generic_linkinfo_getLength(const struct ng_parse_type *type, 400 const u_char *start, const u_char *buf) 401{ 402 const struct hooklist *hl = (const struct hooklist *)start; 403 404 return hl->nodeinfo.hooks; 405} 406 407/* Array type for a variable length array of struct namelist */ 408static const struct ng_parse_array_info ng_nodeinfoarray_type_info = { 409 &ng_generic_nodeinfo_type, 410 &ng_generic_list_getLength 411}; 412static const struct ng_parse_type ng_generic_nodeinfoarray_type = { 413 &ng_parse_array_type, 414 &ng_nodeinfoarray_type_info 415}; 416 417/* Array type for a variable length array of struct typelist */ 418static const struct ng_parse_array_info ng_typeinfoarray_type_info = { 419 &ng_generic_typeinfo_type, 420 &ng_generic_list_getLength 421}; 422static const struct ng_parse_type ng_generic_typeinfoarray_type = { 423 &ng_parse_array_type, 424 &ng_typeinfoarray_type_info 425}; 426 427/* Array type for array of struct linkinfo in struct hooklist */ 428static const struct ng_parse_array_info ng_generic_linkinfo_array_type_info = { 429 &ng_generic_linkinfo_type, 430 &ng_generic_linkinfo_getLength 431}; 432static const struct ng_parse_type ng_generic_linkinfo_array_type = { 433 &ng_parse_array_type, 434 &ng_generic_linkinfo_array_type_info 435}; 436 437DEFINE_PARSE_STRUCT_TYPE(typelist, TYPELIST, (&ng_generic_nodeinfoarray_type)); 438DEFINE_PARSE_STRUCT_TYPE(hooklist, HOOKLIST, 439 (&ng_generic_nodeinfo_type, &ng_generic_linkinfo_array_type)); 440DEFINE_PARSE_STRUCT_TYPE(listnodes, LISTNODES, 441 (&ng_generic_nodeinfoarray_type)); 442 443/* List of commands and how to convert arguments to/from ASCII */ 444static const struct ng_cmdlist ng_generic_cmds[] = { 445 { 446 NGM_GENERIC_COOKIE, 447 NGM_SHUTDOWN, 448 "shutdown", 449 NULL, 450 NULL 451 }, 452 { 453 NGM_GENERIC_COOKIE, 454 NGM_MKPEER, 455 "mkpeer", 456 &ng_generic_mkpeer_type, 457 NULL 458 }, 459 { 460 NGM_GENERIC_COOKIE, 461 NGM_CONNECT, 462 "connect", 463 &ng_generic_connect_type, 464 NULL 465 }, 466 { 467 NGM_GENERIC_COOKIE, 468 NGM_NAME, 469 "name", 470 &ng_generic_name_type, 471 NULL 472 }, 473 { 474 NGM_GENERIC_COOKIE, 475 NGM_RMHOOK, 476 "rmhook", 477 &ng_generic_rmhook_type, 478 NULL 479 }, 480 { 481 NGM_GENERIC_COOKIE, 482 NGM_NODEINFO, 483 "nodeinfo", 484 NULL, 485 &ng_generic_nodeinfo_type 486 }, 487 { 488 NGM_GENERIC_COOKIE, 489 NGM_LISTHOOKS, 490 "listhooks", 491 NULL, 492 &ng_generic_hooklist_type 493 }, 494 { 495 NGM_GENERIC_COOKIE, 496 NGM_LISTNAMES, 497 "listnames", 498 NULL, 499 &ng_generic_listnodes_type /* same as NGM_LISTNODES */ 500 }, 501 { 502 NGM_GENERIC_COOKIE, 503 NGM_LISTNODES, 504 "listnodes", 505 NULL, 506 &ng_generic_listnodes_type 507 }, 508 { 509 NGM_GENERIC_COOKIE, 510 NGM_LISTTYPES, 511 "listtypes", 512 NULL, 513 &ng_generic_typeinfo_type 514 }, 515 { 516 NGM_GENERIC_COOKIE, 517 NGM_TEXT_CONFIG, 518 "textconfig", 519 NULL, 520 &ng_parse_string_type 521 }, 522 { 523 NGM_GENERIC_COOKIE, 524 NGM_TEXT_STATUS, 525 "textstatus", 526 NULL, 527 &ng_parse_string_type 528 }, 529 { 530 NGM_GENERIC_COOKIE, 531 NGM_ASCII2BINARY, 532 "ascii2binary", 533 &ng_parse_ng_mesg_type, 534 &ng_parse_ng_mesg_type 535 }, 536 { 537 NGM_GENERIC_COOKIE, 538 NGM_BINARY2ASCII, 539 "binary2ascii", 540 &ng_parse_ng_mesg_type, 541 &ng_parse_ng_mesg_type 542 }, 543 { 0 } 544}; 545 546/************************************************************************ 547 Node routines 548************************************************************************/ 549 550/* 551 * Instantiate a node of the requested type 552 */ 553int 554ng_make_node(const char *typename, node_p *nodepp) 555{ 556 struct ng_type *type; 557 int error; 558 559 /* Check that the type makes sense */ 560 if (typename == NULL) { 561 TRAP_ERROR(); 562 return (EINVAL); 563 } 564 565 /* Locate the node type. If we fail we return. Do not try to load 566 * module. 567 */ 568 if ((type = ng_findtype(typename)) == NULL) 569 return (ENXIO); 570 571 /* 572 * If we have a constructor, then make the node and 573 * call the constructor to do type specific initialisation. 574 */ 575 if (type->constructor != NULL) { 576 if ((error = ng_make_node_common(type, nodepp)) == 0) { 577 if ((error = ((*type->constructor)(*nodepp)) != 0)) { 578 NG_NODE_UNREF(*nodepp); 579 } 580 } 581 } else { 582 /* 583 * Node has no constructor. We cannot ask for one 584 * to be made. It must be brought into existence by 585 * some external agency. The external agency should 586 * call ng_make_node_common() directly to get the 587 * netgraph part initialised. 588 */ 589 TRAP_ERROR(); 590 error = EINVAL; 591 } 592 return (error); 593} 594 595/* 596 * Generic node creation. Called by node initialisation for externally 597 * instantiated nodes (e.g. hardware, sockets, etc ). 598 * The returned node has a reference count of 1. 599 */ 600int 601ng_make_node_common(struct ng_type *type, node_p *nodepp) 602{ 603 node_p node; 604 605 /* Require the node type to have been already installed */ 606 if (ng_findtype(type->name) == NULL) { 607 TRAP_ERROR(); 608 return (EINVAL); 609 } 610 611 /* Make a node and try attach it to the type */ 612 NG_ALLOC_NODE(node); 613 if (node == NULL) { 614 TRAP_ERROR(); 615 return (ENOMEM); 616 } 617 node->nd_type = type; 618 NG_NODE_REF(node); /* note reference */ 619 type->refs++; 620 621 NG_QUEUE_LOCK_INIT(&node->nd_input_queue); 622 node->nd_input_queue.queue = NULL; 623 node->nd_input_queue.last = &node->nd_input_queue.queue; 624 node->nd_input_queue.q_flags = 0; 625 node->nd_input_queue.q_node = node; 626 627 /* Initialize hook list for new node */ 628 LIST_INIT(&node->nd_hooks); 629 630 /* Link us into the node linked list */ 631 mtx_lock(&ng_nodelist_mtx); 632 LIST_INSERT_HEAD(&ng_nodelist, node, nd_nodes); 633 mtx_unlock(&ng_nodelist_mtx); 634 635 636 /* get an ID and put us in the hash chain */ 637 mtx_lock(&ng_idhash_mtx); 638 for (;;) { /* wrap protection, even if silly */ 639 node_p node2 = NULL; 640 node->nd_ID = nextID++; /* 137/second for 1 year before wrap */ 641 642 /* Is there a problem with the new number? */ 643 NG_IDHASH_FIND(node->nd_ID, node2); /* already taken? */ 644 if ((node->nd_ID != 0) && (node2 == NULL)) { 645 break; 646 } 647 } 648 LIST_INSERT_HEAD(&ng_ID_hash[NG_IDHASH_FN(node->nd_ID)], 649 node, nd_idnodes); 650 mtx_unlock(&ng_idhash_mtx); 651 652 /* Done */ 653 *nodepp = node; 654 return (0); 655} 656 657/* 658 * Forceably start the shutdown process on a node. Either call 659 * its shutdown method, or do the default shutdown if there is 660 * no type-specific method. 661 * 662 * We can only be called from a shutdown message, so we know we have 663 * a writer lock, and therefore exclusive access. It also means 664 * that we should not be on the work queue, but we check anyhow. 665 * 666 * Persistent node types must have a type-specific method which 667 * allocates a new node in which case, this one is irretrievably going away, 668 * or cleans up anything it needs, and just makes the node valid again, 669 * in which case we allow the node to survive. 670 * 671 * XXX We need to think of how to tell a persistent node that we 672 * REALLY need to go away because the hardware has gone or we 673 * are rebooting.... etc. 674 */ 675void 676ng_rmnode(node_p node, hook_p dummy1, void *dummy2, int dummy3) 677{ 678 hook_p hook; 679 680 /* Check if it's already shutting down */ 681 if ((node->nd_flags & NGF_CLOSING) != 0) 682 return; 683 684 if (node == &ng_deadnode) { 685 printf ("shutdown called on deadnode\n"); 686 return; 687 } 688 689 /* Add an extra reference so it doesn't go away during this */ 690 NG_NODE_REF(node); 691 692 /* 693 * Mark it invalid so any newcomers know not to try use it 694 * Also add our own mark so we can't recurse 695 * note that NGF_INVALID does not do this as it's also set during 696 * creation 697 */ 698 node->nd_flags |= NGF_INVALID|NGF_CLOSING; 699 700 /* If node has its pre-shutdown method, then call it first*/ 701 if (node->nd_type && node->nd_type->close) 702 (*node->nd_type->close)(node); 703 704 /* Notify all remaining connected nodes to disconnect */ 705 while ((hook = LIST_FIRST(&node->nd_hooks)) != NULL) 706 ng_destroy_hook(hook); 707 708 /* 709 * Drain the input queue forceably. 710 * it has no hooks so what's it going to do, bleed on someone? 711 * Theoretically we came here from a queue entry that was added 712 * Just before the queue was closed, so it should be empty anyway. 713 * Also removes us from worklist if needed. 714 */ 715 ng_flush_input_queue(&node->nd_input_queue); 716 717 /* Ask the type if it has anything to do in this case */ 718 if (node->nd_type && node->nd_type->shutdown) { 719 (*node->nd_type->shutdown)(node); 720 if (NG_NODE_IS_VALID(node)) { 721 /* 722 * Well, blow me down if the node code hasn't declared 723 * that it doesn't want to die. 724 * Presumably it is a persistant node. 725 * If we REALLY want it to go away, 726 * e.g. hardware going away, 727 * Our caller should set NGF_REALLY_DIE in nd_flags. 728 */ 729 node->nd_flags &= ~(NGF_INVALID|NGF_CLOSING); 730 NG_NODE_UNREF(node); /* Assume they still have theirs */ 731 return; 732 } 733 } else { /* do the default thing */ 734 NG_NODE_UNREF(node); 735 } 736 737 ng_unname(node); /* basically a NOP these days */ 738 739 /* 740 * Remove extra reference, possibly the last 741 * Possible other holders of references may include 742 * timeout callouts, but theoretically the node's supposed to 743 * have cancelled them. Possibly hardware dependencies may 744 * force a driver to 'linger' with a reference. 745 */ 746 NG_NODE_UNREF(node); 747} 748 749/* 750 * Remove a reference to the node, possibly the last. 751 * deadnode always acts as it it were the last. 752 */ 753int 754ng_unref_node(node_p node) 755{ 756 int v; 757 758 if (node == &ng_deadnode) { 759 return (0); 760 } 761 762 do { 763 v = node->nd_refs - 1; 764 } while (! atomic_cmpset_int(&node->nd_refs, v + 1, v)); 765 766 if (v == 0) { /* we were the last */ 767 768 mtx_lock(&ng_nodelist_mtx); 769 node->nd_type->refs--; /* XXX maybe should get types lock? */ 770 LIST_REMOVE(node, nd_nodes); 771 mtx_unlock(&ng_nodelist_mtx); 772 773 mtx_lock(&ng_idhash_mtx); 774 LIST_REMOVE(node, nd_idnodes); 775 mtx_unlock(&ng_idhash_mtx); 776 777 mtx_destroy(&node->nd_input_queue.q_mtx); 778 NG_FREE_NODE(node); 779 } 780 return (v); 781} 782 783/************************************************************************ 784 Node ID handling 785************************************************************************/ 786static node_p 787ng_ID2noderef(ng_ID_t ID) 788{ 789 node_p node; 790 mtx_lock(&ng_idhash_mtx); 791 NG_IDHASH_FIND(ID, node); 792 if(node) 793 NG_NODE_REF(node); 794 mtx_unlock(&ng_idhash_mtx); 795 return(node); 796} 797 798ng_ID_t 799ng_node2ID(node_p node) 800{ 801 return (node ? NG_NODE_ID(node) : 0); 802} 803 804/************************************************************************ 805 Node name handling 806************************************************************************/ 807 808/* 809 * Assign a node a name. Once assigned, the name cannot be changed. 810 */ 811int 812ng_name_node(node_p node, const char *name) 813{ 814 int i; 815 node_p node2; 816 817 /* Check the name is valid */ 818 for (i = 0; i < NG_NODESIZ; i++) { 819 if (name[i] == '\0' || name[i] == '.' || name[i] == ':') 820 break; 821 } 822 if (i == 0 || name[i] != '\0') { 823 TRAP_ERROR(); 824 return (EINVAL); 825 } 826 if (ng_decodeidname(name) != 0) { /* valid IDs not allowed here */ 827 TRAP_ERROR(); 828 return (EINVAL); 829 } 830 831 /* Check the name isn't already being used */ 832 if ((node2 = ng_name2noderef(node, name)) != NULL) { 833 NG_NODE_UNREF(node2); 834 TRAP_ERROR(); 835 return (EADDRINUSE); 836 } 837 838 /* copy it */ 839 strlcpy(NG_NODE_NAME(node), name, NG_NODESIZ); 840 841 return (0); 842} 843 844/* 845 * Find a node by absolute name. The name should NOT end with ':' 846 * The name "." means "this node" and "[xxx]" means "the node 847 * with ID (ie, at address) xxx". 848 * 849 * Returns the node if found, else NULL. 850 * Eventually should add something faster than a sequential search. 851 * Note it acquires a reference on the node so you can be sure it's still 852 * there. 853 */ 854node_p 855ng_name2noderef(node_p here, const char *name) 856{ 857 node_p node; 858 ng_ID_t temp; 859 860 /* "." means "this node" */ 861 if (strcmp(name, ".") == 0) { 862 NG_NODE_REF(here); 863 return(here); 864 } 865 866 /* Check for name-by-ID */ 867 if ((temp = ng_decodeidname(name)) != 0) { 868 return (ng_ID2noderef(temp)); 869 } 870 871 /* Find node by name */ 872 mtx_lock(&ng_nodelist_mtx); 873 LIST_FOREACH(node, &ng_nodelist, nd_nodes) { 874 if (NG_NODE_IS_VALID(node) 875 && NG_NODE_HAS_NAME(node) 876 && (strcmp(NG_NODE_NAME(node), name) == 0)) { 877 break; 878 } 879 } 880 if (node) 881 NG_NODE_REF(node); 882 mtx_unlock(&ng_nodelist_mtx); 883 return (node); 884} 885 886/* 887 * Decode an ID name, eg. "[f03034de]". Returns 0 if the 888 * string is not valid, otherwise returns the value. 889 */ 890static ng_ID_t 891ng_decodeidname(const char *name) 892{ 893 const int len = strlen(name); 894 char *eptr; 895 u_long val; 896 897 /* Check for proper length, brackets, no leading junk */ 898 if ((len < 3) 899 || (name[0] != '[') 900 || (name[len - 1] != ']') 901 || (!isxdigit(name[1]))) { 902 return ((ng_ID_t)0); 903 } 904 905 /* Decode number */ 906 val = strtoul(name + 1, &eptr, 16); 907 if ((eptr - name != len - 1) 908 || (val == ULONG_MAX) 909 || (val == 0)) { 910 return ((ng_ID_t)0); 911 } 912 return (ng_ID_t)val; 913} 914 915/* 916 * Remove a name from a node. This should only be called 917 * when shutting down and removing the node. 918 * IF we allow name changing this may be more resurrected. 919 */ 920void 921ng_unname(node_p node) 922{ 923} 924 925/************************************************************************ 926 Hook routines 927 Names are not optional. Hooks are always connected, except for a 928 brief moment within these routines. On invalidation or during creation 929 they are connected to the 'dead' hook. 930************************************************************************/ 931 932/* 933 * Remove a hook reference 934 */ 935void 936ng_unref_hook(hook_p hook) 937{ 938 int v; 939 940 if (hook == &ng_deadhook) { 941 return; 942 } 943 do { 944 v = hook->hk_refs; 945 } while (! atomic_cmpset_int(&hook->hk_refs, v, v - 1)); 946 947 if (v == 1) { /* we were the last */ 948 if (_NG_HOOK_NODE(hook)) { /* it'll probably be ng_deadnode */ 949 _NG_NODE_UNREF((_NG_HOOK_NODE(hook))); 950 hook->hk_node = NULL; 951 } 952 NG_FREE_HOOK(hook); 953 } 954} 955 956/* 957 * Add an unconnected hook to a node. Only used internally. 958 * Assumes node is locked. (XXX not yet true ) 959 */ 960static int 961ng_add_hook(node_p node, const char *name, hook_p *hookp) 962{ 963 hook_p hook; 964 int error = 0; 965 966 /* Check that the given name is good */ 967 if (name == NULL) { 968 TRAP_ERROR(); 969 return (EINVAL); 970 } 971 if (ng_findhook(node, name) != NULL) { 972 TRAP_ERROR(); 973 return (EEXIST); 974 } 975 976 /* Allocate the hook and link it up */ 977 NG_ALLOC_HOOK(hook); 978 if (hook == NULL) { 979 TRAP_ERROR(); 980 return (ENOMEM); 981 } 982 hook->hk_refs = 1; /* add a reference for us to return */ 983 hook->hk_flags = HK_INVALID; 984 hook->hk_peer = &ng_deadhook; /* start off this way */ 985 hook->hk_node = node; 986 NG_NODE_REF(node); /* each hook counts as a reference */ 987 988 /* Set hook name */ 989 strlcpy(NG_HOOK_NAME(hook), name, NG_HOOKSIZ); 990 991 /* 992 * Check if the node type code has something to say about it 993 * If it fails, the unref of the hook will also unref the node. 994 */ 995 if (node->nd_type->newhook != NULL) { 996 if ((error = (*node->nd_type->newhook)(node, hook, name))) { 997 NG_HOOK_UNREF(hook); /* this frees the hook */ 998 return (error); 999 } 1000 } 1001 /* 1002 * The 'type' agrees so far, so go ahead and link it in. 1003 * We'll ask again later when we actually connect the hooks. 1004 */ 1005 LIST_INSERT_HEAD(&node->nd_hooks, hook, hk_hooks); 1006 node->nd_numhooks++; 1007 NG_HOOK_REF(hook); /* one for the node */ 1008 1009 if (hookp) 1010 *hookp = hook; 1011 return (0); 1012} 1013 1014/* 1015 * Find a hook 1016 * 1017 * Node types may supply their own optimized routines for finding 1018 * hooks. If none is supplied, we just do a linear search. 1019 * XXX Possibly we should add a reference to the hook? 1020 */ 1021hook_p 1022ng_findhook(node_p node, const char *name) 1023{ 1024 hook_p hook; 1025 1026 if (node->nd_type->findhook != NULL) 1027 return (*node->nd_type->findhook)(node, name); 1028 LIST_FOREACH(hook, &node->nd_hooks, hk_hooks) { 1029 if (NG_HOOK_IS_VALID(hook) 1030 && (strcmp(NG_HOOK_NAME(hook), name) == 0)) 1031 return (hook); 1032 } 1033 return (NULL); 1034} 1035 1036/* 1037 * Destroy a hook 1038 * 1039 * As hooks are always attached, this really destroys two hooks. 1040 * The one given, and the one attached to it. Disconnect the hooks 1041 * from each other first. We reconnect the peer hook to the 'dead' 1042 * hook so that it can still exist after we depart. We then 1043 * send the peer its own destroy message. This ensures that we only 1044 * interact with the peer's structures when it is locked processing that 1045 * message. We hold a reference to the peer hook so we are guaranteed that 1046 * the peer hook and node are still going to exist until 1047 * we are finished there as the hook holds a ref on the node. 1048 * We run this same code again on the peer hook, but that time it is already 1049 * attached to the 'dead' hook. 1050 * 1051 * This routine is called at all stages of hook creation 1052 * on error detection and must be able to handle any such stage. 1053 */ 1054void 1055ng_destroy_hook(hook_p hook) 1056{ 1057 hook_p peer; 1058 node_p node; 1059 1060 if (hook == &ng_deadhook) { /* better safe than sorry */ 1061 printf("ng_destroy_hook called on deadhook\n"); 1062 return; 1063 } 1064 1065 /* 1066 * Protect divorce process with mutex, to avoid races on 1067 * simultaneous disconnect. 1068 */ 1069 mtx_lock(&ng_topo_mtx); 1070 1071 hook->hk_flags |= HK_INVALID; 1072 1073 peer = NG_HOOK_PEER(hook); 1074 node = NG_HOOK_NODE(hook); 1075 1076 if (peer && (peer != &ng_deadhook)) { 1077 /* 1078 * Set the peer to point to ng_deadhook 1079 * from this moment on we are effectively independent it. 1080 * send it an rmhook message of it's own. 1081 */ 1082 peer->hk_peer = &ng_deadhook; /* They no longer know us */ 1083 hook->hk_peer = &ng_deadhook; /* Nor us, them */ 1084 if (NG_HOOK_NODE(peer) == &ng_deadnode) { 1085 /* 1086 * If it's already divorced from a node, 1087 * just free it. 1088 */ 1089 mtx_unlock(&ng_topo_mtx); 1090 } else { 1091 mtx_unlock(&ng_topo_mtx); 1092 ng_rmhook_self(peer); /* Send it a surprise */ 1093 } 1094 NG_HOOK_UNREF(peer); /* account for peer link */ 1095 NG_HOOK_UNREF(hook); /* account for peer link */ 1096 } else 1097 mtx_unlock(&ng_topo_mtx); 1098 1099 mtx_assert(&ng_topo_mtx, MA_NOTOWNED); 1100 1101 /* 1102 * Remove the hook from the node's list to avoid possible recursion 1103 * in case the disconnection results in node shutdown. 1104 */ 1105 if (node == &ng_deadnode) { /* happens if called from ng_con_nodes() */ 1106 return; 1107 } 1108 LIST_REMOVE(hook, hk_hooks); 1109 node->nd_numhooks--; 1110 if (node->nd_type->disconnect) { 1111 /* 1112 * The type handler may elect to destroy the node so don't 1113 * trust its existence after this point. (except 1114 * that we still hold a reference on it. (which we 1115 * inherrited from the hook we are destroying) 1116 */ 1117 (*node->nd_type->disconnect) (hook); 1118 } 1119 1120 /* 1121 * Note that because we will point to ng_deadnode, the original node 1122 * is not decremented automatically so we do that manually. 1123 */ 1124 _NG_HOOK_NODE(hook) = &ng_deadnode; 1125 NG_NODE_UNREF(node); /* We no longer point to it so adjust count */ 1126 NG_HOOK_UNREF(hook); /* Account for linkage (in list) to node */ 1127} 1128 1129/* 1130 * Take two hooks on a node and merge the connection so that the given node 1131 * is effectively bypassed. 1132 */ 1133int 1134ng_bypass(hook_p hook1, hook_p hook2) 1135{ 1136 if (hook1->hk_node != hook2->hk_node) { 1137 TRAP_ERROR(); 1138 return (EINVAL); 1139 } 1140 hook1->hk_peer->hk_peer = hook2->hk_peer; 1141 hook2->hk_peer->hk_peer = hook1->hk_peer; 1142 1143 hook1->hk_peer = &ng_deadhook; 1144 hook2->hk_peer = &ng_deadhook; 1145 1146 NG_HOOK_UNREF(hook1); 1147 NG_HOOK_UNREF(hook2); 1148 1149 /* XXX If we ever cache methods on hooks update them as well */ 1150 ng_destroy_hook(hook1); 1151 ng_destroy_hook(hook2); 1152 return (0); 1153} 1154 1155/* 1156 * Install a new netgraph type 1157 */ 1158int 1159ng_newtype(struct ng_type *tp) 1160{ 1161 const size_t namelen = strlen(tp->name); 1162 1163 /* Check version and type name fields */ 1164 if ((tp->version != NG_ABI_VERSION) 1165 || (namelen == 0) 1166 || (namelen >= NG_TYPESIZ)) { 1167 TRAP_ERROR(); 1168 if (tp->version != NG_ABI_VERSION) { 1169 printf("Netgraph: Node type rejected. ABI mismatch. Suggest recompile\n"); 1170 } 1171 return (EINVAL); 1172 } 1173 1174 /* Check for name collision */ 1175 if (ng_findtype(tp->name) != NULL) { 1176 TRAP_ERROR(); 1177 return (EEXIST); 1178 } 1179 1180 1181 /* Link in new type */ 1182 mtx_lock(&ng_typelist_mtx); 1183 LIST_INSERT_HEAD(&ng_typelist, tp, types); 1184 tp->refs = 1; /* first ref is linked list */ 1185 mtx_unlock(&ng_typelist_mtx); 1186 return (0); 1187} 1188 1189/* 1190 * unlink a netgraph type 1191 * If no examples exist 1192 */ 1193int 1194ng_rmtype(struct ng_type *tp) 1195{ 1196 /* Check for name collision */ 1197 if (tp->refs != 1) { 1198 TRAP_ERROR(); 1199 return (EBUSY); 1200 } 1201 1202 /* Unlink type */ 1203 mtx_lock(&ng_typelist_mtx); 1204 LIST_REMOVE(tp, types); 1205 mtx_unlock(&ng_typelist_mtx); 1206 return (0); 1207} 1208 1209/* 1210 * Look for a type of the name given 1211 */ 1212struct ng_type * 1213ng_findtype(const char *typename) 1214{ 1215 struct ng_type *type; 1216 1217 mtx_lock(&ng_typelist_mtx); 1218 LIST_FOREACH(type, &ng_typelist, types) { 1219 if (strcmp(type->name, typename) == 0) 1220 break; 1221 } 1222 mtx_unlock(&ng_typelist_mtx); 1223 return (type); 1224} 1225 1226/************************************************************************ 1227 Composite routines 1228************************************************************************/ 1229/* 1230 * Connect two nodes using the specified hooks, using queued functions. 1231 */ 1232static void 1233ng_con_part3(node_p node, hook_p hook, void *arg1, int arg2) 1234{ 1235 1236 /* 1237 * When we run, we know that the node 'node' is locked for us. 1238 * Our caller has a reference on the hook. 1239 * Our caller has a reference on the node. 1240 * (In this case our caller is ng_apply_item() ). 1241 * The peer hook has a reference on the hook. 1242 * We are all set up except for the final call to the node, and 1243 * the clearing of the INVALID flag. 1244 */ 1245 if (NG_HOOK_NODE(hook) == &ng_deadnode) { 1246 /* 1247 * The node must have been freed again since we last visited 1248 * here. ng_destry_hook() has this effect but nothing else does. 1249 * We should just release our references and 1250 * free anything we can think of. 1251 * Since we know it's been destroyed, and it's our caller 1252 * that holds the references, just return. 1253 */ 1254 return ; 1255 } 1256 if (hook->hk_node->nd_type->connect) { 1257 if ((*hook->hk_node->nd_type->connect) (hook)) { 1258 ng_destroy_hook(hook); /* also zaps peer */ 1259 printf("failed in ng_con_part3()\n"); 1260 return ; 1261 } 1262 } 1263 /* 1264 * XXX this is wrong for SMP. Possibly we need 1265 * to separate out 'create' and 'invalid' flags. 1266 * should only set flags on hooks we have locked under our node. 1267 */ 1268 hook->hk_flags &= ~HK_INVALID; 1269 return ; 1270} 1271 1272static void 1273ng_con_part2(node_p node, hook_p hook, void *arg1, int arg2) 1274{ 1275 hook_p peer; 1276 1277 /* 1278 * When we run, we know that the node 'node' is locked for us. 1279 * Our caller has a reference on the hook. 1280 * Our caller has a reference on the node. 1281 * (In this case our caller is ng_apply_item() ). 1282 * The peer hook has a reference on the hook. 1283 * our node pointer points to the 'dead' node. 1284 * First check the hook name is unique. 1285 * Should not happen because we checked before queueing this. 1286 */ 1287 if (ng_findhook(node, NG_HOOK_NAME(hook)) != NULL) { 1288 TRAP_ERROR(); 1289 ng_destroy_hook(hook); /* should destroy peer too */ 1290 printf("failed in ng_con_part2()\n"); 1291 return ; 1292 } 1293 /* 1294 * Check if the node type code has something to say about it 1295 * If it fails, the unref of the hook will also unref the attached node, 1296 * however since that node is 'ng_deadnode' this will do nothing. 1297 * The peer hook will also be destroyed. 1298 */ 1299 if (node->nd_type->newhook != NULL) { 1300 if ((*node->nd_type->newhook)(node, hook, hook->hk_name)) { 1301 ng_destroy_hook(hook); /* should destroy peer too */ 1302 printf("failed in ng_con_part2()\n"); 1303 return ; 1304 } 1305 } 1306 1307 /* 1308 * The 'type' agrees so far, so go ahead and link it in. 1309 * We'll ask again later when we actually connect the hooks. 1310 */ 1311 hook->hk_node = node; /* just overwrite ng_deadnode */ 1312 NG_NODE_REF(node); /* each hook counts as a reference */ 1313 LIST_INSERT_HEAD(&node->nd_hooks, hook, hk_hooks); 1314 node->nd_numhooks++; 1315 NG_HOOK_REF(hook); /* one for the node */ 1316 1317 /* 1318 * We now have a symmetrical situation, where both hooks have been 1319 * linked to their nodes, the newhook methods have been called 1320 * And the references are all correct. The hooks are still marked 1321 * as invalid, as we have not called the 'connect' methods 1322 * yet. 1323 * We can call the local one immediately as we have the 1324 * node locked, but we need to queue the remote one. 1325 */ 1326 if (hook->hk_node->nd_type->connect) { 1327 if ((*hook->hk_node->nd_type->connect) (hook)) { 1328 ng_destroy_hook(hook); /* also zaps peer */ 1329 printf("failed in ng_con_part2(A)\n"); 1330 return ; 1331 } 1332 } 1333 1334 /* 1335 * Acquire topo mutex to avoid race with ng_destroy_hook(). 1336 */ 1337 mtx_lock(&ng_topo_mtx); 1338 peer = hook->hk_peer; 1339 if (peer == &ng_deadhook) { 1340 mtx_unlock(&ng_topo_mtx); 1341 printf("failed in ng_con_part2(B)\n"); 1342 ng_destroy_hook(hook); 1343 return ; 1344 } 1345 mtx_unlock(&ng_topo_mtx); 1346 1347 if (ng_send_fn(peer->hk_node, peer, &ng_con_part3, arg1, arg2)) { 1348 printf("failed in ng_con_part2(C)\n"); 1349 ng_destroy_hook(hook); /* also zaps peer */ 1350 return ; 1351 } 1352 hook->hk_flags &= ~HK_INVALID; /* need both to be able to work */ 1353 return ; 1354} 1355 1356/* 1357 * Connect this node with another node. We assume that this node is 1358 * currently locked, as we are only called from an NGM_CONNECT message. 1359 */ 1360static int 1361ng_con_nodes(node_p node, const char *name, node_p node2, const char *name2) 1362{ 1363 int error; 1364 hook_p hook; 1365 hook_p hook2; 1366 1367 if (ng_findhook(node2, name2) != NULL) { 1368 return(EEXIST); 1369 } 1370 if ((error = ng_add_hook(node, name, &hook))) /* gives us a ref */ 1371 return (error); 1372 /* Allocate the other hook and link it up */ 1373 NG_ALLOC_HOOK(hook2); 1374 if (hook2 == NULL) { 1375 TRAP_ERROR(); 1376 ng_destroy_hook(hook); /* XXX check ref counts so far */ 1377 NG_HOOK_UNREF(hook); /* including our ref */ 1378 return (ENOMEM); 1379 } 1380 hook2->hk_refs = 1; /* start with a reference for us. */ 1381 hook2->hk_flags = HK_INVALID; 1382 hook2->hk_peer = hook; /* Link the two together */ 1383 hook->hk_peer = hook2; 1384 NG_HOOK_REF(hook); /* Add a ref for the peer to each*/ 1385 NG_HOOK_REF(hook2); 1386 hook2->hk_node = &ng_deadnode; 1387 strlcpy(NG_HOOK_NAME(hook2), name2, NG_HOOKSIZ); 1388 1389 /* 1390 * Queue the function above. 1391 * Procesing continues in that function in the lock context of 1392 * the other node. 1393 */ 1394 ng_send_fn(node2, hook2, &ng_con_part2, NULL, 0); 1395 1396 NG_HOOK_UNREF(hook); /* Let each hook go if it wants to */ 1397 NG_HOOK_UNREF(hook2); 1398 return (0); 1399} 1400 1401/* 1402 * Make a peer and connect. 1403 * We assume that the local node is locked. 1404 * The new node probably doesn't need a lock until 1405 * it has a hook, because it cannot really have any work until then, 1406 * but we should think about it a bit more. 1407 * 1408 * The problem may come if the other node also fires up 1409 * some hardware or a timer or some other source of activation, 1410 * also it may already get a command msg via it's ID. 1411 * 1412 * We could use the same method as ng_con_nodes() but we'd have 1413 * to add ability to remove the node when failing. (Not hard, just 1414 * make arg1 point to the node to remove). 1415 * Unless of course we just ignore failure to connect and leave 1416 * an unconnected node? 1417 */ 1418static int 1419ng_mkpeer(node_p node, const char *name, const char *name2, char *type) 1420{ 1421 node_p node2; 1422 hook_p hook1, hook2; 1423 int error; 1424 1425 if ((error = ng_make_node(type, &node2))) { 1426 return (error); 1427 } 1428 1429 if ((error = ng_add_hook(node, name, &hook1))) { /* gives us a ref */ 1430 ng_rmnode(node2, NULL, NULL, 0); 1431 return (error); 1432 } 1433 1434 if ((error = ng_add_hook(node2, name2, &hook2))) { 1435 ng_rmnode(node2, NULL, NULL, 0); 1436 ng_destroy_hook(hook1); 1437 NG_HOOK_UNREF(hook1); 1438 return (error); 1439 } 1440 1441 /* 1442 * Actually link the two hooks together. 1443 */ 1444 hook1->hk_peer = hook2; 1445 hook2->hk_peer = hook1; 1446 1447 /* Each hook is referenced by the other */ 1448 NG_HOOK_REF(hook1); 1449 NG_HOOK_REF(hook2); 1450 1451 /* Give each node the opportunity to veto the pending connection */ 1452 if (hook1->hk_node->nd_type->connect) { 1453 error = (*hook1->hk_node->nd_type->connect) (hook1); 1454 } 1455 1456 if ((error == 0) && hook2->hk_node->nd_type->connect) { 1457 error = (*hook2->hk_node->nd_type->connect) (hook2); 1458 1459 } 1460 1461 /* 1462 * drop the references we were holding on the two hooks. 1463 */ 1464 if (error) { 1465 ng_destroy_hook(hook2); /* also zaps hook1 */ 1466 ng_rmnode(node2, NULL, NULL, 0); 1467 } else { 1468 /* As a last act, allow the hooks to be used */ 1469 hook1->hk_flags &= ~HK_INVALID; 1470 hook2->hk_flags &= ~HK_INVALID; 1471 } 1472 NG_HOOK_UNREF(hook1); 1473 NG_HOOK_UNREF(hook2); 1474 return (error); 1475} 1476 1477/************************************************************************ 1478 Utility routines to send self messages 1479************************************************************************/ 1480 1481/* Shut this node down as soon as everyone is clear of it */ 1482/* Should add arg "immediately" to jump the queue */ 1483int 1484ng_rmnode_self(node_p node) 1485{ 1486 int error; 1487 1488 if (node == &ng_deadnode) 1489 return (0); 1490 node->nd_flags |= NGF_INVALID; 1491 if (node->nd_flags & NGF_CLOSING) 1492 return (0); 1493 1494 error = ng_send_fn(node, NULL, &ng_rmnode, NULL, 0); 1495 return (error); 1496} 1497 1498static void 1499ng_rmhook_part2(node_p node, hook_p hook, void *arg1, int arg2) 1500{ 1501 ng_destroy_hook(hook); 1502 return ; 1503} 1504 1505int 1506ng_rmhook_self(hook_p hook) 1507{ 1508 int error; 1509 node_p node = NG_HOOK_NODE(hook); 1510 1511 if (node == &ng_deadnode) 1512 return (0); 1513 1514 error = ng_send_fn(node, hook, &ng_rmhook_part2, NULL, 0); 1515 return (error); 1516} 1517 1518/*********************************************************************** 1519 * Parse and verify a string of the form: <NODE:><PATH> 1520 * 1521 * Such a string can refer to a specific node or a specific hook 1522 * on a specific node, depending on how you look at it. In the 1523 * latter case, the PATH component must not end in a dot. 1524 * 1525 * Both <NODE:> and <PATH> are optional. The <PATH> is a string 1526 * of hook names separated by dots. This breaks out the original 1527 * string, setting *nodep to "NODE" (or NULL if none) and *pathp 1528 * to "PATH" (or NULL if degenerate). Also, *hookp will point to 1529 * the final hook component of <PATH>, if any, otherwise NULL. 1530 * 1531 * This returns -1 if the path is malformed. The char ** are optional. 1532 ***********************************************************************/ 1533int 1534ng_path_parse(char *addr, char **nodep, char **pathp, char **hookp) 1535{ 1536 char *node, *path, *hook; 1537 int k; 1538 1539 /* 1540 * Extract absolute NODE, if any 1541 */ 1542 for (path = addr; *path && *path != ':'; path++); 1543 if (*path) { 1544 node = addr; /* Here's the NODE */ 1545 *path++ = '\0'; /* Here's the PATH */ 1546 1547 /* Node name must not be empty */ 1548 if (!*node) 1549 return -1; 1550 1551 /* A name of "." is OK; otherwise '.' not allowed */ 1552 if (strcmp(node, ".") != 0) { 1553 for (k = 0; node[k]; k++) 1554 if (node[k] == '.') 1555 return -1; 1556 } 1557 } else { 1558 node = NULL; /* No absolute NODE */ 1559 path = addr; /* Here's the PATH */ 1560 } 1561 1562 /* Snoop for illegal characters in PATH */ 1563 for (k = 0; path[k]; k++) 1564 if (path[k] == ':') 1565 return -1; 1566 1567 /* Check for no repeated dots in PATH */ 1568 for (k = 0; path[k]; k++) 1569 if (path[k] == '.' && path[k + 1] == '.') 1570 return -1; 1571 1572 /* Remove extra (degenerate) dots from beginning or end of PATH */ 1573 if (path[0] == '.') 1574 path++; 1575 if (*path && path[strlen(path) - 1] == '.') 1576 path[strlen(path) - 1] = 0; 1577 1578 /* If PATH has a dot, then we're not talking about a hook */ 1579 if (*path) { 1580 for (hook = path, k = 0; path[k]; k++) 1581 if (path[k] == '.') { 1582 hook = NULL; 1583 break; 1584 } 1585 } else 1586 path = hook = NULL; 1587 1588 /* Done */ 1589 if (nodep) 1590 *nodep = node; 1591 if (pathp) 1592 *pathp = path; 1593 if (hookp) 1594 *hookp = hook; 1595 return (0); 1596} 1597 1598/* 1599 * Given a path, which may be absolute or relative, and a starting node, 1600 * return the destination node. 1601 */ 1602int 1603ng_path2noderef(node_p here, const char *address, 1604 node_p *destp, hook_p *lasthook) 1605{ 1606 char fullpath[NG_PATHSIZ]; 1607 char *nodename, *path, pbuf[2]; 1608 node_p node, oldnode; 1609 char *cp; 1610 hook_p hook = NULL; 1611 1612 /* Initialize */ 1613 if (destp == NULL) { 1614 TRAP_ERROR(); 1615 return EINVAL; 1616 } 1617 *destp = NULL; 1618 1619 /* Make a writable copy of address for ng_path_parse() */ 1620 strncpy(fullpath, address, sizeof(fullpath) - 1); 1621 fullpath[sizeof(fullpath) - 1] = '\0'; 1622 1623 /* Parse out node and sequence of hooks */ 1624 if (ng_path_parse(fullpath, &nodename, &path, NULL) < 0) { 1625 TRAP_ERROR(); 1626 return EINVAL; 1627 } 1628 if (path == NULL) { 1629 pbuf[0] = '.'; /* Needs to be writable */ 1630 pbuf[1] = '\0'; 1631 path = pbuf; 1632 } 1633 1634 /* 1635 * For an absolute address, jump to the starting node. 1636 * Note that this holds a reference on the node for us. 1637 * Don't forget to drop the reference if we don't need it. 1638 */ 1639 if (nodename) { 1640 node = ng_name2noderef(here, nodename); 1641 if (node == NULL) { 1642 TRAP_ERROR(); 1643 return (ENOENT); 1644 } 1645 } else { 1646 if (here == NULL) { 1647 TRAP_ERROR(); 1648 return (EINVAL); 1649 } 1650 node = here; 1651 NG_NODE_REF(node); 1652 } 1653 1654 /* 1655 * Now follow the sequence of hooks 1656 * XXX 1657 * We actually cannot guarantee that the sequence 1658 * is not being demolished as we crawl along it 1659 * without extra-ordinary locking etc. 1660 * So this is a bit dodgy to say the least. 1661 * We can probably hold up some things by holding 1662 * the nodelist mutex for the time of this 1663 * crawl if we wanted.. At least that way we wouldn't have to 1664 * worry about the nodes disappearing, but the hooks would still 1665 * be a problem. 1666 */ 1667 for (cp = path; node != NULL && *cp != '\0'; ) { 1668 char *segment; 1669 1670 /* 1671 * Break out the next path segment. Replace the dot we just 1672 * found with a NUL; "cp" points to the next segment (or the 1673 * NUL at the end). 1674 */ 1675 for (segment = cp; *cp != '\0'; cp++) { 1676 if (*cp == '.') { 1677 *cp++ = '\0'; 1678 break; 1679 } 1680 } 1681 1682 /* Empty segment */ 1683 if (*segment == '\0') 1684 continue; 1685 1686 /* We have a segment, so look for a hook by that name */ 1687 hook = ng_findhook(node, segment); 1688 1689 /* Can't get there from here... */ 1690 if (hook == NULL 1691 || NG_HOOK_PEER(hook) == NULL 1692 || NG_HOOK_NOT_VALID(hook) 1693 || NG_HOOK_NOT_VALID(NG_HOOK_PEER(hook))) { 1694 TRAP_ERROR(); 1695 NG_NODE_UNREF(node); 1696#if 0 1697 printf("hooknotvalid %s %s %d %d %d %d ", 1698 path, 1699 segment, 1700 hook == NULL, 1701 NG_HOOK_PEER(hook) == NULL, 1702 NG_HOOK_NOT_VALID(hook), 1703 NG_HOOK_NOT_VALID(NG_HOOK_PEER(hook))); 1704#endif 1705 return (ENOENT); 1706 } 1707 1708 /* 1709 * Hop on over to the next node 1710 * XXX 1711 * Big race conditions here as hooks and nodes go away 1712 * *** Idea.. store an ng_ID_t in each hook and use that 1713 * instead of the direct hook in this crawl? 1714 */ 1715 oldnode = node; 1716 if ((node = NG_PEER_NODE(hook))) 1717 NG_NODE_REF(node); /* XXX RACE */ 1718 NG_NODE_UNREF(oldnode); /* XXX another race */ 1719 if (NG_NODE_NOT_VALID(node)) { 1720 NG_NODE_UNREF(node); /* XXX more races */ 1721 node = NULL; 1722 } 1723 } 1724 1725 /* If node somehow missing, fail here (probably this is not needed) */ 1726 if (node == NULL) { 1727 TRAP_ERROR(); 1728 return (ENXIO); 1729 } 1730 1731 /* Done */ 1732 *destp = node; 1733 if (lasthook != NULL) 1734 *lasthook = (hook ? NG_HOOK_PEER(hook) : NULL); 1735 return (0); 1736} 1737 1738/***************************************************************\ 1739* Input queue handling. 1740* All activities are submitted to the node via the input queue 1741* which implements a multiple-reader/single-writer gate. 1742* Items which cannot be handled immediately are queued. 1743* 1744* read-write queue locking inline functions * 1745\***************************************************************/ 1746 1747static __inline item_p ng_dequeue(struct ng_queue * ngq, int *rw); 1748static __inline item_p ng_acquire_read(struct ng_queue * ngq, 1749 item_p item); 1750static __inline item_p ng_acquire_write(struct ng_queue * ngq, 1751 item_p item); 1752static __inline void ng_leave_read(struct ng_queue * ngq); 1753static __inline void ng_leave_write(struct ng_queue * ngq); 1754static __inline void ng_queue_rw(struct ng_queue * ngq, 1755 item_p item, int rw); 1756 1757/* 1758 * Definition of the bits fields in the ng_queue flag word. 1759 * Defined here rather than in netgraph.h because no-one should fiddle 1760 * with them. 1761 * 1762 * The ordering here may be important! don't shuffle these. 1763 */ 1764/*- 1765 Safety Barrier--------+ (adjustable to suit taste) (not used yet) 1766 | 1767 V 1768+-------+-------+-------+-------+-------+-------+-------+-------+ 1769 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1770 | |A|c|t|i|v|e| |R|e|a|d|e|r| |C|o|u|n|t| | | | | | | | | |P|A| 1771 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |O|W| 1772+-------+-------+-------+-------+-------+-------+-------+-------+ 1773 \___________________________ ____________________________/ | | 1774 V | | 1775 [active reader count] | | 1776 | | 1777 Operation Pending -------------------------------+ | 1778 | 1779 Active Writer ---------------------------------------+ 1780 1781 1782*/ 1783#define WRITER_ACTIVE 0x00000001 1784#define OP_PENDING 0x00000002 1785#define READER_INCREMENT 0x00000004 1786#define READER_MASK 0xfffffffc /* Not valid if WRITER_ACTIVE is set */ 1787#define SAFETY_BARRIER 0x00100000 /* 128K items queued should be enough */ 1788 1789/* Defines of more elaborate states on the queue */ 1790/* Mask of bits a new read cares about */ 1791#define NGQ_RMASK (WRITER_ACTIVE|OP_PENDING) 1792 1793/* Mask of bits a new write cares about */ 1794#define NGQ_WMASK (NGQ_RMASK|READER_MASK) 1795 1796/* Test to decide if there is something on the queue. */ 1797#define QUEUE_ACTIVE(QP) ((QP)->q_flags & OP_PENDING) 1798 1799/* How to decide what the next queued item is. */ 1800#define HEAD_IS_READER(QP) NGI_QUEUED_READER((QP)->queue) 1801#define HEAD_IS_WRITER(QP) NGI_QUEUED_WRITER((QP)->queue) /* notused */ 1802 1803/* Read the status to decide if the next item on the queue can now run. */ 1804#define QUEUED_READER_CAN_PROCEED(QP) \ 1805 (((QP)->q_flags & (NGQ_RMASK & ~OP_PENDING)) == 0) 1806#define QUEUED_WRITER_CAN_PROCEED(QP) \ 1807 (((QP)->q_flags & (NGQ_WMASK & ~OP_PENDING)) == 0) 1808 1809/* Is there a chance of getting ANY work off the queue? */ 1810#define NEXT_QUEUED_ITEM_CAN_PROCEED(QP) \ 1811 (QUEUE_ACTIVE(QP) && \ 1812 ((HEAD_IS_READER(QP)) ? QUEUED_READER_CAN_PROCEED(QP) : \ 1813 QUEUED_WRITER_CAN_PROCEED(QP))) 1814 1815 1816#define NGQRW_R 0 1817#define NGQRW_W 1 1818 1819/* 1820 * Taking into account the current state of the queue and node, possibly take 1821 * the next entry off the queue and return it. Return NULL if there was 1822 * nothing we could return, either because there really was nothing there, or 1823 * because the node was in a state where it cannot yet process the next item 1824 * on the queue. 1825 * 1826 * This MUST MUST MUST be called with the mutex held. 1827 */ 1828static __inline item_p 1829ng_dequeue(struct ng_queue *ngq, int *rw) 1830{ 1831 item_p item; 1832 u_int add_arg; 1833 1834 mtx_assert(&ngq->q_mtx, MA_OWNED); 1835 /* 1836 * If there is nothing queued, then just return. 1837 * No point in continuing. 1838 * XXXGL: assert this? 1839 */ 1840 if (!QUEUE_ACTIVE(ngq)) { 1841 CTR4(KTR_NET, "%20s: node [%x] (%p) queue empty; " 1842 "queue flags 0x%lx", __func__, 1843 ngq->q_node->nd_ID, ngq->q_node, ngq->q_flags); 1844 return (NULL); 1845 } 1846 1847 /* 1848 * From here, we can assume there is a head item. 1849 * We need to find out what it is and if it can be dequeued, given 1850 * the current state of the node. 1851 */ 1852 if (HEAD_IS_READER(ngq)) { 1853 if (!QUEUED_READER_CAN_PROCEED(ngq)) { 1854 /* 1855 * It's a reader but we can't use it. 1856 * We are stalled so make sure we don't 1857 * get called again until something changes. 1858 */ 1859 ng_worklist_remove(ngq->q_node); 1860 CTR4(KTR_NET, "%20s: node [%x] (%p) queued reader " 1861 "can't proceed; queue flags 0x%lx", __func__, 1862 ngq->q_node->nd_ID, ngq->q_node, ngq->q_flags); 1863 return (NULL); 1864 } 1865 /* 1866 * Head of queue is a reader and we have no write active. 1867 * We don't care how many readers are already active. 1868 * Add the correct increment for the reader count. 1869 */ 1870 add_arg = READER_INCREMENT; 1871 *rw = NGQRW_R; 1872 } else if (QUEUED_WRITER_CAN_PROCEED(ngq)) { 1873 /* 1874 * There is a pending write, no readers and no active writer. 1875 * This means we can go ahead with the pending writer. Note 1876 * the fact that we now have a writer, ready for when we take 1877 * it off the queue. 1878 * 1879 * We don't need to worry about a possible collision with the 1880 * fasttrack reader. 1881 * 1882 * The fasttrack thread may take a long time to discover that we 1883 * are running so we would have an inconsistent state in the 1884 * flags for a while. Since we ignore the reader count 1885 * entirely when the WRITER_ACTIVE flag is set, this should 1886 * not matter (in fact it is defined that way). If it tests 1887 * the flag before this operation, the OP_PENDING flag 1888 * will make it fail, and if it tests it later, the 1889 * WRITER_ACTIVE flag will do the same. If it is SO slow that 1890 * we have actually completed the operation, and neither flag 1891 * is set by the time that it tests the flags, then it is 1892 * actually ok for it to continue. If it completes and we've 1893 * finished and the read pending is set it still fails. 1894 * 1895 * So we can just ignore it, as long as we can ensure that the 1896 * transition from WRITE_PENDING state to the WRITER_ACTIVE 1897 * state is atomic. 1898 * 1899 * After failing, first it will be held back by the mutex, then 1900 * when it can proceed, it will queue its request, then it 1901 * would arrive at this function. Usually it will have to 1902 * leave empty handed because the ACTIVE WRITER bit will be 1903 * set. 1904 * 1905 * Adjust the flags for the new active writer. 1906 */ 1907 add_arg = WRITER_ACTIVE; 1908 *rw = NGQRW_W; 1909 /* 1910 * We want to write "active writer, no readers " Now go make 1911 * it true. In fact there may be a number in the readers 1912 * count but we know it is not true and will be fixed soon. 1913 * We will fix the flags for the next pending entry in a 1914 * moment. 1915 */ 1916 } else { 1917 /* 1918 * We can't dequeue anything.. return and say so. Probably we 1919 * have a write pending and the readers count is non zero. If 1920 * we got here because a reader hit us just at the wrong 1921 * moment with the fasttrack code, and put us in a strange 1922 * state, then it will be coming through in just a moment, 1923 * (just as soon as we release the mutex) and keep things 1924 * moving. 1925 * Make sure we remove ourselves from the work queue. It 1926 * would be a waste of effort to do all this again. 1927 */ 1928 ng_worklist_remove(ngq->q_node); 1929 CTR4(KTR_NET, "%20s: node [%x] (%p) can't dequeue anything; " 1930 "queue flags 0x%lx", __func__, 1931 ngq->q_node->nd_ID, ngq->q_node, ngq->q_flags); 1932 return (NULL); 1933 } 1934 1935 /* 1936 * Now we dequeue the request (whatever it may be) and correct the 1937 * pending flags and the next and last pointers. 1938 */ 1939 item = ngq->queue; 1940 ngq->queue = item->el_next; 1941 CTR6(KTR_NET, "%20s: node [%x] (%p) dequeued item %p with flags 0x%lx; " 1942 "queue flags 0x%lx", __func__, 1943 ngq->q_node->nd_ID,ngq->q_node, item, item->el_flags, ngq->q_flags); 1944 if (ngq->last == &(item->el_next)) { 1945 /* 1946 * that was the last entry in the queue so set the 'last 1947 * pointer up correctly and make sure the pending flag is 1948 * clear. 1949 */ 1950 add_arg += -OP_PENDING; 1951 ngq->last = &(ngq->queue); 1952 /* 1953 * Whatever flag was set will be cleared and 1954 * the new acive field will be set by the add as well, 1955 * so we don't need to change add_arg. 1956 * But we know we don't need to be on the work list. 1957 */ 1958 atomic_add_long(&ngq->q_flags, add_arg); 1959 ng_worklist_remove(ngq->q_node); 1960 } else { 1961 /* 1962 * Since there is still something on the queue 1963 * we don't need to change the PENDING flag. 1964 */ 1965 atomic_add_long(&ngq->q_flags, add_arg); 1966 /* 1967 * If we see more doable work, make sure we are 1968 * on the work queue. 1969 */ 1970 if (NEXT_QUEUED_ITEM_CAN_PROCEED(ngq)) { 1971 ng_setisr(ngq->q_node); 1972 } 1973 } 1974 CTR6(KTR_NET, "%20s: node [%x] (%p) returning item %p as %s; " 1975 "queue flags 0x%lx", __func__, 1976 ngq->q_node->nd_ID, ngq->q_node, item, *rw ? "WRITER" : "READER" , 1977 ngq->q_flags); 1978 return (item); 1979} 1980 1981/* 1982 * Queue a packet to be picked up by someone else. 1983 * We really don't care who, but we can't or don't want to hang around 1984 * to process it ourselves. We are probably an interrupt routine.. 1985 * If the queue could be run, flag the netisr handler to start. 1986 */ 1987static __inline void 1988ng_queue_rw(struct ng_queue * ngq, item_p item, int rw) 1989{ 1990 mtx_assert(&ngq->q_mtx, MA_OWNED); 1991 1992 if (rw == NGQRW_W) 1993 NGI_SET_WRITER(item); 1994 else 1995 NGI_SET_READER(item); 1996 item->el_next = NULL; /* maybe not needed */ 1997 *ngq->last = item; 1998 CTR5(KTR_NET, "%20s: node [%x] (%p) queued item %p as %s", __func__, 1999 ngq->q_node->nd_ID, ngq->q_node, item, rw ? "WRITER" : "READER" ); 2000 /* 2001 * If it was the first item in the queue then we need to 2002 * set the last pointer and the type flags. 2003 */ 2004 if (ngq->last == &(ngq->queue)) { 2005 atomic_add_long(&ngq->q_flags, OP_PENDING); 2006 CTR3(KTR_NET, "%20s: node [%x] (%p) set OP_PENDING", __func__, 2007 ngq->q_node->nd_ID, ngq->q_node); 2008 } 2009 2010 ngq->last = &(item->el_next); 2011 /* 2012 * We can take the worklist lock with the node locked 2013 * BUT NOT THE REVERSE! 2014 */ 2015 if (NEXT_QUEUED_ITEM_CAN_PROCEED(ngq)) 2016 ng_setisr(ngq->q_node); 2017} 2018 2019 2020/* 2021 * This function 'cheats' in that it first tries to 'grab' the use of the 2022 * node, without going through the mutex. We can do this becasue of the 2023 * semantics of the lock. The semantics include a clause that says that the 2024 * value of the readers count is invalid if the WRITER_ACTIVE flag is set. It 2025 * also says that the WRITER_ACTIVE flag cannot be set if the readers count 2026 * is not zero. Note that this talks about what is valid to SET the 2027 * WRITER_ACTIVE flag, because from the moment it is set, the value if the 2028 * reader count is immaterial, and not valid. The two 'pending' flags have a 2029 * similar effect, in that If they are orthogonal to the two active fields in 2030 * how they are set, but if either is set, the attempted 'grab' need to be 2031 * backed out because there is earlier work, and we maintain ordering in the 2032 * queue. The result of this is that the reader request can try obtain use of 2033 * the node with only a single atomic addition, and without any of the mutex 2034 * overhead. If this fails the operation degenerates to the same as for other 2035 * cases. 2036 * 2037 */ 2038static __inline item_p 2039ng_acquire_read(struct ng_queue *ngq, item_p item) 2040{ 2041 KASSERT(ngq != &ng_deadnode.nd_input_queue, 2042 ("%s: working on deadnode", __func__)); 2043 2044 /* ######### Hack alert ######### */ 2045 atomic_add_long(&ngq->q_flags, READER_INCREMENT); 2046 if ((ngq->q_flags & NGQ_RMASK) == 0) { 2047 /* Successfully grabbed node */ 2048 CTR4(KTR_NET, "%20s: node [%x] (%p) fast acquired item %p", 2049 __func__, ngq->q_node->nd_ID, ngq->q_node, item); 2050 return (item); 2051 } 2052 /* undo the damage if we didn't succeed */ 2053 atomic_subtract_long(&ngq->q_flags, READER_INCREMENT); 2054 2055 /* ######### End Hack alert ######### */ 2056 NG_QUEUE_LOCK(ngq); 2057 /* 2058 * Try again. Another processor (or interrupt for that matter) may 2059 * have removed the last queued item that was stopping us from 2060 * running, between the previous test, and the moment that we took 2061 * the mutex. (Or maybe a writer completed.) 2062 * Even if another fast-track reader hits during this period 2063 * we don't care as multiple readers is OK. 2064 */ 2065 if ((ngq->q_flags & NGQ_RMASK) == 0) { 2066 atomic_add_long(&ngq->q_flags, READER_INCREMENT); 2067 NG_QUEUE_UNLOCK(ngq); 2068 CTR4(KTR_NET, "%20s: node [%x] (%p) slow acquired item %p", 2069 __func__, ngq->q_node->nd_ID, ngq->q_node, item); 2070 return (item); 2071 } 2072 2073 /* 2074 * and queue the request for later. 2075 */ 2076 ng_queue_rw(ngq, item, NGQRW_R); 2077 NG_QUEUE_UNLOCK(ngq); 2078 2079 return (NULL); 2080} 2081 2082static __inline item_p 2083ng_acquire_write(struct ng_queue *ngq, item_p item) 2084{ 2085 KASSERT(ngq != &ng_deadnode.nd_input_queue, 2086 ("%s: working on deadnode", __func__)); 2087 2088restart: 2089 NG_QUEUE_LOCK(ngq); 2090 /* 2091 * If there are no readers, no writer, and no pending packets, then 2092 * we can just go ahead. In all other situations we need to queue the 2093 * request 2094 */ 2095 if ((ngq->q_flags & NGQ_WMASK) == 0) { 2096 /* collision could happen *HERE* */ 2097 atomic_add_long(&ngq->q_flags, WRITER_ACTIVE); 2098 NG_QUEUE_UNLOCK(ngq); 2099 if (ngq->q_flags & READER_MASK) { 2100 /* Collision with fast-track reader */ 2101 atomic_subtract_long(&ngq->q_flags, WRITER_ACTIVE); 2102 goto restart; 2103 } 2104 CTR4(KTR_NET, "%20s: node [%x] (%p) acquired item %p", 2105 __func__, ngq->q_node->nd_ID, ngq->q_node, item); 2106 return (item); 2107 } 2108 2109 /* 2110 * and queue the request for later. 2111 */ 2112 ng_queue_rw(ngq, item, NGQRW_W); 2113 NG_QUEUE_UNLOCK(ngq); 2114 2115 return (NULL); 2116} 2117 2118#if 0 2119static __inline item_p 2120ng_upgrade_write(struct ng_queue *ngq, item_p item) 2121{ 2122 KASSERT(ngq != &ng_deadnode.nd_input_queue, 2123 ("%s: working on deadnode", __func__)); 2124 2125 NGI_SET_WRITER(item); 2126 2127 mtx_lock_spin(&(ngq->q_mtx)); 2128 2129 /* 2130 * There will never be no readers as we are there ourselves. 2131 * Set the WRITER_ACTIVE flags ASAP to block out fast track readers. 2132 * The caller we are running from will call ng_leave_read() 2133 * soon, so we must account for that. We must leave again with the 2134 * READER lock. If we find other readers, then 2135 * queue the request for later. However "later" may be rignt now 2136 * if there are no readers. We don't really care if there are queued 2137 * items as we will bypass them anyhow. 2138 */ 2139 atomic_add_long(&ngq->q_flags, WRITER_ACTIVE - READER_INCREMENT); 2140 if (ngq->q_flags & (NGQ_WMASK & ~OP_PENDING) == WRITER_ACTIVE) { 2141 mtx_unlock_spin(&(ngq->q_mtx)); 2142 2143 /* It's just us, act on the item. */ 2144 /* will NOT drop writer lock when done */ 2145 ng_apply_item(node, item, 0); 2146 2147 /* 2148 * Having acted on the item, atomically 2149 * down grade back to READER and finish up 2150 */ 2151 atomic_add_long(&ngq->q_flags, 2152 READER_INCREMENT - WRITER_ACTIVE); 2153 2154 /* Our caller will call ng_leave_read() */ 2155 return; 2156 } 2157 /* 2158 * It's not just us active, so queue us AT THE HEAD. 2159 * "Why?" I hear you ask. 2160 * Put us at the head of the queue as we've already been 2161 * through it once. If there is nothing else waiting, 2162 * set the correct flags. 2163 */ 2164 if ((item->el_next = ngq->queue) == NULL) { 2165 /* 2166 * Set up the "last" pointer. 2167 * We are the only (and thus last) item 2168 */ 2169 ngq->last = &(item->el_next); 2170 2171 /* We've gone from, 0 to 1 item in the queue */ 2172 atomic_add_long(&ngq->q_flags, OP_PENDING); 2173 2174 CTR3(KTR_NET, "%20s: node [%x] (%p) set OP_PENDING", __func__, 2175 ngq->q_node->nd_ID, ngq->q_node); 2176 }; 2177 ngq->queue = item; 2178 CTR5(KTR_NET, "%20s: node [%x] (%p) requeued item %p as WRITER", 2179 __func__, ngq->q_node->nd_ID, ngq->q_node, item ); 2180 2181 /* Reverse what we did above. That downgrades us back to reader */ 2182 atomic_add_long(&ngq->q_flags, READER_INCREMENT - WRITER_ACTIVE); 2183 if (NEXT_QUEUED_ITEM_CAN_PROCEED(ngq)) 2184 ng_setisr(ngq->q_node); 2185 mtx_unlock_spin(&(ngq->q_mtx)); 2186 2187 return; 2188} 2189 2190#endif 2191 2192static __inline void 2193ng_leave_read(struct ng_queue *ngq) 2194{ 2195 atomic_subtract_long(&ngq->q_flags, READER_INCREMENT); 2196} 2197 2198static __inline void 2199ng_leave_write(struct ng_queue *ngq) 2200{ 2201 atomic_subtract_long(&ngq->q_flags, WRITER_ACTIVE); 2202} 2203 2204static void 2205ng_flush_input_queue(struct ng_queue * ngq) 2206{ 2207 item_p item; 2208 2209 NG_QUEUE_LOCK(ngq); 2210 while (ngq->queue) { 2211 item = ngq->queue; 2212 ngq->queue = item->el_next; 2213 if (ngq->last == &(item->el_next)) { 2214 ngq->last = &(ngq->queue); 2215 atomic_add_long(&ngq->q_flags, -OP_PENDING); 2216 } 2217 NG_QUEUE_UNLOCK(ngq); 2218 2219 /* If the item is supplying a callback, call it with an error */ 2220 if (item->apply != NULL) { 2221 (item->apply)(item->context, ENOENT); 2222 item->apply = NULL; 2223 } 2224 NG_FREE_ITEM(item); 2225 NG_QUEUE_LOCK(ngq); 2226 } 2227 /* 2228 * Take us off the work queue if we are there. 2229 * We definately have no work to be done. 2230 */ 2231 ng_worklist_remove(ngq->q_node); 2232 NG_QUEUE_UNLOCK(ngq); 2233} 2234 2235/*********************************************************************** 2236* Externally visible method for sending or queueing messages or data. 2237***********************************************************************/ 2238 2239/* 2240 * The module code should have filled out the item correctly by this stage: 2241 * Common: 2242 * reference to destination node. 2243 * Reference to destination rcv hook if relevant. 2244 * Data: 2245 * pointer to mbuf 2246 * Control_Message: 2247 * pointer to msg. 2248 * ID of original sender node. (return address) 2249 * Function: 2250 * Function pointer 2251 * void * argument 2252 * integer argument 2253 * 2254 * The nodes have several routines and macros to help with this task: 2255 */ 2256 2257int 2258ng_snd_item(item_p item, int flags) 2259{ 2260 hook_p hook = NGI_HOOK(item); 2261 node_p node = NGI_NODE(item); 2262 int queue, rw; 2263 struct ng_queue * ngq = &node->nd_input_queue; 2264 int error = 0; 2265 2266#ifdef NETGRAPH_DEBUG 2267 _ngi_check(item, __FILE__, __LINE__); 2268#endif 2269 2270 queue = (flags & NG_QUEUE) ? 1 : 0; 2271 2272 if (item == NULL) { 2273 TRAP_ERROR(); 2274 return (EINVAL); /* failed to get queue element */ 2275 } 2276 if (node == NULL) { 2277 NG_FREE_ITEM(item); 2278 TRAP_ERROR(); 2279 return (EINVAL); /* No address */ 2280 } 2281 switch(item->el_flags & NGQF_TYPE) { 2282 case NGQF_DATA: 2283 /* 2284 * DATA MESSAGE 2285 * Delivered to a node via a non-optional hook. 2286 * Both should be present in the item even though 2287 * the node is derivable from the hook. 2288 * References are held on both by the item. 2289 */ 2290 2291 /* Protect nodes from sending NULL pointers 2292 * to each other 2293 */ 2294 if (NGI_M(item) == NULL) 2295 return (EINVAL); 2296 2297 CHECK_DATA_MBUF(NGI_M(item)); 2298 if (hook == NULL) { 2299 NG_FREE_ITEM(item); 2300 TRAP_ERROR(); 2301 return(EINVAL); 2302 } 2303 if ((NG_HOOK_NOT_VALID(hook)) 2304 || (NG_NODE_NOT_VALID(NG_HOOK_NODE(hook)))) { 2305 NG_FREE_ITEM(item); 2306 return (ENOTCONN); 2307 } 2308 if ((hook->hk_flags & HK_QUEUE)) { 2309 queue = 1; 2310 } 2311 break; 2312 case NGQF_MESG: 2313 /* 2314 * CONTROL MESSAGE 2315 * Delivered to a node. 2316 * Hook is optional. 2317 * References are held by the item on the node and 2318 * the hook if it is present. 2319 */ 2320 if (hook && (hook->hk_flags & HK_QUEUE)) { 2321 queue = 1; 2322 } 2323 break; 2324 case NGQF_FN: 2325 break; 2326 default: 2327 NG_FREE_ITEM(item); 2328 TRAP_ERROR(); 2329 return (EINVAL); 2330 } 2331 switch(item->el_flags & NGQF_RW) { 2332 case NGQF_READER: 2333 rw = NGQRW_R; 2334 break; 2335 case NGQF_WRITER: 2336 rw = NGQRW_W; 2337 break; 2338 default: 2339 panic("%s: invalid item flags %lx", __func__, item->el_flags); 2340 } 2341 2342 /* 2343 * If the node specifies single threading, force writer semantics. 2344 * Similarly, the node may say one hook always produces writers. 2345 * These are overrides. 2346 */ 2347 if ((node->nd_flags & NGF_FORCE_WRITER) 2348 || (hook && (hook->hk_flags & HK_FORCE_WRITER))) 2349 rw = NGQRW_W; 2350 2351 if (queue) { 2352 /* Put it on the queue for that node*/ 2353#ifdef NETGRAPH_DEBUG 2354 _ngi_check(item, __FILE__, __LINE__); 2355#endif 2356 NG_QUEUE_LOCK(ngq); 2357 ng_queue_rw(ngq, item, rw); 2358 NG_QUEUE_UNLOCK(ngq); 2359 2360 if (flags & NG_PROGRESS) 2361 return (EINPROGRESS); 2362 else 2363 return (0); 2364 } 2365 2366 /* 2367 * We already decided how we will be queueud or treated. 2368 * Try get the appropriate operating permission. 2369 */ 2370 if (rw == NGQRW_R) 2371 item = ng_acquire_read(ngq, item); 2372 else 2373 item = ng_acquire_write(ngq, item); 2374 2375 2376 if (item == NULL) { 2377 if (flags & NG_PROGRESS) 2378 return (EINPROGRESS); 2379 else 2380 return (0); 2381 } 2382 2383#ifdef NETGRAPH_DEBUG 2384 _ngi_check(item, __FILE__, __LINE__); 2385#endif 2386 2387 NGI_GET_NODE(item, node); /* zaps stored node */ 2388 2389 /* Don't report any errors. act as if it had been queued */ 2390 ng_apply_item(node, item, rw); /* drops r/w lock when done */ 2391 2392 /* 2393 * If the node goes away when we remove the reference, 2394 * whatever we just did caused it.. whatever we do, DO NOT 2395 * access the node again! 2396 */ 2397 if (NG_NODE_UNREF(node) == 0) { 2398 return (error); 2399 } 2400 2401 NG_QUEUE_LOCK(ngq); 2402 if (NEXT_QUEUED_ITEM_CAN_PROCEED(ngq)) 2403 ng_setisr(ngq->q_node); 2404 NG_QUEUE_UNLOCK(ngq); 2405 2406 return (error); 2407} 2408 2409/* 2410 * We have an item that was possibly queued somewhere. 2411 * It should contain all the information needed 2412 * to run it on the appropriate node/hook. 2413 */ 2414static void 2415ng_apply_item(node_p node, item_p item, int rw) 2416{ 2417 hook_p hook; 2418 int error = 0; 2419 ng_rcvdata_t *rcvdata; 2420 ng_rcvmsg_t *rcvmsg; 2421 ng_apply_t *apply = NULL; 2422 void *context = NULL; 2423 2424 NGI_GET_HOOK(item, hook); /* clears stored hook */ 2425#ifdef NETGRAPH_DEBUG 2426 _ngi_check(item, __FILE__, __LINE__); 2427#endif 2428 2429 /* 2430 * If the item has an "apply" callback, store it. 2431 * Clear item's callback immediately, to avoid an extra call if 2432 * the item is reused by the destination node. 2433 */ 2434 if (item->apply != NULL) { 2435 apply = item->apply; 2436 context = item->context; 2437 item->apply = NULL; 2438 } 2439 2440 switch (item->el_flags & NGQF_TYPE) { 2441 case NGQF_DATA: 2442 /* 2443 * Check things are still ok as when we were queued. 2444 */ 2445 if ((hook == NULL) 2446 || NG_HOOK_NOT_VALID(hook) 2447 || NG_NODE_NOT_VALID(node) ) { 2448 error = EIO; 2449 NG_FREE_ITEM(item); 2450 break; 2451 } 2452 /* 2453 * If no receive method, just silently drop it. 2454 * Give preference to the hook over-ride method 2455 */ 2456 if ((!(rcvdata = hook->hk_rcvdata)) 2457 && (!(rcvdata = NG_HOOK_NODE(hook)->nd_type->rcvdata))) { 2458 error = 0; 2459 NG_FREE_ITEM(item); 2460 break; 2461 } 2462 error = (*rcvdata)(hook, item); 2463 break; 2464 case NGQF_MESG: 2465 if (hook) { 2466 if (NG_HOOK_NOT_VALID(hook)) { 2467 /* 2468 * The hook has been zapped then we can't 2469 * use it. Immediately drop its reference. 2470 * The message may not need it. 2471 */ 2472 NG_HOOK_UNREF(hook); 2473 hook = NULL; 2474 } 2475 } 2476 /* 2477 * Similarly, if the node is a zombie there is 2478 * nothing we can do with it, drop everything. 2479 */ 2480 if (NG_NODE_NOT_VALID(node)) { 2481 TRAP_ERROR(); 2482 error = EINVAL; 2483 NG_FREE_ITEM(item); 2484 } else { 2485 /* 2486 * Call the appropriate message handler for the object. 2487 * It is up to the message handler to free the message. 2488 * If it's a generic message, handle it generically, 2489 * otherwise call the type's message handler 2490 * (if it exists) 2491 * XXX (race). Remember that a queued message may 2492 * reference a node or hook that has just been 2493 * invalidated. It will exist as the queue code 2494 * is holding a reference, but.. 2495 */ 2496 2497 struct ng_mesg *msg = NGI_MSG(item); 2498 2499 /* 2500 * check if the generic handler owns it. 2501 */ 2502 if ((msg->header.typecookie == NGM_GENERIC_COOKIE) 2503 && ((msg->header.flags & NGF_RESP) == 0)) { 2504 error = ng_generic_msg(node, item, hook); 2505 break; 2506 } 2507 /* 2508 * Now see if there is a handler (hook or node specific) 2509 * in the target node. If none, silently discard. 2510 */ 2511 if (((!hook) || (!(rcvmsg = hook->hk_rcvmsg))) 2512 && (!(rcvmsg = node->nd_type->rcvmsg))) { 2513 TRAP_ERROR(); 2514 error = 0; 2515 NG_FREE_ITEM(item); 2516 break; 2517 } 2518 error = (*rcvmsg)(node, item, hook); 2519 } 2520 break; 2521 case NGQF_FN: 2522 /* 2523 * We have to implicitly trust the hook, 2524 * as some of these are used for system purposes 2525 * where the hook is invalid. In the case of 2526 * the shutdown message we allow it to hit 2527 * even if the node is invalid. 2528 */ 2529 if ((NG_NODE_NOT_VALID(node)) 2530 && (NGI_FN(item) != &ng_rmnode)) { 2531 TRAP_ERROR(); 2532 error = EINVAL; 2533 NG_FREE_ITEM(item); 2534 break; 2535 } 2536 (*NGI_FN(item))(node, hook, NGI_ARG1(item), NGI_ARG2(item)); 2537 NG_FREE_ITEM(item); 2538 break; 2539 2540 } 2541 /* 2542 * We held references on some of the resources 2543 * that we took from the item. Now that we have 2544 * finished doing everything, drop those references. 2545 */ 2546 if (hook) { 2547 NG_HOOK_UNREF(hook); 2548 } 2549 2550 if (rw == NGQRW_R) { 2551 ng_leave_read(&node->nd_input_queue); 2552 } else { 2553 ng_leave_write(&node->nd_input_queue); 2554 } 2555 2556 /* Apply callback. */ 2557 if (apply != NULL) 2558 (*apply)(context, error); 2559 2560 return; 2561} 2562 2563/*********************************************************************** 2564 * Implement the 'generic' control messages 2565 ***********************************************************************/ 2566static int 2567ng_generic_msg(node_p here, item_p item, hook_p lasthook) 2568{ 2569 int error = 0; 2570 struct ng_mesg *msg; 2571 struct ng_mesg *resp = NULL; 2572 2573 NGI_GET_MSG(item, msg); 2574 if (msg->header.typecookie != NGM_GENERIC_COOKIE) { 2575 TRAP_ERROR(); 2576 error = EINVAL; 2577 goto out; 2578 } 2579 switch (msg->header.cmd) { 2580 case NGM_SHUTDOWN: 2581 ng_rmnode(here, NULL, NULL, 0); 2582 break; 2583 case NGM_MKPEER: 2584 { 2585 struct ngm_mkpeer *const mkp = (struct ngm_mkpeer *) msg->data; 2586 2587 if (msg->header.arglen != sizeof(*mkp)) { 2588 TRAP_ERROR(); 2589 error = EINVAL; 2590 break; 2591 } 2592 mkp->type[sizeof(mkp->type) - 1] = '\0'; 2593 mkp->ourhook[sizeof(mkp->ourhook) - 1] = '\0'; 2594 mkp->peerhook[sizeof(mkp->peerhook) - 1] = '\0'; 2595 error = ng_mkpeer(here, mkp->ourhook, mkp->peerhook, mkp->type); 2596 break; 2597 } 2598 case NGM_CONNECT: 2599 { 2600 struct ngm_connect *const con = 2601 (struct ngm_connect *) msg->data; 2602 node_p node2; 2603 2604 if (msg->header.arglen != sizeof(*con)) { 2605 TRAP_ERROR(); 2606 error = EINVAL; 2607 break; 2608 } 2609 con->path[sizeof(con->path) - 1] = '\0'; 2610 con->ourhook[sizeof(con->ourhook) - 1] = '\0'; 2611 con->peerhook[sizeof(con->peerhook) - 1] = '\0'; 2612 /* Don't forget we get a reference.. */ 2613 error = ng_path2noderef(here, con->path, &node2, NULL); 2614 if (error) 2615 break; 2616 error = ng_con_nodes(here, con->ourhook, node2, con->peerhook); 2617 NG_NODE_UNREF(node2); 2618 break; 2619 } 2620 case NGM_NAME: 2621 { 2622 struct ngm_name *const nam = (struct ngm_name *) msg->data; 2623 2624 if (msg->header.arglen != sizeof(*nam)) { 2625 TRAP_ERROR(); 2626 error = EINVAL; 2627 break; 2628 } 2629 nam->name[sizeof(nam->name) - 1] = '\0'; 2630 error = ng_name_node(here, nam->name); 2631 break; 2632 } 2633 case NGM_RMHOOK: 2634 { 2635 struct ngm_rmhook *const rmh = (struct ngm_rmhook *) msg->data; 2636 hook_p hook; 2637 2638 if (msg->header.arglen != sizeof(*rmh)) { 2639 TRAP_ERROR(); 2640 error = EINVAL; 2641 break; 2642 } 2643 rmh->ourhook[sizeof(rmh->ourhook) - 1] = '\0'; 2644 if ((hook = ng_findhook(here, rmh->ourhook)) != NULL) 2645 ng_destroy_hook(hook); 2646 break; 2647 } 2648 case NGM_NODEINFO: 2649 { 2650 struct nodeinfo *ni; 2651 2652 NG_MKRESPONSE(resp, msg, sizeof(*ni), M_NOWAIT); 2653 if (resp == NULL) { 2654 error = ENOMEM; 2655 break; 2656 } 2657 2658 /* Fill in node info */ 2659 ni = (struct nodeinfo *) resp->data; 2660 if (NG_NODE_HAS_NAME(here)) 2661 strcpy(ni->name, NG_NODE_NAME(here)); 2662 strcpy(ni->type, here->nd_type->name); 2663 ni->id = ng_node2ID(here); 2664 ni->hooks = here->nd_numhooks; 2665 break; 2666 } 2667 case NGM_LISTHOOKS: 2668 { 2669 const int nhooks = here->nd_numhooks; 2670 struct hooklist *hl; 2671 struct nodeinfo *ni; 2672 hook_p hook; 2673 2674 /* Get response struct */ 2675 NG_MKRESPONSE(resp, msg, sizeof(*hl) 2676 + (nhooks * sizeof(struct linkinfo)), M_NOWAIT); 2677 if (resp == NULL) { 2678 error = ENOMEM; 2679 break; 2680 } 2681 hl = (struct hooklist *) resp->data; 2682 ni = &hl->nodeinfo; 2683 2684 /* Fill in node info */ 2685 if (NG_NODE_HAS_NAME(here)) 2686 strcpy(ni->name, NG_NODE_NAME(here)); 2687 strcpy(ni->type, here->nd_type->name); 2688 ni->id = ng_node2ID(here); 2689 2690 /* Cycle through the linked list of hooks */ 2691 ni->hooks = 0; 2692 LIST_FOREACH(hook, &here->nd_hooks, hk_hooks) { 2693 struct linkinfo *const link = &hl->link[ni->hooks]; 2694 2695 if (ni->hooks >= nhooks) { 2696 log(LOG_ERR, "%s: number of %s changed\n", 2697 __func__, "hooks"); 2698 break; 2699 } 2700 if (NG_HOOK_NOT_VALID(hook)) 2701 continue; 2702 strcpy(link->ourhook, NG_HOOK_NAME(hook)); 2703 strcpy(link->peerhook, NG_PEER_HOOK_NAME(hook)); 2704 if (NG_PEER_NODE_NAME(hook)[0] != '\0') 2705 strcpy(link->nodeinfo.name, 2706 NG_PEER_NODE_NAME(hook)); 2707 strcpy(link->nodeinfo.type, 2708 NG_PEER_NODE(hook)->nd_type->name); 2709 link->nodeinfo.id = ng_node2ID(NG_PEER_NODE(hook)); 2710 link->nodeinfo.hooks = NG_PEER_NODE(hook)->nd_numhooks; 2711 ni->hooks++; 2712 } 2713 break; 2714 } 2715 2716 case NGM_LISTNAMES: 2717 case NGM_LISTNODES: 2718 { 2719 const int unnamed = (msg->header.cmd == NGM_LISTNODES); 2720 struct namelist *nl; 2721 node_p node; 2722 int num = 0; 2723 2724 mtx_lock(&ng_nodelist_mtx); 2725 /* Count number of nodes */ 2726 LIST_FOREACH(node, &ng_nodelist, nd_nodes) { 2727 if (NG_NODE_IS_VALID(node) 2728 && (unnamed || NG_NODE_HAS_NAME(node))) { 2729 num++; 2730 } 2731 } 2732 mtx_unlock(&ng_nodelist_mtx); 2733 2734 /* Get response struct */ 2735 NG_MKRESPONSE(resp, msg, sizeof(*nl) 2736 + (num * sizeof(struct nodeinfo)), M_NOWAIT); 2737 if (resp == NULL) { 2738 error = ENOMEM; 2739 break; 2740 } 2741 nl = (struct namelist *) resp->data; 2742 2743 /* Cycle through the linked list of nodes */ 2744 nl->numnames = 0; 2745 mtx_lock(&ng_nodelist_mtx); 2746 LIST_FOREACH(node, &ng_nodelist, nd_nodes) { 2747 struct nodeinfo *const np = &nl->nodeinfo[nl->numnames]; 2748 2749 if (NG_NODE_NOT_VALID(node)) 2750 continue; 2751 if (!unnamed && (! NG_NODE_HAS_NAME(node))) 2752 continue; 2753 if (nl->numnames >= num) { 2754 log(LOG_ERR, "%s: number of %s changed\n", 2755 __func__, "nodes"); 2756 break; 2757 } 2758 if (NG_NODE_HAS_NAME(node)) 2759 strcpy(np->name, NG_NODE_NAME(node)); 2760 strcpy(np->type, node->nd_type->name); 2761 np->id = ng_node2ID(node); 2762 np->hooks = node->nd_numhooks; 2763 nl->numnames++; 2764 } 2765 mtx_unlock(&ng_nodelist_mtx); 2766 break; 2767 } 2768 2769 case NGM_LISTTYPES: 2770 { 2771 struct typelist *tl; 2772 struct ng_type *type; 2773 int num = 0; 2774 2775 mtx_lock(&ng_typelist_mtx); 2776 /* Count number of types */ 2777 LIST_FOREACH(type, &ng_typelist, types) { 2778 num++; 2779 } 2780 mtx_unlock(&ng_typelist_mtx); 2781 2782 /* Get response struct */ 2783 NG_MKRESPONSE(resp, msg, sizeof(*tl) 2784 + (num * sizeof(struct typeinfo)), M_NOWAIT); 2785 if (resp == NULL) { 2786 error = ENOMEM; 2787 break; 2788 } 2789 tl = (struct typelist *) resp->data; 2790 2791 /* Cycle through the linked list of types */ 2792 tl->numtypes = 0; 2793 mtx_lock(&ng_typelist_mtx); 2794 LIST_FOREACH(type, &ng_typelist, types) { 2795 struct typeinfo *const tp = &tl->typeinfo[tl->numtypes]; 2796 2797 if (tl->numtypes >= num) { 2798 log(LOG_ERR, "%s: number of %s changed\n", 2799 __func__, "types"); 2800 break; 2801 } 2802 strcpy(tp->type_name, type->name); 2803 tp->numnodes = type->refs - 1; /* don't count list */ 2804 tl->numtypes++; 2805 } 2806 mtx_unlock(&ng_typelist_mtx); 2807 break; 2808 } 2809 2810 case NGM_BINARY2ASCII: 2811 { 2812 int bufSize = 20 * 1024; /* XXX hard coded constant */ 2813 const struct ng_parse_type *argstype; 2814 const struct ng_cmdlist *c; 2815 struct ng_mesg *binary, *ascii; 2816 2817 /* Data area must contain a valid netgraph message */ 2818 binary = (struct ng_mesg *)msg->data; 2819 if (msg->header.arglen < sizeof(struct ng_mesg) || 2820 (msg->header.arglen - sizeof(struct ng_mesg) < 2821 binary->header.arglen)) { 2822 TRAP_ERROR(); 2823 error = EINVAL; 2824 break; 2825 } 2826 2827 /* Get a response message with lots of room */ 2828 NG_MKRESPONSE(resp, msg, sizeof(*ascii) + bufSize, M_NOWAIT); 2829 if (resp == NULL) { 2830 error = ENOMEM; 2831 break; 2832 } 2833 ascii = (struct ng_mesg *)resp->data; 2834 2835 /* Copy binary message header to response message payload */ 2836 bcopy(binary, ascii, sizeof(*binary)); 2837 2838 /* Find command by matching typecookie and command number */ 2839 for (c = here->nd_type->cmdlist; 2840 c != NULL && c->name != NULL; c++) { 2841 if (binary->header.typecookie == c->cookie 2842 && binary->header.cmd == c->cmd) 2843 break; 2844 } 2845 if (c == NULL || c->name == NULL) { 2846 for (c = ng_generic_cmds; c->name != NULL; c++) { 2847 if (binary->header.typecookie == c->cookie 2848 && binary->header.cmd == c->cmd) 2849 break; 2850 } 2851 if (c->name == NULL) { 2852 NG_FREE_MSG(resp); 2853 error = ENOSYS; 2854 break; 2855 } 2856 } 2857 2858 /* Convert command name to ASCII */ 2859 snprintf(ascii->header.cmdstr, sizeof(ascii->header.cmdstr), 2860 "%s", c->name); 2861 2862 /* Convert command arguments to ASCII */ 2863 argstype = (binary->header.flags & NGF_RESP) ? 2864 c->respType : c->mesgType; 2865 if (argstype == NULL) { 2866 *ascii->data = '\0'; 2867 } else { 2868 if ((error = ng_unparse(argstype, 2869 (u_char *)binary->data, 2870 ascii->data, bufSize)) != 0) { 2871 NG_FREE_MSG(resp); 2872 break; 2873 } 2874 } 2875 2876 /* Return the result as struct ng_mesg plus ASCII string */ 2877 bufSize = strlen(ascii->data) + 1; 2878 ascii->header.arglen = bufSize; 2879 resp->header.arglen = sizeof(*ascii) + bufSize; 2880 break; 2881 } 2882 2883 case NGM_ASCII2BINARY: 2884 { 2885 int bufSize = 2000; /* XXX hard coded constant */ 2886 const struct ng_cmdlist *c; 2887 const struct ng_parse_type *argstype; 2888 struct ng_mesg *ascii, *binary; 2889 int off = 0; 2890 2891 /* Data area must contain at least a struct ng_mesg + '\0' */ 2892 ascii = (struct ng_mesg *)msg->data; 2893 if ((msg->header.arglen < sizeof(*ascii) + 1) || 2894 (ascii->header.arglen < 1) || 2895 (msg->header.arglen < sizeof(*ascii) + 2896 ascii->header.arglen)) { 2897 TRAP_ERROR(); 2898 error = EINVAL; 2899 break; 2900 } 2901 ascii->data[ascii->header.arglen - 1] = '\0'; 2902 2903 /* Get a response message with lots of room */ 2904 NG_MKRESPONSE(resp, msg, sizeof(*binary) + bufSize, M_NOWAIT); 2905 if (resp == NULL) { 2906 error = ENOMEM; 2907 break; 2908 } 2909 binary = (struct ng_mesg *)resp->data; 2910 2911 /* Copy ASCII message header to response message payload */ 2912 bcopy(ascii, binary, sizeof(*ascii)); 2913 2914 /* Find command by matching ASCII command string */ 2915 for (c = here->nd_type->cmdlist; 2916 c != NULL && c->name != NULL; c++) { 2917 if (strcmp(ascii->header.cmdstr, c->name) == 0) 2918 break; 2919 } 2920 if (c == NULL || c->name == NULL) { 2921 for (c = ng_generic_cmds; c->name != NULL; c++) { 2922 if (strcmp(ascii->header.cmdstr, c->name) == 0) 2923 break; 2924 } 2925 if (c->name == NULL) { 2926 NG_FREE_MSG(resp); 2927 error = ENOSYS; 2928 break; 2929 } 2930 } 2931 2932 /* Convert command name to binary */ 2933 binary->header.cmd = c->cmd; 2934 binary->header.typecookie = c->cookie; 2935 2936 /* Convert command arguments to binary */ 2937 argstype = (binary->header.flags & NGF_RESP) ? 2938 c->respType : c->mesgType; 2939 if (argstype == NULL) { 2940 bufSize = 0; 2941 } else { 2942 if ((error = ng_parse(argstype, ascii->data, 2943 &off, (u_char *)binary->data, &bufSize)) != 0) { 2944 NG_FREE_MSG(resp); 2945 break; 2946 } 2947 } 2948 2949 /* Return the result */ 2950 binary->header.arglen = bufSize; 2951 resp->header.arglen = sizeof(*binary) + bufSize; 2952 break; 2953 } 2954 2955 case NGM_TEXT_CONFIG: 2956 case NGM_TEXT_STATUS: 2957 /* 2958 * This one is tricky as it passes the command down to the 2959 * actual node, even though it is a generic type command. 2960 * This means we must assume that the item/msg is already freed 2961 * when control passes back to us. 2962 */ 2963 if (here->nd_type->rcvmsg != NULL) { 2964 NGI_MSG(item) = msg; /* put it back as we found it */ 2965 return((*here->nd_type->rcvmsg)(here, item, lasthook)); 2966 } 2967 /* Fall through if rcvmsg not supported */ 2968 default: 2969 TRAP_ERROR(); 2970 error = EINVAL; 2971 } 2972 /* 2973 * Sometimes a generic message may be statically allocated 2974 * to avoid problems with allocating when in tight memeory situations. 2975 * Don't free it if it is so. 2976 * I break them appart here, because erros may cause a free if the item 2977 * in which case we'd be doing it twice. 2978 * they are kept together above, to simplify freeing. 2979 */ 2980out: 2981 NG_RESPOND_MSG(error, here, item, resp); 2982 if (msg) 2983 NG_FREE_MSG(msg); 2984 return (error); 2985} 2986 2987/************************************************************************ 2988 Queue element get/free routines 2989************************************************************************/ 2990 2991uma_zone_t ng_qzone; 2992static int maxalloc = 512; /* limit the damage of a leak */ 2993 2994TUNABLE_INT("net.graph.maxalloc", &maxalloc); 2995SYSCTL_INT(_net_graph, OID_AUTO, maxalloc, CTLFLAG_RDTUN, &maxalloc, 2996 0, "Maximum number of queue items to allocate"); 2997 2998#ifdef NETGRAPH_DEBUG 2999static TAILQ_HEAD(, ng_item) ng_itemlist = TAILQ_HEAD_INITIALIZER(ng_itemlist); 3000static int allocated; /* number of items malloc'd */ 3001#endif 3002 3003/* 3004 * Get a queue entry. 3005 * This is usually called when a packet first enters netgraph. 3006 * By definition, this is usually from an interrupt, or from a user. 3007 * Users are not so important, but try be quick for the times that it's 3008 * an interrupt. 3009 */ 3010static __inline item_p 3011ng_getqblk(int flags) 3012{ 3013 item_p item = NULL; 3014 int wait; 3015 3016 wait = (flags & NG_WAITOK) ? M_WAITOK : M_NOWAIT; 3017 3018 item = uma_zalloc(ng_qzone, wait | M_ZERO); 3019 3020#ifdef NETGRAPH_DEBUG 3021 if (item) { 3022 mtx_lock(&ngq_mtx); 3023 TAILQ_INSERT_TAIL(&ng_itemlist, item, all); 3024 allocated++; 3025 mtx_unlock(&ngq_mtx); 3026 } 3027#endif 3028 3029 return (item); 3030} 3031 3032/* 3033 * Release a queue entry 3034 */ 3035void 3036ng_free_item(item_p item) 3037{ 3038 KASSERT(item->apply == NULL, ("%s: leaking apply callback", __func__)); 3039 3040 /* 3041 * The item may hold resources on it's own. We need to free 3042 * these before we can free the item. What they are depends upon 3043 * what kind of item it is. it is important that nodes zero 3044 * out pointers to resources that they remove from the item 3045 * or we release them again here. 3046 */ 3047 switch (item->el_flags & NGQF_TYPE) { 3048 case NGQF_DATA: 3049 /* If we have an mbuf still attached.. */ 3050 NG_FREE_M(_NGI_M(item)); 3051 break; 3052 case NGQF_MESG: 3053 _NGI_RETADDR(item) = 0; 3054 NG_FREE_MSG(_NGI_MSG(item)); 3055 break; 3056 case NGQF_FN: 3057 /* nothing to free really, */ 3058 _NGI_FN(item) = NULL; 3059 _NGI_ARG1(item) = NULL; 3060 _NGI_ARG2(item) = 0; 3061 case NGQF_UNDEF: 3062 break; 3063 } 3064 /* If we still have a node or hook referenced... */ 3065 _NGI_CLR_NODE(item); 3066 _NGI_CLR_HOOK(item); 3067 3068#ifdef NETGRAPH_DEBUG 3069 mtx_lock(&ngq_mtx); 3070 TAILQ_REMOVE(&ng_itemlist, item, all); 3071 allocated--; 3072 mtx_unlock(&ngq_mtx); 3073#endif 3074 uma_zfree(ng_qzone, item); 3075} 3076 3077/************************************************************************ 3078 Module routines 3079************************************************************************/ 3080 3081/* 3082 * Handle the loading/unloading of a netgraph node type module 3083 */ 3084int 3085ng_mod_event(module_t mod, int event, void *data) 3086{ 3087 struct ng_type *const type = data; 3088 int s, error = 0; 3089 3090 switch (event) { 3091 case MOD_LOAD: 3092 3093 /* Register new netgraph node type */ 3094 s = splnet(); 3095 if ((error = ng_newtype(type)) != 0) { 3096 splx(s); 3097 break; 3098 } 3099 3100 /* Call type specific code */ 3101 if (type->mod_event != NULL) 3102 if ((error = (*type->mod_event)(mod, event, data))) { 3103 mtx_lock(&ng_typelist_mtx); 3104 type->refs--; /* undo it */ 3105 LIST_REMOVE(type, types); 3106 mtx_unlock(&ng_typelist_mtx); 3107 } 3108 splx(s); 3109 break; 3110 3111 case MOD_UNLOAD: 3112 s = splnet(); 3113 if (type->refs > 1) { /* make sure no nodes exist! */ 3114 error = EBUSY; 3115 } else { 3116 if (type->refs == 0) { 3117 /* failed load, nothing to undo */ 3118 splx(s); 3119 break; 3120 } 3121 if (type->mod_event != NULL) { /* check with type */ 3122 error = (*type->mod_event)(mod, event, data); 3123 if (error != 0) { /* type refuses.. */ 3124 splx(s); 3125 break; 3126 } 3127 } 3128 mtx_lock(&ng_typelist_mtx); 3129 LIST_REMOVE(type, types); 3130 mtx_unlock(&ng_typelist_mtx); 3131 } 3132 splx(s); 3133 break; 3134 3135 default: 3136 if (type->mod_event != NULL) 3137 error = (*type->mod_event)(mod, event, data); 3138 else 3139 error = EOPNOTSUPP; /* XXX ? */ 3140 break; 3141 } 3142 return (error); 3143} 3144 3145/* 3146 * Handle loading and unloading for this code. 3147 * The only thing we need to link into is the NETISR strucure. 3148 */ 3149static int 3150ngb_mod_event(module_t mod, int event, void *data) 3151{ 3152 int error = 0; 3153 3154 switch (event) { 3155 case MOD_LOAD: 3156 /* Initialize everything. */ 3157 NG_WORKLIST_LOCK_INIT(); 3158 mtx_init(&ng_typelist_mtx, "netgraph types mutex", NULL, 3159 MTX_DEF); 3160 mtx_init(&ng_nodelist_mtx, "netgraph nodelist mutex", NULL, 3161 MTX_DEF); 3162 mtx_init(&ng_idhash_mtx, "netgraph idhash mutex", NULL, 3163 MTX_DEF); 3164 mtx_init(&ng_topo_mtx, "netgraph topology mutex", NULL, 3165 MTX_DEF); 3166#ifdef NETGRAPH_DEBUG 3167 mtx_init(&ngq_mtx, "netgraph item list mutex", NULL, 3168 MTX_DEF); 3169#endif 3170 ng_qzone = uma_zcreate("NetGraph items", sizeof(struct ng_item), 3171 NULL, NULL, NULL, NULL, UMA_ALIGN_CACHE, 0); 3172 uma_zone_set_max(ng_qzone, maxalloc); 3173 netisr_register(NETISR_NETGRAPH, (netisr_t *)ngintr, NULL, 3174 NETISR_MPSAFE); 3175 break; 3176 case MOD_UNLOAD: 3177 /* You can't unload it because an interface may be using it. */ 3178 error = EBUSY; 3179 break; 3180 default: 3181 error = EOPNOTSUPP; 3182 break; 3183 } 3184 return (error); 3185} 3186 3187static moduledata_t netgraph_mod = { 3188 "netgraph", 3189 ngb_mod_event, 3190 (NULL) 3191}; 3192DECLARE_MODULE(netgraph, netgraph_mod, SI_SUB_NETGRAPH, SI_ORDER_MIDDLE); 3193SYSCTL_NODE(_net, OID_AUTO, graph, CTLFLAG_RW, 0, "netgraph Family"); 3194SYSCTL_INT(_net_graph, OID_AUTO, abi_version, CTLFLAG_RD, 0, NG_ABI_VERSION,""); 3195SYSCTL_INT(_net_graph, OID_AUTO, msg_version, CTLFLAG_RD, 0, NG_VERSION, ""); 3196 3197#ifdef NETGRAPH_DEBUG 3198void 3199dumphook (hook_p hook, char *file, int line) 3200{ 3201 printf("hook: name %s, %d refs, Last touched:\n", 3202 _NG_HOOK_NAME(hook), hook->hk_refs); 3203 printf(" Last active @ %s, line %d\n", 3204 hook->lastfile, hook->lastline); 3205 if (line) { 3206 printf(" problem discovered at file %s, line %d\n", file, line); 3207 } 3208} 3209 3210void 3211dumpnode(node_p node, char *file, int line) 3212{ 3213 printf("node: ID [%x]: type '%s', %d hooks, flags 0x%x, %d refs, %s:\n", 3214 _NG_NODE_ID(node), node->nd_type->name, 3215 node->nd_numhooks, node->nd_flags, 3216 node->nd_refs, node->nd_name); 3217 printf(" Last active @ %s, line %d\n", 3218 node->lastfile, node->lastline); 3219 if (line) { 3220 printf(" problem discovered at file %s, line %d\n", file, line); 3221 } 3222} 3223 3224void 3225dumpitem(item_p item, char *file, int line) 3226{ 3227 printf(" ACTIVE item, last used at %s, line %d", 3228 item->lastfile, item->lastline); 3229 switch(item->el_flags & NGQF_TYPE) { 3230 case NGQF_DATA: 3231 printf(" - [data]\n"); 3232 break; 3233 case NGQF_MESG: 3234 printf(" - retaddr[%d]:\n", _NGI_RETADDR(item)); 3235 break; 3236 case NGQF_FN: 3237 printf(" - fn@%p (%p, %p, %p, %d (%x))\n", 3238 item->body.fn.fn_fn, 3239 _NGI_NODE(item), 3240 _NGI_HOOK(item), 3241 item->body.fn.fn_arg1, 3242 item->body.fn.fn_arg2, 3243 item->body.fn.fn_arg2); 3244 break; 3245 case NGQF_UNDEF: 3246 printf(" - UNDEFINED!\n"); 3247 } 3248 if (line) { 3249 printf(" problem discovered at file %s, line %d\n", file, line); 3250 if (_NGI_NODE(item)) { 3251 printf("node %p ([%x])\n", 3252 _NGI_NODE(item), ng_node2ID(_NGI_NODE(item))); 3253 } 3254 } 3255} 3256 3257static void 3258ng_dumpitems(void) 3259{ 3260 item_p item; 3261 int i = 1; 3262 TAILQ_FOREACH(item, &ng_itemlist, all) { 3263 printf("[%d] ", i++); 3264 dumpitem(item, NULL, 0); 3265 } 3266} 3267 3268static void 3269ng_dumpnodes(void) 3270{ 3271 node_p node; 3272 int i = 1; 3273 mtx_lock(&ng_nodelist_mtx); 3274 SLIST_FOREACH(node, &ng_allnodes, nd_all) { 3275 printf("[%d] ", i++); 3276 dumpnode(node, NULL, 0); 3277 } 3278 mtx_unlock(&ng_nodelist_mtx); 3279} 3280 3281static void 3282ng_dumphooks(void) 3283{ 3284 hook_p hook; 3285 int i = 1; 3286 mtx_lock(&ng_nodelist_mtx); 3287 SLIST_FOREACH(hook, &ng_allhooks, hk_all) { 3288 printf("[%d] ", i++); 3289 dumphook(hook, NULL, 0); 3290 } 3291 mtx_unlock(&ng_nodelist_mtx); 3292} 3293 3294static int 3295sysctl_debug_ng_dump_items(SYSCTL_HANDLER_ARGS) 3296{ 3297 int error; 3298 int val; 3299 int i; 3300 3301 val = allocated; 3302 i = 1; 3303 error = sysctl_handle_int(oidp, &val, sizeof(int), req); 3304 if (error != 0 || req->newptr == NULL) 3305 return (error); 3306 if (val == 42) { 3307 ng_dumpitems(); 3308 ng_dumpnodes(); 3309 ng_dumphooks(); 3310 } 3311 return (0); 3312} 3313 3314SYSCTL_PROC(_debug, OID_AUTO, ng_dump_items, CTLTYPE_INT | CTLFLAG_RW, 3315 0, sizeof(int), sysctl_debug_ng_dump_items, "I", "Number of allocated items"); 3316#endif /* NETGRAPH_DEBUG */ 3317 3318 3319/*********************************************************************** 3320* Worklist routines 3321**********************************************************************/ 3322/* NETISR thread enters here */ 3323/* 3324 * Pick a node off the list of nodes with work, 3325 * try get an item to process off it. 3326 * If there are no more, remove the node from the list. 3327 */ 3328static void 3329ngintr(void) 3330{ 3331 item_p item; 3332 node_p node = NULL; 3333 3334 for (;;) { 3335 NG_WORKLIST_LOCK(); 3336 node = TAILQ_FIRST(&ng_worklist); 3337 if (!node) { 3338 NG_WORKLIST_UNLOCK(); 3339 break; 3340 } 3341 node->nd_flags &= ~NGF_WORKQ; 3342 TAILQ_REMOVE(&ng_worklist, node, nd_work); 3343 NG_WORKLIST_UNLOCK(); 3344 CTR3(KTR_NET, "%20s: node [%x] (%p) taken off worklist", 3345 __func__, node->nd_ID, node); 3346 /* 3347 * We have the node. We also take over the reference 3348 * that the list had on it. 3349 * Now process as much as you can, until it won't 3350 * let you have another item off the queue. 3351 * All this time, keep the reference 3352 * that lets us be sure that the node still exists. 3353 * Let the reference go at the last minute. 3354 * ng_dequeue will put us back on the worklist 3355 * if there is more too do. This may be of use if there 3356 * are Multiple Processors and multiple Net threads in the 3357 * future. 3358 */ 3359 for (;;) { 3360 int rw; 3361 3362 NG_QUEUE_LOCK(&node->nd_input_queue); 3363 item = ng_dequeue(&node->nd_input_queue, &rw); 3364 if (item == NULL) { 3365 NG_QUEUE_UNLOCK(&node->nd_input_queue); 3366 break; /* go look for another node */ 3367 } else { 3368 NG_QUEUE_UNLOCK(&node->nd_input_queue); 3369 NGI_GET_NODE(item, node); /* zaps stored node */ 3370 ng_apply_item(node, item, rw); 3371 NG_NODE_UNREF(node); 3372 } 3373 } 3374 NG_NODE_UNREF(node); 3375 } 3376} 3377 3378static void 3379ng_worklist_remove(node_p node) 3380{ 3381 mtx_assert(&node->nd_input_queue.q_mtx, MA_OWNED); 3382 3383 NG_WORKLIST_LOCK(); 3384 if (node->nd_flags & NGF_WORKQ) { 3385 node->nd_flags &= ~NGF_WORKQ; 3386 TAILQ_REMOVE(&ng_worklist, node, nd_work); 3387 NG_WORKLIST_UNLOCK(); 3388 NG_NODE_UNREF(node); 3389 CTR3(KTR_NET, "%20s: node [%x] (%p) removed from worklist", 3390 __func__, node->nd_ID, node); 3391 } else { 3392 NG_WORKLIST_UNLOCK(); 3393 } 3394} 3395 3396/* 3397 * XXX 3398 * It's posible that a debugging NG_NODE_REF may need 3399 * to be outside the mutex zone 3400 */ 3401static void 3402ng_setisr(node_p node) 3403{ 3404 3405 mtx_assert(&node->nd_input_queue.q_mtx, MA_OWNED); 3406 3407 if ((node->nd_flags & NGF_WORKQ) == 0) { 3408 /* 3409 * If we are not already on the work queue, 3410 * then put us on. 3411 */ 3412 node->nd_flags |= NGF_WORKQ; 3413 NG_WORKLIST_LOCK(); 3414 TAILQ_INSERT_TAIL(&ng_worklist, node, nd_work); 3415 NG_WORKLIST_UNLOCK(); 3416 NG_NODE_REF(node); /* XXX fafe in mutex? */ 3417 CTR3(KTR_NET, "%20s: node [%x] (%p) put on worklist", __func__, 3418 node->nd_ID, node); 3419 } else 3420 CTR3(KTR_NET, "%20s: node [%x] (%p) already on worklist", 3421 __func__, node->nd_ID, node); 3422 schednetisr(NETISR_NETGRAPH); 3423} 3424 3425 3426/*********************************************************************** 3427* Externally useable functions to set up a queue item ready for sending 3428***********************************************************************/ 3429 3430#ifdef NETGRAPH_DEBUG 3431#define ITEM_DEBUG_CHECKS \ 3432 do { \ 3433 if (NGI_NODE(item) ) { \ 3434 printf("item already has node"); \ 3435 kdb_enter("has node"); \ 3436 NGI_CLR_NODE(item); \ 3437 } \ 3438 if (NGI_HOOK(item) ) { \ 3439 printf("item already has hook"); \ 3440 kdb_enter("has hook"); \ 3441 NGI_CLR_HOOK(item); \ 3442 } \ 3443 } while (0) 3444#else 3445#define ITEM_DEBUG_CHECKS 3446#endif 3447 3448/* 3449 * Put mbuf into the item. 3450 * Hook and node references will be removed when the item is dequeued. 3451 * (or equivalent) 3452 * (XXX) Unsafe because no reference held by peer on remote node. 3453 * remote node might go away in this timescale. 3454 * We know the hooks can't go away because that would require getting 3455 * a writer item on both nodes and we must have at least a reader 3456 * here to be able to do this. 3457 * Note that the hook loaded is the REMOTE hook. 3458 * 3459 * This is possibly in the critical path for new data. 3460 */ 3461item_p 3462ng_package_data(struct mbuf *m, int flags) 3463{ 3464 item_p item; 3465 3466 if ((item = ng_getqblk(flags)) == NULL) { 3467 NG_FREE_M(m); 3468 return (NULL); 3469 } 3470 ITEM_DEBUG_CHECKS; 3471 item->el_flags = NGQF_DATA | NGQF_READER; 3472 item->el_next = NULL; 3473 NGI_M(item) = m; 3474 return (item); 3475} 3476 3477/* 3478 * Allocate a queue item and put items into it.. 3479 * Evaluate the address as this will be needed to queue it and 3480 * to work out what some of the fields should be. 3481 * Hook and node references will be removed when the item is dequeued. 3482 * (or equivalent) 3483 */ 3484item_p 3485ng_package_msg(struct ng_mesg *msg, int flags) 3486{ 3487 item_p item; 3488 3489 if ((item = ng_getqblk(flags)) == NULL) { 3490 NG_FREE_MSG(msg); 3491 return (NULL); 3492 } 3493 ITEM_DEBUG_CHECKS; 3494 /* Messages items count as writers unless explicitly exempted. */ 3495 if (msg->header.cmd & NGM_READONLY) 3496 item->el_flags = NGQF_MESG | NGQF_READER; 3497 else 3498 item->el_flags = NGQF_MESG | NGQF_WRITER; 3499 item->el_next = NULL; 3500 /* 3501 * Set the current lasthook into the queue item 3502 */ 3503 NGI_MSG(item) = msg; 3504 NGI_RETADDR(item) = 0; 3505 return (item); 3506} 3507 3508 3509 3510#define SET_RETADDR(item, here, retaddr) \ 3511 do { /* Data or fn items don't have retaddrs */ \ 3512 if ((item->el_flags & NGQF_TYPE) == NGQF_MESG) { \ 3513 if (retaddr) { \ 3514 NGI_RETADDR(item) = retaddr; \ 3515 } else { \ 3516 /* \ 3517 * The old return address should be ok. \ 3518 * If there isn't one, use the address \ 3519 * here. \ 3520 */ \ 3521 if (NGI_RETADDR(item) == 0) { \ 3522 NGI_RETADDR(item) \ 3523 = ng_node2ID(here); \ 3524 } \ 3525 } \ 3526 } \ 3527 } while (0) 3528 3529int 3530ng_address_hook(node_p here, item_p item, hook_p hook, ng_ID_t retaddr) 3531{ 3532 hook_p peer; 3533 node_p peernode; 3534 ITEM_DEBUG_CHECKS; 3535 /* 3536 * Quick sanity check.. 3537 * Since a hook holds a reference on it's node, once we know 3538 * that the peer is still connected (even if invalid,) we know 3539 * that the peer node is present, though maybe invalid. 3540 */ 3541 if ((hook == NULL) 3542 || NG_HOOK_NOT_VALID(hook) 3543 || (NG_HOOK_PEER(hook) == NULL) 3544 || NG_HOOK_NOT_VALID(NG_HOOK_PEER(hook)) 3545 || NG_NODE_NOT_VALID(NG_PEER_NODE(hook))) { 3546 NG_FREE_ITEM(item); 3547 TRAP_ERROR(); 3548 return (ENETDOWN); 3549 } 3550 3551 /* 3552 * Transfer our interest to the other (peer) end. 3553 */ 3554 peer = NG_HOOK_PEER(hook); 3555 NG_HOOK_REF(peer); 3556 NGI_SET_HOOK(item, peer); 3557 peernode = NG_PEER_NODE(hook); 3558 NG_NODE_REF(peernode); 3559 NGI_SET_NODE(item, peernode); 3560 SET_RETADDR(item, here, retaddr); 3561 return (0); 3562} 3563 3564int 3565ng_address_path(node_p here, item_p item, char *address, ng_ID_t retaddr) 3566{ 3567 node_p dest = NULL; 3568 hook_p hook = NULL; 3569 int error; 3570 3571 ITEM_DEBUG_CHECKS; 3572 /* 3573 * Note that ng_path2noderef increments the reference count 3574 * on the node for us if it finds one. So we don't have to. 3575 */ 3576 error = ng_path2noderef(here, address, &dest, &hook); 3577 if (error) { 3578 NG_FREE_ITEM(item); 3579 return (error); 3580 } 3581 NGI_SET_NODE(item, dest); 3582 if ( hook) { 3583 NG_HOOK_REF(hook); /* don't let it go while on the queue */ 3584 NGI_SET_HOOK(item, hook); 3585 } 3586 SET_RETADDR(item, here, retaddr); 3587 return (0); 3588} 3589 3590int 3591ng_address_ID(node_p here, item_p item, ng_ID_t ID, ng_ID_t retaddr) 3592{ 3593 node_p dest; 3594 3595 ITEM_DEBUG_CHECKS; 3596 /* 3597 * Find the target node. 3598 */ 3599 dest = ng_ID2noderef(ID); /* GETS REFERENCE! */ 3600 if (dest == NULL) { 3601 NG_FREE_ITEM(item); 3602 TRAP_ERROR(); 3603 return(EINVAL); 3604 } 3605 /* Fill out the contents */ 3606 NGI_SET_NODE(item, dest); 3607 NGI_CLR_HOOK(item); 3608 SET_RETADDR(item, here, retaddr); 3609 return (0); 3610} 3611 3612/* 3613 * special case to send a message to self (e.g. destroy node) 3614 * Possibly indicate an arrival hook too. 3615 * Useful for removing that hook :-) 3616 */ 3617item_p 3618ng_package_msg_self(node_p here, hook_p hook, struct ng_mesg *msg) 3619{ 3620 item_p item; 3621 3622 /* 3623 * Find the target node. 3624 * If there is a HOOK argument, then use that in preference 3625 * to the address. 3626 */ 3627 if ((item = ng_getqblk(NG_NOFLAGS)) == NULL) { 3628 NG_FREE_MSG(msg); 3629 return (NULL); 3630 } 3631 3632 /* Fill out the contents */ 3633 item->el_flags = NGQF_MESG | NGQF_WRITER; 3634 item->el_next = NULL; 3635 NG_NODE_REF(here); 3636 NGI_SET_NODE(item, here); 3637 if (hook) { 3638 NG_HOOK_REF(hook); 3639 NGI_SET_HOOK(item, hook); 3640 } 3641 NGI_MSG(item) = msg; 3642 NGI_RETADDR(item) = ng_node2ID(here); 3643 return (item); 3644} 3645 3646int 3647ng_send_fn1(node_p node, hook_p hook, ng_item_fn *fn, void * arg1, int arg2, 3648 int flags) 3649{ 3650 item_p item; 3651 3652 if ((item = ng_getqblk(flags)) == NULL) { 3653 return (ENOMEM); 3654 } 3655 item->el_flags = NGQF_FN | NGQF_WRITER; 3656 NG_NODE_REF(node); /* and one for the item */ 3657 NGI_SET_NODE(item, node); 3658 if (hook) { 3659 NG_HOOK_REF(hook); 3660 NGI_SET_HOOK(item, hook); 3661 } 3662 NGI_FN(item) = fn; 3663 NGI_ARG1(item) = arg1; 3664 NGI_ARG2(item) = arg2; 3665 return(ng_snd_item(item, flags)); 3666} 3667 3668/* 3669 * Official timeout routines for Netgraph nodes. 3670 */ 3671static void 3672ng_callout_trampoline(void *arg) 3673{ 3674 item_p item = arg; 3675 3676 ng_snd_item(item, 0); 3677} 3678 3679 3680int 3681ng_callout(struct callout *c, node_p node, hook_p hook, int ticks, 3682 ng_item_fn *fn, void * arg1, int arg2) 3683{ 3684 item_p item, oitem; 3685 3686 if ((item = ng_getqblk(NG_NOFLAGS)) == NULL) 3687 return (ENOMEM); 3688 3689 item->el_flags = NGQF_FN | NGQF_WRITER; 3690 NG_NODE_REF(node); /* and one for the item */ 3691 NGI_SET_NODE(item, node); 3692 if (hook) { 3693 NG_HOOK_REF(hook); 3694 NGI_SET_HOOK(item, hook); 3695 } 3696 NGI_FN(item) = fn; 3697 NGI_ARG1(item) = arg1; 3698 NGI_ARG2(item) = arg2; 3699 oitem = c->c_arg; 3700 if (callout_reset(c, ticks, &ng_callout_trampoline, item) == 1 && 3701 oitem != NULL) 3702 NG_FREE_ITEM(oitem); 3703 return (0); 3704} 3705 3706/* A special modified version of untimeout() */ 3707int 3708ng_uncallout(struct callout *c, node_p node) 3709{ 3710 item_p item; 3711 int rval; 3712 3713 KASSERT(c != NULL, ("ng_uncallout: NULL callout")); 3714 KASSERT(node != NULL, ("ng_uncallout: NULL node")); 3715 3716 rval = callout_stop(c); 3717 item = c->c_arg; 3718 /* Do an extra check */ 3719 if ((rval > 0) && (c->c_func == &ng_callout_trampoline) && 3720 (NGI_NODE(item) == node)) { 3721 /* 3722 * We successfully removed it from the queue before it ran 3723 * So now we need to unreference everything that was 3724 * given extra references. (NG_FREE_ITEM does this). 3725 */ 3726 NG_FREE_ITEM(item); 3727 } 3728 c->c_arg = NULL; 3729 3730 return (rval); 3731} 3732 3733/* 3734 * Set the address, if none given, give the node here. 3735 */ 3736void 3737ng_replace_retaddr(node_p here, item_p item, ng_ID_t retaddr) 3738{ 3739 if (retaddr) { 3740 NGI_RETADDR(item) = retaddr; 3741 } else { 3742 /* 3743 * The old return address should be ok. 3744 * If there isn't one, use the address here. 3745 */ 3746 NGI_RETADDR(item) = ng_node2ID(here); 3747 } 3748} 3749 3750#define TESTING 3751#ifdef TESTING 3752/* just test all the macros */ 3753void 3754ng_macro_test(item_p item); 3755void 3756ng_macro_test(item_p item) 3757{ 3758 node_p node = NULL; 3759 hook_p hook = NULL; 3760 struct mbuf *m; 3761 struct ng_mesg *msg; 3762 ng_ID_t retaddr; 3763 int error; 3764 3765 NGI_GET_M(item, m); 3766 NGI_GET_MSG(item, msg); 3767 retaddr = NGI_RETADDR(item); 3768 NG_SEND_DATA(error, hook, m, NULL); 3769 NG_SEND_DATA_ONLY(error, hook, m); 3770 NG_FWD_NEW_DATA(error, item, hook, m); 3771 NG_FWD_ITEM_HOOK(error, item, hook); 3772 NG_SEND_MSG_HOOK(error, node, msg, hook, retaddr); 3773 NG_SEND_MSG_ID(error, node, msg, retaddr, retaddr); 3774 NG_SEND_MSG_PATH(error, node, msg, ".:", retaddr); 3775 NG_FWD_MSG_HOOK(error, node, item, hook, retaddr); 3776} 3777#endif /* TESTING */ 3778 3779