===========================================================
                                      .___ __  __   
          _________________  __ __  __| _/|__|/  |_ 
         / ___\_` __ \__  \ |  |  \/ __ | | \\_  __\
        / /_/  >  | \// __ \|  |  / /_/ | |  ||  |  
        \___  /|__|  (____  /____/\____ | |__||__|  
       /_____/            \/           \/           
              grep rough audit - static analysis tool
                  v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
tweak-3.02/btree.c-389- */
tweak-3.02/btree.c:390:static INLINE node_addr bt_node_addr(btree *bt, nodeptr n)
tweak-3.02/btree.c-391-{
##############################################
tweak-3.02/btree.c-406-	nodeptr clone = bt_clone_node(bt, addr.p);
tweak-3.02/btree.c:407:	bt_set_child(bt, a, index, bt_node_addr(bt, clone));
tweak-3.02/btree.c-408-	testlock(TRUE, TRUE, clone);
##############################################
tweak-3.02/btree.c-418-	nodeptr clone = bt_clone_node(bt, addr.p);
tweak-3.02/btree.c:419:	bt->root = bt_node_addr(bt, clone);
tweak-3.02/btree.c-420-	testlock(TRUE, TRUE, clone);
##############################################
tweak-3.02/btree.c-1397-		bt_xform(bt, NODE_DEL_ELT, child,
tweak-3.02/btree.c:1398:			 n, NULL, NULL, bt_node_addr(bt, c), NODE_ADDR_NULL,
tweak-3.02/btree.c-1399-			 NODE_JOIN, &n, NULL, NULL);
##############################################
tweak-3.02/btree.c-1404-		     */
tweak-3.02/btree.c:1405:		    bt_shift_root(bt, n, bt_node_addr(bt, c));
tweak-3.02/btree.c-1406-		    nnodes--;	       /* don't leave it in nodes[]! */
##############################################
tweak-3.02/btree.c-1542-    if (ld > rd) {
tweak-3.02/btree.c:1543:	bt->root = bt_node_addr(bt, lp);
tweak-3.02/btree.c-1544-	bt->depth = ld;
##############################################
tweak-3.02/btree.c-1555-    } else {
tweak-3.02/btree.c:1556:	bt->root = bt_node_addr(bt, rp);
tweak-3.02/btree.c-1557-	bt->depth = rd;
##############################################
tweak-3.02/btree.c-1744-	nodeptr n2 = bt_write_lock_child(bt, n, 0);
tweak-3.02/btree.c:1745:	bt_shift_root(bt, n, bt_node_addr(bt, n2));
tweak-3.02/btree.c-1746-	n = n2;
##############################################
tweak-3.02/btree.c-1793-		bt_xform(bt, NODE_DEL_ELT, elt, n, NULL, NULL,
tweak-3.02/btree.c:1794:			 bt_node_addr(bt, ne), NODE_ADDR_NULL,
tweak-3.02/btree.c-1795-			 NODE_JOIN, &n, NULL, NULL);
##############################################
tweak-3.02/btree.c-1800-		if (bt_subtrees(bt, n) == 1) {
tweak-3.02/btree.c:1801:		    bt_shift_root(bt, n, bt_node_addr(bt, ne));
tweak-3.02/btree.c-1802-		    nnodes--;	       /* and take it out of nodes[] */
##############################################
tweak-3.02/btree.c-1862-	bt_xform(bt1, NODE_ADD_ELT, child, n1, NULL, NULL,
tweak-3.02/btree.c:1863:		 bt_node_addr(bt1, n), NODE_ADDR_NULL,
tweak-3.02/btree.c-1864-		 child, &n1, &n2, NULL);
##############################################
tweak-3.02/btree.c-1867-	if (nnodes > 0)
tweak-3.02/btree.c:1868:	    bt_set_child(bt2, rnodes[nnodes-1], 0, bt_node_addr(bt2, n2));
tweak-3.02/btree.c-1869-	else
tweak-3.02/btree.c:1870:	    bt2->root = bt_node_addr(bt2, n2);
tweak-3.02/btree.c-1871-	nnodes++;