84 	 * If chunk->data has no lower chunks, it will be the same  in upper_empty()
91 			     unsigned int *upper2, unsigned int *lower)  in pid_split()  argument
102 	*lower = pid & LOWER_MASK;  in pid_split()
108 				    unsigned int upper2, unsigned int lower)  in pid_join()  argument
112 		(lower & LOWER_MASK);  in pid_join()
133 	unsigned int lower;  in trace_pid_list_is_set()  local
139 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_is_set()
149 				ret = test_bit(lower, lower_chunk->data);  in trace_pid_list_is_set()
174 	unsigned int lower;  in trace_pid_list_set()  local
180 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_set()
203 	set_bit(lower, lower_chunk->data);  in trace_pid_list_set()
229 	unsigned int lower;  in trace_pid_list_clear()  local
234 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_clear()
247 	clear_bit(lower, lower_chunk->data);  in trace_pid_list_clear()
284 	unsigned int lower;  in trace_pid_list_next()  local
289 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_next()
299 		for (; upper2 <= UPPER_MASK; upper2++, lower = 0) {  in trace_pid_list_next()
304 			lower = find_next_bit(lower_chunk->data, LOWER_MAX,  in trace_pid_list_next()
305 					    lower);  in trace_pid_list_next()
306 			if (lower < LOWER_MAX)  in trace_pid_list_next()
316 	*next = pid_join(upper1, upper2, lower);  in trace_pid_list_next()
340 	union lower_chunk *lower = NULL;  in pid_list_refill_irq()  local
342 	union lower_chunk **lower_next = &lower;  in pid_list_refill_irq()
388 	if (lower) {  in pid_list_refill_irq()
390 		pid_list->lower_list = lower;  in pid_list_refill_irq()
469 	union lower_chunk *lower;  in trace_pid_list_free()  local
497 				lower = upper->data[j];  in trace_pid_list_free()
498 				kfree(lower);  in trace_pid_list_free()