Uploaded image for project: 'JDK'
  1. JDK
  2. JDK-4209509

nonfatal internal JIT (3.00.072b(x)) error 'Structured Exception(c0000005)'

XMLWordPrintable

    • Icon: Bug Bug
    • Resolution: Cannot Reproduce
    • Icon: P4 P4
    • None
    • 1.1.7
    • vm-legacy



      Name: krT82822 Date: 02/07/99


      C:\Dave\java\Hello>java string
      A nonfatal internal JIT (3.00.072b(x)) error 'Structured Exception(c0000005)' has occurred in :
        'string.main ([Ljava/lang/String;)V': Interpreting method.
        Please report this error in detail to http://java.sun.com/cgi-bin/bugreport.cgi

      source code follows

      -----------------------------------------------

      import java.io.*;

      public class string
        {
          public static void main(String argv[]) // throws IOException
            {
              String array[]={"Fred","Barney","Garth","Rene","Dave","Brian"};
              String tempArray[]=array;
              String tempArray2[]=array;
              String searchWord = "Bob";
              int high, low, mid;
              String currentWord;
              
              System.out.println("\nNow searching for: "+searchWord);
              for (int i = 0; i < array.length; i++)
                {
                  tempArray[i] = tempArray[i].toLowerCase();
                  tempArray2[i] = tempArray2[i].toLowerCase();
                  System.out.print(tempArray[i]+", ");
                }
              System.out.print("\n");
              for (int i = 0; i < array.length; i++)
                {
                  System.out.println(" " + tempArray[i].compareTo(tempArray[i+1]));
                }
      // tempArray = new (array);
              high = array.length - 1;
              low = 0;
              mid = (high + low) / 2;
              currentWord = array[mid];
      /* do
                {
                  if (searchNum > currentNum)
                    {
                      low = mid + 1;
                      mid = (high + low) / 2;
                      currentNum = array[mid];
                    }
                  if (searchNum < currentNum)
                    {
                      high = mid - 1;
                      mid = (high + low) / 2;
                      currentNum = array[mid];
                    }
                  if (searchNum == array[mid])
                    {
                      System.out.println("I have found the number");
                      System.out.println("It is at position " + (mid+1) + " in the array");
                      break;
                    }

                }
              while (low < high);
              if (array[mid] != searchNum) System.out.println("I cannot find the number");
      */
            }
        }
      (Review ID: 53304)
      ======================================================================

            dviswanasunw Deepa Viswanathan (Inactive)
            kryansunw Kevin Ryan (Inactive)
            Votes:
            0 Vote for this issue
            Watchers:
            0 Start watching this issue

              Created:
              Updated:
              Resolved:
              Imported:
              Indexed: