/darwin-on-arm/xnu/bsd/hfs/hfscommon/Misc/ |
H A D | HybridAllocator.c | 54 * Get the first node in the tree. If it is empty, return NULL 57 * Get the last node in the tree. If it is empty, return NULL 61 * static extent_node_t* extent_tree_offset_next (extent_tree_offset_t * tree, extent_node_t * node) 64 * static extent_node_t* extent_tree_offset_prev(extent_tree_offset_t * tree, extent_node_t * node) 70 * either grab the next node, if possible, or return NULL 74 * either grab the previous node, if possible, or return NULL 77 * Insert the specified node into the tree. 78 * static void extent_tree_offset_insert(extent_tree_offset_t * tree, extent_node_t * node) 80 * Remove the specified node from the tree. 81 * static void extent_tree_offset_remove(extent_tree_offset_t * tree, extent_node_t * node) 117 extent_node_t *node; local 135 free_node(extent_node_t *node) argument 156 extent_node_t *node = NULL; local 174 extent_node_t *node = NULL; local 263 extent_tree_off_next(extent_tree_offset_t * tree, extent_node_t *node) argument 272 extent_tree_off_prev(extent_tree_offset_t * tree, extent_node_t *node) argument 290 extent_tree_internal_alloc_space(extent_tree_offset_t *offset_tree, u_int32_t size, u_int32_t offset, extent_node_t *node) argument 354 extent_node_t *node = extent_tree_offset_search(offset_tree, &search_sentinel); local 380 extent_node_t *node= NULL; local 457 extent_node_t *node = NULL; local 504 extent_tree_remove_node(extent_tree_offset_t *offset_tree, extent_node_t * node) argument 523 extent_node_t *node = NULL; local [all...] |
H A D | VolumeAllocation.c | 1586 extent_node_t *node = NULL; local 1602 node = extent_tree_off_search_next(&hfsmp->offset_tree, &search_sentinel); 1604 if (node) { 1605 *actualStartBlock = node->offset; 1606 *actualNumBlocks = node->length; 1621 printf("bad node: %p, offset %d, length %d\n", node, node->offset,node->length); 1663 /* just start with the first offset node */ 2468 extent_node_t *node = NULL; local 3491 extent_node_t *node = NULL; local 4219 extent_node_t *node = NULL; local [all...] |
/darwin-on-arm/xnu/osfmk/mach/ |
H A D | norma_special_ports.h | 69 #define norma_get_host_port(host, node, port) \ 70 (host_get_special_port((host), (node), \ 73 #define norma_get_host_priv_port(host, node, port) \ 74 (host_get_special_port((host), (node), \ 77 #define norma_get_io_master_port(host, node, port) \ 78 (host_get_special_port((host), (node), \ 85 #define norma_get_audit_control_port(host, node, port) \ 86 (host_get_special_port((host), (node), \ 89 #define norma_get_user_notification_port(host, node, port) \ 90 (host_get_special_port((host), (node), \ [all...] |
H A D | mach_norma.defs | 159 * Specify a node upon which children tasks will be created. 173 out node : int); 180 * Create a task on the given node, possibly inheriting memory. 204 * Create a task on the given node, possibly inheriting memory. 216 * Get a given special port for a given node. 223 node : int; 228 * Set a given special port for a given node. 252 * Guaranteed to be a node where the port once was. 254 * Can be used to determine residence node for hosts, tasks, threads, etc. 259 out node [all...] |
/darwin-on-arm/xnu/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeNodeOps.c | 31 Contains: Single-node operations for the BTree Module. 62 macro. Only call CheckNode if the node came from disk. 67 <HFS3> 2/19/97 djb Changes to support big node cache. 76 that CheckNode failed if the node is all zeroes. This can happen 77 if the hint case if the fetched node has been deallocated 85 <16> 1/31/95 prp GetBlockProc interface uses a 64 bit node number. 95 <8> 5/21/93 gs Maintain statistical counters on Get/Release node routines. 115 // GetNode - Call FS Agent to get node 116 // GetNewNode - Call FS Agent to get a new node 117 // ReleaseNode - Call FS Agent to release node obtaine 263 NodeDescPtr node; local 435 PrintNode(const NodeDescPtr node, u_int16_t nodeSize, u_int32_t nodeNumber) argument 490 InsertRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, RecordPtr recPtr, u_int16_t recSize ) argument 560 InsertKeyRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr keyPtr, u_int16_t keyLength, RecordPtr recPtr, u_int16_t recSize ) argument 665 DeleteRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 718 SearchNode( BTreeControlBlockPtr btreePtr, NodeDescPtr node, KeyPtr searchKey, u_int16_t *returnIndex ) argument 776 GetRecordByIndex(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr *keyPtr, u_int8_t * *dataPtr, u_int16_t *dataSize ) argument 933 GetRecordSize(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 958 GetOffsetAddress(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 1015 InsertOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, u_int16_t delta ) argument 1049 DeleteOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument [all...] |
H A D | BTree.c | 61 that we get a full node when we call GetNode. 67 and we have to move to another node, see if we need to release 68 the node about to be "shifted out" (opposite sibling of the 80 <HFS7> 2/19/97 djb Enable variable sized index keys for HFS+ volumes. Added node 110 the next record. In such a case, if the node's forrward link is 117 <23> 1/31/95 prp GetBlockProc interface uses a 64 bit node number. 119 <21> 11/16/94 prp Add IsItAHint routine and use it whenever hint's node number was 133 <12> 8/16/93 prp In BTSearchRecord, if the input hint found the node and record, 139 <9> 5/24/93 gs Fix bug in BTInsert/Set/ReplaceRecord which didn't set node hint 257 Panic("BTOpen: getNodeProc returned error getting header node 467 BlockDescriptor node; local 664 BlockDescriptor left, node, right; local 980 BlockDescriptor left, node, right; local 1860 BlockDescriptor node; local 2028 BlockDescriptor node; local 2065 BlockDescriptor node; local [all...] |
H A D | BTreeAllocate.c | 99 Function: Searches the map records for the first free node, marks it "in use" and 100 returns the node number found. This routine should really only be called 112 Output: nodeNum - number of node allocated 123 BlockDescriptor node; local 132 nodeNumber = 0; // first node number of header map record 133 node.buffer = nil; // clear node.buffer to get header node 135 node.blockHeader = nil; 139 err = GetMapNode (btreePtr, &node, 241 BlockDescriptor node; local [all...] |
H A D | BTreeMiscOps.c | 78 see if the hint node is allocated. 88 <17> 11/16/94 prp Add IsItAHint routine and use it whenever hint's node number was 167 switch (header->nodeSize) // node size == 512*2^n 228 Routine: UpdateHeader - Write BTreeInfoRec fields to Header node. 231 header node if necessary. 243 BlockDescriptor node; local 251 err = GetNode (btreePtr, kHeaderNodeNum, 0, &node ); 257 ModifyBlockStart(btreePtr->fileRefNum, &node); 259 header = (BTHeaderRec*) ((char *)node.buffer + sizeof(BTNodeDescriptor)); 279 err = UpdateNode (btreePtr, &node, [all...] |
/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/ |
H A D | HybridAllocator.h | 52 free_node(extent_node_t *node); 68 extent_tree_remove_node (extent_tree_offset_t *offset_tree, extent_node_t * node); 74 extent_tree_off_search(extent_tree_offset_t *offset_tree, extent_node_t *node); 77 extent_tree_off_search_next(extent_tree_offset_t *offset_tree, extent_node_t *node); 80 extent_tree_off_search_nextWithSize (extent_tree_offset_t *offset_tree, extent_node_t *node); 83 extent_tree_off_search_prev(extent_tree_offset_t *offset_tree, extent_node_t *node); 86 extent_tree_off_next(extent_tree_offset_t *offset_tree, extent_node_t *node); 89 extent_tree_off_prev(extent_tree_offset_t *offset_tree, extent_node_t *node);
|
H A D | BTreesPrivate.h | 226 u_int32_t numMapNodesRead; // map nodes beyond header node 257 u_int32_t node; // node number member in struct:__anon108 376 #define kGetNodeHint 0x1 /* If set, the node is being looked up using a hint */ 379 NodeDescPtr node, 382 #define GetLeftSiblingNode(btree,node,left) GetNode ((btree), ((NodeDescPtr)(node))->bLink, 0, (left)) 385 NodeDescPtr node, 388 #define GetRightSiblingNode(btree,node,right) GetNode ((btree), ((NodeDescPtr)(node)) [all...] |
/darwin-on-arm/xnu/bsd/kern/ |
H A D | kern_memorystatus.c | 75 static void memorystatus_add_node(memorystatus_node *node); 76 static void memorystatus_remove_node(memorystatus_node *node); 78 static void memorystatus_release_node(memorystatus_node *node); 149 static void memorystatus_move_node_to_exit_list(memorystatus_node *node); 484 memorystatus_node *node; local 489 TAILQ_FOREACH(node, &memorystatus_list, link) { 490 if (node->priority <= new_node->priority) { 495 if (node) { 496 TAILQ_INSERT_BEFORE(node, new_node, link); 507 memorystatus_remove_node(memorystatus_node *node) argument 533 memorystatus_node *node; local 551 memorystatus_release_node(memorystatus_node *node) argument 603 memorystatus_node *node, *search; local 692 memorystatus_node *node = NULL; local 740 memorystatus_node *node; local 766 memorystatus_node *node; local 797 memorystatus_node *node = memorystatus_get_node((pid_t)pid); local 822 memorystatus_node *node = memorystatus_get_node((pid_t)pid); local 861 memorystatus_node *node; local 977 memorystatus_move_node_to_exit_list(memorystatus_node *node) argument 1016 memorystatus_node *node; local 1102 memorystatus_node *node; local 1218 memorystatus_node *node; local 1402 memorystatus_node *node; local 1676 memorystatus_node *node; local 1712 memorystatus_node *node; local 1758 memorystatus_node *node; local [all...] |
/darwin-on-arm/xnu/bsd/netat/ |
H A D | aurp_misc.c | 95 unsigned char node; local 112 for (node=1; node <= dst_addr_cnt; node++, state++) { 140 unsigned char node; local 154 for (node=1; node <= dst_addr_cnt; node++, state++) { 156 state->rem_node = node; 160 ("AURPinit: sending OpenReq to node 187 unsigned char node; local [all...] |
H A D | aurp_tx.c | 67 void AURPsend(mdata, type, node) 69 int type, node; 95 domain->dst_address = aurp_global.dst_addr[node]; 109 unsigned char node; local 122 node = (unsigned char)param; 126 AURPsend(mdata, AUD_Atalk, node); 131 /* Indicate non-AURP packet, node id of peer */ 132 AURPsend(mdata, AUD_Atalk, node); 135 AURPsend(mdata, AUD_Atalk, node);
|
H A D | aurp_rx.c | 158 at_insert(m, type, node) 160 register unsigned int type, node; 167 ddp_AURPfuncx(AURPCODE_DATAPKT, m, node); 170 state = (aurp_state_t *)&aurp_state[node];
|
H A D | aurp.h | 147 unsigned char rem_node; /* node id of a tunnel peer */ 227 int at_insert(gbuf_t *m, unsigned int type, unsigned int node); 228 int ddp_AURPfuncx(int code, void *param, unsigned char node); 256 void AURPsend(gbuf_t *mdata, int type, int node); 258 void AURPpurgeri(unsigned char node); 260 int AURPsetri(unsigned char node, gbuf_t *m); 261 int AURPupdateri(unsigned char node, gbuf_t *m);
|
H A D | ddp_rtmp.c | 129 void trackrouter(ifID, net, node) 132 register unsigned char node; 140 router = &trackedrouters[(i + node) & (NROUTERS2TRAK-1)]; 141 if ((NODE(router) == node) && (NET(router) == net)) { 162 NODE(unused) = node; 168 NODE(ifID) = node;
|
H A D | aurp_aurpd.c | 350 * Use the source address to find the 'node number' (index of the address), 356 unsigned char node; local 359 /* determine the node where the packet came from */ 360 for (node=1; node <= dst_addr_cnt; node++) { 361 if (aurp_global.dst_addr[node] == *(long *)&rem_addr->sin_addr) 364 if (node > dst_addr_cnt) { 366 ("AURPrecv: invalid node, %d.%lx\n", 398 at_insert(p_mbuf, domain->type, node); [all...] |
H A D | asp_proto.c | 74 || (scb->rem_addr.node != addr.node)) ) 241 scb->rem_addr.node = 0; 407 if ((scb->state == ASPSTATE_Close) || (scb->rem_addr.node == 0)) 505 scb->tickle_interval = (unsigned short)addr->node; 582 scb->rem_node = scb->rem_addr.node; 583 scb->rem_addr.node = 0; 660 cfgp->inet.node = ifID_home->ifThisNode.s_node; 733 ddp->src_node = scb->loc_addr.node; 735 ddp->dst_node = dest->node; [all...] |
H A D | aurp_ri.c | 93 dPrintf(D_M_AURP, D_L_INFO, ("AURPsndRIAck: node=%d\n", 138 dPrintf(D_M_AURP, D_L_INFO, ("AURPsndRIReq: node=%d\n", 534 int AURPsetri(node, m) 535 unsigned char node; 543 new_rt.NextIRNode = node; 643 int AURPupdateri(node, m) 644 unsigned char node; 674 new_rt.NextIRNode = node; 746 void AURPpurgeri(node) 747 unsigned char node; 768 unsigned char i, node, ev_len, ev_tuple[6]; local [all...] |
H A D | appletalk.h | 63 typedef u_char at_node; /* AppleTalk node number */ 97 #define ATALK_ASSIGN(a, net, node, unused ) \ 98 a.atalk_unused = unused; a.atalk_node = node; NET_ASSIGN(a.atalk_net, net) 112 u_char node; /* Node number */ member in struct:at_inet 131 u_char s_node; /* 8-bit node # (1-0xfd) */ 141 struct at_addr sat_addr; /* 16-bit "net" and 8-bit "node */ 151 /* make sure the net, node and socket numbers are in legal range : 157 * 1 - 0x7f Legal (user node id's) 158 * 0x80 - 0xfe Legal (server node id's; 0xfe illegal in 166 ((!(addr) || (addr)->net == 0xffff || (addr)->node [all...] |
H A D | adsp_Packet.c | 433 if (sp->remoteAddress.a.node != addr.a.node) 445 (addr.a.node == ifID_home->ifThisNode.s_node) && 446 /* *** was (addr.a.node == ddpcfg.node_addr.node) && *** */ 489 (opb->u.openParams.filterAddress.node != 0 && 490 opb->u.openParams.filterAddress.node != addr.a.node)|| 618 ((n->u.openParams.filterAddress.node == 0) || 619 (n->u.openParams.filterAddress.node [all...] |
H A D | ddp_nbp.c | 402 nbp->tuple[0].enu_addr.node = ifID->ifThisNode.s_node; 497 int net,node,skt; local 499 node = tuple->enu_addr.node; 502 ("nbp_validate: tuple addr:%d:%d:%d\n",net,node,skt)); 834 tuple->enu_addr.node = nve_entry->address.node; 955 ddp->dst_node = nbp_req->nve.address.node; 1416 new_entry->address.net, new_entry->address.node)); 1456 if (nbpP->addr.net || nbpP->addr.node) { [all...] |
/darwin-on-arm/xnu/tools/tests/libMicro/apple/ |
H A D | od_query_create_with_node.c | 87 ODNodeRef node; member in struct:__anon1372 99 static bool optNodeLocal = 1; // which node to search. Local node is default 134 " [-n nodename] node name to use for test\n" 164 case 'n': // node 245 // 1. make local or network node for OD query 256 // create OD node for local or OD query 258 ts->node = ODNodeCreateWithNodeType(NULL, kODSessionDefault, kODNodeTypeLocalNodes, &error); 262 ts->node = ODNodeCreateWithName(NULL, kODSessionDefault, nodenameStr, &error); 266 if (!ts->node) { 283 ODNodeRef node; local [all...] |
/darwin-on-arm/xnu/libkern/uuid/ |
H A D | uuid.c | 48 read_node(uint8_t *node) argument 51 if (uuid_get_ethernet(node) == 0) 55 read_random(node, 6); 56 node[0] |= 0x01;
|
/darwin-on-arm/xnu/osfmk/kern/ |
H A D | processor.h | 107 pset_node_t node; member in struct:processor_set 263 pset_node_t node); 267 pset_node_t node) __attribute__((section("__TEXT, initcode")));
|