net: Add libnetapi context to net's impressive list of globals.
[Samba.git] / source / lib / talloc_stack.c
blob2722fb96768636ccd64fac6e896d25c1c74c2422
1 /*
2 Unix SMB/CIFS implementation.
3 Implement a stack of talloc contexts
4 Copyright (C) Volker Lendecke 2007
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program 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
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 * Implement a stack of talloc frames.
24 * When a new talloc stackframe is allocated with talloc_stackframe(), then
25 * the TALLOC_CTX returned with talloc_tos() is reset to that new
26 * frame. Whenever that stack frame is TALLOC_FREE()'ed, then the reverse
27 * happens: The previous talloc_tos() is restored.
29 * This API is designed to be robust in the sense that if someone forgets to
30 * TALLOC_FREE() a stackframe, then the next outer one correctly cleans up and
31 * resets the talloc_tos().
33 * This robustness feature means that we can't rely on a linked list with
34 * talloc destructors because in a hierarchy of talloc destructors the parent
35 * destructor is called before its children destructors. The child destructor
36 * called after the parent would set the talloc_tos() to the wrong value.
39 #include "includes.h"
41 static int talloc_stacksize;
42 static int talloc_stack_arraysize;
43 static TALLOC_CTX **talloc_stack;
45 static int talloc_pop(TALLOC_CTX *frame)
47 int i;
49 for (i=talloc_stacksize-1; i>0; i--) {
50 if (frame == talloc_stack[i]) {
51 break;
53 talloc_free(talloc_stack[i]);
56 talloc_stacksize = i;
57 return 0;
61 * Create a new talloc stack frame.
63 * When free'd, it frees all stack frames that were created after this one and
64 * not explicitly freed.
67 static TALLOC_CTX *talloc_stackframe_internal(size_t poolsize)
69 TALLOC_CTX **tmp, *top, *parent;
71 if (talloc_stack_arraysize < talloc_stacksize + 1) {
72 tmp = TALLOC_REALLOC_ARRAY(NULL, talloc_stack, TALLOC_CTX *,
73 talloc_stacksize + 1);
74 if (tmp == NULL) {
75 goto fail;
77 talloc_stack = tmp;
78 talloc_stack_arraysize = talloc_stacksize + 1;
81 if (talloc_stacksize == 0) {
82 parent = talloc_stack;
84 else {
85 parent = talloc_stack[talloc_stacksize-1];
88 if (poolsize) {
89 top = talloc_pool(parent, poolsize);
90 } else {
91 top = talloc_new(parent);
94 if (top == NULL) {
95 goto fail;
98 talloc_set_destructor(top, talloc_pop);
100 talloc_stack[talloc_stacksize++] = top;
101 return top;
103 fail:
104 smb_panic("talloc_stackframe failed");
105 return NULL;
108 TALLOC_CTX *talloc_stackframe(void)
110 return talloc_stackframe_internal(0);
113 TALLOC_CTX *talloc_stackframe_pool(size_t poolsize)
115 return talloc_stackframe_internal(poolsize);
119 * Get us the current top of the talloc stack.
122 TALLOC_CTX *talloc_tos(void)
124 if (talloc_stacksize == 0) {
125 talloc_stackframe();
126 DEBUG(0, ("no talloc stackframe around, leaking memory\n"));
129 return talloc_stack[talloc_stacksize-1];