1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
5 * Copyright (C) 2012 Data Differential, http://datadifferential.com/
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
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
19 * * The names of its contributors may not be used to endorse or
20 * promote products derived from this software without specific prior
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.
42 #include <libtest/test.hpp>
44 #include <libmemcached-1.0/memcached.h>
45 #include <libmemcached/util.h>
47 using namespace libtest
;
49 #include "tests/libmemcached-1.0/dump.h"
51 static memcached_return_t
callback_dump_counter(const memcached_st
*,
56 size_t *counter
= (size_t *)context
;
59 std::cerr
.write(key
, length
);
60 std::cerr
<< std::endl
;
63 *counter
= *counter
+1;
65 return MEMCACHED_SUCCESS
;
68 static memcached_return_t
item_counter(memcached_server_instance_st
,
69 const char *key
, size_t key_length
,
70 const char *value
, size_t, // value_length,
73 if ((key_length
== (sizeof("curr_items") -1)) and (strncmp("curr_items", key
, (sizeof("curr_items") -1)) == 0))
75 uint64_t* counter
= (uint64_t*)context
;
76 unsigned long number_value
= strtoul(value
, (char **)NULL
, 10);
77 if (number_value
== ULONG_MAX
)
79 return MEMCACHED_FAILURE
;
81 *counter
= *counter
+number_value
;
84 return MEMCACHED_SUCCESS
;
88 test_return_t
memcached_dump_TEST(memcached_st
*memc
)
90 test_skip(false, memcached_behavior_get(memc
, MEMCACHED_BEHAVIOR_BINARY_PROTOCOL
));
93 memcached_dump_fn callbacks
[1];
94 callbacks
[0]= &callback_dump_counter
;
97 test_compare_got(MEMCACHED_SUCCESS
,
98 memcached_stat_execute(memc
, NULL
, item_counter
, &counter
),
99 memcached_last_error_message(memc
));
102 test_compare_got(MEMCACHED_SUCCESS
, memcached_dump(memc
, callbacks
, &count
, 1), memcached_last_error_message(memc
));
108 #define memcached_dump_TEST2_COUNT 64
109 test_return_t
memcached_dump_TEST2(memcached_st
*memc
)
111 test_skip(false, memcached_behavior_get(memc
, MEMCACHED_BEHAVIOR_BINARY_PROTOCOL
));
113 /* The dump test relies on there being at least 32 items in memcached */
114 for (uint32_t x
= 0; x
< memcached_dump_TEST2_COUNT
; x
++)
118 int length
= snprintf(key
, sizeof(key
), "%s%u", __func__
, x
);
120 test_true(length
> 0);
122 test_compare(MEMCACHED_SUCCESS
,
123 memcached_set(memc
, key
, length
,
124 NULL
, 0, // Zero length values
125 time_t(0), uint32_t(0)));
127 memcached_quit(memc
);
130 test_compare(MEMCACHED_SUCCESS
,
131 memcached_stat_execute(memc
, NULL
, item_counter
, &counter
));
132 test_true(counter
> 0);
135 memcached_dump_fn callbacks
[1];
136 callbacks
[0]= &callback_dump_counter
;
138 test_compare(MEMCACHED_SUCCESS
,
139 memcached_dump(memc
, callbacks
, &count
, 1));