2012-10-21 15:02:20 -04:00
|
|
|
/*
|
2012-05-19 16:56:23 -04:00
|
|
|
* common.c
|
|
|
|
*
|
2014-03-08 20:18:19 -05:00
|
|
|
* Copyright (C) 2012 - 2014 James Booth <boothj5@gmail.com>
|
2012-10-21 15:02:20 -04:00
|
|
|
*
|
2012-05-19 16:56:23 -04:00
|
|
|
* This file is part of Profanity.
|
|
|
|
*
|
|
|
|
* Profanity is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Profanity 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 Profanity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
*/
|
2013-04-20 18:39:17 -04:00
|
|
|
#include "config.h"
|
2012-05-19 16:56:23 -04:00
|
|
|
|
2013-02-10 06:41:30 -05:00
|
|
|
#include <assert.h>
|
2012-07-19 16:30:07 -04:00
|
|
|
#include <errno.h>
|
2012-08-25 20:50:50 -04:00
|
|
|
#include <stdlib.h>
|
2014-06-01 17:53:30 -04:00
|
|
|
#include <stdint.h>
|
2012-08-22 20:08:06 -04:00
|
|
|
#include <string.h>
|
2013-08-03 07:14:30 -04:00
|
|
|
#include <sys/types.h>
|
2012-08-25 20:50:50 -04:00
|
|
|
#include <sys/stat.h>
|
2012-07-19 16:30:07 -04:00
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
#include <curl/curl.h>
|
|
|
|
#include <curl/easy.h>
|
2013-02-02 15:55:58 -05:00
|
|
|
#include <glib.h>
|
2014-06-01 17:42:10 -04:00
|
|
|
|
|
|
|
#include "tools/sha1.h"
|
2012-05-19 16:56:23 -04:00
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
#include "log.h"
|
2012-07-19 17:38:46 -04:00
|
|
|
#include "common.h"
|
2012-07-19 16:30:07 -04:00
|
|
|
|
2012-11-17 21:31:32 -05:00
|
|
|
// assume malloc stores at most 8 bytes for size of allocated memory
|
|
|
|
// and page size is at least 4KB
|
|
|
|
#define READ_BUF_SIZE 4088
|
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
struct curl_data_t
|
|
|
|
{
|
|
|
|
char *buffer;
|
|
|
|
size_t size;
|
|
|
|
};
|
|
|
|
|
|
|
|
static size_t _data_callback(void *ptr, size_t size, size_t nmemb, void *data);
|
|
|
|
|
2013-01-29 19:48:32 -05:00
|
|
|
// taken from glib 2.30.3
|
|
|
|
gchar *
|
|
|
|
p_utf8_substring(const gchar *str, glong start_pos, glong end_pos)
|
|
|
|
{
|
|
|
|
gchar *start, *end, *out;
|
|
|
|
|
|
|
|
start = g_utf8_offset_to_pointer (str, start_pos);
|
|
|
|
end = g_utf8_offset_to_pointer (start, end_pos - start_pos);
|
|
|
|
|
|
|
|
out = g_malloc (end - start + 1);
|
|
|
|
memcpy (out, start, end - start);
|
|
|
|
out[end - start] = 0;
|
|
|
|
|
|
|
|
return out;
|
|
|
|
}
|
2013-01-28 15:07:25 -05:00
|
|
|
|
2012-07-24 18:19:48 -04:00
|
|
|
void
|
|
|
|
p_slist_free_full(GSList *items, GDestroyNotify free_func)
|
2012-05-19 16:56:23 -04:00
|
|
|
{
|
2012-07-19 17:38:46 -04:00
|
|
|
g_slist_foreach (items, (GFunc) free_func, NULL);
|
|
|
|
g_slist_free (items);
|
2012-05-19 16:56:23 -04:00
|
|
|
}
|
2012-07-19 16:30:07 -04:00
|
|
|
|
2014-05-21 16:39:31 -04:00
|
|
|
void
|
|
|
|
p_list_free_full(GList *items, GDestroyNotify free_func)
|
|
|
|
{
|
|
|
|
g_list_foreach (items, (GFunc) free_func, NULL);
|
|
|
|
g_list_free (items);
|
|
|
|
}
|
|
|
|
|
2014-05-22 14:39:48 -04:00
|
|
|
gboolean
|
|
|
|
p_hash_table_add(GHashTable *hash_table, gpointer key)
|
|
|
|
{
|
2014-05-22 15:02:19 -04:00
|
|
|
// doesn't handle when key exists, but value == NULL
|
2014-05-22 14:47:50 -04:00
|
|
|
gpointer found = g_hash_table_lookup(hash_table, key);
|
|
|
|
g_hash_table_replace(hash_table, key, key);
|
|
|
|
|
|
|
|
return (found == NULL);
|
2014-05-22 14:39:48 -04:00
|
|
|
}
|
|
|
|
|
2014-05-22 15:02:19 -04:00
|
|
|
gboolean
|
|
|
|
p_hash_table_contains(GHashTable *hash_table, gconstpointer key)
|
|
|
|
{
|
|
|
|
// doesn't handle when key exists, but value == NULL
|
|
|
|
gpointer found = g_hash_table_lookup(hash_table, key);
|
|
|
|
return (found != NULL);
|
|
|
|
}
|
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
gboolean
|
2012-07-24 18:19:48 -04:00
|
|
|
create_dir(char *name)
|
2012-07-19 16:30:07 -04:00
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
if (stat(name, &sb) != 0) {
|
|
|
|
if (errno != ENOENT || mkdir(name, S_IRWXU) != 0) {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if ((sb.st_mode & S_IFDIR) != S_IFDIR) {
|
|
|
|
log_debug("create_dir: %s exists and is not a directory!", name);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return TRUE;
|
2012-07-19 16:30:07 -04:00
|
|
|
}
|
2012-08-22 20:08:06 -04:00
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
gboolean
|
2013-02-02 17:06:19 -05:00
|
|
|
mkdir_recursive(const char *dir)
|
|
|
|
{
|
|
|
|
int i;
|
2013-08-03 07:14:30 -04:00
|
|
|
gboolean result = TRUE;
|
|
|
|
|
2013-02-02 17:06:19 -05:00
|
|
|
for (i = 1; i <= strlen(dir); i++) {
|
|
|
|
if (dir[i] == '/' || dir[i] == '\0') {
|
|
|
|
gchar *next_dir = g_strndup(dir, i);
|
2013-08-03 07:14:30 -04:00
|
|
|
result = create_dir(next_dir);
|
2013-02-02 17:06:19 -05:00
|
|
|
g_free(next_dir);
|
2013-08-03 07:14:30 -04:00
|
|
|
if (!result) {
|
|
|
|
break;
|
|
|
|
}
|
2013-02-02 17:06:19 -05:00
|
|
|
}
|
|
|
|
}
|
2013-08-03 07:14:30 -04:00
|
|
|
|
|
|
|
return result;
|
2013-02-02 17:06:19 -05:00
|
|
|
}
|
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
char *
|
2012-10-21 15:02:20 -04:00
|
|
|
str_replace(const char *string, const char *substr,
|
|
|
|
const char *replacement)
|
2012-08-22 20:08:06 -04:00
|
|
|
{
|
|
|
|
char *tok = NULL;
|
|
|
|
char *newstr = NULL;
|
|
|
|
char *head = NULL;
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
if (string == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2012-10-21 15:02:20 -04:00
|
|
|
if ( substr == NULL ||
|
|
|
|
replacement == NULL ||
|
|
|
|
(strcmp(substr, "") == 0))
|
2012-08-22 20:08:06 -04:00
|
|
|
return strdup (string);
|
|
|
|
|
|
|
|
newstr = strdup (string);
|
|
|
|
head = newstr;
|
|
|
|
|
|
|
|
while ( (tok = strstr ( head, substr ))) {
|
2014-04-25 19:36:36 -04:00
|
|
|
char *oldstr = newstr;
|
2012-10-21 15:02:20 -04:00
|
|
|
newstr = malloc ( strlen ( oldstr ) - strlen ( substr ) +
|
2012-08-22 20:08:06 -04:00
|
|
|
strlen ( replacement ) + 1 );
|
2012-10-21 15:02:20 -04:00
|
|
|
|
|
|
|
if ( newstr == NULL ) {
|
2012-08-22 20:08:06 -04:00
|
|
|
free (oldstr);
|
|
|
|
return NULL;
|
|
|
|
}
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
memcpy ( newstr, oldstr, tok - oldstr );
|
|
|
|
memcpy ( newstr + (tok - oldstr), replacement, strlen ( replacement ) );
|
2012-10-21 15:02:20 -04:00
|
|
|
memcpy ( newstr + (tok - oldstr) + strlen( replacement ),
|
|
|
|
tok + strlen ( substr ),
|
2012-08-22 20:08:06 -04:00
|
|
|
strlen ( oldstr ) - strlen ( substr ) - ( tok - oldstr ) );
|
2012-10-21 15:02:20 -04:00
|
|
|
memset ( newstr + strlen ( oldstr ) - strlen ( substr ) +
|
2012-08-22 20:08:06 -04:00
|
|
|
strlen ( replacement ) , 0, 1 );
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
head = newstr + (tok - oldstr) + strlen( replacement );
|
|
|
|
free (oldstr);
|
|
|
|
}
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
return newstr;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
str_contains(char str[], int size, char ch)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < size; i++) {
|
|
|
|
if (str[i] == ch)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2012-11-06 17:53:59 -05:00
|
|
|
|
2012-11-17 21:31:32 -05:00
|
|
|
char *
|
|
|
|
prof_getline(FILE *stream)
|
|
|
|
{
|
|
|
|
char *buf;
|
|
|
|
char *result;
|
|
|
|
char *s = NULL;
|
|
|
|
size_t s_size = 1;
|
|
|
|
int need_exit = 0;
|
|
|
|
|
|
|
|
buf = (char *)malloc(READ_BUF_SIZE);
|
|
|
|
|
|
|
|
while (TRUE) {
|
|
|
|
result = fgets(buf, READ_BUF_SIZE, stream);
|
|
|
|
if (result == NULL)
|
|
|
|
break;
|
2014-04-25 19:36:36 -04:00
|
|
|
size_t buf_size = strlen(buf);
|
2012-11-17 21:31:32 -05:00
|
|
|
if (buf[buf_size - 1] == '\n') {
|
|
|
|
buf_size--;
|
|
|
|
buf[buf_size] = '\0';
|
|
|
|
need_exit = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
result = (char *)realloc(s, s_size + buf_size);
|
|
|
|
if (result == NULL) {
|
|
|
|
if (s != NULL) {
|
|
|
|
free(s);
|
|
|
|
s = NULL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
s = result;
|
|
|
|
|
|
|
|
memcpy(s + s_size - 1, buf, buf_size);
|
|
|
|
s_size += buf_size;
|
|
|
|
s[s_size - 1] = '\0';
|
|
|
|
|
|
|
|
if (need_exit != 0 || feof(stream) != 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
free(buf);
|
|
|
|
return s;
|
|
|
|
}
|
2013-01-20 12:16:45 -05:00
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
char *
|
|
|
|
release_get_latest()
|
|
|
|
{
|
|
|
|
char *url = "http://www.profanity.im/profanity_version.txt";
|
|
|
|
|
|
|
|
CURL *handle = curl_easy_init();
|
|
|
|
struct curl_data_t output;
|
|
|
|
output.buffer = NULL;
|
|
|
|
output.size = 0;
|
|
|
|
|
|
|
|
curl_easy_setopt(handle, CURLOPT_URL, url);
|
|
|
|
curl_easy_setopt(handle, CURLOPT_WRITEFUNCTION, _data_callback);
|
|
|
|
curl_easy_setopt(handle, CURLOPT_TIMEOUT, 2);
|
|
|
|
curl_easy_setopt(handle, CURLOPT_WRITEDATA, (void *)&output);
|
|
|
|
|
|
|
|
curl_easy_perform(handle);
|
|
|
|
curl_easy_cleanup(handle);
|
|
|
|
|
|
|
|
if (output.buffer != NULL) {
|
|
|
|
output.buffer[output.size++] = '\0';
|
|
|
|
return output.buffer;
|
|
|
|
} else {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-20 18:39:17 -04:00
|
|
|
gboolean
|
|
|
|
release_is_new(char *found_version)
|
|
|
|
{
|
|
|
|
int curr_maj, curr_min, curr_patch, found_maj, found_min, found_patch;
|
|
|
|
|
|
|
|
int parse_curr = sscanf(PACKAGE_VERSION, "%d.%d.%d", &curr_maj, &curr_min,
|
|
|
|
&curr_patch);
|
|
|
|
int parse_found = sscanf(found_version, "%d.%d.%d", &found_maj, &found_min,
|
|
|
|
&found_patch);
|
|
|
|
|
|
|
|
if (parse_found == 3 && parse_curr == 3) {
|
|
|
|
if (found_maj > curr_maj) {
|
|
|
|
return TRUE;
|
|
|
|
} else if (found_maj == curr_maj && found_min > curr_min) {
|
|
|
|
return TRUE;
|
|
|
|
} else if (found_maj == curr_maj && found_min == curr_min
|
|
|
|
&& found_patch > curr_patch) {
|
|
|
|
return TRUE;
|
|
|
|
} else {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-01-30 19:01:38 -05:00
|
|
|
gboolean
|
2013-02-10 12:13:19 -05:00
|
|
|
valid_resource_presence_string(const char * const str)
|
2013-01-30 19:01:38 -05:00
|
|
|
{
|
2013-02-10 06:41:30 -05:00
|
|
|
assert(str != NULL);
|
|
|
|
if ((strcmp(str, "online") == 0) || (strcmp(str, "chat") == 0) ||
|
|
|
|
(strcmp(str, "away") == 0) || (strcmp(str, "xa") == 0) ||
|
|
|
|
(strcmp(str, "dnd") == 0)) {
|
2013-01-30 19:01:38 -05:00
|
|
|
return TRUE;
|
|
|
|
} else {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-10 06:41:30 -05:00
|
|
|
const char *
|
2013-02-10 12:13:19 -05:00
|
|
|
string_from_resource_presence(resource_presence_t presence)
|
2013-02-10 06:41:30 -05:00
|
|
|
{
|
2013-02-10 12:13:19 -05:00
|
|
|
switch(presence)
|
2013-02-10 06:41:30 -05:00
|
|
|
{
|
2013-02-10 12:13:19 -05:00
|
|
|
case RESOURCE_CHAT:
|
2013-02-10 06:41:30 -05:00
|
|
|
return "chat";
|
2013-02-10 12:13:19 -05:00
|
|
|
case RESOURCE_AWAY:
|
2013-02-10 06:41:30 -05:00
|
|
|
return "away";
|
2013-02-10 12:13:19 -05:00
|
|
|
case RESOURCE_XA:
|
2013-02-10 06:41:30 -05:00
|
|
|
return "xa";
|
2013-02-10 12:13:19 -05:00
|
|
|
case RESOURCE_DND:
|
2013-02-10 06:41:30 -05:00
|
|
|
return "dnd";
|
|
|
|
default:
|
2013-02-10 12:13:19 -05:00
|
|
|
return "online";
|
2013-02-10 06:41:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-10 12:13:19 -05:00
|
|
|
resource_presence_t
|
|
|
|
resource_presence_from_string(const char * const str)
|
2013-02-10 06:41:30 -05:00
|
|
|
{
|
2013-02-10 12:13:19 -05:00
|
|
|
if (str == NULL) {
|
|
|
|
return RESOURCE_ONLINE;
|
|
|
|
} else if (strcmp(str, "online") == 0) {
|
|
|
|
return RESOURCE_ONLINE;
|
|
|
|
} else if (strcmp(str, "chat") == 0) {
|
|
|
|
return RESOURCE_CHAT;
|
|
|
|
} else if (strcmp(str, "away") == 0) {
|
|
|
|
return RESOURCE_AWAY;
|
|
|
|
} else if (strcmp(str, "xa") == 0) {
|
|
|
|
return RESOURCE_XA;
|
|
|
|
} else if (strcmp(str, "dnd") == 0) {
|
|
|
|
return RESOURCE_DND;
|
|
|
|
} else {
|
|
|
|
return RESOURCE_ONLINE;
|
|
|
|
}
|
|
|
|
}
|
2013-02-10 06:41:30 -05:00
|
|
|
|
2013-02-10 12:13:19 -05:00
|
|
|
contact_presence_t
|
|
|
|
contact_presence_from_resource_presence(resource_presence_t resource_presence)
|
|
|
|
{
|
|
|
|
switch(resource_presence)
|
2013-02-10 06:41:30 -05:00
|
|
|
{
|
2013-02-10 12:13:19 -05:00
|
|
|
case RESOURCE_CHAT:
|
|
|
|
return CONTACT_CHAT;
|
|
|
|
case RESOURCE_AWAY:
|
|
|
|
return CONTACT_AWAY;
|
|
|
|
case RESOURCE_XA:
|
|
|
|
return CONTACT_XA;
|
|
|
|
case RESOURCE_DND:
|
|
|
|
return CONTACT_DND;
|
2013-02-10 06:41:30 -05:00
|
|
|
default:
|
2013-02-10 12:13:19 -05:00
|
|
|
return CONTACT_ONLINE;
|
2013-02-10 06:41:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-02 17:09:18 -05:00
|
|
|
gchar *
|
|
|
|
xdg_get_config_home(void)
|
|
|
|
{
|
|
|
|
gchar *xdg_config_home = getenv("XDG_CONFIG_HOME");
|
|
|
|
if (xdg_config_home != NULL)
|
|
|
|
g_strstrip(xdg_config_home);
|
|
|
|
|
|
|
|
if ((xdg_config_home != NULL) && (strcmp(xdg_config_home, "") != 0)) {
|
|
|
|
return strdup(xdg_config_home);
|
|
|
|
} else {
|
|
|
|
GString *default_path = g_string_new(getenv("HOME"));
|
|
|
|
g_string_append(default_path, "/.config");
|
|
|
|
gchar *result = strdup(default_path->str);
|
|
|
|
g_string_free(default_path, TRUE);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
gchar *
|
|
|
|
xdg_get_data_home(void)
|
|
|
|
{
|
|
|
|
gchar *xdg_data_home = getenv("XDG_DATA_HOME");
|
|
|
|
if (xdg_data_home != NULL)
|
|
|
|
g_strstrip(xdg_data_home);
|
|
|
|
|
|
|
|
if ((xdg_data_home != NULL) && (strcmp(xdg_data_home, "") != 0)) {
|
|
|
|
return strdup(xdg_data_home);
|
|
|
|
} else {
|
|
|
|
GString *default_path = g_string_new(getenv("HOME"));
|
|
|
|
g_string_append(default_path, "/.local/share");
|
|
|
|
gchar *result = strdup(default_path->str);
|
|
|
|
g_string_free(default_path, TRUE);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-23 12:38:30 -04:00
|
|
|
char *
|
2014-01-25 18:18:10 -05:00
|
|
|
generate_unique_id(char *prefix)
|
2013-06-23 12:38:30 -04:00
|
|
|
{
|
2013-07-14 06:49:50 -04:00
|
|
|
static unsigned long unique_id;
|
2013-06-23 12:38:30 -04:00
|
|
|
char *result = NULL;
|
|
|
|
GString *result_str = g_string_new("");
|
2013-07-14 06:49:50 -04:00
|
|
|
|
|
|
|
unique_id++;
|
2014-01-25 18:18:10 -05:00
|
|
|
if (prefix != NULL) {
|
|
|
|
g_string_printf(result_str, "prof_%s_%lu", prefix, unique_id);
|
|
|
|
} else {
|
|
|
|
g_string_printf(result_str, "prof_%lu", unique_id);
|
|
|
|
}
|
2013-06-23 12:38:30 -04:00
|
|
|
result = result_str->str;
|
|
|
|
g_string_free(result_str, FALSE);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2014-05-01 17:18:04 -04:00
|
|
|
char *
|
|
|
|
sha1_hash(char *str)
|
|
|
|
{
|
2014-06-01 17:42:10 -04:00
|
|
|
SHA1_CTX ctx;
|
|
|
|
uint8_t digest[20];
|
|
|
|
uint8_t *input = (uint8_t*)malloc(strlen(str) + 1);
|
|
|
|
memcpy(input, str, strlen(str) + 1);
|
|
|
|
|
|
|
|
SHA1_Init(&ctx);
|
|
|
|
SHA1_Update(&ctx, input, strlen(str));
|
|
|
|
SHA1_Final(&ctx, digest);
|
2014-05-01 17:18:04 -04:00
|
|
|
|
2014-06-01 17:42:10 -04:00
|
|
|
free(input);
|
|
|
|
return g_base64_encode(digest, sizeof(digest));
|
2014-05-01 17:18:04 -04:00
|
|
|
}
|
|
|
|
|
2013-08-27 17:02:23 -04:00
|
|
|
int
|
|
|
|
cmp_win_num(gconstpointer a, gconstpointer b)
|
|
|
|
{
|
|
|
|
int real_a = GPOINTER_TO_INT(a);
|
|
|
|
int real_b = GPOINTER_TO_INT(b);
|
|
|
|
|
|
|
|
if (real_a == 0) {
|
|
|
|
real_a = 10;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (real_b == 0) {
|
|
|
|
real_b = 10;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (real_a < real_b) {
|
|
|
|
return -1;
|
|
|
|
} else if (real_a == real_b) {
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2013-08-27 18:38:25 -04:00
|
|
|
get_next_available_win_num(GList *used)
|
2013-08-27 17:02:23 -04:00
|
|
|
{
|
2013-08-27 18:38:25 -04:00
|
|
|
used = g_list_sort(used, cmp_win_num);
|
2013-08-27 17:02:23 -04:00
|
|
|
// only console used
|
2013-08-27 18:38:25 -04:00
|
|
|
if (g_list_length(used) == 1) {
|
2013-08-27 17:02:23 -04:00
|
|
|
return 2;
|
|
|
|
} else {
|
2014-04-25 19:36:36 -04:00
|
|
|
int result = 0;
|
2013-08-27 17:02:23 -04:00
|
|
|
int last_num = 1;
|
2013-08-27 18:38:25 -04:00
|
|
|
GList *curr = used;
|
2013-08-27 17:02:23 -04:00
|
|
|
// skip console
|
2013-08-27 18:38:25 -04:00
|
|
|
curr = g_list_next(curr);
|
2013-08-27 17:02:23 -04:00
|
|
|
while (curr != NULL) {
|
|
|
|
int curr_num = GPOINTER_TO_INT(curr->data);
|
|
|
|
if (((last_num != 9) && ((last_num + 1) != curr_num)) ||
|
|
|
|
((last_num == 9) && (curr_num != 0))) {
|
|
|
|
result = last_num + 1;
|
|
|
|
if (result == 10) {
|
|
|
|
result = 0;
|
|
|
|
}
|
|
|
|
return (result);
|
|
|
|
} else {
|
|
|
|
last_num = curr_num;
|
|
|
|
if (last_num == 0) {
|
|
|
|
last_num = 10;
|
|
|
|
}
|
|
|
|
}
|
2013-08-27 18:38:25 -04:00
|
|
|
curr = g_list_next(curr);
|
2013-08-27 17:02:23 -04:00
|
|
|
}
|
|
|
|
result = last_num + 1;
|
|
|
|
if (result == 10) {
|
|
|
|
result = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
static size_t
|
|
|
|
_data_callback(void *ptr, size_t size, size_t nmemb, void *data)
|
|
|
|
{
|
|
|
|
size_t realsize = size * nmemb;
|
|
|
|
struct curl_data_t *mem = (struct curl_data_t *) data;
|
|
|
|
mem->buffer = realloc(mem->buffer, mem->size + realsize + 1);
|
|
|
|
|
|
|
|
if ( mem->buffer )
|
|
|
|
{
|
|
|
|
memcpy( &( mem->buffer[ mem->size ] ), ptr, realsize );
|
|
|
|
mem->size += realsize;
|
|
|
|
mem->buffer[ mem->size ] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return realsize;
|
|
|
|
}
|