VirtualBox

source: vbox/trunk/src/VBox/Runtime/common/misc/handletable.cpp@ 27802

Last change on this file since 27802 was 24181, checked in by vboxsync, 15 years ago

VMM,SUPDrv,IPRT: Always initialize RTSPINLOCKTMP structures.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 7.3 KB
Line 
1/* $Id: handletable.cpp 24181 2009-10-30 10:51:56Z vboxsync $ */
2/** @file
3 * IPRT - Handle Tables.
4 */
5
6/*
7 * Copyright (C) 2008 Sun Microsystems, Inc.
8 *
9 * This file is part of VirtualBox Open Source Edition (OSE), as
10 * available from http://www.virtualbox.org. This file is free software;
11 * you can redistribute it and/or modify it under the terms of the GNU
12 * General Public License (GPL) as published by the Free Software
13 * Foundation, in version 2 as it comes in the "COPYING" file of the
14 * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
15 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
16 *
17 * The contents of this file may alternatively be used under the terms
18 * of the Common Development and Distribution License Version 1.0
19 * (CDDL) only, as it comes in the "COPYING.CDDL" file of the
20 * VirtualBox OSE distribution, in which case the provisions of the
21 * CDDL are applicable instead of those of the GPL.
22 *
23 * You may elect to license modified versions of this file under the
24 * terms and conditions of either the GPL or the CDDL or both.
25 *
26 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa
27 * Clara, CA 95054 USA or visit http://www.sun.com if you need
28 * additional information or have any questions.
29 */
30
31
32/*******************************************************************************
33* Header Files *
34*******************************************************************************/
35#include <iprt/handletable.h>
36#include "internal/iprt.h"
37
38#include <iprt/mem.h>
39#include <iprt/spinlock.h>
40#include <iprt/err.h>
41#include <iprt/assert.h>
42#include <iprt/param.h>
43#include <iprt/string.h>
44#include <iprt/asm.h>
45#include "internal/magics.h"
46#include "handletable.h"
47
48
49
50RTDECL(int) RTHandleTableCreateEx(PRTHANDLETABLE phHandleTable, uint32_t fFlags, uint32_t uBase, uint32_t cMax,
51 PFNRTHANDLETABLERETAIN pfnRetain, void *pvUser)
52{
53 PRTHANDLETABLEINT pThis;
54 uint32_t cLevel1;
55 size_t cb;
56
57 /*
58 * Validate input.
59 */
60 AssertPtrReturn(phHandleTable, VERR_INVALID_POINTER);
61 *phHandleTable = NIL_RTHANDLETABLE;
62 AssertPtrNullReturn(pfnRetain, VERR_INVALID_POINTER);
63 AssertReturn(!(fFlags & ~RTHANDLETABLE_FLAGS_MASK), VERR_INVALID_PARAMETER);
64 AssertReturn(cMax > 0, VERR_INVALID_PARAMETER);
65 AssertReturn(UINT32_MAX - cMax >= uBase, VERR_INVALID_PARAMETER);
66
67 /*
68 * Adjust the cMax value so it is a multiple of the 2nd level tables.
69 */
70 if (cMax >= UINT32_MAX - RTHT_LEVEL2_ENTRIES)
71 cMax = UINT32_MAX - RTHT_LEVEL2_ENTRIES + 1;
72 cMax = ((cMax + RTHT_LEVEL2_ENTRIES - 1) / RTHT_LEVEL2_ENTRIES) * RTHT_LEVEL2_ENTRIES;
73
74 cLevel1 = cMax / RTHT_LEVEL2_ENTRIES;
75 Assert(cLevel1 * RTHT_LEVEL2_ENTRIES == cMax);
76
77 /*
78 * Allocate the structure, include the 1st level lookup table
79 * if it's below the threshold size.
80 */
81 cb = sizeof(RTHANDLETABLEINT);
82 if (cLevel1 < RTHT_LEVEL1_DYN_ALLOC_THRESHOLD)
83 cb = RT_ALIGN(cb, sizeof(void *)) + cLevel1 * sizeof(void *);
84 pThis = (PRTHANDLETABLEINT)RTMemAllocZ(cb);
85 if (!pThis)
86 return VERR_NO_MEMORY;
87
88 /*
89 * Initialize it.
90 */
91 pThis->u32Magic = RTHANDLETABLE_MAGIC;
92 pThis->fFlags = fFlags;
93 pThis->uBase = uBase;
94 pThis->cCur = 0;
95 pThis->hSpinlock = NIL_RTSPINLOCK;
96 if (cLevel1 < RTHT_LEVEL1_DYN_ALLOC_THRESHOLD)
97 pThis->papvLevel1 = (void **)((uint8_t *)pThis + RT_ALIGN(sizeof(*pThis), sizeof(void *)));
98 else
99 pThis->papvLevel1 = NULL;
100 pThis->pfnRetain = pfnRetain;
101 pThis->pvRetainUser = pvUser;
102 pThis->cMax = cMax;
103 pThis->cCurAllocated = 0;
104 pThis->cLevel1 = cLevel1 < RTHT_LEVEL1_DYN_ALLOC_THRESHOLD ? cLevel1 : 0;
105 pThis->iFreeHead = NIL_RTHT_INDEX;
106 pThis->iFreeTail = NIL_RTHT_INDEX;
107 if (fFlags & RTHANDLETABLE_FLAGS_LOCKED)
108 {
109 int rc = RTSpinlockCreate(&pThis->hSpinlock);
110 if (RT_FAILURE(rc))
111 {
112 RTMemFree(pThis);
113 return rc;
114 }
115 }
116
117 *phHandleTable = pThis;
118 return VINF_SUCCESS;
119}
120RT_EXPORT_SYMBOL(RTHandleTableCreateEx);
121
122
123RTDECL(int) RTHandleTableCreate(PRTHANDLETABLE phHandleTable)
124{
125 return RTHandleTableCreateEx(phHandleTable, RTHANDLETABLE_FLAGS_LOCKED, 1, 65534, NULL, NULL);
126}
127RT_EXPORT_SYMBOL(RTHandleTableCreate);
128
129
130RTDECL(int) RTHandleTableDestroy(RTHANDLETABLE hHandleTable, PFNRTHANDLETABLEDELETE pfnDelete, void *pvUser)
131{
132 PRTHANDLETABLEINT pThis;
133 RTSPINLOCKTMP Tmp = RTSPINLOCKTMP_INITIALIZER;
134 uint32_t i1;
135 uint32_t i;
136
137 /*
138 * Validate input, quitely ignore the NIL handle.
139 */
140 if (hHandleTable == NIL_RTHANDLETABLE)
141 return VINF_SUCCESS;
142 pThis = (PRTHANDLETABLEINT)hHandleTable;
143 AssertPtrReturn(pThis, VERR_INVALID_HANDLE);
144 AssertReturn(pThis->u32Magic == RTHANDLETABLE_MAGIC, VERR_INVALID_HANDLE);
145 AssertPtrNullReturn(pfnDelete, VERR_INVALID_POINTER);
146
147 /*
148 * Mark the thing as invalid / deleted.
149 * Then kill the lock.
150 */
151 rtHandleTableLock(pThis, &Tmp);
152 ASMAtomicWriteU32(&pThis->u32Magic, ~RTHANDLETABLE_MAGIC);
153 rtHandleTableUnlock(pThis, &Tmp);
154
155 if (pThis->hSpinlock != NIL_RTSPINLOCK)
156 {
157 rtHandleTableLock(pThis, &Tmp);
158 rtHandleTableUnlock(pThis, &Tmp);
159
160 RTSpinlockDestroy(pThis->hSpinlock);
161 pThis->hSpinlock = NIL_RTSPINLOCK;
162 }
163
164 if (pfnDelete)
165 {
166 /*
167 * Walk all the tables looking for used handles.
168 */
169 uint32_t cLeft = pThis->cCurAllocated;
170 if (pThis->fFlags & RTHANDLETABLE_FLAGS_CONTEXT)
171 {
172 for (i1 = 0; cLeft > 0 && i1 < pThis->cLevel1; i1++)
173 {
174 PRTHTENTRYCTX paTable = (PRTHTENTRYCTX)pThis->papvLevel1[i1];
175 if (paTable)
176 for (i = 0; i < RTHT_LEVEL2_ENTRIES; i++)
177 if (!RTHT_IS_FREE(paTable[i].pvObj))
178 {
179 pfnDelete(hHandleTable, pThis->uBase + i + i1 * RTHT_LEVEL2_ENTRIES,
180 paTable[i].pvObj, paTable[i].pvCtx, pvUser);
181 Assert(cLeft > 0);
182 cLeft--;
183 }
184 }
185 }
186 else
187 {
188 for (i1 = 0; cLeft > 0 && i1 < pThis->cLevel1; i1++)
189 {
190 PRTHTENTRY paTable = (PRTHTENTRY)pThis->papvLevel1[i1];
191 if (paTable)
192 for (i = 0; i < RTHT_LEVEL2_ENTRIES; i++)
193 if (!RTHT_IS_FREE(paTable[i].pvObj))
194 {
195 pfnDelete(hHandleTable, pThis->uBase + i + i1 * RTHT_LEVEL2_ENTRIES,
196 paTable[i].pvObj, NULL, pvUser);
197 Assert(cLeft > 0);
198 cLeft--;
199 }
200 }
201 }
202 Assert(!cLeft);
203 }
204
205 /*
206 * Free the memory.
207 */
208 for (i1 = 0; i1 < pThis->cLevel1; i1++)
209 if (pThis->papvLevel1[i1])
210 {
211 RTMemFree(pThis->papvLevel1[i1]);
212 pThis->papvLevel1[i1] = NULL;
213 }
214
215 if (pThis->cMax / RTHT_LEVEL2_ENTRIES >= RTHT_LEVEL1_DYN_ALLOC_THRESHOLD)
216 RTMemFree(pThis->papvLevel1);
217
218 RTMemFree(pThis);
219
220 return VINF_SUCCESS;
221}
222RT_EXPORT_SYMBOL(RTHandleTableDestroy);
223
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette