/darwin-on-arm/xnu/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeTreeOps.c | 31 Contains: Multi-node tree operations for the BTree Module. 56 <CS5> 12/8/97 djb Radar #2200632, CollapseTree wasn't marking root node dirty. 157 u_int32_t node, 172 //////////////////////// BTree Multi-node Tree Operations /////////////////////// 187 Output: nodeNum - number of the node containing the key position 204 int16_t level; // Expected depth of current node 205 u_int32_t curNodeNum; // Current node we're searching 209 int8_t nodeKind; // Kind of current node (index/leaf) 225 treePathTable [0].node = 0; 231 // [2550929] Node number 0 is the header node 557 InsertNode(BTreeControlBlockPtr btreePtr, InsertKey *key, BlockDescriptor *rightNode, u_int32_t node, u_int16_t index, u_int32_t *newNode, u_int16_t *newIndex, BlockDescriptor *leftNode, Boolean *updateParent, Boolean *insertParent, Boolean *rootSplit ) argument [all...] |
/darwin-on-arm/xnu/bsd/netat/ |
H A D | adsp_RxAttn.c | 82 if (sp->remoteAddress.a.node != m->addr.a.node)
|
H A D | ddp_aarp.c | 74 int no_of_nodes_tried; /* no of node addresses we've tried 124 ("aarp_init: pick up a new node number\n")); 164 /* AppleTalk was successfully started up. Send event with node and net. */ 843 register u_char node; local 846 * generate a starting node number in the range 1 thru 0xfd. 848 * To generate a different node number each time we call 851 node = ((u_char)(random() & 0xff)) % 0xfd + 2; 853 elapp->initial_addr.s_node = node; 862 register u_char node = elapp->initial_addr.s_node; local 865 * return the next node numbe [all...] |
H A D | ddp_proto.c | 105 fills in the net and node of the ddp_addr_t param 106 with the net and node of the default interface, 107 not the net and node that has been bound, as 126 cfgp->inet.node = ifID_home->ifThisNode.s_node; 129 cfgp->inet.node = gref->laddr.s_node;
|
H A D | adsp_stream.c | 103 if ((sp->remoteAddress.a.node == p->src_node) 392 addr->node = ifID_home->ifThisNode.s_node; 399 addr->node = 0; 422 cfgp->inet.node = ifID_home->ifThisNode.s_node;
|
H A D | atp_read.c | 266 rcbp->rc_socket.node == ddp->src_node && 304 rcbp->rc_socket.node == ddp->src_node && 323 rcbp->rc_socket.node == ddp->src_node && 347 rcbp->rc_socket.node = ddp->src_node;
|
H A D | at_var.h | 88 struct at_addr node; /* Our node number. */ member in struct:__anon340 97 at_inet_t addr; /* net and node are ignored, except in 135 u_char node; member in struct:at_kern_err 186 /* AppleTalk node ID is ifNodeAddress.sat_addr*/ 297 #define KEV_ATALK_ENABLED 1 /* AppleTalk enabled from user space - node/net set and valid */ 299 #define KEV_ATALK_ZONEUPDATED 3 /* Zone for this node set/changed */
|
H A D | atp_write.c | 239 rcbp->rc_socket.node == ddp->dst_node && 262 rcbp->rc_socket.node = ddp->dst_node; 370 cfgp->inet.node = ifID_home->ifThisNode.s_node; 375 cfgp->inet.node = atp->atp_gref->laddr.s_node; 419 ddp->dst_node = trp->tr_socket.node; 1180 trp->tr_socket.node = ddp->dst_node; 1253 (rcbp->rc_socket.node == ddp->dst_node) && 1275 rcbp->rc_socket.node = ddp->dst_node; 1514 trp->tr_socket.node = ddp->dst_node; 1902 (rcbp->rc_socket.node [all...] |
H A D | at.c | 227 cfgp->node = ifID->ifThisNode; 400 nve.address.node = ifID->ifThisNode.s_node; 412 nbpP->addr.node = ifID->ifThisNode.s_node;
|
H A D | aurp_zi.c | 81 dPrintf(D_M_AURP, D_L_WARNING, ("AURPsndZReq: node=%d, out of mblk\n", 116 dPrintf(D_M_AURP, D_L_INFO, ("AURPsndZReq: node=%d\n", 129 dPrintf(D_M_AURP, D_L_INFO, ("AURPsndZReq: node=%d\n", 158 dPrintf(D_M_AURP, D_L_WARNING, ("AURPsndZRsp: node=%d, out of mblk\n", 199 dPrintf(D_M_AURP, D_L_WARNING, ("AURPsndGZN: node=%d, out of mblk\n", 238 dPrintf(D_M_AURP, D_L_WARNING, ("AURPsndGDZL: node=%d, out of mblk\n", 565 AURPsetzi(node, m, sub_code, tuples_cnt) 566 unsigned char node;
|
H A D | ddp.c | 169 addr.inet.node = at_pcb->laddr.s_node; 374 * taken offline, we no longer have a node ID to use as a source address 505 * directly to destination node, or sent to a random router or sent 584 /* If this packet is for the same node, loop it back 924 * up to some socket on the same node. 1005 /* Router mode special: we send "up-stack" packets for this node or coming from any 1029 /* any node, wildcard or matching net */ 1034 /* this node is not online yet(?) */ 1329 int ddp_AURPfuncx(code, param, node) 1332 unsigned char node; [all...] |
H A D | ddp_r_rtmp.c | 268 /* Make sure this an AppleTalk node sending us the RTMP packet */ 293 ke.node = SenderNodeID; 316 ke.node = SenderNodeID; 354 ke.node = SenderNodeID; 382 ke.node = SenderNodeID; 425 ke.node = SenderNodeID; 821 * Router's node ID (1byte) 990 register u_char DestNode; /* node where to send to table */ 1139 ( "rtmp_request: find bridge for net %d port %d node %d.%d\n", 1270 /* if non seed, need to acquire the right node addres [all...] |
H A D | adsp.c | 366 ddp->ddpx_dnode = dstnetaddr->a.node;
|
H A D | atp.h | 295 * Locally saved remote node address 300 at_node node; member in struct:atp_socket
|
H A D | ddp_lap.c | 277 if (ATALK_VALUE(cfgp->node)) { 281 initial_node = cfgp->node.s_node; 282 initial_net = cfgp->node.s_net; 288 elapp->initial_addr = cfgp->node; 925 /* We now call aarp_init() to assign an appletalk node addr */ 1324 appletalk node addr */
|
/darwin-on-arm/xnu/osfmk/mach/ |
H A D | flipc_cb.h | 253 * node number and endpoint number, where the endpoint number will be 309 * accesses, playing merry hell with the inter-node synchronization 310 * protocols (the compiler doesn't know about the other node, after 1065 unsigned long local_node_address; /* Local node number. */ 1215 #define FLIPC_CREATE_ADDRESS(node, endpoint_idx) \ 1216 ((node << 16) | (endpoint_idx))
|
H A D | host_priv.defs | 206 * Get a given special port for a given node. 213 node : int; 218 * Set a given special port for the local node.
|
/darwin-on-arm/xnu/osfmk/vm/ |
H A D | vm_map_store_rb.c | 42 int rb_node_compare(struct vm_map_store *node, struct vm_map_store *parent) argument 47 vme_c = VME_FOR_STORE(node);
|
/darwin-on-arm/xnu/libkern/zlib/ |
H A D | trees.c | 454 /* Index within the heap array of least frequent node in the Huffman tree */ 477 * Restore the heap property by moving down the tree starting at node k, 478 * exchanging a node with the smallest of its two sons if necessary, stopping 485 int k; /* node to move down */ 548 if (n > max_code) continue; /* not a leaf node */ 655 int node; /* new node being created */ local 678 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 679 tree[node].Freq = 1; 680 s->depth[node] [all...] |
/darwin-on-arm/xnu/osfmk/kern/ |
H A D | processor.c | 223 pset_node_t node) 228 pset_init(pset, node); 232 prev = &node->psets; 250 pset_node_t node) 268 pset->node = node; 222 pset_create( pset_node_t node) argument 248 pset_init( processor_set_t pset, pset_node_t node) argument
|
/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/ |
H A D | RedBlackTree.h | 74 * thus making node linkage as compact as is possible for red-black trees. 308 * Find a match if it exists. Otherwise, find the next greater node, if one 329 * Find a match if it exists. Otherwise, find the previous lesser node, if one 458 /* rbp_i_c is the top of a logical 4-node, so split it. */\ 460 /* disruptiveness of node splitting. */\ 504 /* rbp_i_p now refers to the node under which to insert. */\ 534 /* node is not a 2-node. This allows simple deletion once a leaf */\ 536 /* be no way to convert it from a 2-node to a 3-node [all...] |
/darwin-on-arm/xnu/bsd/miscfs/devfs/ |
H A D | devfs_vnops.c | 189 * Convert a component of a pathname into a pointer to a locked node. 218 * node and return info to allow rewrite 223 * NOTE: (LOOKUP | LOCKPARENT) currently returns the parent node unlocked. 240 devnode_t * node = NULL; /* the node we are searching for */ local 256 * Make sure that our node is a directory as well. 277 node = nodename->de_dnp; 280 * to make sure that our device node has a non-NULL dn_vn 281 * associated with it. The device node might otherwise 284 error = devfs_dntovn(node, result_vnod [all...] |
/darwin-on-arm/xnu/iokit/IOKit/ |
H A D | IOStatisticsPrivate.h | 236 static void releaseKextNode(KextNode *node);
|
/darwin-on-arm/xnu/libkern/libkern/ |
H A D | tree.h | 65 * node to the root of the tree and partly rebalances it. 75 * A red-black tree is a binary search tree with the node color as an 79 * - each red node (except for the root) has a black parent, 80 * - each leaf node is black. 134 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ 137 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \ 138 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \ 149 /* Finds the node with the same key as elm */ \ 183 * Moves node close to the key of elm to top 434 * Moves node clos [all...] |
/darwin-on-arm/xnu/iokit/Kernel/ |
H A D | IOStatistics.cpp | 286 /* Finally, free the class node */ 404 /* Finally, free the class node */ 1254 void IOStatistics::releaseKextNode(KextNode *node) { argument 1255 #pragma unused(node)
|