2005-09-20 13:26:39 +00:00
/** \file history.h
Prototypes for history functions , part of the user interface .
*/
2005-10-04 15:11:39 +00:00
# ifndef FISH_HISTORY_H
# define FISH_HISTORY_H
# include <wchar.h>
2012-02-06 00:42:24 +00:00
# include "common.h"
# include "pthread.h"
# include <vector>
2012-02-06 06:30:42 +00:00
# include <deque>
# include <utility>
2012-02-15 19:33:41 +00:00
# include <list>
2012-02-06 00:42:24 +00:00
# include <tr1/memory>
2012-02-06 19:52:24 +00:00
# include <set>
2012-02-06 00:42:24 +00:00
2012-02-15 19:33:41 +00:00
typedef std : : list < wcstring > path_list_t ;
2012-02-06 18:52:13 +00:00
enum history_search_type_t {
/** The history searches for strings containing the given string */
HISTORY_SEARCH_TYPE_CONTAINS ,
/** The history searches for strings starting with the given string */
HISTORY_SEARCH_TYPE_PREFIX
} ;
2012-02-06 00:42:24 +00:00
class history_item_t {
friend class history_t ;
2012-02-16 08:24:27 +00:00
friend class history_lru_node_t ;
friend class history_tests_t ;
2012-02-06 00:42:24 +00:00
private :
2012-02-16 08:24:27 +00:00
explicit history_item_t ( const wcstring & ) ;
explicit history_item_t ( const wcstring & , time_t , const path_list_t & paths = path_list_t ( ) ) ;
2012-03-01 22:56:34 +00:00
/** Attempts to merge two compatible history items together */
bool merge ( const history_item_t & item ) ;
2012-02-06 00:42:24 +00:00
/** The actual contents of the entry */
wcstring contents ;
2012-03-01 22:56:34 +00:00
2012-02-06 00:42:24 +00:00
/** Original creation time for the entry */
2012-02-06 04:54:41 +00:00
time_t creation_timestamp ;
2012-02-06 00:42:24 +00:00
2012-02-15 19:33:41 +00:00
/** Paths that we require to be valid for this item to be autosuggested */
path_list_t required_paths ;
2012-02-06 00:42:24 +00:00
public :
const wcstring & str ( ) const { return contents ; }
bool empty ( ) const { return contents . empty ( ) ; }
2012-02-06 07:22:18 +00:00
2012-02-06 18:52:13 +00:00
/* Whether our contents matches a search term. */
bool matches_search ( const wcstring & term , enum history_search_type_t type ) const ;
2012-02-06 07:22:18 +00:00
2012-02-06 04:54:41 +00:00
time_t timestamp ( ) const { return creation_timestamp ; }
2012-02-16 08:24:27 +00:00
const path_list_t & get_required_paths ( ) const { return required_paths ; }
2012-02-06 04:54:41 +00:00
bool write_to_file ( FILE * f ) const ;
2012-02-16 08:24:27 +00:00
bool operator = = ( const history_item_t & other ) const {
return contents = = other . contents & &
creation_timestamp = = other . creation_timestamp & &
required_paths = = other . required_paths ;
}
/* Functions for testing only */
2012-02-06 00:42:24 +00:00
} ;
class history_t {
2012-02-16 08:24:27 +00:00
friend class history_tests_t ;
2012-02-06 00:42:24 +00:00
private :
/** No copying */
history_t ( const history_t & ) ;
history_t & operator = ( const history_t & ) ;
/** Private creator */
history_t ( const wcstring & pname ) ;
2012-02-16 08:24:27 +00:00
/** Privately add an item */
void add ( const history_item_t & item ) ;
2012-02-06 00:42:24 +00:00
/** Destructor */
~ history_t ( ) ;
/** Lock for thread safety */
pthread_mutex_t lock ;
2012-02-16 08:24:27 +00:00
/** Internal function */
void clear_file_state ( ) ;
2012-02-06 00:42:24 +00:00
/** The name of this list. Used for picking a suitable filename and for switching modes. */
const wcstring name ;
/** New items. */
std : : vector < history_item_t > new_items ;
2012-03-04 07:10:15 +00:00
/** How many items we've added without saving */
size_t unsaved_item_count ;
2012-02-06 00:42:24 +00:00
/** The mmaped region for the history file */
const char * mmap_start ;
/** The size of the mmaped region */
size_t mmap_length ;
2012-03-01 22:56:34 +00:00
/** Timestamp of when this history was created */
const time_t birth_timestamp ;
/** Timestamp of last save */
2012-02-06 00:42:24 +00:00
time_t save_timestamp ;
static history_item_t decode_item ( const char * ptr , size_t len ) ;
void populate_from_mmap ( void ) ;
/** List of old items, as offsets into out mmap data */
2012-02-16 08:24:27 +00:00
std : : deque < size_t > old_item_offsets ;
2012-02-06 00:42:24 +00:00
/** Whether we've loaded old items */
bool loaded_old ;
/** Loads old if necessary */
void load_old_if_needed ( void ) ;
2012-03-01 22:56:34 +00:00
/** Deletes duplicates in new_items. */
void compact_new_items ( ) ;
2012-02-06 04:54:41 +00:00
/** Saves history */
void save_internal ( ) ;
2012-02-16 08:24:27 +00:00
2012-02-06 00:42:24 +00:00
public :
/** Returns history with the given name, creating it if necessary */
static history_t & history_with_name ( const wcstring & name ) ;
/** Add a new history item to the end */
2012-02-15 19:33:41 +00:00
void add ( const wcstring & str , const path_list_t & valid_paths = path_list_t ( ) ) ;
/** Add a new history item to the end */
void add_with_file_detection ( const wcstring & str ) ;
2012-02-06 00:42:24 +00:00
/** Saves history */
void save ( ) ;
2012-02-16 08:24:27 +00:00
/** Irreversibly clears history */
void clear ( ) ;
/** Return the specified history at the specified index. 0 is the index of the current commandline. (So the most recent item is at index 1.) */
2012-02-06 00:42:24 +00:00
history_item_t item_at_index ( size_t idx ) ;
} ;
class history_search_t {
/** The history in which we are searching */
history_t * history ;
2012-02-06 06:30:42 +00:00
2012-02-06 18:52:13 +00:00
/** Our type */
enum history_search_type_t search_type ;
2012-02-06 06:30:42 +00:00
/** Our list of previous matches as index, value. The end is the current match. */
2012-02-16 08:24:27 +00:00
typedef std : : pair < size_t , history_item_t > prev_match_t ;
2012-02-06 06:30:42 +00:00
std : : deque < prev_match_t > prev_matches ;
/** Returns yes if a given term is in prev_matches. */
bool match_already_made ( const wcstring & match ) const ;
2012-02-06 00:42:24 +00:00
/** The search term */
wcstring term ;
2012-02-06 19:52:24 +00:00
/** Additional strings to skip (sorted) */
wcstring_list_t external_skips ;
bool should_skip_match ( const wcstring & str ) const ;
2012-02-06 06:30:42 +00:00
public :
2012-02-16 08:24:27 +00:00
/** Gets the search term */
const wcstring & get_term ( ) const { return term ; }
2012-02-06 00:42:24 +00:00
2012-02-06 19:52:24 +00:00
/** Sets additional string matches to skip */
void skip_matches ( const wcstring_list_t & skips ) ;
2012-02-06 00:42:24 +00:00
/** Finds the next search term (forwards in time). Returns true if one was found. */
bool go_forwards ( void ) ;
/** Finds the previous search result (backwards in time). Returns true if one was found. */
bool go_backwards ( void ) ;
/** Goes to the end (forwards) */
void go_to_end ( void ) ;
2012-02-06 07:22:18 +00:00
/** Returns if we are at the end. We start out at the end. */
bool is_at_end ( void ) const ;
2012-02-06 00:42:24 +00:00
/** Goes to the beginning (backwards) */
void go_to_beginning ( void ) ;
2012-02-16 08:24:27 +00:00
/** Returns the current search result item. asserts if there is no current item. */
history_item_t current_item ( void ) const ;
/** Returns the current search result item contents. asserts if there is no current item. */
wcstring current_string ( void ) const ;
2012-02-06 00:42:24 +00:00
/** Constructor */
2012-02-06 18:52:13 +00:00
history_search_t ( history_t & hist , const wcstring & str , enum history_search_type_t type = HISTORY_SEARCH_TYPE_CONTAINS ) :
2012-02-06 00:42:24 +00:00
history ( & hist ) ,
2012-02-06 18:52:13 +00:00
search_type ( type ) ,
2012-02-06 06:30:42 +00:00
term ( str )
2012-02-06 04:54:41 +00:00
{ }
2012-02-06 00:42:24 +00:00
/* Default constructor */
history_search_t ( ) :
history ( ) ,
2012-02-06 18:52:13 +00:00
search_type ( HISTORY_SEARCH_TYPE_CONTAINS ) ,
2012-02-06 06:30:42 +00:00
term ( )
2012-02-06 04:54:41 +00:00
{ }
2012-02-06 00:42:24 +00:00
} ;
2005-10-04 15:11:39 +00:00
2005-09-20 13:26:39 +00:00
/**
2006-02-06 15:08:10 +00:00
Init history library . The history file won ' t actually be loaded
until the first time a history search is performed .
2005-09-20 13:26:39 +00:00
*/
void history_init ( ) ;
/**
2012-02-06 00:42:24 +00:00
Saves the new history to disc .
2005-09-20 13:26:39 +00:00
*/
void history_destroy ( ) ;
/**
Perform sanity checks
*/
void history_sanity_check ( ) ;
2012-02-16 08:24:27 +00:00
/* A helper class for threaded detection of paths */
struct file_detection_context_t {
/* Constructor */
file_detection_context_t ( history_t * hist , const wcstring & cmd ) ;
/* Determine which of potential_paths are valid, and put them in valid_paths */
int perform_file_detection ( ) ;
/* The history associated with this context */
history_t * history ;
/* The command */
wcstring command ;
/* When the command was issued */
time_t when ;
/* The working directory at the time the command was issued */
wcstring working_directory ;
/* Paths to test */
path_list_t potential_paths ;
/* Paths that were found to be valid */
path_list_t valid_paths ;
/* Performs file detection. Returns 1 if every path in potential_paths is valid, 0 otherwise. If test_all is true, tests every path; otherwise stops as soon as it reaches an invalid path. */
int perform_file_detection ( bool test_all ) ;
/* Determine whether the given paths are all valid */
bool paths_are_valid ( const path_list_t & paths ) ;
} ;
2005-10-04 15:11:39 +00:00
# endif