Home
last modified time | relevance | path

Searched refs:nid (Results 1 – 3 of 3) sorted by relevance

/net/qrtr/
Daf_qrtr.c128 unsigned int nid; member
358 hdr->dst_node_id = cpu_to_le32(node->nid); in qrtr_node_enqueue()
391 static struct qrtr_node *qrtr_node_lookup(unsigned int nid) in qrtr_node_lookup() argument
398 node = radix_tree_lookup(&qrtr_nodes, nid); in qrtr_node_lookup()
411 static void qrtr_node_assign(struct qrtr_node *node, unsigned int nid) in qrtr_node_assign() argument
415 if (nid == QRTR_EP_NID_AUTO) in qrtr_node_assign()
419 radix_tree_insert(&qrtr_nodes, nid, node); in qrtr_node_assign()
420 if (node->nid == QRTR_EP_NID_AUTO) in qrtr_node_assign()
421 node->nid = nid; in qrtr_node_assign()
580 int qrtr_endpoint_register(struct qrtr_endpoint *ep, unsigned int nid) in qrtr_endpoint_register() argument
[all …]
Dqrtr.h26 int qrtr_endpoint_register(struct qrtr_endpoint *ep, unsigned int nid);
/net/core/
Dpage_pool.c118 pool = kzalloc_node(sizeof(*pool), GFP_KERNEL, params->nid); in page_pool_create()
150 pref_nid = (pool->p.nid == NUMA_NO_NODE) ? numa_mem_id() : pool->p.nid; in page_pool_refill_alloc_cache()
257 page = alloc_pages_node(pool->p.nid, gfp, pool->p.order); in __page_pool_alloc_page_order()
751 pool->p.nid = new_nid; in page_pool_update_nid()