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
|
/*
* Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Sun designates this
* particular file as subject to the "Classpath" exception as provided
* by Sun in the LICENSE file that accompanied this code.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*
*/
package javax.media.j3d;
class SwitchState {
// a bitmask to track the composite switchOn state in a nested switch
// tree. A bit is set if a branch is switched off at the switch
// level specified by the position of the bit in the bitmask
// It is an array of long in order to support infinite deep nested
// switch tree
long compositeSwitchMask[] = new long[]{0};
// switchOn state cached in user thread
boolean cachedSwitchOn = true;
// switchOn state in current time, is true if compositeSwitchMask == 0
boolean currentSwitchOn = true;
// switchOn state in last time, is true if compositeSwitchMask == 0
boolean lastSwitchOn = true;
boolean initialized = false;
CachedTargets cachedTargets = null;
boolean inSwitch = false;
public SwitchState(boolean inSwitch) {
this.inSwitch = inSwitch;
initialized = !inSwitch;
}
void dump() {
System.err.println(
" MASK " + compositeSwitchMask[0] +
" CACH " + cachedSwitchOn +
" CURR " + currentSwitchOn +
" LAST " + lastSwitchOn);
}
void updateCompositeSwitchMask(int switchLevel, boolean switchOn) {
if (switchLevel < 64) {
if (switchOn) {
compositeSwitchMask[0] &= ~(1 << switchLevel);
} else {
compositeSwitchMask[0] |= (1 << switchLevel);
}
} else {
int i;
int index = switchLevel/64;
int offset = switchLevel%64;
if (index > compositeSwitchMask.length) {
long newCompositeSwitchMask[] = new long[index+1];
System.arraycopy(compositeSwitchMask, 0,
newCompositeSwitchMask, 0, index);
compositeSwitchMask = newCompositeSwitchMask;
}
if (switchOn) {
compositeSwitchMask[index] &= ~(1 << offset);
} else {
compositeSwitchMask[index] |= (1 << offset);
}
}
}
void initSwitchOn() {
boolean switchOn = evalCompositeSwitchOn();
currentSwitchOn = lastSwitchOn = cachedSwitchOn = switchOn;
//currentSwitchOn = cachedSwitchOn = switchOn;
initialized = true;
}
void updateCurrentSwitchOn() {
currentSwitchOn = !currentSwitchOn;
}
void updateLastSwitchOn() {
lastSwitchOn = currentSwitchOn;
}
void updateCachedSwitchOn() {
cachedSwitchOn = !cachedSwitchOn;
}
boolean evalCompositeSwitchOn() {
boolean switchOn;
if (compositeSwitchMask.length == 1) {
switchOn = (compositeSwitchMask[0] == 0);
} else {
switchOn = true;
for (int i=0; i<compositeSwitchMask.length; i++) {
if (compositeSwitchMask[i] != 0) {
switchOn = false;
break;
}
}
}
return switchOn;
}
}
|
