Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 61) sorted by relevance

123

/xnu-11215/osfmk/kern/
H A Dmach_node.c156 if (!MACH_NODE_VALID(node) || (!node->active) || (node->published)) { in mach_node_publish()
176 if (node == localnode) { in mach_node_publish()
190 node->published = 1; in mach_node_publish()
262 return node; in mach_node_alloc_init()
288 node->info.byteorder, node->info.datamodel); in mach_node_register()
349 node->proto_vers = node->info.proto_vers_max; in mach_node_register()
361 mach_node_publish(node); in mach_node_register()
415 (MACH_NODE_VALID(node) && node->dead && alloc_if_dead)) { in mach_node_for_id_locked()
424 MACH_NODE_LOCK(node); in mach_node_for_id_locked()
427 return node; in mach_node_for_id_locked()
[all …]
H A Dprocessor.h262 pset_node_t node; member
598 pset_node_t node,
605 pset_node_t node);
629 pset_map_t map = pset->node->pset_map; in next_pset()
749 pset_node_t node = pset->node; in pset_update_processor_state() local
751 if (bit_count(node->pset_map) == 1) { in pset_update_processor_state()
761 if (!bit_test(atomic_load(&node->pset_idle_primary_map), pset->pset_id)) { in pset_update_processor_state()
765 if (!bit_test(atomic_load(&node->pset_non_rt_map), pset->pset_id)) { in pset_update_processor_state()
768 if (!bit_test(atomic_load(&node->pset_idle_map), pset->pset_id)) { in pset_update_processor_state()
769 atomic_bit_set(&node->pset_idle_map, pset->pset_id, memory_order_relaxed); in pset_update_processor_state()
[all …]
H A Dmach_node_link.h171 kern_return_t mnl_register(mnl_node_info_t node,
191 kern_return_t mnl_set_link_state(mnl_node_info_t node,
218 kern_return_t mnl_terminate(mnl_node_info_t node,
231 void mnl_msg_from_node(mnl_node_info_t node,
246 mnl_msg_t mnl_msg_to_node(mnl_node_info_t node,
258 void mnl_msg_complete(mnl_node_info_t node,
H A Dmachine.c746 node->ioaddr_base = ioaddr_base; in io_increase_timeouts()
747 node->size = size; in io_increase_timeouts()
773 if (next && (node->ioaddr_base + node->size) > next->ioaddr_base) { in io_increase_timeouts()
798 if (node) { in io_reset_timeouts()
799 if (node->size == size) { in io_reset_timeouts()
802 node = NULL; in io_reset_timeouts()
808 if (!node) { in io_reset_timeouts()
828 while (node) { in io_override_timeout()
829 if (node->ioaddr_base <= addr && addr < node->ioaddr_base + node->size) { in io_override_timeout()
835 node = RB_LEFT(node, tree); in io_override_timeout()
[all …]
H A Dmach_node.h134 #define MACH_NODE_VALID(node) ((node) != MACH_NODE_NULL) argument
136 #define MACH_NODE_FREE(node) kfree(node, MACH_NODE_SIZE) argument
H A Dsched_prim.c526 for (pset_node_t node = &pset_node0; node != NULL; node = node->node_list)
2437 pset_node_t node = pset->node; in pset_has_stealable_rt_threads() local
2504 pset_node_t node = pset->node; in pset_commit_processor_to_new_thread() local
4673 } while (((node = node->node_list) != NULL) && ((pset = node->psets) != NULL)); in sched_rtlocal_runq_scan()
4690 } while (((node = node->node_list) != NULL) && ((pset = node->psets) != NULL)); in sched_rtlocal_runq_count_sum()
5397 pset_node_t node = pset->node; in choose_processor() local
8952 foreach_node(node) { in sched_update_recommended_cores_locked()
9001 foreach_node(node) { in sched_update_recommended_cores_locked()
9146 foreach_node(node) { in sched_update_powered_cores_drops_lock()
9199 foreach_node(node) { in sched_update_powered_cores_drops_lock()
[all …]
H A Dsched_amp_common.c493 pset_node_t node = (recommended_pset_type(thread) == PSET_AMP_P) ? pcore_node : ecore_node; in sched_amp_choose_node() local
494 return ((node != NULL) && (node->pset_map != 0)) ? node : &pset_node0; in sched_amp_choose_node()
H A Dprocessor.c349 atomic_bit_set(&pset->node->pset_recommended_map, pset->pset_id, memory_order_relaxed); in processor_init()
572 pset_node_t node, in pset_create() argument
588 pset_init(pset, node); in pset_create()
592 prev = &node->psets; in pset_create()
615 pset_node_t node = &pset_node0; in pset_find() local
619 pset = node->psets; in pset_find()
626 } while (pset == NULL && (node = node->node_list) != NULL); in pset_find()
640 pset_node_t node) in pset_init() argument
708 bit_set(node->pset_map, pset->pset_id); in pset_init()
709 pset->node = node; in pset_init()
H A Dtest_lock.c382 struct smr_node node; member
387 smr_sleepable_stress_cb(smr_node_t node) in smr_sleepable_stress_cb() argument
391 cctx = __container_of(node, struct smr_call_ctx, node); in smr_sleepable_stress_cb()
405 smr_call(ctx->smr, &cctx->node, sizeof(*cctx), smr_sleepable_stress_cb); in smr_sleepable_stress_make_call()
H A Dsched_amp.c580 pset_node_t node = &pset_node0; in sched_amp_thread_update_scan() local
581 pset = node->psets; in sched_amp_thread_update_scan()
605 } while (((node = node->node_list) != NULL) && ((pset = node->psets) != NULL)); in sched_amp_thread_update_scan()
/xnu-11215/bsd/skywalk/lib/
H A Dcuckoo_hashtable.c86 prev_node = node; in cuckoo_node_chain()
87 node = node->next; in cuckoo_node_chain()
102 while (node != NULL && node != del_node) { in cuckoo_node_del()
104 node = node->next; in cuckoo_node_del()
108 node->next = NULL; in cuckoo_node_del()
125 return node->next; in cuckoo_node_next()
496 node = cuckoo_node_next(node); in __find_in_bucket()
503 return node; in __find_in_bucket()
528 return node; in cuckoo_hashtable_find_with_hash()
1039 node = node->next; in cuckoo_node_looped()
[all …]
H A Dcuckoo_hashtable_test.c231 ASSERT(node != NULL); in cht_basic_tests()
235 ASSERT(node != NULL); in cht_basic_tests()
241 ASSERT(node == NULL); in cht_basic_tests()
244 ASSERT(node != NULL); in cht_basic_tests()
249 ASSERT(node == NULL); in cht_basic_tests()
267 ASSERT(node != NULL); in cht_basic_tests()
368 ASSERT(node != NULL); in cht_concurrent_add()
387 ASSERT(node != NULL); in cht_concurrent_add_check()
466 ASSERT(node == NULL); in cht_concurrent_del()
481 ASSERT(node == NULL); in cht_concurrent_del_check()
[all …]
H A Dcuckoo_hashtable.h65 typedef int (*cuckoo_obj_cmp_func)(struct cuckoo_node *node, void *key);
89 int cuckoo_hashtable_add_with_hash(struct cuckoo_hashtable *h, struct cuckoo_node *node,
91 int cuckoo_hashtable_del(struct cuckoo_hashtable *h, struct cuckoo_node *node,
101 void (^handler)(struct cuckoo_node *node, uint32_t hv));
/xnu-11215/tests/
H A Dpriority_queue.cpp88 test_node_t node = NULL; variable
94 node = new test_node;
131 delete node;
150 test_node_t node = NULL; variable
164 node = new test_node;
173 node->node_key = increase_pri;
181 node->node_key = decrease_pri;
226 test_node_t node = NULL; variable
232 node = new test_node;
235 priority_queue_entry_init(node);
[all …]
H A Dinet_transfer.c154 inet_endpoint_is_valid(inet_endpoint_t node) in inet_endpoint_is_valid() argument
156 switch (node->af) { in inet_endpoint_is_valid()
161 set_error_string("invalid address family %d", node->af); in inet_endpoint_is_valid()
164 switch (node->proto) { in inet_endpoint_is_valid()
169 set_error_string("invalid protocol %d", node->proto); in inet_endpoint_is_valid()
/xnu-11215/osfmk/ipc/
H A Dflipc.c108 assert(MACH_NODE_VALID(node)); in flipc_port_create()
118 fport->hostnode = node; in flipc_port_create()
119 if (node == localnode) { in flipc_port_create()
293 mach_node_t node, in flipc_cmd_ipc() argument
370 node, in flipc_node_prepare()
388 if (!MACH_NODE_VALID(node)) { in flipc_node_retire()
509 MACH_NODE_UNLOCK(node); in flipc_msg_from_node()
586 MACH_NODE_LOCK(node); in flipc_msg_ack()
587 if (node->active) { in flipc_msg_ack()
588 nid = node->info.node_id; in flipc_msg_ack()
[all …]
H A Dflipc.h86 kern_return_t flipc_node_prepare(mach_node_t node);
93 kern_return_t flipc_node_retire(mach_node_t node);
152 void flipc_msg_ack(mach_node_t node,
/xnu-11215/bsd/tests/
H A Dtree_tests_sysctl.c99 rbt_test_node_t node = &test_nodes[idx]; in rb_tree_insert_nodes() local
100 …T_EXPECT_EQ_INT(node->rbt_flags & RBT_MASK_IN_USE, 0, "Trying to insert a tree node that is alread… in rb_tree_insert_nodes()
101 node->rbt_id = test_node_ids[idx]; in rb_tree_insert_nodes()
102 RB_INSERT(_rb_test_tree, tree, node); in rb_tree_insert_nodes()
103 node->rbt_flags |= RBT_FLAG_IN_USE; in rb_tree_insert_nodes()
117 rbt_test_node_t node = &test_nodes[idx]; in rb_tree_remove_nodes() local
118 …T_EXPECT_EQ_INT(node->rbt_flags & RBT_MASK_IN_USE, 1, "Trying to remove a tree node that is not in… in rb_tree_remove_nodes()
119 T_EXPECT_EQ_INT(node->rbt_id, test_node_ids[idx], "The node id does not match the node index"); in rb_tree_remove_nodes()
120 RB_REMOVE(_rb_test_tree, tree, node); in rb_tree_remove_nodes()
121 node->rbt_flags &= ~RBT_FLAG_IN_USE; in rb_tree_remove_nodes()
/xnu-11215/tests/vm/
H A Dzalloc_buddy.c81 size_t node = zba_node(pos, o); variable
83 zbc = zba_chain_for_node(NULL, node, o);
86 pos, node);
93 T_QUIET; T_ASSERT_LT(node, 8 * sizeof(bits), "fits in bitfield: %zd", pos);
94 T_QUIET; T_ASSERT_EQ(0, bits[node / 8] & (1 << (node % 8)), "never seen");
95 bits[node / 8] ^= 1 << (node % 8);
/xnu-11215/bsd/miscfs/devfs/
H A DREADME18 BLUEPRINT of the DEVFS tree. Each back node has associated with it
21 with that node. The back node itself can be considered to be
49 by their associated backing node, so that multiple front nodes that
65 for the node with the correct major/minor/type, I don't see that
67 (I hope) devices that go direct from the backing node to the driver
83 the user from removing a front node from the directory front node.
86 of that directory and do not refer to their original backing node
94 node, and deletes them, no matter where they've been moved to.
97 If a directory has been moved, and a new backing node is inserted
98 into its own back node, the new front node will appear in that front
[all …]
/xnu-11215/libkern/uuid/
H A Duuid.c46 read_node(uint8_t *node) in read_node() argument
49 if (uuid_get_ethernet(node) == 0) { in read_node()
54 read_random(node, 6); in read_node()
55 node[0] |= 0x01; in read_node()
/xnu-11215/bsd/skywalk/nexus/flowswitch/flow/
H A Dflow_manager.c85 __fe_cuckoo_cmp(struct cuckoo_node *node, void *key0) in __fe_cuckoo_cmp() argument
128 __fe_cuckoo_retain(struct cuckoo_node *node) in __fe_cuckoo_retain() argument
136 __fe_cuckoo_release(struct cuckoo_node *node) in __fe_cuckoo_release() argument
138 #pragma unused(node) in __fe_cuckoo_release()
140 __container_of(node, struct flow_entry, fe_cnode); in __fe_cuckoo_release()
1142 struct cuckoo_node *node = NULL; in flow_mgr_find_fe_by_key() local
1163 SK_KVA(node)); in flow_mgr_find_fe_by_key()
1164 if (node != NULL) { in flow_mgr_find_fe_by_key()
1190 struct cuckoo_node *node = NULL; in flow_mgr_find_conflicting_fe() local
1196 if (node != NULL) { in flow_mgr_find_conflicting_fe()
[all …]
/xnu-11215/tools/lldbmacros/
H A Dskywalk.py709 def GetCuckooNodeAsFLowEntry(node, hashValue): argument
710 fe = containerof(node, 'struct flow_entry', 'fe_cnode')
762 node = s._node
763 while unsigned(node) != 0:
764 handler(node, s._hash)
765 node = node.next
780 def CuckooHashtablePrintNode(node, hashValue): argument
781 print(" node {} hash 0x{:08x}".format(hex(node), int(hashValue)))
/xnu-11215/libkern/zlib/
H A Dtrees.c666 int node; /* new node being created */ in build_tree() local
690 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
691 tree[node].Freq = 1; in build_tree()
692 s->depth[node] = 0; in build_tree()
693 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
706 node = elems; /* next internal node of the tree */ in build_tree()
715 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
716 s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ? in build_tree()
718 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
722 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); in build_tree()
[all …]
/xnu-11215/bsd/dev/arm64/
H A Dsysctl.c229 DTEntry node; in sysctl_load_brand_string() local
233 if (kSuccess != SecureDTLookupEntry(0, "/product", &node)) { in sysctl_load_brand_string()
237 if (kSuccess != SecureDTGetProperty(node, "product-soc-name", (void const **) &value, &size)) { in sysctl_load_brand_string()

123