Question

Assembly Language 64- bit system

Description:

You are responsible to implement several assembly functions to perform the simple arithmetic calculations for 2 64-bit integers. These functions will use the C function signature but the main logic within this function should be inline assembly code using the ASM block similar to the assembly example shown in class.

1. long XOR ( long op1, long op2 )- xor will return the result of bit exclusive OR of op1 / op2- can use XOR instruction

Template:

p1sample.cpp

/* CS47 - Project #1 template */

#include

#include

#include

long factorial (long n)

{

if (n == 1)

return 1;

else

return n * factorial(n - 1);

}

int main(int argc, char** argv)

{

long op1, op2, result;

op1 = op2 = result = 0;

if (argc != 3)

{

printf("Usage: %s op1 op2 (two integers)\n", argv[0]);

return 1;

}

op1 = atol(argv[1]);

op2 = atol(argv[2]);

printf("Operand 1 = %ld x%016lx Operand 2 = %ld x%016lx\n", op1,op1,op2,op2);

result = add(op1, op2);

printf("Add():\t%10ld x%016lx\n", result, result);

result = mult(op1, op2);

printf("Mult():\t%10ld x%016lx\n", result, result);

if (op2 == 0)

{

printf("Mod Error: Divide by 0\n");

result = 0;

}

else

{

result = mod(op1, op2);

printf("Mod():\t%10ld x%016lx\n", result, result);

}

if (op2 < 0)

{

printf("Error: Shift count must be >= 0\n");

result = 0;

}

else

{

result = shift(op1, 0, op2);

printf("ShiftL:\t%10ld x%016lx\n", result, result);

result = shift(op1, 1, op2);

printf("ShiftR:\t%10ld x%016lx\n", result, result);

}

if (op1 <= 0)

{

printf("Error: Factorial input must be a positive integer >=1\n");

result = 0;

}

else

{

result = factorial(op1);

printf("Fact():\t%10ld x%016lx\n\n", result, result);

}

return 0;

}

Sample output in this sequence:

Operand 1 = 10 x000000000000000a Operand 2 = 5 x0000000000000005

Add(): 15 x000000000000000f

XOR(): 15 x000000000000000f

Mult(): 50 x0000000000000032

Mod(): 0 x0000000000000000

ShiftL: 320 x0000000000000140

ShiftR: 0 x0000000000000000

RotateL: 320 x0000000000000140

RotateR:-6341068275337658368 xa800000000000000

Fact(): 3628800 x0000000000375f00

Answer 1

#include<stdio.h>

#include<stdlib.h>
#define INT_BITS 32

long factorial (long n)
  
{
  
if (n == 1)
  
return 1;
  
else
  
return n * factorial(n - 1);
  
}
long add(long op1,long op2){
       return op1+op2;
   }
long mult(long op1,long op2){
   return op1*op2;
   }
long mod(long op1,long op2){
       return op1%op2;
   }
long shift(long op1,int a,int op2){
   if(a==0){
       return op1<<op2;
   }
   else{
       return op1>>op2;
   }
}

int main(int argc, char** argv)

{

long op1, op2, result;
  
op1 = op2 = result = 0;
  
if (argc != 3)
  
{
  
printf("Usage: %s op1 op2 (two integers)\n", argv[0]);
  
return 1;
  
}
  
op1 = atol(argv[1]);
  
op2 = atol(argv[2]);
  
printf("Operand 1 = %ld x%016lx Operand 2 = %ld x%016lx\n", op1,op1,op2,op2);
  
result = add(op1, op2);
  
printf("Add():\t%10ld x%016lx\n", result, result);
  
result = mult(op1, op2);
  
printf("Mult():\t%10ld x%016lx\n", result, result);
  
if (op2 == 0)
  
{
  
printf("Mod Error: Divide by 0\n");
  
result = 0;
  
}
  
else
  
{
  
result = mod(op1, op2);
  
printf("Mod():\t%10ld x%016lx\n", result, result);
  
}
  
if (op2 < 0)
  
{
  
printf("Error: Shift count must be >= 0\n");
  
result = 0;
  
}
  
else
  
{
  
result = shift(op1, 0, op2);
  
printf("ShiftL:\t%10ld x%016lx\n", result, result);
  
result = shift(op1, 1, op2);
  
printf("ShiftR:\t%10ld x%016lx\n", result, result);
  
}
  
if (op1 <= 0)
  
{
  
printf("Error: Factorial input must be a positive integer >=1\n");
  
result = 0;
  
}
  
else
  
{
  
result = factorial(op1);
  
printf("Fact():\t%10ld x%016lx\n\n", result, result);
  
}

return 0;

}