The aim of this project is to get familiar with assembly language.

📝 PDF

• FILE LINK

• You must write 64 bits ASM. Beware of the "calling convention".
• You can’t do inline ASM, you must do ’.s’ files.
• You must compile your assembly code with nasm.
• You must use the Intel syntax, not the AT&T.

The library must be called libasm.a.

You must submit a main that will test your functions and that will compile with your library to show that it’s functional.

You must rewrite the following functions in asm:

• ft_strlen (man 3 strlen)

  size_t ft_strlen(const char *s);

• ft_strcpy (man 3 strcpy)

  char *ft_strcpy(char *dst, const char *src);

• ft_strcmp (man 3 strcmp)

  int ft_strcmp(const char *s1, const char *s2);

• ft_write (man 2 write)

  ssize_t ft_write(int fd, const char *buf, size_t count);

• ft_read (man 2 read)

  ssize_t ft_read(int fd, const char *buf, size_t count);

• ft_strdup (man 3 strdup, you can call to malloc)

  char *ft_strdup(const char *s1);

You must check for errors during syscalls and properly set them when needed

Your code must set the variable errno properly.

For that, you are allowed to call the extern ___error.

You can rewrite these functions in asm. The linked list function will use the following structure:

typedef sturct      s_list
{
    void            *data;
    struct s_list   *next;
}                   t_list;

• ft_atoi_base (like the one in the piscine)

  int ft_atoi_base(char *str, char *base);

  • Write a function that converts the initial portion of the string pointed by str to int representation.
  • str is in a specific base given as a second parameter.
  • excepted the base rule, the function should work exactly like ft_atoi.
  • If there’s an invalid argument, the function should return 0. Examples of invalid
  • arguments :
    • base is empty or size of 1;
    • base contains the same character twice ;
    • base contains + or - or whitespaces;

• ft_list_push_front (like the one in the piscine)

  void ft_list_push_front(t_list **begin_list, void *data);

  • Create the function ft_list_push_front which adds a new element of type t_list to the beginning of the list.
  • It should assign data to the given argument.
  • If necessary, it’ll update the pointer at the beginning of the list.

• ft_list_size (like the one in the piscine)

  int ft_list_size(t_list *begin_list);

  • Create the function ft_list_size which returns the number of elements in the list.

• ft_list_sort (like the one in the piscine)

  void ft_list_sort(t_list **begin_list, int (*cmp)());

  • Create the function ft_list_sort which sorts the list’s elements by ascending order by comparing two elements by comparing their data with a function.
  • Function pointed by cmp will be used as follows : (*cmp)(list_ptr->data, list_other_ptr->data);

• ft_list_remove_if (like the one in the piscine)

  void ft_list_remove_if(t_list **begin_list, void *data_ref, int (*cmp)(), void (*free_fct)(void *));

  • Create the function ft_list_remove_if which removes from the list, all elements whose data compared to data_ref using cmp, makes cmp return 0.
  • The data from an element to be erased should be freed using free_fct
  • Function pointed by cmp and by free_fct will be used as follows : (*cmp)(list_ptr->data, data_ref); (*free_fct)(list_ptr->data);