2013-09-21 02:35:03 +02:00
|
|
|
/*
|
|
|
|
* Toxic -- Tox Curses Client
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <time.h>
|
|
|
|
#include <limits.h>
|
|
|
|
|
|
|
|
#include "toxic_windows.h"
|
2013-12-01 04:12:43 +01:00
|
|
|
#include "misc_tools.h"
|
2013-09-21 02:35:03 +02:00
|
|
|
|
|
|
|
// XXX: FIX
|
|
|
|
unsigned char *hex_string_to_bin(char hex_string[])
|
|
|
|
{
|
|
|
|
size_t len = strlen(hex_string);
|
|
|
|
unsigned char *val = malloc(len);
|
|
|
|
|
|
|
|
if (val == NULL) {
|
|
|
|
endwin();
|
|
|
|
fprintf(stderr, "malloc() failed. Aborting...\n");
|
|
|
|
exit(EXIT_FAILURE);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *pos = hex_string;
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
for (i = 0; i < len; ++i, pos += 2)
|
|
|
|
sscanf(pos, "%2hhx", &val[i]);
|
|
|
|
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the current local time */
|
|
|
|
struct tm *get_time(void)
|
|
|
|
{
|
|
|
|
struct tm *timeinfo;
|
|
|
|
time_t now;
|
|
|
|
time(&now);
|
|
|
|
timeinfo = localtime(&now);
|
|
|
|
return timeinfo;
|
|
|
|
}
|
|
|
|
|
2013-10-11 10:42:30 +02:00
|
|
|
/* Prints the time to given window */
|
|
|
|
void print_time(WINDOW *window)
|
|
|
|
{
|
|
|
|
struct tm *timeinfo = get_time();
|
|
|
|
|
2013-12-05 09:29:39 +01:00
|
|
|
wattron(window, COLOR_PAIR(BLUE));
|
2013-10-11 10:42:30 +02:00
|
|
|
wprintw(window, "[%02d:%02d:%02d] ", timeinfo->tm_hour, timeinfo->tm_min, timeinfo->tm_sec);
|
2013-12-05 09:29:39 +01:00
|
|
|
wattroff(window,COLOR_PAIR(BLUE));
|
2013-10-11 10:42:30 +02:00
|
|
|
}
|
|
|
|
|
2013-10-19 05:58:33 +02:00
|
|
|
/* Returns 1 if the string is empty, 0 otherwise */
|
2013-09-21 02:35:03 +02:00
|
|
|
int string_is_empty(char *string)
|
|
|
|
{
|
2013-10-22 07:59:06 +02:00
|
|
|
return string[0] == '\0';
|
2013-09-21 02:35:03 +02:00
|
|
|
}
|
|
|
|
|
2013-12-08 04:10:32 +01:00
|
|
|
/* convert a multibyte string to a wide character string (must provide buffer) */
|
|
|
|
int char_to_wcs_buf(wchar_t *buf, const uint8_t *string, size_t n)
|
|
|
|
{
|
|
|
|
size_t len = mbstowcs(NULL, string, 0) + 1;
|
|
|
|
|
|
|
|
if (n < len)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
if ((len = mbstowcs(buf, string, n)) == (size_t) -1)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* converts wide character string into a multibyte string.
|
|
|
|
Same thing as wcs_to_char() but caller must provide its own buffer */
|
|
|
|
int wcs_to_char_buf(uint8_t *buf, const wchar_t *string, size_t n)
|
|
|
|
{
|
|
|
|
size_t len = wcstombs(NULL, string, 0) + 1;
|
|
|
|
|
|
|
|
if (n < len)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
if ((len = wcstombs(buf, string, n)) == (size_t) -1)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* convert wide characters to multibyte string */
|
2013-09-21 02:35:03 +02:00
|
|
|
uint8_t *wcs_to_char(wchar_t *string)
|
|
|
|
{
|
2013-10-23 09:24:08 +02:00
|
|
|
uint8_t *ret = NULL;
|
2013-10-25 06:29:40 +02:00
|
|
|
size_t len = wcstombs(NULL, string, 0);
|
2013-09-21 02:35:03 +02:00
|
|
|
|
|
|
|
if (len != (size_t) -1) {
|
2013-10-25 06:33:00 +02:00
|
|
|
ret = malloc(++len);
|
2013-10-25 06:29:40 +02:00
|
|
|
|
2013-12-08 04:10:32 +01:00
|
|
|
if (ret != NULL) {
|
|
|
|
if (wcstombs(ret, string, len) == (size_t) -1)
|
|
|
|
return NULL;
|
|
|
|
}
|
2013-09-21 02:35:03 +02:00
|
|
|
} else {
|
|
|
|
ret = malloc(2);
|
2013-10-25 06:29:40 +02:00
|
|
|
|
2013-09-21 02:35:03 +02:00
|
|
|
if (ret != NULL) {
|
|
|
|
ret[0] = ' ';
|
|
|
|
ret[1] = '\0';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ret == NULL) {
|
|
|
|
endwin();
|
|
|
|
fprintf(stderr, "malloc() failed. Aborting...\n");
|
|
|
|
exit(EXIT_FAILURE);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2013-12-08 04:10:32 +01:00
|
|
|
/* convert a wide char to multibyte string */
|
2013-09-21 02:35:03 +02:00
|
|
|
char *wc_to_char(wchar_t ch)
|
|
|
|
{
|
|
|
|
static char ret[MB_LEN_MAX + 1];
|
2013-10-25 06:29:40 +02:00
|
|
|
int len = wctomb(ret, ch);
|
2013-09-21 02:35:03 +02:00
|
|
|
|
|
|
|
if (len == -1) {
|
|
|
|
ret[0] = ' ';
|
|
|
|
ret[1] = '\0';
|
|
|
|
} else {
|
|
|
|
ret[len] = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2013-11-15 01:14:54 +01:00
|
|
|
|
|
|
|
/* Returns true if connection has timed out, false otherwise */
|
|
|
|
bool timed_out(uint64_t timestamp, uint64_t curtime, uint64_t timeout)
|
|
|
|
{
|
|
|
|
return timestamp + timeout <= curtime;
|
2013-11-15 01:34:40 +01:00
|
|
|
}
|
2013-11-19 08:31:22 +01:00
|
|
|
|
2013-11-29 01:45:28 +01:00
|
|
|
/* Colours the window tab according to type. Beeps if is_beep is true */
|
|
|
|
void alert_window(ToxWindow *self, int type, bool is_beep)
|
2013-11-19 08:31:22 +01:00
|
|
|
{
|
2013-12-07 01:41:53 +01:00
|
|
|
switch (type) {
|
|
|
|
case WINDOW_ALERT_0:
|
|
|
|
self->alert0 = true;
|
|
|
|
break;
|
|
|
|
case WINDOW_ALERT_1:
|
2013-11-29 01:45:28 +01:00
|
|
|
self->alert1 = true;
|
2013-12-07 01:41:53 +01:00
|
|
|
break;
|
|
|
|
case WINDOW_ALERT_2:
|
2013-11-29 01:45:28 +01:00
|
|
|
self->alert2 = true;
|
2013-12-07 01:41:53 +01:00
|
|
|
break;
|
|
|
|
}
|
2013-11-29 01:45:28 +01:00
|
|
|
|
|
|
|
if (is_beep)
|
|
|
|
beep();
|
2013-11-19 08:31:22 +01:00
|
|
|
}
|
2013-11-24 08:33:03 +01:00
|
|
|
|
|
|
|
/* case-insensitive string compare function for use with qsort - same return logic as strcmp */
|
|
|
|
int name_compare(const void *nick1, const void *nick2)
|
|
|
|
{
|
2013-11-28 08:53:43 +01:00
|
|
|
char s[TOX_MAX_NAME_LENGTH];
|
|
|
|
char t[TOX_MAX_NAME_LENGTH];
|
2013-11-24 21:18:05 +01:00
|
|
|
strcpy(s, (const char *) nick1);
|
|
|
|
strcpy(t, (const char *) nick2);
|
2013-11-24 08:33:03 +01:00
|
|
|
|
|
|
|
int i;
|
|
|
|
|
2013-11-28 08:53:43 +01:00
|
|
|
for (i = 0; s[i] && t[i]; ++i) {
|
2013-11-24 08:33:03 +01:00
|
|
|
s[i] = tolower(s[i]);
|
|
|
|
t[i] = tolower(t[i]);
|
|
|
|
|
|
|
|
if (s[i] != t[i])
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return s[i] - t[i];
|
2013-11-24 21:18:05 +01:00
|
|
|
}
|
2013-11-28 08:53:43 +01:00
|
|
|
|
|
|
|
/* Returns true if nick is valid. A valid toxic nick:
|
|
|
|
- cannot be empty
|
|
|
|
- cannot start with a space
|
|
|
|
- must not contain contiguous spaces */
|
|
|
|
bool valid_nick(uint8_t *nick)
|
|
|
|
{
|
|
|
|
if (!nick[0] || nick[0] == ' ')
|
|
|
|
return false;
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; nick[i]; ++i) {
|
|
|
|
if (nick[i] == ' ' && nick[i+1] == ' ')
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2013-11-29 00:56:56 +01:00
|
|
|
}
|
2013-12-01 04:12:43 +01:00
|
|
|
|
|
|
|
/*
|
2013-12-01 22:57:05 +01:00
|
|
|
* Buffer helper tools.
|
|
|
|
* Assumes buffers are no larger than MAX_STR_SIZE and are always null terminated at len
|
2013-12-01 04:12:43 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
/* Adds char to buffer at pos */
|
2013-12-03 00:23:04 +01:00
|
|
|
void add_char_to_buf(wchar_t *buf, size_t *pos, size_t *len, wint_t ch)
|
2013-12-01 04:12:43 +01:00
|
|
|
{
|
|
|
|
if (*pos < 0 || *len >= MAX_STR_SIZE)
|
|
|
|
return;
|
|
|
|
|
2013-12-01 22:57:05 +01:00
|
|
|
/* move all chars including null in front of pos one space forward and insert char in pos */
|
2013-12-01 04:12:43 +01:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = *len; i >= *pos && i >= 0; --i)
|
|
|
|
buf[i+1] = buf[i];
|
|
|
|
|
|
|
|
buf[(*pos)++] = ch;
|
|
|
|
++(*len);
|
|
|
|
}
|
|
|
|
|
2013-12-01 08:58:21 +01:00
|
|
|
/* Deletes the character before pos */
|
|
|
|
void del_char_buf_bck(wchar_t *buf, size_t *pos, size_t *len)
|
2013-12-01 04:12:43 +01:00
|
|
|
{
|
|
|
|
if (*pos <= 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* similar to add_char_to_buf but deletes a char */
|
|
|
|
for (i = *pos-1; i <= *len; ++i)
|
|
|
|
buf[i] = buf[i+1];
|
|
|
|
|
|
|
|
--(*pos);
|
|
|
|
--(*len);
|
|
|
|
}
|
|
|
|
|
2013-12-04 00:01:17 +01:00
|
|
|
/* Deletes the character at pos */
|
2013-12-01 08:58:21 +01:00
|
|
|
void del_char_buf_frnt(wchar_t *buf, size_t *pos, size_t *len)
|
|
|
|
{
|
|
|
|
if (*pos < 0 || *pos >= *len)
|
|
|
|
return;
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = *pos; i < *len; ++i)
|
|
|
|
buf[i] = buf[i+1];
|
|
|
|
|
|
|
|
--(*len);
|
|
|
|
}
|
|
|
|
|
2013-12-06 11:07:35 +01:00
|
|
|
/* Deletes the line from beginning to pos */
|
2013-12-06 04:55:14 +01:00
|
|
|
void discard_buf(wchar_t *buf, size_t *pos, size_t *len)
|
|
|
|
{
|
|
|
|
if (*pos <= 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
int i;
|
|
|
|
int c = 0;
|
|
|
|
|
|
|
|
for (i = *pos; i <= *len; ++i)
|
|
|
|
buf[c++] = buf[i];
|
|
|
|
|
|
|
|
*pos = 0;
|
|
|
|
*len = c - 1;
|
|
|
|
}
|
|
|
|
|
2013-12-06 11:07:35 +01:00
|
|
|
/* Deletes the line from pos to len */
|
2013-12-06 04:55:14 +01:00
|
|
|
void kill_buf(wchar_t *buf, size_t *pos, size_t *len)
|
|
|
|
{
|
|
|
|
if (*len == *pos)
|
|
|
|
return;
|
|
|
|
|
|
|
|
buf[*pos] = L'\0';
|
|
|
|
*len = *pos;
|
|
|
|
}
|
|
|
|
|
2013-12-01 08:58:21 +01:00
|
|
|
/* nulls buf and sets pos and len to 0 */
|
2013-12-01 04:12:43 +01:00
|
|
|
void reset_buf(wchar_t *buf, size_t *pos, size_t *len)
|
|
|
|
{
|
|
|
|
buf[0] = L'\0';
|
|
|
|
*pos = 0;
|
|
|
|
*len = 0;
|
|
|
|
}
|
2013-12-08 04:10:32 +01:00
|
|
|
|
|
|
|
/* looks for the first instance in list that begins with the last entered word in buf according to pos,
|
|
|
|
then fills buf with the complete word. e.g. "Hello jo" would complete the buffer
|
|
|
|
with "Hello john". It shouldn't matter where pos is within buf.
|
|
|
|
|
|
|
|
list is a pointer to the list of strings being compared, n_items is the number of items
|
|
|
|
in the list, and size is the size of each item in the list.
|
|
|
|
|
|
|
|
Returns the difference between the old len and new len of buf */
|
|
|
|
int complete_line(wchar_t *buf, size_t *pos, size_t *len, const uint8_t *list, int n_items, int size)
|
|
|
|
{
|
|
|
|
if (*pos <= 0 || *len < 2 || *len > MAX_STR_SIZE)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
uint8_t ubuf[MAX_STR_SIZE];
|
|
|
|
|
|
|
|
if (wcs_to_char_buf(ubuf, buf, MAX_STR_SIZE) == -1)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* isolate substring from space behind pos to pos */
|
|
|
|
uint8_t tmp[MAX_STR_SIZE];
|
|
|
|
snprintf(tmp, sizeof(tmp), "%s", ubuf);
|
|
|
|
tmp[*pos] = '\0';
|
|
|
|
uint8_t *sub = strrchr(tmp, ' ');
|
|
|
|
|
|
|
|
if (!sub++)
|
|
|
|
sub = tmp;
|
|
|
|
|
|
|
|
const uint8_t *match;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* look for a match in list */
|
|
|
|
for (i = 0; i < n_items; ++i) {
|
|
|
|
if (match = strstr(&list[i*size], sub))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!match)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* put match in correct spot in buf */
|
|
|
|
int s_len = strlen(sub);
|
|
|
|
int m_len = strlen(match);
|
|
|
|
int strt = *pos - s_len;
|
|
|
|
|
|
|
|
uint8_t tmpend[MAX_STR_SIZE];
|
|
|
|
strcpy(tmpend, &ubuf[*pos]);
|
|
|
|
strcpy(&ubuf[strt], match);
|
|
|
|
strcpy(&ubuf[strt+m_len], tmpend);
|
|
|
|
|
|
|
|
/* convert to widechar and copy back to original buf */
|
|
|
|
wchar_t newbuf[MAX_STR_SIZE];
|
|
|
|
|
|
|
|
if (char_to_wcs_buf(newbuf, ubuf, MAX_STR_SIZE) == -1)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
int diff = m_len - s_len;
|
|
|
|
*len += diff;
|
|
|
|
*pos += diff;
|
|
|
|
|
|
|
|
wmemcpy(buf, newbuf, MAX_STR_SIZE);
|
|
|
|
|
|
|
|
return diff;
|
|
|
|
}
|