Skip to content

Commit

Permalink
Use TypeSet for DeclInfo deps
Browse files Browse the repository at this point in the history
  • Loading branch information
gingerBill committed Feb 18, 2025
1 parent 721bcf2 commit 19b5946
Show file tree
Hide file tree
Showing 4 changed files with 71 additions and 60 deletions.
4 changes: 2 additions & 2 deletions src/check_decl.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1742,8 +1742,8 @@ gb_internal void add_deps_from_child_to_parent(DeclInfo *decl) {
rw_mutex_shared_lock(&decl->type_info_deps_mutex);
rw_mutex_lock(&decl->parent->type_info_deps_mutex);

for (Type *t : decl->type_info_deps) {
ptr_set_add(&decl->parent->type_info_deps, t);
for (auto const &tt : decl->type_info_deps) {
type_set_add(&decl->parent->type_info_deps, tt);
}

rw_mutex_unlock(&decl->parent->type_info_deps_mutex);
Expand Down
10 changes: 5 additions & 5 deletions src/checker.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -173,7 +173,7 @@ gb_internal void init_decl_info(DeclInfo *d, Scope *scope, DeclInfo *parent) {
d->parent = parent;
d->scope = scope;
ptr_set_init(&d->deps, 0);
ptr_set_init(&d->type_info_deps, 0);
type_set_init(&d->type_info_deps, 0);
d->labels.allocator = heap_allocator();
d->variadic_reuses.allocator = heap_allocator();
d->variadic_reuse_max_bytes = 0;
Expand Down Expand Up @@ -838,7 +838,7 @@ gb_internal void add_type_info_dependency(CheckerInfo *info, DeclInfo *d, Type *
}
}
rw_mutex_lock(&d->type_info_deps_mutex);
ptr_set_add(&d->type_info_deps, type);
type_set_add(&d->type_info_deps, type);
rw_mutex_unlock(&d->type_info_deps_mutex);
}

Expand Down Expand Up @@ -2506,8 +2506,8 @@ gb_internal void add_dependency_to_set(Checker *c, Entity *entity) {
if (decl == nullptr) {
return;
}
for (Type *t : decl->type_info_deps) {
add_min_dep_type_info(c, t);
for (TypeInfoPair const tt : decl->type_info_deps) {
add_min_dep_type_info(c, tt.type);
}

for (Entity *e : decl->deps) {
Expand Down Expand Up @@ -6742,7 +6742,7 @@ gb_internal void check_parsed_files(Checker *c) {
auto const &tt = c->info.type_info_types[i];
bool exists = map_set_if_not_previously_exists(&c->info.minimum_dependency_type_info_index_map, cast(uintptr)tt.hash, i);
if (!exists) {
continue
continue;
}
for (auto const &entry : c->info.minimum_dependency_type_info_index_map) {
if (entry.key != cast(uintptr)tt.hash) {
Expand Down
80 changes: 57 additions & 23 deletions src/checker.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -167,6 +167,61 @@ typedef DECL_ATTRIBUTE_PROC(DeclAttributeProc);

gb_internal void check_decl_attributes(CheckerContext *c, Array<Ast *> const &attributes, DeclAttributeProc *proc, AttributeContext *ac);

struct TypeInfoPair {
Type *type;
u64 hash; // see: type_hash_canonical_type
};

struct TypeSet {
TypeInfoPair *keys;
usize count;
usize capacity;
};

static constexpr u64 TYPE_SET_TOMBSTONE = ~(u64)(0ull);

struct TypeSetIterator {
TypeSet *set;
usize index;

TypeSetIterator &operator++() noexcept {
for (;;) {
++index;
if (set->capacity == index) {
return *this;
}
TypeInfoPair key = set->keys[index];
if (key.hash != 0 && key.hash != TYPE_SET_TOMBSTONE) {
return *this;
}
}
}

bool operator==(TypeSetIterator const &other) const noexcept {
return this->set == other.set && this->index == other.index;
}


operator TypeInfoPair *() const {
return &set->keys[index];
}
};


gb_internal void type_set_init (TypeSet *s, isize capacity = 16);
gb_internal void type_set_destroy(TypeSet *s);
gb_internal Type *type_set_add (TypeSet *s, Type *ptr);
gb_internal Type *type_set_add (TypeSet *s, TypeInfoPair pair);
gb_internal bool type_set_update (TypeSet *s, Type *ptr); // returns true if it previously existed
gb_internal bool type_set_update (TypeSet *s, TypeInfoPair pair); // returns true if it previously existed
gb_internal bool type_set_exists (TypeSet *s, Type *ptr);
gb_internal void type_set_remove (TypeSet *s, Type *ptr);
gb_internal void type_set_clear (TypeSet *s);
gb_internal TypeInfoPair *type_set_retrieve(TypeSet *s, Type *ptr);

gb_internal TypeSetIterator begin(TypeSet &set) noexcept;
gb_internal TypeSetIterator end(TypeSet &set) noexcept;


enum ProcCheckedState : u8 {
ProcCheckedState_Unchecked,
Expand Down Expand Up @@ -221,8 +276,8 @@ struct DeclInfo {
RwMutex deps_mutex;
PtrSet<Entity *> deps;

RwMutex type_info_deps_mutex;
PtrSet<Type *> type_info_deps; // TODO(bill): Use TypeSet
RwMutex type_info_deps_mutex;
TypeSet type_info_deps;

BlockingMutex type_and_value_mutex;

Expand Down Expand Up @@ -409,27 +464,6 @@ struct Defineable {
String pos_str;
};

struct TypeInfoPair {
Type *type;
u64 hash; // see: type_hash_canonical_type
};

struct TypeSet {
TypeInfoPair *keys;
usize count;
usize capacity;
};

gb_internal void type_set_init (TypeSet *s, isize capacity = 16);
gb_internal void type_set_destroy(TypeSet *s);
gb_internal Type *type_set_add (TypeSet *s, Type *ptr);
gb_internal bool type_set_update (TypeSet *s, Type *ptr); // returns true if it previously existed
gb_internal bool type_set_update (TypeSet *s, TypeInfoPair pair); // returns true if it previously existed
gb_internal bool type_set_exists (TypeSet *s, Type *ptr);
gb_internal void type_set_remove (TypeSet *s, Type *ptr);
gb_internal void type_set_clear (TypeSet *s);
gb_internal TypeInfoPair *type_set_retrieve(TypeSet *s, Type *ptr);

// CheckerInfo stores all the symbol information for a type-checked program
struct CheckerInfo {
Checker *checker;
Expand Down
37 changes: 7 additions & 30 deletions src/name_canonicalization.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -57,11 +57,10 @@ gb_internal GB_COMPARE_PROC(type_info_pair_cmp) {
return x->hash < y->hash ? -1 : +1;
}

static constexpr u64 TYPE_SET_TOMBSTONE = ~(u64)(0ull);

gb_internal void type_set_init (TypeSet *s, isize capacity);
gb_internal void type_set_destroy(TypeSet *s);
gb_internal Type *type_set_add (TypeSet *s, Type *ptr);
gb_internal Type *type_set_add (TypeSet *s, TypeInfoPair pair);
gb_internal bool type_set_update (TypeSet *s, Type *ptr); // returns true if it previously existed
gb_internal bool type_set_update (TypeSet *s, TypeInfoPair pair); // returns true if it previously existed
gb_internal bool type_set_exists (TypeSet *s, Type *ptr);
Expand All @@ -73,34 +72,6 @@ gb_internal gbAllocator type_set_allocator(void) {
return heap_allocator();
}

struct TypeSetIterator {
TypeSet *set;
usize index;

TypeSetIterator &operator++() noexcept {
for (;;) {
++index;
if (set->capacity == index) {
return *this;
}
TypeInfoPair key = set->keys[index];
if (key.hash != 0 && key.hash != TYPE_SET_TOMBSTONE) {
return *this;
}
}
}

bool operator==(TypeSetIterator const &other) const noexcept {
return this->set == other.set && this->index == other.index;
}


operator TypeInfoPair *() const {
return &set->keys[index];
}
};


gb_internal TypeSetIterator begin(TypeSet &set) noexcept {
usize index = 0;
while (index < set.capacity) {
Expand Down Expand Up @@ -257,6 +228,12 @@ gb_internal Type *type_set_add(TypeSet *s, Type *ptr) {
return ptr;
}

gb_internal Type *type_set_add(TypeSet *s, TypeInfoPair pair) {
type_set_update(s, pair);
return pair.type;
}



gb_internal void type_set_remove(TypeSet *s, Type *ptr) {
isize index = type_set__find(s, ptr);
Expand Down

0 comments on commit 19b5946

Please sign in to comment.