Lines Matching refs:highest_node
83 c_ptr->highest_node = 0;
106 for (n_num = 1; n_num <= c_ptr->highest_node; n_num++) {
123 for (; n_num <= c_ptr->highest_node; n_num++) {
147 if (n_num > c_ptr->highest_node)
148 c_ptr->highest_node = n_num;
160 u32 ulim = c_ptr->highest_node;
206 if (!c_ptr->highest_node)
210 while (mask > c_ptr->highest_node) {
214 assert(start_entry <= c_ptr->highest_node);
217 for (n_num = start_entry; n_num <= c_ptr->highest_node; n_num++) {
317 u32 highest = c_ptr->highest_node;
325 highest = c_ptr->highest_node;
351 u32 highest = c_ptr->highest_node;
484 tstop = c_ptr->highest_node;
513 tstop = is_slave(upper) ? c_ptr->highest_slave : c_ptr->highest_node;
549 tstop = c_ptr->highest_node;