RE: AccessViolationException originating from mscorjit   

Hi Jeffrey,

We have initially been focusing our efforts on creating a reduced test case. This is now completed, and we have an around 200 lines C# file which only refers System.dll, and only contains safe code. Reducing further generally removes the problem, which is centered around JITting the method ''FordelPræmie". There are some comments in the code, as well, on this issue.

To reproduce you need a 64bit Windows with VS 2008 (ours is with SP1). Then:
1. Select 'Release' as active configuration.
2. Build and run without debug, i.e. CTRL  F5.

Expected: No error.
Actual: System.AccessViolationException.

See the readme.txt file for more information. I hope you will be able to reproduce given this information, and I plan to post it to Connect soon as well.

Sincerly,
Sune Foldager
Edlund A/S

date: Mon, 8 Sep 2008 13:53:56 +0000 (UTC)   author:   Sune Foldager am

Re: AccessViolationException originating from mscorjit   

"Sune Foldager" <sune@community.nospam> wrote in message 
news:41ad1c9137e8cadfe23c4ce87c@msnews.microsoft.com...
> See the readme.txt file for more information. I hope you will be able to 
> reproduce given
> this information, and I plan to post it to Connect soon as well.

If you're looking for a quick temporary workaround (assuming that creatively 
rearranging code didn't work), consider using MethodImplAttribute with 
MethodImplOptions.NoOptimization on the offending method.

date: Mon, 8 Sep 2008 18:34:41 +0400   author:   Pavel Minaev

Triangle of Pascal   

c #: Implementing the method Int [,] TrianglePascal (int n) which
returns the triangle to

the level of Pascal N.

      public static int[,] TrianglePascal(int n)
      {
         int[,] arr = new int[n+1,n+1];
         for(int i=0;i<n+1;i++)
         {
            for(int k=0;k<n+1;k++)
            {
            if(k==0)
            arr[i,k]=1;
             else if(i==k)arr[i,k]=1;
             }
         }
         for(int i=0;i<n+1;i++)
         {
         for(int k=0;k<n+1+1;k++){
               if(i>=1&&i+1<n+1&&k+1<n+1)
               {
                  if(arr[i,k]!=0&&arr[i,k+1]!=0)
                  arr[i+1,k+1]=arr[i,k]+arr[i,k+1];
               }
            }
           }
            return arr;
      }

date: Mon, 8 Sep 2008 10:39:26 -0700 (PDT)   author:   J Ivan P Silvestre