Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .github/workflows/.spellcheck-conf.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
[default]
# Don't correct the following words:
extend-ignore-words-re = ["ASSER", "Tne", "ba", "BA"]
extend-ignore-words-re = ["ASSER", "Tne", "ba", "BA", "PN"]

[files]
# completely exclude those files from consideration:
Expand Down
2 changes: 1 addition & 1 deletion .github/workflows/reusable_checks.yml
Original file line number Diff line number Diff line change
Expand Up @@ -58,7 +58,7 @@ jobs:
./scripts/check_license/check_headers.sh . "Apache-2.0 WITH LLVM-exception" -v

- name: Run a spell check
uses: crate-ci/typos@b63f421581dce830bda2f597a678cb7776b41877 # v1.18.2
uses: crate-ci/typos@b1a1ef3893ff35ade0cfa71523852a49bfd05d19 # v1.31.1
with:
config: ./.github/workflows/.spellcheck-conf.toml

Expand Down
2 changes: 1 addition & 1 deletion docs/config/Doxyfile
Original file line number Diff line number Diff line change
Expand Up @@ -466,7 +466,7 @@ LOOKUP_CACHE_SIZE = 0
# than 0 to get more control over the balance between CPU load and processing
# speed. At this moment only the input processing can be done using multiple
# threads. Since this is still an experimental feature the default is set to 1,
# which efficively disables parallel processing. Please report any issues you
# which effectively disables parallel processing. Please report any issues you
# encounter. Generating dot graphs in parallel is controlled by the
# DOT_NUM_THREADS setting.
# Minimum value: 0, maximum value: 32, default value: 1.
Expand Down
4 changes: 2 additions & 2 deletions src/coarse/coarse.c
Original file line number Diff line number Diff line change
Expand Up @@ -442,10 +442,10 @@ static umf_result_t user_block_merge(coarse_t *coarse, ravl_node_t *node1,
assert(block1->data < block2->data);

bool same_used = ((block1->used == used) && (block2->used == used));
bool contignous_data = (block1->data + block1->size == block2->data);
bool contiguous_data = (block1->data + block1->size == block2->data);

// check if blocks can be merged
if (!same_used || !contignous_data) {
if (!same_used || !contiguous_data) {
return UMF_RESULT_ERROR_INVALID_ARGUMENT;
}

Expand Down
2 changes: 1 addition & 1 deletion test/malloc_compliance_tests.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -119,7 +119,7 @@ void realloc_compliance_test(umf_memory_pool_handle_t hPool) {
<< "malloc returned NULL, couldn't allocate much memory";

// Fit memory region with data and store
// it's content somehere before realloc
// it's content somewhere before realloc
void *saved_obj = umfPoolMalloc(hPool, alloc_size);
ASSERT_NE(saved_obj, nullptr)
<< "malloc returned NULL, couldn't allocate much memory";
Expand Down
2 changes: 1 addition & 1 deletion test/provider_devdax_memory.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -235,7 +235,7 @@ TEST_P(umfProviderTest, purge_force) {
test_alloc_free_success(provider.get(), page_size, 0, PURGE_FORCE);
}

TEST_P(umfProviderTest, purge_force_unalligned_alloc) {
TEST_P(umfProviderTest, purge_force_unaligned_alloc) {
void *ptr;
auto ret = umfMemoryProviderAlloc(provider.get(), page_plus_64, 0, &ptr);
ASSERT_EQ(ret, UMF_RESULT_SUCCESS);
Expand Down