Adjust test cases to match the fact that methods are now explicit pointer values, not explicit

llvm-svn: 702

test/Feature/allocatest2.ll

@@ -10,7 +10,7 @@ bb1:            ;;<label>
         %reg110 = shl uint %n, ubyte 2          ;;<uint>
         %reg108 = alloca [ubyte], uint %reg110            ;;<ubyte*>
         %cast1000 = cast [ubyte]* %reg108 to uint*                ;;<uint*>
-        call void(uint, uint*) %_Z12combinationsjPj(uint %n, uint* %cast1000)                ;;<void>
+        call void %_Z12combinationsjPj(uint %n, uint* %cast1000)                ;;<void>
         %cast113 = cast uint %reg110 to ulong*          ;;<ulong*>
 	cast uint 7 to ulong *
         %reg114 = add ulong* %cast113, %0                ;;<ulong*>
@@ -19,7 +19,7 @@ bb1:            ;;<label>
         %cast1001 = cast ulong* %reg117 to uint         ;;<uint>
         %reg118 = alloca [ubyte], uint %cast1001          ;;<ubyte*>
         %cast1002 = cast [ubyte]* %reg118 to uint*                ;;<uint*>
-        call void(uint, uint*) %_Z12combinationsjPj(uint %n, uint* %cast1002)                ;;<void>
+        call void %_Z12combinationsjPj(uint %n, uint* %cast1002)                ;;<void>
         ret void                ;;<void>
 end
 

test/Feature/calltest.ll

@@ -5,7 +5,7 @@ implementation
 
 int "main"(int %argc)   ; TODO: , sbyte **argv, sbyte **envp)
 begin
-        %retval = call int (int) %test(int %argc)
+        %retval = call int (int) *%test(int %argc)
         %two    = add int %retval, %retval
         ret int %two
 end

test/Feature/prototype.ll

@@ -4,7 +4,7 @@ declare int "bar"(int %in)
 
 int "foo"(int %blah)
 begin
-  %xx = call int(int) %bar(int %blah)
+  %xx = call int %bar(int %blah)
   ret int %xx
 end
 

test/Feature/testvarargs.ll

@@ -5,7 +5,7 @@ declare int "printf"(sbyte*, ...)   ;; Prototype for: int __builtin_printf(const
 int "testvarar"()
 begin
 	cast int 0 to sbyte*
-	call int(sbyte*, ...) %printf(sbyte * %0, int 12, sbyte 42);
+	call int(sbyte*, ...) *%printf(sbyte * %0, int 12, sbyte 42);
 	ret int %0
 end
 

test/fib.ll

@@ -13,8 +13,8 @@ BaseCase:
 RecurseCase:
   %n2 = sub ulong %n, 2
   %n1 = sub ulong %n, 1
-  %f2 = call ulong(ulong) %fib(ulong %n2)
+  %f2 = call ulong(ulong) * %fib(ulong %n2)
-  %f1 = call ulong(ulong) %fib(ulong %n1)
+  %f1 = call ulong(ulong) * %fib(ulong %n1)
   %result = add ulong %f2, %f1
   ret ulong %result
 end
@@ -31,6 +31,6 @@ HasArg:
 Continue:
   %n = phi int [%n1, %HasArg], [1, %0]
   %N = cast int %n to ulong
-  %F = call ulong(ulong) %fib(ulong %N)
+  %F = call ulong(ulong) *%fib(ulong %N)
   ret ulong %F
 end

test/inlinetest.ll

@@ -12,7 +12,7 @@ int "FuncToInlineInto"(int %arg)     ; Instrs can be const prop'd away
 begin
 	%x = add int %arg, 1
         %y = sub int 1, -1
-        %p = call int() %FuncToInline()
+        %p = call int %FuncToInline()
         %z = add int %x, %y
         %q = add int %p, %z
 
@@ -21,7 +21,7 @@ end
 
 int "main"()
 begin
-        %z = call int(int) %FuncToInlineInto(int 1)
+        %z = call int %FuncToInlineInto(int 1)
         ret int %z
 end
 

test/sched.ll

@@ -25,6 +25,6 @@ bb1:
 
 bb2:
 	%Msg = cast ulong 0 to sbyte *
-	call int (sbyte*, int, float) %printf(sbyte* %Msg, int %m1, float %z3)
+	call int %printf(sbyte* %Msg, int %m1, float %z3)
 	ret int 0
 end