1/*
2 * Copyright (c) 2000-2001,2003-2004,2006 Apple Computer, Inc. All Rights Reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
11 * file.
12 *
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
20 *
21 * @APPLE_LICENSE_HEADER_END@
22 */
23
24
25//
26// walkers - facilities for traversing and manipulating recursive data structures
27//
28#include <security_cdsa_utilities/walkers.h>
29
30
31namespace Security {
32namespace DataWalkers {
33
34
35//
36// Free all recorded storage nodes for a ChunkFreeWalker
37//
38void ChunkFreeWalker::free()
39{
40	for (set<void *>::iterator it = freeSet.begin(); it != freeSet.end(); it++)
41		allocator.free(*it);
42	freeSet.erase(freeSet.begin(), freeSet.end());
43}
44
45
46} // end namespace DataWalkers
47} // end namespace Security
48