83 	 * If chunk->data has no lower chunks, it will be the same  in upper_empty()
94 			     unsigned int *upper2, unsigned int *lower)  in pid_split()  argument
105 	*lower = pid & LOWER_MASK;  in pid_split()
111 				    unsigned int upper2, unsigned int lower)  in pid_join()  argument
115 		(lower & LOWER_MASK);  in pid_join()
136 	unsigned int lower;  in trace_pid_list_is_set()  local
142 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_is_set()
150 			ret = test_bit(lower, lower_chunk->data);  in trace_pid_list_is_set()
175 	unsigned int lower;  in trace_pid_list_set()  local
181 	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()
228 	unsigned int lower;  in trace_pid_list_clear()  local
233 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_clear()
245 	clear_bit(lower, lower_chunk->data);  in trace_pid_list_clear()
281 	unsigned int lower;  in trace_pid_list_next()  local
286 	if (pid_split(pid, &upper1, &upper2, &lower) < 0)  in trace_pid_list_next()
296 		for (; upper2 <= UPPER_MASK; upper2++, lower = 0) {  in trace_pid_list_next()
301 			lower = find_next_bit(lower_chunk->data, LOWER_MAX,  in trace_pid_list_next()
302 					    lower);  in trace_pid_list_next()
303 			if (lower < LOWER_MAX)  in trace_pid_list_next()
313 	*next = pid_join(upper1, upper2, lower);  in trace_pid_list_next()
337 	union lower_chunk *lower = NULL;  in pid_list_refill_irq()  local
339 	union lower_chunk **lower_next = &lower;  in pid_list_refill_irq()
382 	if (lower) {  in pid_list_refill_irq()
384 		pid_list->lower_list = lower;  in pid_list_refill_irq()
461 	union lower_chunk *lower;  in trace_pid_list_free()  local
489 				lower = upper->data[j];  in trace_pid_list_free()
490 				kfree(lower);  in trace_pid_list_free()