nvml-sys 0.0.6

A low-level FFI wrapper around the Persistent Memory Development Kit, PMDK (formerly NVML) and its libraries, including libpmem, libpmemobj and others. Currently tracks master after version 1.3.1.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130

/*
 * Copyright 2014-2017, Intel Corporation
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in
 *       the documentation and/or other materials provided with the
 *       distribution.
 *
 *     * Neither the name of the copyright holder nor the names of its
 *       contributors may be used to endorse or promote products derived
 *       from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

/*
 * vmmalloc_memalign.c -- unit test for libvmmalloc memalign, posix_memalign
 * and aligned_alloc (if available)
 *
 * usage: vmmalloc_memalign [m|p|a]
 */

#include <stdlib.h>
#include <errno.h>
#include "unittest.h"
#include "vmmalloc_dummy_funcs.h"

#define USAGE "usage: %s [m|p|a]"

#define MIN_ALIGN (2)
#define MAX_ALIGN (4L * 1024L * 1024L)
#define MAX_ALLOCS (100)

/* buffer for all allocations */
static int *allocs[MAX_ALLOCS];

static void *(*Aalloc)(size_t alignment, size_t size);

static void *
posix_memalign_wrap(size_t alignment, size_t size)
{
	void *ptr;
	int err = posix_memalign(&ptr, alignment, size);
	/* ignore OOM */
	if (err) {
		char buff[UT_MAX_ERR_MSG];
		ptr = NULL;
		ut_strerror(err, buff, UT_MAX_ERR_MSG);
		if (err != ENOMEM)
			UT_OUT("posix_memalign: %s", buff);
	}
	return ptr;
}

int
main(int argc, char *argv[])
{
	const int test_value = 123456;
	size_t alignment;
	int i;

	START(argc, argv, "vmmalloc_memalign");

	if (argc != 2)
		UT_FATAL(USAGE, argv[0]);

	switch (argv[1][0]) {
	case 'm':
		UT_OUT("testing memalign");
		Aalloc = memalign;
		break;
	case 'p':
		UT_OUT("testing posix_memalign");
		Aalloc = posix_memalign_wrap;
		break;
	case 'a':
		UT_OUT("testing aligned_alloc");
		Aalloc = aligned_alloc;
		break;
	default:
		UT_FATAL(USAGE, argv[0]);
	}

	/* test with address alignment from 2B to 4MB */
	for (alignment = MAX_ALIGN; alignment >= MIN_ALIGN; alignment /= 2) {
		UT_OUT("alignment %zu", alignment);

		memset(allocs, 0, sizeof(allocs));

		for (i = 0; i < MAX_ALLOCS; ++i) {
			allocs[i] = Aalloc(alignment, sizeof(int));

			if (allocs[i] == NULL)
				break;

			/* ptr should be usable */
			*allocs[i] = test_value;
			UT_ASSERTeq(*allocs[i], test_value);

			/* check for correct address alignment */
			UT_ASSERTeq(
				(uintptr_t)(allocs[i]) & (alignment - 1), 0);
		}

		/* at least one allocation must succeed */
		UT_ASSERT(i > 0);

		for (i = 0; i < MAX_ALLOCS && allocs[i] != NULL; ++i)
			free(allocs[i]);
	}

	DONE(NULL);
}