1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
2 *
3 * Libmemcached library
4 *
5 * Copyright (C) 2011 Data Differential, http://datadifferential.com/
6 * Copyright (C) 2006-2009 Brian Aker All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are
10 * met:
11 *
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
15 * * Redistributions in binary form must reproduce the above
16 * copyright notice, this list of conditions and the following disclaimer
17 * in the documentation and/or other materials provided with the
18 * distribution.
19 *
20 * * The names of its contributors may not be used to endorse or
21 * promote products derived from this software without specific prior
22 * written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
27 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
28 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
29 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
30 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
31 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
32 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
33 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
34 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 *
36 */
37
38 #include <mem_config.h>
39
40 #include <sys/types.h>
41
42 #include <example/byteorder.h>
43
44 /* Byte swap a 64-bit number. */
45 #ifndef swap64
swap64(uint64_t in)46 static inline uint64_t swap64(uint64_t in)
47 {
48 #ifndef WORDS_BIGENDIAN
49 /* Little endian, flip the bytes around until someone makes a faster/better
50 * way to do this. */
51 uint64_t rv= 0;
52 for (uint8_t x= 0; x < 8; x++)
53 {
54 rv= (rv << 8) | (in & 0xff);
55 in >>= 8;
56 }
57 return rv;
58 #else
59 /* big-endian machines don't need byte swapping */
60 return in;
61 #endif // WORDS_BIGENDIAN
62 }
63 #endif
64
65 #ifdef HAVE_HTONLL
66
example_ntohll(uint64_t value)67 uint64_t example_ntohll(uint64_t value)
68 {
69 return ntohll(value);
70 }
71
example_htonll(uint64_t value)72 uint64_t example_htonll(uint64_t value)
73 {
74 return htonll(value);
75 }
76
77 #else // HAVE_HTONLL
78
example_ntohll(uint64_t value)79 uint64_t example_ntohll(uint64_t value)
80 {
81 return swap64(value);
82 }
83
example_htonll(uint64_t value)84 uint64_t example_htonll(uint64_t value)
85 {
86 return swap64(value);
87 }
88
89 #endif // HAVE_HTONLL
90