goto memory_error;
}
- memset(stringify->space.start, ' ', indent);
+ nxt_memset(stringify->space.start, ' ', indent);
if (nxt_array_init(&stringify->stack, NULL, 4, sizeof(njs_json_state_t),
&njs_array_mem_proto, vm->mem_cache_pool)
memcpy(start, string.start, string.size);
if (nargs == 2) {
- memset(p, ' ', padding);
+ nxt_memset(p, ' ', padding);
} else if (pad_string.size == 1) {
- memset(p, pad_string.start[0], padding);
+ nxt_memset(p, pad_string.start[0], padding);
} else {
while (n != 0) {
/* 1234e7 -> 12340000000 */
if (kk - length > 0) {
- memset(&start[length], '0', kk - length);
+ nxt_memset(&start[length], '0', kk - length);
}
return kk;
start[1] = '.';
if (offset - 2 > 0) {
- memset(&start[2], '0', offset - 2);
+ nxt_memset(&start[2], '0', offset - 2);
}
return (length + offset);
#define nxt_mem_cache_free_junk(p, size) \
- memset((p), 0x5A, size)
+ nxt_memset((p), 0x5A, size)
#define nxt_is_power_of_two(value) \
#define nxt_cpymem(dst, src, n) (((u_char *) memcpy(dst, src, n)) + (n))
+#define nxt_memset(buf, c, length) (void) (memset(buf, c, length))
+
+
#define nxt_memzero(buf, length) (void) (memset(buf, 0, length))
#include <nxt_types.h>
#include <nxt_clang.h>
#include <nxt_stub.h>
+#include <nxt_string.h>
#include <nxt_rbtree.h>
#include <nxt_murmur_hash.h>
#include <stdio.h>
for (i = 0; i < n; i++) {
nxt_rbtree_delete(&tree, &items[i].node);
- memset(&items[i], 0xA5, sizeof(nxt_rbtree_test_t));
+ nxt_memset(&items[i], 0xA5, sizeof(nxt_rbtree_test_t));
}
if (!nxt_rbtree_is_empty(&tree)) {