src/xbt/backtrace_dummy.c
src/xbt/setset_private.h
src/xbt/parmap_private.h
+ src/xbt/automatonparse_promela.c
src/xbt/mmalloc/attach.c
src/xbt/mmalloc/detach.c
src/xbt/mmalloc/keys.c
src/xbt/parmap.c
src/xbt/xbt_replay_trace_reader.c
src/xbt/lib.c
+ src/xbt/automaton.c
)
if(HAVE_MMAP)
src/mc/mc_dpor.c
src/mc/mc_request.c
src/mc/private.h
+ src/mc/mc_liveness.c
)
set(RNGSTREAM_SRC
include/xbt/mmalloc.h
include/xbt/replay_trace_reader.h
include/xbt/parmap.h
+ include/xbt/automaton.h
+ include/xbt/automatonparse_promela.h
include/simgrid/platf.h
include/mc/modelchecker.h
include/msg/msg.h
set(EXECUTABLE_OUTPUT_PATH "${CMAKE_CURRENT_BINARY_DIR}")
add_executable(chord "chord.c")
+add_executable(chord_stateful "chord_stateful.c")
### Add definitions for compile
target_link_libraries(chord simgrid )
-
+target_link_libraries(chord_stateful simgrid)
--- /dev/null
+
+/* Copyright (c) 2010. The SimGrid Team.
+ * All rights reserved. */
+
+/* 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. */
+
+#include <stdio.h>
+#include "msg/msg.h"
+#include "xbt/log.h"
+#include "xbt/asserts.h"
+#include "mc/modelchecker.h"
+#include "mc/mc.h"
+#include "xbt/xbt_os_time.h"
+
+XBT_LOG_NEW_DEFAULT_CATEGORY(msg_chord,
+ "Messages specific for this msg example");
+
+#define COMM_SIZE 10
+#define COMP_SIZE 0
+#define MAILBOX_NAME_SIZE 10
+
+static int nb_bits = 24;
+static int nb_keys = 0;
+static int timeout = 50;
+static int max_simulation_time = 1000;
+static int periodic_stabilize_delay = 20;
+static int periodic_fix_fingers_delay = 120;
+static int periodic_check_predecessor_delay = 120;
+static int periodic_lookup_delay = 10;
+
+extern long int smx_total_comms;
+
+/**
+ * Finger element.
+ */
+typedef struct finger {
+ int id;
+ char mailbox[MAILBOX_NAME_SIZE]; // string representation of the id
+} s_finger_t, *finger_t;
+
+/**
+ * Node data.
+ */
+typedef struct node {
+ int id; // my id
+ char mailbox[MAILBOX_NAME_SIZE]; // my mailbox name (string representation of the id)
+ s_finger_t *fingers; // finger table, of size nb_bits (fingers[0] is my successor)
+ int pred_id; // predecessor id
+ char pred_mailbox[MAILBOX_NAME_SIZE]; // predecessor's mailbox name
+ int next_finger_to_fix; // index of the next finger to fix in fix_fingers()
+ msg_comm_t comm_receive; // current communication to receive
+ double last_change_date; // last time I changed a finger or my predecessor
+} s_node_t, *node_t;
+
+/**
+ * Types of tasks exchanged between nodes.
+ */
+typedef enum {
+ TASK_FIND_SUCCESSOR,
+ TASK_FIND_SUCCESSOR_ANSWER,
+ TASK_GET_PREDECESSOR,
+ TASK_GET_PREDECESSOR_ANSWER,
+ TASK_NOTIFY,
+ TASK_SUCCESSOR_LEAVING,
+ TASK_PREDECESSOR_LEAVING
+} e_task_type_t;
+
+/**
+ * Data attached with the tasks sent and received
+ */
+typedef struct task_data {
+ e_task_type_t type; // type of task
+ int request_id; // id paramater (used by some types of tasks)
+ int request_finger; // finger parameter (used by some types of tasks)
+ int answer_id; // answer (used by some types of tasks)
+ char answer_to[MAILBOX_NAME_SIZE]; // mailbox to send an answer to (if any)
+ const char* issuer_host_name; // used for logging
+} s_task_data_t, *task_data_t;
+
+static int *powers2;
+
+// utility functions
+static void chord_initialize(void);
+static int normalize(int id);
+static int is_in_interval(int id, int start, int end);
+static void get_mailbox(int host_id, char* mailbox);
+static void task_free(void* task);
+static void print_finger_table(node_t node);
+static void set_finger(node_t node, int finger_index, int id);
+static void set_predecessor(node_t node, int predecessor_id);
+
+// process functions
+static int node(int argc, char *argv[]);
+static void handle_task(node_t node, m_task_t task);
+
+// Chord core
+static void create(node_t node);
+static int join(node_t node, int known_id);
+static void leave(node_t node);
+static int find_successor(node_t node, int id);
+static int remote_find_successor(node_t node, int ask_to_id, int id);
+static int remote_get_predecessor(node_t node, int ask_to_id);
+static int closest_preceding_node(node_t node, int id);
+static void stabilize(node_t node);
+static void notify(node_t node, int predecessor_candidate_id);
+static void remote_notify(node_t node, int notify_to, int predecessor_candidate_id);
+static void fix_fingers(node_t node);
+static void check_predecessor(node_t node);
+static void random_lookup(node_t);
+static void quit_notify(node_t node, int to);
+
+/**
+ * \brief Global initialization of the Chord simulation.
+ */
+static void chord_initialize(void)
+{
+ // compute the powers of 2 once for all
+ powers2 = xbt_new(int, nb_bits);
+ int pow = 1;
+ int i;
+ for (i = 0; i < nb_bits; i++) {
+ powers2[i] = pow;
+ pow = pow << 1;
+ }
+ nb_keys = pow;
+ XBT_DEBUG("Sets nb_keys to %d", nb_keys);
+}
+
+/**
+ * \brief Turns an id into an equivalent id in [0, nb_keys).
+ * \param id an id
+ * \return the corresponding normalized id
+ */
+static int normalize(int id)
+{
+ // like id % nb_keys, but works with negatives numbers (and faster)
+ return id & (nb_keys - 1);
+}
+
+/**
+ * \brief Returns whether a id belongs to the interval [start, end].
+ *
+ * The parameters are noramlized to make sure they are between 0 and nb_keys - 1).
+ * 1 belongs to [62, 3]
+ * 1 does not belong to [3, 62]
+ * 63 belongs to [62, 3]
+ * 63 does not belong to [3, 62]
+ * 24 belongs to [21, 29]
+ * 24 does not belong to [29, 21]
+ *
+ * \param id id to check
+ * \param start lower bound
+ * \param end upper bound
+ * \return a non-zero value if id in in [start, end]
+ */
+static int is_in_interval(int id, int start, int end)
+{
+ id = normalize(id);
+ start = normalize(start);
+ end = normalize(end);
+
+ // make sure end >= start and id >= start
+ if (end < start) {
+ end += nb_keys;
+ }
+
+ if (id < start) {
+ id += nb_keys;
+ }
+
+ return id <= end;
+}
+
+/**
+ * \brief Gets the mailbox name of a host given its chord id.
+ * \param node_id id of a node
+ * \param mailbox pointer to where the mailbox name should be written
+ * (there must be enough space)
+ */
+static void get_mailbox(int node_id, char* mailbox)
+{
+ snprintf(mailbox, MAILBOX_NAME_SIZE - 1, "%d", node_id);
+}
+
+/**
+ * \brief Frees the memory used by a task.
+ * \param task the MSG task to destroy
+ */
+static void task_free(void* task)
+{
+ // TODO add a parameter data_free_function to MSG_task_create?
+ xbt_free(MSG_task_get_data(task));
+ MSG_task_destroy(task);
+}
+
+/**
+ * \brief Displays the finger table of a node.
+ * \param node a node
+ */
+static void print_finger_table(node_t node)
+{
+ if (XBT_LOG_ISENABLED(msg_chord, xbt_log_priority_verbose)) {
+ int i;
+ XBT_VERB("My finger table:");
+ XBT_VERB("Start | Succ ");
+ for (i = 0; i < nb_bits; i++) {
+ XBT_VERB(" %3d | %3d ", (node->id + powers2[i]) % nb_keys, node->fingers[i].id);
+ }
+ XBT_VERB("Predecessor: %d", node->pred_id);
+ }
+}
+
+/**
+ * \brief Sets a finger of the current node.
+ * \param node the current node
+ * \param finger_index index of the finger to set (0 to nb_bits - 1)
+ * \param id the id to set for this finger
+ */
+static void set_finger(node_t node, int finger_index, int id)
+{
+ if (id != node->fingers[finger_index].id) {
+ node->fingers[finger_index].id = id;
+ get_mailbox(id, node->fingers[finger_index].mailbox);
+ node->last_change_date = MSG_get_clock();
+ XBT_DEBUG("My new finger #%d is %d", finger_index, id);
+ }
+}
+
+/**
+ * \brief Sets the predecessor of the current node.
+ * \param node the current node
+ * \param id the id to predecessor, or -1 to unset the predecessor
+ */
+static void set_predecessor(node_t node, int predecessor_id)
+{
+ if (predecessor_id != node->pred_id) {
+ node->pred_id = predecessor_id;
+
+ if (predecessor_id != -1) {
+ get_mailbox(predecessor_id, node->pred_mailbox);
+ }
+ node->last_change_date = MSG_get_clock();
+
+ XBT_DEBUG("My new predecessor is %d", predecessor_id);
+ }
+}
+
+/**
+ * \brief Node Function
+ * Arguments:
+ * - my id
+ * - the id of a guy I know in the system (except for the first node)
+ * - the time to sleep before I join (except for the first node)
+ */
+int node(int argc, char *argv[])
+{
+ /* Reduce the run size for the MC */
+ if(MC_IS_ENABLED){
+ periodic_stabilize_delay = 8;
+ periodic_fix_fingers_delay = 8;
+ periodic_check_predecessor_delay = 8;
+ }
+
+ double init_time = MSG_get_clock();
+ m_task_t task_received = NULL;
+ int i;
+ int join_success = 0;
+ double deadline;
+ double next_stabilize_date = init_time + periodic_stabilize_delay;
+ double next_fix_fingers_date = init_time + periodic_fix_fingers_delay;
+ double next_check_predecessor_date = init_time + periodic_check_predecessor_delay;
+ double next_lookup_date = init_time + periodic_lookup_delay;
+
+ xbt_assert(argc == 3 || argc == 5, "Wrong number of arguments for this node");
+
+ // initialize my node
+ s_node_t node = {0};
+ node.id = atoi(argv[1]);
+ get_mailbox(node.id, node.mailbox);
+ node.next_finger_to_fix = 0;
+ node.fingers = xbt_new0(s_finger_t, nb_bits);
+ node.last_change_date = init_time;
+
+ for (i = 0; i < nb_bits; i++) {
+ node.fingers[i].id = -1;
+ set_finger(&node, i, node.id);
+ }
+
+ if (argc == 3) { // first ring
+ deadline = atof(argv[2]);
+ create(&node);
+ join_success = 1;
+ }
+ else {
+ int known_id = atoi(argv[2]);
+ //double sleep_time = atof(argv[3]);
+ deadline = atof(argv[4]);
+
+ /*
+ // sleep before starting
+ XBT_DEBUG("Let's sleep during %f", sleep_time);
+ MSG_process_sleep(sleep_time);
+ */
+ XBT_DEBUG("Hey! Let's join the system.");
+
+ join_success = join(&node, known_id);
+ }
+
+ if (join_success) {
+ while (MSG_get_clock() < init_time + deadline
+// && MSG_get_clock() < node.last_change_date + 1000
+ && MSG_get_clock() < max_simulation_time) {
+
+ if (node.comm_receive == NULL) {
+ task_received = NULL;
+ node.comm_receive = MSG_task_irecv(&task_received, node.mailbox);
+ // FIXME: do not make MSG_task_irecv() calls from several functions
+ }
+
+ if (!MSG_comm_test(node.comm_receive)) {
+
+ // no task was received: make some periodic calls
+ if (MSG_get_clock() >= next_stabilize_date) {
+ stabilize(&node);
+ next_stabilize_date = MSG_get_clock() + periodic_stabilize_delay;
+ }
+ else if (MSG_get_clock() >= next_fix_fingers_date) {
+ fix_fingers(&node);
+ next_fix_fingers_date = MSG_get_clock() + periodic_fix_fingers_delay;
+ }
+ else if (MSG_get_clock() >= next_check_predecessor_date) {
+ check_predecessor(&node);
+ next_check_predecessor_date = MSG_get_clock() + periodic_check_predecessor_delay;
+ }
+ else if (MSG_get_clock() >= next_lookup_date) {
+ random_lookup(&node);
+ next_lookup_date = MSG_get_clock() + periodic_lookup_delay;
+ }
+ else {
+ // nothing to do: sleep for a while
+ MSG_process_sleep(5);
+ }
+ }
+ else {
+ // a transfer has occured
+
+ MSG_error_t status = MSG_comm_get_status(node.comm_receive);
+
+ if (status != MSG_OK) {
+ XBT_DEBUG("Failed to receive a task. Nevermind.");
+ node.comm_receive = NULL;
+ }
+ else {
+ // the task was successfully received
+ MSG_comm_destroy(node.comm_receive);
+ node.comm_receive = NULL;
+ handle_task(&node, task_received);
+ }
+ }
+
+ // see if some communications are finished
+ /*
+ while ((index = MSG_comm_testany(node.comms)) != -1) {
+ comm_send = xbt_dynar_get_as(node.comms, index, msg_comm_t);
+ MSG_error_t status = MSG_comm_get_status(comm_send);
+ xbt_dynar_remove_at(node.comms, index, &comm_send);
+ XBT_DEBUG("Communication %p is finished with status %d, dynar size is now %lu",
+ comm_send, status, xbt_dynar_length(node.comms));
+ m_task_t task = MSG_comm_get_task(comm_send);
+ MSG_comm_destroy(comm_send);
+ if (status != MSG_OK) {
+ task_data_destroy(MSG_task_get_data(task));
+ MSG_task_destroy(task);
+ }
+ }
+ */
+ }
+
+ // clean unfinished comms sent
+ /* unsigned int cursor;
+ xbt_dynar_foreach(node.comms, cursor, comm_send) {
+ m_task_t task = MSG_comm_get_task(comm_send);
+ MSG_task_cancel(task);
+ task_data_destroy(MSG_task_get_data(task));
+ MSG_task_destroy(task);
+ MSG_comm_destroy(comm_send);
+ // FIXME: the task is actually not destroyed because MSG thinks that the other side (whose process is dead) is still using it
+ }*/
+
+ // leave the ring
+ leave(&node);
+ }
+
+ // stop the simulation
+ xbt_free(node.fingers);
+ return 0;
+}
+
+/**
+ * \brief This function is called when the current node receives a task.
+ * \param node the current node
+ * \param task the task to handle (don't touch it then:
+ * it will be destroyed, reused or forwarded)
+ */
+static void handle_task(node_t node, m_task_t task) {
+
+ XBT_DEBUG("Handling task %p", task);
+ char mailbox[MAILBOX_NAME_SIZE];
+ task_data_t task_data = (task_data_t) MSG_task_get_data(task);
+ e_task_type_t type = task_data->type;
+
+ switch (type) {
+
+ case TASK_FIND_SUCCESSOR:
+ XBT_DEBUG("Receiving a 'Find Successor' request from %s for id %d",
+ task_data->issuer_host_name, task_data->request_id);
+ // is my successor the successor?
+ if (is_in_interval(task_data->request_id, node->id + 1, node->fingers[0].id)) {
+ task_data->type = TASK_FIND_SUCCESSOR_ANSWER;
+ task_data->answer_id = node->fingers[0].id;
+ XBT_DEBUG("Sending back a 'Find Successor Answer' to %s (mailbox %s): the successor of %d is %d",
+ task_data->issuer_host_name,
+ task_data->answer_to,
+ task_data->request_id, task_data->answer_id);
+ MSG_task_dsend(task, task_data->answer_to, task_free);
+ }
+ else {
+ // otherwise, forward the request to the closest preceding finger in my table
+ int closest = closest_preceding_node(node, task_data->request_id);
+ XBT_DEBUG("Forwarding the 'Find Successor' request for id %d to my closest preceding finger %d",
+ task_data->request_id, closest);
+ get_mailbox(closest, mailbox);
+ MSG_task_dsend(task, mailbox, task_free);
+ }
+ break;
+
+ case TASK_GET_PREDECESSOR:
+ XBT_DEBUG("Receiving a 'Get Predecessor' request from %s", task_data->issuer_host_name);
+ task_data->type = TASK_GET_PREDECESSOR_ANSWER;
+ task_data->answer_id = node->pred_id;
+ XBT_DEBUG("Sending back a 'Get Predecessor Answer' to %s via mailbox '%s': my predecessor is %d",
+ task_data->issuer_host_name,
+ task_data->answer_to, task_data->answer_id);
+ MSG_task_dsend(task, task_data->answer_to, task_free);
+ break;
+
+ case TASK_NOTIFY:
+ // someone is telling me that he may be my new predecessor
+ XBT_DEBUG("Receiving a 'Notify' request from %s", task_data->issuer_host_name);
+ notify(node, task_data->request_id);
+ task_free(task);
+ break;
+
+ case TASK_PREDECESSOR_LEAVING:
+ // my predecessor is about to quit
+ XBT_DEBUG("Receiving a 'Predecessor Leaving' message from %s", task_data->issuer_host_name);
+ // modify my predecessor
+ set_predecessor(node, task_data->request_id);
+ task_free(task);
+ /*TODO :
+ >> notify my new predecessor
+ >> send a notify_predecessors !!
+ */
+ break;
+
+ case TASK_SUCCESSOR_LEAVING:
+ // my successor is about to quit
+ XBT_DEBUG("Receiving a 'Successor Leaving' message from %s", task_data->issuer_host_name);
+ // modify my successor FIXME : this should be implicit ?
+ set_finger(node, 0, task_data->request_id);
+ task_free(task);
+ /* TODO
+ >> notify my new successor
+ >> update my table & predecessors table */
+ break;
+
+ case TASK_FIND_SUCCESSOR_ANSWER:
+ case TASK_GET_PREDECESSOR_ANSWER:
+ XBT_DEBUG("Ignoring unexpected task of type %d (%p)", type, task);
+ task_free(task);
+ break;
+ }
+}
+
+/**
+ * \brief Initializes the current node as the first one of the system.
+ * \param node the current node
+ */
+static void create(node_t node)
+{
+ XBT_DEBUG("Create a new Chord ring...");
+ set_predecessor(node, -1); // -1 means that I have no predecessor
+ print_finger_table(node);
+}
+
+/**
+ * \brief Makes the current node join the ring, knowing the id of a node
+ * already in the ring
+ * \param node the current node
+ * \param known_id id of a node already in the ring
+ * \return 1 if the join operation succeeded, 0 otherwise
+ */
+static int join(node_t node, int known_id)
+{
+ XBT_INFO("Joining the ring with id %d, knowing node %d", node->id, known_id);
+ set_predecessor(node, -1); // no predecessor (yet)
+
+ /*
+ int i;
+ for (i = 0; i < nb_bits; i++) {
+ set_finger(node, i, known_id);
+ }
+ */
+
+ int successor_id = remote_find_successor(node, known_id, node->id);
+ if (successor_id == -1) {
+ XBT_INFO("Cannot join the ring.");
+ }
+ else {
+ set_finger(node, 0, successor_id);
+ print_finger_table(node);
+ }
+
+ return successor_id != -1;
+}
+
+/**
+ * \brief Makes the current node quit the system
+ * \param node the current node
+ */
+static void leave(node_t node)
+{
+ XBT_DEBUG("Well Guys! I Think it's time for me to quit ;)");
+ quit_notify(node, 1); // notify to my successor ( >>> 1 );
+ quit_notify(node, -1); // notify my predecessor ( >>> -1);
+ // TODO ...
+}
+
+/*
+ * \brief Notifies the successor or the predecessor of the current node
+ * of the departure
+ * \param node the current node
+ * \param to 1 to notify the successor, -1 to notify the predecessor
+ * FIXME: notify both nodes with only one call
+ */
+static void quit_notify(node_t node, int to)
+{
+ /* TODO
+ task_data_t req_data = xbt_new0(s_task_data_t, 1);
+ req_data->request_id = node->id;
+ req_data->successor_id = node->fingers[0].id;
+ req_data->pred_id = node->pred_id;
+ req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
+ req_data->answer_to = NULL;
+ const char* task_name = NULL;
+ const char* to_mailbox = NULL;
+ if (to == 1) { // notify my successor
+ to_mailbox = node->fingers[0].mailbox;
+ XBT_INFO("Telling my Successor %d about my departure via mailbox %s",
+ node->fingers[0].id, to_mailbox);
+ req_data->type = TASK_PREDECESSOR_LEAVING;
+ }
+ else if (to == -1) { // notify my predecessor
+
+ if (node->pred_id == -1) {
+ return;
+ }
+
+ to_mailbox = node->pred_mailbox;
+ XBT_INFO("Telling my Predecessor %d about my departure via mailbox %s",
+ node->pred_id, to_mailbox);
+ req_data->type = TASK_SUCCESSOR_LEAVING;
+ }
+ m_task_t task = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+ //char* mailbox = get_mailbox(to_mailbox);
+ msg_comm_t comm = MSG_task_isend(task, to_mailbox);
+ xbt_dynar_push(node->comms, &comm);
+ */
+}
+
+/**
+ * \brief Makes the current node find the successor node of an id.
+ * \param node the current node
+ * \param id the id to find
+ * \return the id of the successor node, or -1 if the request failed
+ */
+static int find_successor(node_t node, int id)
+{
+ // is my successor the successor?
+ if (is_in_interval(id, node->id + 1, node->fingers[0].id)) {
+ return node->fingers[0].id;
+ }
+
+ // otherwise, ask the closest preceding finger in my table
+ int closest = closest_preceding_node(node, id);
+ return remote_find_successor(node, closest, id);
+}
+
+/**
+ * \brief Asks another node the successor node of an id.
+ * \param node the current node
+ * \param ask_to the node to ask to
+ * \param id the id to find
+ * \return the id of the successor node, or -1 if the request failed
+ */
+static int remote_find_successor(node_t node, int ask_to, int id)
+{
+ int successor = -1;
+ int stop = 0;
+ char mailbox[MAILBOX_NAME_SIZE];
+ get_mailbox(ask_to, mailbox);
+ task_data_t req_data = xbt_new0(s_task_data_t, 1);
+ req_data->type = TASK_FIND_SUCCESSOR;
+ req_data->request_id = id;
+ get_mailbox(node->id, req_data->answer_to);
+ req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
+
+ // send a "Find Successor" request to ask_to_id
+ m_task_t task_sent = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+ XBT_DEBUG("Sending a 'Find Successor' request (task %p) to %d for id %d", task_sent, ask_to, id);
+ MSG_error_t res = MSG_task_send_with_timeout(task_sent, mailbox, timeout);
+
+ if (res != MSG_OK) {
+ XBT_DEBUG("Failed to send the 'Find Successor' request (task %p) to %d for id %d",
+ task_sent, ask_to, id);
+ task_free(task_sent);
+ }
+ else {
+
+ // receive the answer
+ XBT_DEBUG("Sent a 'Find Successor' request (task %p) to %d for key %d, waiting for the answer",
+ task_sent, ask_to, id);
+
+ do {
+ if (node->comm_receive == NULL) {
+ m_task_t task_received = NULL;
+ node->comm_receive = MSG_task_irecv(&task_received, node->mailbox);
+ }
+
+ res = MSG_comm_wait(node->comm_receive, timeout);
+
+ if (res != MSG_OK) {
+ XBT_DEBUG("Failed to receive the answer to my 'Find Successor' request (task %p): %d",
+ task_sent, res);
+ stop = 1;
+ MSG_comm_destroy(node->comm_receive);
+ node->comm_receive = NULL;
+ }
+ else {
+ m_task_t task_received = MSG_comm_get_task(node->comm_receive);
+ XBT_DEBUG("Received a task (%p)", task_received);
+ task_data_t ans_data = MSG_task_get_data(task_received);
+
+ if (MC_IS_ENABLED) {
+ MC_assert_stateful(task_received == task_sent);
+ }
+
+ if (task_received != task_sent) {
+ // this is not the expected answer
+ MSG_comm_destroy(node->comm_receive);
+ node->comm_receive = NULL;
+ handle_task(node, task_received);
+ }
+ else {
+ // this is our answer
+ XBT_DEBUG("Received the answer to my 'Find Successor' request for id %d (task %p): the successor of key %d is %d",
+ ans_data->request_id, task_received, id, ans_data->answer_id);
+ successor = ans_data->answer_id;
+ stop = 1;
+ MSG_comm_destroy(node->comm_receive);
+ node->comm_receive = NULL;
+ task_free(task_received);
+ }
+ }
+ } while (!stop);
+ }
+
+ return successor;
+}
+
+/**
+ * \brief Asks another node its predecessor.
+ * \param node the current node
+ * \param ask_to the node to ask to
+ * \return the id of its predecessor node, or -1 if the request failed
+ * (or if the node does not know its predecessor)
+ */
+static int remote_get_predecessor(node_t node, int ask_to)
+{
+ int predecessor_id = -1;
+ int stop = 0;
+ char mailbox[MAILBOX_NAME_SIZE];
+ get_mailbox(ask_to, mailbox);
+ task_data_t req_data = xbt_new0(s_task_data_t, 1);
+ req_data->type = TASK_GET_PREDECESSOR;
+ get_mailbox(node->id, req_data->answer_to);
+ req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
+
+ // send a "Get Predecessor" request to ask_to_id
+ XBT_DEBUG("Sending a 'Get Predecessor' request to %d", ask_to);
+ m_task_t task_sent = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+ MSG_error_t res = MSG_task_send_with_timeout(task_sent, mailbox, timeout);
+
+ if (res != MSG_OK) {
+ XBT_DEBUG("Failed to send the 'Get Predecessor' request (task %p) to %d",
+ task_sent, ask_to);
+ task_free(task_sent);
+ }
+ else {
+
+ // receive the answer
+ XBT_DEBUG("Sent 'Get Predecessor' request (task %p) to %d, waiting for the answer on my mailbox '%s'",
+ task_sent, ask_to, req_data->answer_to);
+
+ do {
+ if (node->comm_receive == NULL) { // FIXME simplify this
+ m_task_t task_received = NULL;
+ node->comm_receive = MSG_task_irecv(&task_received, node->mailbox);
+ }
+
+ res = MSG_comm_wait(node->comm_receive, timeout);
+
+ if (res != MSG_OK) {
+ XBT_DEBUG("Failed to receive the answer to my 'Get Predecessor' request (task %p): %d",
+ task_sent, res);
+ stop = 1;
+ MSG_comm_destroy(node->comm_receive);
+ node->comm_receive = NULL;
+ }
+ else {
+ m_task_t task_received = MSG_comm_get_task(node->comm_receive);
+ task_data_t ans_data = MSG_task_get_data(task_received);
+
+ if (MC_IS_ENABLED) {
+ MC_assert_stateful(task_received == task_sent);
+ }
+
+ if (task_received != task_sent) {
+ MSG_comm_destroy(node->comm_receive);
+ node->comm_receive = NULL;
+ handle_task(node, task_received);
+ }
+ else {
+ XBT_DEBUG("Received the answer to my 'Get Predecessor' request (task %p): the predecessor of node %d is %d",
+ task_received, ask_to, ans_data->answer_id);
+ predecessor_id = ans_data->answer_id;
+ stop = 1;
+ MSG_comm_destroy(node->comm_receive);
+ node->comm_receive = NULL;
+ task_free(task_received);
+ }
+ }
+ } while (!stop);
+ }
+
+ return predecessor_id;
+}
+
+/**
+ * \brief Returns the closest preceding finger of an id
+ * with respect to the finger table of the current node.
+ * \param node the current node
+ * \param id the id to find
+ * \return the closest preceding finger of that id
+ */
+int closest_preceding_node(node_t node, int id)
+{
+ int i;
+ for (i = nb_bits - 1; i >= 0; i--) {
+ if (is_in_interval(node->fingers[i].id, node->id + 1, id - 1)) {
+ return node->fingers[i].id;
+ }
+ }
+ return node->id;
+}
+
+/**
+ * \brief This function is called periodically. It checks the immediate
+ * successor of the current node.
+ * \param node the current node
+ */
+static void stabilize(node_t node)
+{
+ XBT_DEBUG("Stabilizing node");
+
+ // get the predecessor of my immediate successor
+ int candidate_id;
+ int successor_id = node->fingers[0].id;
+ if (successor_id != node->id) {
+ candidate_id = remote_get_predecessor(node, successor_id);
+ }
+ else {
+ candidate_id = node->pred_id;
+ }
+
+ // this node is a candidate to become my new successor
+ if (candidate_id != -1
+ && is_in_interval(candidate_id, node->id + 1, successor_id - 1)) {
+ set_finger(node, 0, candidate_id);
+ }
+ if (successor_id != node->id) {
+ remote_notify(node, successor_id, node->id);
+ }
+}
+
+/**
+ * \brief Notifies the current node that its predecessor may have changed.
+ * \param node the current node
+ * \param candidate_id the possible new predecessor
+ */
+static void notify(node_t node, int predecessor_candidate_id) {
+
+ if (node->pred_id == -1
+ || is_in_interval(predecessor_candidate_id, node->pred_id + 1, node->id - 1)) {
+
+ set_predecessor(node, predecessor_candidate_id);
+ print_finger_table(node);
+ }
+ else {
+ XBT_DEBUG("I don't have to change my predecessor to %d", predecessor_candidate_id);
+ }
+}
+
+/**
+ * \brief Notifies a remote node that its predecessor may have changed.
+ * \param node the current node
+ * \param notify_id id of the node to notify
+ * \param candidate_id the possible new predecessor
+ */
+static void remote_notify(node_t node, int notify_id, int predecessor_candidate_id) {
+
+ task_data_t req_data = xbt_new0(s_task_data_t, 1);
+ req_data->type = TASK_NOTIFY;
+ req_data->request_id = predecessor_candidate_id;
+ req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
+
+ // send a "Notify" request to notify_id
+ m_task_t task = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+ XBT_DEBUG("Sending a 'Notify' request (task %p) to %d", task, notify_id);
+ char mailbox[MAILBOX_NAME_SIZE];
+ get_mailbox(notify_id, mailbox);
+ MSG_task_dsend(task, mailbox, task_free);
+}
+
+/**
+ * \brief This function is called periodically.
+ * It refreshes the finger table of the current node.
+ * \param node the current node
+ */
+static void fix_fingers(node_t node) {
+
+ XBT_DEBUG("Fixing fingers");
+ int i = node->next_finger_to_fix;
+ int id = find_successor(node, node->id + powers2[i]);
+ if (id != -1) {
+
+ if (id != node->fingers[i].id) {
+ set_finger(node, i, id);
+ print_finger_table(node);
+ }
+ node->next_finger_to_fix = (i + 1) % nb_bits;
+ }
+}
+
+/**
+ * \brief This function is called periodically.
+ * It checks whether the predecessor has failed
+ * \param node the current node
+ */
+static void check_predecessor(node_t node)
+{
+ XBT_DEBUG("Checking whether my predecessor is alive");
+ // TODO
+}
+
+/**
+ * \brief Performs a find successor request to a random id.
+ * \param node the current node
+ */
+static void random_lookup(node_t node)
+{
+ int id = 1337; // TODO pick a pseudorandom id
+ XBT_DEBUG("Making a lookup request for id %d", id);
+ find_successor(node, id);
+}
+
+/**
+ * \brief Main function.
+ */
+int main(int argc, char *argv[])
+{
+ xbt_os_timer_t timer = xbt_os_timer_new();
+
+ if (argc < 3) {
+ printf("Usage: %s [-nb_bits=n] [-timeout=t] platform_file deployment_file\n", argv[0]);
+ printf("example: %s ../msg_platform.xml chord.xml\n", argv[0]);
+ exit(1);
+ }
+
+ MSG_global_init(&argc, argv);
+
+ char **options = &argv[1];
+ while (!strncmp(options[0], "-", 1)) {
+
+ int length = strlen("-nb_bits=");
+ if (!strncmp(options[0], "-nb_bits=", length) && strlen(options[0]) > length) {
+ nb_bits = atoi(options[0] + length);
+ XBT_DEBUG("Set nb_bits to %d", nb_bits);
+ }
+ else {
+
+ length = strlen("-timeout=");
+ if (!strncmp(options[0], "-timeout=", length) && strlen(options[0]) > length) {
+ timeout = atoi(options[0] + length);
+ XBT_DEBUG("Set timeout to %d", timeout);
+ }
+ else {
+ xbt_die("Invalid chord option '%s'", options[0]);
+ }
+ }
+ options++;
+ }
+
+ const char* platform_file = options[0];
+ const char* application_file = options[1];
+
+ chord_initialize();
+
+ MSG_set_channel_number(0);
+ MSG_create_environment(platform_file);
+
+ MSG_function_register("node", node);
+ MSG_launch_application(application_file);
+
+ xbt_os_timer_start(timer);
+ MSG_error_t res = MSG_main_stateful();
+ xbt_os_timer_stop(timer);
+ XBT_CRITICAL("Simulation time %lf, messages created: %ld", xbt_os_timer_elapsed(timer), smx_total_comms);
+ XBT_INFO("Simulated time: %g", MSG_get_clock());
+
+ MSG_clean();
+
+ if (res == MSG_OK)
+ return 0;
+ else
+ return 1;
+}
add_executable(centralized centralized_mutex.c)
add_executable(bugged1 bugged1.c)
+add_executable(bugged1_stateful bugged1_stateful.c)
+add_executable(bugged2_stateful bugged2_stateful.c)
add_executable(bugged2 bugged2.c)
add_executable(bugged3 bugged3.c)
add_executable(random_test random_test.c)
+add_executable(example_liveness_with_cycle2 automaton.c
+automatonparse_promela.c example_liveness_with_cycle2.c)
+add_executable(example_liveness_with_cycle automaton.c
+automatonparse_promela.c example_liveness_with_cycle.c)
+
+
+
target_link_libraries(centralized simgrid m )
target_link_libraries(bugged1 simgrid m )
+target_link_libraries(bugged1_stateful simgrid m)
+target_link_libraries(bugged2_stateful simgrid m)
target_link_libraries(bugged2 simgrid m )
target_link_libraries(bugged3 simgrid m )
target_link_libraries(random_test simgrid m )
+target_link_libraries(example_liveness_with_cycle2 simgrid m )
+target_link_libraries(example_liveness_with_cycle simgrid m )
--- /dev/null
+#include "xbt/automaton.h"
+
+xbt_automaton_t xbt_automaton_new_automaton(){
+ xbt_automaton_t automaton = NULL;
+ automaton = xbt_new0(struct xbt_automaton, 1);
+ automaton->states = xbt_dynar_new(sizeof(xbt_state_t), NULL);
+ automaton->transitions = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ automaton->propositional_symbols = xbt_dynar_new(sizeof(xbt_propositional_symbol_t), NULL);
+ return automaton;
+}
+
+xbt_state_t xbt_automaton_new_state(xbt_automaton_t a, int type, char* id){
+ xbt_state_t state = NULL;
+ state = xbt_new0(struct xbt_state, 1);
+ state->type = type;
+ state->id = strdup(id);
+ state->in = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ state->out = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ xbt_dynar_push(a->states, &state);
+ return state;
+}
+
+xbt_transition_t xbt_automaton_new_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst, xbt_exp_label_t label){
+ xbt_transition_t transition = NULL;
+ transition = xbt_new0(struct xbt_transition, 1);
+ if(src != NULL){
+ xbt_dynar_push(src->out, &transition);
+ transition->src = src;
+ }
+ if(dst != NULL){
+ xbt_dynar_push(dst->in, &transition);
+ transition->dst = dst;
+ }
+ transition->label = label;
+ xbt_dynar_push(a->transitions, &transition);
+ return transition;
+}
+
+xbt_exp_label_t xbt_automaton_new_label(int type, ...){
+ xbt_exp_label_t label = NULL;
+ label = xbt_new0(struct xbt_exp_label, 1);
+ label->type = type;
+
+ va_list ap;
+ va_start(ap, type);
+ switch(type){
+ case 0 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label->u.or_and.left_exp = left;
+ label->u.or_and.right_exp = right;
+ break;
+ }
+ case 1 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label->u.or_and.left_exp = left;
+ label->u.or_and.right_exp = right;
+ break;
+ }
+ case 2 : {
+ xbt_exp_label_t exp_not = va_arg(ap, xbt_exp_label_t);
+ label->u.exp_not = exp_not;
+ break;
+ }
+ case 3 :{
+ char* p = va_arg(ap, char*);
+ label->u.predicat = strdup(p);
+ break;
+ }
+ }
+ va_end(ap);
+ return label;
+}
+
+
+xbt_dynar_t xbt_automaton_get_states(xbt_automaton_t a){
+ return a->states;
+}
+
+xbt_dynar_t xbt_automaton_get_transitions(xbt_automaton_t a){
+ return a->transitions;
+}
+
+xbt_transition_t xbt_automaton_get_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst){
+ xbt_transition_t transition;
+ unsigned int cursor;
+ xbt_dynar_foreach(src->out, cursor, transition){
+ if((transition->src == src) && (transition->dst == dst))
+ return transition;
+ }
+ return NULL;
+}
+
+void xbt_automaton_free_automaton(xbt_automaton_t a, void_f_pvoid_t transition_free_function){
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+ xbt_transition_t transition = NULL;
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ xbt_dynar_free(&(state->out));
+ xbt_dynar_free(&(state->in));
+ }
+
+ xbt_dynar_foreach(a->transitions, cursor, transition){
+ if(transition_free_function)
+ (*transition_free_function) (transition->label);
+ }
+
+ xbt_dynar_foreach(a->states, cursor, state)
+ free(state);
+ xbt_dynar_free(&(a->states));
+
+ xbt_dynar_foreach(a->transitions, cursor, state)
+ free(transition);
+ xbt_dynar_free(&(a->transitions));
+
+ free(a);
+
+ return;
+}
+
+void xbt_automaton_free_state(xbt_automaton_t a, xbt_state_t s, void_f_pvoid_t transition_free_function){
+ unsigned long nbr;
+ unsigned long i;
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+ xbt_transition_t transition = NULL;
+
+ nbr = xbt_dynar_length(a->transitions);
+ for(i = 0; i <nbr; i++){
+ xbt_dynar_get_cpy(a->transitions, cursor, &transition);
+ if((transition->src == s) || (transition->dst == s)){
+ xbt_automaton_free_transition(a, transition, transition_free_function);
+ }else{
+ cursor++;
+ }
+ }
+
+ cursor = 0;
+ xbt_dynar_foreach(a->states, cursor, state)
+ if(state == s)
+ xbt_dynar_cursor_rm(a->states, &cursor);
+
+ xbt_dynar_free(&(s->in));
+ xbt_dynar_free(&(s->out));
+
+ free(s);
+
+ return;
+}
+
+void xbt_automaton_free_transition(xbt_automaton_t a, xbt_transition_t t, void_f_pvoid_t transition_free_function){
+ int index;
+ unsigned int cursor = 0;
+ xbt_transition_t transition = NULL;
+
+ if((transition_free_function) && (t->label))
+ (*transition_free_function) (t->label);
+
+ xbt_dynar_foreach(a->transitions, cursor, transition) {
+ if(transition == t){
+ index = __xbt_find_in_dynar(transition->dst->in, transition);
+ xbt_dynar_remove_at(transition->dst->in, index, NULL);
+ index = __xbt_find_in_dynar(transition->src->out, transition);
+ xbt_dynar_remove_at(transition->src->out, index, NULL);
+ xbt_dynar_cursor_rm(a->transitions, & cursor);
+ free(transition);
+ break;
+ }
+ }
+}
+
+xbt_state_t xbt_automaton_transition_get_source(xbt_transition_t t){
+ return t->src;
+}
+
+xbt_state_t xbt_automaton_transition_get_destination(xbt_transition_t t){
+ return t->dst;
+}
+
+void xbt_automaton_transition_set_source(xbt_transition_t t, xbt_state_t src){
+ t->src = src;
+ xbt_dynar_push(src->out,&t);
+}
+
+void xbt_automaton_transition_set_destination(xbt_transition_t t, xbt_state_t dst){
+ t->dst = dst;
+ xbt_dynar_push(dst->in,&t);
+}
+
+xbt_dynar_t xbt_automaton_state_get_out_transitions(xbt_state_t s){
+ return s->out;
+}
+
+xbt_dynar_t xbt_automaton_state_get_in_transitions(xbt_state_t s){
+ return s->in;
+}
+
+xbt_state_t xbt_automaton_state_exists(xbt_automaton_t a, char *id){
+ xbt_state_t state = NULL;
+ unsigned int cursor = 0;
+ xbt_dynar_foreach(a->states, cursor, state){
+ if(strcmp(state->id, id)==0)
+ return state;
+ }
+ return NULL;
+}
+
+void xbt_automaton_display(xbt_automaton_t a){
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+
+ printf("\n\nEtat courant : %s\n", a->current_state->id);
+
+ printf("\nListe des états : %lu\n\n", xbt_dynar_length(a->states));
+
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ printf("ID : %s, type : %d\n", state->id, state->type);
+ }
+
+ cursor=0;
+ xbt_transition_t transition = NULL;
+ printf("\nListe des transitions : %lu\n\n", xbt_dynar_length(a->transitions));
+
+ xbt_dynar_foreach(a->transitions, cursor, transition){
+ printf("label :");
+ xbt_automaton_display_exp(transition->label);
+ printf(", %s -> %s\n", transition->src->id, transition->dst->id);
+ }
+}
+
+void xbt_automaton_display_exp(xbt_exp_label_t label){
+
+ switch(label->type){
+ case 0 :
+ printf("(");
+ xbt_automaton_display_exp(label->u.or_and.left_exp);
+ printf(" || ");
+ xbt_automaton_display_exp(label->u.or_and.right_exp);
+ printf(")");
+ break;
+ case 1 :
+ printf("(");
+ xbt_automaton_display_exp(label->u.or_and.left_exp);
+ printf(" && ");
+ xbt_automaton_display_exp(label->u.or_and.right_exp);
+ printf(")");
+ break;
+ case 2 :
+ printf("(!");
+ xbt_automaton_display_exp(label->u.exp_not);
+ printf(")");
+ break;
+ case 3 :
+ printf("(%s)",label->u.predicat);
+ break;
+ case 4 :
+ printf("(1)");
+ break;
+ }
+
+}
+
+xbt_state_t xbt_automaton_get_current_state(xbt_automaton_t a){
+ return a->current_state;
+}
+
+xbt_propositional_symbol_t xbt_new_propositional_symbol(xbt_automaton_t a, const char* id, void* fct){
+ xbt_propositional_symbol_t prop_symb = NULL;
+ prop_symb = xbt_new0(struct xbt_propositional_symbol, 1);
+ prop_symb->pred = strdup(id);
+ prop_symb->function = fct;
+ xbt_dynar_push(a->propositional_symbols, &prop_symb);
+ return prop_symb;
+}
+
+int automaton_state_compare(xbt_state_t s1, xbt_state_t s2){
+
+ /* single id for each state, id and type sufficient for comparison*/
+
+ if(strcmp(s1->id, s2->id))
+ return 1;
+
+ if(s1->type != s2->type)
+ return 1;
+
+ return 0;
+
+}
+
+int automaton_transition_compare(const void *t1, const void *t2){
+
+ if(automaton_state_compare(((xbt_transition_t)t1)->src, ((xbt_transition_t)t2)->src))
+ return 1;
+
+ if(automaton_state_compare(((xbt_transition_t)t1)->dst, ((xbt_transition_t)t2)->dst))
+ return 1;
+
+ if(automaton_label_transition_compare(((xbt_transition_t)t1)->label,((xbt_transition_t)t2)->label))
+ return 1;
+
+ return 0;
+
+}
+
+int automaton_label_transition_compare(xbt_exp_label_t l1, xbt_exp_label_t l2){
+
+ if(l1->type != l2->type)
+ return 1;
+
+ switch(l1->type){
+
+ case 0 : // OR
+ case 1 : // AND
+ if(automaton_label_transition_compare(l1->u.or_and.left_exp, l2->u.or_and.left_exp))
+ return 1;
+ else
+ return automaton_label_transition_compare(l1->u.or_and.right_exp, l2->u.or_and.right_exp);
+ break;
+
+ case 2 : // NOT
+ return automaton_label_transition_compare(l1->u.exp_not, l2->u.exp_not);
+ break;
+
+ case 3 : // predicat
+ return (strcmp(l1->u.predicat, l2->u.predicat));
+ break;
+
+ case 4 : // 1
+ return 0;
+ break;
+
+ default :
+ return -1;
+ break;
+
+ }
+
+}
+
+
+int propositional_symbols_compare_value(xbt_dynar_t s1, xbt_dynar_t s2){
+
+ int *iptr1, *iptr2;
+ unsigned int cursor;
+ unsigned int nb_elem = xbt_dynar_length(s1);
+
+ for(cursor=0;cursor<nb_elem;cursor++){
+ iptr1 = xbt_dynar_get_ptr(s1, cursor);
+ iptr2 = xbt_dynar_get_ptr(s2, cursor);
+ if(*iptr1 != *iptr2)
+ return 1;
+ }
+
+ return 0;
+}
--- /dev/null
+#ifndef _XBT_AUTOMATON_H
+#define _XBT_AUTOMATON_H
+
+#include <stdlib.h>
+#include <string.h>
+#include <xbt/dynar.h>
+#include <xbt/sysdep.h>
+#include <xbt/graph.h>
+
+SG_BEGIN_DECL()
+
+typedef struct xbt_state {
+ char* id;
+ int type; /* -1 = init, 0 = inter, 1 = final */
+ xbt_dynar_t in;
+ xbt_dynar_t out;
+} s_xbt_state;
+
+typedef struct xbt_state* xbt_state_t;
+
+typedef struct xbt_automaton {
+ xbt_dynar_t propositional_symbols;
+ xbt_dynar_t transitions;
+ xbt_dynar_t states;
+ xbt_state_t current_state;
+} s_xbt_automaton;
+
+typedef struct xbt_automaton* xbt_automaton_t;
+
+typedef struct xbt_exp_label{
+ enum{or=0, and=1, not=2, predicat=3, one=4} type;
+ union{
+ struct{
+ struct xbt_exp_label* left_exp;
+ struct xbt_exp_label* right_exp;
+ }or_and;
+ struct xbt_exp_label* exp_not;
+ char* predicat;
+ }u;
+} s_xbt_exp_label;
+
+typedef struct xbt_exp_label* xbt_exp_label_t;
+
+
+typedef struct xbt_transition {
+ xbt_state_t src;
+ xbt_state_t dst;
+ xbt_exp_label_t label;
+} s_xbt_transition;
+
+typedef struct xbt_transition* xbt_transition_t;
+
+
+typedef struct xbt_propositional_symbol{
+ char* pred;
+ void* function;
+} s_xbt_propositional_symbol;
+
+typedef struct xbt_propositional_symbol* xbt_propositional_symbol_t;
+
+
+XBT_PUBLIC(xbt_automaton_t) xbt_automaton_new_automaton(void);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_new_state(xbt_automaton_t a, int type, char* id);
+
+XBT_PUBLIC(xbt_transition_t) xbt_automaton_new_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst, xbt_exp_label_t label);
+
+XBT_PUBLIC(xbt_exp_label_t) xbt_automaton_new_label(int type, ...);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_get_states(xbt_automaton_t a);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_get_transitions(xbt_automaton_t a);
+
+XBT_PUBLIC(xbt_transition_t) xbt_automaton_get_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst);
+
+XBT_PUBLIC(void) xbt_automaton_free_automaton(xbt_automaton_t a, void_f_pvoid_t transition_free_function);
+
+XBT_PUBLIC(void) xbt_automaton_free_state(xbt_automaton_t a, xbt_state_t s, void_f_pvoid_t transition_free_function);
+
+XBT_PUBLIC(void) xbt_automaton_free_transition(xbt_automaton_t a, xbt_transition_t t, void_f_pvoid_t transition_free_function);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_transition_get_source(xbt_transition_t t);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_transition_get_destination(xbt_transition_t t);
+
+XBT_PUBLIC(void) xbt_automaton_transition_set_source(xbt_transition_t t, xbt_state_t src);
+
+XBT_PUBLIC(void) xbt_automaton_transition_set_destination(xbt_transition_t t, xbt_state_t dst);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_state_get_out_transitions(xbt_state_t s);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_state_get_in_transitions(xbt_state_t s);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_state_exists(xbt_automaton_t a, char *id);
+
+XBT_PUBLIC(void) xbt_automaton_display(xbt_automaton_t a);
+
+XBT_PUBLIC(void) xbt_automaton_display_exp(xbt_exp_label_t l);
+
+XBT_PUBLIC(xbt_propositional_symbol_t) xbt_new_propositional_symbol(xbt_automaton_t a, const char* id, void* fct);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_get_current_state(xbt_automaton_t a);
+
+XBT_PUBLIC(int) automaton_state_compare(xbt_state_t s1, xbt_state_t s2);
+
+XBT_PUBLIC(int) propositional_symbols_compare_value(xbt_dynar_t s1, xbt_dynar_t s2);
+
+XBT_PUBLIC(int) automaton_transition_compare(const void *t1, const void *t2);
+
+XBT_PUBLIC(int) automaton_label_transition_compare(xbt_exp_label_t l1, xbt_exp_label_t l2);
+
+
+SG_END_DECL()
+
+#endif
--- /dev/null
+never { /* !G(p->Fq) */
+T0_init : /* init */
+ if
+ :: (1) -> goto T0_init
+ :: (!q && p) -> goto accept_S2
+ fi;
+accept_S2 : /* 1 */
+ if
+ :: (!q) -> goto accept_S2
+ fi;
+}
\ No newline at end of file
--- /dev/null
+never {
+T0_init:
+ if
+ :: (!d) || (r) -> goto accept_S1
+ :: (1) -> goto T1_S4
+ :: (1) -> goto T0_S2
+ :: (!e) -> goto accept_S3
+ fi;
+T1_S4:
+ if
+ :: (1) -> goto T1_S4
+ :: (r) -> goto accept_S1
+ fi;
+accept_S1:
+ if
+ :: (!d) || (r) -> goto accept_S1
+ :: (1) -> goto T1_S4
+ fi;
+T0_S2:
+ if
+ :: (1) -> goto T0_S2
+ :: (!e) -> goto accept_S3
+ fi;
+accept_S3:
+ if
+ :: (!e) -> goto accept_S3
+ fi;
+}
--- /dev/null
+#include "xbt/automatonparse_promela.h"
+
+char* state_id_src;
+
+void init(){
+ automaton = xbt_automaton_new_automaton();
+}
+
+void new_state(char* id, int src){
+
+ char* id_state = strdup(id);
+ char* first_part = strtok(id,"_");
+ int type = 0 ; // -1=état initial, 0=état intermédiaire, 1=état final
+
+ if(strcmp(first_part,"accept")==0){
+ type = 1;
+ }else{
+ char* second_part = strtok(NULL,"_");
+ if(strcmp(second_part,"init")==0){
+ type = -1;
+ }
+ }
+
+ xbt_state_t state = NULL;
+ state = xbt_automaton_state_exists(automaton, id_state);
+ if(state == NULL){
+ state = xbt_automaton_new_state(automaton, type, id_state);
+ }
+
+ if(type==-1)
+ automaton->current_state = state;
+
+ if(src)
+ state_id_src = strdup(id_state);
+
+}
+
+void new_transition(char* id, xbt_exp_label_t label){
+
+ char* id_state = strdup(id);
+ xbt_state_t state_dst = NULL;
+ new_state(id, 0);
+ state_dst = xbt_automaton_state_exists(automaton, id_state);
+ xbt_state_t state_src = xbt_automaton_state_exists(automaton, state_id_src);
+
+ //xbt_transition_t trans = NULL;
+ xbt_automaton_new_transition(automaton, state_src, state_dst, label);
+
+}
+
+xbt_exp_label_t new_label(int type, ...){
+ xbt_exp_label_t label = NULL;
+ va_list ap;
+ va_start(ap,type);
+ switch(type){
+ case 0 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label = xbt_automaton_new_label(type, left, right);
+ break;
+ }
+ case 1 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label = xbt_automaton_new_label(type, left, right);
+ break;
+ }
+ case 2 : {
+ xbt_exp_label_t exp_not = va_arg(ap, xbt_exp_label_t);
+ label = xbt_automaton_new_label(type, exp_not);
+ break;
+ }
+ case 3 : {
+ char* p = va_arg(ap, char*);
+ label = xbt_automaton_new_label(type, p);
+ break;
+ }
+ case 4 : {
+ label = xbt_automaton_new_label(type);
+ break;
+ }
+ }
+ va_end(ap);
+ return label;
+}
+
+xbt_automaton_t get_automaton(){
+ return automaton;
+}
+
+
+
--- /dev/null
+#ifndef _XBT_AUTOMATONPARSE_PROMELA_H
+#define _XBT_AUTOMATONPARSE_PROMELA_H
+
+#include <stdlib.h>
+#include <string.h>
+#include "xbt/automaton.h"
+
+xbt_automaton_t automaton;
+
+SG_BEGIN_DECL()
+
+XBT_PUBLIC(void) init(void);
+
+XBT_PUBLIC(void) new_state(char* id, int src);
+
+XBT_PUBLIC(void) new_transition(char* id, xbt_exp_label_t label);
+
+XBT_PUBLIC(xbt_exp_label_t) new_label(int type, ...);
+
+XBT_PUBLIC(xbt_automaton_t) get_automaton(void);
+
+XBT_PUBLIC(void) display_automaton(void);
+
+SG_END_DECL()
+
+#endif
--- /dev/null
+/******************** Non-deterministic message ordering *********************/
+/* Server assumes a fixed order in the reception of messages from its clients */
+/* which is incorrect because the message ordering is non-deterministic */
+/******************************************************************************/
+
+#include <msg/msg.h>
+#include <mc/modelchecker.h>
+#define N 3
+
+XBT_LOG_NEW_DEFAULT_CATEGORY(example, "this example");
+
+int server(int argc, char *argv[]);
+int client(int argc, char *argv[]);
+
+int server(int argc, char *argv[])
+{
+ m_task_t task = NULL;
+ int count = 0;
+ while (count < N) {
+ if (task) {
+ MSG_task_destroy(task);
+ task = NULL;
+ }
+ MSG_task_receive(&task, "mymailbox");
+ count++;
+ }
+ MC_assert_stateful(atoi(MSG_task_get_name(task)) == 3);
+
+ XBT_INFO("OK");
+ return 0;
+}
+
+int client(int argc, char *argv[])
+{
+
+ m_task_t task =
+ MSG_task_create(argv[1], 0 /*comp cost */ , 10000 /*comm size */ ,
+ NULL /*arbitrary data */ );
+
+ MSG_task_send(task, "mymailbox");
+
+ XBT_INFO("Sent!");
+ return 0;
+}
+
+int main(int argc, char *argv[])
+{
+
+ MSG_global_init(&argc, argv);
+
+ MSG_create_environment("platform.xml");
+
+ MSG_function_register("server", server);
+
+ MSG_function_register("client", client);
+
+ MSG_launch_application("deploy_bugged1.xml");
+
+ MSG_main_stateful();
+
+ MSG_clean();
+
+ return 0;
+
+}
\ No newline at end of file
--- /dev/null
+/******************** Non-deterministic message ordering *********************/
+/* Server assumes a fixed order in the reception of messages from its clients */
+/* which is incorrect because the message ordering is non-deterministic */
+/******************************************************************************/
+
+#include <msg/msg.h>
+#include <mc/modelchecker.h>
+#define N 3
+
+XBT_LOG_NEW_DEFAULT_CATEGORY(example, "this example");
+
+int server(int argc, char *argv[]);
+int client(int argc, char *argv[]);
+
+int server(int argc, char *argv[])
+{
+ m_task_t task1, task2;
+ long val1, val2;
+
+ MSG_task_receive(&task1, "mymailbox");
+ val1 = (long) MSG_task_get_data(task1);
+ MSG_task_destroy(task1);
+ task1 = NULL;
+ XBT_INFO("Received %lu", val1);
+
+ MSG_task_receive(&task2, "mymailbox");
+ val2 = (long) MSG_task_get_data(task2);
+ MSG_task_destroy(task2);
+ task2 = NULL;
+ XBT_INFO("Received %lu", val2);
+
+ MC_assert_stateful(min(val1, val2) == 1);
+
+ MSG_task_receive(&task1, "mymailbox");
+ val1 = (long) MSG_task_get_data(task1);
+ MSG_task_destroy(task1);
+ XBT_INFO("Received %lu", val1);
+
+ MSG_task_receive(&task2, "mymailbox");
+ val2 = (long) MSG_task_get_data(task2);
+ MSG_task_destroy(task2);
+ XBT_INFO("Received %lu", val2);
+
+ XBT_INFO("OK");
+ return 0;
+}
+
+int client(int argc, char *argv[])
+{
+ m_task_t task1 =
+ MSG_task_create("task", 0, 10000, (void *) atol(argv[1]));
+ m_task_t task2 =
+ MSG_task_create("task", 0, 10000, (void *) atol(argv[1]));
+
+ XBT_INFO("Send %d!", atoi(argv[1]));
+ MSG_task_send(task1, "mymailbox");
+
+ XBT_INFO("Send %d!", atoi(argv[1]));
+ MSG_task_send(task2, "mymailbox");
+
+ return 0;
+}
+
+int main(int argc, char *argv[])
+{
+ MSG_global_init(&argc, argv);
+
+ MSG_create_environment("platform.xml");
+
+ MSG_function_register("server", server);
+
+ MSG_function_register("client", client);
+
+ MSG_launch_application("deploy_bugged2.xml");
+
+ MSG_main_stateful();
+
+ return 0;
+}
<process host="Geoff" function="client" />
-
<!-- <process host="Disney" function="client" />
+
<!-- <process host="Disney" function="client" />
<process host="iRMX" function="client" />
--- /dev/null
+<?xml version='1.0'?>
+
+<!DOCTYPE platform SYSTEM "http://simgrid.gforge.inria.fr/simgrid.dtd">
+
+<platform version="3">
+
+ <process host="Tremblay" function="coordinator" />
+
+ <process host="Fafard" function="client" >
+ <argument value="1"/>
+ </process>
+
+ <process host="Boivin" function="client" >
+ <argument value="2"/>
+ </process>
+
+ <!-- <process host="TeX" function="client" />
+
+ <process host="Geoff" function="client" />
+
+ <process host="Disney" function="client" />
+
+ <process host="iRMX" function="client" />
+
+ <process host="McGee" function="client" />
+
+ <process host="Gatien" function="client" />
+
+ <process host="Laroche" function="client" />
+
+ <process host="Tanguay" function="client" />
+
+ <process host="Morin" function="client" />
+
+ <process host="Ethernet" function="client" />
+
+ <process host="Bellemarre" function="client" />
+
+ <process host="Kuenning" function="client" />
+
+ <process host="Gaston" function="client" /> -->
+
+</platform>
--- /dev/null
+/***************** Centralized Mutual Exclusion Algorithm *********************/
+/* This example implements a centralized mutual exclusion algorithm. */
+/* CS requests of client 2 not satisfied */
+/******************************************************************************/
+
+#include "msg/msg.h"
+#include "mc/mc.h"
+#include "xbt/automaton.h"
+#include "xbt/automatonparse_promela.h"
+#include "example_liveness_with_cycle.h"
+#include "y.tab.c"
+
+#define AMOUNT_OF_CLIENTS 2
+#define CS_PER_PROCESS 4
+
+XBT_LOG_NEW_DEFAULT_CATEGORY(example_liveness_with_cycle, "my log messages");
+
+
+int p=0;
+int q=0;
+
+int predP(){
+ return p;
+}
+
+int predQ(){
+ return q;
+}
+
+
+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;
+ 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);
+ 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 { // that's a release. Check if someone was waiting for the lock
+ if (xbt_dynar_length(requests) > 0) {
+ 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{
+ CS_used = 0;
+ }
+ } else { // nobody wants it
+ XBT_INFO("CS release. resource now idle");
+ CS_used = 0;
+ todo--;
+ }
+ }
+ MSG_task_destroy(task);
+ }
+ XBT_INFO("Received all releases, quit now");
+ return 0;
+}
+
+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;
+
+ // request the CS 4 times, sleeping a bit in between
+ for (i = 0; i < CS_PER_PROCESS; i++) {
+
+ XBT_INFO("Ask the request");
+ MSG_task_send(MSG_task_create("request", 0, 1000, my_mailbox), "coordinator");
+
+ if(strcmp(my_mailbox, "2") == 0){
+ p = 1;
+ q = 0;
+ XBT_DEBUG("Propositions changed : p=1, q=0");
+ }
+
+ // wait the answer
+ m_task_t grant = NULL;
+ MSG_task_receive(&grant, my_mailbox);
+
+ if(strcmp(my_mailbox, "2") == 0){
+ q = 1;
+ p = 0;
+ XBT_DEBUG("Propositions changed : p=0, q=1");
+ }
+
+
+ MSG_task_destroy(grant);
+ 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");
+
+ MSG_process_sleep(my_pid);
+
+ if(strcmp(my_mailbox, "2") == 0){
+ q=0;
+ p=0;
+ XBT_DEBUG("Propositions changed : p=0, q=0");
+ }
+
+ }
+
+ XBT_INFO("Got all the CS I wanted (%s), quit now", my_mailbox);
+ return 0;
+}
+
+int main(int argc, char *argv[])
+{
+ init();
+ yyparse();
+ automaton = get_automaton();
+ xbt_new_propositional_symbol(automaton,"p", &predP);
+ xbt_new_propositional_symbol(automaton,"q", &predQ);
+
+ MSG_global_init(&argc, argv);
+ MSG_create_environment("../msg_platform.xml");
+ MSG_function_register("coordinator", coordinator);
+ MSG_function_register("client", client);
+ MSG_launch_application("deploy_mutex2.xml");
+ MSG_main_liveness_stateless(automaton, argv[0]);
+
+ return 0;
+}
--- /dev/null
+#ifndef _EXAMPLE_LIVENESS_WITH_CYCLE_H
+#define _EXAMPLE_LIVENESS_WITH_CYCLE_H
+
+int yyparse(void);
+int yywrap(void);
+int yylex(void);
+
+int predP(void);
+int predQ(void);
+
+int coordinator(int argc, char *argv[]);
+int client(int argc, char *argv[]);
+
+#endif
--- /dev/null
+/***************** Centralized Mutual Exclusion Algorithm *********************/
+/* This example implements a centralized mutual exclusion algorithm. */
+/* CS requests of client 2 not satisfied */
+/******************************************************************************/
+
+#include "msg/msg.h"
+#include "mc/mc.h"
+#include "xbt/automaton.h"
+#include "xbt/automatonparse_promela.h"
+#include "example_liveness_with_cycle.h"
+#include "y.tab.c"
+
+#define AMOUNT_OF_CLIENTS 2
+#define CS_PER_PROCESS 3
+
+XBT_LOG_NEW_DEFAULT_CATEGORY(example_liveness_with_cycle2, "my log messages");
+
+
+int p=0;
+int q=0;
+
+int predP(){
+ return p;
+}
+
+int predQ(){
+ return q;
+}
+
+
+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
+
+ while(1){
+ m_task_t task = NULL;
+ 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);
+ 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 { // that's a release. Check if someone was waiting for the lock
+ if (xbt_dynar_length(requests) > 0) {
+ 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);
+ }else{
+ CS_used = 0;
+ }
+ } else { // nobody wants it
+ XBT_INFO("CS release. resource now idle");
+ CS_used = 0;
+ }
+ }
+ MSG_task_destroy(task);
+ }
+ XBT_INFO("Received all releases, quit now");
+ return 0;
+}
+
+int client(int argc, char *argv[])
+{
+ int my_pid = MSG_process_get_PID(MSG_process_self());
+
+ char *my_mailbox = bprintf("%s", argv[1]);
+
+ 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){
+ p = 1;
+ q = 0;
+ XBT_INFO("Propositions changed (p=1, q=0)");
+ }
+
+ // wait the answer
+
+ m_task_t grant = NULL;
+ MSG_task_receive(&grant, my_mailbox);
+
+ if((strcmp(my_mailbox, "2") == 0) && (strcmp(MSG_task_get_name(grant), "grant") == 0)){
+ q = 1;
+ p = 0;
+ XBT_INFO("Propositions changed (q=1, p=0)");
+ }
+
+ MSG_task_destroy(grant);
+ 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");
+
+ MSG_process_sleep(my_pid);
+
+ if(strcmp(my_mailbox, "2") == 0){
+ q=0;
+ p=0;
+ XBT_INFO("Propositions changed (q=0, p=0)");
+ }
+
+ }
+
+ XBT_INFO("Got all the CS I wanted (%s), quit now", my_mailbox);
+ return 0;
+}
+
+int main(int argc, char *argv[])
+{
+ init();
+ yyparse();
+ automaton = get_automaton();
+ xbt_new_propositional_symbol(automaton,"p", &predP);
+ xbt_new_propositional_symbol(automaton,"q", &predQ);
+
+ MSG_global_init(&argc, argv);
+ MSG_create_environment("../msg_platform.xml");
+ MSG_function_register("coordinator", coordinator);
+ MSG_function_register("client", client);
+ MSG_launch_application("deploy_mutex2.xml");
+ MSG_main_liveness_stateless(automaton, argv[0]);
+
+ return 0;
+}
--- /dev/null
+
+#line 3 "lex.yy.c"
+
+#define YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types.
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t;
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else /* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif /* defined (__STDC__) */
+#endif /* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index. If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* Enter a start condition. This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN (yy_start) = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state. The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START (((yy_start) - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE yyrestart(yyin )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+extern int yyleng;
+
+extern FILE *yyin, *yyout;
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+ #define YY_LESS_LINENO(n)
+
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up yytext. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ *yy_cp = (yy_hold_char); \
+ YY_RESTORE_YY_MORE_OFFSET \
+ (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+ YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+ } \
+ while ( 0 )
+
+#define unput(c) yyunput( c, (yytext_ptr) )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+ {
+ FILE *yy_input_file;
+
+ char *yy_ch_buf; /* input buffer */
+ char *yy_buf_pos; /* current position in input buffer */
+
+ /* Size of input buffer in bytes, not including room for EOB
+ * characters.
+ */
+ yy_size_t yy_buf_size;
+
+ /* Number of characters read into yy_ch_buf, not including EOB
+ * characters.
+ */
+ int yy_n_chars;
+
+ /* Whether we "own" the buffer - i.e., we know we created it,
+ * and can realloc() it to grow it, and should free() it to
+ * delete it.
+ */
+ int yy_is_our_buffer;
+
+ /* Whether this is an "interactive" input source; if so, and
+ * if we're using stdio for input, then we want to use getc()
+ * instead of fread(), to make sure we stop fetching input after
+ * each newline.
+ */
+ int yy_is_interactive;
+
+ /* Whether we're considered to be at the beginning of a line.
+ * If so, '^' rules will be active on the next match, otherwise
+ * not.
+ */
+ int yy_at_bol;
+
+ int yy_bs_lineno; /**< The line count. */
+ int yy_bs_column; /**< The column count. */
+
+ /* Whether to try to fill the input buffer when we reach the
+ * end of it.
+ */
+ int yy_fill_buffer;
+
+ int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+ /* When an EOF's been seen but there's still some text to process
+ * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+ * shouldn't try reading from the input source any more. We might
+ * still have a bunch of tokens to match, though, because of
+ * possible backing-up.
+ *
+ * When we actually see the EOF, we change the status to "new"
+ * (via yyrestart()), so that the user can continue scanning by
+ * just pointing yyin at a new input file.
+ */
+#define YY_BUFFER_EOF_PENDING 2
+
+ };
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* Stack of input buffers. */
+static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
+static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
+static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
+ ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
+ : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
+
+/* yy_hold_char holds the character lost when yytext is formed. */
+static char yy_hold_char;
+static int yy_n_chars; /* number of characters read into yy_ch_buf */
+int yyleng;
+
+/* Points to current character in buffer. */
+static char *yy_c_buf_p = (char *) 0;
+static int yy_init = 0; /* whether we need to initialize */
+static int yy_start = 0; /* start state number */
+
+/* Flag which is used to allow yywrap()'s to do buffer switches
+ * instead of setting up a fresh yyin. A bit of a hack ...
+ */
+static int yy_did_buffer_switch_on_eof;
+
+void yyrestart (FILE *input_file );
+void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer );
+YY_BUFFER_STATE yy_create_buffer (FILE *file,int size );
+void yy_delete_buffer (YY_BUFFER_STATE b );
+void yy_flush_buffer (YY_BUFFER_STATE b );
+void yypush_buffer_state (YY_BUFFER_STATE new_buffer );
+void yypop_buffer_state (void );
+
+static void yyensure_buffer_stack (void );
+static void yy_load_buffer_state (void );
+static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file );
+
+#define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER )
+
+YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size );
+YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str );
+YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len );
+
+void *yyalloc (yy_size_t );
+void *yyrealloc (void *,yy_size_t );
+void yyfree (void * );
+
+#define yy_new_buffer yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){ \
+ yyensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer(yyin,YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+ }
+
+#define yy_set_bol(at_bol) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){\
+ yyensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer(yyin,YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+ }
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+
+#define yywrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
+
+typedef int yy_state_type;
+
+extern int yylineno;
+
+int yylineno = 1;
+
+extern char *yytext;
+#define yytext_ptr yytext
+
+static yy_state_type yy_get_previous_state (void );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
+static int yy_get_next_buffer (void );
+static void yy_fatal_error (yyconst char msg[] );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+ (yytext_ptr) = yy_bp; \
+ yyleng = (size_t) (yy_cp - yy_bp); \
+ (yy_hold_char) = *yy_cp; \
+ *yy_cp = '\0'; \
+ (yy_c_buf_p) = yy_cp;
+
+#define YY_NUM_RULES 25
+#define YY_END_OF_BUFFER 26
+/* This struct is not used in this scanner,
+ but its presence is necessary. */
+struct yy_trans_info
+ {
+ flex_int32_t yy_verify;
+ flex_int32_t yy_nxt;
+ };
+static yyconst flex_int16_t yy_accept[54] =
+ { 0,
+ 0, 0, 26, 24, 18, 23, 8, 24, 24, 9,
+ 10, 24, 24, 20, 14, 12, 13, 22, 22, 22,
+ 22, 22, 15, 24, 16, 18, 0, 0, 21, 0,
+ 6, 4, 0, 0, 20, 11, 22, 3, 22, 2,
+ 22, 7, 0, 0, 0, 19, 22, 22, 17, 5,
+ 22, 1, 0
+ } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 4, 5, 6, 1, 1, 1, 7, 1, 8,
+ 9, 10, 1, 1, 11, 12, 13, 14, 15, 14,
+ 14, 14, 14, 14, 14, 14, 14, 16, 17, 1,
+ 1, 18, 1, 1, 19, 19, 19, 19, 19, 19,
+ 19, 19, 19, 19, 19, 19, 19, 19, 19, 19,
+ 19, 19, 19, 19, 19, 19, 19, 19, 19, 19,
+ 1, 20, 1, 1, 21, 1, 19, 19, 19, 19,
+
+ 22, 23, 24, 19, 25, 19, 19, 19, 19, 26,
+ 27, 19, 19, 28, 19, 29, 19, 30, 19, 19,
+ 19, 19, 31, 32, 33, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1
+ } ;
+
+static yyconst flex_int32_t yy_meta[34] =
+ { 0,
+ 1, 1, 2, 2, 1, 2, 1, 1, 1, 1,
+ 1, 1, 3, 4, 4, 1, 1, 1, 4, 2,
+ 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+ 1, 1, 1
+ } ;
+
+static yyconst flex_int16_t yy_base[57] =
+ { 0,
+ 0, 0, 89, 90, 32, 90, 90, 34, 81, 90,
+ 90, 69, 76, 27, 31, 69, 90, 0, 59, 56,
+ 58, 55, 90, 42, 90, 45, 47, 0, 0, 0,
+ 90, 90, 52, 43, 49, 90, 0, 0, 44, 0,
+ 42, 90, 56, 65, 52, 56, 25, 26, 90, 0,
+ 16, 0, 90, 74, 31, 78
+ } ;
+
+static yyconst flex_int16_t yy_def[57] =
+ { 0,
+ 53, 1, 53, 53, 53, 53, 53, 54, 53, 53,
+ 53, 53, 53, 53, 53, 53, 53, 55, 55, 55,
+ 55, 55, 53, 53, 53, 53, 54, 27, 27, 27,
+ 53, 53, 56, 53, 53, 53, 55, 55, 55, 55,
+ 55, 53, 56, 56, 53, 53, 55, 55, 53, 55,
+ 55, 55, 0, 53, 53, 53
+ } ;
+
+static yyconst flex_int16_t yy_nxt[124] =
+ { 0,
+ 4, 5, 6, 5, 7, 8, 9, 10, 11, 4,
+ 12, 4, 13, 14, 15, 16, 17, 4, 18, 4,
+ 4, 18, 19, 20, 21, 22, 18, 18, 18, 18,
+ 23, 24, 25, 26, 37, 26, 27, 28, 34, 29,
+ 35, 35, 34, 52, 35, 35, 26, 51, 26, 27,
+ 28, 50, 29, 27, 44, 44, 46, 46, 44, 44,
+ 34, 45, 35, 35, 49, 45, 27, 44, 44, 46,
+ 46, 48, 47, 42, 45, 30, 41, 30, 43, 43,
+ 40, 43, 39, 38, 36, 33, 32, 31, 53, 3,
+ 53, 53, 53, 53, 53, 53, 53, 53, 53, 53,
+
+ 53, 53, 53, 53, 53, 53, 53, 53, 53, 53,
+ 53, 53, 53, 53, 53, 53, 53, 53, 53, 53,
+ 53, 53, 53
+ } ;
+
+static yyconst flex_int16_t yy_chk[124] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 5, 55, 5, 8, 8, 14, 8,
+ 14, 14, 15, 51, 15, 15, 26, 48, 26, 27,
+ 27, 47, 27, 8, 33, 33, 34, 34, 43, 43,
+ 35, 33, 35, 35, 45, 43, 27, 44, 44, 46,
+ 46, 41, 39, 24, 44, 54, 22, 54, 56, 56,
+ 21, 56, 20, 19, 16, 13, 12, 9, 3, 53,
+ 53, 53, 53, 53, 53, 53, 53, 53, 53, 53,
+
+ 53, 53, 53, 53, 53, 53, 53, 53, 53, 53,
+ 53, 53, 53, 53, 53, 53, 53, 53, 53, 53,
+ 53, 53, 53
+ } ;
+
+static yy_state_type yy_last_accepting_state;
+static char *yy_last_accepting_cpos;
+
+extern int yy_flex_debug;
+int yy_flex_debug = 0;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+char *yytext;
+#line 1 "parserPromela.lex"
+#line 4 "parserPromela.lex"
+
+
+#include <stdio.h>
+#include "automaton.h"
+#include "y.tab.h"
+
+ extern YYSTYPE yylval;
+
+#line 514 "lex.yy.c"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+static int yy_init_globals (void );
+
+/* Accessor methods to globals.
+ These are made visible to non-reentrant scanners for convenience. */
+
+int yylex_destroy (void );
+
+int yyget_debug (void );
+
+void yyset_debug (int debug_flag );
+
+YY_EXTRA_TYPE yyget_extra (void );
+
+void yyset_extra (YY_EXTRA_TYPE user_defined );
+
+FILE *yyget_in (void );
+
+void yyset_in (FILE * in_str );
+
+FILE *yyget_out (void );
+
+void yyset_out (FILE * out_str );
+
+int yyget_leng (void );
+
+char *yyget_text (void );
+
+int yyget_lineno (void );
+
+void yyset_lineno (int line_number );
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int yywrap (void );
+#else
+extern int yywrap (void );
+#endif
+#endif
+
+ static void yyunput (int c,char *buf_ptr );
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int );
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * );
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (void );
+#else
+static int input (void );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+ { \
+ int c = '*'; \
+ size_t n; \
+ for ( n = 0; n < max_size && \
+ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+ buf[n] = (char) c; \
+ if ( c == '\n' ) \
+ buf[n++] = (char) c; \
+ if ( c == EOF && ferror( yyin ) ) \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ result = n; \
+ } \
+ else \
+ { \
+ errno=0; \
+ while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+ { \
+ if( errno != EINTR) \
+ { \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ break; \
+ } \
+ errno=0; \
+ clearerr(yyin); \
+ } \
+ }\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int yylex (void);
+
+#define YY_DECL int yylex (void)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+ YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+ register yy_state_type yy_current_state;
+ register char *yy_cp, *yy_bp;
+ register int yy_act;
+
+#line 29 "parserPromela.lex"
+
+
+#line 704 "lex.yy.c"
+
+ if ( !(yy_init) )
+ {
+ (yy_init) = 1;
+
+#ifdef YY_USER_INIT
+ YY_USER_INIT;
+#endif
+
+ if ( ! (yy_start) )
+ (yy_start) = 1; /* first start state */
+
+ if ( ! yyin )
+ yyin = stdin;
+
+ if ( ! yyout )
+ yyout = stdout;
+
+ if ( ! YY_CURRENT_BUFFER ) {
+ yyensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer(yyin,YY_BUF_SIZE );
+ }
+
+ yy_load_buffer_state( );
+ }
+
+ while ( 1 ) /* loops until end-of-file is reached */
+ {
+ yy_cp = (yy_c_buf_p);
+
+ /* Support of yytext. */
+ *yy_cp = (yy_hold_char);
+
+ /* yy_bp points to the position in yy_ch_buf of the start of
+ * the current run.
+ */
+ yy_bp = yy_cp;
+
+ yy_current_state = (yy_start);
+yy_match:
+ do
+ {
+ register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 54 )
+ yy_c = yy_meta[(unsigned int) yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+ ++yy_cp;
+ }
+ while ( yy_base[yy_current_state] != 90 );
+
+yy_find_action:
+ yy_act = yy_accept[yy_current_state];
+ if ( yy_act == 0 )
+ { /* have to back up */
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
+ yy_act = yy_accept[yy_current_state];
+ }
+
+ YY_DO_BEFORE_ACTION;
+
+do_action: /* This label is used only to access EOF actions. */
+
+ switch ( yy_act )
+ { /* beginning of action switch */
+ case 0: /* must back up */
+ /* undo the effects of YY_DO_BEFORE_ACTION */
+ *yy_cp = (yy_hold_char);
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
+ goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 31 "parserPromela.lex"
+{ printf("%s", yytext); return (NEVER); }
+ YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 32 "parserPromela.lex"
+{ printf("%s", yytext); return (IF); }
+ YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 33 "parserPromela.lex"
+{ printf("%s", yytext);
+ return (FI); }
+ YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 35 "parserPromela.lex"
+{ printf("%s", yytext); return (IMPLIES); }
+ YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 36 "parserPromela.lex"
+{ printf("%s", yytext); return (GOTO); }
+ YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 37 "parserPromela.lex"
+{ printf("%s", yytext); return (AND); }
+ YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 38 "parserPromela.lex"
+{ printf("%s", yytext); return (OR); }
+ YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 39 "parserPromela.lex"
+{ printf("%s", yytext); return (NOT); }
+ YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 40 "parserPromela.lex"
+{ printf("%s", yytext); return (LEFT_PAR); }
+ YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 41 "parserPromela.lex"
+{ printf("%s", yytext); return (RIGHT_PAR); }
+ YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 42 "parserPromela.lex"
+{ printf("%s", yytext); return (CASE); }
+ YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 43 "parserPromela.lex"
+{ printf("%s", yytext); return (COLON); }
+ YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 44 "parserPromela.lex"
+{ printf("%s", yytext); return (SEMI_COLON); }
+ YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 45 "parserPromela.lex"
+{ printf("%s", yytext); return (CASE_TRUE); }
+ YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 46 "parserPromela.lex"
+{ printf("%s", yytext); return (LEFT_BRACE); }
+ YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 47 "parserPromela.lex"
+{ printf("%s", yytext); return (RIGHT_BRACE); }
+ YY_BREAK
+case 17:
+/* rule 17 can match eol */
+YY_RULE_SETUP
+#line 50 "parserPromela.lex"
+{ printf(" ");}
+ YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 52 "parserPromela.lex"
+{ printf("%s",yytext); }
+ YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 55 "parserPromela.lex"
+{ printf("%s",yytext);
+ sscanf(yytext,"%lf",&yylval.real);
+ return (LITT_REEL); }
+ YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 59 "parserPromela.lex"
+{ printf("%s",yytext);
+ sscanf(yytext,"%d",&yylval.integer);
+ return (LITT_ENT); }
+ YY_BREAK
+case 21:
+/* rule 21 can match eol */
+YY_RULE_SETUP
+#line 63 "parserPromela.lex"
+{ printf("%s",yytext);
+ yylval.string=(char *)malloc(strlen(yytext)+1);
+ sscanf(yytext,"%s",yylval.string);
+ return (LITT_CHAINE); }
+ YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 68 "parserPromela.lex"
+{ printf("%s",yytext);
+ yylval.string=(char *)malloc(strlen(yytext)+1);
+ sscanf(yytext,"%s",yylval.string);
+ return (ID); }
+ YY_BREAK
+case 23:
+/* rule 23 can match eol */
+YY_RULE_SETUP
+#line 73 "parserPromela.lex"
+{ printf("\n"); }
+ YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 75 "parserPromela.lex"
+{ printf("caractère inconnu\n"); }
+ YY_BREAK
+case 25:
+YY_RULE_SETUP
+#line 77 "parserPromela.lex"
+ECHO;
+ YY_BREAK
+#line 926 "lex.yy.c"
+case YY_STATE_EOF(INITIAL):
+ yyterminate();
+
+ case YY_END_OF_BUFFER:
+ {
+ /* Amount of text matched not including the EOB char. */
+ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
+
+ /* Undo the effects of YY_DO_BEFORE_ACTION. */
+ *yy_cp = (yy_hold_char);
+ YY_RESTORE_YY_MORE_OFFSET
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+ {
+ /* We're scanning a new file or input source. It's
+ * possible that this happened because the user
+ * just pointed yyin at a new source and called
+ * yylex(). If so, then we have to assure
+ * consistency between YY_CURRENT_BUFFER and our
+ * globals. Here is the right place to do so, because
+ * this is the first action (other than possibly a
+ * back-up) that will match for the new input source.
+ */
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+ }
+
+ /* Note that here we test for yy_c_buf_p "<=" to the position
+ * of the first EOB in the buffer, since yy_c_buf_p will
+ * already have been incremented past the NUL character
+ * (since all states make transitions on EOB to the
+ * end-of-buffer state). Contrast this with the test
+ * in input().
+ */
+ if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
+ { /* This was really a NUL. */
+ yy_state_type yy_next_state;
+
+ (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( );
+
+ /* Okay, we're now positioned to make the NUL
+ * transition. We couldn't have
+ * yy_get_previous_state() go ahead and do it
+ * for us because it doesn't know how to deal
+ * with the possibility of jamming (and we don't
+ * want to build jamming into it because then it
+ * will run more slowly).
+ */
+
+ yy_next_state = yy_try_NUL_trans( yy_current_state );
+
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+
+ if ( yy_next_state )
+ {
+ /* Consume the NUL. */
+ yy_cp = ++(yy_c_buf_p);
+ yy_current_state = yy_next_state;
+ goto yy_match;
+ }
+
+ else
+ {
+ yy_cp = (yy_c_buf_p);
+ goto yy_find_action;
+ }
+ }
+
+ else switch ( yy_get_next_buffer( ) )
+ {
+ case EOB_ACT_END_OF_FILE:
+ {
+ (yy_did_buffer_switch_on_eof) = 0;
+
+ if ( yywrap( ) )
+ {
+ /* Note: because we've taken care in
+ * yy_get_next_buffer() to have set up
+ * yytext, we can now set up
+ * yy_c_buf_p so that if some total
+ * hoser (like flex itself) wants to
+ * call the scanner after we return the
+ * YY_NULL, it'll still work - another
+ * YY_NULL will get returned.
+ */
+ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
+
+ yy_act = YY_STATE_EOF(YY_START);
+ goto do_action;
+ }
+
+ else
+ {
+ if ( ! (yy_did_buffer_switch_on_eof) )
+ YY_NEW_FILE;
+ }
+ break;
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ (yy_c_buf_p) =
+ (yytext_ptr) + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( );
+
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+ goto yy_match;
+
+ case EOB_ACT_LAST_MATCH:
+ (yy_c_buf_p) =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
+
+ yy_current_state = yy_get_previous_state( );
+
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+ goto yy_find_action;
+ }
+ break;
+ }
+
+ default:
+ YY_FATAL_ERROR(
+ "fatal flex scanner internal error--no action found" );
+ } /* end of action switch */
+ } /* end of scanning one token */
+} /* end of yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ * EOB_ACT_LAST_MATCH -
+ * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ * EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (void)
+{
+ register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+ register char *source = (yytext_ptr);
+ register int number_to_move, i;
+ int ret_val;
+
+ if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
+ YY_FATAL_ERROR(
+ "fatal flex scanner internal error--end of buffer missed" );
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+ { /* Don't try to fill the buffer, so this is an EOF. */
+ if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
+ {
+ /* We matched a single character, the EOB, so
+ * treat this as a final EOF.
+ */
+ return EOB_ACT_END_OF_FILE;
+ }
+
+ else
+ {
+ /* We matched some text prior to the EOB, first
+ * process it.
+ */
+ return EOB_ACT_LAST_MATCH;
+ }
+ }
+
+ /* Try to read more data. */
+
+ /* First move last chars to start of buffer. */
+ number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
+
+ for ( i = 0; i < number_to_move; ++i )
+ *(dest++) = *(source++);
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+ /* don't do the read, it's not guaranteed to return an EOF,
+ * just force an EOF
+ */
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
+
+ else
+ {
+ int num_to_read =
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+ while ( num_to_read <= 0 )
+ { /* Not enough room in the buffer - grow it. */
+
+ /* just a shorter name for the current buffer */
+ YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+ int yy_c_buf_p_offset =
+ (int) ((yy_c_buf_p) - b->yy_ch_buf);
+
+ if ( b->yy_is_our_buffer )
+ {
+ int new_size = b->yy_buf_size * 2;
+
+ if ( new_size <= 0 )
+ b->yy_buf_size += b->yy_buf_size / 8;
+ else
+ b->yy_buf_size *= 2;
+
+ b->yy_ch_buf = (char *)
+ /* Include room in for 2 EOB chars. */
+ yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
+ }
+ else
+ /* Can't grow it, we don't own it. */
+ b->yy_ch_buf = 0;
+
+ if ( ! b->yy_ch_buf )
+ YY_FATAL_ERROR(
+ "fatal error - scanner input buffer overflow" );
+
+ (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+ num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+ number_to_move - 1;
+
+ }
+
+ if ( num_to_read > YY_READ_BUF_SIZE )
+ num_to_read = YY_READ_BUF_SIZE;
+
+ /* Read in more data. */
+ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+ (yy_n_chars), (size_t) num_to_read );
+
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ if ( (yy_n_chars) == 0 )
+ {
+ if ( number_to_move == YY_MORE_ADJ )
+ {
+ ret_val = EOB_ACT_END_OF_FILE;
+ yyrestart(yyin );
+ }
+
+ else
+ {
+ ret_val = EOB_ACT_LAST_MATCH;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+ YY_BUFFER_EOF_PENDING;
+ }
+ }
+
+ else
+ ret_val = EOB_ACT_CONTINUE_SCAN;
+
+ if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+ /* Extend the array by 50%, plus the number we really need. */
+ yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
+ if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+ }
+
+ (yy_n_chars) += number_to_move;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
+
+ (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+ return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+ static yy_state_type yy_get_previous_state (void)
+{
+ register yy_state_type yy_current_state;
+ register char *yy_cp;
+
+ yy_current_state = (yy_start);
+
+ for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
+ {
+ register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 54 )
+ yy_c = yy_meta[(unsigned int) yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+ }
+
+ return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ * next_state = yy_try_NUL_trans( current_state );
+ */
+ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
+{
+ register int yy_is_jam;
+ register char *yy_cp = (yy_c_buf_p);
+
+ register YY_CHAR yy_c = 1;
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 54 )
+ yy_c = yy_meta[(unsigned int) yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+ yy_is_jam = (yy_current_state == 53);
+
+ return yy_is_jam ? 0 : yy_current_state;
+}
+
+ static void yyunput (int c, register char * yy_bp )
+{
+ register char *yy_cp;
+
+ yy_cp = (yy_c_buf_p);
+
+ /* undo effects of setting up yytext */
+ *yy_cp = (yy_hold_char);
+
+ if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
+ { /* need to shift things up to make room */
+ /* +2 for EOB chars. */
+ register int number_to_move = (yy_n_chars) + 2;
+ register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
+ register char *source =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
+
+ while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+ *--dest = *--source;
+
+ yy_cp += (int) (dest - source);
+ yy_bp += (int) (dest - source);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
+
+ if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
+ YY_FATAL_ERROR( "flex scanner push-back overflow" );
+ }
+
+ *--yy_cp = (char) c;
+
+ (yytext_ptr) = yy_bp;
+ (yy_hold_char) = *yy_cp;
+ (yy_c_buf_p) = yy_cp;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+ static int yyinput (void)
+#else
+ static int input (void)
+#endif
+
+{
+ int c;
+
+ *(yy_c_buf_p) = (yy_hold_char);
+
+ if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
+ {
+ /* yy_c_buf_p now points to the character we want to return.
+ * If this occurs *before* the EOB characters, then it's a
+ * valid NUL; if not, then we've hit the end of the buffer.
+ */
+ if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
+ /* This was really a NUL. */
+ *(yy_c_buf_p) = '\0';
+
+ else
+ { /* need more input */
+ int offset = (yy_c_buf_p) - (yytext_ptr);
+ ++(yy_c_buf_p);
+
+ switch ( yy_get_next_buffer( ) )
+ {
+ case EOB_ACT_LAST_MATCH:
+ /* This happens because yy_g_n_b()
+ * sees that we've accumulated a
+ * token and flags that we need to
+ * try matching the token before
+ * proceeding. But for input(),
+ * there's no matching to consider.
+ * So convert the EOB_ACT_LAST_MATCH
+ * to EOB_ACT_END_OF_FILE.
+ */
+
+ /* Reset buffer status. */
+ yyrestart(yyin );
+
+ /*FALLTHROUGH*/
+
+ case EOB_ACT_END_OF_FILE:
+ {
+ if ( yywrap( ) )
+ return EOF;
+
+ if ( ! (yy_did_buffer_switch_on_eof) )
+ YY_NEW_FILE;
+#ifdef __cplusplus
+ return yyinput();
+#else
+ return input();
+#endif
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ (yy_c_buf_p) = (yytext_ptr) + offset;
+ break;
+ }
+ }
+ }
+
+ c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
+ *(yy_c_buf_p) = '\0'; /* preserve yytext */
+ (yy_hold_char) = *++(yy_c_buf_p);
+
+ return c;
+}
+#endif /* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ *
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+ void yyrestart (FILE * input_file )
+{
+
+ if ( ! YY_CURRENT_BUFFER ){
+ yyensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer(yyin,YY_BUF_SIZE );
+ }
+
+ yy_init_buffer(YY_CURRENT_BUFFER,input_file );
+ yy_load_buffer_state( );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ *
+ */
+ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
+{
+
+ /* TODO. We should be able to replace this entire function body
+ * with
+ * yypop_buffer_state();
+ * yypush_buffer_state(new_buffer);
+ */
+ yyensure_buffer_stack ();
+ if ( YY_CURRENT_BUFFER == new_buffer )
+ return;
+
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+ yy_load_buffer_state( );
+
+ /* We don't actually know whether we did this switch during
+ * EOF (yywrap()) processing, but the only time this flag
+ * is looked at is after yywrap() is called, so it's safe
+ * to go ahead and always set it.
+ */
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+
+static void yy_load_buffer_state (void)
+{
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+ yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+ (yy_hold_char) = *(yy_c_buf_p);
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ *
+ * @return the allocated buffer state.
+ */
+ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
+{
+ YY_BUFFER_STATE b;
+
+ b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
+ if ( ! b )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+ b->yy_buf_size = size;
+
+ /* yy_ch_buf has to be 2 characters longer than the size given because
+ * we need to put in 2 end-of-buffer characters.
+ */
+ b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 );
+ if ( ! b->yy_ch_buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+ b->yy_is_our_buffer = 1;
+
+ yy_init_buffer(b,file );
+
+ return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with yy_create_buffer()
+ *
+ */
+ void yy_delete_buffer (YY_BUFFER_STATE b )
+{
+
+ if ( ! b )
+ return;
+
+ if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+ YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+ if ( b->yy_is_our_buffer )
+ yyfree((void *) b->yy_ch_buf );
+
+ yyfree((void *) b );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a yyrestart() or at EOF.
+ */
+ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
+
+{
+ int oerrno = errno;
+
+ yy_flush_buffer(b );
+
+ b->yy_input_file = file;
+ b->yy_fill_buffer = 1;
+
+ /* If b is the current buffer, then yy_init_buffer was _probably_
+ * called from yyrestart() or through yy_get_next_buffer.
+ * In that case, we don't want to reset the lineno or column.
+ */
+ if (b != YY_CURRENT_BUFFER){
+ b->yy_bs_lineno = 1;
+ b->yy_bs_column = 0;
+ }
+
+ b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+
+ errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ *
+ */
+ void yy_flush_buffer (YY_BUFFER_STATE b )
+{
+ if ( ! b )
+ return;
+
+ b->yy_n_chars = 0;
+
+ /* We always need two end-of-buffer characters. The first causes
+ * a transition to the end-of-buffer state. The second causes
+ * a jam in that state.
+ */
+ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+ b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+ b->yy_buf_pos = &b->yy_ch_buf[0];
+
+ b->yy_at_bol = 1;
+ b->yy_buffer_status = YY_BUFFER_NEW;
+
+ if ( b == YY_CURRENT_BUFFER )
+ yy_load_buffer_state( );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ * the current state. This function will allocate the stack
+ * if necessary.
+ * @param new_buffer The new state.
+ *
+ */
+void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
+{
+ if (new_buffer == NULL)
+ return;
+
+ yyensure_buffer_stack();
+
+ /* This block is copied from yy_switch_to_buffer. */
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ /* Only push if top exists. Otherwise, replace top. */
+ if (YY_CURRENT_BUFFER)
+ (yy_buffer_stack_top)++;
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+ /* copied from yy_switch_to_buffer. */
+ yy_load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ * The next element becomes the new top.
+ *
+ */
+void yypop_buffer_state (void)
+{
+ if (!YY_CURRENT_BUFFER)
+ return;
+
+ yy_delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ if ((yy_buffer_stack_top) > 0)
+ --(yy_buffer_stack_top);
+
+ if (YY_CURRENT_BUFFER) {
+ yy_load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+ }
+}
+
+/* Allocates the stack if it does not exist.
+ * Guarantees space for at least one push.
+ */
+static void yyensure_buffer_stack (void)
+{
+ int num_to_alloc;
+
+ if (!(yy_buffer_stack)) {
+
+ /* First allocation is just for 2 elements, since we don't know if this
+ * scanner will even need a stack. We use 2 instead of 1 to avoid an
+ * immediate realloc on the next call.
+ */
+ num_to_alloc = 1;
+ (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
+ (num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+ if ( ! (yy_buffer_stack) )
+ YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
+
+ memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+
+ (yy_buffer_stack_max) = num_to_alloc;
+ (yy_buffer_stack_top) = 0;
+ return;
+ }
+
+ if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
+
+ /* Increase the buffer to prepare for a possible push. */
+ int grow_size = 8 /* arbitrary grow size */;
+
+ num_to_alloc = (yy_buffer_stack_max) + grow_size;
+ (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
+ ((yy_buffer_stack),
+ num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+ if ( ! (yy_buffer_stack) )
+ YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
+
+ /* zero only the new slots.*/
+ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
+ (yy_buffer_stack_max) = num_to_alloc;
+ }
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ *
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size )
+{
+ YY_BUFFER_STATE b;
+
+ if ( size < 2 ||
+ base[size-2] != YY_END_OF_BUFFER_CHAR ||
+ base[size-1] != YY_END_OF_BUFFER_CHAR )
+ /* They forgot to leave room for the EOB's. */
+ return 0;
+
+ b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
+ if ( ! b )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
+
+ b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
+ b->yy_buf_pos = b->yy_ch_buf = base;
+ b->yy_is_our_buffer = 0;
+ b->yy_input_file = 0;
+ b->yy_n_chars = b->yy_buf_size;
+ b->yy_is_interactive = 0;
+ b->yy_at_bol = 1;
+ b->yy_fill_buffer = 0;
+ b->yy_buffer_status = YY_BUFFER_NEW;
+
+ yy_switch_to_buffer(b );
+
+ return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ *
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ * yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE yy_scan_string (yyconst char * yystr )
+{
+
+ return yy_scan_bytes(yystr,strlen(yystr) );
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ *
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, int _yybytes_len )
+{
+ YY_BUFFER_STATE b;
+ char *buf;
+ yy_size_t n;
+ int i;
+
+ /* Get memory for full buffer, including space for trailing EOB's. */
+ n = _yybytes_len + 2;
+ buf = (char *) yyalloc(n );
+ if ( ! buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
+
+ for ( i = 0; i < _yybytes_len; ++i )
+ buf[i] = yybytes[i];
+
+ buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+ b = yy_scan_buffer(buf,n );
+ if ( ! b )
+ YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
+
+ /* It's okay to grow etc. this buffer, and we should throw it
+ * away when we're done.
+ */
+ b->yy_is_our_buffer = 1;
+
+ return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg )
+{
+ (void) fprintf( stderr, "%s\n", msg );
+ exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up yytext. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ yytext[yyleng] = (yy_hold_char); \
+ (yy_c_buf_p) = yytext + yyless_macro_arg; \
+ (yy_hold_char) = *(yy_c_buf_p); \
+ *(yy_c_buf_p) = '\0'; \
+ yyleng = yyless_macro_arg; \
+ } \
+ while ( 0 )
+
+/* Accessor methods (get/set functions) to struct members. */
+
+/** Get the current line number.
+ *
+ */
+int yyget_lineno (void)
+{
+
+ return yylineno;
+}
+
+/** Get the input stream.
+ *
+ */
+FILE *yyget_in (void)
+{
+ return yyin;
+}
+
+/** Get the output stream.
+ *
+ */
+FILE *yyget_out (void)
+{
+ return yyout;
+}
+
+/** Get the length of the current token.
+ *
+ */
+int yyget_leng (void)
+{
+ return yyleng;
+}
+
+/** Get the current token.
+ *
+ */
+
+char *yyget_text (void)
+{
+ return yytext;
+}
+
+/** Set the current line number.
+ * @param line_number
+ *
+ */
+void yyset_lineno (int line_number )
+{
+
+ yylineno = line_number;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ *
+ * @see yy_switch_to_buffer
+ */
+void yyset_in (FILE * in_str )
+{
+ yyin = in_str ;
+}
+
+void yyset_out (FILE * out_str )
+{
+ yyout = out_str ;
+}
+
+int yyget_debug (void)
+{
+ return yy_flex_debug;
+}
+
+void yyset_debug (int bdebug )
+{
+ yy_flex_debug = bdebug ;
+}
+
+static int yy_init_globals (void)
+{
+ /* Initialization is the same as for the non-reentrant scanner.
+ * This function is called from yylex_destroy(), so don't allocate here.
+ */
+
+ (yy_buffer_stack) = 0;
+ (yy_buffer_stack_top) = 0;
+ (yy_buffer_stack_max) = 0;
+ (yy_c_buf_p) = (char *) 0;
+ (yy_init) = 0;
+ (yy_start) = 0;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+ yyin = stdin;
+ yyout = stdout;
+#else
+ yyin = (FILE *) 0;
+ yyout = (FILE *) 0;
+#endif
+
+ /* For future reference: Set errno on error, since we are called by
+ * yylex_init()
+ */
+ return 0;
+}
+
+/* yylex_destroy is for both reentrant and non-reentrant scanners. */
+int yylex_destroy (void)
+{
+
+ /* Pop the buffer stack, destroying each element. */
+ while(YY_CURRENT_BUFFER){
+ yy_delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ yypop_buffer_state();
+ }
+
+ /* Destroy the stack itself. */
+ yyfree((yy_buffer_stack) );
+ (yy_buffer_stack) = NULL;
+
+ /* Reset the globals. This is important in a non-reentrant scanner so the next time
+ * yylex() is called, initialization will occur. */
+ yy_init_globals( );
+
+ return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
+{
+ register int i;
+ for ( i = 0; i < n; ++i )
+ s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s )
+{
+ register int n;
+ for ( n = 0; s[n]; ++n )
+ ;
+
+ return n;
+}
+#endif
+
+void *yyalloc (yy_size_t size )
+{
+ return (void *) malloc( size );
+}
+
+void *yyrealloc (void * ptr, yy_size_t size )
+{
+ /* The cast to (char *) in the following accommodates both
+ * implementations that use char* generic pointers, and those
+ * that use void* generic pointers. It works with the latter
+ * because both ANSI C and C++ allow castless assignment from
+ * any pointer type to void*, and deal with argument conversions
+ * as though doing an assignment.
+ */
+ return (void *) realloc( (char *) ptr, size );
+}
+
+void yyfree (void * ptr )
+{
+ free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 77 "parserPromela.lex"
+
+
+
+
+
--- /dev/null
+%option noyywrap
+
+%{
+
+
+#include <stdio.h>
+#include "automaton.h"
+#include "y.tab.h"
+
+ extern YYSTYPE yylval;
+
+%}
+
+blancs [ \t]+
+espace [ ]+
+nouv_ligne [ \n]
+
+chiffre [0-9]
+entier {chiffre}+
+reel {entier}("."{entier})
+caractere [a-zA-Z0-9_]
+
+numl \n
+
+chaine \"({caractere}*|\n|\\|\"|{espace}*)*\"
+
+commentaire "/*"([^\*\/]*{nouv_ligne}*[^\*\/]*)*"*/"
+
+%%
+
+"never" { printf("%s", yytext); return (NEVER); }
+"if" { printf("%s", yytext); return (IF); }
+"fi" { printf("%s", yytext);
+ return (FI); }
+"->" { printf("%s", yytext); return (IMPLIES); }
+"goto" { printf("%s", yytext); return (GOTO); }
+"&&" { printf("%s", yytext); return (AND); }
+"||" { printf("%s", yytext); return (OR); }
+"!" { printf("%s", yytext); return (NOT); }
+"(" { printf("%s", yytext); return (LEFT_PAR); }
+")" { printf("%s", yytext); return (RIGHT_PAR); }
+"::" { printf("%s", yytext); return (CASE); }
+":" { printf("%s", yytext); return (COLON); }
+";" { printf("%s", yytext); return (SEMI_COLON); }
+"1" { printf("%s", yytext); return (CASE_TRUE); }
+"{" { printf("%s", yytext); return (LEFT_BRACE); }
+"}" { printf("%s", yytext); return (RIGHT_BRACE); }
+
+
+{commentaire} { printf(" ");}
+
+{blancs} { printf("%s",yytext); }
+
+
+{reel} { printf("%s",yytext);
+ sscanf(yytext,"%lf",&yylval.real);
+ return (LITT_REEL); }
+
+{entier} { printf("%s",yytext);
+ sscanf(yytext,"%d",&yylval.integer);
+ return (LITT_ENT); }
+
+{chaine} { printf("%s",yytext);
+ yylval.string=(char *)malloc(strlen(yytext)+1);
+ sscanf(yytext,"%s",yylval.string);
+ return (LITT_CHAINE); }
+
+[a-zA-Z]{caractere}* { printf("%s",yytext);
+ yylval.string=(char *)malloc(strlen(yytext)+1);
+ sscanf(yytext,"%s",yylval.string);
+ return (ID); }
+
+{numl} { printf("\n"); }
+
+. { printf("caractère inconnu\n"); }
+
+%%
+
+
--- /dev/null
+%{
+
+#include "automaton.h"
+#include "automatonparse_promela.h"
+#include "lex.yy.c"
+
+void yyerror(const char *s);
+
+%}
+
+%union{
+ double real;
+ int integer;
+ char* string;
+ xbt_exp_label_t label;
+}
+
+%token NEVER
+%token IF
+%token FI
+%token IMPLIES
+%token GOTO
+%token AND
+%token OR
+%token NOT
+%token LEFT_PAR
+%token RIGHT_PAR
+%token CASE
+%token COLON
+%token SEMI_COLON
+%token CASE_TRUE
+%token LEFT_BRACE
+%token RIGHT_BRACE
+%token <integer> LITT_ENT
+%token <string> LITT_CHAINE
+%token <real> LITT_REEL
+%token <string> ID
+
+%type <label> exp;
+
+%start automaton
+
+%left AND OR
+%nonassoc NOT
+
+%%
+
+automaton : NEVER LEFT_BRACE stateseq RIGHT_BRACE
+ ;
+
+stateseq :
+ | ID COLON { new_state($1, 1);} IF option FI SEMI_COLON stateseq
+ ;
+
+option :
+ | CASE exp IMPLIES GOTO ID option { new_transition($5, $2);}
+ ;
+
+exp : LEFT_PAR exp RIGHT_PAR { $$ = $2; }
+ | exp OR exp { $$ = new_label(0, $1, $3); }
+ | exp AND exp { $$ = new_label(1, $1, $3); }
+ | NOT exp { $$ = new_label(2, $2); }
+ | CASE_TRUE { $$ = new_label(4); }
+ | ID { $$ = new_label(3, $1); }
+ ;
+
+%%
+
+
+
+void yyerror(const char *s){
+ fprintf (stderr, "%s\n", s);
+}
+
+
+
--- /dev/null
+Terminals unused in grammar
+
+ LITT_ENT
+ LITT_CHAINE
+ LITT_REEL
+
+
+Grammaire
+
+ 0 $accept: automaton $end
+
+ 1 automaton: NEVER LEFT_BRACE stateseq RIGHT_BRACE
+
+ 2 stateseq: /* vide */
+
+ 3 $@1: /* vide */
+
+ 4 stateseq: ID COLON $@1 IF option FI SEMI_COLON stateseq
+
+ 5 option: /* vide */
+ 6 | CASE exp IMPLIES GOTO ID option
+
+ 7 exp: LEFT_PAR exp RIGHT_PAR
+ 8 | exp OR exp
+ 9 | exp AND exp
+ 10 | NOT exp
+ 11 | CASE_TRUE
+ 12 | ID
+
+
+Terminaux, suivis des règles où ils apparaissent
+
+$end (0) 0
+error (256)
+NEVER (258) 1
+IF (259) 4
+FI (260) 4
+IMPLIES (261) 6
+GOTO (262) 6
+AND (263) 9
+OR (264) 8
+NOT (265) 10
+LEFT_PAR (266) 7
+RIGHT_PAR (267) 7
+CASE (268) 6
+COLON (269) 4
+SEMI_COLON (270) 4
+CASE_TRUE (271) 11
+LEFT_BRACE (272) 1
+RIGHT_BRACE (273) 1
+LITT_ENT (274)
+LITT_CHAINE (275)
+LITT_REEL (276)
+ID (277) 4 6 12
+
+
+Non-terminaux, suivis des règles où ils apparaissent
+
+$accept (23)
+ à gauche: 0
+automaton (24)
+ à gauche: 1, à droite: 0
+stateseq (25)
+ à gauche: 2 4, à droite: 1 4
+$@1 (26)
+ à gauche: 3, à droite: 4
+option (27)
+ à gauche: 5 6, à droite: 4 6
+exp (28)
+ à gauche: 7 8 9 10 11 12, à droite: 6 7 8 9 10
+
+
+état 0
+
+ 0 $accept: . automaton $end
+
+ NEVER décalage et aller à l'état 1
+
+ automaton aller à l'état 2
+
+
+état 1
+
+ 1 automaton: NEVER . LEFT_BRACE stateseq RIGHT_BRACE
+
+ LEFT_BRACE décalage et aller à l'état 3
+
+
+état 2
+
+ 0 $accept: automaton . $end
+
+ $end décalage et aller à l'état 4
+
+
+état 3
+
+ 1 automaton: NEVER LEFT_BRACE . stateseq RIGHT_BRACE
+
+ ID décalage et aller à l'état 5
+
+ $défaut réduction par utilisation de la règle 2 (stateseq)
+
+ stateseq aller à l'état 6
+
+
+état 4
+
+ 0 $accept: automaton $end .
+
+ $défaut accepter
+
+
+état 5
+
+ 4 stateseq: ID . COLON $@1 IF option FI SEMI_COLON stateseq
+
+ COLON décalage et aller à l'état 7
+
+
+état 6
+
+ 1 automaton: NEVER LEFT_BRACE stateseq . RIGHT_BRACE
+
+ RIGHT_BRACE décalage et aller à l'état 8
+
+
+état 7
+
+ 4 stateseq: ID COLON . $@1 IF option FI SEMI_COLON stateseq
+
+ $défaut réduction par utilisation de la règle 3 ($@1)
+
+ $@1 aller à l'état 9
+
+
+état 8
+
+ 1 automaton: NEVER LEFT_BRACE stateseq RIGHT_BRACE .
+
+ $défaut réduction par utilisation de la règle 1 (automaton)
+
+
+état 9
+
+ 4 stateseq: ID COLON $@1 . IF option FI SEMI_COLON stateseq
+
+ IF décalage et aller à l'état 10
+
+
+état 10
+
+ 4 stateseq: ID COLON $@1 IF . option FI SEMI_COLON stateseq
+
+ CASE décalage et aller à l'état 11
+
+ $défaut réduction par utilisation de la règle 5 (option)
+
+ option aller à l'état 12
+
+
+état 11
+
+ 6 option: CASE . exp IMPLIES GOTO ID option
+
+ NOT décalage et aller à l'état 13
+ LEFT_PAR décalage et aller à l'état 14
+ CASE_TRUE décalage et aller à l'état 15
+ ID décalage et aller à l'état 16
+
+ exp aller à l'état 17
+
+
+état 12
+
+ 4 stateseq: ID COLON $@1 IF option . FI SEMI_COLON stateseq
+
+ FI décalage et aller à l'état 18
+
+
+état 13
+
+ 10 exp: NOT . exp
+
+ NOT décalage et aller à l'état 13
+ LEFT_PAR décalage et aller à l'état 14
+ CASE_TRUE décalage et aller à l'état 15
+ ID décalage et aller à l'état 16
+
+ exp aller à l'état 19
+
+
+état 14
+
+ 7 exp: LEFT_PAR . exp RIGHT_PAR
+
+ NOT décalage et aller à l'état 13
+ LEFT_PAR décalage et aller à l'état 14
+ CASE_TRUE décalage et aller à l'état 15
+ ID décalage et aller à l'état 16
+
+ exp aller à l'état 20
+
+
+état 15
+
+ 11 exp: CASE_TRUE .
+
+ $défaut réduction par utilisation de la règle 11 (exp)
+
+
+état 16
+
+ 12 exp: ID .
+
+ $défaut réduction par utilisation de la règle 12 (exp)
+
+
+état 17
+
+ 6 option: CASE exp . IMPLIES GOTO ID option
+ 8 exp: exp . OR exp
+ 9 | exp . AND exp
+
+ IMPLIES décalage et aller à l'état 21
+ AND décalage et aller à l'état 22
+ OR décalage et aller à l'état 23
+
+
+état 18
+
+ 4 stateseq: ID COLON $@1 IF option FI . SEMI_COLON stateseq
+
+ SEMI_COLON décalage et aller à l'état 24
+
+
+état 19
+
+ 8 exp: exp . OR exp
+ 9 | exp . AND exp
+ 10 | NOT exp .
+
+ $défaut réduction par utilisation de la règle 10 (exp)
+
+
+état 20
+
+ 7 exp: LEFT_PAR exp . RIGHT_PAR
+ 8 | exp . OR exp
+ 9 | exp . AND exp
+
+ AND décalage et aller à l'état 22
+ OR décalage et aller à l'état 23
+ RIGHT_PAR décalage et aller à l'état 25
+
+
+état 21
+
+ 6 option: CASE exp IMPLIES . GOTO ID option
+
+ GOTO décalage et aller à l'état 26
+
+
+état 22
+
+ 9 exp: exp AND . exp
+
+ NOT décalage et aller à l'état 13
+ LEFT_PAR décalage et aller à l'état 14
+ CASE_TRUE décalage et aller à l'état 15
+ ID décalage et aller à l'état 16
+
+ exp aller à l'état 27
+
+
+état 23
+
+ 8 exp: exp OR . exp
+
+ NOT décalage et aller à l'état 13
+ LEFT_PAR décalage et aller à l'état 14
+ CASE_TRUE décalage et aller à l'état 15
+ ID décalage et aller à l'état 16
+
+ exp aller à l'état 28
+
+
+état 24
+
+ 4 stateseq: ID COLON $@1 IF option FI SEMI_COLON . stateseq
+
+ ID décalage et aller à l'état 5
+
+ $défaut réduction par utilisation de la règle 2 (stateseq)
+
+ stateseq aller à l'état 29
+
+
+état 25
+
+ 7 exp: LEFT_PAR exp RIGHT_PAR .
+
+ $défaut réduction par utilisation de la règle 7 (exp)
+
+
+état 26
+
+ 6 option: CASE exp IMPLIES GOTO . ID option
+
+ ID décalage et aller à l'état 30
+
+
+état 27
+
+ 8 exp: exp . OR exp
+ 9 | exp . AND exp
+ 9 | exp AND exp .
+
+ $défaut réduction par utilisation de la règle 9 (exp)
+
+
+état 28
+
+ 8 exp: exp . OR exp
+ 8 | exp OR exp .
+ 9 | exp . AND exp
+
+ $défaut réduction par utilisation de la règle 8 (exp)
+
+
+état 29
+
+ 4 stateseq: ID COLON $@1 IF option FI SEMI_COLON stateseq .
+
+ $défaut réduction par utilisation de la règle 4 (stateseq)
+
+
+état 30
+
+ 6 option: CASE exp IMPLIES GOTO ID . option
+
+ CASE décalage et aller à l'état 11
+
+ $défaut réduction par utilisation de la règle 5 (option)
+
+ option aller à l'état 31
+
+
+état 31
+
+ 6 option: CASE exp IMPLIES GOTO ID option .
+
+ $défaut réduction par utilisation de la règle 6 (option)
--- /dev/null
+
+/* A Bison parser, made by GNU Bison 2.4.1. */
+
+/* Skeleton implementation for Bison's Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
+ Free Software Foundation, Inc.
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+ simplifying the original so-called "semantic" parser. */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+ infringing on user name space. This should be done even for local
+ variables, as they might otherwise be expanded by user macros.
+ There are some unavoidable exceptions within include files to
+ define necessary library symbols; they are noted "INFRINGES ON
+ USER NAME SPACE" below. */
+
+/* Identify Bison output. */
+#define YYBISON 1
+
+/* Bison version. */
+#define YYBISON_VERSION "2.4.1"
+
+/* Skeleton name. */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers. */
+#define YYPURE 0
+
+/* Push parsers. */
+#define YYPUSH 0
+
+/* Pull parsers. */
+#define YYPULL 1
+
+/* Using locations. */
+#define YYLSP_NEEDED 0
+
+
+
+/* Copy the first part of user declarations. */
+
+/* Line 189 of yacc.c */
+#line 1 "parserPromela.yacc"
+
+
+#include "automaton.h"
+#include "automatonparse_promela.h"
+#include "lex.yy.c"
+
+void yyerror(const char *s);
+
+
+
+/* Line 189 of yacc.c */
+#line 84 "y.tab.c"
+
+/* Enabling traces. */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages. */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 0
+#endif
+
+/* Enabling the token table. */
+#ifndef YYTOKEN_TABLE
+# define YYTOKEN_TABLE 0
+#endif
+
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ NEVER = 258,
+ IF = 259,
+ FI = 260,
+ IMPLIES = 261,
+ GOTO = 262,
+ AND = 263,
+ OR = 264,
+ NOT = 265,
+ LEFT_PAR = 266,
+ RIGHT_PAR = 267,
+ CASE = 268,
+ COLON = 269,
+ SEMI_COLON = 270,
+ CASE_TRUE = 271,
+ LEFT_BRACE = 272,
+ RIGHT_BRACE = 273,
+ LITT_ENT = 274,
+ LITT_CHAINE = 275,
+ LITT_REEL = 276,
+ ID = 277
+ };
+#endif
+/* Tokens. */
+#define NEVER 258
+#define IF 259
+#define FI 260
+#define IMPLIES 261
+#define GOTO 262
+#define AND 263
+#define OR 264
+#define NOT 265
+#define LEFT_PAR 266
+#define RIGHT_PAR 267
+#define CASE 268
+#define COLON 269
+#define SEMI_COLON 270
+#define CASE_TRUE 271
+#define LEFT_BRACE 272
+#define RIGHT_BRACE 273
+#define LITT_ENT 274
+#define LITT_CHAINE 275
+#define LITT_REEL 276
+#define ID 277
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 214 of yacc.c */
+#line 11 "parserPromela.yacc"
+
+ double real;
+ int integer;
+ char* string;
+ xbt_exp_label_t label;
+
+
+
+/* Line 214 of yacc.c */
+#line 173 "y.tab.c"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+/* Copy the second part of user declarations. */
+
+
+/* Line 264 of yacc.c */
+#line 185 "y.tab.c"
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#elif (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+typedef signed char yytype_int8;
+#else
+typedef short int yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+# define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+# define YYSIZE_T size_t
+# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# else
+# define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if YYENABLE_NLS
+# if ENABLE_NLS
+# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+# define YY_(msgid) dgettext ("bison-runtime", msgid)
+# endif
+# endif
+# ifndef YY_
+# define YY_(msgid) msgid
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E. */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(e) ((void) (e))
+#else
+# define YYUSE(e) /* empty */
+#endif
+
+/* Identity function, used to suppress warnings about constant conditions. */
+#ifndef lint
+# define YYID(n) (n)
+#else
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static int
+YYID (int yyi)
+#else
+static int
+YYID (yyi)
+ int yyi;
+#endif
+{
+ return yyi;
+}
+#endif
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols. */
+
+# ifdef YYSTACK_USE_ALLOCA
+# if YYSTACK_USE_ALLOCA
+# ifdef __GNUC__
+# define YYSTACK_ALLOC __builtin_alloca
+# elif defined __BUILTIN_VA_ARG_INCR
+# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+# elif defined _AIX
+# define YYSTACK_ALLOC __alloca
+# elif defined _MSC_VER
+# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+# define alloca _alloca
+# else
+# define YYSTACK_ALLOC alloca
+# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+# ifndef _STDLIB_H
+# define _STDLIB_H 1
+# endif
+# endif
+# endif
+# endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+ /* Pacify GCC's `empty if-body' warning. */
+# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
+# ifndef YYSTACK_ALLOC_MAXIMUM
+ /* The OS might guarantee only one guard page at the bottom of the stack,
+ and a page size can be as small as 4096 bytes. So we cannot safely
+ invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
+ to allow for a few compiler-allocated temporary stack slots. */
+# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+# endif
+# else
+# define YYSTACK_ALLOC YYMALLOC
+# define YYSTACK_FREE YYFREE
+# ifndef YYSTACK_ALLOC_MAXIMUM
+# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+# endif
+# if (defined __cplusplus && ! defined _STDLIB_H \
+ && ! ((defined YYMALLOC || defined malloc) \
+ && (defined YYFREE || defined free)))
+# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+# ifndef _STDLIB_H
+# define _STDLIB_H 1
+# endif
+# endif
+# ifndef YYMALLOC
+# define YYMALLOC malloc
+# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+# endif
+# endif
+# ifndef YYFREE
+# define YYFREE free
+# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+# endif
+# endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+ && (! defined __cplusplus \
+ || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member. */
+union yyalloc
+{
+ yytype_int16 yyss_alloc;
+ YYSTYPE yyvs_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next. */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+ N elements. */
+# define YYSTACK_BYTES(N) \
+ ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ + YYSTACK_GAP_MAXIMUM)
+
+/* Copy COUNT objects from FROM to TO. The source and destination do
+ not overlap. */
+# ifndef YYCOPY
+# if defined __GNUC__ && 1 < __GNUC__
+# define YYCOPY(To, From, Count) \
+ __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+# else
+# define YYCOPY(To, From, Count) \
+ do \
+ { \
+ YYSIZE_T yyi; \
+ for (yyi = 0; yyi < (Count); yyi++) \
+ (To)[yyi] = (From)[yyi]; \
+ } \
+ while (YYID (0))
+# endif
+# endif
+
+/* Relocate STACK from its old location to the new one. The
+ local variables YYSIZE and YYSTACKSIZE give the old and new number of
+ elements in the stack, and YYPTR gives the new location of the
+ stack. Advance YYPTR to a properly aligned location for the next
+ stack. */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
+ do \
+ { \
+ YYSIZE_T yynewbytes; \
+ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
+ Stack = &yyptr->Stack_alloc; \
+ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+ yyptr += yynewbytes / sizeof (*yyptr); \
+ } \
+ while (YYID (0))
+
+#endif
+
+/* YYFINAL -- State number of the termination state. */
+#define YYFINAL 4
+/* YYLAST -- Last index in YYTABLE. */
+#define YYLAST 28
+
+/* YYNTOKENS -- Number of terminals. */
+#define YYNTOKENS 23
+/* YYNNTS -- Number of nonterminals. */
+#define YYNNTS 6
+/* YYNRULES -- Number of rules. */
+#define YYNRULES 13
+/* YYNRULES -- Number of states. */
+#define YYNSTATES 32
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
+#define YYUNDEFTOK 2
+#define YYMAXUTOK 277
+
+#define YYTRANSLATE(YYX) \
+ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
+static const yytype_uint8 yytranslate[] =
+{
+ 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
+ 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ 15, 16, 17, 18, 19, 20, 21, 22
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+ YYRHS. */
+static const yytype_uint8 yyprhs[] =
+{
+ 0, 0, 3, 8, 9, 10, 19, 20, 27, 31,
+ 35, 39, 42, 44
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS. */
+static const yytype_int8 yyrhs[] =
+{
+ 24, 0, -1, 3, 17, 25, 18, -1, -1, -1,
+ 22, 14, 26, 4, 27, 5, 15, 25, -1, -1,
+ 13, 28, 6, 7, 22, 27, -1, 11, 28, 12,
+ -1, 28, 9, 28, -1, 28, 8, 28, -1, 10,
+ 28, -1, 16, -1, 22, -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
+static const yytype_uint8 yyrline[] =
+{
+ 0, 48, 48, 51, 52, 52, 55, 56, 59, 60,
+ 61, 62, 63, 64
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+ First, the terminals, then, starting at YYNTOKENS, nonterminals. */
+static const char *const yytname[] =
+{
+ "$end", "error", "$undefined", "NEVER", "IF", "FI", "IMPLIES", "GOTO",
+ "AND", "OR", "NOT", "LEFT_PAR", "RIGHT_PAR", "CASE", "COLON",
+ "SEMI_COLON", "CASE_TRUE", "LEFT_BRACE", "RIGHT_BRACE", "LITT_ENT",
+ "LITT_CHAINE", "LITT_REEL", "ID", "$accept", "automaton", "stateseq",
+ "$@1", "option", "exp", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+ token YYLEX-NUM. */
+static const yytype_uint16 yytoknum[] =
+{
+ 0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
+ 265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
+ 275, 276, 277
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
+static const yytype_uint8 yyr1[] =
+{
+ 0, 23, 24, 25, 26, 25, 27, 27, 28, 28,
+ 28, 28, 28, 28
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
+static const yytype_uint8 yyr2[] =
+{
+ 0, 2, 4, 0, 0, 8, 0, 6, 3, 3,
+ 3, 2, 1, 1
+};
+
+/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
+ STATE-NUM when YYTABLE doesn't specify something else to do. Zero
+ means the default is an error. */
+static const yytype_uint8 yydefact[] =
+{
+ 0, 0, 0, 3, 1, 0, 0, 4, 2, 0,
+ 6, 0, 0, 0, 0, 12, 13, 0, 0, 11,
+ 0, 0, 0, 0, 3, 8, 0, 10, 9, 5,
+ 6, 7
+};
+
+/* YYDEFGOTO[NTERM-NUM]. */
+static const yytype_int8 yydefgoto[] =
+{
+ -1, 2, 6, 9, 12, 17
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+ STATE-NUM. */
+#define YYPACT_NINF -16
+static const yytype_int8 yypact[] =
+{
+ 0, -15, 10, -13, -16, 2, 1, -16, -16, 16,
+ 8, -10, 17, -10, -10, -16, -16, 9, 11, -16,
+ -1, 18, -10, -10, -13, -16, 5, -16, -16, -16,
+ 8, -16
+};
+
+/* YYPGOTO[NTERM-NUM]. */
+static const yytype_int8 yypgoto[] =
+{
+ -16, -16, 4, -16, -7, -9
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
+ positive, shift that token. If negative, reduce the rule which
+ number is the opposite. If zero, do what YYDEFACT says.
+ If YYTABLE_NINF, syntax error. */
+#define YYTABLE_NINF -1
+static const yytype_uint8 yytable[] =
+{
+ 13, 14, 3, 1, 19, 20, 15, 22, 23, 5,
+ 4, 25, 16, 27, 28, 21, 7, 22, 23, 8,
+ 10, 11, 18, 31, 0, 26, 24, 30, 29
+};
+
+static const yytype_int8 yycheck[] =
+{
+ 10, 11, 17, 3, 13, 14, 16, 8, 9, 22,
+ 0, 12, 22, 22, 23, 6, 14, 8, 9, 18,
+ 4, 13, 5, 30, -1, 7, 15, 22, 24
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+ symbol of state STATE-NUM. */
+static const yytype_uint8 yystos[] =
+{
+ 0, 3, 24, 17, 0, 22, 25, 14, 18, 26,
+ 4, 13, 27, 10, 11, 16, 22, 28, 5, 28,
+ 28, 6, 8, 9, 15, 12, 7, 28, 28, 25,
+ 22, 27
+};
+
+#define yyerrok (yyerrstatus = 0)
+#define yyclearin (yychar = YYEMPTY)
+#define YYEMPTY (-2)
+#define YYEOF 0
+
+#define YYACCEPT goto yyacceptlab
+#define YYABORT goto yyabortlab
+#define YYERROR goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror. This remains here temporarily
+ to ease the transition to the new meaning of YYERROR, for GCC.
+ Once GCC version 2 has supplanted version 1, this can go. */
+
+#define YYFAIL goto yyerrlab
+
+#define YYRECOVERING() (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value) \
+do \
+ if (yychar == YYEMPTY && yylen == 1) \
+ { \
+ yychar = (Token); \
+ yylval = (Value); \
+ yytoken = YYTRANSLATE (yychar); \
+ YYPOPSTACK (1); \
+ goto yybackup; \
+ } \
+ else \
+ { \
+ yyerror (YY_("syntax error: cannot back up")); \
+ YYERROR; \
+ } \
+while (YYID (0))
+
+
+#define YYTERROR 1
+#define YYERRCODE 256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+ If N is 0, then set CURRENT to the empty location which ends
+ the previous symbol: RHS[0] (always defined). */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N) \
+ do \
+ if (YYID (N)) \
+ { \
+ (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
+ (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
+ (Current).last_line = YYRHSLOC (Rhs, N).last_line; \
+ (Current).last_column = YYRHSLOC (Rhs, N).last_column; \
+ } \
+ else \
+ { \
+ (Current).first_line = (Current).last_line = \
+ YYRHSLOC (Rhs, 0).last_line; \
+ (Current).first_column = (Current).last_column = \
+ YYRHSLOC (Rhs, 0).last_column; \
+ } \
+ while (YYID (0))
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+ This macro was not mandated originally: define only if we know
+ we won't break user code: when these are the locations we know. */
+
+#ifndef YY_LOCATION_PRINT
+# if YYLTYPE_IS_TRIVIAL
+# define YY_LOCATION_PRINT(File, Loc) \
+ fprintf (File, "%d.%d-%d.%d", \
+ (Loc).first_line, (Loc).first_column, \
+ (Loc).last_line, (Loc).last_column)
+# else
+# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments. */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (YYLEX_PARAM)
+#else
+# define YYLEX yylex ()
+#endif
+
+/* Enable debugging if requested. */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+# define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args) \
+do { \
+ if (yydebug) \
+ YYFPRINTF Args; \
+} while (YYID (0))
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
+do { \
+ if (yydebug) \
+ { \
+ YYFPRINTF (stderr, "%s ", Title); \
+ yy_symbol_print (stderr, \
+ Type, Value); \
+ YYFPRINTF (stderr, "\n"); \
+ } \
+} while (YYID (0))
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT. |
+`--------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
+#else
+static void
+yy_symbol_value_print (yyoutput, yytype, yyvaluep)
+ FILE *yyoutput;
+ int yytype;
+ YYSTYPE const * const yyvaluep;
+#endif
+{
+ if (!yyvaluep)
+ return;
+# ifdef YYPRINT
+ if (yytype < YYNTOKENS)
+ YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# else
+ YYUSE (yyoutput);
+# endif
+ switch (yytype)
+ {
+ default:
+ break;
+ }
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT. |
+`--------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
+#else
+static void
+yy_symbol_print (yyoutput, yytype, yyvaluep)
+ FILE *yyoutput;
+ int yytype;
+ YYSTYPE const * const yyvaluep;
+#endif
+{
+ if (yytype < YYNTOKENS)
+ YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+ else
+ YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+ yy_symbol_value_print (yyoutput, yytype, yyvaluep);
+ YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included). |
+`------------------------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+#else
+static void
+yy_stack_print (yybottom, yytop)
+ yytype_int16 *yybottom;
+ yytype_int16 *yytop;
+#endif
+{
+ YYFPRINTF (stderr, "Stack now");
+ for (; yybottom <= yytop; yybottom++)
+ {
+ int yybot = *yybottom;
+ YYFPRINTF (stderr, " %d", yybot);
+ }
+ YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top) \
+do { \
+ if (yydebug) \
+ yy_stack_print ((Bottom), (Top)); \
+} while (YYID (0))
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced. |
+`------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static void
+yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
+#else
+static void
+yy_reduce_print (yyvsp, yyrule)
+ YYSTYPE *yyvsp;
+ int yyrule;
+#endif
+{
+ int yynrhs = yyr2[yyrule];
+ int yyi;
+ unsigned long int yylno = yyrline[yyrule];
+ YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+ yyrule - 1, yylno);
+ /* The symbols being reduced. */
+ for (yyi = 0; yyi < yynrhs; yyi++)
+ {
+ YYFPRINTF (stderr, " $%d = ", yyi + 1);
+ yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
+ &(yyvsp[(yyi + 1) - (yynrhs)])
+ );
+ YYFPRINTF (stderr, "\n");
+ }
+}
+
+# define YY_REDUCE_PRINT(Rule) \
+do { \
+ if (yydebug) \
+ yy_reduce_print (yyvsp, Rule); \
+} while (YYID (0))
+
+/* Nonzero means print parse trace. It is left uninitialized so that
+ multiple parsers can coexist. */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks. */
+#ifndef YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+ if the built-in stack extension method is used).
+
+ Do not make this value too large; the results are undefined if
+ YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+ evaluated with infinite-precision integer arithmetic. */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+\f
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+# if defined __GLIBC__ && defined _STRING_H
+# define yystrlen strlen
+# else
+/* Return the length of YYSTR. */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static YYSIZE_T
+yystrlen (const char *yystr)
+#else
+static YYSIZE_T
+yystrlen (yystr)
+ const char *yystr;
+#endif
+{
+ YYSIZE_T yylen;
+ for (yylen = 0; yystr[yylen]; yylen++)
+ continue;
+ return yylen;
+}
+# endif
+# endif
+
+# ifndef yystpcpy
+# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+# define yystpcpy stpcpy
+# else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+ YYDEST. */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+#else
+static char *
+yystpcpy (yydest, yysrc)
+ char *yydest;
+ const char *yysrc;
+#endif
+{
+ char *yyd = yydest;
+ const char *yys = yysrc;
+
+ while ((*yyd++ = *yys++) != '\0')
+ continue;
+
+ return yyd - 1;
+}
+# endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+ quotes and backslashes, so that it's suitable for yyerror. The
+ heuristic is that double-quoting is unnecessary unless the string
+ contains an apostrophe, a comma, or backslash (other than
+ backslash-backslash). YYSTR is taken from yytname. If YYRES is
+ null, do not copy; instead, return the length of what the result
+ would have been. */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+ if (*yystr == '"')
+ {
+ YYSIZE_T yyn = 0;
+ char const *yyp = yystr;
+
+ for (;;)
+ switch (*++yyp)
+ {
+ case '\'':
+ case ',':
+ goto do_not_strip_quotes;
+
+ case '\\':
+ if (*++yyp != '\\')
+ goto do_not_strip_quotes;
+ /* Fall through. */
+ default:
+ if (yyres)
+ yyres[yyn] = *yyp;
+ yyn++;
+ break;
+
+ case '"':
+ if (yyres)
+ yyres[yyn] = '\0';
+ return yyn;
+ }
+ do_not_strip_quotes: ;
+ }
+
+ if (! yyres)
+ return yystrlen (yystr);
+
+ return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into YYRESULT an error message about the unexpected token
+ YYCHAR while in state YYSTATE. Return the number of bytes copied,
+ including the terminating null byte. If YYRESULT is null, do not
+ copy anything; just return the number of bytes that would be
+ copied. As a special case, return 0 if an ordinary "syntax error"
+ message will do. Return YYSIZE_MAXIMUM if overflow occurs during
+ size calculation. */
+static YYSIZE_T
+yysyntax_error (char *yyresult, int yystate, int yychar)
+{
+ int yyn = yypact[yystate];
+
+ if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
+ return 0;
+ else
+ {
+ int yytype = YYTRANSLATE (yychar);
+ YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
+ YYSIZE_T yysize = yysize0;
+ YYSIZE_T yysize1;
+ int yysize_overflow = 0;
+ enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+ char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+ int yyx;
+
+# if 0
+ /* This is so xgettext sees the translatable formats that are
+ constructed on the fly. */
+ YY_("syntax error, unexpected %s");
+ YY_("syntax error, unexpected %s, expecting %s");
+ YY_("syntax error, unexpected %s, expecting %s or %s");
+ YY_("syntax error, unexpected %s, expecting %s or %s or %s");
+ YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
+# endif
+ char *yyfmt;
+ char const *yyf;
+ static char const yyunexpected[] = "syntax error, unexpected %s";
+ static char const yyexpecting[] = ", expecting %s";
+ static char const yyor[] = " or %s";
+ char yyformat[sizeof yyunexpected
+ + sizeof yyexpecting - 1
+ + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
+ * (sizeof yyor - 1))];
+ char const *yyprefix = yyexpecting;
+
+ /* Start YYX at -YYN if negative to avoid negative indexes in
+ YYCHECK. */
+ int yyxbegin = yyn < 0 ? -yyn : 0;
+
+ /* Stay within bounds of both yycheck and yytname. */
+ int yychecklim = YYLAST - yyn + 1;
+ int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+ int yycount = 1;
+
+ yyarg[0] = yytname[yytype];
+ yyfmt = yystpcpy (yyformat, yyunexpected);
+
+ for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+ if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
+ {
+ if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+ {
+ yycount = 1;
+ yysize = yysize0;
+ yyformat[sizeof yyunexpected - 1] = '\0';
+ break;
+ }
+ yyarg[yycount++] = yytname[yyx];
+ yysize1 = yysize + yytnamerr (0, yytname[yyx]);
+ yysize_overflow |= (yysize1 < yysize);
+ yysize = yysize1;
+ yyfmt = yystpcpy (yyfmt, yyprefix);
+ yyprefix = yyor;
+ }
+
+ yyf = YY_(yyformat);
+ yysize1 = yysize + yystrlen (yyf);
+ yysize_overflow |= (yysize1 < yysize);
+ yysize = yysize1;
+
+ if (yysize_overflow)
+ return YYSIZE_MAXIMUM;
+
+ if (yyresult)
+ {
+ /* Avoid sprintf, as that infringes on the user's name space.
+ Don't have undefined behavior even if the translation
+ produced a string with the wrong number of "%s"s. */
+ char *yyp = yyresult;
+ int yyi = 0;
+ while ((*yyp = *yyf) != '\0')
+ {
+ if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
+ {
+ yyp += yytnamerr (yyp, yyarg[yyi++]);
+ yyf += 2;
+ }
+ else
+ {
+ yyp++;
+ yyf++;
+ }
+ }
+ }
+ return yysize;
+ }
+}
+#endif /* YYERROR_VERBOSE */
+\f
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol. |
+`-----------------------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep)
+ const char *yymsg;
+ int yytype;
+ YYSTYPE *yyvaluep;
+#endif
+{
+ YYUSE (yyvaluep);
+
+ if (!yymsg)
+ yymsg = "Deleting";
+ YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+ switch (yytype)
+ {
+
+ default:
+ break;
+ }
+}
+
+/* Prevent warnings from -Wmissing-prototypes. */
+#ifdef YYPARSE_PARAM
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void *YYPARSE_PARAM);
+#else
+int yyparse ();
+#endif
+#else /* ! YYPARSE_PARAM */
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+/* The lookahead symbol. */
+int yychar;
+
+/* The semantic value of the lookahead symbol. */
+YYSTYPE yylval;
+
+/* Number of syntax errors so far. */
+int yynerrs;
+
+
+
+/*-------------------------.
+| yyparse or yypush_parse. |
+`-------------------------*/
+
+#ifdef YYPARSE_PARAM
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void *YYPARSE_PARAM)
+#else
+int
+yyparse (YYPARSE_PARAM)
+ void *YYPARSE_PARAM;
+#endif
+#else /* ! YYPARSE_PARAM */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+ || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void)
+#else
+int
+yyparse ()
+
+#endif
+#endif
+{
+
+
+ int yystate;
+ /* Number of tokens to shift before error messages enabled. */
+ int yyerrstatus;
+
+ /* The stacks and their tools:
+ `yyss': related to states.
+ `yyvs': related to semantic values.
+
+ Refer to the stacks thru separate pointers, to allow yyoverflow
+ to reallocate them elsewhere. */
+
+ /* The state stack. */
+ yytype_int16 yyssa[YYINITDEPTH];
+ yytype_int16 *yyss;
+ yytype_int16 *yyssp;
+
+ /* The semantic value stack. */
+ YYSTYPE yyvsa[YYINITDEPTH];
+ YYSTYPE *yyvs;
+ YYSTYPE *yyvsp;
+
+ YYSIZE_T yystacksize;
+
+ int yyn;
+ int yyresult;
+ /* Lookahead token as an internal (translated) token number. */
+ int yytoken;
+ /* The variables used to return semantic value and location from the
+ action routines. */
+ YYSTYPE yyval;
+
+#if YYERROR_VERBOSE
+ /* Buffer for error messages, and its allocated size. */
+ char yymsgbuf[128];
+ char *yymsg = yymsgbuf;
+ YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
+
+ /* The number of symbols on the RHS of the reduced rule.
+ Keep to zero when no symbol should be popped. */
+ int yylen = 0;
+
+ yytoken = 0;
+ yyss = yyssa;
+ yyvs = yyvsa;
+ yystacksize = YYINITDEPTH;
+
+ YYDPRINTF ((stderr, "Starting parse\n"));
+
+ yystate = 0;
+ yyerrstatus = 0;
+ yynerrs = 0;
+ yychar = YYEMPTY; /* Cause a token to be read. */
+
+ /* Initialize stack pointers.
+ Waste one element of value and location stack
+ so that they stay on the same level as the state stack.
+ The wasted elements are never initialized. */
+ yyssp = yyss;
+ yyvsp = yyvs;
+
+ goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate. |
+`------------------------------------------------------------*/
+ yynewstate:
+ /* In all cases, when you get here, the value and location stacks
+ have just been pushed. So pushing a state here evens the stacks. */
+ yyssp++;
+
+ yysetstate:
+ *yyssp = yystate;
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ {
+ /* Get the current used size of the three stacks, in elements. */
+ YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+ {
+ /* Give user a chance to reallocate the stack. Use copies of
+ these so that the &'s don't force the real ones into
+ memory. */
+ YYSTYPE *yyvs1 = yyvs;
+ yytype_int16 *yyss1 = yyss;
+
+ /* Each stack pointer address is followed by the size of the
+ data in use in that stack, in bytes. This used to be a
+ conditional around just the two extra args, but that might
+ be undefined if yyoverflow is a macro. */
+ yyoverflow (YY_("memory exhausted"),
+ &yyss1, yysize * sizeof (*yyssp),
+ &yyvs1, yysize * sizeof (*yyvsp),
+ &yystacksize);
+
+ yyss = yyss1;
+ yyvs = yyvs1;
+ }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+ goto yyexhaustedlab;
+# else
+ /* Extend the stack our own way. */
+ if (YYMAXDEPTH <= yystacksize)
+ goto yyexhaustedlab;
+ yystacksize *= 2;
+ if (YYMAXDEPTH < yystacksize)
+ yystacksize = YYMAXDEPTH;
+
+ {
+ yytype_int16 *yyss1 = yyss;
+ union yyalloc *yyptr =
+ (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+ if (! yyptr)
+ goto yyexhaustedlab;
+ YYSTACK_RELOCATE (yyss_alloc, yyss);
+ YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+# undef YYSTACK_RELOCATE
+ if (yyss1 != yyssa)
+ YYSTACK_FREE (yyss1);
+ }
+# endif
+#endif /* no yyoverflow */
+
+ yyssp = yyss + yysize - 1;
+ yyvsp = yyvs + yysize - 1;
+
+ YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+ (unsigned long int) yystacksize));
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ YYABORT;
+ }
+
+ YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+ if (yystate == YYFINAL)
+ YYACCEPT;
+
+ goto yybackup;
+
+/*-----------.
+| yybackup. |
+`-----------*/
+yybackup:
+
+ /* Do appropriate processing given the current state. Read a
+ lookahead token if we need one and don't already have one. */
+
+ /* First try to decide what to do without reference to lookahead token. */
+ yyn = yypact[yystate];
+ if (yyn == YYPACT_NINF)
+ goto yydefault;
+
+ /* Not known => get a lookahead token if don't already have one. */
+
+ /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
+ if (yychar == YYEMPTY)
+ {
+ YYDPRINTF ((stderr, "Reading a token: "));
+ yychar = YYLEX;
+ }
+
+ if (yychar <= YYEOF)
+ {
+ yychar = yytoken = YYEOF;
+ YYDPRINTF ((stderr, "Now at end of input.\n"));
+ }
+ else
+ {
+ yytoken = YYTRANSLATE (yychar);
+ YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+ }
+
+ /* If the proper action on seeing token YYTOKEN is to reduce or to
+ detect an error, take that action. */
+ yyn += yytoken;
+ if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+ goto yydefault;
+ yyn = yytable[yyn];
+ if (yyn <= 0)
+ {
+ if (yyn == 0 || yyn == YYTABLE_NINF)
+ goto yyerrlab;
+ yyn = -yyn;
+ goto yyreduce;
+ }
+
+ /* Count tokens shifted since error; after three, turn off error
+ status. */
+ if (yyerrstatus)
+ yyerrstatus--;
+
+ /* Shift the lookahead token. */
+ YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+ /* Discard the shifted token. */
+ yychar = YYEMPTY;
+
+ yystate = yyn;
+ *++yyvsp = yylval;
+
+ goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state. |
+`-----------------------------------------------------------*/
+yydefault:
+ yyn = yydefact[yystate];
+ if (yyn == 0)
+ goto yyerrlab;
+ goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction. |
+`-----------------------------*/
+yyreduce:
+ /* yyn is the number of a rule to reduce with. */
+ yylen = yyr2[yyn];
+
+ /* If YYLEN is nonzero, implement the default value of the action:
+ `$$ = $1'.
+
+ Otherwise, the following line sets YYVAL to garbage.
+ This behavior is undocumented and Bison
+ users should not rely upon it. Assigning to YYVAL
+ unconditionally makes the parser a bit smaller, and it avoids a
+ GCC warning that YYVAL may be used uninitialized. */
+ yyval = yyvsp[1-yylen];
+
+
+ YY_REDUCE_PRINT (yyn);
+ switch (yyn)
+ {
+ case 4:
+
+/* Line 1455 of yacc.c */
+#line 52 "parserPromela.yacc"
+ { new_state((yyvsp[(1) - (2)].string), 1);}
+ break;
+
+ case 7:
+
+/* Line 1455 of yacc.c */
+#line 56 "parserPromela.yacc"
+ { new_transition((yyvsp[(5) - (6)].string), (yyvsp[(2) - (6)].label));}
+ break;
+
+ case 8:
+
+/* Line 1455 of yacc.c */
+#line 59 "parserPromela.yacc"
+ { (yyval.label) = (yyvsp[(2) - (3)].label); }
+ break;
+
+ case 9:
+
+/* Line 1455 of yacc.c */
+#line 60 "parserPromela.yacc"
+ { (yyval.label) = new_label(0, (yyvsp[(1) - (3)].label), (yyvsp[(3) - (3)].label)); }
+ break;
+
+ case 10:
+
+/* Line 1455 of yacc.c */
+#line 61 "parserPromela.yacc"
+ { (yyval.label) = new_label(1, (yyvsp[(1) - (3)].label), (yyvsp[(3) - (3)].label)); }
+ break;
+
+ case 11:
+
+/* Line 1455 of yacc.c */
+#line 62 "parserPromela.yacc"
+ { (yyval.label) = new_label(2, (yyvsp[(2) - (2)].label)); }
+ break;
+
+ case 12:
+
+/* Line 1455 of yacc.c */
+#line 63 "parserPromela.yacc"
+ { (yyval.label) = new_label(4); }
+ break;
+
+ case 13:
+
+/* Line 1455 of yacc.c */
+#line 64 "parserPromela.yacc"
+ { (yyval.label) = new_label(3, (yyvsp[(1) - (1)].string)); }
+ break;
+
+
+
+/* Line 1455 of yacc.c */
+#line 1446 "y.tab.c"
+ default: break;
+ }
+ YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+ YYPOPSTACK (yylen);
+ yylen = 0;
+ YY_STACK_PRINT (yyss, yyssp);
+
+ *++yyvsp = yyval;
+
+ /* Now `shift' the result of the reduction. Determine what state
+ that goes to, based on the state we popped back to and the rule
+ number reduced by. */
+
+ yyn = yyr1[yyn];
+
+ yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+ if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+ yystate = yytable[yystate];
+ else
+ yystate = yydefgoto[yyn - YYNTOKENS];
+
+ goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+ /* If not already recovering from an error, report this error. */
+ if (!yyerrstatus)
+ {
+ ++yynerrs;
+#if ! YYERROR_VERBOSE
+ yyerror (YY_("syntax error"));
+#else
+ {
+ YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
+ if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
+ {
+ YYSIZE_T yyalloc = 2 * yysize;
+ if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
+ yyalloc = YYSTACK_ALLOC_MAXIMUM;
+ if (yymsg != yymsgbuf)
+ YYSTACK_FREE (yymsg);
+ yymsg = (char *) YYSTACK_ALLOC (yyalloc);
+ if (yymsg)
+ yymsg_alloc = yyalloc;
+ else
+ {
+ yymsg = yymsgbuf;
+ yymsg_alloc = sizeof yymsgbuf;
+ }
+ }
+
+ if (0 < yysize && yysize <= yymsg_alloc)
+ {
+ (void) yysyntax_error (yymsg, yystate, yychar);
+ yyerror (yymsg);
+ }
+ else
+ {
+ yyerror (YY_("syntax error"));
+ if (yysize != 0)
+ goto yyexhaustedlab;
+ }
+ }
+#endif
+ }
+
+
+
+ if (yyerrstatus == 3)
+ {
+ /* If just tried and failed to reuse lookahead token after an
+ error, discard it. */
+
+ if (yychar <= YYEOF)
+ {
+ /* Return failure if at end of input. */
+ if (yychar == YYEOF)
+ YYABORT;
+ }
+ else
+ {
+ yydestruct ("Error: discarding",
+ yytoken, &yylval);
+ yychar = YYEMPTY;
+ }
+ }
+
+ /* Else will try to reuse lookahead token after shifting the error
+ token. */
+ goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR. |
+`---------------------------------------------------*/
+yyerrorlab:
+
+ /* Pacify compilers like GCC when the user code never invokes
+ YYERROR and the label yyerrorlab therefore never appears in user
+ code. */
+ if (/*CONSTCOND*/ 0)
+ goto yyerrorlab;
+
+ /* Do not reclaim the symbols of the rule which action triggered
+ this YYERROR. */
+ YYPOPSTACK (yylen);
+ yylen = 0;
+ YY_STACK_PRINT (yyss, yyssp);
+ yystate = *yyssp;
+ goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR. |
+`-------------------------------------------------------------*/
+yyerrlab1:
+ yyerrstatus = 3; /* Each real token shifted decrements this. */
+
+ for (;;)
+ {
+ yyn = yypact[yystate];
+ if (yyn != YYPACT_NINF)
+ {
+ yyn += YYTERROR;
+ if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+ {
+ yyn = yytable[yyn];
+ if (0 < yyn)
+ break;
+ }
+ }
+
+ /* Pop the current state because it cannot handle the error token. */
+ if (yyssp == yyss)
+ YYABORT;
+
+
+ yydestruct ("Error: popping",
+ yystos[yystate], yyvsp);
+ YYPOPSTACK (1);
+ yystate = *yyssp;
+ YY_STACK_PRINT (yyss, yyssp);
+ }
+
+ *++yyvsp = yylval;
+
+
+ /* Shift the error token. */
+ YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+ yystate = yyn;
+ goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here. |
+`-------------------------------------*/
+yyacceptlab:
+ yyresult = 0;
+ goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here. |
+`-----------------------------------*/
+yyabortlab:
+ yyresult = 1;
+ goto yyreturn;
+
+#if !defined(yyoverflow) || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here. |
+`-------------------------------------------------*/
+yyexhaustedlab:
+ yyerror (YY_("memory exhausted"));
+ yyresult = 2;
+ /* Fall through. */
+#endif
+
+yyreturn:
+ if (yychar != YYEMPTY)
+ yydestruct ("Cleanup: discarding lookahead",
+ yytoken, &yylval);
+ /* Do not reclaim the symbols of the rule which action triggered
+ this YYABORT or YYACCEPT. */
+ YYPOPSTACK (yylen);
+ YY_STACK_PRINT (yyss, yyssp);
+ while (yyssp != yyss)
+ {
+ yydestruct ("Cleanup: popping",
+ yystos[*yyssp], yyvsp);
+ YYPOPSTACK (1);
+ }
+#ifndef yyoverflow
+ if (yyss != yyssa)
+ YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+ if (yymsg != yymsgbuf)
+ YYSTACK_FREE (yymsg);
+#endif
+ /* Make sure YYID is used. */
+ return YYID (yyresult);
+}
+
+
+
+/* Line 1675 of yacc.c */
+#line 67 "parserPromela.yacc"
+
+
+
+
+void yyerror(const char *s){
+ fprintf (stderr, "%s\n", s);
+}
+
+
+
+
--- /dev/null
+
+/* A Bison parser, made by GNU Bison 2.4.1. */
+
+/* Skeleton interface for Bison's Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
+ Free Software Foundation, Inc.
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ NEVER = 258,
+ IF = 259,
+ FI = 260,
+ IMPLIES = 261,
+ GOTO = 262,
+ AND = 263,
+ OR = 264,
+ NOT = 265,
+ LEFT_PAR = 266,
+ RIGHT_PAR = 267,
+ CASE = 268,
+ COLON = 269,
+ SEMI_COLON = 270,
+ CASE_TRUE = 271,
+ LEFT_BRACE = 272,
+ RIGHT_BRACE = 273,
+ LITT_ENT = 274,
+ LITT_CHAINE = 275,
+ LITT_REEL = 276,
+ ID = 277
+ };
+#endif
+/* Tokens. */
+#define NEVER 258
+#define IF 259
+#define FI 260
+#define IMPLIES 261
+#define GOTO 262
+#define AND 263
+#define OR 264
+#define NOT 265
+#define LEFT_PAR 266
+#define RIGHT_PAR 267
+#define CASE 268
+#define COLON 269
+#define SEMI_COLON 270
+#define CASE_TRUE 271
+#define LEFT_BRACE 272
+#define RIGHT_BRACE 273
+#define LITT_ENT 274
+#define LITT_CHAINE 275
+#define LITT_REEL 276
+#define ID 277
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 1676 of yacc.c */
+#line 11 "parserPromela.yacc"
+
+ double real;
+ int integer;
+ char* string;
+ xbt_exp_label_t label;
+
+
+
+/* Line 1676 of yacc.c */
+#line 105 "y.tab.h"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+extern YYSTYPE yylval;
+
+
#include "xbt.h"
XBT_PUBLIC(void) MC_assert(int);
+XBT_PUBLIC(void) MC_assert_stateful(int);
+XBT_PUBLIC(void) MC_assert_pair_stateful(int);
+XBT_PUBLIC(void) MC_assert_pair_stateless(int);
XBT_PUBLIC(int) MC_random(int min, int max);
#include "xbt.h"
#include "msg/datatypes.h"
+#include "xbt/automaton.h"
+
SG_BEGIN_DECL()
XBT_PUBLIC(MSG_error_t) MSG_set_channel_number(int number);
XBT_PUBLIC(int) MSG_get_channel_number(void);
XBT_PUBLIC(MSG_error_t) MSG_main(void);
+XBT_PUBLIC(MSG_error_t) MSG_main_stateful(void);
+XBT_PUBLIC(MSG_error_t) MSG_main_liveness_stateful(xbt_automaton_t a);
+XBT_PUBLIC(MSG_error_t) MSG_main_liveness_stateless(xbt_automaton_t a, char *prgm);
XBT_PUBLIC(MSG_error_t) MSG_clean(void);
XBT_PUBLIC(void) MSG_function_register(const char *name,
xbt_main_func_t code);
--- /dev/null
+#ifndef _XBT_AUTOMATON_H
+#define _XBT_AUTOMATON_H
+
+#include <stdlib.h>
+#include <string.h>
+#include <xbt/dynar.h>
+#include <xbt/sysdep.h>
+#include <xbt/graph.h>
+
+SG_BEGIN_DECL()
+
+typedef struct xbt_state {
+ char* id;
+ int type; /* -1 = init, 0 = inter, 1 = final */
+ xbt_dynar_t in;
+ xbt_dynar_t out;
+} s_xbt_state;
+
+typedef struct xbt_state* xbt_state_t;
+
+typedef struct xbt_automaton {
+ xbt_dynar_t propositional_symbols;
+ xbt_dynar_t transitions;
+ xbt_dynar_t states;
+ xbt_state_t current_state;
+} s_xbt_automaton;
+
+typedef struct xbt_automaton* xbt_automaton_t;
+
+typedef struct xbt_exp_label{
+ enum{or=0, and=1, not=2, predicat=3, one=4} type;
+ union{
+ struct{
+ struct xbt_exp_label* left_exp;
+ struct xbt_exp_label* right_exp;
+ }or_and;
+ struct xbt_exp_label* exp_not;
+ char* predicat;
+ }u;
+} s_xbt_exp_label;
+
+typedef struct xbt_exp_label* xbt_exp_label_t;
+
+
+typedef struct xbt_transition {
+ xbt_state_t src;
+ xbt_state_t dst;
+ xbt_exp_label_t label;
+} s_xbt_transition;
+
+typedef struct xbt_transition* xbt_transition_t;
+
+
+typedef struct xbt_propositional_symbol{
+ char* pred;
+ void* function;
+} s_xbt_propositional_symbol;
+
+typedef struct xbt_propositional_symbol* xbt_propositional_symbol_t;
+
+
+XBT_PUBLIC(xbt_automaton_t) xbt_automaton_new_automaton(void);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_new_state(xbt_automaton_t a, int type, char* id);
+
+XBT_PUBLIC(xbt_transition_t) xbt_automaton_new_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst, xbt_exp_label_t label);
+
+XBT_PUBLIC(xbt_exp_label_t) xbt_automaton_new_label(int type, ...);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_get_states(xbt_automaton_t a);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_get_transitions(xbt_automaton_t a);
+
+XBT_PUBLIC(xbt_transition_t) xbt_automaton_get_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst);
+
+XBT_PUBLIC(void) xbt_automaton_free_automaton(xbt_automaton_t a, void_f_pvoid_t transition_free_function);
+
+XBT_PUBLIC(void) xbt_automaton_free_state(xbt_automaton_t a, xbt_state_t s, void_f_pvoid_t transition_free_function);
+
+XBT_PUBLIC(void) xbt_automaton_free_transition(xbt_automaton_t a, xbt_transition_t t, void_f_pvoid_t transition_free_function);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_transition_get_source(xbt_transition_t t);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_transition_get_destination(xbt_transition_t t);
+
+XBT_PUBLIC(void) xbt_automaton_transition_set_source(xbt_transition_t t, xbt_state_t src);
+
+XBT_PUBLIC(void) xbt_automaton_transition_set_destination(xbt_transition_t t, xbt_state_t dst);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_state_get_out_transitions(xbt_state_t s);
+
+XBT_PUBLIC(xbt_dynar_t) xbt_automaton_state_get_in_transitions(xbt_state_t s);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_state_exists(xbt_automaton_t a, char *id);
+
+XBT_PUBLIC(void) xbt_automaton_display(xbt_automaton_t a);
+
+XBT_PUBLIC(void) xbt_automaton_display_exp(xbt_exp_label_t l);
+
+XBT_PUBLIC(xbt_propositional_symbol_t) xbt_new_propositional_symbol(xbt_automaton_t a, const char* id, void* fct);
+
+XBT_PUBLIC(xbt_state_t) xbt_automaton_get_current_state(xbt_automaton_t a);
+
+XBT_PUBLIC(int) automaton_state_compare(xbt_state_t s1, xbt_state_t s2);
+
+XBT_PUBLIC(int) propositional_symbols_compare_value(xbt_dynar_t s1, xbt_dynar_t s2);
+
+XBT_PUBLIC(int) automaton_transition_compare(const void *t1, const void *t2);
+
+XBT_PUBLIC(int) automaton_label_transition_compare(xbt_exp_label_t l1, xbt_exp_label_t l2);
+
+
+SG_END_DECL()
+
+#endif
--- /dev/null
+#ifndef _XBT_AUTOMATONPARSE_PROMELA_H
+#define _XBT_AUTOMATONPARSE_PROMELA_H
+
+#include <stdlib.h>
+#include <string.h>
+#include "xbt/automaton.h"
+
+xbt_automaton_t automaton;
+
+SG_BEGIN_DECL()
+
+XBT_PUBLIC(void) init(void);
+
+XBT_PUBLIC(void) new_state(char* id, int src);
+
+XBT_PUBLIC(void) new_transition(char* id, xbt_exp_label_t label);
+
+XBT_PUBLIC(xbt_exp_label_t) new_label(int type, ...);
+
+XBT_PUBLIC(xbt_automaton_t) get_automaton(void);
+
+XBT_PUBLIC(void) display_automaton(void);
+
+SG_END_DECL()
+
+#endif
extern void *mmalloc_findbase(int size);
+extern int mmalloc_compare_heap(void *h1, void *h2);
+
/* To change the heap used when using the legacy version malloc/free/realloc and such */
void mmalloc_set_current_heap(void *new_heap);
void *mmalloc_get_current_heap(void);
#include "mc/datatypes.h"
#include "simix/datatypes.h"
#include "gras_config.h" /* Definition of HAVE_MC */
+#include "xbt/automaton.h"
#ifdef HAVE_MC
extern int _surf_do_model_check;
SG_BEGIN_DECL()
/********************************* Global *************************************/
-XBT_PUBLIC(void) MC_init(void);
+XBT_PUBLIC(void) MC_init_safety_stateless(void);
+XBT_PUBLIC(void) MC_init_safety_stateful(void);
+XBT_PUBLIC(void) MC_init_liveness_stateful(xbt_automaton_t a);
+XBT_PUBLIC(void) MC_init_liveness_stateless(xbt_automaton_t a, char *prgm);
XBT_PUBLIC(void) MC_exit(void);
+XBT_PUBLIC(void) MC_exit_liveness(void);
XBT_PUBLIC(void) MC_assert(int);
+XBT_PUBLIC(void) MC_assert_stateful(int);
+XBT_PUBLIC(void) MC_assert_pair_stateful(int);
+XBT_PUBLIC(void) MC_assert_pair_stateless(int);
XBT_PUBLIC(void) MC_modelcheck(void);
+XBT_PUBLIC(void) MC_modelcheck_stateful(void);
+XBT_PUBLIC(void) MC_modelcheck_liveness_stateful(xbt_automaton_t a);
+XBT_PUBLIC(void) MC_modelcheck_liveness_stateless(xbt_automaton_t a, char *prgm);
XBT_PUBLIC(int) MC_random(int, int);
XBT_PUBLIC(void) MC_process_clock_add(smx_process_t, double);
XBT_PUBLIC(double) MC_process_clock_get(smx_process_t);
#include <libgen.h>
#include "private.h"
-static mc_mem_region_t MC_region_new(void *start_addr, size_t size);
+
+XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_checkpoint, mc,
+ "Logging specific to mc_checkpoint");
+
+static mc_mem_region_t MC_region_new(int type, void *start_addr, size_t size);
static void MC_region_restore(mc_mem_region_t reg);
static void MC_region_destroy(mc_mem_region_t reg);
-static void MC_snapshot_add_region(mc_snapshot_t snapshot, void *start_addr, size_t size);
+static void MC_snapshot_add_region(mc_snapshot_t snapshot, int type, void *start_addr, size_t size);
-static mc_mem_region_t MC_region_new(void *start_addr, size_t size)
+static mc_mem_region_t MC_region_new(int type, void *start_addr, size_t size)
{
mc_mem_region_t new_reg = xbt_new0(s_mc_mem_region_t, 1);
+ new_reg->type = type;
new_reg->start_addr = start_addr;
new_reg->size = size;
new_reg->data = xbt_malloc0(size);
+ XBT_DEBUG("New reg data %p, start_addr %p", new_reg->data, start_addr);
memcpy(new_reg->data, start_addr, size);
+
return new_reg;
}
{
/*FIXME: check if start_addr is still mapped, if it is not, then map it
before copying the data */
- memcpy(reg->start_addr, reg->data, reg->size);
+ if(reg->type == 3){
+ memory_map_t maps = get_memory_map();
+ MC_UNSET_RAW_MEM;
+ unsigned int i=0;
+ s_map_region r;
+ while(i < maps->mapsize){
+ r = maps->regions[i];
+ if (maps->regions[i].pathname != NULL){
+ if (!memcmp(maps->regions[i].pathname, "[stack]", 7)){
+ size_t diff = (char*)reg->start_addr - (char*)r.start_addr;
+ void *segment = malloc(reg->size + diff);
+ XBT_DEBUG("Size of segment : %lu", sizeof(segment));
+ memcpy((char *)segment + diff, reg->data, reg->size);
+ //memset(segment, '\0', diff);
+ //XBT_DEBUG("Memset ok");
+ //memcpy(segment+diff, reg->data, reg->size);
+ //XBT_DEBUG("Memcpy segment ok");
+ memcpy(r.start_addr, segment, sizeof(segment));
+ XBT_DEBUG("Memcpy region ok");
+ //memcpy(r.start_addr, reg->data, sizeof(reg->data));
+ break;
+ }
+ }
+ i++;
+ }
+ }else{
+ XBT_DEBUG("Memcpy : dest %p, src %p, size %Zu", reg->start_addr, reg->data, reg->size);
+ memcpy(reg->start_addr, reg->data, reg->size);
+ }
+
+ //return;
}
static void MC_region_destroy(mc_mem_region_t reg)
xbt_free(reg);
}
-static void MC_snapshot_add_region(mc_snapshot_t snapshot, void *start_addr, size_t size)
+static void MC_snapshot_add_region(mc_snapshot_t snapshot, int type, void *start_addr, size_t size)
{
- mc_mem_region_t new_reg = MC_region_new(start_addr, size);
+ switch(type){
+ case 0 :
+ XBT_DEBUG("New region heap");
+ break;
+ case 1 :
+ XBT_DEBUG("New region libsimgrid");
+ break;
+ case 2 :
+ XBT_DEBUG("New region program");
+ break;
+ case 3 :
+ XBT_DEBUG("New region stack");
+ break;
+ }
+ mc_mem_region_t new_reg = MC_region_new(type, start_addr, size);
snapshot->regions = xbt_realloc(snapshot->regions, (snapshot->num_reg + 1) * sizeof(mc_mem_region_t));
snapshot->regions[snapshot->num_reg] = new_reg;
snapshot->num_reg++;
reg = maps->regions[i];
if ((reg.prot & PROT_WRITE)){
if (maps->regions[i].pathname == NULL){
- if (reg.start_addr == std_heap){
- MC_snapshot_add_region(snapshot, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
+ if (reg.start_addr == std_heap){ // only save the std heap (and not the raw one)
+ MC_snapshot_add_region(snapshot, 0, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
}
} else {
if (!memcmp(basename(maps->regions[i].pathname), "libsimgrid", 10)){
- MC_snapshot_add_region(snapshot, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
- }
+ MC_snapshot_add_region(snapshot, 1, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
+ }
}
}
i++;
}
+ /* FIXME: free the memory map */
+}
+
+
+void MC_take_snapshot_liveness(mc_snapshot_t snapshot, char *prgm)
+{
+ unsigned int i = 0;
+ s_map_region reg;
+ memory_map_t maps = get_memory_map();
+
+ for(i=0; i< snapshot->num_reg; i++){
+ MC_region_destroy(snapshot->regions[i]);
+ }
+
+ snapshot->num_reg = 0;
+
+ i = 0;
+
+ /* Save the std heap and the writable mapped pages of libsimgrid */
+ while (i < maps->mapsize) {
+ reg = maps->regions[i];
+ if ((reg.prot & PROT_WRITE)){
+ if (maps->regions[i].pathname == NULL){
+ if (reg.start_addr == std_heap){ // only save the std heap (and not the raw one)
+ MC_snapshot_add_region(snapshot, 0, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
+ }
+ } else {
+ if (!memcmp(basename(maps->regions[i].pathname), "libsimgrid", 10)){
+ MC_snapshot_add_region(snapshot, 1, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
+ } else {
+ if (!memcmp(basename(maps->regions[i].pathname), basename(prgm), strlen(basename(prgm)))){
+ MC_snapshot_add_region(snapshot, 2, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
+ } else {
+ if (!memcmp(maps->regions[i].pathname, "[stack]", 7)){
+ MC_snapshot_add_region(snapshot, 3, reg.start_addr, (char*)reg.end_addr - (char*)reg.start_addr);
+ }
+ }
+ }
+ }
+ }
+ i++;
+ }
/* FIXME: free the memory map */
}
void MC_restore_snapshot(mc_snapshot_t snapshot)
{
unsigned int i;
- for(i=0; i < snapshot->num_reg; i++)
+ for(i=0; i < snapshot->num_reg; i++){
MC_region_restore(snapshot->regions[i]);
+ switch(snapshot->regions[i]->type){
+ case 0 :
+ XBT_DEBUG("heap restored");
+ break;
+ case 1:
+ XBT_DEBUG("libsimgrid (data) restored");
+ break;
+ case 2:
+ XBT_DEBUG("program (data) restored");
+ break;
+ case 3:
+ XBT_DEBUG("stack restored");
+ break;
+ }
+
+ }
+
}
void MC_free_snapshot(mc_snapshot_t snapshot)
xbt_free(snapshot);
}
+
+
/* Create the initial state and push it into the exploration stack */
MC_SET_RAW_MEM;
initial_state = MC_state_new();
- xbt_fifo_unshift(mc_stack, initial_state);
+ xbt_fifo_unshift(mc_stack_safety_stateless, initial_state);
MC_UNSET_RAW_MEM;
XBT_DEBUG("**************************************************");
smx_process_t process = NULL;
xbt_fifo_item_t item = NULL;
- while (xbt_fifo_size(mc_stack) > 0) {
+ while (xbt_fifo_size(mc_stack_safety_stateless) > 0) {
/* Get current state */
state = (mc_state_t)
- xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack));
+ xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_safety_stateless));
XBT_DEBUG("**************************************************");
- XBT_DEBUG("Exploration detph=%d (state=%p)(%u interleave)",
- xbt_fifo_size(mc_stack), state,
+ XBT_DEBUG("Exploration depth=%d (state=%p)(%u interleave)",
+ xbt_fifo_size(mc_stack_safety_stateless), state,
MC_state_interleave_size(state));
/* Update statistics */
/* If there are processes to interleave and the maximum depth has not been reached
then perform one step of the exploration algorithm */
- if (xbt_fifo_size(mc_stack) < MAX_DEPTH &&
+ if (xbt_fifo_size(mc_stack_safety_stateless) < MAX_DEPTH &&
(req = MC_state_get_request(state, &value))) {
/* Debug information */
/* Create the new expanded state */
MC_SET_RAW_MEM;
next_state = MC_state_new();
- xbt_fifo_unshift(mc_stack, next_state);
+ xbt_fifo_unshift(mc_stack_safety_stateless, next_state);
/* Get an enabled process and insert it in the interleave set of the next state */
xbt_swag_foreach(process, simix_global->process_list){
/* Trash the current state, no longer needed */
MC_SET_RAW_MEM;
- xbt_fifo_shift(mc_stack);
+ xbt_fifo_shift(mc_stack_safety_stateless);
MC_state_delete(state);
MC_UNSET_RAW_MEM;
(from it's predecesor state), depends on any other previous request
executed before it. If it does then add it to the interleave set of the
state that executed that previous request. */
- while ((state = xbt_fifo_shift(mc_stack)) != NULL) {
+ while ((state = xbt_fifo_shift(mc_stack_safety_stateless)) != NULL) {
req = MC_state_get_internal_request(state);
- xbt_fifo_foreach(mc_stack, item, prev_state, mc_state_t) {
+ xbt_fifo_foreach(mc_stack_safety_stateless, item, prev_state, mc_state_t) {
if(MC_request_depend(req, MC_state_get_internal_request(prev_state))){
if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
XBT_DEBUG("Dependent Transitions:");
}
if (MC_state_interleave_size(state)) {
/* We found a back-tracking point, let's loop */
- xbt_fifo_unshift(mc_stack, state);
- XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_stack));
+ xbt_fifo_unshift(mc_stack_safety_stateless, state);
+ XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_stack_safety_stateless));
MC_UNSET_RAW_MEM;
- MC_replay(mc_stack);
+ MC_replay(mc_stack_safety_stateless);
break;
} else {
MC_state_delete(state);
MC_UNSET_RAW_MEM;
return;
}
+
+
+/********************* DPOR stateful *********************/
+
+mc_state_ws_t new_state_ws(mc_snapshot_t s, mc_state_t gs){
+ mc_state_ws_t sws = NULL;
+ sws = xbt_new0(s_mc_state_ws_t, 1);
+ sws->system_state = s;
+ sws->graph_state = gs;
+ return sws;
+}
+
+void MC_dpor_stateful_init(){
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("DPOR (stateful) init");
+ XBT_DEBUG("**************************************************");
+
+ mc_state_t initial_graph_state;
+ smx_process_t process;
+ mc_snapshot_t initial_system_snapshot;
+ mc_state_ws_t initial_state ;
+
+ MC_wait_for_requests();
+
+ MC_SET_RAW_MEM;
+
+ initial_system_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+
+ initial_graph_state = MC_state_new();
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(initial_graph_state, process);
+ break;
+ }
+ }
+
+ MC_take_snapshot(initial_system_snapshot);
+
+ initial_state = new_state_ws(initial_system_snapshot, initial_graph_state);
+ xbt_fifo_unshift(mc_stack_safety_stateful, initial_state);
+
+ MC_UNSET_RAW_MEM;
+
+}
+
+void MC_dpor_stateful(){
+
+ smx_process_t process = NULL;
+
+ if(xbt_fifo_size(mc_stack_safety_stateful) == 0)
+ return;
+
+ int value;
+ mc_state_t next_graph_state = NULL;
+ smx_req_t req = NULL, prev_req = NULL;
+ char *req_str;
+ xbt_fifo_item_t item = NULL;
+
+ mc_snapshot_t next_snapshot;
+ mc_state_ws_t current_state;
+ mc_state_ws_t prev_state;
+ mc_state_ws_t next_state;
+
+ while(xbt_fifo_size(mc_stack_safety_stateful) > 0){
+
+ current_state = (mc_state_ws_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_safety_stateful));
+
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("Depth : %d, State : %p , %u interleave", xbt_fifo_size(mc_stack_safety_stateful),current_state, MC_state_interleave_size(current_state->graph_state));
+
+ mc_stats->visited_states++;
+ if(mc_stats->expanded_states>1100)
+ exit(0);
+ //sleep(1);
+
+ if((xbt_fifo_size(mc_stack_safety_stateful) < MAX_DEPTH) && (req = MC_state_get_request(current_state->graph_state, &value))){
+
+ /* Debug information */
+ if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
+ req_str = MC_request_to_string(req, value);
+ //XBT_INFO("Visited states = %lu",mc_stats->visited_states );
+ XBT_DEBUG("Execute: %s",req_str);
+ xbt_free(req_str);
+ }
+
+ MC_state_set_executed_request(current_state->graph_state, req, value);
+ mc_stats->executed_transitions++;
+
+ /* Answer the request */
+ SIMIX_request_pre(req, value);
+
+ /* Wait for requests (schedules processes) */
+ MC_wait_for_requests();
+
+ /* Create the new expanded graph_state */
+ MC_SET_RAW_MEM;
+
+ next_graph_state = MC_state_new();
+
+ /* Get an enabled process and insert it in the interleave set of the next graph_state */
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(next_graph_state, process);
+ break;
+ }
+ }
+
+ next_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot(next_snapshot);
+
+ next_state = new_state_ws(next_snapshot, next_graph_state);
+ xbt_fifo_unshift(mc_stack_safety_stateful, next_state);
+
+ MC_UNSET_RAW_MEM;
+
+ }else{
+ XBT_DEBUG("There are no more processes to interleave.");
+
+ /* Trash the current state, no longer needed */
+ MC_SET_RAW_MEM;
+ xbt_fifo_shift(mc_stack_safety_stateful);
+ MC_UNSET_RAW_MEM;
+
+ /* Check for deadlocks */
+ if(MC_deadlock_check()){
+ MC_show_deadlock_stateful(NULL);
+ return;
+ }
+
+ MC_SET_RAW_MEM;
+ while((current_state = xbt_fifo_shift(mc_stack_safety_stateful)) != NULL){
+ req = MC_state_get_internal_request(current_state->graph_state);
+ xbt_fifo_foreach(mc_stack_safety_stateful, item, prev_state, mc_state_ws_t) {
+ if(MC_request_depend(req, MC_state_get_internal_request(prev_state->graph_state))){
+ if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
+ XBT_DEBUG("Dependent Transitions:");
+ prev_req = MC_state_get_executed_request(prev_state->graph_state, &value);
+ req_str = MC_request_to_string(prev_req, value);
+ XBT_DEBUG("%s (state=%p)", req_str, prev_state->graph_state);
+ xbt_free(req_str);
+ prev_req = MC_state_get_executed_request(current_state->graph_state, &value);
+ req_str = MC_request_to_string(prev_req, value);
+ XBT_DEBUG("%s (state=%p)", req_str, current_state->graph_state);
+ xbt_free(req_str);
+ }
+
+ if(!MC_state_process_is_done(prev_state->graph_state, req->issuer)){
+ MC_state_interleave_process(prev_state->graph_state, req->issuer);
+
+ } else {
+ XBT_DEBUG("Process %p is in done set", req->issuer);
+ }
+
+ break;
+ }
+ }
+
+ if(MC_state_interleave_size(current_state->graph_state)){
+ MC_restore_snapshot(current_state->system_state);
+ xbt_fifo_unshift(mc_stack_safety_stateful, current_state);
+ XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_stack_safety_stateful));
+ MC_UNSET_RAW_MEM;
+ break;
+ }
+ }
+
+ MC_UNSET_RAW_MEM;
+
+ }
+ }
+ MC_UNSET_RAW_MEM;
+ return;
+}
+
+
+
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
+#include <sys/time.h>
#include "../surf/surf_private.h"
#include "../simix/private.h"
"Logging specific to MC (global)");
/* MC global data structures */
-mc_snapshot_t initial_snapshot = NULL;
-xbt_fifo_t mc_stack = NULL;
-mc_stats_t mc_stats = NULL;
+
mc_state_t mc_current_state = NULL;
char mc_replay_mode = FALSE;
double *mc_time = NULL;
+mc_snapshot_t initial_snapshot = NULL;
+
+/* Safety */
+
+xbt_fifo_t mc_stack_safety_stateful = NULL;
+xbt_fifo_t mc_stack_safety_stateless = NULL;
+mc_stats_t mc_stats = NULL;
+
+/* Liveness */
+
+xbt_fifo_t mc_stack_liveness_stateful = NULL;
+mc_stats_pair_t mc_stats_pair = NULL;
+xbt_fifo_t mc_stack_liveness_stateless = NULL;
+mc_snapshot_t initial_snapshot_liveness = NULL;
+
+
/**
* \brief Initialize the model-checker data structures
*/
-void MC_init(void)
+void MC_init_safety_stateless(void)
{
+
/* Check if MC is already initialized */
if (initial_snapshot)
return;
mc_stats->state_size = 1;
/* Create exploration stack */
- mc_stack = xbt_fifo_new();
+ mc_stack_safety_stateless = xbt_fifo_new();
MC_UNSET_RAW_MEM;
MC_UNSET_RAW_MEM;
}
+void MC_init_safety_stateful(void){
+
+
+ /* Check if MC is already initialized */
+ if (initial_snapshot)
+ return;
+
+ mc_time = xbt_new0(double, simix_process_maxpid);
+
+ /* Initialize the data structures that must be persistent across every
+ iteration of the model-checker (in RAW memory) */
+ MC_SET_RAW_MEM;
+
+ /* Initialize statistics */
+ mc_stats = xbt_new0(s_mc_stats_t, 1);
+ mc_stats->state_size = 1;
+
+ /* Create exploration stack */
+ mc_stack_safety_stateful = xbt_fifo_new();
+
+ MC_UNSET_RAW_MEM;
+
+ MC_dpor_stateful_init();
+
+
+}
+
+void MC_init_liveness_stateful(xbt_automaton_t a){
+
+ XBT_DEBUG("Start init mc");
+
+ mc_time = xbt_new0(double, simix_process_maxpid);
+
+ /* Initialize the data structures that must be persistent across every
+ iteration of the model-checker (in RAW memory) */
+
+ MC_SET_RAW_MEM;
+
+ /* Initialize statistics */
+ mc_stats_pair = xbt_new0(s_mc_stats_pair_t, 1);
+ //mc_stats = xbt_new0(s_mc_stats_t, 1);
+
+ XBT_DEBUG("Creating snapshot_stack");
+
+ /* Create exploration stack */
+ mc_stack_liveness_stateful = xbt_fifo_new();
+
+
+ MC_UNSET_RAW_MEM;
+
+ //MC_ddfs_stateful_init(a);
+ //MC_dpor2_init(a);
+ //MC_dpor3_init(a);
+}
+
+void MC_init_liveness_stateless(xbt_automaton_t a, char *prgm){
+
+ XBT_DEBUG("Start init mc");
+
+ mc_time = xbt_new0(double, simix_process_maxpid);
+
+ /* Initialize the data structures that must be persistent across every
+ iteration of the model-checker (in RAW memory) */
+
+ MC_SET_RAW_MEM;
+
+ /* Initialize statistics */
+ mc_stats_pair = xbt_new0(s_mc_stats_pair_t, 1);
+
+ XBT_DEBUG("Creating stack");
+
+ /* Create exploration stack */
+ mc_stack_liveness_stateless = xbt_fifo_new();
+
+ MC_UNSET_RAW_MEM;
+
+ MC_ddfs_stateless_init(a, prgm);
+
+
+}
+
+
void MC_modelcheck(void)
{
- MC_init();
+ MC_init_safety_stateless();
MC_dpor();
MC_exit();
}
+void MC_modelcheck_stateful(void)
+{
+ MC_init_safety_stateful();
+ MC_dpor_stateful();
+ MC_exit();
+}
+
+void MC_modelcheck_liveness_stateful(xbt_automaton_t a){
+ MC_init_liveness_stateful(a);
+ MC_exit_liveness();
+}
+
+void MC_modelcheck_liveness_stateless(xbt_automaton_t a, char *prgm){
+ MC_init_liveness_stateless(a, prgm);
+ MC_exit_liveness();
+}
+
+void MC_exit_liveness(void)
+{
+ MC_print_statistics_pairs(mc_stats_pair);
+ //xbt_free(mc_time);
+ //MC_memory_exit();
+ exit(0);
+}
+
+
void MC_exit(void)
{
MC_print_statistics(mc_stats);
MC_memory_exit();
}
+
int MC_random(int min, int max)
{
/*FIXME: return mc_current_state->executed_transition->random.value;*/
XBT_DEBUG("**** End Replay ****");
}
+void MC_replay_liveness(xbt_fifo_t stack, int all_stack)
+{
+ int value;
+ char *req_str;
+ smx_req_t req = NULL, saved_req = NULL;
+ xbt_fifo_item_t item;
+ mc_state_t state;
+ mc_pair_stateless_t pair;
+ int depth = 1;
+
+ XBT_DEBUG("**** Begin Replay ****");
+
+ /* Restore the initial state */
+ MC_restore_snapshot(initial_snapshot_liveness);
+ /* At the moment of taking the snapshot the raw heap was set, so restoring
+ * it will set it back again, we have to unset it to continue */
+ MC_UNSET_RAW_MEM;
+
+ if(all_stack){
+
+ item = xbt_fifo_get_last_item(stack);
+
+ while(depth <= xbt_fifo_size(stack)){
+
+ pair = (mc_pair_stateless_t) xbt_fifo_get_item_content(item);
+ state = (mc_state_t) pair->graph_state;
+
+ if(pair->requests > 0){
+
+ saved_req = MC_state_get_executed_request(state, &value);
+ //XBT_DEBUG("SavedReq->call %u", saved_req->call);
+
+ if(saved_req != NULL){
+ /* because we got a copy of the executed request, we have to fetch the
+ real one, pointed by the request field of the issuer process */
+ req = &saved_req->issuer->request;
+ //XBT_DEBUG("Req->call %u", req->call);
+
+ /* Debug information */
+ if(XBT_LOG_ISENABLED(mc_global, xbt_log_priority_debug)){
+ req_str = MC_request_to_string(req, value);
+ XBT_DEBUG("Replay (depth = %d) : %s (%p)", depth, req_str, state);
+ xbt_free(req_str);
+ }
+
+ }
+
+ SIMIX_request_pre(req, value);
+ MC_wait_for_requests();
+ }
+
+ depth++;
+
+ /* Update statistics */
+ mc_stats_pair->visited_pairs++;
+
+ item = xbt_fifo_get_prev_item(item);
+ }
+
+ }else{
+
+ /* Traverse the stack from the initial state and re-execute the transitions */
+ for (item = xbt_fifo_get_last_item(stack);
+ item != xbt_fifo_get_first_item(stack);
+ item = xbt_fifo_get_prev_item(item)) {
+
+ pair = (mc_pair_stateless_t) xbt_fifo_get_item_content(item);
+ state = (mc_state_t) pair->graph_state;
+
+ if(pair->requests > 0){
+
+ saved_req = MC_state_get_executed_request(state, &value);
+ //XBT_DEBUG("SavedReq->call %u", saved_req->call);
+
+ if(saved_req != NULL){
+ /* because we got a copy of the executed request, we have to fetch the
+ real one, pointed by the request field of the issuer process */
+ req = &saved_req->issuer->request;
+ //XBT_DEBUG("Req->call %u", req->call);
+
+ /* Debug information */
+ if(XBT_LOG_ISENABLED(mc_global, xbt_log_priority_debug)){
+ req_str = MC_request_to_string(req, value);
+ XBT_DEBUG("Replay (depth = %d) : %s (%p)", depth, req_str, state);
+ xbt_free(req_str);
+ }
+
+ }
+
+ SIMIX_request_pre(req, value);
+ MC_wait_for_requests();
+ }
+
+ depth++;
+
+ /* Update statistics */
+ mc_stats_pair->visited_pairs++;
+ }
+ }
+
+ XBT_DEBUG("**** End Replay ****");
+}
+
+
/**
* \brief Dumps the contents of a model-checker's stack and shows the actual
* execution trace
* \param stack The stack to dump
*/
-void MC_dump_stack(xbt_fifo_t stack)
+void MC_dump_stack_safety_stateless(xbt_fifo_t stack)
{
mc_state_t state;
- MC_show_stack(stack);
+ MC_show_stack_safety_stateless(stack);
MC_SET_RAW_MEM;
while ((state = (mc_state_t) xbt_fifo_pop(stack)) != NULL)
MC_UNSET_RAW_MEM;
}
-void MC_show_stack(xbt_fifo_t stack)
+
+void MC_show_stack_safety_stateless(xbt_fifo_t stack)
{
int value;
mc_state_t state;
XBT_INFO("%s", req_str);
xbt_free(req_str);*/
XBT_INFO("Counter-example execution trace:");
- MC_dump_stack(mc_stack);
+ MC_dump_stack_safety_stateless(mc_stack_safety_stateless);
+}
+
+void MC_show_deadlock_stateful(smx_req_t req)
+{
+ /*char *req_str = NULL;*/
+ XBT_INFO("**************************");
+ XBT_INFO("*** DEAD-LOCK DETECTED ***");
+ XBT_INFO("**************************");
+ XBT_INFO("Locked request:");
+ /*req_str = MC_request_to_string(req);
+ XBT_INFO("%s", req_str);
+ xbt_free(req_str);*/
+ XBT_INFO("Counter-example execution trace:");
+ MC_show_stack_safety_stateful(mc_stack_safety_stateful);
+}
+
+void MC_dump_stack_safety_stateful(xbt_fifo_t stack)
+{
+ //mc_state_ws_t state;
+
+ MC_show_stack_safety_stateful(stack);
+
+ /*MC_SET_RAW_MEM;
+ while ((state = (mc_state_t) xbt_fifo_pop(stack)) != NULL)
+ MC_state_delete(state);
+ MC_UNSET_RAW_MEM;*/
+}
+
+
+void MC_show_stack_safety_stateful(xbt_fifo_t stack)
+{
+ int value;
+ mc_state_ws_t state;
+ xbt_fifo_item_t item;
+ smx_req_t req;
+ char *req_str = NULL;
+
+ for (item = xbt_fifo_get_last_item(stack);
+ (item ? (state = (mc_state_ws_t) (xbt_fifo_get_item_content(item)))
+ : (NULL)); item = xbt_fifo_get_prev_item(item)) {
+ req = MC_state_get_executed_request(state->graph_state, &value);
+ if(req){
+ req_str = MC_request_to_string(req, value);
+ XBT_INFO("%s", req_str);
+ xbt_free(req_str);
+ }
+ }
+}
+
+void MC_show_stack_liveness_stateful(xbt_fifo_t stack){
+ int value;
+ mc_pair_t pair;
+ xbt_fifo_item_t item;
+ smx_req_t req;
+ char *req_str = NULL;
+
+ for (item = xbt_fifo_get_last_item(stack);
+ (item ? (pair = (mc_pair_t) (xbt_fifo_get_item_content(item)))
+ : (NULL)); item = xbt_fifo_get_prev_item(item)) {
+ req = MC_state_get_executed_request(pair->graph_state, &value);
+ if(req){
+ req_str = MC_request_to_string(req, value);
+ XBT_INFO("%s", req_str);
+ xbt_free(req_str);
+ }
+ }
}
+void MC_dump_stack_liveness_stateful(xbt_fifo_t stack){
+ mc_pair_t pair;
+
+ MC_SET_RAW_MEM;
+ while ((pair = (mc_pair_t) xbt_fifo_pop(stack)) != NULL)
+ MC_pair_delete(pair);
+ MC_UNSET_RAW_MEM;
+}
+
+void MC_show_stack_liveness_stateless(xbt_fifo_t stack){
+ int value;
+ mc_pair_stateless_t pair;
+ xbt_fifo_item_t item;
+ smx_req_t req;
+ char *req_str = NULL;
+
+ for (item = xbt_fifo_get_last_item(stack);
+ (item ? (pair = (mc_pair_stateless_t) (xbt_fifo_get_item_content(item)))
+ : (NULL)); item = xbt_fifo_get_prev_item(item)) {
+ req = MC_state_get_executed_request(pair->graph_state, &value);
+ if(req){
+ if(pair->requests>0){
+ req_str = MC_request_to_string(req, value);
+ XBT_INFO("%s", req_str);
+ xbt_free(req_str);
+ }else{
+ XBT_INFO("End of system requests but evolution in Büchi automaton");
+ }
+ }
+ }
+}
+
+void MC_dump_stack_liveness_stateless(xbt_fifo_t stack){
+ mc_pair_stateless_t pair;
+
+ MC_SET_RAW_MEM;
+ while ((pair = (mc_pair_stateless_t) xbt_fifo_pop(stack)) != NULL)
+ MC_pair_stateless_delete(pair);
+ MC_UNSET_RAW_MEM;
+}
+
+
void MC_print_statistics(mc_stats_t stats)
{
XBT_INFO("State space size ~= %lu", stats->state_size);
(double)stats->expanded_states / stats->state_size); */
}
+void MC_print_statistics_pairs(mc_stats_pair_t stats)
+{
+ XBT_INFO("Expanded pairs = %lu", stats->expanded_pairs);
+ XBT_INFO("Visited pairs = %lu", stats->visited_pairs);
+ //XBT_INFO("Executed transitions = %lu", stats->executed_transitions);
+ XBT_INFO("Expanded / Visited = %lf",
+ (double) stats->visited_pairs / stats->expanded_pairs);
+ /*XBT_INFO("Exploration coverage = %lf",
+ (double)stats->expanded_states / stats->state_size); */
+}
+
void MC_assert(int prop)
{
if (MC_IS_ENABLED && !prop) {
XBT_INFO("*** PROPERTY NOT VALID ***");
XBT_INFO("**************************");
XBT_INFO("Counter-example execution trace:");
- MC_dump_stack(mc_stack);
+ MC_dump_stack_safety_stateless(mc_stack_safety_stateless);
+ MC_print_statistics(mc_stats);
+ xbt_abort();
+ }
+}
+
+void MC_assert_stateful(int prop)
+{
+ if (MC_IS_ENABLED && !prop) {
+ XBT_INFO("**************************");
+ XBT_INFO("*** PROPERTY NOT VALID ***");
+ XBT_INFO("**************************");
+ XBT_INFO("Counter-example execution trace:");
+ MC_dump_stack_safety_stateful(mc_stack_safety_stateful);
MC_print_statistics(mc_stats);
xbt_abort();
}
}
+void MC_assert_pair_stateful(int prop){
+ if (MC_IS_ENABLED && !prop) {
+ XBT_INFO("**************************");
+ XBT_INFO("*** PROPERTY NOT VALID ***");
+ XBT_INFO("**************************");
+ //XBT_INFO("Counter-example execution trace:");
+ MC_show_stack_liveness_stateful(mc_stack_liveness_stateful);
+ //MC_dump_snapshot_stack(mc_snapshot_stack);
+ MC_print_statistics_pairs(mc_stats_pair);
+ xbt_abort();
+ }
+}
+
+void MC_assert_pair_stateless(int prop){
+ if (MC_IS_ENABLED && !prop) {
+ XBT_INFO("**************************");
+ XBT_INFO("*** PROPERTY NOT VALID ***");
+ XBT_INFO("**************************");
+ //XBT_INFO("Counter-example execution trace:");
+ MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
+ //MC_dump_snapshot_stack(mc_snapshot_stack);
+ MC_print_statistics_pairs(mc_stats_pair);
+ xbt_abort();
+ }
+}
+
void MC_process_clock_add(smx_process_t process, double amount)
{
mc_time[process->pid] += amount;
--- /dev/null
+#include "private.h"
+#include "unistd.h"
+
+XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
+ "Logging specific to algorithms for liveness properties verification");
+
+xbt_fifo_t reached_pairs;
+xbt_fifo_t visited_pairs;
+xbt_dynar_t successors = NULL;
+
+//mc_snapshot_t snapshot;
+
+int snapshot_compare(mc_snapshot_t s1, mc_snapshot_t s2){
+
+ //XBT_DEBUG("Compare snapshot");
+
+ if(s1->num_reg != s2->num_reg){
+ XBT_DEBUG("Different num_reg (s1 = %d, s2 = %d)", s1->num_reg, s2->num_reg);
+ return 1;
+ }
+
+ //XBT_DEBUG("Num reg : %d", s1->num_reg);
+
+ int i;
+ int errors = 0;
+
+ for(i=0 ; i< s1->num_reg ; i++){
+
+ if(s1->regions[i]->type != s2->regions[i]->type){
+ //XBT_DEBUG("Different type of region");
+ return 1;
+ }
+
+ switch(s1->regions[i]->type){
+ case 0:
+ //XBT_DEBUG("Region : heap");
+ if(s1->regions[i]->size != s2->regions[i]->size){
+ //XBT_DEBUG("Different size of heap (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
+ return 1;
+ }
+ if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
+ //XBT_DEBUG("Different start addr of heap (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
+ return 1;
+ }
+ if(mmalloc_compare_heap(s1->regions[i]->start_addr, s2->regions[i]->start_addr)){
+ //XBT_DEBUG("Different heap (mmalloc_compare)");
+ errors++;
+ }
+ break;
+ case 1 :
+ //XBT_DEBUG("Region : libsimgrid");
+ if(s1->regions[i]->size != s2->regions[i]->size){
+ //XBT_DEBUG("Different size of libsimgrid (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
+ return 1;
+ }
+ if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
+ //XBT_DEBUG("Different start addr of libsimgrid (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
+ return 1;
+ }
+ if(memcmp(s1->regions[i]->data, s2->regions[i]->data, s1->regions[i]->size) != 0){
+ //XBT_DEBUG("Different memcmp for data in libsimgrid");
+ errors++;
+ }
+ break;
+ case 2:
+ //XBT_DEBUG("Region : program");
+ if(s1->regions[i]->size != s2->regions[i]->size){
+ //XBT_DEBUG("Different size of program (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
+ return 1;
+ }
+ if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
+ //XBT_DEBUG("Different start addr of program (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
+ return 1;
+ }
+ if(memcmp(s1->regions[i]->data, s2->regions[i]->data, s1->regions[i]->size) != 0){
+ //XBT_DEBUG("Different memcmp for data in program");
+ errors++;
+ }
+ break;
+ case 3:
+ //XBT_DEBUG("Region : stack");
+ if(s1->regions[i]->size != s2->regions[i]->size){
+ //XBT_DEBUG("Different size of stack (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
+ return 1;
+ }
+ if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
+ //XBT_DEBUG("Different start addr of stack (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
+ return 1;
+ }
+ if(memcmp(s1->regions[i]->data, s2->regions[i]->data, s1->regions[i]->size) != 0){
+ //XBT_DEBUG("Different memcmp for data in stack");
+ errors++;
+ }
+ break;
+ }
+ }
+
+ return (errors>0);
+
+}
+
+int reached(xbt_automaton_t a, xbt_state_t st, char *prgm){
+
+
+ if(xbt_fifo_size(reached_pairs) == 0){
+
+ return 0;
+
+ }else{
+
+ xbt_dynar_t prop_ato = xbt_dynar_new(sizeof(int), NULL);
+
+ /* Get values of propositional symbols */
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t ps = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, ps){
+ int (*f)() = ps->function;
+ int res = (*f)();
+ xbt_dynar_push_as(prop_ato, int, res);
+ }
+
+ MC_SET_RAW_MEM;
+ mc_snapshot_t sn = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot_liveness(sn, prgm);
+ MC_UNSET_RAW_MEM;
+
+ int i=0;
+ xbt_fifo_item_t item = xbt_fifo_get_first_item(reached_pairs);
+ mc_pair_reached_t pair_test = NULL;
+
+ while(i < xbt_fifo_size(reached_pairs)){
+
+ pair_test = (mc_pair_reached_t) xbt_fifo_get_item_content(item);
+
+ if(automaton_state_compare(pair_test->automaton_state, st) == 0){
+ if(propositional_symbols_compare_value(pair_test->prop_ato, prop_ato) == 0){
+ if(snapshot_compare(sn, pair_test->system_state) == 0){
+ MC_SET_RAW_MEM;
+ MC_free_snapshot(sn);
+ MC_UNSET_RAW_MEM;
+ return 1;
+ }
+ }
+ }
+
+ item = xbt_fifo_get_next_item(item);
+
+ i++;
+
+ }
+
+ MC_SET_RAW_MEM;
+ MC_free_snapshot(sn);
+ MC_UNSET_RAW_MEM;
+ return 0;
+
+ }
+}
+
+void set_pair_reached(xbt_automaton_t a, xbt_state_t st, char *prgm){
+
+
+ MC_SET_RAW_MEM;
+
+ mc_pair_reached_t pair = NULL;
+ pair = xbt_new0(s_mc_pair_reached_t, 1);
+ pair->automaton_state = st;
+ pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
+ pair->system_state = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot_liveness(pair->system_state, prgm);
+
+ /* Get values of propositional symbols */
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t ps = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, ps){
+ int (*f)() = ps->function;
+ int res = (*f)();
+ xbt_dynar_push_as(pair->prop_ato, int, res);
+ }
+
+ xbt_fifo_unshift(reached_pairs, pair);
+
+ MC_UNSET_RAW_MEM;
+
+
+}
+
+int visited(xbt_automaton_t a, xbt_state_t st, int sc, char *prgm){
+
+
+ if(xbt_fifo_size(visited_pairs) == 0){
+
+ return 0;
+
+ }else{
+
+ xbt_dynar_t prop_ato = xbt_dynar_new(sizeof(int), NULL);
+
+ /* Get values of propositional symbols */
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t ps = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, ps){
+ int (*f)() = ps->function;
+ int res = (*f)();
+ xbt_dynar_push_as(prop_ato, int, res);
+ }
+
+ MC_SET_RAW_MEM;
+ mc_snapshot_t sn = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot_liveness(sn, prgm);
+ MC_UNSET_RAW_MEM;
+
+
+ int i=0;
+ xbt_fifo_item_t item = xbt_fifo_get_first_item(visited_pairs);
+ mc_pair_visited_t pair_test = NULL;
+
+ while(i < xbt_fifo_size(visited_pairs)){
+
+ pair_test = (mc_pair_visited_t) xbt_fifo_get_item_content(item);
+
+ if(pair_test->search_cycle == sc) {
+ if(automaton_state_compare(pair_test->automaton_state, st) == 0){
+ if(propositional_symbols_compare_value(pair_test->prop_ato, prop_ato) == 0){
+ if(snapshot_compare(sn, pair_test->system_state) == 0){
+ MC_SET_RAW_MEM;
+ MC_free_snapshot(sn);
+ MC_UNSET_RAW_MEM;
+ return 1;
+ }
+ }
+ }
+ }
+
+ item = xbt_fifo_get_next_item(item);
+
+ i++;
+
+ }
+
+ MC_SET_RAW_MEM;
+ MC_free_snapshot(sn);
+ MC_UNSET_RAW_MEM;
+ return 0;
+
+ }
+}
+
+void set_pair_visited(xbt_automaton_t a, xbt_state_t st, int sc, char *prgm){
+
+
+ MC_SET_RAW_MEM;
+
+ mc_pair_visited_t pair = NULL;
+ pair = xbt_new0(s_mc_pair_visited_t, 1);
+ pair->automaton_state = st;
+ pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
+ pair->system_state = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot_liveness(pair->system_state, prgm);
+ pair->search_cycle = sc;
+
+ /* Get values of propositional symbols */
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t ps = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, ps){
+ int (*f)() = ps->function;
+ int res = (*f)();
+ xbt_dynar_push_as(pair->prop_ato, int, res);
+ }
+
+ xbt_fifo_unshift(visited_pairs, pair);
+
+ MC_UNSET_RAW_MEM;
+
+
+}
+
+void MC_pair_delete(mc_pair_t pair){
+ xbt_free(pair->graph_state->proc_status);
+ xbt_free(pair->graph_state);
+ //xbt_free(pair->automaton_state); -> FIXME : à implémenter
+ xbt_free(pair);
+}
+
+
+
+int MC_automaton_evaluate_label(xbt_automaton_t a, xbt_exp_label_t l){
+
+ switch(l->type){
+ case 0 : {
+ int left_res = MC_automaton_evaluate_label(a, l->u.or_and.left_exp);
+ int right_res = MC_automaton_evaluate_label(a, l->u.or_and.right_exp);
+ return (left_res || right_res);
+ break;
+ }
+ case 1 : {
+ int left_res = MC_automaton_evaluate_label(a, l->u.or_and.left_exp);
+ int right_res = MC_automaton_evaluate_label(a, l->u.or_and.right_exp);
+ return (left_res && right_res);
+ break;
+ }
+ case 2 : {
+ int res = MC_automaton_evaluate_label(a, l->u.exp_not);
+ return (!res);
+ break;
+ }
+ case 3 : {
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t p = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, p){
+ if(strcmp(p->pred, l->u.predicat) == 0){
+ int (*f)() = p->function;
+ return (*f)();
+ }
+ }
+ return -1;
+ break;
+ }
+ case 4 : {
+ return 2;
+ break;
+ }
+ default :
+ return -1;
+ }
+}
+
+
+
+
+
+/********************* Double-DFS stateless *******************/
+
+void MC_pair_stateless_delete(mc_pair_stateless_t pair){
+ xbt_free(pair->graph_state->proc_status);
+ xbt_free(pair->graph_state);
+ //xbt_free(pair->automaton_state); -> FIXME : à implémenter
+ xbt_free(pair);
+}
+
+mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r){
+ mc_pair_stateless_t p = NULL;
+ p = xbt_new0(s_mc_pair_stateless_t, 1);
+ p->automaton_state = st;
+ p->graph_state = sg;
+ p->requests = r;
+ mc_stats_pair->expanded_pairs++;
+ return p;
+}
+
+void MC_ddfs_stateless_init(xbt_automaton_t a, char *prgm){
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("Double-DFS stateless init");
+ XBT_DEBUG("**************************************************");
+
+ mc_pair_stateless_t mc_initial_pair = NULL;
+ mc_state_t initial_graph_state = NULL;
+ smx_process_t process;
+
+ MC_wait_for_requests();
+
+ MC_SET_RAW_MEM;
+
+ initial_graph_state = MC_state_pair_new();
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(initial_graph_state, process);
+ }
+ }
+
+ reached_pairs = xbt_fifo_new();
+ visited_pairs = xbt_fifo_new();
+ successors = xbt_dynar_new(sizeof(mc_pair_stateless_t), NULL);
+
+ /* Save the initial state */
+ initial_snapshot_liveness = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot_liveness(initial_snapshot_liveness, prgm);
+
+ MC_UNSET_RAW_MEM;
+
+ unsigned int cursor = 0;
+ xbt_state_t state;
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ if(state->type == -1){
+
+ MC_SET_RAW_MEM;
+ mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
+ xbt_fifo_unshift(mc_stack_liveness_stateless, mc_initial_pair);
+ MC_UNSET_RAW_MEM;
+
+ if(cursor != 0){
+ MC_restore_snapshot(initial_snapshot_liveness);
+ MC_UNSET_RAW_MEM;
+ }
+
+ MC_ddfs_stateless(a, 0, 0, prgm);
+
+ }else{
+ if(state->type == 2){
+
+ MC_SET_RAW_MEM;
+ mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
+ xbt_fifo_unshift(mc_stack_liveness_stateless, mc_initial_pair);
+ MC_UNSET_RAW_MEM;
+
+ set_pair_reached(a, state, prgm);
+
+ if(cursor != 0){
+ MC_restore_snapshot(initial_snapshot_liveness);
+ MC_UNSET_RAW_MEM;
+ }
+
+ MC_ddfs_stateless(a, 1, 0, prgm);
+
+ }
+ }
+ }
+
+}
+
+
+void MC_ddfs_stateless(xbt_automaton_t a, int search_cycle, int replay, char *prgm){
+
+ smx_process_t process;
+ mc_pair_stateless_t current_pair = NULL;
+
+ //mc_snapshot_t current_snapshot = NULL;
+
+ if(xbt_fifo_size(mc_stack_liveness_stateless) == 0)
+ return;
+
+ if(replay == 1){
+ MC_replay_liveness(mc_stack_liveness_stateless, 0);
+ current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness_stateless));
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(current_pair->graph_state, process);
+ }
+ }
+ }
+
+ /* Get current pair */
+ current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness_stateless));
+
+ /* Update current state in buchi automaton */
+ a->current_state = current_pair->automaton_state;
+
+
+ XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d )", xbt_fifo_size(mc_stack_liveness_stateless), search_cycle);
+ XBT_DEBUG("Pair : graph=%p, automaton=%p(%s), %u interleave", current_pair->graph_state, current_pair->automaton_state, current_pair->automaton_state->id, MC_state_interleave_size(current_pair->graph_state));
+
+ mc_stats_pair->visited_pairs++;
+
+ //sleep(1);
+
+ int value;
+ mc_state_t next_graph_state = NULL;
+ smx_req_t req = NULL;
+ char *req_str;
+
+ xbt_transition_t transition_succ;
+ unsigned int cursor = 0;
+ int res;
+
+ mc_pair_stateless_t next_pair = NULL;
+ mc_pair_stateless_t pair_succ;
+
+ if(xbt_fifo_size(mc_stack_liveness_stateless) < MAX_DEPTH_LIVENESS){
+
+ set_pair_visited(a, current_pair->automaton_state, search_cycle, prgm);
+
+ if(current_pair->requests > 0){
+
+ while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
+
+ /* Debug information */
+ if(XBT_LOG_ISENABLED(mc_liveness, xbt_log_priority_debug)){
+ req_str = MC_request_to_string(req, value);
+ XBT_DEBUG("Execute: %s", req_str);
+ xbt_free(req_str);
+ }
+
+ MC_state_set_executed_request(current_pair->graph_state, req, value);
+
+ /* Answer the request */
+ SIMIX_request_pre(req, value);
+
+ /* Wait for requests (schedules processes) */
+ MC_wait_for_requests();
+
+
+ MC_SET_RAW_MEM;
+
+ /* Create the new expanded graph_state */
+ next_graph_state = MC_state_pair_new();
+
+ /* Get enabled process and insert it in the interleave set of the next graph_state */
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(next_graph_state, process);
+ }
+ }
+
+ xbt_dynar_reset(successors);
+
+ MC_UNSET_RAW_MEM;
+
+
+ cursor= 0;
+ xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
+
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
+ if(res == 1){ // enabled transition in automaton
+ MC_SET_RAW_MEM;
+ next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
+ xbt_dynar_push(successors, &next_pair);
+ MC_UNSET_RAW_MEM;
+ }
+
+ }
+
+ cursor = 0;
+
+ xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
+
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
+ if(res == 2){ // true transition in automaton
+ MC_SET_RAW_MEM;
+ next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
+ xbt_dynar_push(successors, &next_pair);
+ MC_UNSET_RAW_MEM;
+ }
+
+ }
+
+ cursor = 0;
+
+ xbt_dynar_foreach(successors, cursor, pair_succ){
+
+ if(!visited(a, pair_succ->automaton_state, search_cycle, prgm)){
+
+ if(search_cycle == 1){
+
+ if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
+
+ if(reached(a, pair_succ->automaton_state, prgm) == 1){
+
+ XBT_DEBUG("Next pair (depth = %d, %d interleave) already reached !", xbt_fifo_size(mc_stack_liveness_stateless) + 1, MC_state_interleave_size(pair_succ->graph_state));
+
+ XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
+ XBT_INFO("| ACCEPTANCE CYCLE |");
+ XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
+ XBT_INFO("Counter-example that violates formula :");
+ MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
+ MC_dump_stack_liveness_stateless(mc_stack_liveness_stateless);
+ MC_print_statistics_pairs(mc_stats_pair);
+ exit(0);
+
+ }else{
+
+ XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness_stateless) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
+
+ set_pair_reached(a, pair_succ->automaton_state, prgm);
+
+ }
+
+ }
+
+ }else{
+
+ if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
+
+ XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness_stateless) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
+
+ set_pair_reached(a, pair_succ->automaton_state, prgm);
+
+ search_cycle = 1;
+
+ }
+
+ }
+
+ MC_SET_RAW_MEM;
+ xbt_fifo_unshift(mc_stack_liveness_stateless, pair_succ);
+ MC_UNSET_RAW_MEM;
+
+ MC_ddfs_stateless(a, search_cycle, 0, prgm);
+
+ /* Restore system before checking others successors */
+ if(cursor != (xbt_dynar_length(successors) - 1))
+ MC_replay_liveness(mc_stack_liveness_stateless, 1);
+
+ }else{
+
+ XBT_DEBUG("Next pair already visited");
+
+ }
+ }
+
+ if(MC_state_interleave_size(current_pair->graph_state) > 0){
+ XBT_DEBUG("Backtracking to depth %u", xbt_fifo_size(mc_stack_liveness_stateless));
+ MC_replay_liveness(mc_stack_liveness_stateless, 0);
+ }
+ }
+
+
+ }else{ /*No request to execute, search evolution in Büchi automaton */
+
+ MC_SET_RAW_MEM;
+
+ /* Create the new expanded graph_state */
+ next_graph_state = MC_state_pair_new();
+
+ xbt_dynar_reset(successors);
+
+ MC_UNSET_RAW_MEM;
+
+
+ cursor= 0;
+ xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
+
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
+ if(res == 1){ // enabled transition in automaton
+ MC_SET_RAW_MEM;
+ next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
+ xbt_dynar_push(successors, &next_pair);
+ MC_UNSET_RAW_MEM;
+ }
+
+ }
+
+ cursor = 0;
+
+ xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
+
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
+ if(res == 2){ // true transition in automaton
+ MC_SET_RAW_MEM;
+ next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
+ xbt_dynar_push(successors, &next_pair);
+ MC_UNSET_RAW_MEM;
+ }
+
+ }
+
+ cursor = 0;
+
+ xbt_dynar_foreach(successors, cursor, pair_succ){
+
+ if(!visited(a, pair_succ->automaton_state, search_cycle, prgm)){
+
+ if(search_cycle == 1){
+
+ if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
+
+ if(reached(a, pair_succ->automaton_state, prgm) == 1){
+
+ XBT_DEBUG("Next pair (depth = %d) already reached !", xbt_fifo_size(mc_stack_liveness_stateless) + 1);
+
+ XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
+ XBT_INFO("| ACCEPTANCE CYCLE |");
+ XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
+ XBT_INFO("Counter-example that violates formula :");
+ MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
+ MC_dump_stack_liveness_stateless(mc_stack_liveness_stateless);
+ MC_print_statistics_pairs(mc_stats_pair);
+ exit(0);
+
+ }else{
+
+ XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness_stateless) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
+
+ set_pair_reached(a, pair_succ->automaton_state, prgm);
+
+ }
+
+ }
+
+ }else{
+
+ if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)) && (xbt_fifo_size(mc_stack_liveness_stateless) < (MAX_DEPTH_LIVENESS - 1))){
+
+ set_pair_reached(a, pair_succ->automaton_state, prgm);
+
+ search_cycle = 1;
+
+ }
+
+ }
+
+ MC_SET_RAW_MEM;
+ xbt_fifo_unshift(mc_stack_liveness_stateless, pair_succ);
+ MC_UNSET_RAW_MEM;
+
+ MC_ddfs_stateless(a, search_cycle, 0, prgm);
+
+ /* Restore system before checking others successors */
+ if(cursor != xbt_dynar_length(successors) - 1)
+ MC_replay_liveness(mc_stack_liveness_stateless, 1);
+
+ }else{
+
+ XBT_DEBUG("Next pair already visited");
+
+ }
+
+ }
+
+ }
+
+ }else{
+
+ XBT_DEBUG("Max depth reached");
+
+ }
+
+ if(xbt_fifo_size(mc_stack_liveness_stateless) == MAX_DEPTH_LIVENESS ){
+ XBT_DEBUG("Pair (graph=%p, automaton =%p, search_cycle = %u, depth = %d) shifted in stack, maximum depth reached", current_pair->graph_state, current_pair->automaton_state, search_cycle, xbt_fifo_size(mc_stack_liveness_stateless) );
+ }else{
+ XBT_DEBUG("Pair (graph=%p, automaton =%p, search_cycle = %u, depth = %d) shifted in stack", current_pair->graph_state, current_pair->automaton_state, search_cycle, xbt_fifo_size(mc_stack_liveness_stateless) );
+ }
+
+
+ MC_SET_RAW_MEM;
+ xbt_fifo_shift(mc_stack_liveness_stateless);
+ if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
+ xbt_fifo_shift(reached_pairs);
+ }
+ MC_UNSET_RAW_MEM;
+
+
+}
+
{
if(_surf_do_model_check == 2)
return TRUE;
+
if (r1->issuer == r2->issuer)
return FALSE;
&& r2->comm_wait.comm->comm.dst_buff != r1->comm_test.comm->comm.src_buff)
return FALSE;
+
return TRUE;
}
+
+
#include "../simix/private.h"
#include "xbt/fifo.h"
#include "private.h"
return state;
}
+mc_state_t MC_state_pair_new(void)
+{
+ mc_state_t state = NULL;
+
+ state = xbt_new0(s_mc_state_t, 1);
+ state->max_pid = simix_process_maxpid;
+ state->proc_status = xbt_new0(s_mc_procstate_t, state->max_pid);
+
+ //mc_stats->expanded_states++;
+ return state;
+}
+
/**
* \brief Deletes a state data structure
* \param trans The state to be deleted
#include "private.h"
#include <stdlib.h>
+XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_memory_map, mc,
+ "Logging specific to algorithms for memory_map");
+
memory_map_t get_memory_map(void)
{
FILE *fp; /* File pointer to process's proc maps file */
xbt_assert(fp,
"Cannot open /proc/self/maps to investigate the memory map of the process. Please report this bug.");
+ //XBT_DEBUG("/proc/self/maps");
+
ret = xbt_new0(s_memory_map_t, 1);
/* Read one line at the time, parse it and add it to the memory map to be returned */
while ((read = getline(&line, &n, fp)) != -1) {
+ XBT_DEBUG("%s", line);
+
/* Wipeout the new line character */
line[read - 1] = '\0';
xbt_realloc(ret->regions, sizeof(memreg) * (ret->mapsize + 1));
memcpy(ret->regions + ret->mapsize, &memreg, sizeof(memreg));
ret->mapsize++;
+
}
free(line);
#include "xbt/function_types.h"
#include "xbt/mmalloc.h"
#include "../simix/private.h"
+#include "xbt/automaton.h"
+#include "xbt/hash.h"
/****************************** Snapshots ***********************************/
typedef struct s_mc_mem_region{
+ int type;
void *start_addr;
void *data;
size_t size;
} s_mc_snapshot_t, *mc_snapshot_t;
void MC_take_snapshot(mc_snapshot_t);
+void MC_take_snapshot_liveness(mc_snapshot_t s, char *prgm);
void MC_restore_snapshot(mc_snapshot_t);
void MC_free_snapshot(mc_snapshot_t);
/* Bound of the MC depth-first search algorithm */
#define MAX_DEPTH 1000
+#define MAX_DEPTH_LIVENESS 50
int MC_deadlock_check(void);
void MC_replay(xbt_fifo_t stack);
+void MC_replay_liveness(xbt_fifo_t stack, int all_stack);
void MC_wait_for_requests(void);
void MC_get_enabled_processes();
void MC_show_deadlock(smx_req_t req);
-void MC_show_stack(xbt_fifo_t stack);
-void MC_dump_stack(xbt_fifo_t stack);
+void MC_show_deadlock_stateful(smx_req_t req);
+void MC_show_stack_safety_stateless(xbt_fifo_t stack);
+void MC_dump_stack_safety_stateless(xbt_fifo_t stack);
+void MC_show_stack_safety_stateful(xbt_fifo_t stack);
+void MC_dump_stack_safety_stateful(xbt_fifo_t stack);
/********************************* Requests ***********************************/
int MC_request_depend(smx_req_t req1, smx_req_t req2);
int MC_request_is_enabled_by_idx(smx_req_t req, unsigned int idx);
int MC_process_is_enabled(smx_process_t process);
-/********************************** DPOR **************************************/
-void MC_dpor_init(void);
-void MC_dpor(void);
-void MC_dpor_exit(void);
/******************************** States **************************************/
/* Possible exploration status of a process in a state */
multi-request like waitany ) */
} s_mc_state_t, *mc_state_t;
-extern xbt_fifo_t mc_stack;
+extern xbt_fifo_t mc_stack_safety_stateless;
mc_state_t MC_state_new(void);
void MC_state_delete(mc_state_t state);
unsigned long executed_transitions;
} s_mc_stats_t, *mc_stats_t;
+typedef struct mc_stats_pair {
+ //unsigned long pair_size;
+ unsigned long visited_pairs;
+ unsigned long expanded_pairs;
+ unsigned long executed_transitions;
+} s_mc_stats_pair_t, *mc_stats_pair_t;
+
extern mc_stats_t mc_stats;
+extern mc_stats_pair_t mc_stats_pair;
void MC_print_statistics(mc_stats_t);
+void MC_print_statistics_pairs(mc_stats_pair_t);
/********************************** MEMORY ******************************/
/* The possible memory modes for the modelchecker are standard and raw. */
memory_map_t get_memory_map(void);
+/********************************** DPOR for safety (stateless) **************************************/
+void MC_dpor_init(void);
+void MC_dpor(void);
+void MC_dpor_exit(void);
+
+/***** DPOR for safety (stateful) **** */
+
+typedef struct s_mc_state_with_snapshot{
+ mc_snapshot_t system_state;
+ mc_state_t graph_state;
+}s_mc_state_ws_t, *mc_state_ws_t;
+
+extern xbt_fifo_t mc_stack_safety_stateful;
+
+void MC_init_stateful(void);
+void MC_modelcheck_stateful(void);
+mc_state_ws_t new_state_ws(mc_snapshot_t s, mc_state_t gs);
+void MC_dpor_stateful_init(void);
+void MC_dpor_stateful(void);
+void MC_exit_stateful(void);
+
+
+/********************************** Double-DFS for liveness property**************************************/
+
+typedef struct s_mc_pair{
+ mc_snapshot_t system_state;
+ mc_state_t graph_state;
+ xbt_state_t automaton_state;
+}s_mc_pair_t, *mc_pair_t;
+
+typedef struct s_mc_pair_reached{
+ xbt_state_t automaton_state;
+ xbt_dynar_t prop_ato;
+ mc_snapshot_t system_state;
+}s_mc_pair_reached_t, *mc_pair_reached_t;
+
+typedef struct s_mc_pair_visited{
+ xbt_state_t automaton_state;
+ xbt_dynar_t prop_ato;
+ mc_snapshot_t system_state;
+ int search_cycle;
+}s_mc_pair_visited_t, *mc_pair_visited_t;
+
+int MC_automaton_evaluate_label(xbt_automaton_t a, xbt_exp_label_t l);
+mc_pair_t new_pair(mc_snapshot_t sn, mc_state_t sg, xbt_state_t st);
+
+int reached(xbt_automaton_t a, xbt_state_t st, char *prgm);
+void set_pair_reached(xbt_automaton_t a, xbt_state_t st, char *prgm);
+int snapshot_compare(mc_snapshot_t s1, mc_snapshot_t s2);
+void MC_show_stack_liveness_stateful(xbt_fifo_t stack);
+void MC_dump_stack_liveness_stateful(xbt_fifo_t stack);
+void MC_pair_delete(mc_pair_t pair);
+void MC_exit_liveness(void);
+mc_state_t MC_state_pair_new(void);
+int visited(xbt_automaton_t a, xbt_state_t st, int search_cycle, char *prgm);
+void set_pair_visited(xbt_automaton_t a, xbt_state_t st, int search_cycle, char *prgm);
+
+/* **** Double-DFS stateful without visited state **** */
+
+extern xbt_fifo_t mc_stack_liveness_stateful;
+
+void MC_ddfs_stateful_init(xbt_automaton_t a);
+void MC_ddfs_stateful(xbt_automaton_t a, int search_cycle, int restore);
+
+/* **** Double-DFS stateless **** */
+
+typedef struct s_mc_pair_stateless{
+ mc_state_t graph_state;
+ xbt_state_t automaton_state;
+ int requests;
+}s_mc_pair_stateless_t, *mc_pair_stateless_t;
+
+extern xbt_fifo_t mc_stack_liveness_stateless;
+extern mc_snapshot_t initial_snapshot_liveness;
+
+mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r);
+void MC_ddfs_stateless_init(xbt_automaton_t a, char *prgm);
+void MC_ddfs_stateless(xbt_automaton_t a, int search_cycle, int replay, char *prgm);
+void MC_show_stack_liveness_stateless(xbt_fifo_t stack);
+void MC_dump_stack_liveness_stateless(xbt_fifo_t stack);
+void MC_pair_stateless_delete(mc_pair_stateless_t pair);
+
+
+
#endif
return MSG_OK;
}
+MSG_error_t MSG_main_stateful(void)
+{
+ /* Clean IO before the run */
+ fflush(stdout);
+ fflush(stderr);
+
+ if (MC_IS_ENABLED) {
+ MC_modelcheck_stateful();
+ }
+ else {
+ SIMIX_run();
+ }
+ return MSG_OK;
+}
+
+MSG_error_t MSG_main_liveness_stateful(xbt_automaton_t a)
+{
+ /* Clean IO before the run */
+ fflush(stdout);
+ fflush(stderr);
+
+ if (MC_IS_ENABLED) {
+ MC_modelcheck_liveness_stateful(a);
+ }
+ else {
+ SIMIX_run();
+ }
+ return MSG_OK;
+}
+
+MSG_error_t MSG_main_liveness_stateless(xbt_automaton_t a, char *prgm)
+{
+ /* Clean IO before the run */
+ fflush(stdout);
+ fflush(stderr);
+
+ if (MC_IS_ENABLED) {
+ MC_modelcheck_liveness_stateless(a, prgm);
+ }
+ else {
+ SIMIX_run();
+ }
+ return MSG_OK;
+}
+
/** \ingroup msg_simulation
* \brief Kill all running process
SIMIX_host_get_name(SIMIX_process_get_host(req->issuer))
);
break;
+
}
}
--- /dev/null
+#include "xbt/automaton.h"
+
+xbt_automaton_t xbt_automaton_new_automaton(){
+ xbt_automaton_t automaton = NULL;
+ automaton = xbt_new0(struct xbt_automaton, 1);
+ automaton->states = xbt_dynar_new(sizeof(xbt_state_t), NULL);
+ automaton->transitions = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ automaton->propositional_symbols = xbt_dynar_new(sizeof(xbt_propositional_symbol_t), NULL);
+ return automaton;
+}
+
+xbt_state_t xbt_automaton_new_state(xbt_automaton_t a, int type, char* id){
+ xbt_state_t state = NULL;
+ state = xbt_new0(struct xbt_state, 1);
+ state->type = type;
+ state->id = strdup(id);
+ state->in = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ state->out = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ xbt_dynar_push(a->states, &state);
+ return state;
+}
+
+xbt_transition_t xbt_automaton_new_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst, xbt_exp_label_t label){
+ xbt_transition_t transition = NULL;
+ transition = xbt_new0(struct xbt_transition, 1);
+ if(src != NULL){
+ xbt_dynar_push(src->out, &transition);
+ transition->src = src;
+ }
+ if(dst != NULL){
+ xbt_dynar_push(dst->in, &transition);
+ transition->dst = dst;
+ }
+ transition->label = label;
+ xbt_dynar_push(a->transitions, &transition);
+ return transition;
+}
+
+xbt_exp_label_t xbt_automaton_new_label(int type, ...){
+ xbt_exp_label_t label = NULL;
+ label = xbt_new0(struct xbt_exp_label, 1);
+ label->type = type;
+
+ va_list ap;
+ va_start(ap, type);
+ switch(type){
+ case 0 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label->u.or_and.left_exp = left;
+ label->u.or_and.right_exp = right;
+ break;
+ }
+ case 1 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label->u.or_and.left_exp = left;
+ label->u.or_and.right_exp = right;
+ break;
+ }
+ case 2 : {
+ xbt_exp_label_t exp_not = va_arg(ap, xbt_exp_label_t);
+ label->u.exp_not = exp_not;
+ break;
+ }
+ case 3 :{
+ char* p = va_arg(ap, char*);
+ label->u.predicat = strdup(p);
+ break;
+ }
+ }
+ va_end(ap);
+ return label;
+}
+
+
+xbt_dynar_t xbt_automaton_get_states(xbt_automaton_t a){
+ return a->states;
+}
+
+xbt_dynar_t xbt_automaton_get_transitions(xbt_automaton_t a){
+ return a->transitions;
+}
+
+xbt_transition_t xbt_automaton_get_transition(xbt_automaton_t a, xbt_state_t src, xbt_state_t dst){
+ xbt_transition_t transition;
+ unsigned int cursor;
+ xbt_dynar_foreach(src->out, cursor, transition){
+ if((transition->src == src) && (transition->dst == dst))
+ return transition;
+ }
+ return NULL;
+}
+
+void xbt_automaton_free_automaton(xbt_automaton_t a, void_f_pvoid_t transition_free_function){
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+ xbt_transition_t transition = NULL;
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ xbt_dynar_free(&(state->out));
+ xbt_dynar_free(&(state->in));
+ }
+
+ xbt_dynar_foreach(a->transitions, cursor, transition){
+ if(transition_free_function)
+ (*transition_free_function) (transition->label);
+ }
+
+ xbt_dynar_foreach(a->states, cursor, state)
+ free(state);
+ xbt_dynar_free(&(a->states));
+
+ xbt_dynar_foreach(a->transitions, cursor, state)
+ free(transition);
+ xbt_dynar_free(&(a->transitions));
+
+ free(a);
+
+ return;
+}
+
+void xbt_automaton_free_state(xbt_automaton_t a, xbt_state_t s, void_f_pvoid_t transition_free_function){
+ unsigned long nbr;
+ unsigned long i;
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+ xbt_transition_t transition = NULL;
+
+ nbr = xbt_dynar_length(a->transitions);
+ for(i = 0; i <nbr; i++){
+ xbt_dynar_get_cpy(a->transitions, cursor, &transition);
+ if((transition->src == s) || (transition->dst == s)){
+ xbt_automaton_free_transition(a, transition, transition_free_function);
+ }else{
+ cursor++;
+ }
+ }
+
+ cursor = 0;
+ xbt_dynar_foreach(a->states, cursor, state)
+ if(state == s)
+ xbt_dynar_cursor_rm(a->states, &cursor);
+
+ xbt_dynar_free(&(s->in));
+ xbt_dynar_free(&(s->out));
+
+ free(s);
+
+ return;
+}
+
+void xbt_automaton_free_transition(xbt_automaton_t a, xbt_transition_t t, void_f_pvoid_t transition_free_function){
+ int index;
+ unsigned int cursor = 0;
+ xbt_transition_t transition = NULL;
+
+ if((transition_free_function) && (t->label))
+ (*transition_free_function) (t->label);
+
+ xbt_dynar_foreach(a->transitions, cursor, transition) {
+ if(transition == t){
+ index = __xbt_find_in_dynar(transition->dst->in, transition);
+ xbt_dynar_remove_at(transition->dst->in, index, NULL);
+ index = __xbt_find_in_dynar(transition->src->out, transition);
+ xbt_dynar_remove_at(transition->src->out, index, NULL);
+ xbt_dynar_cursor_rm(a->transitions, & cursor);
+ free(transition);
+ break;
+ }
+ }
+}
+
+xbt_state_t xbt_automaton_transition_get_source(xbt_transition_t t){
+ return t->src;
+}
+
+xbt_state_t xbt_automaton_transition_get_destination(xbt_transition_t t){
+ return t->dst;
+}
+
+void xbt_automaton_transition_set_source(xbt_transition_t t, xbt_state_t src){
+ t->src = src;
+ xbt_dynar_push(src->out,&t);
+}
+
+void xbt_automaton_transition_set_destination(xbt_transition_t t, xbt_state_t dst){
+ t->dst = dst;
+ xbt_dynar_push(dst->in,&t);
+}
+
+xbt_dynar_t xbt_automaton_state_get_out_transitions(xbt_state_t s){
+ return s->out;
+}
+
+xbt_dynar_t xbt_automaton_state_get_in_transitions(xbt_state_t s){
+ return s->in;
+}
+
+xbt_state_t xbt_automaton_state_exists(xbt_automaton_t a, char *id){
+ xbt_state_t state = NULL;
+ unsigned int cursor = 0;
+ xbt_dynar_foreach(a->states, cursor, state){
+ if(strcmp(state->id, id)==0)
+ return state;
+ }
+ return NULL;
+}
+
+void xbt_automaton_display(xbt_automaton_t a){
+ unsigned int cursor = 0;
+ xbt_state_t state = NULL;
+
+ printf("\n\nEtat courant : %s\n", a->current_state->id);
+
+ printf("\nListe des états : %lu\n\n", xbt_dynar_length(a->states));
+
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ printf("ID : %s, type : %d\n", state->id, state->type);
+ }
+
+ cursor=0;
+ xbt_transition_t transition = NULL;
+ printf("\nListe des transitions : %lu\n\n", xbt_dynar_length(a->transitions));
+
+ xbt_dynar_foreach(a->transitions, cursor, transition){
+ printf("label :");
+ xbt_automaton_display_exp(transition->label);
+ printf(", %s -> %s\n", transition->src->id, transition->dst->id);
+ }
+}
+
+void xbt_automaton_display_exp(xbt_exp_label_t label){
+
+ switch(label->type){
+ case 0 :
+ printf("(");
+ xbt_automaton_display_exp(label->u.or_and.left_exp);
+ printf(" || ");
+ xbt_automaton_display_exp(label->u.or_and.right_exp);
+ printf(")");
+ break;
+ case 1 :
+ printf("(");
+ xbt_automaton_display_exp(label->u.or_and.left_exp);
+ printf(" && ");
+ xbt_automaton_display_exp(label->u.or_and.right_exp);
+ printf(")");
+ break;
+ case 2 :
+ printf("(!");
+ xbt_automaton_display_exp(label->u.exp_not);
+ printf(")");
+ break;
+ case 3 :
+ printf("(%s)",label->u.predicat);
+ break;
+ case 4 :
+ printf("(1)");
+ break;
+ }
+
+}
+
+xbt_state_t xbt_automaton_get_current_state(xbt_automaton_t a){
+ return a->current_state;
+}
+
+xbt_propositional_symbol_t xbt_new_propositional_symbol(xbt_automaton_t a, const char* id, void* fct){
+ xbt_propositional_symbol_t prop_symb = NULL;
+ prop_symb = xbt_new0(struct xbt_propositional_symbol, 1);
+ prop_symb->pred = strdup(id);
+ prop_symb->function = fct;
+ xbt_dynar_push(a->propositional_symbols, &prop_symb);
+ return prop_symb;
+}
+
+int automaton_state_compare(xbt_state_t s1, xbt_state_t s2){
+
+ /* single id for each state, id and type sufficient for comparison*/
+
+ if(strcmp(s1->id, s2->id))
+ return 1;
+
+ if(s1->type != s2->type)
+ return 1;
+
+ return 0;
+
+}
+
+int automaton_transition_compare(const void *t1, const void *t2){
+
+ if(automaton_state_compare(((xbt_transition_t)t1)->src, ((xbt_transition_t)t2)->src))
+ return 1;
+
+ if(automaton_state_compare(((xbt_transition_t)t1)->dst, ((xbt_transition_t)t2)->dst))
+ return 1;
+
+ if(automaton_label_transition_compare(((xbt_transition_t)t1)->label,((xbt_transition_t)t2)->label))
+ return 1;
+
+ return 0;
+
+}
+
+int automaton_label_transition_compare(xbt_exp_label_t l1, xbt_exp_label_t l2){
+
+ if(l1->type != l2->type)
+ return 1;
+
+ switch(l1->type){
+
+ case 0 : // OR
+ case 1 : // AND
+ if(automaton_label_transition_compare(l1->u.or_and.left_exp, l2->u.or_and.left_exp))
+ return 1;
+ else
+ return automaton_label_transition_compare(l1->u.or_and.right_exp, l2->u.or_and.right_exp);
+ break;
+
+ case 2 : // NOT
+ return automaton_label_transition_compare(l1->u.exp_not, l2->u.exp_not);
+ break;
+
+ case 3 : // predicat
+ return (strcmp(l1->u.predicat, l2->u.predicat));
+ break;
+
+ case 4 : // 1
+ return 0;
+ break;
+
+ default :
+ return -1;
+ break;
+
+ }
+
+}
+
+
+int propositional_symbols_compare_value(xbt_dynar_t s1, xbt_dynar_t s2){
+
+ int *iptr1, *iptr2;
+ unsigned int cursor;
+ unsigned int nb_elem = xbt_dynar_length(s1);
+
+ for(cursor=0;cursor<nb_elem;cursor++){
+ iptr1 = xbt_dynar_get_ptr(s1, cursor);
+ iptr2 = xbt_dynar_get_ptr(s2, cursor);
+ if(*iptr1 != *iptr2)
+ return 1;
+ }
+
+ return 0;
+}
--- /dev/null
+#include "xbt/automatonparse_promela.h"
+
+char* state_id_src;
+
+void init(){
+ automaton = xbt_automaton_new_automaton();
+}
+
+void new_state(char* id, int src){
+
+ char* id_state = strdup(id);
+ char* first_part = strtok(id,"_");
+ int type = 0 ; // -1=état initial, 0=état intermédiaire, 1=état final
+
+ if(strcmp(first_part,"accept")==0){
+ type = 1;
+ }else{
+ char* second_part = strtok(NULL,"_");
+ if(strcmp(second_part,"init")==0){
+ type = -1;
+ }
+ }
+
+ xbt_state_t state = NULL;
+ state = xbt_automaton_state_exists(automaton, id_state);
+ if(state == NULL){
+ state = xbt_automaton_new_state(automaton, type, id_state);
+ }
+
+ if(type==-1)
+ automaton->current_state = state;
+
+ if(src)
+ state_id_src = strdup(id_state);
+
+}
+
+void new_transition(char* id, xbt_exp_label_t label){
+
+ char* id_state = strdup(id);
+ xbt_state_t state_dst = NULL;
+ new_state(id, 0);
+ state_dst = xbt_automaton_state_exists(automaton, id_state);
+ xbt_state_t state_src = xbt_automaton_state_exists(automaton, state_id_src);
+
+ //xbt_transition_t trans = NULL;
+ xbt_automaton_new_transition(automaton, state_src, state_dst, label);
+
+}
+
+xbt_exp_label_t new_label(int type, ...){
+ xbt_exp_label_t label = NULL;
+ va_list ap;
+ va_start(ap,type);
+ switch(type){
+ case 0 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label = xbt_automaton_new_label(type, left, right);
+ break;
+ }
+ case 1 : {
+ xbt_exp_label_t left = va_arg(ap, xbt_exp_label_t);
+ xbt_exp_label_t right = va_arg(ap, xbt_exp_label_t);
+ label = xbt_automaton_new_label(type, left, right);
+ break;
+ }
+ case 2 : {
+ xbt_exp_label_t exp_not = va_arg(ap, xbt_exp_label_t);
+ label = xbt_automaton_new_label(type, exp_not);
+ break;
+ }
+ case 3 : {
+ char* p = va_arg(ap, char*);
+ label = xbt_automaton_new_label(type, p);
+ break;
+ }
+ case 4 : {
+ label = xbt_automaton_new_label(type);
+ break;
+ }
+ }
+ va_end(ap);
+ return label;
+}
+
+xbt_automaton_t get_automaton(){
+ return automaton;
+}
+
+
+
return (dynar ? (unsigned long) dynar->used : (unsigned long) 0);
}
-/**@brief check if a dynar is empty
+ /**@brief check if a dynar is empty
*
*\param dynar the dynat we want to check
*/
#include "mmprivate.h"
#include "gras_config.h"
+XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_mm_legacy, xbt,
+ "Logging specific to mm_legacy in mmalloc");
+
static void *__mmalloc_current_heap = NULL; /* The heap we are currently using. */
#include "xbt_modinter.h"
// mmalloc_detach(__mmalloc_default_mdp);
mmalloc_pre_detach(__mmalloc_default_mdp);
}
+
+int mmalloc_compare_heap(void *h1, void *h2){
+
+ if(h1 == NULL && h2 == NULL){
+ XBT_DEBUG("Malloc descriptors null");
+ return 0;
+ }
+
+
+ /* Heapstats */
+
+ struct mstats ms1 = mmstats(h1);
+ struct mstats ms2 = mmstats(h2);
+
+ if(ms1.bytes_total != ms2.bytes_total){
+ XBT_DEBUG("Different total size of the heap");
+ return 1;
+ }
+
+ if(ms1.chunks_used != ms2.chunks_used){
+ XBT_DEBUG("Different chunks allocated by the user");
+ return 1;
+ }
+
+ if(ms1.bytes_used != ms2.bytes_used){
+ XBT_DEBUG("Different byte total of user-allocated chunks");
+ return 1;
+ }
+
+ if(ms1.bytes_free != ms2.bytes_free){
+ XBT_DEBUG("Different byte total of chunks in the free list");
+ return 1;
+ }
+
+ if(ms1.chunks_free != ms2.chunks_free){
+ XBT_DEBUG("Different chunks in the free list");
+ return 1;
+ }
+
+ struct mdesc *mdp1, *mdp2;
+ mdp1 = MD_TO_MDP(h1);
+ mdp2 = MD_TO_MDP(h2);
+
+ if(mmalloc_compare_mdesc(mdp1, mdp2))
+ return 1;
+
+
+ return 0;
+}
+
+int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){
+
+ struct mdesc* mdp;
+
+
+ if(mdp1->headersize != mdp2->headersize){
+ XBT_DEBUG("Different size of the file header for the mapped files");
+ return 1;
+ }
+
+ if(mdp1->refcount != mdp2->refcount){
+ XBT_DEBUG("Different number of processes that attached the heap");
+ return 1;
+ }
+
+ if(strcmp(mdp1->magic, mdp2->magic) != 0){
+ XBT_DEBUG("Different magic number");
+ return 1;
+ }
+
+ if(mdp1->flags != mdp2->flags){
+ XBT_DEBUG("Different flags");
+ return 1;
+ }
+
+ if(mdp1->heapsize != mdp2->heapsize){
+ XBT_DEBUG("Different number of info entries");
+ return 1;
+ }
+
+ // XBT_DEBUG("Heap size : %Zu", mdp1->heapsize);
+
+ if(mdp1->heapbase != mdp2->heapbase){
+ XBT_DEBUG("Different first block of the heap");
+ return 1;
+ }
+
+
+ if(mdp1->heapindex != mdp2->heapindex){
+ XBT_DEBUG("Different index for the heap table");
+ return 1;
+ }
+
+ //XBT_DEBUG("Heap index : %Zu", mdp1->heapindex);
+
+ if(mdp1->base != mdp2->base){
+ XBT_DEBUG("Different base address of the memory region");
+ return 1;
+ }
+
+ if(mdp1->breakval != mdp2->breakval){
+ XBT_DEBUG("Different current location in the memory region");
+ return 1;
+ }
+
+ if(mdp1->top != mdp2->top){
+ XBT_DEBUG("Different end of the current location in the memory region");
+ return 1;
+ }
+
+ if(mdp1->heaplimit != mdp2->heaplimit){
+ XBT_DEBUG("Different limit of valid info table indices");
+ return 1;
+ }
+
+ //XBT_DEBUG("Heap limit : %Zu", mdp1->heaplimit);
+
+
+ if(mdp1->fd != mdp2->fd){
+ XBT_DEBUG("Different file descriptor for the file to which this malloc heap is mapped");
+ return 1;
+ }
+
+ if(mdp1->saved_errno != mdp2->saved_errno){
+ XBT_DEBUG("Different errno");
+ return 1;
+ }
+
+ if(mdp1->version != mdp2->version){
+ XBT_DEBUG("Different version of the mmalloc package");
+ return 1;
+ }
+
+
+ size_t block_free1, block_free2 , next_block_free, first_block_free ;
+ size_t i, j;
+ void *addr_block1, *addr_block2;
+
+
+
+ /* Search index of the first free block */
+
+ block_free1 = mdp1->heapindex;
+ block_free2 = mdp2->heapindex;
+
+ while(mdp1->heapinfo[block_free1].free.prev != 0){
+ block_free1 = mdp1->heapinfo[block_free1].free.prev;
+ }
+
+ while(mdp2->heapinfo[block_free2].free.prev != 0){
+ block_free2 = mdp1->heapinfo[block_free2].free.prev;
+ }
+
+ if(block_free1 != block_free2){
+ XBT_DEBUG("Different first free block");
+ return 1;
+ }
+
+ first_block_free = block_free1;
+
+ if(mdp1->heapinfo[block_free1].free.size != mdp2->heapinfo[block_free2].free.size){
+ XBT_DEBUG("Different size (in blocks) of the first free cluster");
+ return 1;
+ }
+
+ /* Check busy blocks (circular checking)*/
+
+ i = block_free1 + mdp1->heapinfo[block_free1].free.size;
+ next_block_free = mdp1->heapinfo[block_free1].free.next;
+
+ if(next_block_free == 0)
+ next_block_free = mdp1->heaplimit;
+
+
+ while(i != first_block_free){
+
+ while(i<next_block_free){
+
+ j = i;
+
+ if(mdp1->heapinfo[i].busy.type != mdp2->heapinfo[i].busy.type){
+ XBT_DEBUG("Different type of busy block");
+ return 1;
+ }else{
+ if(i == 0)
+ j++;
+ mdp = mdp1;
+ addr_block1 = ADDRESS(j);
+ mdp = mdp2;
+ addr_block2 = ADDRESS(j);
+ switch(mdp1->heapinfo[i].busy.type){
+ case 0 :
+ if(mdp1->heapinfo[i].busy.info.size != mdp2->heapinfo[i].busy.info.size){
+ XBT_DEBUG("Different size of a large cluster");
+ return 1;
+ }else{
+ XBT_DEBUG("Block : %Zu", i);
+ if(memcmp(addr_block1, addr_block2, (mdp1->heapinfo[i].busy.info.size * BLOCKSIZE)) != 0){
+ XBT_DEBUG("Different data in block %Zu", i);
+ return 1;
+ }
+ }
+ i = i+mdp1->heapinfo[i].busy.info.size;
+ break;
+ default :
+ if(mdp1->heapinfo[i].busy.info.frag.nfree != mdp2->heapinfo[i].busy.info.frag.nfree){
+ XBT_DEBUG("Different free fragments in a fragmented block");
+ return 1;
+ }else{
+ if(mdp1->heapinfo[i].busy.info.frag.first != mdp2->heapinfo[i].busy.info.frag.first){
+ XBT_DEBUG("Different first free fragments of the block");
+ return 1;
+ }else{
+ if(memcmp(addr_block1, addr_block2, BLOCKSIZE) != 0){
+ XBT_DEBUG("Different data in fragmented block %Zu", i);
+ return 1;
+ }
+ }
+ }
+ i++;
+ break;
+ }
+ }
+ }
+
+
+ block_free1 = mdp1->heapinfo[block_free1].free.next;
+ next_block_free = mdp1->heapinfo[block_free1].free.next;
+ if(i != first_block_free){
+ if(block_free1 != 0)
+ i = block_free1 + mdp1->heapinfo[block_free1].free.size;
+ else
+ i = 0;
+ }
+
+ }
+
+ return 0;
+
+
+}
+
+
+
+
+
};
+int mmalloc_compare_heap(void *h1, void *h2);
+
+int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2);
+
/* Bits to look at in the malloc descriptor flags word */
#define MMALLOC_DEVZERO (1 << 0) /* Have mapped to /dev/zero */
