int sumFirst(int n)       sumFirst:              
{                                                                
  int sum = 0;            sum = 0                
                          goto L2                
  while(n > 0)         L3:                       
                          reg1 = n               
    sum += n;             sum = sum + reg1
    n--;                  n = n - 1              
                       L2:                       
  }                       if(n > 0) goto L3   
  return sum              reg1 = sum             
                          return                 
}