Update for ifdef for clang. Also fix a bad operation comparison.
[m6w6/libmemcached] / tests / keys.hpp
1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
2 *
3 * Libmemcached library
4 *
5 * Copyright (C) 2012 Data Differential, http://datadifferential.com/
6 *
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 *
35 */
36
37
38
39 struct keys_st {
40 public:
41 keys_st(size_t arg)
42 {
43 init(arg, UUID_STRING_MAXLENGTH);
44 }
45
46 keys_st(size_t arg, size_t padding)
47 {
48 init(arg, padding);
49 }
50
51 void init(size_t arg, size_t padding)
52 {
53 _lengths.resize(arg);
54 _keys.resize(arg);
55
56 for (size_t x= 0; x < _keys.size(); x++)
57 {
58 libtest::vchar_t key_buffer;
59 key_buffer.resize(padding +1);
60 memset(&key_buffer[0], 'x', padding);
61
62 if (HAVE_LIBUUID)
63 {
64 #if defined(HAVE_LIBUUID) && HAVE_LIBUUID
65 uuid_t out;
66 uuid_generate(out);
67
68 uuid_unparse(out, &key_buffer[0]);
69 _keys[x]= strdup(&key_buffer[0]);
70 (_keys[x])[UUID_STRING_MAXLENGTH]= 'x';
71 #endif
72 }
73 else // We just use a number and pad the string if UUID is not available
74 {
75 char int_buffer[MEMCACHED_MAXIMUM_INTEGER_DISPLAY_LENGTH +1];
76 int key_length= snprintf(int_buffer, sizeof(int_buffer), "%u", uint32_t(x));
77 memcpy(&key_buffer[0], int_buffer, key_length);
78 _keys[x]= strdup(&key_buffer[0]);
79 }
80 _lengths[x]= padding;
81 }
82 }
83
84 ~keys_st()
85 {
86 for (libtest::vchar_ptr_t::iterator iter= _keys.begin();
87 iter != _keys.end();
88 ++iter)
89 {
90 ::free(*iter);
91 }
92 }
93
94 libtest::vchar_ptr_t::iterator begin()
95 {
96 return _keys.begin();
97 }
98
99 libtest::vchar_ptr_t::iterator end()
100 {
101 return _keys.end();
102 }
103
104 size_t size() const
105 {
106 return _keys.size();
107 }
108
109 std::vector<size_t>& lengths()
110 {
111 return _lengths;
112 }
113
114 libtest::vchar_ptr_t& keys()
115 {
116 return _keys;
117 }
118
119 size_t* lengths_ptr()
120 {
121 return &_lengths[0];
122 }
123
124 char** keys_ptr()
125 {
126 return &_keys[0];
127 }
128
129 char* key_at(size_t arg)
130 {
131 return _keys[arg];
132 }
133
134 size_t length_at(size_t arg)
135 {
136 return _lengths[arg];
137 }
138
139 private:
140 libtest::vchar_ptr_t _keys;
141 std::vector<size_t> _lengths;
142 };