1 /* 2 * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code 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 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 /** 25 * @test 26 * @bug 7029152 27 * @summary Ideal nodes for String intrinsics miss memory edge optimization 28 * 29 * @run main/othervm -Xbatch Test 30 */ 31 32 public class Test { 33 34 static final String str = "11111xx11111xx1x"; 35 static int idx = 0; 36 37 static int IndexOfTest(String str) { 38 return str.indexOf("11111xx1x"); 39 } 40 41 public static void main(String args[]) { 42 final int ITERS=2000000; 43 44 for (int i=0; i<ITERS; i++) { 45 idx = IndexOfTest(str); 46 } 47 System.out.println("IndexOf = " + idx); 48 } 49 }