Move and hide new 'lttng_counter_transport_*' private symbols
[deliverable/lttng-ust.git] / libringbuffer / shm.c
CommitLineData
1d498196
MD
1/*
2 * libringbuffer/shm.c
3 *
e92f3e28 4 * Copyright (C) 2005-2012 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
1d498196 5 *
e92f3e28
MD
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; only
9 * version 2.1 of the License.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
1d498196
MD
19 */
20
3fbec7dc 21#define _LGPL_SOURCE
1d498196
MD
22#include "shm.h"
23#include <unistd.h>
24#include <fcntl.h>
25#include <sys/mman.h>
a9ff648c 26#include <sys/types.h>
1d498196
MD
27#include <sys/stat.h> /* For mode constants */
28#include <fcntl.h> /* For O_* constants */
29#include <assert.h>
8da6cd6d
MD
30#include <stdio.h>
31#include <signal.h>
32#include <dirent.h>
4318ae1b 33#include <lttng/align.h>
96e80018 34#include <limits.h>
8a208943 35#include <stdbool.h>
fb31eb73 36#include <stdint.h>
bfcda6ce 37#ifdef HAVE_LIBNUMA
4b68c31f 38#include <numa.h>
8a208943 39#include <numaif.h>
bfcda6ce 40#endif
3a81f31d 41#include <helper.h>
6548fca4 42#include <ust-fd.h>
4d4838ba 43#include "mmap.h"
3a81f31d
MD
44
45/*
46 * Ensure we have the required amount of space available by writing 0
47 * into the entire buffer. Not doing so can trigger SIGBUS when going
48 * beyond the available shm space.
49 */
50static
51int zero_file(int fd, size_t len)
52{
53 ssize_t retlen;
54 size_t written = 0;
55 char *zeropage;
56 long pagelen;
57 int ret;
58
59 pagelen = sysconf(_SC_PAGESIZE);
60 if (pagelen < 0)
61 return (int) pagelen;
62 zeropage = calloc(pagelen, 1);
63 if (!zeropage)
64 return -ENOMEM;
65
66 while (len > written) {
67 do {
68 retlen = write(fd, zeropage,
69 min_t(size_t, pagelen, len - written));
70 } while (retlen == -1UL && errno == EINTR);
71 if (retlen < 0) {
72 ret = (int) retlen;
73 goto error;
74 }
75 written += retlen;
76 }
77 ret = 0;
78error:
79 free(zeropage);
80 return ret;
81}
1d498196
MD
82
83struct shm_object_table *shm_object_table_create(size_t max_nb_obj)
84{
85 struct shm_object_table *table;
86
87 table = zmalloc(sizeof(struct shm_object_table) +
88 max_nb_obj * sizeof(table->objects[0]));
74d48abe
MD
89 if (!table)
90 return NULL;
1d498196
MD
91 table->size = max_nb_obj;
92 return table;
93}
94
74d81a6c
MD
95static
96struct shm_object *_shm_object_table_alloc_shm(struct shm_object_table *table,
a9ff648c 97 size_t memory_map_size,
5ea386c3 98 int stream_fd)
1d498196 99{
5ea386c3 100 int shmfd, waitfd[2], ret, i;
1d498196
MD
101 struct shm_object *obj;
102 char *memory_map;
103
5ea386c3
MD
104 if (stream_fd < 0)
105 return NULL;
1d498196
MD
106 if (table->allocated_len >= table->size)
107 return NULL;
7a9c21bd 108 obj = &table->objects[table->allocated_len];
1d498196
MD
109
110 /* wait_fd: create pipe */
111 ret = pipe(waitfd);
112 if (ret < 0) {
113 PERROR("pipe");
114 goto error_pipe;
115 }
116 for (i = 0; i < 2; i++) {
117 ret = fcntl(waitfd[i], F_SETFD, FD_CLOEXEC);
118 if (ret < 0) {
119 PERROR("fcntl");
120 goto error_fcntl;
121 }
122 }
5d61a504
MD
123 /* The write end of the pipe needs to be non-blocking */
124 ret = fcntl(waitfd[1], F_SETFL, O_NONBLOCK);
125 if (ret < 0) {
126 PERROR("fcntl");
127 goto error_fcntl;
128 }
7a9c21bd 129 memcpy(obj->wait_fd, waitfd, sizeof(waitfd));
1d498196 130
053e6e24
MJ
131 /*
132 * Set POSIX shared memory object size
133 *
134 * First, use ftruncate() to set its size, some implementations won't
135 * allow writes past the size set by ftruncate.
136 * Then, use write() to fill it with zeros, this allows us to fully
137 * allocate it and detect a shortage of shm space without dealing with
138 * a SIGBUS.
139 */
a9ff648c 140
5ea386c3 141 shmfd = stream_fd;
1d498196
MD
142 ret = ftruncate(shmfd, memory_map_size);
143 if (ret) {
144 PERROR("ftruncate");
145 goto error_ftruncate;
146 }
053e6e24
MJ
147 ret = zero_file(shmfd, memory_map_size);
148 if (ret) {
149 PERROR("zero_file");
150 goto error_zero_file;
151 }
71be0c53 152
d0f6cf57
MD
153 /*
154 * Also ensure the file metadata is synced with the storage by using
71be0c53
MJ
155 * fsync(2). Some platforms don't allow fsync on POSIX shm fds, ignore
156 * EINVAL accordingly.
d0f6cf57
MD
157 */
158 ret = fsync(shmfd);
71be0c53 159 if (ret && errno != EINVAL) {
d0f6cf57
MD
160 PERROR("fsync");
161 goto error_fsync;
162 }
5ea386c3 163 obj->shm_fd_ownership = 0;
1d498196
MD
164 obj->shm_fd = shmfd;
165
166 /* memory_map: mmap */
167 memory_map = mmap(NULL, memory_map_size, PROT_READ | PROT_WRITE,
4d4838ba 168 MAP_SHARED | LTTNG_MAP_POPULATE, shmfd, 0);
1d498196
MD
169 if (memory_map == MAP_FAILED) {
170 PERROR("mmap");
171 goto error_mmap;
172 }
74d81a6c 173 obj->type = SHM_OBJECT_SHM;
1d498196
MD
174 obj->memory_map = memory_map;
175 obj->memory_map_size = memory_map_size;
176 obj->allocated_len = 0;
dc613eb9 177 obj->index = table->allocated_len++;
7a9c21bd 178
1d498196
MD
179 return obj;
180
181error_mmap:
d0f6cf57 182error_fsync:
1d498196 183error_ftruncate:
3a81f31d 184error_zero_file:
1d498196
MD
185error_fcntl:
186 for (i = 0; i < 2; i++) {
187 ret = close(waitfd[i]);
188 if (ret) {
189 PERROR("close");
190 assert(0);
191 }
192 }
193error_pipe:
1d498196 194 return NULL;
1d498196
MD
195}
196
74d81a6c
MD
197static
198struct shm_object *_shm_object_table_alloc_mem(struct shm_object_table *table,
199 size_t memory_map_size)
200{
201 struct shm_object *obj;
202 void *memory_map;
ff0f5728 203 int waitfd[2], i, ret;
74d81a6c
MD
204
205 if (table->allocated_len >= table->size)
206 return NULL;
207 obj = &table->objects[table->allocated_len];
208
209 memory_map = zmalloc(memory_map_size);
210 if (!memory_map)
211 goto alloc_error;
212
ff0f5728
MD
213 /* wait_fd: create pipe */
214 ret = pipe(waitfd);
215 if (ret < 0) {
216 PERROR("pipe");
217 goto error_pipe;
218 }
219 for (i = 0; i < 2; i++) {
220 ret = fcntl(waitfd[i], F_SETFD, FD_CLOEXEC);
221 if (ret < 0) {
222 PERROR("fcntl");
223 goto error_fcntl;
224 }
225 }
226 /* The write end of the pipe needs to be non-blocking */
227 ret = fcntl(waitfd[1], F_SETFL, O_NONBLOCK);
228 if (ret < 0) {
229 PERROR("fcntl");
230 goto error_fcntl;
231 }
232 memcpy(obj->wait_fd, waitfd, sizeof(waitfd));
233
234 /* no shm_fd */
74d81a6c 235 obj->shm_fd = -1;
5ea386c3 236 obj->shm_fd_ownership = 0;
74d81a6c
MD
237
238 obj->type = SHM_OBJECT_MEM;
239 obj->memory_map = memory_map;
240 obj->memory_map_size = memory_map_size;
241 obj->allocated_len = 0;
242 obj->index = table->allocated_len++;
243
244 return obj;
245
ff0f5728
MD
246error_fcntl:
247 for (i = 0; i < 2; i++) {
248 ret = close(waitfd[i]);
249 if (ret) {
250 PERROR("close");
251 assert(0);
252 }
253 }
254error_pipe:
255 free(memory_map);
74d81a6c
MD
256alloc_error:
257 return NULL;
258}
259
8a208943
MD
260/*
261 * libnuma prints errors on the console even for numa_available().
262 * Work-around this limitation by using get_mempolicy() directly to
263 * check whether the kernel supports mempolicy.
264 */
265#ifdef HAVE_LIBNUMA
266static bool lttng_is_numa_available(void)
267{
268 int ret;
269
270 ret = get_mempolicy(NULL, NULL, 0, NULL, 0);
271 if (ret && errno == ENOSYS) {
272 return false;
273 }
274 return numa_available() > 0;
275}
276#endif
277
74d81a6c
MD
278struct shm_object *shm_object_table_alloc(struct shm_object_table *table,
279 size_t memory_map_size,
a9ff648c 280 enum shm_object_type type,
4b68c31f
MD
281 int stream_fd,
282 int cpu)
74d81a6c 283{
4b68c31f 284 struct shm_object *shm_object;
bfcda6ce 285#ifdef HAVE_LIBNUMA
8a208943
MD
286 int oldnode = 0, node;
287 bool numa_avail;
4b68c31f 288
8a208943
MD
289 numa_avail = lttng_is_numa_available();
290 if (numa_avail) {
291 oldnode = numa_preferred();
292 if (cpu >= 0) {
293 node = numa_node_of_cpu(cpu);
294 if (node >= 0)
295 numa_set_preferred(node);
296 }
297 if (cpu < 0 || node < 0)
298 numa_set_localalloc();
4b68c31f 299 }
bfcda6ce 300#endif /* HAVE_LIBNUMA */
74d81a6c
MD
301 switch (type) {
302 case SHM_OBJECT_SHM:
4b68c31f 303 shm_object = _shm_object_table_alloc_shm(table, memory_map_size,
5ea386c3 304 stream_fd);
4b68c31f 305 break;
74d81a6c 306 case SHM_OBJECT_MEM:
4b68c31f
MD
307 shm_object = _shm_object_table_alloc_mem(table, memory_map_size);
308 break;
74d81a6c
MD
309 default:
310 assert(0);
311 }
bfcda6ce 312#ifdef HAVE_LIBNUMA
8a208943
MD
313 if (numa_avail)
314 numa_set_preferred(oldnode);
bfcda6ce 315#endif /* HAVE_LIBNUMA */
4b68c31f 316 return shm_object;
74d81a6c
MD
317}
318
319struct shm_object *shm_object_table_append_shm(struct shm_object_table *table,
320 int shm_fd, int wakeup_fd, uint32_t stream_nr,
321 size_t memory_map_size)
193183fb
MD
322{
323 struct shm_object *obj;
324 char *memory_map;
74d81a6c 325 int ret;
193183fb
MD
326
327 if (table->allocated_len >= table->size)
328 return NULL;
74d81a6c
MD
329 /* streams _must_ be received in sequential order, else fail. */
330 if (stream_nr + 1 != table->allocated_len)
331 return NULL;
332
193183fb
MD
333 obj = &table->objects[table->allocated_len];
334
74d81a6c
MD
335 /* wait_fd: set write end of the pipe. */
336 obj->wait_fd[0] = -1; /* read end is unset */
337 obj->wait_fd[1] = wakeup_fd;
193183fb 338 obj->shm_fd = shm_fd;
5ea386c3 339 obj->shm_fd_ownership = 1;
193183fb 340
74d81a6c
MD
341 /* The write end of the pipe needs to be non-blocking */
342 ret = fcntl(obj->wait_fd[1], F_SETFL, O_NONBLOCK);
343 if (ret < 0) {
344 PERROR("fcntl");
345 goto error_fcntl;
346 }
347
193183fb
MD
348 /* memory_map: mmap */
349 memory_map = mmap(NULL, memory_map_size, PROT_READ | PROT_WRITE,
4d4838ba 350 MAP_SHARED | LTTNG_MAP_POPULATE, shm_fd, 0);
193183fb
MD
351 if (memory_map == MAP_FAILED) {
352 PERROR("mmap");
353 goto error_mmap;
354 }
74d81a6c 355 obj->type = SHM_OBJECT_SHM;
193183fb
MD
356 obj->memory_map = memory_map;
357 obj->memory_map_size = memory_map_size;
358 obj->allocated_len = memory_map_size;
359 obj->index = table->allocated_len++;
360
361 return obj;
362
74d81a6c 363error_fcntl:
193183fb
MD
364error_mmap:
365 return NULL;
366}
367
74d81a6c
MD
368/*
369 * Passing ownership of mem to object.
370 */
371struct shm_object *shm_object_table_append_mem(struct shm_object_table *table,
ff0f5728 372 void *mem, size_t memory_map_size, int wakeup_fd)
74d81a6c
MD
373{
374 struct shm_object *obj;
ff0f5728 375 int ret;
74d81a6c
MD
376
377 if (table->allocated_len >= table->size)
378 return NULL;
379 obj = &table->objects[table->allocated_len];
380
ff0f5728
MD
381 obj->wait_fd[0] = -1; /* read end is unset */
382 obj->wait_fd[1] = wakeup_fd;
74d81a6c 383 obj->shm_fd = -1;
5ea386c3 384 obj->shm_fd_ownership = 0;
74d81a6c 385
ff0f5728
MD
386 ret = fcntl(obj->wait_fd[1], F_SETFD, FD_CLOEXEC);
387 if (ret < 0) {
388 PERROR("fcntl");
389 goto error_fcntl;
390 }
391 /* The write end of the pipe needs to be non-blocking */
392 ret = fcntl(obj->wait_fd[1], F_SETFL, O_NONBLOCK);
393 if (ret < 0) {
394 PERROR("fcntl");
395 goto error_fcntl;
396 }
397
74d81a6c
MD
398 obj->type = SHM_OBJECT_MEM;
399 obj->memory_map = mem;
400 obj->memory_map_size = memory_map_size;
401 obj->allocated_len = memory_map_size;
402 obj->index = table->allocated_len++;
403
404 return obj;
ff0f5728
MD
405
406error_fcntl:
407 return NULL;
74d81a6c
MD
408}
409
1d498196 410static
6548fca4 411void shmp_object_destroy(struct shm_object *obj, int consumer)
1d498196 412{
74d81a6c
MD
413 switch (obj->type) {
414 case SHM_OBJECT_SHM:
415 {
416 int ret, i;
1d498196 417
7a784989
MD
418 ret = munmap(obj->memory_map, obj->memory_map_size);
419 if (ret) {
420 PERROR("umnmap");
421 assert(0);
422 }
6548fca4 423
5ea386c3 424 if (obj->shm_fd_ownership) {
6548fca4
MD
425 /* Delete FDs only if called from app (not consumer). */
426 if (!consumer) {
427 lttng_ust_lock_fd_tracker();
428 ret = close(obj->shm_fd);
429 if (!ret) {
430 lttng_ust_delete_fd_from_tracker(obj->shm_fd);
431 } else {
432 PERROR("close");
433 assert(0);
434 }
435 lttng_ust_unlock_fd_tracker();
436 } else {
437 ret = close(obj->shm_fd);
438 if (ret) {
439 PERROR("close");
440 assert(0);
441 }
a9ff648c
MD
442 }
443 }
74d81a6c
MD
444 for (i = 0; i < 2; i++) {
445 if (obj->wait_fd[i] < 0)
446 continue;
6548fca4
MD
447 if (!consumer) {
448 lttng_ust_lock_fd_tracker();
449 ret = close(obj->wait_fd[i]);
450 if (!ret) {
451 lttng_ust_delete_fd_from_tracker(obj->wait_fd[i]);
452 } else {
453 PERROR("close");
454 assert(0);
455 }
456 lttng_ust_unlock_fd_tracker();
457 } else {
458 ret = close(obj->wait_fd[i]);
459 if (ret) {
460 PERROR("close");
461 assert(0);
462 }
74d81a6c 463 }
1d498196 464 }
74d81a6c
MD
465 break;
466 }
467 case SHM_OBJECT_MEM:
ff0f5728
MD
468 {
469 int ret, i;
470
471 for (i = 0; i < 2; i++) {
472 if (obj->wait_fd[i] < 0)
473 continue;
6548fca4
MD
474 if (!consumer) {
475 lttng_ust_lock_fd_tracker();
476 ret = close(obj->wait_fd[i]);
477 if (!ret) {
478 lttng_ust_delete_fd_from_tracker(obj->wait_fd[i]);
479 } else {
480 PERROR("close");
481 assert(0);
482 }
483 lttng_ust_unlock_fd_tracker();
484 } else {
485 ret = close(obj->wait_fd[i]);
486 if (ret) {
487 PERROR("close");
488 assert(0);
489 }
ff0f5728
MD
490 }
491 }
74d81a6c
MD
492 free(obj->memory_map);
493 break;
ff0f5728 494 }
74d81a6c
MD
495 default:
496 assert(0);
1d498196
MD
497 }
498}
499
6548fca4 500void shm_object_table_destroy(struct shm_object_table *table, int consumer)
1d498196
MD
501{
502 int i;
503
504 for (i = 0; i < table->allocated_len; i++)
6548fca4 505 shmp_object_destroy(&table->objects[i], consumer);
1d498196
MD
506 free(table);
507}
508
509/*
510 * zalloc_shm - allocate memory within a shm object.
511 *
512 * Shared memory is already zeroed by shmget.
513 * *NOT* multithread-safe (should be protected by mutex).
514 * Returns a -1, -1 tuple on error.
515 */
516struct shm_ref zalloc_shm(struct shm_object *obj, size_t len)
517{
518 struct shm_ref ref;
519 struct shm_ref shm_ref_error = { -1, -1 };
520
521 if (obj->memory_map_size - obj->allocated_len < len)
522 return shm_ref_error;
523 ref.index = obj->index;
524 ref.offset = obj->allocated_len;
525 obj->allocated_len += len;
526 return ref;
527}
528
529void align_shm(struct shm_object *obj, size_t align)
530{
b72687b8 531 size_t offset_len = lttng_ust_offset_align(obj->allocated_len, align);
1d498196
MD
532 obj->allocated_len += offset_len;
533}
This page took 0.063256 seconds and 5 git commands to generate.