int x;
if (t <= b) {
/* Non-empty queue. */
- int size = atomic_load_explicit(&a->size, memory_order_relaxed);
- if (size == 0)
- model_print("take: size == 0\n");
- // TODO: size can be zero here!!
- x = atomic_load_explicit(&a->buffer[b % size], memory_order_relaxed);
+ x = atomic_load_explicit(&a->buffer[b % atomic_load_explicit(&a->size,memory_order_relaxed)], memory_order_relaxed);
/**
@Begin
@Commit_point_define_check: t != b
atomic_store_explicit(&new_a->size, new_size, memory_order_relaxed);
size_t i;
for(i=top; i < bottom; i++) {
- if (new_size == 0)
- model_print("resize: new_size == 0\n");
- if (size == 0)
- model_print("resize: size == 0\n");
atomic_store_explicit(&new_a->buffer[i % new_size], atomic_load_explicit(&a->buffer[i % size], memory_order_relaxed), memory_order_relaxed);
}
atomic_store_explicit(&q->array, new_a, memory_order_release);
//Bug in paper...should have next line...
a = (Array *) atomic_load_explicit(&q->array, memory_order_relaxed);
}
- int size = atomic_load_explicit(&a->size, memory_order_relaxed);
- if (size == 0)
- model_print("push: size == 0\n");
- atomic_store_explicit(&a->buffer[b % size], x, memory_order_relaxed);
+ atomic_store_explicit(&a->buffer[b % atomic_load_explicit(&a->size, memory_order_relaxed)], x, memory_order_relaxed);
atomic_thread_fence(memory_order_release);
/**
@Begin
if (t < b) {
/* Non-empty queue. */
Array *a = (Array *) atomic_load_explicit(&q->array, memory_order_acquire);
- int size = atomic_load_explicit(&a->size, memory_order_relaxed);
- if (size == 0)
- model_print("steal: size == 0\n");
- x = atomic_load_explicit(&a->buffer[t % size], memory_order_relaxed);
+ x = atomic_load_explicit(&a->buffer[t % atomic_load_explicit(&a->size, memory_order_relaxed)], memory_order_relaxed);
bool succ = atomic_compare_exchange_strong_explicit(&q->top, &t, t + 1,
memory_order_seq_cst, memory_order_relaxed);
/**