Wouldn't be better to update the number of repeats before the loop rather than checking at every iteration?

if (deque->maxlen >= 0 && n * size > deque->maxlen)
    n = (deque->maxlen + size - 1) / size;