Commit d8ad1588 authored by Richard P. Curnow's avatar Richard P. Curnow

Whitespace cleanup

parent 43f89bbb
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2002-2004
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -41,7 +41,7 @@ static enum DATESCAN_TYPE discover_type(char *first, char *last)/*{{{*/
if (current_state < 0) break;
p++;
}
if (current_state < 0) {
return DS_FAILURE;
} else {
......@@ -120,7 +120,7 @@ static int scan_date_expr(char *first, char *last, struct tm *start, struct tm *
{
enum DATESCAN_TYPE type;
time_t now;
time(&now);
type = discover_type(first, last);
......@@ -161,7 +161,7 @@ static int scan_date_expr(char *first, char *last, struct tm *start, struct tm *
int v1, v3;
int m2; /* decoded month */
char *p;
v1 = v3 = m2 = 0;
p = first;
while (p < last && isdigit(*p)) {
......@@ -174,7 +174,7 @@ static int scan_date_expr(char *first, char *last, struct tm *start, struct tm *
if (m2 == 0) {
return -1; /* failure */
}
}
while (p < last && isdigit(*p)) {
v3 = (v3*10) + (*p - '0');
......@@ -257,7 +257,7 @@ static int scan_date_expr(char *first, char *last, struct tm *start, struct tm *
if (start) {
start->tm_mon = m2-1;
start->tm_mday = v1;
start->tm_year = year_fix(v3);
start->tm_year = year_fix(v3);
}
if (end) {
end->tm_mon = m2-1;
......@@ -311,7 +311,7 @@ static int scan_date_expr(char *first, char *last, struct tm *start, struct tm *
case DS_SCALED:
assert(0);
break;
}
}
return 0;
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2002-2004
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -40,6 +40,6 @@ enum DATESCAN_TYPE {
extern int datescan_next_state(int current_state, int next_token);
extern enum DATESCAN_TYPE datescan_exitval[];
#endif /* DATES_H */
......@@ -7,12 +7,12 @@
# This program is free software; you can redistribute it and/or modify
# it under the terms of version 2 of the GNU General Public License as
# published by the Free Software Foundation.
#
#
# 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.,
# 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
......@@ -78,12 +78,12 @@ BLOCK main {
<month:in->out> ; <year:in->out> = DS_MY
<ccyy:in->out> ; <month:in->out> = DS_YM
<month:in->out> ; <ccyy:in->out> = DS_MY
<year:in->out> ; <month:in->out> ; [1-9] = DS_YMD
<year:in->out> ; <month:in->out> ; <day:in->out> = DS_YMD
[1-9] ; <month:in->out> ; <year:in->out> = DS_DMY
<day:in->out> ; <month:in->out> ; <year:in->out> = DS_DMY
<ccyy:in->out> ; <month:in->out> ; [1-9] = DS_YMD
<ccyy:in->out> ; <month:in->out> ; <day:in->out> = DS_YMD
[1-9] ; <month:in->out> ; <ccyy:in->out> = DS_DMY
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2002,2003,2004,2005
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -60,7 +60,7 @@ static void check_toktable_enc_integrity(int n_msgs, struct toktable *table)/*{{
int broken_chains = 0;
struct sortable_token *sort_list;
int any_duplicates;
for (i=0; i<table->size; i++) {
struct token *tok = table->tokens[i];
if (tok) {
......@@ -104,7 +104,7 @@ static void check_toktable_enc_integrity(int n_msgs, struct toktable *table)/*{{
any_duplicates = 0;
for (i=0; i<(table->n - 1); i++) {
if (!strcmp(sort_list[i].text, sort_list[i+1].text)) {
fprintf(stderr, "Token table contains duplicated token %s at indices %d and %d\n",
fprintf(stderr, "Token table contains duplicated token %s at indices %d and %d\n",
sort_list[i].text, sort_list[i].index, sort_list[i+1].index);
any_duplicates = 1;
}
......@@ -136,7 +136,7 @@ static void check_message_path_integrity(struct database *db)/*{{{*/
int i;
int n;
int has_duplicate = 0;
char **paths;
paths = new_array(char *, db->n_msgs);
for (i=0, n=0; i<db->n_msgs; i++) {
......@@ -170,7 +170,7 @@ void check_database_integrity(struct database *db)/*{{{*/
{
if (verbose) fprintf(stderr, "Checking message path integrity\n");
check_message_path_integrity(db);
/* Just check encoding chains for now */
if (verbose) fprintf(stderr, "Checking to\n");
check_toktable_enc_integrity(db->n_msgs, db->to);
......@@ -403,12 +403,12 @@ static void import_toktable2(char *data, unsigned int hash_key, int n_msgs, stru
}
/*}}}*/
struct database *new_database_from_file(char *db_filename, int do_integrity_checks)/*{{{*/
{
{
/* Read existing database from file for doing incremental update */
struct database *result;
struct read_db *input;
int i, n, N;
result = new_database();
input = open_db(db_filename);
if (!input) {
......@@ -496,7 +496,7 @@ struct database *new_database_from_file(char *db_filename, int do_integrity_chec
if (do_integrity_checks) {
check_database_integrity(result);
}
return result;
}
/*}}}*/
......@@ -575,7 +575,7 @@ static void tokenise_string(int file_index, unsigned int hash_key, struct toktab
if (!*ss) break;
es = ss + 1;
while (*es && char_valid_p(*es,match_mask)) es++;
/* deal with token [ss,es) */
old_es = *es;
*es = '\0';
......@@ -593,7 +593,7 @@ static void tokenise_html_string(int file_index, unsigned int hash_key, struct t
char *ss, *es, old_es;
/* FIXME : Probably want to rewrite this as an explicit FSM */
ss = data;
for (;;) {
/* Assume < and > are never valid token characters ! */
......@@ -604,10 +604,10 @@ static void tokenise_html_string(int file_index, unsigned int hash_key, struct t
}
}
if (!*ss) break;
es = ss + 1;
while (*es && char_valid_p(*es, 1)) es++;
/* deal with token [ss,es) */
old_es = *es;
*es = '\0';
......@@ -688,7 +688,7 @@ static void scan_new_messages(struct database *db, int start_at)/*{{{*/
msg = make_rfc822(db->msgs[i].src.mpf.path);
break;
}
if(msg)
if(msg)
{
db->msgs[i].date = msg->hdrs.date;
tokenise_message(i, db, msg);
......@@ -738,11 +738,11 @@ static void find_threading(struct database *db)/*{{{*/
int i, m, np, nm, sm;
int next_tid;
np = db->n_msgs;
nm = db->msg_ids->n;
sm = db->msg_ids->size;
ix = new_array(int, np);
for (i=0; i<np; i++) {
ix[i] = i; /* default - every message in a thread of its own */
......@@ -853,7 +853,7 @@ int update_database(struct database *db, struct msgpath *sorted_paths, int n_msg
int matched_index;
int i, new_entries_start_at;
int any_new, n_newly_pruned, n_already_dead;
file_in_db = new_array(char, n_msgs);
file_in_new_list = new_array(char, db->n_msgs);
bzero(file_in_db, n_msgs);
......@@ -883,7 +883,7 @@ int update_database(struct database *db, struct msgpath *sorted_paths, int n_msg
/* Add new entries to database */
new_entries_start_at = db->n_msgs;
for (i=0; i<db->n_msgs; i++) {
/* Weed dead entries */
switch (db->type[i]) {
......@@ -936,13 +936,13 @@ int update_database(struct database *db, struct msgpath *sorted_paths, int n_msg
/* Add newly found mbox messages. */
any_new |= add_mbox_messages(db);
if (any_new) {
find_threading(db);
} else {
if (verbose) fprintf(stderr, "No new messages found\n");
}
free(file_in_db);
free(file_in_new_list);
......@@ -958,7 +958,7 @@ static void recode_encoding(struct matches *m, int *new_idx)/*{{{*/
old_enc = m->msginfo;
j = old_enc;
last_char = old_enc + m->n;
new_enc = new_array(unsigned char, m->max); /* Probably not bigger than this. */
m->n = 0;
m->highest = 0;
......@@ -983,7 +983,7 @@ static void recode_toktable(struct toktable *tbl, int *new_idx)/*{{{*/
int i;
int any_dead = 0;
int any_moved, pass;
for (i=0; i<tbl->size; i++) {
struct token *tok = tbl->tokens[i];
if (tok) {
......@@ -1066,7 +1066,7 @@ static void recode_toktable2(struct toktable2 *tbl, int *new_idx)/*{{{*/
int i;
int any_dead = 0;
int any_moved, pass;
for (i=0; i<tbl->size; i++) {
struct token2 *tok = tbl->tokens[i];
if (tok) {
......@@ -1181,7 +1181,7 @@ int cull_dead_messages(struct database *db, int do_integrity_checks)/*{{{*/
recode_toktable(db->subject, new_idx);
recode_toktable(db->body, new_idx);
recode_toktable2(db->msg_ids, new_idx);
/* And crunch down the filename table */
for (i=0, j=0; i<n_old; i++) {
switch (db->type[i]) {
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2002,2003,2004,2005
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -88,10 +88,10 @@ static void get_maildir_message_paths(char *folder, struct msgpath_array *arr)/*
int folder_len = strlen(folder);
/* FIXME : just store mdir-rooted paths in array and have common prefix elsewhere. */
subdir = new_array(char, folder_len + 6);
fname = new_array(char, folder_len + 8 + NAME_MAX);
for (i=0; i<2; i++) {
for (i=0; i<2; i++) {
strcpy(subdir, folder);
strcat(subdir, "/");
strcat(subdir, subdirs[i]);
......@@ -120,7 +120,7 @@ static void get_maildir_message_paths(char *folder, struct msgpath_array *arr)/*
int valid_mh_filename_p(const char *x)/*{{{*/
{
const char *p;
if (!*x) return 0; /* Must not be empty */
p = x;
while (*p) {
......@@ -176,7 +176,7 @@ static int child_stat(const char *base, const char *child, struct stat *sb)/*{{{
strcpy(scratch, base);
strcat(scratch, "/");
strcat(scratch, child);
result = stat(scratch, sb);
free(scratch);
return result;
......@@ -187,7 +187,7 @@ static int has_child_file(const char *base, const char *child)/*{{{*/
int result = 0;
int status;
struct stat sb;
status = child_stat(base, child, &sb);
if ((status >= 0) && S_ISREG(sb.st_mode)) {
result = 1;
......@@ -201,7 +201,7 @@ static int has_child_dir(const char *base, const char *child)/*{{{*/
int result = 0;
int status;
struct stat sb;
status = child_stat(base, child, &sb);
if ((status >= 0) && S_ISDIR(sb.st_mode)) {
result = 1;
......@@ -265,10 +265,10 @@ int filter_is_mh(const char *path, const struct stat *sb)/*{{{*/
has_child_file(path, ".mh_sequences") ||
/* Sylpheed */
has_child_file(path, ".sylpheed_cache") ||
has_child_file(path, ".sylpheed_mark") ||
has_child_file(path, ".sylpheed_mark") ||
/* NNML (Gnus) */
has_child_file(path, ".marks") ||
has_child_file(path, ".overview") ||
has_child_file(path, ".overview") ||
/* Evolution */
has_child_file(path, "cmeta") ||
has_child_file(path, "summary") ||
......@@ -314,7 +314,7 @@ static void scan_directory(char *folder_base, char *this_folder, enum folder_typ
default:
break;
}
fname = new_array(char, strlen(name) + 2 + NAME_MAX);
sname = new_array(char, this_folder_len + 2 + NAME_MAX);
......@@ -353,7 +353,7 @@ static void scan_directory(char *folder_base, char *this_folder, enum folder_typ
static int message_compare(const void *a, const void *b)/*{{{*/
{
/* FIXME : Is this a sensible way to do this with mbox messages in the picture? */
struct msgpath *aa = (struct msgpath *) a;
struct msgpath *aa = (struct msgpath *) a;
struct msgpath *bb = (struct msgpath *) b;
/* This should only get called on 'file' type messages - TBC! */
return strcmp(aa->src.mpf.path, bb->src.mpf.path);
......@@ -390,7 +390,7 @@ void build_message_list(char *folder_base, char *folders, enum folder_type ft,
assert(0);
break;
}
if (paths) free(paths);
sort_message_list(msgs);
......@@ -403,7 +403,7 @@ int main (int argc, char **argv)
{
int i;
struct msgpath_array *arr;
arr = build_message_list(".");
for (i=0; i<arr->n; i++) {
......@@ -411,7 +411,7 @@ int main (int argc, char **argv)
}
free_msgpath_array(arr);
return 0;
}
#endif
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2005
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -39,7 +39,7 @@ void lock_database(char *path, int forced_unlock)/*{{{*/
char *tname;
struct stat sb;
FILE *out;
if (uname(&uu) < 0) {
perror("uname");
exit(1);
......@@ -58,7 +58,7 @@ void lock_database(char *path, int forced_unlock)/*{{{*/
unlock_database();
forced_unlock = 0;
}
len += strlen(uu.nodename);
/* add on max width of pid field (allow up to 32 bit pid_t) + 2 '.' chars */
len += (10 + 2);
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2004, 2005
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -69,7 +69,7 @@ void dump_database(char *filename)
{
struct read_db *db;
int i;
db = open_db(filename);
printf("Dump of %s\n", filename);
......@@ -81,7 +81,7 @@ void dump_database(char *filename)
printf("DEAD");
break;
case DB_MSG_FILE:
printf("FILE %s, size=%d, tid=%d",
printf("FILE %s, size=%d, tid=%d",
db->data + db->path_offsets[i], db->size_table[i], db->tid_table[i]);
break;
case DB_MSG_MBOX:
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2004
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -32,7 +32,7 @@ static int isenv(unsigned char x)/*{{{*/
/* Return true if x is valid as part of an environment variable name. */
if (isalnum(x))
return 1;
else if (x == '_')
else if (x == '_')
return 1;
else
return 0;
......@@ -167,7 +167,7 @@ static void do_expand(const char *p, char *result)/*{{{*/
char *expand_string(const char *p)/*{{{*/
{
/* Return a copy of p, but with
~ expanded to the user's home directory
$env expanded to the value of that environment variable
*/
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2002-2004
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......
......@@ -7,12 +7,12 @@
# This program is free software; you can redistribute it and/or modify
# it under the terms of version 2 of the GNU General Public License as
# published by the Free Software Foundation.
#
#
# 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.,
# 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
......@@ -99,7 +99,7 @@ BLOCK date {
# Accept HH:MM
DIGIT ; DIGIT ; COLON ; DIGIT ; DIGIT ; WHITE -> after_time
# Allow either 1 or 2 words of timezone
# Allow either 1 or 2 words of timezone
STATE after_time
WHITE -> after_time
-> after_timezone
......@@ -121,11 +121,11 @@ BLOCK date {
STATE after_timezone_after_year
WHITE -> after_timezone_after_year
-> out
STATE after_timezone_1
WHITE -> after_timezone_1
<zone:in->out> ; WHITE -> after_timezone
STATE after_timezone
WHITE -> after_timezone
DIGIT ; DIGIT ; DIGIT ; DIGIT -> after_year
......@@ -133,7 +133,7 @@ BLOCK date {
STATE after_year
WHITE -> after_year
-> out
}
# Assume the earlier code has identified the '\nFrom ' sequence,
......@@ -145,7 +145,7 @@ BLOCK main {
# Real return address.
WHITE -> in
<email:in->out> -> before_date
# Cope with Mozilla mbox folder format which just uses a '-' as
# the return address field.
PLUSMINUS -> before_date
......
......@@ -3,20 +3,20 @@
**********************************************************************
* Copyright (C) Richard P. Curnow 2003,2004,2005
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -333,14 +333,14 @@ void run1(char *ref, char *s, int expected)/*{{{*/
int result;
g = make_globber(ref);
result = is_glob_match(g, s);
printf("ref=%s, str=%s, %s %s\n", ref, s, result ? "MATCHED" : "not matched", (expected==result) ? "" : "??????");
free_globber(g);
}
/*}}}*/
int main (int argc, char **argv)/*{{{*/
{
run1("ab?de", "abdde", 1);
run1("ab?de", "abcde", 1);
run1("ab?de", "Abcde", 0);
......@@ -385,7 +385,7 @@ int main (int argc, char **argv)/*{{{*/
run1("x/*/abc**", "x/z/ww/abc/y", 0);
run1("x/**/abc**", "x/z/w/abc/y", 1);
run1("x/**/abc**", "x/zz/w/abc/y", 1);
return 0;
}
/*}}}*/
......
......@@ -27,16 +27,16 @@ For every delta with one or two bit set, and the deltas of all three
have at least 1/4 probability of changing.
* If mix() is run forward, every bit of c will change between 1/3 and
2/3 of the time. (Well, 22/100 and 78/100 for some 2-bit deltas.)
mix() was built out of 36 single-cycle latency instructions in a
mix() was built out of 36 single-cycle latency instructions in a
structure that could supported 2x parallelism, like so:
a -= b;
a -= b;
a -= c; x = (c>>13);
b -= c; a ^= x;
b -= a; x = (a<<8);
c -= a; b ^= x;
c -= b; x = (b>>13);
...
Unfortunately, superscalar Pentiums and Sparcs can't take advantage
Unfortunately, superscalar Pentiums and Sparcs can't take advantage
of that parallelism. They've also turned some of those single-cycle
latency instructions into multi-cycle latency instructions. Still,
this is the fastest good hash I could find. There were about 2^^68
......
......@@ -5,20 +5,20 @@
* Copyright (C) Richard P. Curnow 2002,2003,2004,2005
* Copyright (C) Sanjoy Mahajan 2005
* - mfolder validation code
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
*
* 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.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*
**********************************************************************
*/
......@@ -95,7 +95,7 @@ int member_of (const char *complete_mfolder,
glob_and_expand_paths(folder_base, raw_paths, n_raw_paths, &paths, &n_paths, &mbox_traverse_methods, omit_globs);
break;
case FT_RAW: /* cannot happen but to keep compiler happy */
break;
break;
}
for (i=0; i<n_paths; i++) {
struct stat mfolder_sb, src_folder_sb; /* for checking inode numbers */
......@@ -114,7 +114,7 @@ int member_of (const char *complete_mfolder,
if (mfolder_sb.st_ino == src_folder_sb.st_ino)
return 1;
}
return 0;
return 0;
}
/*}}}*/
static char *copy_value(char *text)/*{{{*/
......@@ -131,7 +131,7 @@ static char *copy_value(char *text)/*{{{*/
static