1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
1 |
/*
|
2 |
* Drizzle Client & Protocol Library
|
|
3 |
*
|
|
4 |
* Copyright (C) 2008 Eric Day (eday@oddments.org)
|
|
5 |
* All rights reserved.
|
|
6 |
*
|
|
1971.2.1
by kalebral at gmail
update files that did not have license or had incorrect license structure |
7 |
* Redistribution and use in source and binary forms, with or without
|
8 |
* modification, are permitted provided that the following conditions are
|
|
9 |
* met:
|
|
10 |
*
|
|
11 |
* * Redistributions of source code must retain the above copyright
|
|
12 |
* notice, this list of conditions and the following disclaimer.
|
|
13 |
*
|
|
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
|
|
17 |
* distribution.
|
|
18 |
*
|
|
19 |
* * The names of its contributors may not be used to endorse or
|
|
20 |
* promote products derived from this software without specific prior
|
|
21 |
* written permission.
|
|
22 |
*
|
|
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.
|
|
34 |
*
|
|
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
35 |
*/
|
36 |
||
37 |
#include <stdio.h> |
|
38 |
#include <string.h> |
|
1929.1.30
by Stewart Smith
fix missing include in simple_multi.c |
39 |
#include <stdlib.h> |
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
40 |
|
2449.1.2
by Brian Aker
Additional fixes for libdrizzle. |
41 |
#include <libdrizzle-2.0/drizzle_client.h> |
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
42 |
|
43 |
#define SIMPLE_MULTI_COUNT 10
|
|
44 |
||
45 |
int main(int argc, char *argv[]) |
|
46 |
{
|
|
47 |
const char *query= "SELECT table_schema,table_name FROM tables"; |
|
48 |
drizzle_st drizzle; |
|
1929.1.28
by Stewart Smith
fix simple_multi stack size fix |
49 |
drizzle_con_st *con; |
50 |
drizzle_result_st *result; |
|
51 |
drizzle_query_st *ql; |
|
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
52 |
drizzle_return_t ret; |
53 |
drizzle_row_t row; |
|
54 |
int x; |
|
55 |
||
1929.1.31
by Stewart Smith
fix alloc in simple_multi.c from stack usage fix |
56 |
con= (drizzle_con_st*)malloc(sizeof(drizzle_con_st) * SIMPLE_MULTI_COUNT); |
57 |
result= (drizzle_result_st*)malloc(sizeof(drizzle_result_st) * SIMPLE_MULTI_COUNT); |
|
58 |
ql= (drizzle_query_st*)malloc(sizeof(drizzle_query_st) * SIMPLE_MULTI_COUNT); |
|
1929.1.26
by Stewart Smith
fix large stack ussage of examples/simple_multi.c: |
59 |
|
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
60 |
if (drizzle_create(&drizzle) == NULL) |
61 |
{
|
|
62 |
printf("drizzle_create:NULL\n"); |
|
63 |
return 1; |
|
64 |
}
|
|
65 |
||
66 |
/* Create SIMPLE_MULTI_COUNT connections and initialize query list. */
|
|
67 |
for (x= 0; x < SIMPLE_MULTI_COUNT; x++) |
|
68 |
{
|
|
69 |
if (x == 0) |
|
70 |
{
|
|
71 |
if (drizzle_con_create(&drizzle, &(con[0])) == NULL) |
|
72 |
{
|
|
73 |
printf("drizzle_con_create:%s\n", drizzle_error(&drizzle)); |
|
74 |
return 1; |
|
75 |
}
|
|
76 |
||
77 |
if (argc == 2 && !strcmp(argv[1], "-m")) |
|
78 |
drizzle_con_add_options(&(con[0]), DRIZZLE_CON_MYSQL); |
|
79 |
else if (argc != 1) |
|
80 |
{
|
|
81 |
printf("usage: %s [-m]\n", argv[0]); |
|
82 |
return 1; |
|
83 |
}
|
|
84 |
||
85 |
drizzle_con_set_db(&(con[0]), "information_schema"); |
|
86 |
}
|
|
87 |
else
|
|
88 |
{
|
|
89 |
if (drizzle_con_clone(&drizzle, &(con[x]), &(con[0])) == NULL) |
|
90 |
{
|
|
91 |
printf("drizzle_con_clone:%s\n", drizzle_error(&drizzle)); |
|
92 |
return 1; |
|
93 |
}
|
|
94 |
}
|
|
95 |
||
96 |
if (drizzle_query_add(&drizzle, &(ql[x]), &(con[x]), &(result[x]), query, |
|
1992.6.2
by Monty Taylor
Cleaned up for additional gcc 4.5 warnings. |
97 |
strlen(query), DRIZZLE_QUERY_NONE, NULL) == NULL) |
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
98 |
{
|
99 |
printf("drizzle_query_add:%s\n", drizzle_error(&drizzle)); |
|
100 |
return 1; |
|
101 |
}
|
|
102 |
}
|
|
103 |
||
104 |
ret= drizzle_query_run_all(&drizzle); |
|
105 |
if (ret != DRIZZLE_RETURN_OK) |
|
106 |
{
|
|
107 |
printf("drizzle_query_run_all:%s\n", drizzle_error(&drizzle)); |
|
108 |
return 1; |
|
109 |
}
|
|
110 |
||
111 |
for (x= 0; x < SIMPLE_MULTI_COUNT; x++) |
|
112 |
{
|
|
113 |
if (drizzle_result_error_code(&(result[x])) != 0) |
|
114 |
{
|
|
115 |
printf("%d:%s\n", drizzle_result_error_code(&(result[x])), |
|
116 |
drizzle_result_error(&(result[x]))); |
|
117 |
continue; |
|
118 |
}
|
|
119 |
||
120 |
while ((row= drizzle_row_next(&(result[x]))) != NULL) |
|
121 |
printf("%d %s:%s\n", x, row[0], row[1]); |
|
122 |
}
|
|
123 |
||
124 |
drizzle_free(&drizzle); |
|
125 |
||
1929.1.26
by Stewart Smith
fix large stack ussage of examples/simple_multi.c: |
126 |
free(con); |
127 |
free(result); |
|
128 |
free(ql); |
|
1712.1.1
by Monty Taylor
Merged libdrizzle directly into tree. |
129 |
return 0; |
130 |
}
|