1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
| #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <stdbool.h>
#include <unistd.h>
#include <pthread.h>
#include <signal.h>
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/sem.h>
#define NB_THREADS 10
#define MAXCHAR 25
#define UNUSED_PARAM(param) ((void) param)
struct User
{
struct User *next;
struct User *prev;
char motdepasse[MAXCHAR];
char nomsalon[MAXCHAR];
char surnom[MAXCHAR];
int handle;
};
int Sem1;
int Sem2;
struct User First;
struct User Last;
static int sem_transf (int const key)
{
int sid = semget (key, 1, 0666 | IPC_CREAT);
if (sid == -1)
{
puts ("Erreur semget");
exit (EXIT_FAILURE);
}
return sid;
}
/* convertit une clef en sémaphore */
static void semcall (int const sid, short const op)
{
struct sembuf sb = {.sem_op = op};
if (semop (sid, &sb, 1) == -1)
{
puts ("Erreur semop");
exit (-2);
}
}
static void p (int const sem)
{
semcall (sem, -1);
}
static void v (int const sem)
{
semcall (sem, 1);
}
static int DeleteUser (char const * const surnom)
{
for (struct User *Temp = First.next, *Old = &First; Temp != NULL; Temp = Temp->next)
{
if (strcmp (Temp->surnom, surnom) == 0)
{
struct User *ToDelete = Temp;
Old->next = Temp->next;
Temp = Temp->next;
Temp->prev = Old;
free (ToDelete);
return 1;
}
Old = Temp;
}
puts ("Erreur : L'utilisateur n'a pu etre trouve !");
return 0;
}
static void traitement_signal (int const signum)
{
UNUSED_PARAM (signum);
puts ("SIGINT recu !");
while (First.next != &Last)
{
puts ("yop ! ! !");
DeleteUser ("");
}
#if 0
struct User *Temp;
struct User *Old;
puts ("yop !");
Old = Last.prev;
Temp = Temp->prev;
free (Old);
Last.prev = Temp;
#endif
}
static void UserInit (void)
{
First.next = &Last;
Last.prev = &First;
}
static bool AddUser (struct User * const UserRecu)
{
bool i = false;
struct User *Temp = &First;
for (; Temp != NULL; Temp = Temp->next)
{
if (strcmp (Temp->surnom, UserRecu->surnom) == 0)
{
i = true;
}
}
Temp = &First;
if (i == false)
{
UserRecu->prev = &First;
UserRecu->next = Temp->next;
First.next = UserRecu;
Temp = Temp->next;
Temp = Temp->next;
Temp->prev = UserRecu;
return true;
}
else
{
puts ("Erreur : Surnom deja en cours d'utilisation !");
return false;
}
}
static void AfficheListe (void)
{
unsigned i = 1;
puts ("Liste d'User :");
for (struct User *Temp = First.next; Temp != NULL; Temp = Temp->next, i++)
{
printf ("\t\t%p\n"
"%d -> %p %s %p\n",
(void*) Temp, i, (void*) Temp->prev, Temp->surnom, (void*) Temp->next);
}
}
static void *fctThread (void *arg)
{
struct User *PUser = arg;
for (unsigned i = 0; i < 10; i++)
{
bool okay = true;
for (unsigned j = 0; j < 5; j++)
{
PUser->surnom[j] = (char)(rand () % 26 + 'a');
}
PUser->surnom[5] = '\0';
PUser->handle = -1;
printf ("User = %s\n", PUser->surnom);
p (Sem1);
okay = AddUser (PUser);
v (Sem2);
if (okay == true)
PUser++;
else
i--;
}
return NULL;
}
static void *SynchroThread (void *a)
{
UNUSED_PARAM (a);
while (true)
{
v (Sem1);
p (Sem2);
}
return NULL;
}
int main (void)
{
struct User *PUser = NULL;
struct User *un = malloc (sizeof *un);
struct User *deux = malloc (sizeof *deux);
struct User *trois = malloc (sizeof *trois);
struct User *quatre = malloc (sizeof *quatre);
struct User *cinq = malloc (sizeof *cinq);
struct sigaction sigAct = {.sa_handler = traitement_signal};
sigemptyset (&sigAct.sa_mask);
pthread_t MonThread[10];
sigaction (SIGINT, &sigAct, NULL);
Sem1 = sem_transf (12345);
Sem2 = sem_transf (67890);
srand ((unsigned) time (NULL));
UserInit ();
int err = pthread_create (&(pthread_t){0}, NULL, SynchroThread, NULL);
if (err)
{
printf ("ERREUR; code de retour pthread_create() est %d\n", err);
}
for (unsigned i = 0; i < NB_THREADS; i++)
{
PUser = malloc (10 * sizeof *PUser);
err = pthread_create (&MonThread[i], NULL, fctThread, PUser);
if (err)
{
printf ("ERREUR; code de retour pthread_create() est %d\n", err);
}
}
for (unsigned i = 0; i < NB_THREADS; i++)
{
pthread_join (MonThread[i], NULL);
}
strcpy (un->surnom, "un");
AddUser (un);
strcpy (deux->surnom, "deux");
AddUser (deux);
strcpy (trois->surnom, "trois");
AddUser (trois);
strcpy (quatre->surnom, "quatre");
AddUser (quatre);
strcpy (cinq->surnom, "cinq");
AddUser (cinq);
AfficheListe ();
DeleteUser (un->surnom);
DeleteUser (quatre->surnom);
DeleteUser (cinq->surnom);
puts ("ici ?\n");
un = PUser->next;
puts ("ici ?\n");
DeleteUser (PUser->surnom);
puts ("ici ?\n");
DeleteUser (un->surnom);
puts ("ici ?\n");
AfficheListe ();
getchar ();
return 0;
} |
Partager