~drizzle-trunk/drizzle/development

1166.5.1 by Patrick Galbraith
Starting over with a fresh tree, moved in memcached functions.
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 <drizzled/server_includes.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
46
void MemcachedStats::setFailureString(const char *error)
47
{
48
  size_t size= strlen(error);
49
  failure_buff.realloc(size);
50
  failure_buff.length(size);
51
  memcpy(failure_buff.ptr(), error, size);
52
}
53
54
String *MemcachedStats::val_str(String *str)
55
{
56
  memcached_return rc;
57
  unsigned int count;
58
  char buff[100];
59
  memcached_stat_st *stat;
60
  memcached_server_st *servers;
61
  memcached_server_st *server_list;
62
  String *server_names;
63
64
65
  if (arg_count != 1 ||
66
      ! (server_names= args[0]->val_str(str)) ||
67
      ! memc)
68
  {
69
    setFailureString("USAGE: memc_stats('<server list>')");
70
    return &failure_buff;
71
  }
72
73
  servers= memcached_servers_parse(server_names->c_ptr());
74
  if (servers == NULL)
75
  {
76
    setFailureString(" ERROR: unable to parse servers string!");
77
    return &failure_buff;
78
  }
79
  memcached_server_push(memc, servers);
80
  memcached_server_list_free(servers);
81
82
  stat= memcached_stat(memc, NULL, &rc);
83
84
  if (rc != MEMCACHED_SUCCESS && rc != MEMCACHED_SOME_ERRORS)
85
  {
86
    snprintf(buff, 100, "Failure to communicate with servers (%s)\n",
87
            memcached_strerror(memc, rc));
88
89
    setFailureString(buff);
90
    return &failure_buff;
91
  }
92
93
  server_list= memcached_server_list(memc);
94
95
  results_buff.length(0);
96
  snprintf(buff, 100, "Listing %u Server\n\n", memcached_server_count(memc));
97
  results_buff.append(buff);
98
99
  for (count= 0; count < memcached_server_count(memc); count++)
100
  {
101
    char **list;
102
    char **ptr;
103
104
    list= memcached_stat_get_keys(memc, &stat[count], &rc);
105
106
    snprintf(buff, 100, "Server: %s (%u)\n",
107
            memcached_server_name(memc, server_list[count]),
108
            memcached_server_port(memc, server_list[count]));
109
110
111
    results_buff.append(buff);
112
113
    for (ptr= list; *ptr; ptr++)
114
    {
115
      char *value= memcached_stat_get_value(memc, &stat[count], *ptr, &rc);
116
117
      snprintf(buff, 100, "\t %s: %s\n", *ptr, value);
118
      free(value);
119
      results_buff.append(buff);
120
    }
121
122
    free(list);
123
    results_buff.append("\n");
124
  }
125
126
  free(stat);
127
128
  return &results_buff;
129
130
}