Test6805724.java revision 568
568N/A * Copyright 2009 Sun Microsystems, Inc. All Rights Reserved. 568N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 568N/A * This code is free software; you can redistribute it and/or modify it 568N/A * under the terms of the GNU General Public License version 2 only, as 568N/A * published by the Free Software Foundation. 568N/A * This code is distributed in the hope that it will be useful, but WITHOUT 568N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 568N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 568N/A * version 2 for more details (a copy is included in the LICENSE file that 568N/A * accompanied this code). 568N/A * You should have received a copy of the GNU General Public License version 568N/A * 2 along with this work; if not, write to the Free Software Foundation, 568N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 568N/A * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 568N/A * CA 95054 USA or visit www.sun.com if you need additional information or 568N/A * @summary ModLNode::Ideal() generates functionally incorrect graph when divisor is any (2^k-1) constant. 568N/A // Initialize DIVISOR so that it is final in this class. 568N/A // This one is required for the Class.forName() in main. 568N/A // Iterate over all 2^k-1 divisors.