177 	size_t new_size = sizeof(struct bpf_iarray) + n_elem * sizeof(old->items[0]);  in bpf_iarray_realloc()
191 static int copy_insn_array(struct bpf_map *map, u32 start, u32 end, u32 *items)  in copy_insn_array()  argument
206 		items[i - start] = value->xlated_off;  in copy_insn_array()
216 static int sort_insn_array_uniq(u32 *items, int cnt)  in sort_insn_array_uniq()  argument
221 	sort(items, cnt, sizeof(items[0]), cmp_ptr_to_u32, NULL);  in sort_insn_array_uniq()
224 		if (items[i] != items[unique - 1])  in sort_insn_array_uniq()
225 			items[unique++] = items[i];  in sort_insn_array_uniq()
258 	n = bpf_copy_insn_array_uniq(map, 0, map->max_entries - 1, jt->items);  in jt_from_map()
304 		if (jt_cur->items[0] >= subprog_start && jt_cur->items[0] < subprog_end) {  in jt_from_subprog()
311 			memcpy(jt->items + old_cnt, jt_cur->items, jt_cur->cnt << 2);  in jt_from_subprog()
322 	jt->cnt = sort_insn_array_uniq(jt->items, jt->cnt);  in jt_from_subprog()
343 		if (jt->items[i] < subprog_start || jt->items[i] >= subprog_end) {  in create_jt()
374 		w = jt->items[i];  in visit_gotox_insn()
415 	jt->items[0] = t + 1;  in visit_abnormal_return_insn()
416 	jt->items[1] = subprog->exit_idx;  in visit_abnormal_return_insn()
685 				if (!state[succ->items[s]]) {  in bpf_compute_postorder()
686 					stack[stack_sz++] = succ->items[s];  in bpf_compute_postorder()
687 					state[succ->items[s]] |= DISCOVERED;  in bpf_compute_postorder()
829 				if (pre[succ->items[j]]) {  in bpf_compute_scc()
830 					low[w] = min(low[w], low[succ->items[j]]);  in bpf_compute_scc()
832 					dfs[dfs_sz++] = succ->items[j];  in bpf_compute_scc()
851 				if (succ->items[j] == w) {  in bpf_compute_scc()