1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*********************************************************
* Copyright (C) 2009-2015 VMware, Inc. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation version 2.1 and no later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the Lesser GNU General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
*********************************************************/
/*
* wiperCommon.c --
*
* OS-agnostic parts of the library for wiping a virtual disk.
*
*/
#include <stdlib.h>
#include <string.h>
#include "dbllnklst.h"
#include "wiper.h"
#include "util.h"
/*
*-----------------------------------------------------------------------------
*
* WiperSinglePartition_Allocate --
*
* Allocates and initialized empty WiperPartition structure.
*
* Results:
* NULL if there is no memory, otherwise a pointer to newly allocated
* WiperPartition structure.
*
* Side Effects:
* Allocates memory.
*
*-----------------------------------------------------------------------------
*/
WiperPartition *
WiperSinglePartition_Allocate(void)
{
WiperPartition *p = (WiperPartition *) malloc(sizeof *p);
if (p != NULL) {
memset(p->mountPoint, 0, sizeof p->mountPoint);
p->type = PARTITION_UNSUPPORTED;
p->comment = NULL;
p->attemptUnmaps = TRUE;
DblLnkLst_Init(&p->link);
}
return p;
}
/*
*-----------------------------------------------------------------------------
*
* WiperSinglePartition_Close --
*
* Destroy the information returned by a previous call to
* WiperSinglePartition_Allocate(). The partition should be removed
* from all lists prior to calling WiperSinglePartition_Close().
*
* Results:
* None.
*
* Side Effects:
* Frees memory occupied by the element.
*
*-----------------------------------------------------------------------------
*/
void
WiperSinglePartition_Close(WiperPartition *p) // IN
{
if (p) {
free((char *)p->comment); /* Casting away constness */
free(p);
}
}
/*
*---------------------------------------------------------------------------
*
* WiperPartition_Close --
*
* Destroy the information collected by previous call to
* WiperPartition_Open().
*
* Results:
* None
*
* Side Effects:
* Frees memory occupied by elements of the list.
*
*---------------------------------------------------------------------------
*/
void
WiperPartition_Close(WiperPartition_List *pl) // IN/OUT
{
DblLnkLst_Links *curr, *next;
DblLnkLst_ForEachSafe(curr, next, &pl->link) {
WiperPartition *part = DblLnkLst_Container(curr, WiperPartition, link);
DblLnkLst_Unlink1(curr);
WiperSinglePartition_Close(part);
}
}
|
