1d808384e9807a06683dc73cec581019707244a8
2 * SPDX-License-Identifier: MIT
4 * Copyright 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
6 * Common Trace Format Object Stack.
9 #define BT_LOG_OUTPUT_LEVEL ctf_plugin_metadata_log_level
10 #define BT_LOG_TAG "PLUGIN/CTF/META/OBJSTACK"
11 #include "logging.hpp"
13 #include "objstack.hpp"
16 #include "common/list.h"
17 #include "common/macros.h"
18 #include "common/align.h"
20 #define OBJSTACK_ALIGN 8 /* Object stack alignment */
21 #define OBJSTACK_INIT_LEN 128
22 #define OBJSTACK_POISON 0xcc
26 struct bt_list_head head
; /* list of struct objstack_node */
31 struct bt_list_head node
;
34 char __attribute__((aligned(OBJSTACK_ALIGN
))) data
[];
37 struct objstack
*objstack_create(void)
39 struct objstack
*objstack
;
40 struct objstack_node
*node
;
42 objstack
= (struct objstack
*) calloc(1, sizeof(*objstack
));
44 BT_LOGE_STR("Failed to allocate one object stack.");
47 node
= (objstack_node
*) calloc(sizeof(struct objstack_node
) + OBJSTACK_INIT_LEN
, sizeof(char));
49 BT_LOGE_STR("Failed to allocate one object stack node.");
53 BT_INIT_LIST_HEAD(&objstack
->head
);
54 bt_list_add_tail(&node
->node
, &objstack
->head
);
55 node
->len
= OBJSTACK_INIT_LEN
;
59 static void objstack_node_free(struct objstack_node
*node
)
67 len
= sizeof(*node
) + node
->len
;
68 for (offset
= 0; offset
< len
; offset
++)
69 p
[offset
] = OBJSTACK_POISON
;
73 void objstack_destroy(struct objstack
*objstack
)
75 struct objstack_node
*node
, *p
;
79 bt_list_for_each_entry_safe (node
, p
, &objstack
->head
, node
) {
80 bt_list_del(&node
->node
);
81 objstack_node_free(node
);
86 static struct objstack_node
*objstack_append_node(struct objstack
*objstack
)
88 struct objstack_node
*last_node
, *new_node
;
91 last_node
= bt_list_entry(objstack
->head
.prev
, struct objstack_node
, node
);
93 /* Allocate new node with double of size of last node */
94 new_node
= (objstack_node
*) calloc(sizeof(struct objstack_node
) + (last_node
->len
<< 1),
97 BT_LOGE_STR("Failed to allocate one object stack node.");
100 bt_list_add_tail(&new_node
->node
, &objstack
->head
);
101 new_node
->len
= last_node
->len
<< 1;
105 void *objstack_alloc(struct objstack
*objstack
, size_t len
)
107 struct objstack_node
*last_node
;
110 len
= BT_ALIGN(len
, OBJSTACK_ALIGN
);
113 last_node
= bt_list_entry(objstack
->head
.prev
, struct objstack_node
, node
);
114 while (last_node
->len
- last_node
->used_len
< len
) {
115 last_node
= objstack_append_node(objstack
);
120 p
= &last_node
->data
[last_node
->used_len
];
121 last_node
->used_len
+= len
;
This page took 0.032854 seconds and 4 git commands to generate.