39 	struct hist_key key = {}, next_key;  in print_hist_for_pid()  local
47 	while (bpf_get_next_key(fd, &key, &next_key) == 0) {  in print_hist_for_pid()
48 		if (memcmp(&next_key, task, SIZE)) {  in print_hist_for_pid()
49 			key = next_key;  in print_hist_for_pid()
52 		bpf_lookup_elem(fd, &next_key, &value);  in print_hist_for_pid()
53 		ind = next_key.index;  in print_hist_for_pid()
59 		key = next_key;  in print_hist_for_pid()
74 	struct hist_key key = {}, next_key;  in print_hist()  local
79 	while (bpf_get_next_key(fd, &key, &next_key) == 0) {  in print_hist()
83 			if (memcmp(&tasks[i], &next_key, SIZE) == 0)  in print_hist()
86 			memcpy(&tasks[task_cnt++], &next_key, SIZE);  in print_hist()
87 		key = next_key;  in print_hist()
109 	long key, next_key, value;  in main()  local
132 		while (bpf_get_next_key(map_fd[0], &key, &next_key) == 0) {  in main()
133 			bpf_lookup_elem(map_fd[0], &next_key, &value);  in main()
134 			printf("location 0x%lx count %ld\n", next_key, value);  in main()
135 			key = next_key;  in main()