diff options
author | Alexander Sulfrian <alexander@sulfrian.net> | 2010-06-08 08:22:05 +0200 |
---|---|---|
committer | Alexander Sulfrian <alexander@sulfrian.net> | 2010-06-08 08:22:05 +0200 |
commit | d7c5ad7d6263fd1baf9bfdbaa4c50b70ef2fbdb2 (patch) | |
tree | ae0b65da6432f4c26c8d5a7319efbda5d172846c /infrastructure/rhino1_7R1/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java | |
parent | fa61221dcd89fcd72cba2c97971626f456c86e5d (diff) | |
download | etherpad-d7c5ad7d6263fd1baf9bfdbaa4c50b70ef2fbdb2.tar.gz etherpad-d7c5ad7d6263fd1baf9bfdbaa4c50b70ef2fbdb2.tar.xz etherpad-d7c5ad7d6263fd1baf9bfdbaa4c50b70ef2fbdb2.zip |
reverted folder structure change for better mergeing with upstream
Diffstat (limited to 'infrastructure/rhino1_7R1/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java')
-rw-r--r-- | infrastructure/rhino1_7R1/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java | 134 |
1 files changed, 0 insertions, 134 deletions
diff --git a/infrastructure/rhino1_7R1/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java b/infrastructure/rhino1_7R1/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java deleted file mode 100644 index 607e649..0000000 --- a/infrastructure/rhino1_7R1/src/org/mozilla/javascript/optimizer/DataFlowBitSet.java +++ /dev/null @@ -1,134 +0,0 @@ -/* ***** BEGIN LICENSE BLOCK ***** - * Version: MPL 1.1/GPL 2.0 - * - * The contents of this file are subject to the Mozilla Public License Version - * 1.1 (the "License"); you may not use this file except in compliance with - * the License. You may obtain a copy of the License at - * http://www.mozilla.org/MPL/ - * - * Software distributed under the License is distributed on an "AS IS" basis, - * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License - * for the specific language governing rights and limitations under the - * License. - * - * The Original Code is Rhino code, released - * May 6, 1999. - * - * The Initial Developer of the Original Code is - * Netscape Communications Corporation. - * Portions created by the Initial Developer are Copyright (C) 1997-1999 - * the Initial Developer. All Rights Reserved. - * - * Contributor(s): - * Norris Boyd - * Roger Lawrence - * - * Alternatively, the contents of this file may be used under the terms of - * the GNU General Public License Version 2 or later (the "GPL"), in which - * case the provisions of the GPL are applicable instead of those above. If - * you wish to allow use of your version of this file only under the terms of - * the GPL and not to allow others to use your version of this file under the - * MPL, indicate your decision by deleting the provisions above and replacing - * them with the notice and other provisions required by the GPL. If you do - * not delete the provisions above, a recipient may use your version of this - * file under either the MPL or the GPL. - * - * ***** END LICENSE BLOCK ***** */ - - - -package org.mozilla.javascript.optimizer; - -class DataFlowBitSet { - - private int itsBits[]; - private int itsSize; - - DataFlowBitSet(int size) - { - itsSize = size; - itsBits = new int[(size + 31) >> 5]; - } - - void set(int n) - { - if (!(0 <= n && n < itsSize)) badIndex(n); - itsBits[n >> 5] |= 1 << (n & 31); - } - - boolean test(int n) - { - if (!(0 <= n && n < itsSize)) badIndex(n); - return ((itsBits[n >> 5] & (1 << (n & 31))) != 0); - } - - void not() - { - int bitsLength = itsBits.length; - for (int i = 0; i < bitsLength; i++) - itsBits[i] = ~itsBits[i]; - } - - void clear(int n) - { - if (!(0 <= n && n < itsSize)) badIndex(n); - itsBits[n >> 5] &= ~(1 << (n & 31)); - } - - void clear() - { - int bitsLength = itsBits.length; - for (int i = 0; i < bitsLength; i++) - itsBits[i] = 0; - } - - void or(DataFlowBitSet b) - { - int bitsLength = itsBits.length; - for (int i = 0; i < bitsLength; i++) - itsBits[i] |= b.itsBits[i]; - } - - public String toString() - { - StringBuffer sb = new StringBuffer(); - sb.append("DataFlowBitSet, size = "); - sb.append(itsSize); - sb.append('\n'); - int bitsLength = itsBits.length; - for (int i = 0; i < bitsLength; i++) { - sb.append(Integer.toHexString(itsBits[i])); - sb.append(' '); - } - return sb.toString(); - } - - boolean df(DataFlowBitSet in, DataFlowBitSet gen, DataFlowBitSet notKill) - { - int bitsLength = itsBits.length; - boolean changed = false; - for (int i = 0; i < bitsLength; i++) { - int oldBits = itsBits[i]; - itsBits[i] = (in.itsBits[i] | gen.itsBits[i]) & notKill.itsBits[i]; - changed |= (oldBits != itsBits[i]); - } - return changed; - } - - boolean df2(DataFlowBitSet in, DataFlowBitSet gen, DataFlowBitSet notKill) - { - int bitsLength = itsBits.length; - boolean changed = false; - for (int i = 0; i < bitsLength; i++) { - int oldBits = itsBits[i]; - itsBits[i] = (in.itsBits[i] & notKill.itsBits[i]) | gen.itsBits[i]; - changed |= (oldBits != itsBits[i]); - } - return changed; - } - - private void badIndex(int n) - { - throw new RuntimeException("DataFlowBitSet bad index " + n); - } -} |