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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
//
// AUTHOR
// N. Nielsen
//
// VERSION
// 0.7
//
// LICENSE
// This software is in the public domain.
//
// The software is provided "as is", without warranty of any kind,
// express or implied, including but not limited to the warranties
// of merchantability, fitness for a particular purpose, and
// noninfringement. In no event shall the author(s) be liable for any
// claim, damages, or other liability, whether in an action of
// contract, tort, or otherwise, arising from, out of, or in connection
// with the software or the use or other dealings in the software.
//
// SUPPORT
// Send bug reports to: <nielsen@memberwebs.com>
//
#include "drive.h"
#include "memref.h"
#include <malloc.h>
#include <string.h>
#include <stdio.h>
PartitionInfo* CreatePartitionInfo()
{
PartitionInfo* pInfo = (PartitionInfo*)refalloc(sizeof(PartitionInfo));
if(pInfo)
memset(pInfo, 0, sizeof(PartitionInfo));
return pInfo;
}
void FreePartitionInfo(PartitionInfo* pInfo)
{
if(pInfo)
{
if(pInfo->pLocks)
free(pInfo->pLocks);
refrelease(pInfo);
}
}
// These locks are used to signify which
struct DriveLock
{
uint64 beg;
uint64 end;
};
bool IntersectRange(uint64& b1, uint64& e1, uint64 b2, uint64 e2)
{
// TODO: (later) This is stupid! There's a simple quick way
// need to update
if(b1 <= b2 && e1 > b2 && b1 < e2) // Overlaps the first portion
e1 = e2;
else if(b1 < e2 && e1 >= e2 && b2 < e1) // Overlaps second portion
b1 = b2;
else if(b1 > b2 && e1 < e2) // Encompassed
{ }
else if (b1 == b2 && e1 == e2) // Identical
{ }
else
return false;
return true;
}
void AddLocationLock(PartitionInfo* pInfo, uint64 beg, uint64 end)
{
if(pInfo->cLocks <= pInfo->curLock)
{
pInfo->cLocks += 0x400;
pInfo->pLocks = (DriveLock*)realloc(pInfo->pLocks, sizeof(DriveLock) * pInfo->cLocks);
}
// TODO: Implement a more efficient method here!
if(pInfo->pLocks)
{
bool bFound = false;
// Go through and check for a current lock we can tag onto
for(uint32 i = 0; i < pInfo->curLock; i++)
{
if(IntersectRange(pInfo->pLocks[i].beg, pInfo->pLocks[i].end,
beg, end))
{
bFound = true;
}
}
if(!bFound)
{
pInfo->pLocks[pInfo->curLock].beg = beg;
pInfo->pLocks[pInfo->curLock].end = end;
pInfo->curLock++;
}
}
}
bool CheckLocationLock(PartitionInfo* pInfo, uint64& sec)
{
// Go through and check for a lock
for(uint32 i = 0; i < pInfo->curLock; i++)
{
if(sec >= pInfo->pLocks[i].beg &&
sec < pInfo->pLocks[i].end)
{
sec = pInfo->pLocks[i].end;
return true;
}
}
return false;
}
#ifdef _DEBUG
void DumpLocationLocks(PartitionInfo* pInfo)
{
for(uint32 i = 0; i < pInfo->curLock; i++)
{
printf("%u\t%u\n", (uint32)pInfo->pLocks[i].beg, (uint32)pInfo->pLocks[i].end);
}
printf("\n");
}
#endif
|
