44 	struct hist_key key = {}, next_key;  in print_hist_for_pid()  local
53 	while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {  in print_hist_for_pid()
54 		if (memcmp(&next_key, task, SIZE)) {  in print_hist_for_pid()
55 			key = next_key;  in print_hist_for_pid()
58 		bpf_map_lookup_elem(fd, &next_key, values);  in print_hist_for_pid()
62 		ind = next_key.index;  in print_hist_for_pid()
68 		key = next_key;  in print_hist_for_pid()
83 	struct hist_key key = {}, next_key;  in print_hist()  local
88 	while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {  in print_hist()
92 			if (memcmp(&tasks[i], &next_key, SIZE) == 0)  in print_hist()
95 			memcpy(&tasks[task_cnt++], &next_key, SIZE);  in print_hist()
96 		key = next_key;  in print_hist()
119 	long key, next_key, value;  in main()  local
148 		while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) {  in main()
149 			bpf_map_lookup_elem(map_fd[0], &next_key, &value);  in main()
150 			printf("location 0x%lx count %ld\n", next_key, value);  in main()
151 			key = next_key;  in main()