1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 99 unchanged lines hidden (view full) ---

108 /** In-place addition of cycles. */
109 const Cycles& operator+=(const Cycles& cc)
110 { c += cc.c; return *this; }
111
112 /** Greater than comparison used for > Cycles(0). */
113 bool operator>(const Cycles& cc) const
114 { return c > cc.c; }
115
116#endif // SWIG not touching operators
117
118};
119
120/**
121 * Address type
122 * This will probably be moved somewhere else in the near future.
123 * This should be at least as big as the biggest address width in use

--- 45 unchanged lines hidden ---