f8edc32589
Introduce a new .init section for initialisation code, so that it can be copied to an area which is later overwritten before calling. The stack/bss can then overwrite that code, effectively freeing the code size that the initialisation routines need. Gives a few kB ram usage back. Only implemented for PP and as3525 so far. More targets could be added, as well as more functions. git-svn-id: svn://svn.rockbox.org/rockbox/trunk@25013 a1c6a512-1295-4272-9138-f99709370657
93 lines
3.1 KiB
C
93 lines
3.1 KiB
C
/***************************************************************************
|
|
* __________ __ ___.
|
|
* Open \______ \ ____ ____ | | _\_ |__ _______ ___
|
|
* Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
|
|
* Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
|
|
* Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
|
|
* \/ \/ \/ \/ \/
|
|
* $Id$
|
|
*
|
|
* Copyright (C) 2002 Daniel Stenberg
|
|
*
|
|
* 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 software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
* KIND, either express or implied.
|
|
*
|
|
****************************************************************************/
|
|
#ifndef _TREE_H_
|
|
#define _TREE_H_
|
|
|
|
#include <stdbool.h>
|
|
#include <applimits.h>
|
|
#include <file.h>
|
|
|
|
struct entry {
|
|
short attr; /* FAT attributes + file type flags */
|
|
unsigned long time_write; /* Last write time */
|
|
char *name;
|
|
};
|
|
|
|
|
|
/* browser context for file or db */
|
|
struct tree_context {
|
|
/* The directory we are browsing */
|
|
char currdir[MAX_PATH];
|
|
/* the number of directories we have crossed from / */
|
|
int dirlevel;
|
|
/* The currently selected file/id3dbitem index (old dircursor+dirfile) */
|
|
int selected_item;
|
|
/* The selected item in each directory crossed
|
|
* (used when we want to return back to a previouws directory)*/
|
|
int selected_item_history[MAX_DIR_LEVELS];
|
|
|
|
int firstpos; /* which dir entry is on first
|
|
position in dir buffer */
|
|
int pos_history[MAX_DIR_LEVELS];
|
|
|
|
int *dirfilter; /* file use */
|
|
int filesindir; /* The number of files in the dircache */
|
|
int dirsindir; /* file use */
|
|
int dirlength; /* total number of entries in dir, incl. those not loaded */
|
|
#ifdef HAVE_TAGCACHE
|
|
int table_history[MAX_DIR_LEVELS]; /* db use */
|
|
int extra_history[MAX_DIR_LEVELS]; /* db use */
|
|
int currtable; /* db use */
|
|
int currextra; /* db use */
|
|
#endif
|
|
/* A big buffer with plenty of entry structs,
|
|
* contains all files and dirs in the current
|
|
* dir (with filters applied) */
|
|
void* dircache;
|
|
int dircache_size;
|
|
char* name_buffer;
|
|
int name_buffer_size;
|
|
int dentry_size;
|
|
bool dirfull;
|
|
int sort_dir; /* directory sort order */
|
|
};
|
|
|
|
void tree_drawlists(void);
|
|
void tree_mem_init(void) INIT_ATTR;
|
|
void tree_gui_init(void) INIT_ATTR;
|
|
void get_current_file(char* buffer, int buffer_len);
|
|
void set_dirfilter(int l_dirfilter);
|
|
void set_current_file(char *path);
|
|
int rockbox_browse(const char *root, int dirfilter);
|
|
bool create_playlist(void);
|
|
void resume_directory(const char *dir);
|
|
char *getcwd(char *buf, int size);
|
|
void reload_directory(void);
|
|
bool check_rockboxdir(void);
|
|
struct tree_context* tree_get_context(void);
|
|
void tree_flush(void);
|
|
void tree_restore(void);
|
|
|
|
bool bookmark_play(char* resume_file, int index, int offset, int seed,
|
|
char *filename);
|
|
|
|
extern struct gui_synclist tree_lists;
|
|
#endif
|