Home
last modified time | relevance | path

Searched refs:a (Results 1 – 21 of 21) sorted by relevance

/memcached-1.4.29/
H A Djenkins_hash.c81 a -= c; a ^= rot(c, 4); c += b; \
82 b -= a; b ^= rot(a, 6); a += c; \
84 a -= c; a ^= rot(c,16); c += b; \
85 b -= a; b ^= rot(a,19); a += c; \
117 a ^= c; a -= rot(c,11); \
118 b ^= a; b -= rot(a,25); \
120 a ^= c; a -= rot(c,4); \
121 b ^= a; b -= rot(a,14); \
146 a += k[0]; in jenkins_hash()
295 final(a,b,c); in jenkins_hash()
[all …]
H A Dcache.h9 #define cache_alloc(a) umem_cache_alloc(a, UMEM_DEFAULT) argument
10 #define cache_free(a, b) umem_cache_free(a, b) argument
11 #define cache_create(a,b,c,d,e) umem_cache_create((char*)a, b, c, d, e, NULL, NULL, NULL, 0) argument
12 #define cache_destroy(a) umem_cache_destroy(a); argument
H A Dsasl_defs.h20 #define sasl_server_new(a, b, c, d, e, f, g, h) 1 argument
21 #define sasl_listmech(a, b, c, d, e, f, g, h) 1 argument
22 #define sasl_server_start(a, b, c, d, e, f) 1 argument
23 #define sasl_server_step(a, b, c, d, e) 1 argument
24 #define sasl_getprop(a, b, c) {} argument
H A DDoxyfile6 # All text after a hash (#) is considered a comment and will be ignored
25 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded
92 # Doxygen will generate a detailed section even if there is only a brief
151 # treat a multi-line C++ special comment block (i.e. a block of //! or ///
153 # The new default is to treat a multi-line C++ comment block as a detailed
258 # the same type (for instance a group of public functions) to be put as a
614 # output. The symbol name can be a fully qualified name, a word, or if the
746 # In case all classes in a project start with a common prefix, all
812 # To create a documentation set, doxygen will generate a Makefile in the
869 # controls whether a binary table of contents is generated (YES) or a
[all …]
H A Dstats.c227 static void test_equals_int(char *what, int a, int b) { test_count++; if (a != b) fail(what); } in test_equals_int() argument
228 static void test_equals_ptr(char *what, void *a, void *b) { test_count++; if (a != b) fail(what); } in test_equals_ptr() argument
229 static void test_equals_str(char *what, const char *a, const char *b) { test_count++; if (strcmp(a,… in test_equals_str() argument
230 static void test_equals_ull(char *what, uint64_t a, uint64_t b) { test_count++; if (a != b) fail(wh… in test_equals_ull() argument
231 static void test_notequals_ptr(char *what, void *a, void *b) { test_count++; if (a == b) fail(what)… in test_notequals_ptr() argument
232 static void test_notnull_ptr(char *what, void *a) { test_count++; if (NULL == a) fail(what); } in test_notnull_ptr() argument
H A DHACKING12 After checking out a git repository, you must first run autogen.sh
19 Though not required, there are a couple of things you can add to git
25 before allowing a commit. To do so, add the following to
33 Because the version number changes on each commit, it's good to use a
43 By default `make test` will spawn a memcached daemon for each test.
H A DREADME.md11 If using Linux, you need a kernel with epoll. Sure, libevent will
14 epoll isn't in Linux 2.4, but there's a backport at:
23 a kqueue bug.
26 dangerous when using a large cache. Just make sure the memcached machines
H A Dconfigure.ac169 if test "$GCC" = "yes" -a "$ICC" != "yes" -a "$CLANG" != "yes"
221 # with a static version of libevent
364 dnl check if we can use a uint64_t
418 dnl Check if we're a little-endian or a big-endian system, needed by hash code
530 unsigned short a;
532 b = __sync_add_and_fetch(&a, 1);
533 b = __sync_sub_and_fetch(&a, 2);
543 uint64_t a;
545 b = __sync_add_and_fetch(&a, 1);
546 b = __sync_sub_and_fetch(&a, 2);
[all …]
H A DChangeLog75 * Use a dedicated socket accept thread (Facebook)
109 * Optimize item_alloc() a little (dormando)
168 a new option "-a" which takes an octal permission mask
296 * Use a single printf() in usage()
298 * Add a failing test for conforming with maximum connections.
460 the correct location. Trying to install the man page from a
486 other info on the same line going into a 256 byte char[].
490 * immediate deletes weren't being unlinked a few seconds,
518 allocator. really shouldn't make a difference.
578 be larger than a month)
[all …]
H A DBUILD1 Ideally, you want to make a static binary, otherwise the dynamic
31 support to actually work at runtime you need to use a kernel with epoll
H A Dmemcached.spec.in21 memcached is a high-performance, distributed memory object caching
/memcached-1.4.29/doc/
H A Dprotocol.txt15 with a very large number (many hundreds, more than a thousand if
29 of such data (either a client or a server) will always know, from a
58 key. The client sends a command line, and then a data block; after
116 case in which the server closes a connection to a client.
219 which is received as a text line followed by a data block. After all
247 deleted by a client).
297 the item. It is a decimal representation of a 64-bit unsigned integer.
552 integers separated by a colon (treat this as a floating point number).
906 wasted in a slab class. If you see a lot of waste, consider tuning
981 The intent of flush_all with a delay, was that in a setting where you
[all …]
H A DDoxyfile6 # All text after a hash (#) is considered a comment and will be ignored
25 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded
91 # Doxygen will generate a detailed section even if there is only a brief
142 # treat a multi-line C++ special comment block (i.e. a block of //! or ///
144 # The new default is to treat a multi-line C++ comment block as a detailed
163 # a new page for each member. If set to NO, the documentation of a member will
218 # the same type (for instance a group of public functions) to be put as a
555 # filter if there is a match. The filters are a list of the form:
639 # In case all classes in a project start with a common prefix, all
722 # controls whether a binary table of contents is generated (YES) or a
[all …]
H A Dthreads.txt19 thread may read or write against a particular hash table bucket.
24 system must attempt to lock the item's bucket, which is done with a trylock
25 to avoid deadlocks. If a bucket is in use (and not by that thread) it will
26 walk up the LRU a little in an attempt to fetch a non-busy item.
30 - Raw accessses to the slab class are protected by a global slabs_lock. This
31 is a short lock which covers pushing and popping free memory.
35 - ITEM_LINKED must not be set before an item has a key copied into it.
54 - If you remove the per-thread stats lock, CPU usage goes down by less than a
55 point of a percent, and it does not improve scalability.
H A DCONTRIBUTORS3 This file contains a list of people who have contributed code and
H A Dnew_lru.txt1 In versions new enough to have the `-o lru_maintainer` option, a new LRU
/memcached-1.4.29/scripts/
H A Dmemcached.service3 # way is to create a file "/etc/systemd/system/httpd.service",
18 # Set up a new file system namespace and mounts private /tmp and /var/tmp directories
29 # Sets up a new /dev namespace for the executed processes and only adds API pseudo devices
34 # Required for dropping privileges and running as a different user
H A Ddamemtop369 @newrows = sort { $a->[$colnum] <=> $b->[$colnum] } @rows;
371 @newrows = sort { $a->[$colnum] cmp $b->[$colnum] } @rows;
375 @newrows = sort { $b->[$colnum] <=> $a->[$colnum] } @rows;
377 @newrows = sort { $b->[$colnum] cmp $a->[$colnum] } @rows;
H A Dmc_slab_mover219 my @sorted = sort { $a->{evicted_d} <=> $b->{evicted_d} } values %$slabs;
233 my @sorted = sort { $a->{numratio} <=> $b->{numratio} } values %$slabs;
H A DREADME.damemtop15 If you have a large cluster and want higher performance, find
/memcached-1.4.29/m4/
H A Dc99-backport.m4159 # by trying to compile a program of TEST-PROLOGUE and TEST-BODY. If this fails,