Colony

/**

 * @file Command.cpp

 *

 * @author Jason Knichel

 * @date 10/9/07

 *

 * @todo make it so command doesn't rely on connection pool.  have methods

 *       that may return a response return it by getting a response array passed in to them

 *       that they fill in and then colonet server takes the contents of that response array

 *       and sends it to the appropriate client

 */

#include <colonet_wireless.h>

#include <ctype.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include "includes/Command.h"

#include "includes/ConnectionPool.h"

Command::Command(ConnectionPool * connection_pool_temp) {

  connection_pool = connection_pool_temp;

}

Command::~Command() {

}

int Command::parse_command(char* command, int pool_index) {

  char tokens[MAX_TOKENS][MAX_TOKEN_SIZE];

  int number_tokens = 0;

  char* end_pointer = NULL;

  int command_id;

  if (!connection_pool) {

    return -1;

  }

  if (!command) {

    return -1;

  }

  if (pool_index < 0) {

    return -1;

  }

  if ((number_tokens = tokenize_command(command, tokens)) < 0) {

    return -1;

  }

  //the 10 in the function call indicates number is base 10

  command_id = strtol(tokens[0], &end_pointer, 10);

  if (!end_pointer || *end_pointer != '\0') {

    printf("There was an error converting first token into a number.\n");

    return -1;

  }

  if (command_id == SEND_TO_ROBOT) {

    if (parse_send_to_robot(number_tokens, tokens, pool_index)) {

      return -1;

    }

  } else if (command_id == REQUEST_FROM_SERVER) {

    if (parse_request_from_server(number_tokens, tokens, pool_index)) {

      return -1;

    }

  }

  return 0;

}

/**

 * @brief Breaks a command up into tokens

 *

 * @param command The command to tokenize

 * @param tokens A two dimensional character array to store the tokens in

 *

 * @return 0 on success, negative error code on failure

 */

int Command::tokenize_command(char* command, char tokens[MAX_TOKENS][MAX_TOKEN_SIZE]) {

  char* next_token = command;

  char* end_token = NULL;

  int number_tokens = 0;

  if (!command) {

    return -1;

  }

  while ((end_token = strstr(next_token, " "))) {

    *end_token = '\0';

    if (strlen(next_token) > MAX_TOKEN_SIZE-1) {

      return -1;

    }

    strcpy(tokens[number_tokens], next_token);

    number_tokens++;

    next_token = end_token + 1;

    while (isspace(*next_token) && *next_token != '\0') {

      next_token++;

    }

  }

  if (end_token == NULL && *next_token != '\0') {

    if (strlen(next_token) > MAX_TOKEN_SIZE-1) {

      return -1;

    }

    strcpy(tokens[number_tokens], next_token);

    number_tokens++;

  }

  return number_tokens;

}

/** 

 * @brief checks a list of tokens to see if it's valid

 *

 * @param tokens The tokens to check

 * @param number_tokens The number of tokens contained in the tokens parameter

 *

 * @return 0 if tokens is valid

 */

int Command::check_tokens(unsigned char* tokens, int number_tokens) {

  if (number_tokens > 3 + PACKET_DATA_LEN) {

    /* Too many tokens */

    return -1;

  }

  if (number_tokens < 3) {

    /* Not enough tokens */

    return -1;

  }

  if (tokens[1] != COLONET_REQUEST && tokens[1] != COLONET_COMMAND) {

    /* Invalid message type */

    return -1;

  }

  return 0;

}

int Command::parse_send_to_robot(int number_tokens, char tokens[MAX_TOKENS][MAX_TOKEN_SIZE], int pool_index) {

  int i;

  unsigned char int_tokens[MAX_TOKENS];

  int number_int_tokens = number_tokens;

  unsigned char arguments[PACKET_DATA_LEN];

  memset(arguments, 1, PACKET_DATA_LEN);

  // Convert tokens to ints 

  for (i = ROBOT_COMMAND_OFFSET; i < number_int_tokens; i++) {

    int_tokens[i-ROBOT_COMMAND_OFFSET] = atoi(tokens[i]);

  }

  // Fill arguments buffer with arguments 

  for (i = ROBOT_COMMAND_LEN; i < number_int_tokens-ROBOT_COMMAND_OFFSET; i++) {

    arguments[i-ROBOT_COMMAND_LEN] = int_tokens[i];

  }

  // Check the tokens 

  if (check_tokens(int_tokens, number_int_tokens) < 0) {

    fprintf(stderr, "%s: Error - Invalid robot command/request.\n", __FUNCTION__);

    return -1;

  }

  // Send packet to robot 

  fprintf(stderr, "Calling colonet_wl_send(%d, %d, %d, arguments)\n", int_tokens[0], int_tokens[1], int_tokens[2]);

  colonet_wl_send(pool_index, int_tokens[0], (ColonetMessageType)int_tokens[1], int_tokens[2], arguments);

  return 0;

}

int Command::parse_request_from_server(int number_tokens, char tokens[MAX_TOKENS][MAX_TOKEN_SIZE], int pool_index) {

  char* end_pointer = NULL;

  if (!connection_pool) {

    return -1;

  }

  if (number_tokens < 2) {

    return -1;

  }

  end_pointer=NULL;

  int second_token = strtol(tokens[1], &end_pointer, 10);

  if (!end_pointer || *end_pointer != '\0') {

    printf("There was an error converting second token into a number.\n");

    return -1;

  }

  if (second_token == REQUEST_BOM_MATRIX) {

    if (parse_request_bom_matrix(pool_index)) {

      return -1;

    }

  } else if (second_token == REQUEST_XBEE_IDS) {

    if (parse_request_xbee_ids(pool_index)) {

      return -1;

    }

  } else {

    char * my_current_message = "Hi, how are you?\n";

    printf("Sending %s\n", my_current_message);

    connection_pool->write_to_client(pool_index, my_current_message, strlen(my_current_message));

  }

  return 0;

}

int Command::parse_request_bom_matrix(int pool_index) {

  char response_bom_matrix_buffer[MAX_RESPONSE_LEN];

  char temp_bom_matrix_buffer[MAX_RESPONSE_LEN];

  if (!connection_pool) {

    return -1;

  }

  //TODO: change after we start keeping track of bom matrix

  /*

  int number_robots = rand()%10;

  int bom_matrix[number_robots][number_robots];

  for (int ii = 0; ii < number_robots; ii++) {

    for (int j = 0; j < number_robots; j++) {

      //do this to generate some -1 values which mean they can't see each other

      int matrix_value = rand()%(number_robots+1)-1;

      bom_matrix[ii][j] = matrix_value;

    }

  }

  */

  int number_robots = 3;

  int bom_matrix[number_robots][number_robots];

  for (int ii = 0; ii < number_robots; ii++) {

    for (int j = 0; j < number_robots; j++) {

      bom_matrix[ii][j] = ((ii*3+j)%17)-1;

    }

  }

  printf("number of robots is %d\n", number_robots);

  //TODO: make this better

  //TODO: make sure I don't need to do MAX_RESPONSE_LENGTH-1

  snprintf(response_bom_matrix_buffer,MAX_RESPONSE_LEN, "%d %d %d", RESPONSE_TO_CLIENT_REQUEST, REQUEST_BOM_MATRIX, number_robots);

  for (int ii = 0; ii < number_robots; ii++) {

    for (int j = 0; j < number_robots; j++) {

      //TODO: don't use strcpy

      strcpy(temp_bom_matrix_buffer, response_bom_matrix_buffer);

      //TODO: put length checking in here so array doesn't go out of bounds

      //TODO: maybe use strncat?

      strcat(temp_bom_matrix_buffer," %d");

      snprintf(response_bom_matrix_buffer, MAX_RESPONSE_LEN, temp_bom_matrix_buffer, bom_matrix[ii][j]);

    }

  }

  strcat(response_bom_matrix_buffer,"\n");

  connection_pool->write_to_client(pool_index, response_bom_matrix_buffer, strlen(response_bom_matrix_buffer));

  printf("Sending %s", response_bom_matrix_buffer);

  return 0;

}

int Command::parse_request_xbee_ids(int pool_index) {

  //TODO: make this better

  //TODO: change when we actually know this data

  //int number_robots = rand() % 10;

  int number_robots = 3;

  char xbee_id_buffer[MAX_RESPONSE_LEN];

  char temp_xbee_id_buffer[MAX_RESPONSE_LEN];

  if (!connection_pool) {

    return -1;

  }

  snprintf(xbee_id_buffer, MAX_RESPONSE_LEN, "%d %d %d", RESPONSE_TO_CLIENT_REQUEST, REQUEST_XBEE_IDS, number_robots);

  printf("number of robots is %d\n", number_robots);

  for (int ii = 0; ii < number_robots; ii++) {

    strcpy(temp_xbee_id_buffer, xbee_id_buffer);

    //TODO: put length checking in here so array doesn't go out of bounds

    //TODO: maybe use strncat?

    strcat(temp_xbee_id_buffer, " %d");

    snprintf(xbee_id_buffer, MAX_RESPONSE_LEN, temp_xbee_id_buffer, ii);

  }

  strcat(xbee_id_buffer, "\n");

  connection_pool->write_to_client(pool_index, xbee_id_buffer, strlen(xbee_id_buffer));

  printf("Sending %s", xbee_id_buffer);

  return 0;

}