1
/*******************************************************************************
2
*Copyright (c) 2009 Eucalyptus Systems, Inc.
4
* This program is free software: you can redistribute it and/or modify
5
* it under the terms of the GNU General Public License as published by
6
* the Free Software Foundation, only version 3 of the License.
9
* This file is distributed in the hope that it will be useful, but WITHOUT
10
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14
* You should have received a copy of the GNU General Public License along
15
* with this program. If not, see <http://www.gnu.org/licenses/>.
17
* Please contact Eucalyptus Systems, Inc., 130 Castilian
18
* Dr., Goleta, CA 93101 USA or visit <http://www.eucalyptus.com/licenses/>
19
* if you need additional information or have any questions.
21
* This file may incorporate work covered under the following copyright and
24
* Software License Agreement (BSD License)
26
* Copyright (c) 2008, Regents of the University of California
27
* All rights reserved.
29
* Redistribution and use of this software in source and binary forms, with
30
* or without modification, are permitted provided that the following
33
* Redistributions of source code must retain the above copyright notice,
34
* this list of conditions and the following disclaimer.
36
* Redistributions in binary form must reproduce the above copyright
37
* notice, this list of conditions and the following disclaimer in the
38
* documentation and/or other materials provided with the distribution.
40
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
41
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
42
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
43
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
44
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
45
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
46
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
47
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
48
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
49
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
50
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. USERS OF
51
* THIS SOFTWARE ACKNOWLEDGE THE POSSIBLE PRESENCE OF OTHER OPEN SOURCE
52
* LICENSED MATERIAL, COPYRIGHTED MATERIAL OR PATENTED MATERIAL IN THIS
53
* SOFTWARE, AND IF ANY SUCH MATERIAL IS DISCOVERED THE PARTY DISCOVERING
54
* IT MAY INFORM DR. RICH WOLSKI AT THE UNIVERSITY OF CALIFORNIA, SANTA
55
* BARBARA WHO WILL THEN ASCERTAIN THE MOST APPROPRIATE REMEDY, WHICH IN
56
* THE REGENTS’ DISCRETION MAY INCLUDE, WITHOUT LIMITATION, REPLACEMENT
57
* OF THE CODE SO IDENTIFIED, LICENSING OF THE CODE SO IDENTIFIED, OR
58
* WITHDRAWAL OF THE CODE CAPABILITY TO THE EXTENT NEEDED TO COMPLY WITH
59
* ANY SUCH LICENSES OR RIGHTS.
60
*******************************************************************************/
62
* Author: chris grzegorczyk <grze@eucalyptus.com>
64
package com.eucalyptus.cluster;
66
import com.eucalyptus.entities.VmType;
68
public class VmTypeAvailability implements Comparable {
71
private int available;
73
public VmTypeAvailability( final VmType type, final int max, final int available ) {
76
this.available = available;
79
public VmType getType() {
83
public void decrement( int quantity ) {
84
this.available -= quantity;
85
this.available = ( this.available < 0 ) ? 0 : this.available;
92
public void setMax( final int max ) {
96
public int getAvailable() {
100
public void setAvailable( final int available ) {
101
this.available = available;
105
public boolean equals( final Object o ) {
106
if ( this == o ) return true;
107
if ( !( o instanceof VmTypeAvailability ) ) return false;
109
VmTypeAvailability that = ( VmTypeAvailability ) o;
111
if ( !type.equals( that.type ) ) return false;
117
public int hashCode() {
118
return type.hashCode();
121
public int compareTo( final Object o ) {
122
VmTypeAvailability v = ( VmTypeAvailability ) o;
123
if ( v.getAvailable() == this.getAvailable() ) return this.type.compareTo( v.getType() );
124
return v.getAvailable() - this.getAvailable();
128
public String toString() {
129
return "VmTypeAvailability{" +
132
", available=" + available +
136
public static VmTypeAvailability ZERO = new ZeroTypeAvailability();
138
static class ZeroTypeAvailability extends VmTypeAvailability {
139
ZeroTypeAvailability() {
140
super( new VmType( "ZERO", -1, -1, -1 ), 0, 0 );
144
public int compareTo( final Object o ) {
145
VmTypeAvailability v = ( VmTypeAvailability ) o;
146
if ( v == ZERO ) return 0;
147
if ( v.getAvailable() > 0 ) return 1;
152
public void setAvailable( final int available ) {}
155
public void decrement( final int quantity ) {}
158
public boolean equals( final Object o ) {
159
if ( this == o ) return true;