/*
* Copyright (C) 1996-8 Michael R. Elkins <me@cs.hmc.edu>
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "mutt.h"
#include "mutt_curses.h"
#include "mutt_menu.h"
#include "buffy.h"
#include "mapping.h"
#include "sort.h"
#include "mailbox.h"
#include <stdlib.h>
#include <dirent.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <sys/stat.h>
#include <pwd.h>
#include <grp.h>
struct folder_file
{
mode_t mode;
time_t mtime;
off_t size;
char *name;
char *desc;
};
struct browser_state
{
struct folder_file *entry;
short entrylen; /* number of real entries */
short entrymax; /* max entry */
};
static struct mapping_t FolderHelp[] = {
{ N_("Exit"), OP_EXIT },
{ N_("Chdir"), OP_CHANGE_DIRECTORY },
{ N_("Mask"), OP_ENTER_MASK },
{ N_("Help"), OP_HELP },
{ NULL }
};
typedef struct folder_t
{
const char *name;
const struct stat *f;
int new;
} FOLDER;
static char LastDir[_POSIX_PATH_MAX] = "";
/* Frees up the memory allocated for the local-global variables. */
static void destroy_state (struct browser_state *state)
{
int c;
for (c = 0; c < state->entrylen; c++)
{
safe_free ((void **) &((state->entry)[c].name));
safe_free ((void **) &((state->entry)[c].desc));
}
safe_free ((void **) &state->entry);
}
static int browser_compare_subject (const void *a, const void *b)
{
struct folder_file *pa = (struct folder_file *) a;
struct folder_file *pb = (struct folder_file *) b;
int r = strcmp (pa->name, pb->name);
return ((BrowserSort & SORT_REVERSE) ? -r : r);
}
static int browser_compare_date (const void *a, const void *b)
{
struct folder_file *pa = (struct folder_file *) a;
struct folder_file *pb = (struct folder_file *) b;
int r = pa->mtime - pb->mtime;
return ((BrowserSort & SORT_REVERSE) ? -r : r);
}
static int browser_compare_size (const void *a, const void *b)
{
struct folder_file *pa = (struct folder_file *) a;
struct folder_file *pb = (struct folder_file *) b;
int r = pa->size - pb->size;
return ((BrowserSort & SORT_REVERSE) ? -r : r);
}
static void browser_sort (struct browser_state *state)
{
int (*f) (const void *, const void *);
switch (BrowserSort & SORT_MASK)
{
case SORT_ORDER:
return;
case SORT_DATE:
f = browser_compare_date;
break;
case SORT_SIZE:
f = browser_compare_size;
break;
case SORT_SUBJECT:
default:
f = browser_compare_subject;
break;
}
qsort (state->entry, state->entrylen, sizeof (struct folder_file), f);
}
static int link_is_dir (const char *path)
{
struct stat st;
if (stat (path, &st) == 0)
return (S_ISDIR (st.st_mode));
else
return (-1);
}
static const char *
folder_format_str (char *dest, size_t destlen, char op, const char *src,
const char *fmt, const char *ifstring, const char *elsestring,
unsigned long data, format_flag flags)
{
char fn[SHORT_STRING], tmp[SHORT_STRING], permission[11];
char date[16], *t_fmt;
time_t tnow;
FOLDER *folder = (FOLDER *) data;
struct passwd *pw;
struct group *gr;
switch (op)
{
case 'd':
if (folder->f != NULL)
{
tnow = time (NULL);
t_fmt = tnow - folder->f->st_mtime < 31536000 ? "%b %d %H:%M" :