aboutsummaryrefslogtreecommitdiffstats
path: root/e-util/e-util.c-8611
blob: 33c10aba5cdbd3c23ee2de7cf28294abbb5b8c9b (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/* 
 * e-xml-utils.c
 * Copyright (C) 2000  Helix Code, Inc.
 * Author: Chris Lahey <clahey@helixcode.com>
 *
 * This library 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 library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */

#include <glib.h>
#include <gtk/gtkobject.h>
#include <errno.h>
#include <fcntl.h>
#include <unistd.h>
#include <ctype.h>

#include "e-util.h"

int
g_str_compare(const void *x, const void *y)
{
  return strcmp(x, y);
}

int
g_int_compare(const void *x, const void *y)
{
  if ( GPOINTER_TO_INT(x) < GPOINTER_TO_INT(y) )
    return -1;
  else if ( GPOINTER_TO_INT(x) == GPOINTER_TO_INT(y) )
    return 0;
  else
    return -1;
}

char *
e_strdup_strip(char *string)
{
    int i;
    int length = 0;
    int initial = 0;
    for ( i = 0; string[i]; i++ ) {
        if (initial == i && isspace(string[i])) {
            initial ++;
        }
        if (!isspace(string[i])) {
            length = i - initial + 1;
        }
    }
    return g_strndup(string + initial, length);
}

void
e_free_object_list (GList *list)
{
    GList *p;

    for (p = list; p != NULL; p = p->next)
        gtk_object_unref (GTK_OBJECT (p->data));

    g_list_free (list);
}

#define BUFF_SIZE 1024

char *
e_read_file(const char *filename)
{
    int fd;
    char buffer[BUFF_SIZE];
    GList *list = NULL, *list_iterator;
    GList *lengths = NULL, *lengths_iterator;
    int length = 0;
    int bytes;
    char *ret_val;

    fd = open(filename, O_RDONLY);
    if (fd == -1)
        return NULL;
    bytes = read(fd, buffer, BUFF_SIZE);
    while (bytes) {
        if (bytes > 0) {
            list = g_list_prepend(list, g_strndup(buffer, bytes));
            lengths = g_list_prepend(lengths, GINT_TO_POINTER(bytes));
            length += bytes;
        } else {
            if (errno != EINTR) {
                close(fd);
                g_list_foreach(list, (GFunc) g_free, NULL);
                g_list_free(list);
                g_list_free(lengths);
                return NULL;
            }
        }
        bytes = read(fd, buffer, BUFF_SIZE);
    }
    ret_val = g_new(char, length + 1);
    ret_val[length] = 0;
    lengths_iterator = lengths;
    list_iterator = list;
    for ( ; list_iterator; list_iterator = list_iterator->next, lengths_iterator = lengths_iterator->next) {
        int this_length = GPOINTER_TO_INT(lengths_iterator->data);
        length -= this_length;
        memcpy(ret_val + length, list_iterator->data, this_length);
    }
    close(fd);
    g_list_foreach(list, (GFunc) g_free, NULL);
    g_list_free(list);
    g_list_free(lengths);
    return ret_val;
}