-/***************** Centralized Mutual Exclusion Algorithm *********************/
-/* This example implements a centralized mutual exclusion algorithm. */
-/* CS requests of client 2 not satisfied */
-/* LTL property checked : G(r->F(cs)); (r=request of CS, cs=CS ok) */
-/******************************************************************************/
+/* Copyright (c) 2012-2019. The SimGrid Team. All rights reserved. */
-#include "msg/msg.h"
-#include "mc/mc.h"
-#include "xbt/automaton.h"
-#include "xbt/automatonparse_promela.h"
-#include "bugged1_liveness.h"
-#include "y.tab.c"
+/* This program is free software; you can redistribute it and/or modify it
+ * under the terms of the license (GNU LGPL) which comes with this package. */
-#define AMOUNT_OF_CLIENTS 2
-#define CS_PER_PROCESS 1
+/***************** Centralized Mutual Exclusion Algorithm *******************/
+/* This example implements a centralized mutual exclusion algorithm. */
+/* Bug : CS requests of client 1 not satisfied */
+/* LTL property checked : G(r->F(cs)); (r=request of CS, cs=CS ok) */
+/****************************************************************************/
-XBT_LOG_NEW_DEFAULT_CATEGORY(example_liveness_with_cycle, "my log messages");
+#ifdef GARBAGE_STACK
+#include <sys/stat.h>
+#include <fcntl.h>
+#include <unistd.h>
+#endif
+#include <simgrid/modelchecker.h>
+#include <simgrid/msg.h>
-int r=0;
-int cs=0;
+XBT_LOG_NEW_DEFAULT_CATEGORY(bugged1_liveness, "my log messages");
-int predR(){
- return r;
-}
+int r=0;
+int cs=0;
-int predCS(){
- return cs;
+#ifdef GARBAGE_STACK
+/** Do not use a clean stack */
+static void garbage_stack(void) {
+ const size_t size = 256;
+ int fd = open("/dev/urandom", O_RDONLY);
+ char foo[size];
+ read(fd, foo, size);
+ close(fd);
}
+#endif
-
-int coordinator(int argc, char *argv[])
+static int coordinator(int argc, char *argv[])
{
- xbt_dynar_t requests = xbt_dynar_new(sizeof(char *), NULL); // dynamic vector storing requests (which are char*)
- int CS_used = 0; // initially the CS is idle
- int todo = AMOUNT_OF_CLIENTS * CS_PER_PROCESS; // amount of releases we are expecting
- while (todo > 0) {
- m_task_t task = NULL;
+ int CS_used = 0;
+ msg_task_t task = NULL;
+ msg_task_t answer = NULL;
+ xbt_dynar_t requests = xbt_dynar_new(sizeof(char *), NULL);
+ char *req;
+
+ while(1){
MSG_task_receive(&task, "coordinator");
- const char *kind = MSG_task_get_name(task); //is it a request or a release?
- if (!strcmp(kind, "request")) { // that's a request
- char *req = MSG_task_get_data(task);
- if (CS_used) { // need to push the request in the vector
- XBT_INFO("CS already used. Queue the request of client %d", atoi(req) +1);
+ const char *kind = MSG_task_get_name(task);
+ if (!strcmp(kind, "request")) {
+ req = MSG_task_get_data(task);
+ if (CS_used) {
+ XBT_INFO("CS already used. Queue the request.");
xbt_dynar_push(requests, &req);
- } else { // can serve it immediatly
- if(strcmp(req, "1") == 0){
- m_task_t answer = MSG_task_create("grant", 0, 1000, NULL);
- MSG_task_send(answer, req);
- CS_used = 1;
- XBT_INFO("CS idle. Grant immediatly");
- }
+ } else {
+ if(strcmp(req, "1") != 0){
+ XBT_INFO("CS idle. Grant immediatly");
+ answer = MSG_task_create("grant", 0, 1000, NULL);
+ MSG_task_send(answer, req);
+ CS_used = 1;
+ answer = NULL;
+ }
}
- } else { // that's a release. Check if someone was waiting for the lock
- if (xbt_dynar_length(requests) > 0) {
+ } else {
+ if (!xbt_dynar_is_empty(requests)) {
XBT_INFO("CS release. Grant to queued requests (queue size: %lu)", xbt_dynar_length(requests));
- char *req ;
- xbt_dynar_get_cpy(requests, (xbt_dynar_length(requests) - 1), &req);
- if(strcmp(req, "1") == 0){
- xbt_dynar_pop(requests, &req);
- MSG_task_send(MSG_task_create("grant", 0, 1000, NULL), req);
- todo--;
- }else{
- xbt_dynar_pop(requests, &req);
- MSG_task_send(MSG_task_create("notgrant", 0, 1000, NULL), req);
- CS_used = 0;
- todo--;
- }
- } else { // nobody wants it
+ xbt_dynar_shift(requests, &req);
+ if(strcmp(req, "1") != 0){
+ MSG_task_send(MSG_task_create("grant", 0, 1000, NULL), req);
+ }else{
+ xbt_dynar_push(requests, &req);
+ CS_used = 0;
+ }
+ }else{
XBT_INFO("CS release. resource now idle");
CS_used = 0;
- todo--;
}
}
MSG_task_destroy(task);
+ task = NULL;
+ kind = NULL;
+ req = NULL;
}
- XBT_INFO("Received all releases, quit now");
return 0;
}
-int client(int argc, char *argv[])
+static int client(int argc, char *argv[])
{
int my_pid = MSG_process_get_PID(MSG_process_self());
- char *my_mailbox = bprintf("%s", argv[1]);
- int i;
+ char *my_mailbox = xbt_strdup(argv[1]);
+ msg_task_t grant = NULL;
+ msg_task_t release = NULL;
- // request the CS 4 times, sleeping a bit in between
- for (i = 0; i < CS_PER_PROCESS; i++) {
-
+ while(1){
XBT_INFO("Ask the request");
MSG_task_send(MSG_task_create("request", 0, 1000, my_mailbox), "coordinator");
- if(strcmp(my_mailbox, "2") == 0){
+ if(strcmp(my_mailbox, "1") == 0){
r = 1;
cs = 0;
- XBT_DEBUG("Propositions changed : r=1, cs=0");
+ XBT_INFO("Propositions changed : r=1, cs=0");
}
- // wait the answer
- m_task_t grant = NULL;
MSG_task_receive(&grant, my_mailbox);
const char *kind = MSG_task_get_name(grant);
- if((strcmp(my_mailbox, "2") == 0) && (strcmp("grant", kind) == 0)){
+ if((strcmp(my_mailbox, "1") == 0) && (strcmp("grant", kind) == 0)){
cs = 1;
r = 0;
- XBT_DEBUG("Propositions changed : r=0, cs=1");
+ XBT_INFO("Propositions changed : r=0, cs=1");
}
-
MSG_task_destroy(grant);
+ grant = NULL;
+ kind = NULL;
+
XBT_INFO("%s got the answer. Sleep a bit and release it", argv[1]);
+
MSG_process_sleep(1);
- MSG_task_send(MSG_task_create("release", 0, 1000, NULL), "coordinator");
+
+ release = MSG_task_create("release", 0, 1000, NULL);
+ MSG_task_send(release, "coordinator");
+
+ release = NULL;
MSG_process_sleep(my_pid);
-
- if(strcmp(my_mailbox, "2") == 0){
+
+ if(strcmp(my_mailbox, "1") == 0){
cs=0;
r=0;
- XBT_DEBUG("Propositions changed : r=0, cs=0");
+ XBT_INFO("Propositions changed : r=0, cs=0");
}
-
- }
- XBT_INFO("Got all the CS I wanted (%s), quit now", my_mailbox);
+ }
return 0;
}
+static int raw_client(int argc, char *argv[])
+{
+#ifdef GARBAGE_STACK
+ // At this point the stack of the callee (client) is probably filled with
+ // zeros and uninitialized variables will contain 0. This call will place
+ // random byes in the stack of the callee:
+ garbage_stack();
+#endif
+ return client(argc, argv);
+}
+
int main(int argc, char *argv[])
{
- init();
- yyparse();
- automaton = get_automaton();
- xbt_new_propositional_symbol(automaton,"r", &predR);
- xbt_new_propositional_symbol(automaton,"cs", &predCS);
-
- MSG_global_init(&argc, argv);
- MSG_create_environment("../msg_platform.xml");
+ MSG_init(&argc, argv);
+
+ MC_automaton_new_propositional_symbol_pointer("r", &r);
+ MC_automaton_new_propositional_symbol_pointer("cs", &cs);
+
+ MSG_create_environment(argv[1]);
+
MSG_function_register("coordinator", coordinator);
- MSG_function_register("client", client);
- MSG_launch_application("deploy_bugged1_liveness.xml");
- MSG_main_liveness(automaton, argv[0]);
+ MSG_function_register("client", raw_client);
+ MSG_launch_application(argv[2]);
+
+ MSG_main();
return 0;
}
