greg/stasis-aries-wal
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Added asserts to help narrow down unit test failures

Browse source
This commit is contained in:
Sears Russell 2008-09-12 22:55:23 +00:00
parent a07852007e
commit 75419290c4
1 changed files with 6 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/stasis/io/non_blocking.c
View file

@ -652,6 +652,7 @@ static void * nbw_worker(void * handle) {
if(node->dirty == NEEDS_FORCE) { if(node->dirty == NEEDS_FORCE) {
contributed_to_force = 1; contributed_to_force = 1;
} }
assert(node->dirty != INVALID_NODE);
node->dirty = CLEAN; node->dirty = CLEAN;
node->pin_count++; node->pin_count++;
writes++; writes++;
@ -702,6 +703,7 @@ static void * nbw_worker(void * handle) {
buf_off += np_len; buf_off += np_len;
r2->h->release_read_buffer(r2); r2->h->release_read_buffer(r2);
if(np->dirty == NEEDS_FORCE) contributed_to_force = 1; if(np->dirty == NEEDS_FORCE) contributed_to_force = 1;
assert(np->dirty != INVALID_NODE);
np->dirty = CLEAN; np->dirty = CLEAN;
np->pin_count++; np->pin_count++;
dummy.start_pos = np->end_pos; dummy.start_pos = np->end_pos;
@ -730,7 +732,10 @@ static void * nbw_worker(void * handle) {
#ifdef MERGE_WRITES #ifdef MERGE_WRITES
for(int i = 0; i < dummy_count; i++) { for(int i = 0; i < dummy_count; i++) {
np = (tree_node*)RB_ENTRY(find)(&dummies[i], impl->fast_handles); np = (tree_node*)RB_ENTRY(find)(&dummies[i], impl->fast_handles);
assert(np);
assert(np->pin_count); assert(np->pin_count);
assert(np->dirty != INVALID_NODE);
np->pin_count--; np->pin_count--;
if(!np->dirty && !np->pin_count) { if(!np->dirty && !np->pin_count) {
impl->used_buffer_size -= (np->end_pos - np->start_pos); impl->used_buffer_size -= (np->end_pos - np->start_pos);
@ -742,6 +747,7 @@ static void * nbw_worker(void * handle) {
free(dummies); free(dummies);
} }
#endif #endif
assert(node->pin_count);
node->pin_count--; node->pin_count--;
} }
tree_node *new_node = (tree_node*)RB_ENTRY(lookup)(RB_LUGREAT, &next_node, tree_node *new_node = (tree_node*)RB_ENTRY(lookup)(RB_LUGREAT, &next_node,