4 * Common Trace Format Object Stack.
6 * Copyright 2013 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
8 * Permission is hereby granted, free of charge, to any person obtaining a copy
9 * of this software and associated documentation files (the "Software"), to deal
10 * in the Software without restriction, including without limitation the rights
11 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
12 * copies of the Software, and to permit persons to whom the Software is
13 * furnished to do so, subject to the following conditions:
15 * The above copyright notice and this permission notice shall be included in
16 * all copies or substantial portions of the Software.
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
21 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
22 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
23 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 #include <babeltrace/list.h>
29 #include <babeltrace/babeltrace-internal.h>
30 #include <babeltrace/align.h>
32 #define OBJSTACK_ALIGN 8 /* Object stack alignment */
33 #define OBJSTACK_INIT_LEN 128
34 #define OBJSTACK_POISON 0xcc
37 struct bt_list_head head
; /* list of struct objstack_node */
40 struct objstack_node
{
41 struct bt_list_head node
;
44 char __attribute__ ((aligned (OBJSTACK_ALIGN
))) data
[];
48 struct objstack
*objstack_create(void)
50 struct objstack
*objstack
;
51 struct objstack_node
*node
;
53 objstack
= calloc(1, sizeof(*objstack
));
56 node
= calloc(sizeof(struct objstack_node
) + OBJSTACK_INIT_LEN
,
62 BT_INIT_LIST_HEAD(&objstack
->head
);
63 bt_list_add_tail(&node
->node
, &objstack
->head
);
64 node
->len
= OBJSTACK_INIT_LEN
;
69 void objstack_node_free(struct objstack_node
*node
)
77 len
= sizeof(*node
) + node
->len
;
78 for (offset
= 0; offset
< len
; offset
++)
79 p
[offset
] = OBJSTACK_POISON
;
84 void objstack_destroy(struct objstack
*objstack
)
86 struct objstack_node
*node
, *p
;
90 bt_list_for_each_entry_safe(node
, p
, &objstack
->head
, node
) {
91 bt_list_del(&node
->node
);
92 objstack_node_free(node
);
98 struct objstack_node
*objstack_append_node(struct objstack
*objstack
)
100 struct objstack_node
*last_node
, *new_node
;
103 last_node
= bt_list_entry(objstack
->head
.prev
,
104 struct objstack_node
, node
);
106 /* Allocate new node with double of size of last node */
107 new_node
= calloc(sizeof(struct objstack_node
) + (last_node
->len
<< 1),
112 bt_list_add_tail(&new_node
->node
, &objstack
->head
);
113 new_node
->len
= last_node
->len
<< 1;
118 void *objstack_alloc(struct objstack
*objstack
, size_t len
)
120 struct objstack_node
*last_node
;
123 len
= ALIGN(len
, OBJSTACK_ALIGN
);
126 last_node
= bt_list_entry(objstack
->head
.prev
,
127 struct objstack_node
, node
);
128 while (last_node
->len
- last_node
->used_len
< len
) {
129 last_node
= objstack_append_node(objstack
);
134 p
= &last_node
->data
[last_node
->used_len
];
135 last_node
->used_len
+= len
;
This page took 0.03293 seconds and 5 git commands to generate.