~drizzle-trunk/drizzle/development : contents of examples/simple

~drizzle-trunk/drizzle/development : (revision 2261)

/*
 * Drizzle Client & Protocol Library
 *
 * Copyright (C) 2008 Eric Day (eday@oddments.org)
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *
 *     * Redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer.
 *
 *     * Redistributions in binary form must reproduce the above
 * copyright notice, this list of conditions and the following disclaimer
 * in the documentation and/or other materials provided with the
 * distribution.
 *
 *     * The names of its contributors may not be used to endorse or
 * promote products derived from this software without specific prior
 * written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */


#include <config.h>

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#include <libdrizzle/drizzle_client.h>

#define SIMPLE_MULTI_COUNT 10

int main(int argc, char *argv[])
{
  const char *query= "SELECT table_schema,table_name FROM tables";
  drizzle_st drizzle;
  drizzle_con_st *con;
  drizzle_result_st *result;
  drizzle_query_st *ql;
  drizzle_return_t ret;
  drizzle_row_t row;
  int x;

  con= (drizzle_con_st*)malloc(sizeof(drizzle_con_st) * SIMPLE_MULTI_COUNT);
  result= (drizzle_result_st*)malloc(sizeof(drizzle_result_st) * SIMPLE_MULTI_COUNT);
  ql= (drizzle_query_st*)malloc(sizeof(drizzle_query_st) * SIMPLE_MULTI_COUNT);

  if (drizzle_create(&drizzle) == NULL)
  {
    printf("drizzle_create:NULL\n");
    return 1;
  }

  /* Create SIMPLE_MULTI_COUNT connections and initialize query list. */
  for (x= 0; x < SIMPLE_MULTI_COUNT; x++)
  {
    if (x == 0)
    {
      if (drizzle_con_create(&drizzle, &(con[0])) == NULL)
      {
        printf("drizzle_con_create:%s\n", drizzle_error(&drizzle));
        return 1;
      }

      if (argc == 2 && !strcmp(argv[1], "-m"))
        drizzle_con_add_options(&(con[0]), DRIZZLE_CON_MYSQL);
      else if (argc != 1)
      {
        printf("usage: %s [-m]\n", argv[0]);
        return 1;
      }

      drizzle_con_set_db(&(con[0]), "information_schema");
    }
    else
    {
      if (drizzle_con_clone(&drizzle, &(con[x]), &(con[0])) == NULL)
      {
        printf("drizzle_con_clone:%s\n", drizzle_error(&drizzle));
        return 1;
      }
    }

    if (drizzle_query_add(&drizzle, &(ql[x]), &(con[x]), &(result[x]), query,
                          strlen(query), DRIZZLE_QUERY_NONE, NULL) == NULL)
    {
      printf("drizzle_query_add:%s\n", drizzle_error(&drizzle));
      return 1;
    }
  }

  ret= drizzle_query_run_all(&drizzle);
  if (ret != DRIZZLE_RETURN_OK)
  {
    printf("drizzle_query_run_all:%s\n", drizzle_error(&drizzle));
    return 1;
  }

  for (x= 0; x < SIMPLE_MULTI_COUNT; x++)
  {
    if (drizzle_result_error_code(&(result[x])) != 0)
    {
      printf("%d:%s\n", drizzle_result_error_code(&(result[x])),
             drizzle_result_error(&(result[x])));
      continue;
    }

    while ((row= drizzle_row_next(&(result[x]))) != NULL)
      printf("%d %s:%s\n", x, row[0], row[1]);
  }

  drizzle_free(&drizzle);

  free(con);
  free(result);
  free(ql);
  return 0;
}

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
1971.2.1 by kalebral at gmail update files that did not have license or had incorrect license structure	37
2173.2.1 by Monty Taylor Fixes incorrect usage of include	38	#include <config.h>
2164.1.1 by Monty Taylor Merged in outstanding changes from the win32 work.	39
1712.1.1 by Monty Taylor Merged libdrizzle directly into tree.	40	#include <stdio.h>
	41	#include <string.h>
1929.1.30 by Stewart Smith fix missing include in simple_multi.c	42	#include <stdlib.h>
1712.1.1 by Monty Taylor Merged libdrizzle directly into tree.	43
	44	#include <libdrizzle/drizzle_client.h>
	45
	46	#define SIMPLE_MULTI_COUNT 10
	47
	48	int main(int argc, char *argv[])
	49	{
	50	const char *query= "SELECT table_schema,table_name FROM tables";
	51	drizzle_st drizzle;
1929.1.28 by Stewart Smith fix simple_multi stack size fix	52	drizzle_con_st *con;
	53	drizzle_result_st *result;
	54	drizzle_query_st *ql;
1712.1.1 by Monty Taylor Merged libdrizzle directly into tree.	55	drizzle_return_t ret;
	56	drizzle_row_t row;
	57	int x;
	58
1929.1.31 by Stewart Smith fix alloc in simple_multi.c from stack usage fix	59	con= (drizzle_con_st)malloc(sizeof(drizzle_con_st) SIMPLE_MULTI_COUNT);
	60	result= (drizzle_result_st)malloc(sizeof(drizzle_result_st) SIMPLE_MULTI_COUNT);
	61	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:	62
1712.1.1 by Monty Taylor Merged libdrizzle directly into tree.	63	if (drizzle_create(&drizzle) == NULL)
	64	{
	65	printf("drizzle_create:NULL\n");
	66	return 1;
	67	}
	68
	69	/* Create SIMPLE_MULTI_COUNT connections and initialize query list. */
	70	for (x= 0; x < SIMPLE_MULTI_COUNT; x++)
	71	{
	72	if (x == 0)
	73	{
	74	if (drizzle_con_create(&drizzle, &(con[0])) == NULL)
	75	{
	76	printf("drizzle_con_create:%s\n", drizzle_error(&drizzle));
	77	return 1;
	78	}
	79
	80	if (argc == 2 && !strcmp(argv[1], "-m"))
	81	drizzle_con_add_options(&(con[0]), DRIZZLE_CON_MYSQL);
	82	else if (argc != 1)
	83	{
	84	printf("usage: %s [-m]\n", argv[0]);
	85	return 1;
	86	}
	87
	88	drizzle_con_set_db(&(con[0]), "information_schema");
	89	}
	90	else
	91	{
	92	if (drizzle_con_clone(&drizzle, &(con[x]), &(con[0])) == NULL)
	93	{
	94	printf("drizzle_con_clone:%s\n", drizzle_error(&drizzle));
	95	return 1;
	96	}
	97	}
	98
	99	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.	100	strlen(query), DRIZZLE_QUERY_NONE, NULL) == NULL)
1712.1.1 by Monty Taylor Merged libdrizzle directly into tree.	101	{
	102	printf("drizzle_query_add:%s\n", drizzle_error(&drizzle));
	103	return 1;
	104	}
	105	}
	106
	107	ret= drizzle_query_run_all(&drizzle);
	108	if (ret != DRIZZLE_RETURN_OK)
	109	{
	110	printf("drizzle_query_run_all:%s\n", drizzle_error(&drizzle));
	111	return 1;
	112	}
	113
	114	for (x= 0; x < SIMPLE_MULTI_COUNT; x++)
	115	{
	116	if (drizzle_result_error_code(&(result[x])) != 0)
	117	{
	118	printf("%d:%s\n", drizzle_result_error_code(&(result[x])),
	119	drizzle_result_error(&(result[x])));
	120	continue;
	121	}
	122
	123	while ((row= drizzle_row_next(&(result[x]))) != NULL)
	124	printf("%d %s:%s\n", x, row[0], row[1]);
	125	}
	126
	127	drizzle_free(&drizzle);
	128
1929.1.26 by Stewart Smith fix large stack ussage of examples/simple_multi.c:	129	free(con);
	130	free(result);
	131	free(ql);
1712.1.1 by Monty Taylor Merged libdrizzle directly into tree.	132	return 0;
	133	}