Lines Matching defs:bottom
149 // |bottom| then the queue is empty.
151 // bottom contains the index of the last error in the queue.
152 unsigned bottom;
227 if (state == NULL || state->bottom == state->top) {
236 i = (state->bottom + 1) % ERR_NUM_ERRORS;
281 state->bottom = i;
288 return get_error_values(1 /* inc */, 0 /* bottom */, NULL, NULL, NULL, NULL);
292 return get_error_values(1 /* inc */, 0 /* bottom */, file, line, NULL, NULL);
297 return get_error_values(1 /* inc */, 0 /* bottom */, file, line, data, flags);
301 return get_error_values(0 /* peek */, 0 /* bottom */, NULL, NULL, NULL, NULL);
305 return get_error_values(0 /* peek */, 0 /* bottom */, file, line, NULL, NULL);
310 return get_error_values(0 /* peek */, 0 /* bottom */, file, line, data,
341 state->top = state->bottom = 0;
623 if (state == NULL || state->top == state->bottom) {
652 if (state->top == state->bottom) {
653 state->bottom = (state->bottom + 1) % ERR_NUM_ERRORS;
743 if (state == NULL || state->bottom == state->top) {
757 while (state->bottom != state->top) {
804 if (state == NULL || state->top == state->bottom) {
813 // Errors are stored in the range (bottom, top].
814 size_t num_errors = state->top >= state->bottom
815 ? state->top - state->bottom
816 : ERR_NUM_ERRORS + state->top - state->bottom;
827 size_t j = (state->bottom + i + 1) % ERR_NUM_ERRORS;
848 dst->bottom = ERR_NUM_ERRORS - 1;