Drizzled Public API Documentation

memc_stats.cc
1 /* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2  * vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
3  *
4  * Copyright (C) 2009, Patrick "CaptTofu" Galbraith, Padraig O'Sullivan
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions are met:
9  *
10  * * Redistributions of source code must retain the above copyright notice,
11  * this list of conditions and the following disclaimer.
12  * * Redistributions in binary form must reproduce the above copyright notice,
13  * this list of conditions and the following disclaimer in the documentation
14  * and/or other materials provided with the distribution.
15  * * Neither the name of Patrick Galbraith nor the names of its contributors
16  * may be used to endorse or promote products derived from this software
17  * without specific prior written permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
23  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
29  * THE POSSIBILITY OF SUCH DAMAGE.
30  */
31 
32 #include <config.h>
33 #include <drizzled/item/func.h>
34 #include <drizzled/function/str/strfunc.h>
35 
36 #include "memcached_functions.h"
37 #include "memc_stats.h"
38 
39 #include <libmemcached/memcached.h>
40 
41 #include <string>
42 #include <algorithm>
43 
44 using namespace std;
45 using namespace drizzled;
46 
47 void MemcachedStats::setFailureString(const char *error)
48 {
49  size_t size= strlen(error);
50  failure_buff.realloc(size);
51  failure_buff.length(size);
52  memcpy(failure_buff.ptr(), error, size);
53 }
54 
56 {
57  memcached_return rc;
58  unsigned int count;
59  char buff[100];
60  memcached_stat_st *stat;
61  memcached_server_st *servers;
62  memcached_server_st *server_list;
63  String *server_names;
64 
65 
66  if (arg_count != 1 ||
67  ! (server_names= args[0]->val_str(str)) ||
68  ! memc)
69  {
70  setFailureString("USAGE: memc_stats('<server list>')");
71  return &failure_buff;
72  }
73 
74  servers= memcached_servers_parse(server_names->c_ptr());
75  if (servers == NULL)
76  {
77  setFailureString(" ERROR: unable to parse servers string!");
78  return &failure_buff;
79  }
80  memcached_server_push(memc, servers);
81  memcached_server_list_free(servers);
82 
83  stat= memcached_stat(memc, NULL, &rc);
84 
85  if (rc != MEMCACHED_SUCCESS && rc != MEMCACHED_SOME_ERRORS)
86  {
87  snprintf(buff, 100, "Failure to communicate with servers (%s)\n",
88  memcached_strerror(memc, rc));
89 
90  setFailureString(buff);
91  return &failure_buff;
92  }
93 
94  server_list= memcached_server_list(memc);
95 
96  results_buff.length(0);
97  snprintf(buff, 100, "Listing %u Server\n\n", memcached_server_count(memc));
98  results_buff.append(buff);
99 
100  for (count= 0; count < memcached_server_count(memc); count++)
101  {
102  char **list;
103  char **ptr;
104 
105  list= memcached_stat_get_keys(memc, &stat[count], &rc);
106 
107  snprintf(buff, 100, "Server: %s (%u)\n",
108  memcached_server_name(memc, server_list[count]),
109  memcached_server_port(memc, server_list[count]));
110 
111 
112  results_buff.append(buff);
113 
114  for (ptr= list; *ptr; ptr++)
115  {
116  char *value= memcached_stat_get_value(memc, &stat[count], *ptr, &rc);
117 
118  snprintf(buff, 100, "\t %s: %s\n", *ptr, value);
119  free(value);
120  results_buff.append(buff);
121  }
122 
123  free(list);
124  results_buff.append("\n");
125  }
126 
127  free(stat);
128 
129  return &results_buff;
130 
131 }