premier tp (86d90ba6) · Commits · Antoine Lemaitre / TP Introduction à la sécurité L2

Changes for src/list.c: 53 added lines, 2 removed lines.
Original line number	Diff line number	Diff line
		#include <stdlib.h>
		#include <stdio.h>
		#include <malloc.h>

		struct cell_t {
		void* val;
		unsigned long int id;
		@@ -7,30 +11,77 @@ struct cell_t {
		typedef struct cell_t* list_t;

		list_t list_empty(){
		return NULL;
		}

		int list_is_empty(list_t l){
		return l == NULL;
		}

		list_t list_push(list_t l, void* x){

		list_t tmp = malloc(sizeof(struct cell_t));
		tmp->val = x;
		tmp->next = l;

		if (list_is_empty(l)){
		tmp->id = 1;
		return tmp;
		}
		tmp->id = l->id+1;
		return tmp;
		}

		list_t list_tail(list_t l){
		return l->next;
		}

		void* list_top(list_t l){
		return l->val;
		}

		void* list_pop(list_t* l){

		if (list_is_empty(*l)){
		return NULL;
		}

		void* list_top(list_t l){
		list_t premierElement = *l;
		void * val = list_top(premierElement);
		*l = list_tail(premierElement);
		free(premierElement);

		return val;
		}

		void list_destroy(list_t l, void (free)(void)){
		void list_destroy(list_t l, void (freeVoid)(void)){
		list_t suivant;

		while(l!= NULL){
		suivant = list_tail(l);
		freeVoid(l->val);
		free(l);
		l = suivant;
		}
		}

		// return the found element or NULL
		void* list_in(list_t l, void* x, int (eq)(void, void*)){
		if (list_empty(l)){
		return NULL;
		}
		list_t tmp = l;
		while(tmp!=NULL){
		if(eq(tmp->val,x)){
		return tmp->val;
		}
		tmp = list_tail(tmp);
		}
		return NULL;

		}

		unsigned long int list_len(list_t l){
		return l->id;
		}

src/list.o

0 → 100644

+9.21 KiB

File added.

No diff preview for this file type.