Logo Search packages:      
Sourcecode: ne version File versions  Download package


/* Main typdefs and defines.

      Copyright (C) 1993-1998 Sebastiano Vigna 
      Copyright (C) 1999-2005 Todd M. Lewis and Sebastiano Vigna

      This file is part of ne, the nice editor.

      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, 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
      General Public License for more details.
      You should have received a copy of the GNU General Public License along
      with this program; see the file COPYING.  If not, write to the Free
      Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
      02111-1307, USA.  */

#ifndef TERMCAP
#include <curses.h>
#include <term.h>
#include <stdio.h>
#include "info2cap.h"

#include "termchar.h"
#include "utf8.h"

#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <fcntl.h>
#include <ctype.h>
#include <sys/types.h>
#include <sys/stat.h>

#ifdef _AMIGA
#define CURDIR ""
#define _S_IFDIR S_IFDIR
#define S_ISDIR(s) (s & _S_IFDIR)
#ifdef strcmp
#undef strcmp
#define CURDIR "."
#include <unistd.h>
#include <termios.h>

#ifndef min
#define   min(a,b)    ((a)<(b)?(a):(b))
#ifndef max
#define   max(a,b)    ((a)>(b)?(a):(b))

/* Include the list of all possible actions that do_action() can execute.
Note also that menu handling is governed by such a command (ESCAPE). */

#include "enums.h"

/* The input_class of a character is a first differentiation between
alphabetic, command-activating, and ignorable character. The class[] vector
(indexed by the extended character code) gives back the input class. */

typedef enum {
} input_class;

/* A buffer or clip at any given time may be marked as ASCII, UTF-8 or
8-bit. This means, respectively, that it contains just bytes below 0x80, an
UTF-8-encoded byte sequence or an arbitrary byte sequence.

The attribution is lazy, but stable. This means that a buffer starts as ASCII,
and becomes UTF-8 or 8-bit as soon as some insertion makes it necessary. This
is useful to delay the encoding choice as much as possible. */

typedef enum {
      ENC_ASCII = 0, ENC_UTF8, ENC_8_BIT
} encoding_type;

/* The number of bookmarks per buffer. It comprises the automatic bookmark (0). */

#define NUM_BOOKMARKS 11

/* The name of the default preferences file name. */

#define DEF_PREFS_NAME              ".default"

/* This is the name taken by unnamed documents. */

#define UNNAMED_NAME                      "<unnamed>"

/* The number of key codes, including ISO-8859-1 plus 256 extra codes. */

#define NUM_KEYS                          (256+256)

/* A key code that has class INVALID. */

#define INVALID_CHAR                      INT_MIN

/* The mask for commands. */

#define COMMAND_MASK                      0x80000000

#define CHAR_CLASS(c) ( ((c)<0) ? (((-c - 1) == INVALID_CHAR) ? INVALID : COMMAND) : ((c)>0xFF) ? ALPHA : char_class[c] )

/* This number is used throughout ne when an integer has to be expanded in
characters. It is expected that sprintf("%d")ing an integer will produce a
string shorter than the following number. PORTABILITY PROBLEM: improbable,
but possible. */

#define MAX_INT_LEN                       32

/* These are the list and node structures used throughout ne. See the exec.c
source for some elaborations on the subject. */

typedef struct struct_node {
    struct struct_node *next;
    struct struct_node *prev;
} node;

typedef struct {
   node *head;
   node *tail;
   node *tail_pred;
} list;

/* All the structures that follow have an assertion macro which checks for
partial internal consistency of the structure. These macros are extensively
used in the code. */

/* This structure represent a sequence, or stream, of NULL-terminated
strings. It is used for many purposes, such as storage of macros, clips,
etc. General functions allow to allocate, free, load, save and append to
such streams. Size represent the size of the chunk of memory pointed to by
stream, while len gives you the number of bytes currently used. You can
append in the last size-len bytes, or realloc() stream, updating size
correspondingly. */

typedef struct {
      int size, len;
      encoding_type encoding;
      unsigned char *stream;
} char_stream;

#define assert_char_stream(cs) {if ((cs)) {\
      assert((cs)->len >= 0);\
      assert(((cs)->size == 0) == ((cs)->stream == NULL));\

/* This structure defines a line descriptor; it is a node containing a pointer
to the line text, and an integer containing the line length in bytes. The
line pointer by ld_text is NOT NULL-terminated. line_len is zero iff line
is zero, in which case we are representing an empty line. ld_node->next
is NULL iff this node is free for use. */

typedef struct {
      node ld_node;
      unsigned char *line;
      int line_len;
} line_desc;

#define assert_line_desc(ld, encoding) {if ((ld)) {         \
      assert((ld)->line_len >= 0);\
      assert(((ld)->line == NULL) == ((ld)->line_len == 0));\
      assert(((ld)->line_len == 0) || ((ld)->line[0] != 0 && (ld)->line[(ld)->line_len - 1] != 0));\
      assert(((ld)->line_len == 0) || ((ld)->line[0] != 0 && (ld)->line[(ld)->line_len - 1] != 0)); \
      if (encoding == ENC_UTF8) { int i = 0; while(i < (ld)->line_len) { assert(utf8len((ld)->line[i]) > 0); i = next_pos((ld)->line, i, encoding);} } \

/* This structure defines a pool of line descriptors. pool points to an
array of size line descriptors. The first free descriptor is contained in
first_free. The last free descriptor is contained in last_free. The
allocated_items field keeps track of how many items are allocated. */

typedef struct {
      node ldp_node;
      list free_list;
      int size;
      int allocated_items;
      line_desc *pool;
} line_desc_pool;

#define assert_line_desc_pool(ldp) {if ((ldp)) {\
      assert((ldp)->allocated_items <= (ldp)->size);\
      assert((ldp)->allocated_items == (ldp)->size || (ldp)->free_list.head->next);\
      assert((ldp)->pool != NULL);\
      assert((ldp)->size != 0);\

/* This structure defines a pool of characters. size represents the size of
the pool pointed by pool, while first_used and last_used represent
the min and max characters which are used. A character is not used if it
is zero. It is perfectly possible (and likely) that between first_used
and last_used there are many free chars, which are named "lost" chars. See
the source buffer.c for some elaboration on the subject. */

typedef struct {
      node cp_node;
      int  size, first_used, last_used;
      unsigned char *pool;
} char_pool;

#define assert_char_pool(cp) {if ((cp)) {\
      assert((cp)->pool[(cp)->first_used] != 0);\
      assert((cp)->first_used >= 0);\
      assert((cp)->first_used == 0 || (cp)->pool[(cp)->first_used - 1] == 0);\
      assert((cp)->pool[(cp)->last_used] != 0);\
      assert((cp)->last_used >= 0);\
      assert((cp)->last_used == (cp)->size - 1 || (cp)->pool[(cp)->last_used + 1] == 0);\
      assert((cp)->pool != NULL);\
      assert((cp)->size != 0);\

/* This structure defines a macro. A macro is just a stream plus a node, a
file name and a hash code relative to the filename (it is used to make the
search for a given macro quicker). */

typedef struct struct_macro_desc {
      struct struct_macro_desc *next;
      char *name;
      char_stream *cs;
} macro_desc;

#define assert_macro_desc(md) if (md) assert_char_stream((md)->cs);

/* This structure defines a clip. Clip are numbered from 0 onwards, and
contain a stream of characters. The stream may be optionally marked as UTF-8. */

typedef struct {
      node cd_node;
      int n;
      char_stream *cs;
} clip_desc;

#define assert_clip_desc(cd) {if ((cd)) {\
      assert((cd)->n >= 0);\

/* An undo step is given by a position, a transformation which can be
INSERT_CHAR or DELETE_CHAR and the length of the stream to which the
transformation applies. For compactness reasons, the transformation is
really stored in the sign of the length. Plus means insert, minus means
delete. Note also that pos can be negative, in which case the real position
is -(pos+1), and the undo step is linked to the following one (in the sense
that they should be performed indivisibly). */

typedef struct {
      int line;
      int pos;
      int len;
} undo_step;

/* This structure defines an undo buffer. steps points to an array of
steps_size undo_steps, used up to cur_step. last_step represent the undo step
which is the next to be redone in case some undo had place. Note that the
characters stored in streams, which are used when executing an insertion undo
step, are not directly pointed to by the undo step. The correct position is
calculated incrementally, and kept in cur_stream and last_stream.  Redo
contains the stream of characters necessary to perform the redo
steps. last_save_step is the step (if any) corresponding to the last successful
buffer save operation. */

typedef struct {
      undo_step *steps;
      char *streams;
      char_stream redo;
      int steps_size;
      int streams_size;
      int cur_step;
      int cur_stream;
      int last_step;
      int last_stream;
      int last_save_step;
} undo_buffer;

#define assert_undo_buffer(ub) {if ((ub)) {\

/* This structure defines all the per document options which can be
used with PushPrefs and PopPrefs. */

typedef struct {
      int cur_clip;
      int tab_size;
      int right_margin;
      unsigned int
            free_form:1,       /* Editing is free form (cursor can be anywhere) */
            status_bar:1,      /* The status bar is displayed */
            hex_code:1,        /* Show hexadecimal code under the cursor */
            fast_gui:1,        /* GUI should be as fast as possible (phone lines, etc.) */
            word_wrap:1,       /* Word wrap is on */
            auto_indent:1,     /* Replicate indentation when creating a new line */
            preserve_cr:1,     /* Preserve Carriage Returns, don't treat as line terminators. */
            insert:1,          /* Insert mode */
            verbose_macros:1,  /* Macro learned are verbose */
            do_undo:1,         /* Record each action and allow undoing it */
            auto_prefs:1,      /* Use autoprefs */
            no_file_req:1,     /* Do not display the file requester */
            read_only:1,       /* Read-only mode */
            search_back:1,     /* Last search was backwards */
            case_search:1,     /* Look at case matching in searches */
            binary:1,          /* Load and save in binary mode */
            utf8auto:1;        /* Try to detect automatically UTF-8 */
  } options_t;

#define assert_options(o) {if ((o)) {\
      assert((o)->tab_size > 0);\

/* This structure defines a buffer node; a buffer is composed by two lists,
the list of line descriptor pools and the list of character pools, plus some
data as the current window and cursor position. The line descriptors are
kept in a list, too. The other fields are more or less self-documented.
wanted_x represents the position the cursor would like to be on, but cannot
because a line is too short or because it falls inside a TAB expansion. When
a flag is declared as multilevel, this means that the flag is
incremented/decremented rather than set/unset, so that activations and
deactivations can be nested. */

typedef struct {
      node b_node;
      list line_desc_pool_list;
      list line_desc_list;
      list char_pool_list;
      line_desc *cur_line_desc;
      line_desc *top_line_desc;
      char_stream *cur_macro;
      char_stream *last_deleted;
      char *filename;
      char *find_string;
      char *replace_string;
      char *command_line;
      int win_x, win_y;         /* line and pos of upper left-most visible character. */
      int cur_x, cur_y;         /* position of cursor within the window */
      int wanted_x;             /* desired x position modulo short lines, tabs, etc. Valid only if x_wanted is TRUE. */
      int wanted_y;             /* desired y position modulo top or bottom of buffer. Valid if y_wanted is TRUE. */
      int wanted_cur_y;         /* desired cur_y, valid if y_wanted is TRUE */
      int cur_line, cur_pos;    /* position of cursor withing the doc buffer */
      int num_lines;
      int block_start_line, block_start_col;
      int allocated_chars;
      int free_chars;
      encoding_type encoding;
      undo_buffer undo;
      struct {
            int pos;
            int line;
      } bookmark[NUM_BOOKMARKS];
      int bookmark_mask;        /* bit N is set if bookmark[N] is set */

      unsigned int

            link_undos,                                                 /* Link the undo steps. Multilevel. */
            is_modified:1,                            /* Buffer has been modified since last save */
            recording:1,                                                /* We are recording a macro */
            marking:1,                                                  /* We are marking a block */
            x_wanted:1,                                                 /* We're not where we would like to be */
            y_wanted:1,                                                 /* We've been paging up/down */
            exec_only_options:1,                                  /* Only option changes can be executed */
            find_string_changed:1,                          /* The search string has to be recompiled before use. */
            last_was_replace:1,                                   /* The last search operation was a replace */
            last_was_regexp:1,                                    /* The last search operation was done with regexps */
            undoing:1,                                                  /* We are currently undoing an action */
            redoing:1,                                                  /* We are currently redoing an action */
            mark_is_vertical:1,                                   /* The current marking is vertical */
            executing_internal_macro:1,               /* We are currently executing the internal macro of the current buffer */
            is_CRLF:1;                                /* Buffer should be saved with CR/LF terminators */

      options_t opt;                         /* These get pushed/popped on the prefs stack */
} buffer;

#define assert_buffer(b) {if ((b)) {\
      assert((b)->line_desc_list.head->next == NULL || (b)->cur_line_desc != NULL);\
      assert((b)->line_desc_list.head->next == NULL || (b)->top_line_desc != NULL);\
      assert_line_desc((b)->cur_line_desc, (b)->encoding);                                                  \
      assert_line_desc((b)->top_line_desc, (b)->encoding);                                                  \
      assert((b)->win_y + (b)->cur_y<(b)->num_lines);\
      assert((b)->num_lines > 0);\
      assert((b)->opt.tab_size > 0);\
      assert((b)->free_chars <= (b)->allocated_chars);\
      assert((b)->cur_line == (b)->win_y + (b)->cur_y);\
      assert((b)->cur_pos >= (b)->cur_line_desc->line_len || b->encoding != ENC_UTF8 || utf8len((b)->cur_line_desc->line[(b)->cur_pos] > 0));\

extern const char *key_binding[];

extern buffer *cur_buffer;

/* These are the global lists. */

extern list buffers, clips, macros;

/* This integer keeps the global turbo parameter. */

extern int turbo;

/* If true, we want the hardwired ANSI terminal, not a real one. */

extern int ansi;

/* This flag can be set anywhere to FALSE, and will become TRUE if the user
hits the interrupt key (usually CTRL-'\'). It is handled through SIGQUIT and

extern unsigned int stop;

/* This is set by the signal handler whenever a SIGWINCH happens.
   Somebody ought to use this. */

extern unsigned int window_changed_size;

/* This vector associates to an extended key code (as returned by
get_key_code()) its input class. */

extern const input_class char_class[];

/* This number defines the macro hash table size. This table can have
conflicts. */


/* Upcasing vectors for the regex library. */
extern unsigned char localised_up_case[];
extern const unsigned char ascii_up_case[];

#include "keycodes.h"
#include "names.h"
#include "errors.h"
#include "protos.h"
#include "utf8.h"
#include "debug.h"

#ifdef _AMIGA
#define set_fatal_code()
#define block_signals()
#define release_signals()
#define set_stop()
#define tilde_expand(x) (x)

/* In the unfortunate case we are compiling in some known system
      with a completely different handling of binary and ASCII files,
      we force the use of binary files. */

#ifdef O_BINARY

Generated by  Doxygen 1.6.0   Back to index