Searched refs:num_nodes (Results 1 – 4 of 4) sorted by relevance
67 int num_nodes; member266 d->num_nodes++; in tipc_disc_add_dest()277 d->num_nodes--; in tipc_disc_remove_dest()278 num = d->num_nodes; in tipc_disc_remove_dest()305 if (tipc_node(d->domain) && d->num_nodes) { in tipc_disc_timeout()323 if (d->num_nodes && d->timer_intv > TIPC_DISC_SLOW) in tipc_disc_timeout()325 else if (!d->num_nodes && d->timer_intv > TIPC_DISC_FAST) in tipc_disc_timeout()375 d->num_nodes = 0; in tipc_disc_create()412 d->num_nodes = 0; in tipc_disc_reset()
107 u32 num_nodes; member
108 ceph_decode_8_safe(p, end, b->num_nodes, bad); in crush_decode_tree_bucket()109 b->node_weights = kcalloc(b->num_nodes, sizeof(u32), GFP_NOFS); in crush_decode_tree_bucket()112 ceph_decode_need(p, end, b->num_nodes * sizeof(u32), bad); in crush_decode_tree_bucket()113 for (j = 0; j < b->num_nodes; j++) in crush_decode_tree_bucket()
204 n = bucket->num_nodes >> 1; in bucket_tree_choose()
Completed in 11 milliseconds