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 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
|
/* Hey emacs, this is -*- Mode: C++; tab-width: 4 -*- */
/*
* simple Point stack
*
* stack.c,v 1.6 1995/09/08 09:51:28 j Exp
*/
/*
* Copyright (c) 1995
* Alfredo Herrera Hernandez <alf@narcisa.sax.de>
* Torsten Schoenitz <torsten_schoenitz@bonnie.heep.sax.de>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE DEVELOPERS ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE DEVELOPERS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdlib.h>
#include "xonix.h"
#include "stack.h"
#define INIT_SIZE (1024)
/* ------------------------------------------------------------------------ */
/* InitMyPoints legt einen Speicherbereich mit der gewuenschten Groesse an */
/* ------------------------------------------------------------------------ */
myPoint *InitMyPoints (int size)
{
return ((myPoint *) malloc (size * sizeof (myPoint)));
}
/* ------------------------------------------------------------------------ */
/* InitMySegments legt einen Speicherbereich mit der gewuenschten Groesse */
/* an */
/* ------------------------------------------------------------------------ */
mySegment *InitMySegments (int size)
{
return ((mySegment *) malloc (size * sizeof (mySegment)));
}
/* ------------------------------------------------------------------------ */
/* InitStack initialisiert die Stackverwaltung fuer myPoints */
/* ------------------------------------------------------------------------ */
stack *InitStack (void)
{
stack *s;
if ((s = (stack *) malloc (sizeof (stack))) == NULL) return NULL;
if ((s -> bottom = InitMyPoints (INIT_SIZE)) == NULL) {
free(s);
return NULL;
}
s -> size = INIT_SIZE;
s -> counter = 0;
return s;
}
/* ------------------------------------------------------------------------ */
/* InitSegmentStack initialisiert die Stackverwaltung fuer mySegments */
/* ------------------------------------------------------------------------ */
segStack *InitSegmentStack (void)
{
segStack *s;
if ((s = (segStack *) malloc (sizeof (segStack))) == NULL) return NULL;
if ((s -> bottom = InitMySegments (INIT_SIZE)) == NULL) {
free(s);
return NULL;
}
s -> size = INIT_SIZE;
s -> counter = 0;
return s;
}
/* ------------------------------------------------------------------------ */
/* DeinitMyPoints gibt die Stackelemente wieder frei */
/* ------------------------------------------------------------------------ */
int DeinitMyPoints (myPoint *p)
{
free (p);
return 1;
}
/* ------------------------------------------------------------------------ */
/* DeinitMySegments gibt die Stackelemente wieder frei */
/* ------------------------------------------------------------------------ */
int DeinitMySegments (mySegment *p)
{
free (p);
return 1;
}
/* ------------------------------------------------------------------------ */
/* DeinitStack gibt den Stack wieder frei */
/* ------------------------------------------------------------------------ */
int DeinitStack (stack *s)
{
if (s == NULL) return 0;
DeinitMyPoints (s -> bottom);
free (s);
return 1;
}
/* ------------------------------------------------------------------------ */
/* DeinitSegmentStack gibt den Stack wieder frei */
/* ------------------------------------------------------------------------ */
int DeinitSegmentStack (segStack *s)
{
if (s == NULL) return 0;
DeinitMySegments (s -> bottom);
free (s);
return 1;
}
/* ------------------------------------------------------------------------ */
/* ReallocMyPoints fordert Speicher fuer size Stackelemente an */
/* ------------------------------------------------------------------------ */
myPoint *ReallocMyPoints (myPoint *p, int size)
{
return ((myPoint *) realloc (p, size * sizeof (myPoint)));
}
/* ------------------------------------------------------------------------ */
/* ReallocMySegments fordert Speicher fuer size Stackelemente an */
/* ------------------------------------------------------------------------ */
mySegment *ReallocMySegments (mySegment *p, int size)
{
return ((mySegment *) realloc (p, size * sizeof (mySegment)));
}
/* ------------------------------------------------------------------------ */
/* Push packt ein Element auf den Stack */
/* ------------------------------------------------------------------------ */
int Push (stack *s, int x, int y)
{
if (s -> size == s -> counter)
{
if ((s -> bottom = ReallocMyPoints (s -> bottom,
s -> size + 0x1000)) == NULL)
return 0;
s -> size += 0x1000;
}
(s -> bottom + s -> counter) -> h = x;
(s -> bottom + s -> counter) -> v = y;
s -> counter ++;
return 1;
}
/* ------------------------------------------------------------------------ */
/* PushSeg packt ein Segment auf den Stack */
/* ------------------------------------------------------------------------ */
int PushSeg (segStack *s, int y, int xl, int xr, int dy)
{
if (s -> size == s -> counter)
{
if ((s -> bottom = ReallocMySegments (s -> bottom,
s -> size + 0x1000)) == NULL)
return 0;
s -> size += 0x1000;
}
if ((y + dy >= RATIO) && (y + dy <= V_STEPS - RATIO))
{
(s -> bottom + s -> counter) -> y = y;
(s -> bottom + s -> counter) -> xl = xl;
(s -> bottom + s -> counter) -> xr = xr;
(s -> bottom + s -> counter) -> dy = dy;
s -> counter ++;
}
return 1;
}
/* ------------------------------------------------------------------------ */
/* Pop liefert das oberste Element aus dem Stack */
/* ------------------------------------------------------------------------ */
int Pop (stack *s, myPoint *p)
{
if (s -> counter) s -> counter --;
else return 0;
if (s -> size > (s -> counter + 0x1000))
{
if ((s -> bottom = ReallocMyPoints (s -> bottom,
s -> size - 0x1000)) == NULL)
return 0;
s -> size -= 0x1000;
}
*p = *(s -> bottom + s -> counter);
return 1;
}
/* ------------------------------------------------------------------------ */
/* PopSeg liefert das oberste Segment aus dem Stack */
/* ------------------------------------------------------------------------ */
int PopSeg (segStack *s, mySegment *p)
{
if (s -> counter) s -> counter --;
else return 0;
if (s -> size > (s -> counter + 0x1000))
{
if ((s -> bottom = ReallocMySegments (s -> bottom,
s -> size - 0x1000)) == NULL)
return 0;
s -> size -= 0x1000;
}
(s -> bottom + s -> counter) -> y += (s -> bottom + s -> counter) -> dy;
*p = *(s -> bottom + s -> counter);
return 1;
}
|