From: Martin Quinson Date: Mon, 9 Jan 2012 17:16:57 +0000 (+0100) Subject: Merge branches 'MC_LTL' and 'MC_LTL' of scm.gforge.inria.fr:/gitroot/simgrid/simgrid X-Git-Tag: exp_20120216~174 X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/commitdiff_plain/6b188a3ca7fe91cf125a08229fb4fe51eee26e6d?hp=90453ba7d6d9e02b008bca1e1fa2b4ad3b06ca6b Merge branches 'MC_LTL' and 'MC_LTL' of scm.gforge.inria.fr:/gitroot/simgrid/simgrid --- diff --git a/buildtools/Cmake/DefinePackages.cmake b/buildtools/Cmake/DefinePackages.cmake index fac0192ae0..fd54e3d654 100644 --- a/buildtools/Cmake/DefinePackages.cmake +++ b/buildtools/Cmake/DefinePackages.cmake @@ -16,6 +16,7 @@ set(EXTRA_DIST src/xbt/backtrace_windows.c src/xbt/backtrace_dummy.c src/xbt/setset_private.h + src/xbt/automatonparse_promela.c src/xbt/mmalloc/attach.c src/xbt/mmalloc/detach.c src/xbt/mmalloc/keys.c @@ -179,6 +180,7 @@ set(XBT_SRC src/xbt/parmap.c src/xbt/xbt_replay_trace_reader.c src/xbt/lib.c + src/xbt/automaton.c ) if(HAVE_MMAP) @@ -365,6 +367,7 @@ set(MC_SRC src/mc/mc_dpor.c src/mc/mc_request.c src/mc/private.h + src/mc/mc_liveness.c ) set(RNGSTREAM_SRC @@ -407,6 +410,8 @@ set(headers_to_install 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 diff --git a/examples/msg/chord/CMakeLists.txt b/examples/msg/chord/CMakeLists.txt index f64019ffc2..91c86c5b52 100644 --- a/examples/msg/chord/CMakeLists.txt +++ b/examples/msg/chord/CMakeLists.txt @@ -3,7 +3,8 @@ cmake_minimum_required(VERSION 2.6) 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) diff --git a/examples/msg/chord/chord_stateful.c b/examples/msg/chord/chord_stateful.c new file mode 100644 index 0000000000..481da7ab1c --- /dev/null +++ b/examples/msg/chord/chord_stateful.c @@ -0,0 +1,948 @@ + +/* 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 +#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; +} diff --git a/examples/msg/mc/CMakeLists.txt b/examples/msg/mc/CMakeLists.txt index b497e843f4..bae8896280 100644 --- a/examples/msg/mc/CMakeLists.txt +++ b/examples/msg/mc/CMakeLists.txt @@ -4,12 +4,24 @@ set(EXECUTABLE_OUTPUT_PATH "${CMAKE_CURRENT_BINARY_DIR}") 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 ) \ No newline at end of file diff --git a/examples/msg/mc/automaton.c b/examples/msg/mc/automaton.c new file mode 100644 index 0000000000..8f189a8cf0 --- /dev/null +++ b/examples/msg/mc/automaton.c @@ -0,0 +1,358 @@ +#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 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 +#include +#include +#include +#include + +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 diff --git a/examples/msg/mc/automaton2_PROMELA b/examples/msg/mc/automaton2_PROMELA new file mode 100644 index 0000000000..ba1afdadf2 --- /dev/null +++ b/examples/msg/mc/automaton2_PROMELA @@ -0,0 +1,11 @@ +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 diff --git a/examples/msg/mc/automaton_PROMELA b/examples/msg/mc/automaton_PROMELA new file mode 100644 index 0000000000..2d0a31203d --- /dev/null +++ b/examples/msg/mc/automaton_PROMELA @@ -0,0 +1,28 @@ +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; +} diff --git a/examples/msg/mc/automatonparse_promela.c b/examples/msg/mc/automatonparse_promela.c new file mode 100644 index 0000000000..88c2cafa53 --- /dev/null +++ b/examples/msg/mc/automatonparse_promela.c @@ -0,0 +1,92 @@ +#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; +} + + + diff --git a/examples/msg/mc/automatonparse_promela.h b/examples/msg/mc/automatonparse_promela.h new file mode 100644 index 0000000000..cb4fc9cb54 --- /dev/null +++ b/examples/msg/mc/automatonparse_promela.h @@ -0,0 +1,26 @@ +#ifndef _XBT_AUTOMATONPARSE_PROMELA_H +#define _XBT_AUTOMATONPARSE_PROMELA_H + +#include +#include +#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 diff --git a/examples/msg/mc/bugged1_stateful.c b/examples/msg/mc/bugged1_stateful.c new file mode 100644 index 0000000000..cb4ec29fe8 --- /dev/null +++ b/examples/msg/mc/bugged1_stateful.c @@ -0,0 +1,65 @@ +/******************** 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 +#include +#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 diff --git a/examples/msg/mc/bugged2_stateful.c b/examples/msg/mc/bugged2_stateful.c new file mode 100644 index 0000000000..6b4597d6c9 --- /dev/null +++ b/examples/msg/mc/bugged2_stateful.c @@ -0,0 +1,79 @@ +/******************** 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 +#include +#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; +} diff --git a/examples/msg/mc/deploy_mutex.xml b/examples/msg/mc/deploy_mutex.xml index 1afcee4b17..68c3234813 100644 --- a/examples/msg/mc/deploy_mutex.xml +++ b/examples/msg/mc/deploy_mutex.xml @@ -14,7 +14,7 @@ - + + diff --git a/examples/msg/mc/example_liveness_with_cycle.c b/examples/msg/mc/example_liveness_with_cycle.c new file mode 100644 index 0000000000..8f516874e3 --- /dev/null +++ b/examples/msg/mc/example_liveness_with_cycle.c @@ -0,0 +1,142 @@ +/***************** 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 10 + +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(automaton, argv[0]); + + return 0; +} diff --git a/examples/msg/mc/example_liveness_with_cycle.h b/examples/msg/mc/example_liveness_with_cycle.h new file mode 100644 index 0000000000..c614af2317 --- /dev/null +++ b/examples/msg/mc/example_liveness_with_cycle.h @@ -0,0 +1,14 @@ +#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 diff --git a/examples/msg/mc/example_liveness_with_cycle2.c b/examples/msg/mc/example_liveness_with_cycle2.c new file mode 100644 index 0000000000..148afb47e4 --- /dev/null +++ b/examples/msg/mc/example_liveness_with_cycle2.c @@ -0,0 +1,140 @@ +/***************** 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(automaton, argv[0]); + + return 0; +} diff --git a/examples/msg/mc/lex.yy.c b/examples/msg/mc/lex.yy.c new file mode 100644 index 0000000000..78d770306f --- /dev/null +++ b/examples/msg/mc/lex.yy.c @@ -0,0 +1,1928 @@ + +#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 +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . 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 +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 +#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 +#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" + + + + + diff --git a/examples/msg/mc/parserPromela.lex b/examples/msg/mc/parserPromela.lex new file mode 100644 index 0000000000..187d1ba73e --- /dev/null +++ b/examples/msg/mc/parserPromela.lex @@ -0,0 +1,79 @@ +%option noyywrap + +%{ + + +#include +#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"); } + +%% + + diff --git a/examples/msg/mc/parserPromela.yacc b/examples/msg/mc/parserPromela.yacc new file mode 100644 index 0000000000..f018f80d86 --- /dev/null +++ b/examples/msg/mc/parserPromela.yacc @@ -0,0 +1,76 @@ +%{ + +#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 LITT_ENT +%token LITT_CHAINE +%token LITT_REEL +%token ID + +%type