|
@@ -17,7 +17,7 @@
|
|
|
struct bpf_htab {
|
|
|
struct bpf_map map;
|
|
|
struct hlist_head *buckets;
|
|
|
- spinlock_t lock;
|
|
|
+ raw_spinlock_t lock;
|
|
|
u32 count; /* number of elements in this hashtable */
|
|
|
u32 n_buckets; /* number of hash buckets */
|
|
|
u32 elem_size; /* size of each element in bytes */
|
|
@@ -82,7 +82,7 @@ static struct bpf_map *htab_map_alloc(union bpf_attr *attr)
|
|
|
for (i = 0; i < htab->n_buckets; i++)
|
|
|
INIT_HLIST_HEAD(&htab->buckets[i]);
|
|
|
|
|
|
- spin_lock_init(&htab->lock);
|
|
|
+ raw_spin_lock_init(&htab->lock);
|
|
|
htab->count = 0;
|
|
|
|
|
|
htab->elem_size = sizeof(struct htab_elem) +
|
|
@@ -234,7 +234,7 @@ static int htab_map_update_elem(struct bpf_map *map, void *key, void *value,
|
|
|
l_new->hash = htab_map_hash(l_new->key, key_size);
|
|
|
|
|
|
/* bpf_map_update_elem() can be called in_irq() */
|
|
|
- spin_lock_irqsave(&htab->lock, flags);
|
|
|
+ raw_spin_lock_irqsave(&htab->lock, flags);
|
|
|
|
|
|
head = select_bucket(htab, l_new->hash);
|
|
|
|
|
@@ -270,11 +270,11 @@ static int htab_map_update_elem(struct bpf_map *map, void *key, void *value,
|
|
|
} else {
|
|
|
htab->count++;
|
|
|
}
|
|
|
- spin_unlock_irqrestore(&htab->lock, flags);
|
|
|
+ raw_spin_unlock_irqrestore(&htab->lock, flags);
|
|
|
|
|
|
return 0;
|
|
|
err:
|
|
|
- spin_unlock_irqrestore(&htab->lock, flags);
|
|
|
+ raw_spin_unlock_irqrestore(&htab->lock, flags);
|
|
|
kfree(l_new);
|
|
|
return ret;
|
|
|
}
|
|
@@ -295,7 +295,7 @@ static int htab_map_delete_elem(struct bpf_map *map, void *key)
|
|
|
|
|
|
hash = htab_map_hash(key, key_size);
|
|
|
|
|
|
- spin_lock_irqsave(&htab->lock, flags);
|
|
|
+ raw_spin_lock_irqsave(&htab->lock, flags);
|
|
|
|
|
|
head = select_bucket(htab, hash);
|
|
|
|
|
@@ -308,7 +308,7 @@ static int htab_map_delete_elem(struct bpf_map *map, void *key)
|
|
|
ret = 0;
|
|
|
}
|
|
|
|
|
|
- spin_unlock_irqrestore(&htab->lock, flags);
|
|
|
+ raw_spin_unlock_irqrestore(&htab->lock, flags);
|
|
|
return ret;
|
|
|
}
|
|
|
|