@@ -10,9 +10,10 @@ static unsigned int duration;
1010
1111static void test_hash_map (void )
1212{
13- int i , err , hashmap_fd , max_entries , percpu_map_fd ;
13+ int i , err , max_entries ;
1414 struct for_each_hash_map_elem * skel ;
1515 __u64 * percpu_valbuf = NULL ;
16+ size_t percpu_val_sz ;
1617 __u32 key , num_cpus ;
1718 __u64 val ;
1819 LIBBPF_OPTS (bpf_test_run_opts , topts ,
@@ -25,26 +26,27 @@ static void test_hash_map(void)
2526 if (!ASSERT_OK_PTR (skel , "for_each_hash_map_elem__open_and_load" ))
2627 return ;
2728
28- hashmap_fd = bpf_map__fd (skel -> maps .hashmap );
2929 max_entries = bpf_map__max_entries (skel -> maps .hashmap );
3030 for (i = 0 ; i < max_entries ; i ++ ) {
3131 key = i ;
3232 val = i + 1 ;
33- err = bpf_map_update_elem (hashmap_fd , & key , & val , BPF_ANY );
33+ err = bpf_map__update_elem (skel -> maps .hashmap , & key , sizeof (key ),
34+ & val , sizeof (val ), BPF_ANY );
3435 if (!ASSERT_OK (err , "map_update" ))
3536 goto out ;
3637 }
3738
3839 num_cpus = bpf_num_possible_cpus ();
39- percpu_map_fd = bpf_map__fd ( skel -> maps . percpu_map ) ;
40- percpu_valbuf = malloc (sizeof ( __u64 ) * num_cpus );
40+ percpu_val_sz = sizeof ( __u64 ) * num_cpus ;
41+ percpu_valbuf = malloc (percpu_val_sz );
4142 if (!ASSERT_OK_PTR (percpu_valbuf , "percpu_valbuf" ))
4243 goto out ;
4344
4445 key = 1 ;
4546 for (i = 0 ; i < num_cpus ; i ++ )
4647 percpu_valbuf [i ] = i + 1 ;
47- err = bpf_map_update_elem (percpu_map_fd , & key , percpu_valbuf , BPF_ANY );
48+ err = bpf_map__update_elem (skel -> maps .percpu_map , & key , sizeof (key ),
49+ percpu_valbuf , percpu_val_sz , BPF_ANY );
4850 if (!ASSERT_OK (err , "percpu_map_update" ))
4951 goto out ;
5052
@@ -58,7 +60,7 @@ static void test_hash_map(void)
5860 ASSERT_EQ (skel -> bss -> hashmap_elems , max_entries , "hashmap_elems" );
5961
6062 key = 1 ;
61- err = bpf_map_lookup_elem ( hashmap_fd , & key , & val );
63+ err = bpf_map__lookup_elem ( skel -> maps . hashmap , & key , sizeof ( key ), & val , sizeof ( val ), 0 );
6264 ASSERT_ERR (err , "hashmap_lookup" );
6365
6466 ASSERT_EQ (skel -> bss -> percpu_called , 1 , "percpu_called" );
@@ -75,9 +77,10 @@ static void test_hash_map(void)
7577static void test_array_map (void )
7678{
7779 __u32 key , num_cpus , max_entries ;
78- int i , arraymap_fd , percpu_map_fd , err ;
80+ int i , err ;
7981 struct for_each_array_map_elem * skel ;
8082 __u64 * percpu_valbuf = NULL ;
83+ size_t percpu_val_sz ;
8184 __u64 val , expected_total ;
8285 LIBBPF_OPTS (bpf_test_run_opts , topts ,
8386 .data_in = & pkt_v4 ,
@@ -89,7 +92,6 @@ static void test_array_map(void)
8992 if (!ASSERT_OK_PTR (skel , "for_each_array_map_elem__open_and_load" ))
9093 return ;
9194
92- arraymap_fd = bpf_map__fd (skel -> maps .arraymap );
9395 expected_total = 0 ;
9496 max_entries = bpf_map__max_entries (skel -> maps .arraymap );
9597 for (i = 0 ; i < max_entries ; i ++ ) {
@@ -98,21 +100,23 @@ static void test_array_map(void)
98100 /* skip the last iteration for expected total */
99101 if (i != max_entries - 1 )
100102 expected_total += val ;
101- err = bpf_map_update_elem (arraymap_fd , & key , & val , BPF_ANY );
103+ err = bpf_map__update_elem (skel -> maps .arraymap , & key , sizeof (key ),
104+ & val , sizeof (val ), BPF_ANY );
102105 if (!ASSERT_OK (err , "map_update" ))
103106 goto out ;
104107 }
105108
106109 num_cpus = bpf_num_possible_cpus ();
107- percpu_map_fd = bpf_map__fd ( skel -> maps . percpu_map ) ;
108- percpu_valbuf = malloc (sizeof ( __u64 ) * num_cpus );
110+ percpu_val_sz = sizeof ( __u64 ) * num_cpus ;
111+ percpu_valbuf = malloc (percpu_val_sz );
109112 if (!ASSERT_OK_PTR (percpu_valbuf , "percpu_valbuf" ))
110113 goto out ;
111114
112115 key = 0 ;
113116 for (i = 0 ; i < num_cpus ; i ++ )
114117 percpu_valbuf [i ] = i + 1 ;
115- err = bpf_map_update_elem (percpu_map_fd , & key , percpu_valbuf , BPF_ANY );
118+ err = bpf_map__update_elem (skel -> maps .percpu_map , & key , sizeof (key ),
119+ percpu_valbuf , percpu_val_sz , BPF_ANY );
116120 if (!ASSERT_OK (err , "percpu_map_update" ))
117121 goto out ;
118122
0 commit comments