24 #include <aerospike/as_buffer.h>
30 #include <citrusleaf/cf_byte_order.h>
31 #include <citrusleaf/cf_digest.h>
38 #define AS_FIELD_NAMESPACE 0
39 #define AS_FIELD_SETNAME 1
40 #define AS_FIELD_KEY 2
41 #define AS_FIELD_DIGEST 4
42 #define AS_FIELD_DIGEST_ARRAY 6
43 #define AS_FIELD_TASK_ID 7
44 #define AS_FIELD_SCAN_OPTIONS 8
45 #define AS_FIELD_INDEX_RANGE 22
46 #define AS_FIELD_INDEX_FILTER 23
47 #define AS_FIELD_INDEX_LIMIT 24
48 #define AS_FIELD_INDEX_ORDER 25
49 #define AS_FIELD_INDEX_TYPE 26
50 #define AS_FIELD_UDF_PACKAGE_NAME 30
51 #define AS_FIELD_UDF_FUNCTION 31
52 #define AS_FIELD_UDF_ARGLIST 32
53 #define AS_FIELD_UDF_OP 33
54 #define AS_FIELD_QUERY_BINS 40
57 #define AS_MSG_INFO1_READ (1 << 0) // contains a read operation
58 #define AS_MSG_INFO1_GET_ALL (1 << 1) // get all bins, period
61 #define AS_MSG_INFO1_XDR (1 << 4) // operation is being performed by XDR
62 #define AS_MSG_INFO1_GET_NOBINDATA (1 << 5) // do not get information about bins and its data
63 #define AS_MSG_INFO1_CONSISTENCY_ALL (1 << 6) // read consistency level - bit 0
67 #define AS_MSG_INFO2_WRITE (1 << 0) // contains a write semantic
68 #define AS_MSG_INFO2_DELETE (1 << 1) // delete record
69 #define AS_MSG_INFO2_GENERATION (1 << 2) // pay attention to the generation
70 #define AS_MSG_INFO2_GENERATION_GT (1 << 3) // apply write if new generation >= old, good for restore
72 #define AS_MSG_INFO2_CREATE_ONLY (1 << 5) // write record only if it doesn't exist
77 #define AS_MSG_INFO3_LAST (1 << 0) // this is the last of a multi-part message
78 #define AS_MSG_INFO3_COMMIT_MASTER (1 << 1) // write commit level - bit 0
80 #define AS_MSG_INFO3_UPDATE_ONLY (1 << 3) // update existing record only, do not create new record
81 #define AS_MSG_INFO3_CREATE_OR_REPLACE (1 << 4) // completely replace existing record, or create new record
82 #define AS_MSG_INFO3_REPLACE_ONLY (1 << 5) // completely replace existing record, do not create new record
87 #define AS_MESSAGE_VERSION 2L
88 #define AS_MESSAGE_TYPE 3L
91 #define AS_INFO_MESSAGE_VERSION 2L
92 #define AS_INFO_MESSAGE_TYPE 1L
95 #define AS_HEADER_SIZE 30
96 #define AS_FIELD_HEADER_SIZE 5
97 #define AS_OPERATION_HEADER_SIZE 8
99 #define AS_STACK_BUF_SIZE (1024 * 16)
105 #define as_command_init(_sz) (_sz > AS_STACK_BUF_SIZE)? (uint8_t*)cf_malloc(_sz) : (uint8_t*)alloca(_sz)
111 #define as_command_free(_buf, _sz) if (_sz > AS_STACK_BUF_SIZE) {cf_free(_buf);}
121 typedef struct as_command_node_s {
148 return strlen(key->
ns) + strlen(key->
set) +
sizeof(cf_digest) + 45;
202 size_t s = strlen(name);
229 uint32_t timeout_ms, uint16_t
n_fields, uint16_t n_bins);
235 static inline uint8_t*
237 uint32_t timeout_ms, uint16_t
n_fields, uint16_t n_bins)
245 memset(&cmd[10], 0, 12);
246 *(uint32_t*)&cmd[22] = cf_swap_to_be32(timeout_ms);
247 *(uint16_t*)&cmd[26] = cf_swap_to_be16(n_fields);
248 *(uint16_t*)&cmd[28] = cf_swap_to_be16(n_bins);
256 static inline uint8_t*
259 *(uint32_t*)p = cf_swap_to_be32(size+1);
269 static inline uint8_t*
286 static inline uint8_t*
290 *(uint64_t*)p = cf_swap_to_be64(val);
291 return p +
sizeof(uint64_t);
298 static inline uint8_t*
302 memcpy(p, buffer->data, buffer->size);
303 return p + buffer->size;
310 static inline uint8_t*
322 static inline uint8_t*
342 static inline uint8_t*
352 *(uint32_t*)cmd = cf_swap_to_be32((uint32_t)name_len + 4);
375 uint64_t len = end - begin;
377 *(uint64_t*)begin = cf_swap_to_be64(proto);