mirror of
https://github.com/ruby/ruby.git
synced 2025-08-15 13:39:04 +02:00
66349692f0
If we create a key but don't insert it (due to other Ractor winning the race), then it would leak memory if we don't free it. This introduces a new function to free that memory for this case.
21 lines
765 B
C
21 lines
765 B
C
#ifndef RUBY_RACTOR_SAFE_TABLE_H
|
|
#define RUBY_RACTOR_SAFE_TABLE_H
|
|
|
|
#include "ruby/atomic.h"
|
|
#include "ruby/ruby.h"
|
|
|
|
struct rb_concurrent_set_funcs {
|
|
VALUE (*hash)(VALUE key);
|
|
bool (*cmp)(VALUE a, VALUE b);
|
|
VALUE (*create)(VALUE key, void *data);
|
|
void (*free)(VALUE key);
|
|
};
|
|
|
|
VALUE rb_concurrent_set_new(const struct rb_concurrent_set_funcs *funcs, int capacity);
|
|
rb_atomic_t rb_concurrent_set_size(VALUE set_obj);
|
|
VALUE rb_concurrent_set_find(VALUE *set_obj_ptr, VALUE key);
|
|
VALUE rb_concurrent_set_find_or_insert(VALUE *set_obj_ptr, VALUE key, void *data);
|
|
VALUE rb_concurrent_set_delete_by_identity(VALUE set_obj, VALUE key);
|
|
void rb_concurrent_set_foreach_with_replace(VALUE set_obj, int (*callback)(VALUE *key, void *data), void *data);
|
|
|
|
#endif
|