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 |
||
1241.9.36
by Monty Taylor
ZOMG. I deleted drizzled/server_includes.h. |
33 |
#include "config.h" |
1166.5.1
by Patrick Galbraith
Starting over with a fresh tree, moved in memcached functions. |
34 |
#include <drizzled/function/str/strfunc.h> |
35 |
||
36 |
#include "memcached_functions.h" |
|
37 |
#include "memc_increment.h" |
|
38 |
||
39 |
#include <libmemcached/memcached.h> |
|
40 |
||
41 |
#include <string> |
|
42 |
||
43 |
using namespace std; |
|
1280.1.10
by Monty Taylor
Put everything in drizzled into drizzled namespace. |
44 |
using namespace drizzled; |
1166.5.1
by Patrick Galbraith
Starting over with a fresh tree, moved in memcached functions. |
45 |
|
46 |
String *MemcachedIncrement::val_str(String *str) |
|
47 |
{
|
|
48 |
memcached_return rc; |
|
1220.3.1
by Trond Norbye
Offset to memcached_increment and decrement should be uint32_t |
49 |
uint32_t offset; |
1166.5.1
by Patrick Galbraith
Starting over with a fresh tree, moved in memcached functions. |
50 |
uint64_t value; |
51 |
size_t val_len; |
|
52 |
char tmp_buff[32]= ""; |
|
53 |
String *key; |
|
54 |
String *inc_str; |
|
55 |
||
56 |
if ((arg_count != 1 && arg_count != 2) || |
|
57 |
! (key= args[0]->val_str(str)) || |
|
58 |
! memc) |
|
59 |
{
|
|
60 |
return &failure_buff; |
|
61 |
}
|
|
62 |
||
63 |
if (arg_count == 2) { |
|
64 |
inc_str= args[1]->val_str(str); |
|
1223.1.3
by Brian Aker
Merge Trond |
65 |
offset= static_cast<uint32_t>(atoi(inc_str->c_ptr())); |
1166.5.1
by Patrick Galbraith
Starting over with a fresh tree, moved in memcached functions. |
66 |
}
|
67 |
else
|
|
68 |
{
|
|
69 |
offset= 1; |
|
70 |
}
|
|
71 |
||
72 |
||
73 |
rc= memcached_increment(memc, |
|
74 |
key->c_ptr(), |
|
75 |
key->length(), |
|
76 |
offset, |
|
77 |
&value); |
|
78 |
||
79 |
snprintf(tmp_buff, 32, "%"PRIu64, value); |
|
80 |
val_len= strlen(tmp_buff); |
|
81 |
||
82 |
if (rc != MEMCACHED_SUCCESS) |
|
83 |
{
|
|
84 |
return &failure_buff; |
|
85 |
}
|
|
86 |
||
87 |
buffer.realloc(val_len); |
|
88 |
buffer.length(val_len); |
|
89 |
memcpy(buffer.ptr(), tmp_buff, val_len); |
|
90 |
||
91 |
return &buffer; |
|
92 |
}
|
|
93 |