[ed05d7]: memAlloc.cpp Maximize Restore History

Download this file

memAlloc.cpp    145 lines (132 with data), 2.9 kB

  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
138
139
140
141
142
143
144
// This program is free software; you can redistribute
// it and/or modify it under the terms of the GNU
// General Public License as published by the Free
// Software Foundation; either version 2 of the
// License, or (at your option) any 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 GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General
// Public License along with this program; if not,
// write to the Free Software Foundation, Inc., 675
// Mass Ave, Cambridge, MA 02139, USA.
/**
* @file memAlloc.cpp
* This file is included in all four plug-ins (PTAdjust, PTCorrect, PTPerspect, and PTRemap)
* Used for allocating, freeing, locking, and unlocking memmory.
* @date January 2007
*/
#include "main.h"
/**
* Memmory Lock Handles
* @param[in] k
* @return none
**/
void memLockHandles(MemType k)
{
for (int i = 0; i <= MEM[k].tos; i++)
{
if (MEM[k].stack[i].mem)
{
gFr->bufferProcs->lockProc(MEM[k].stack[i].id, true);
}
}
}
/**
* Memmory Lock Handles
* @param[in] k
* @return none
**/
void memUnlockHandles(MemType k)
{
for (int i = 0; i <= MEM[k].tos; i++)
{
if (MEM[k].stack[i].mem)
{
gFr->bufferProcs->unlockProc(MEM[k].stack[i].id);
}
}
}
/**
* Memmory Free All
* @param[in] k
* @return none
**/
void memFreeAll(MemType k)
{
for (int i = MEM[k].tos; i >= 0; i--)
{
if (MEM[k].stack[i].mem)
{
gFr->bufferProcs->freeProc(MEM[k].stack[i].id);
}
}
MEM[k].tos = -1;
}
/**
* Memmory Free
* @param[in] k
* @param[in] buf
* @return none
**/
void memFree(MemType k, void *buf)
{
for (int i = MEM[k].tos; i >= 0; i--)
{
// Found the match
if (MEM[k].stack[i].mem == buf)
{
gFr->bufferProcs->unlockProc(MEM[k].stack[i].id);
gFr->bufferProcs->freeProc(MEM[k].stack[i].id);
MEM[k].stack[i].mem = NULL;
return;
}
}
}
/**
* Memmory Initilize
* @param[in] k
* @return none
**/
void memInit(MemType k)
{
MEM[k].tos = -1;
}
/**
* Memmory Allocate
* @param[in] k
* @param[in] size
* @return none
**/
void *memAlloc(MemType k, int32 size)
{
if (++MEM[k].tos >= MAX_STACK)
{
MEM[k].tos--;
*gResult = memFullErr;
display("memAlloc(1): out of memory");
return NULL;
}
BufferProcs *bufferProcs = gFr->bufferProcs;
if (bufferProcs->allocateProc(size, &MEM[k].stack[MEM[k].tos].id))
{
MEM[k].tos--;
*gResult = memFullErr;
display("memAlloc(2): out of memory");
return NULL;
}
MEM[k].stack[MEM[k].tos].mem = bufferProcs->lockProc(MEM[k].stack[MEM[k].tos].id, true);
if (MEM[k].stack[MEM[k].tos].mem == NULL)
{
MEM[k].tos--;
*gResult = memFullErr;
display("memAlloc(3): out of memory");
return NULL;
}
void *p = (unsigned char *)MEM[k].stack[MEM[k].tos].mem;
return p;
}