Debian Codegraph @

lib/database/src/so/nodes/nurbs/libnurbs/maplist.c++

raw
1 /*
2 *
3 * Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved.
4 *
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
9 *
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
14 *
15 * Further, this software is distributed without any warranty that it is
16 * free of the rightful claim of any third person regarding infringement
17 * or the like. Any license provided herein, whether implied or
18 * otherwise, applies only to this software file. Patent licenses, if
19 * any, provided herein do not apply to combinations of this program with
20 * other software, or any other product whatsoever.
21 *
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with this library; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 *
26 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
27 * Mountain View, CA 94043, or:
28 *
29 * http://www.sgi.com
30 *
31 * For further information regarding this notice, see:
32 *
33 * http://oss.sgi.com/projects/GenInfo/NoticeExplan/
34 *
35 */
36
37 /*
38 * maplist.c++ - $Revision: 1.1.1.1 $
39 * Derrick Burns - 1991
40 */
41
42 #include "glimports.h"
43 #include "mystdio.h"
44 #include "myassert.h"
45 #include "mymath.h"
46 #include "nurbsconsts.h"
47 #include "maplist.h"
48 #include "mapdesc.h"
49 #include "backend.h"
50
51 Maplist::Maplist( Backend& b )
52 : mapdescPool( sizeof( Mapdesc ), 10, "mapdesc pool" ),
53 backend( b )
54 {
55 maps = 0; lastmap = &maps;
56 }
57
58 void
59 Maplist::initialize( void )
60 {
61 freeMaps();
62 define( N_P2D, 0, 2 );
63 define( N_P2DR, 1, 3 );
64 }
65
66 void
67 Maplist::add( long type, int israt, int ncoords )
68 {
69 *lastmap = new(mapdescPool) Mapdesc( type, israt, ncoords, backend );
70 lastmap = &((*lastmap)->next);
71 }
72
73 void
74 Maplist::define( long type, int israt, int ncoords )
75 {
76 Mapdesc *m = locate( type );
77 assert( m == NULL || ( m->isrational == israt && m->ncoords == ncoords ) );
78 add( type, israt, ncoords );
79 }
80
81 void
82 Maplist::remove( Mapdesc *m )
83 {
84 for( Mapdesc **curmap = &maps; *curmap; curmap = &((*curmap)->next) ) {
85 if( *curmap == m ) {
86 *curmap = m->next;
87 m->deleteMe( mapdescPool );
88 return;
89 }
90 }
91 abort();
92 }
93
94 void
95 Maplist::freeMaps( void )
96 {
97 mapdescPool.clear();
98 maps = 0;
99 lastmap = &maps;
100 }
101
102 Mapdesc *
103 Maplist::find( long type )
104 {
105 Mapdesc *val = locate( type );
106 assert( val );
107 return val;
108 }
109
110 Mapdesc *
111 Maplist::locate( long type )
112 {
113 Mapdesc *m;
114 for( m = maps; m; m = m->next )
115 if( m->getType() == type ) break;
116 return m;
117 }