forked from mirrors/linux
		
	 4a0ee78890
			
		
	
	
		4a0ee78890
		
	
	
	
	
		
			
			Currently, BPF programs typically have a suffix of .bpf.c. However, some programs still utilize a mixture of _kern.c suffix alongside the naming convention. In order to achieve consistency in the naming of these programs, this commit unifies the inconsistency in the naming convention of BPF kernel programs. Signed-off-by: Daniel T. Lee <danieltimlee@gmail.com> Link: https://lore.kernel.org/r/20230818090119.477441-4-danieltimlee@gmail.com Signed-off-by: Alexei Starovoitov <ast@kernel.org>
		
			
				
	
	
		
			96 lines
		
	
	
	
		
			2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			96 lines
		
	
	
	
		
			2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| // SPDX-License-Identifier: GPL-2.0-only
 | |
| /* Copyright (c) 2015 PLUMgrid, http://plumgrid.com
 | |
|  */
 | |
| #include <stdio.h>
 | |
| #include <stdlib.h>
 | |
| #include <signal.h>
 | |
| #include <unistd.h>
 | |
| #include <stdbool.h>
 | |
| #include <string.h>
 | |
| #include <time.h>
 | |
| 
 | |
| #include <bpf/bpf.h>
 | |
| #include <bpf/libbpf.h>
 | |
| 
 | |
| struct pair {
 | |
| 	long long val;
 | |
| 	__u64 ip;
 | |
| };
 | |
| 
 | |
| static __u64 time_get_ns(void)
 | |
| {
 | |
| 	struct timespec ts;
 | |
| 
 | |
| 	clock_gettime(CLOCK_MONOTONIC, &ts);
 | |
| 	return ts.tv_sec * 1000000000ull + ts.tv_nsec;
 | |
| }
 | |
| 
 | |
| static void print_old_objects(int fd)
 | |
| {
 | |
| 	long long val = time_get_ns();
 | |
| 	__u64 key, next_key;
 | |
| 	struct pair v;
 | |
| 
 | |
| 	key = write(1, "\e[1;1H\e[2J", 11); /* clear screen */
 | |
| 
 | |
| 	key = -1;
 | |
| 	while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
 | |
| 		bpf_map_lookup_elem(fd, &next_key, &v);
 | |
| 		key = next_key;
 | |
| 		if (val - v.val < 1000000000ll)
 | |
| 			/* object was allocated more then 1 sec ago */
 | |
| 			continue;
 | |
| 		printf("obj 0x%llx is %2lldsec old was allocated at ip %llx\n",
 | |
| 		       next_key, (val - v.val) / 1000000000ll, v.ip);
 | |
| 	}
 | |
| }
 | |
| 
 | |
| int main(int ac, char **argv)
 | |
| {
 | |
| 	struct bpf_link *links[2];
 | |
| 	struct bpf_program *prog;
 | |
| 	struct bpf_object *obj;
 | |
| 	char filename[256];
 | |
| 	int map_fd, j = 0;
 | |
| 
 | |
| 	snprintf(filename, sizeof(filename), "%s.bpf.o", argv[0]);
 | |
| 	obj = bpf_object__open_file(filename, NULL);
 | |
| 	if (libbpf_get_error(obj)) {
 | |
| 		fprintf(stderr, "ERROR: opening BPF object file failed\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 
 | |
| 	/* load BPF program */
 | |
| 	if (bpf_object__load(obj)) {
 | |
| 		fprintf(stderr, "ERROR: loading BPF object file failed\n");
 | |
| 		goto cleanup;
 | |
| 	}
 | |
| 
 | |
| 	map_fd = bpf_object__find_map_fd_by_name(obj, "my_map");
 | |
| 	if (map_fd < 0) {
 | |
| 		fprintf(stderr, "ERROR: finding a map in obj file failed\n");
 | |
| 		goto cleanup;
 | |
| 	}
 | |
| 
 | |
| 	bpf_object__for_each_program(prog, obj) {
 | |
| 		links[j] = bpf_program__attach(prog);
 | |
| 		if (libbpf_get_error(links[j])) {
 | |
| 			fprintf(stderr, "ERROR: bpf_program__attach failed\n");
 | |
| 			links[j] = NULL;
 | |
| 			goto cleanup;
 | |
| 		}
 | |
| 		j++;
 | |
| 	}
 | |
| 
 | |
| 	while (1) {
 | |
| 		print_old_objects(map_fd);
 | |
| 		sleep(1);
 | |
| 	}
 | |
| 
 | |
| cleanup:
 | |
| 	for (j--; j >= 0; j--)
 | |
| 		bpf_link__destroy(links[j]);
 | |
| 
 | |
| 	bpf_object__close(obj);
 | |
| 	return 0;
 | |
| }
 |