| 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 |
* bin.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 "bin.h" |
| 46 |
|
| 47 |
/*---------------------------------------------------------------------------- |
| 48 |
* Constructor and destructor |
| 49 |
*---------------------------------------------------------------------------- |
| 50 |
*/ |
| 51 |
Bin::Bin() |
| 52 |
{ |
| 53 |
head = NULL; |
| 54 |
} |
| 55 |
|
| 56 |
Bin::~Bin() |
| 57 |
{ |
| 58 |
assert( head == NULL); |
| 59 |
} |
| 60 |
|
| 61 |
/*---------------------------------------------------------------------------- |
| 62 |
* remove_this_arc - remove given Arc_ptr from bin |
| 63 |
*---------------------------------------------------------------------------- |
| 64 |
*/ |
| 65 |
|
| 66 |
void |
| 67 |
Bin::remove_this_arc( Arc_ptr arc ) |
| 68 |
{ |
| 69 |
Arc_ptr *j; |
| 70 |
for( j = &(head); (*j != 0) && (*j != arc); j = &((*j)->link) ); |
| 71 |
|
| 72 |
if( *j != 0 ) { |
| 73 |
if( *j == current ) |
| 74 |
current = (*j)->link; |
| 75 |
*j = (*j)->link; |
| 76 |
} |
| 77 |
} |
| 78 |
|
| 79 |
/*---------------------------------------------------------------------------- |
| 80 |
* numarcs - count number of arcs in bin |
| 81 |
*---------------------------------------------------------------------------- |
| 82 |
*/ |
| 83 |
|
| 84 |
int |
| 85 |
Bin::numarcs() |
| 86 |
{ |
| 87 |
long count = 0; |
| 88 |
for( Arc_ptr jarc = firstarc(); jarc; jarc = nextarc() ) |
| 89 |
count++; |
| 90 |
return count; |
| 91 |
} |
| 92 |
|
| 93 |
/*---------------------------------------------------------------------------- |
| 94 |
* adopt - place an orphaned arcs into their new parents bin |
| 95 |
*---------------------------------------------------------------------------- |
| 96 |
*/ |
| 97 |
|
| 98 |
void |
| 99 |
Bin::adopt() |
| 100 |
{ |
| 101 |
markall(); |
| 102 |
|
| 103 |
Arc_ptr orphan; |
| 104 |
while( orphan = removearc() ) { |
| 105 |
for( Arc_ptr parent = orphan->next; parent != orphan; parent = parent->next ) { |
| 106 |
if (! parent->ismarked() ) { |
| 107 |
orphan->link = parent->link; |
| 108 |
parent->link = orphan; |
| 109 |
orphan->clearmark(); |
| 110 |
break; |
| 111 |
} |
| 112 |
} |
| 113 |
} |
| 114 |
} |
| 115 |
|
| 116 |
|
| 117 |
/*---------------------------------------------------------------------------- |
| 118 |
* show - print out descriptions of the arcs in the bin |
| 119 |
*---------------------------------------------------------------------------- |
| 120 |
*/ |
| 121 |
|
| 122 |
void |
| 123 |
Bin::show( char *name ) |
| 124 |
{ |
| 125 |
#ifndef NDEBUG |
| 126 |
dprintf( "%s\n", name ); |
| 127 |
for( Arc_ptr jarc = firstarc(); jarc; jarc = nextarc() ) |
| 128 |
jarc->show( ); |
| 129 |
#endif |
| 130 |
} |
| 131 |
|
| 132 |
|
| 133 |
|
| 134 |
/*---------------------------------------------------------------------------- |
| 135 |
* markall - mark all arcs with an identifying tag |
| 136 |
*---------------------------------------------------------------------------- |
| 137 |
*/ |
| 138 |
|
| 139 |
void |
| 140 |
Bin::markall() |
| 141 |
{ |
| 142 |
for( Arc_ptr jarc=firstarc(); jarc; jarc=nextarc() ) |
| 143 |
jarc->setmark(); |
| 144 |
} |
| 145 |
|
| 146 |
/*---------------------------------------------------------------------------- |
| 147 |
* listBezier - print out all arcs that are untessellated border arcs |
| 148 |
*---------------------------------------------------------------------------- |
| 149 |
*/ |
| 150 |
|
| 151 |
void |
| 152 |
Bin::listBezier( void ) |
| 153 |
{ |
| 154 |
for( Arc_ptr jarc=firstarc(); jarc; jarc=nextarc() ) { |
| 155 |
if( jarc->isbezier( ) ) { |
| 156 |
assert( jarc->pwlArc->npts == 2 ); |
| 157 |
TrimVertex *pts = jarc->pwlArc->pts; |
| 158 |
REAL s1 = pts[0].param[0]; |
| 159 |
REAL t1 = pts[0].param[1]; |
| 160 |
REAL s2 = pts[1].param[0]; |
| 161 |
REAL t2 = pts[1].param[1]; |
| 162 |
#ifndef NDEBUG |
| 163 |
dprintf( "arc (%g,%g) (%g,%g)\n", s1, t1, s2, t2 ); |
| 164 |
#endif |
| 165 |
} |
| 166 |
} |
| 167 |
} |
| 168 |
|