2
* Drizzle Client & Protocol Library
4
* Copyright (C) 2008 Eric Day (eday@oddments.org)
7
* Redistribution and use in source and binary forms, with or without
8
* modification, are permitted provided that the following conditions are
11
* * Redistributions of source code must retain the above copyright
12
* notice, this list of conditions and the following disclaimer.
14
* * Redistributions in binary form must reproduce the above
15
* copyright notice, this list of conditions and the following disclaimer
16
* in the documentation and/or other materials provided with the
19
* * The names of its contributors may not be used to endorse or
20
* promote products derived from this software without specific prior
23
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
29
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
30
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
31
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
32
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
33
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39
* @brief Row definitions
48
uint64_t drizzle_row_read(drizzle_result_st *result, drizzle_return_t *ret_ptr)
50
if (drizzle_state_none(result->con))
52
drizzle_state_push(result->con, drizzle_state_row_read);
53
drizzle_state_push(result->con, drizzle_state_packet_read);
56
*ret_ptr= drizzle_state_loop(result->con);
58
return result->row_current;
61
drizzle_row_t drizzle_row_buffer(drizzle_result_st *result,
62
drizzle_return_t *ret_ptr)
65
drizzle_field_t field;
68
if (result->row == NULL)
70
if (drizzle_row_read(result, ret_ptr) == 0 || *ret_ptr != DRIZZLE_RETURN_OK)
73
result->row= malloc((sizeof(drizzle_field_t) + sizeof(size_t)) *
74
result->column_count);
75
if (result->row == NULL)
77
drizzle_set_error(result->con->drizzle, "drizzle_row_buffer", "malloc");
78
*ret_ptr= DRIZZLE_RETURN_MEMORY;
82
result->field_sizes= (size_t *)(result->row + result->column_count);
87
field= drizzle_field_buffer(result, &total, ret_ptr);
88
if (*ret_ptr == DRIZZLE_RETURN_ROW_END)
90
if (*ret_ptr != DRIZZLE_RETURN_OK)
92
if (*ret_ptr != DRIZZLE_RETURN_IO_WAIT)
96
result->field_sizes= NULL;
102
result->row[result->field_current - 1]= field;
103
result->field_sizes[result->field_current - 1]= total;
106
*ret_ptr= DRIZZLE_RETURN_OK;
113
void drizzle_row_free(drizzle_result_st *result, drizzle_row_t row)
117
for (x= 0; x < result->column_count; x++)
118
drizzle_field_free(row[x]);
123
size_t *drizzle_row_field_sizes(drizzle_result_st *result)
125
return result->field_sizes;
128
drizzle_row_t drizzle_row_next(drizzle_result_st *result)
130
if (result->row_current == result->row_count)
133
result->field_sizes= result->field_sizes_list[result->row_current];
134
result->row_current++;
135
return result->row_list[result->row_current - 1];
138
drizzle_row_t drizzle_row_prev(drizzle_result_st *result)
140
if (result->row_current == 0)
143
result->row_current--;
144
result->field_sizes= result->field_sizes_list[result->row_current];
145
return result->row_list[result->row_current];
148
void drizzle_row_seek(drizzle_result_st *result, uint64_t row)
150
if (row <= result->row_count)
151
result->row_current= row;
154
drizzle_row_t drizzle_row_index(drizzle_result_st *result, uint64_t row)
156
if (row >= result->row_count)
159
return result->row_list[row];
162
uint64_t drizzle_row_current(drizzle_result_st *result)
164
return result->row_current;
171
drizzle_return_t drizzle_row_write(drizzle_result_st *result)
173
if (drizzle_state_none(result->con))
174
drizzle_state_push(result->con, drizzle_state_row_write);
176
return drizzle_state_loop(result->con);
180
* Internal state functions.
183
drizzle_return_t drizzle_state_row_read(drizzle_con_st *con)
185
drizzle_log_debug(con->drizzle, "drizzle_state_row_read");
187
if (con->packet_size != 0 && con->buffer_size < con->packet_size &&
188
con->buffer_size < 5)
190
drizzle_state_push(con, drizzle_state_read);
191
return DRIZZLE_RETURN_OK;
194
if (con->packet_size == 5 && con->buffer_ptr[0] == 254)
196
/* Got EOF packet, no more rows. */
197
con->result->row_current= 0;
198
con->result->warning_count= drizzle_get_byte2(con->buffer_ptr + 1);
199
con->status= drizzle_get_byte2(con->buffer_ptr + 3);
201
con->buffer_size-= 5;
203
else if (con->buffer_ptr[0] == 255)
205
drizzle_state_pop(con);
206
drizzle_state_push(con, drizzle_state_result_read);
207
return DRIZZLE_RETURN_OK;
209
else if (con->result->options & DRIZZLE_RESULT_ROW_BREAK)
210
con->result->options&= (drizzle_result_options_t)~DRIZZLE_RESULT_ROW_BREAK;
213
con->result->row_count++;
214
con->result->row_current++;
215
con->result->field_current= 0;
218
drizzle_state_pop(con);
219
return DRIZZLE_RETURN_OK;
222
drizzle_return_t drizzle_state_row_write(drizzle_con_st *con)
224
uint8_t *start= con->buffer_ptr + con->buffer_size;
226
drizzle_log_debug(con->drizzle, "drizzle_state_row_write");
228
/* Flush buffer if there is not enough room. */
229
if (((size_t)DRIZZLE_MAX_BUFFER_SIZE - (size_t)(start - con->buffer)) < 4)
231
drizzle_state_push(con, drizzle_state_write);
232
return DRIZZLE_RETURN_OK;
235
drizzle_set_byte3(start, con->packet_size);
236
start[3]= con->packet_number;
237
con->packet_number++;
239
con->buffer_size+= 4;
241
drizzle_state_pop(con);
242
return DRIZZLE_RETURN_OK;