2010-03-30 02:54:03 +00:00
|
|
|
/* MSPDebug - debugging tool for MSP430 MCUs
|
2010-01-08 05:03:51 +00:00
|
|
|
* Copyright (C) 2009, 2010 Daniel Beer
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
2010-03-30 02:54:03 +00:00
|
|
|
#include <ctype.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <errno.h>
|
2010-04-10 00:25:01 +00:00
|
|
|
#include <assert.h>
|
2012-08-14 03:51:22 +00:00
|
|
|
#include <time.h>
|
2010-03-30 02:54:03 +00:00
|
|
|
|
2012-04-24 23:02:22 +00:00
|
|
|
#ifdef __Windows__
|
2011-07-26 13:51:06 +00:00
|
|
|
#include <windows.h>
|
|
|
|
#endif
|
|
|
|
|
2013-12-06 07:01:27 +00:00
|
|
|
#include "ctrlc.h"
|
2010-01-08 05:03:51 +00:00
|
|
|
#include "util.h"
|
2010-08-16 23:07:03 +00:00
|
|
|
#include "output.h"
|
2010-03-30 02:54:03 +00:00
|
|
|
|
2010-04-21 02:12:12 +00:00
|
|
|
char *get_arg(char **text)
|
|
|
|
{
|
|
|
|
char *start;
|
|
|
|
char *rewrite;
|
|
|
|
char *end;
|
|
|
|
int qstate = 0;
|
|
|
|
int qval = 0;
|
|
|
|
|
|
|
|
if (!text)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
start = *text;
|
|
|
|
while (*start && isspace(*start))
|
|
|
|
start++;
|
|
|
|
|
|
|
|
if (!*start)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* We've found the start of the argument. Parse it. */
|
|
|
|
end = start;
|
|
|
|
rewrite = start;
|
|
|
|
while (*end) {
|
|
|
|
switch (qstate) {
|
|
|
|
case 0: /* Bare */
|
|
|
|
if (isspace(*end))
|
|
|
|
goto out;
|
|
|
|
else if (*end == '"')
|
|
|
|
qstate = 1;
|
2018-02-27 21:55:05 +00:00
|
|
|
else if (*end == '\'')
|
|
|
|
qstate = 2;
|
2010-04-21 02:12:12 +00:00
|
|
|
else
|
|
|
|
*(rewrite++) = *end;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 1: /* In quotes */
|
|
|
|
if (*end == '"')
|
|
|
|
qstate = 0;
|
2018-02-27 21:55:05 +00:00
|
|
|
else if (*end == '\'')
|
|
|
|
qstate = 3;
|
2010-04-21 02:12:12 +00:00
|
|
|
else if (*end == '\\')
|
2018-02-27 21:55:05 +00:00
|
|
|
qstate = 4;
|
|
|
|
else
|
|
|
|
*(rewrite++) = *end;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 2: /* In quote (verbatim) */
|
|
|
|
case 3:
|
|
|
|
if (*end == '\'')
|
|
|
|
qstate -= 2;
|
2010-04-21 02:12:12 +00:00
|
|
|
else
|
|
|
|
*(rewrite++) = *end;
|
|
|
|
break;
|
|
|
|
|
2018-02-27 21:55:05 +00:00
|
|
|
case 4: /* Backslash */
|
2010-04-21 02:12:12 +00:00
|
|
|
if (*end == '\\')
|
|
|
|
*(rewrite++) = '\\';
|
2018-02-27 22:18:57 +00:00
|
|
|
else if (*end == '\'')
|
|
|
|
*(rewrite++) = '\'';
|
2010-04-21 02:12:12 +00:00
|
|
|
else if (*end == 'n')
|
|
|
|
*(rewrite++) = '\n';
|
|
|
|
else if (*end == 'r')
|
|
|
|
*(rewrite++) = '\r';
|
|
|
|
else if (*end == 't')
|
|
|
|
*(rewrite++) = '\t';
|
|
|
|
else if (*end >= '0' && *end <= '3') {
|
2018-02-27 21:55:05 +00:00
|
|
|
qstate = 50;
|
2010-04-21 02:12:12 +00:00
|
|
|
qval = *end - '0';
|
|
|
|
} else if (*end == 'x') {
|
2018-02-27 21:55:05 +00:00
|
|
|
qstate = 60;
|
2010-04-21 02:12:12 +00:00
|
|
|
qval = 0;
|
|
|
|
} else
|
|
|
|
*(rewrite++) = *end;
|
|
|
|
|
2018-02-27 21:55:05 +00:00
|
|
|
if (qstate == 4)
|
2010-04-21 02:12:12 +00:00
|
|
|
qstate = 1;
|
|
|
|
break;
|
|
|
|
|
2018-02-27 21:55:05 +00:00
|
|
|
case 50: /* Octal */
|
|
|
|
case 51:
|
2010-04-21 02:12:12 +00:00
|
|
|
if (*end >= '0' && *end <= '7')
|
|
|
|
qval = (qval << 3) | (*end - '0');
|
|
|
|
|
2018-02-27 21:55:05 +00:00
|
|
|
if (qstate == 51) {
|
2010-04-21 02:12:12 +00:00
|
|
|
*(rewrite++) = qval;
|
|
|
|
qstate = 1;
|
|
|
|
} else {
|
|
|
|
qstate++;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2018-02-27 21:55:05 +00:00
|
|
|
case 60: /* Hex */
|
|
|
|
case 61:
|
2010-04-21 02:12:12 +00:00
|
|
|
if (isdigit(*end))
|
|
|
|
qval = (qval << 4) | (*end - '0');
|
|
|
|
else if (isupper(*end))
|
|
|
|
qval = (qval << 4) | (*end - 'A' + 10);
|
|
|
|
else if (islower(*end))
|
|
|
|
qval = (qval << 4) | (*end - 'a' + 10);
|
|
|
|
|
2018-02-27 21:55:05 +00:00
|
|
|
if (qstate == 61) {
|
2010-04-21 02:12:12 +00:00
|
|
|
*(rewrite++) = qval;
|
|
|
|
qstate = 1;
|
|
|
|
} else {
|
|
|
|
qstate++;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
end++;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
/* Leave the text pointer at the end of the next argument */
|
|
|
|
while (*end && isspace(*end))
|
|
|
|
end++;
|
|
|
|
|
|
|
|
*rewrite = 0;
|
|
|
|
*text = end;
|
|
|
|
return start;
|
|
|
|
}
|
|
|
|
|
2010-05-13 00:57:21 +00:00
|
|
|
void debug_hexdump(const char *label, const uint8_t *data, int len)
|
2010-04-21 02:12:12 +00:00
|
|
|
{
|
|
|
|
int offset = 0;
|
|
|
|
|
2010-08-16 23:07:03 +00:00
|
|
|
printc("%s [0x%x bytes]\n", label, len);
|
2010-04-21 02:12:12 +00:00
|
|
|
while (offset < len) {
|
|
|
|
int i;
|
|
|
|
|
2010-08-16 23:07:03 +00:00
|
|
|
printc(" ");
|
2010-04-21 02:12:12 +00:00
|
|
|
for (i = 0; i < 16 && offset + i < len; i++)
|
2010-08-16 23:07:03 +00:00
|
|
|
printc("%02x ", data[offset + i]);
|
|
|
|
printc("\n");
|
2010-04-21 02:12:12 +00:00
|
|
|
|
|
|
|
offset += i;
|
|
|
|
}
|
|
|
|
}
|
2011-06-06 00:40:50 +00:00
|
|
|
|
|
|
|
int hexval(int c)
|
|
|
|
{
|
|
|
|
if (isdigit(c))
|
|
|
|
return c - '0';
|
|
|
|
if (isupper(c))
|
|
|
|
return c - 'A' + 10;
|
|
|
|
if (islower(c))
|
|
|
|
return c - 'a' + 10;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2011-07-26 13:21:44 +00:00
|
|
|
|
2012-04-24 23:02:22 +00:00
|
|
|
#ifdef __Windows__
|
2011-07-26 13:21:44 +00:00
|
|
|
char *strsep(char **strp, const char *delim)
|
|
|
|
{
|
|
|
|
char *start = *strp;
|
|
|
|
char *end = start;
|
|
|
|
|
|
|
|
if (!start)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
while (*end) {
|
|
|
|
const char *d = delim;
|
|
|
|
|
|
|
|
while (*d) {
|
|
|
|
if (*d == *end) {
|
|
|
|
*(end++) = 0;
|
|
|
|
*strp = end;
|
|
|
|
return start;
|
|
|
|
}
|
2011-08-31 21:08:40 +00:00
|
|
|
|
|
|
|
d++;
|
2011-07-26 13:21:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
end++;
|
|
|
|
}
|
|
|
|
|
|
|
|
*strp = NULL;
|
|
|
|
return start;
|
|
|
|
}
|
|
|
|
#endif
|
2011-07-26 13:51:06 +00:00
|
|
|
|
2012-04-24 23:02:22 +00:00
|
|
|
#ifdef __Windows__
|
2011-07-26 13:51:06 +00:00
|
|
|
const char *last_error(void)
|
|
|
|
{
|
|
|
|
DWORD err = GetLastError();
|
|
|
|
static char msg_buf[128];
|
|
|
|
int len;
|
|
|
|
|
|
|
|
FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM, NULL, err, 0,
|
|
|
|
msg_buf, sizeof(msg_buf), NULL);
|
|
|
|
|
|
|
|
/* Trim trailing newline characters */
|
|
|
|
len = strlen(msg_buf);
|
|
|
|
while (len > 0 && isspace(msg_buf[len - 1]))
|
|
|
|
len--;
|
|
|
|
msg_buf[len] = 0;
|
|
|
|
|
|
|
|
return msg_buf;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
const char *last_error(void)
|
|
|
|
{
|
|
|
|
return strerror(errno);
|
|
|
|
}
|
|
|
|
#endif
|
2011-07-28 15:20:44 +00:00
|
|
|
|
|
|
|
/* Expand leading `~/' in path names. Caller must free the returned ptr */
|
|
|
|
char *expand_tilde(const char *path)
|
|
|
|
{
|
|
|
|
char *home, *expanded;
|
|
|
|
size_t len;
|
|
|
|
|
|
|
|
if (!path)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (!*path)
|
|
|
|
return strdup("");
|
|
|
|
|
|
|
|
expanded = NULL;
|
|
|
|
|
|
|
|
if (*path == '~' && *(path + 1) == '/') {
|
|
|
|
home = getenv("HOME");
|
|
|
|
|
|
|
|
if (home) {
|
|
|
|
/* Trailing '\0' will fit in leading '~'s place */
|
|
|
|
len = strlen(home) + strlen(path);
|
|
|
|
expanded = (char *)malloc(len);
|
|
|
|
|
|
|
|
if (expanded)
|
|
|
|
snprintf(expanded, len, "%s%s", home, path + 1);
|
|
|
|
else
|
2011-09-18 16:33:41 +00:00
|
|
|
printc_err("%s: malloc: %s\n", __FUNCTION__,
|
|
|
|
last_error());
|
2011-07-28 15:20:44 +00:00
|
|
|
|
|
|
|
} else {
|
2011-09-18 16:33:41 +00:00
|
|
|
printc_err("%s: getenv: %s\n", __FUNCTION__,
|
|
|
|
last_error());
|
2011-07-28 15:20:44 +00:00
|
|
|
}
|
|
|
|
} else {
|
2011-10-03 21:28:24 +00:00
|
|
|
expanded = strdup(path);
|
2011-07-28 15:20:44 +00:00
|
|
|
|
2011-10-03 21:28:24 +00:00
|
|
|
if (!expanded)
|
2011-09-18 16:33:41 +00:00
|
|
|
printc_err("%s: malloc: %s\n", __FUNCTION__,
|
|
|
|
last_error());
|
2011-07-28 15:20:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Caller must free()! */
|
|
|
|
return expanded;
|
|
|
|
}
|
2012-08-14 03:51:22 +00:00
|
|
|
|
|
|
|
#ifdef __Windows__
|
|
|
|
int delay_s(unsigned int s)
|
|
|
|
{
|
|
|
|
Sleep(s * 1000);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int delay_ms(unsigned int s)
|
|
|
|
{
|
|
|
|
Sleep(s);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
int delay_s(unsigned int s)
|
|
|
|
{
|
2013-12-06 07:01:27 +00:00
|
|
|
return delay_ms(1000 * s);
|
2012-08-14 03:51:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int delay_ms(unsigned int s)
|
|
|
|
{
|
2013-12-06 07:01:27 +00:00
|
|
|
struct timespec rq, rm;
|
|
|
|
int ret;
|
2012-08-14 03:51:22 +00:00
|
|
|
|
2013-12-06 07:01:27 +00:00
|
|
|
rm.tv_sec = s / 1000;
|
|
|
|
rm.tv_nsec = (s % 1000) * 1000000;
|
2012-08-14 03:51:22 +00:00
|
|
|
|
2013-12-06 07:01:27 +00:00
|
|
|
do {
|
|
|
|
if (ctrlc_check()) {
|
|
|
|
ret = -1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rq.tv_sec = rm.tv_sec;
|
|
|
|
rq.tv_nsec = rm.tv_nsec;
|
|
|
|
ret = nanosleep(&rq, &rm);
|
|
|
|
} while(ret == -1 && errno == EINTR);
|
|
|
|
|
|
|
|
return ret;
|
2012-08-14 03:51:22 +00:00
|
|
|
}
|
|
|
|
#endif
|
2012-10-23 20:37:46 +00:00
|
|
|
|
|
|
|
int base64_encode(const uint8_t *src, int len, char *dst, int max_len)
|
|
|
|
{
|
|
|
|
static const char basis[] =
|
|
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
|
|
|
"abcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
int i = 0;
|
|
|
|
int k = 0;
|
|
|
|
|
|
|
|
while ((i < len) && (k + 4) < max_len) {
|
|
|
|
int a = src[i++];
|
|
|
|
|
|
|
|
dst[k++] = basis[a >> 2];
|
|
|
|
|
|
|
|
if (i < len) {
|
|
|
|
int b = src[i++];
|
|
|
|
|
|
|
|
dst[k++] = basis[((a & 3) << 4) | (b & 0xf0) >> 4];
|
|
|
|
if (i < len) {
|
|
|
|
int c = src[i++];
|
|
|
|
|
|
|
|
dst[k++] = basis[((b & 0xf) << 2) |
|
|
|
|
((c & 0xc0) >> 6)];
|
|
|
|
dst[k++] = basis[c & 0x3f];
|
|
|
|
} else {
|
|
|
|
dst[k++] = basis[(b & 0xf) << 2];
|
|
|
|
dst[k++] = '=';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
dst[k++] = basis[(a & 3) << 4];
|
|
|
|
dst[k++] = '=';
|
|
|
|
dst[k++] = '=';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
dst[k] = 0;
|
|
|
|
return i;
|
|
|
|
}
|