Home | History | Annotate | Line # | Download | only in libform
internals.c revision 1.29
      1  1.29  lukem /*	$NetBSD: internals.c,v 1.29 2003/03/09 00:57:18 lukem Exp $	*/
      2   1.1  blymn 
      3   1.1  blymn /*-
      4   1.1  blymn  * Copyright (c) 1998-1999 Brett Lymn
      5   1.1  blymn  *                         (blymn (at) baea.com.au, brett_lymn (at) yahoo.com.au)
      6   1.1  blymn  * All rights reserved.
      7   1.1  blymn  *
      8   1.1  blymn  * This code has been donated to The NetBSD Foundation by the Author.
      9   1.1  blymn  *
     10   1.1  blymn  * Redistribution and use in source and binary forms, with or without
     11   1.1  blymn  * modification, are permitted provided that the following conditions
     12   1.1  blymn  * are met:
     13   1.1  blymn  * 1. Redistributions of source code must retain the above copyright
     14   1.1  blymn  *    notice, this list of conditions and the following disclaimer.
     15   1.1  blymn  * 2. The name of the author may not be used to endorse or promote products
     16  1.18  blymn  *    derived from this software without specific prior written permission
     17   1.1  blymn  *
     18   1.1  blymn  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     19   1.1  blymn  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     20   1.1  blymn  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     21   1.1  blymn  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     22   1.1  blymn  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     23   1.1  blymn  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     24   1.1  blymn  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     25   1.1  blymn  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     26   1.1  blymn  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     27   1.1  blymn  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     28   1.1  blymn  *
     29   1.1  blymn  *
     30   1.1  blymn  */
     31  1.29  lukem 
     32  1.29  lukem #include <sys/cdefs.h>
     33  1.29  lukem __RCSID("$NetBSD: internals.c,v 1.29 2003/03/09 00:57:18 lukem Exp $");
     34   1.1  blymn 
     35  1.15  blymn #include <limits.h>
     36   1.1  blymn #include <ctype.h>
     37   1.1  blymn #include <stdio.h>
     38   1.1  blymn #include <stdlib.h>
     39   1.1  blymn #include <strings.h>
     40  1.15  blymn #include <assert.h>
     41   1.1  blymn #include "internals.h"
     42   1.1  blymn #include "form.h"
     43   1.1  blymn 
     44   1.2  blymn #ifdef DEBUG
     45   1.2  blymn /*
     46   1.2  blymn  *  file handle to write debug info to, this will be initialised when
     47   1.2  blymn  *  the form is first posted.
     48   1.2  blymn  */
     49   1.2  blymn FILE *dbg = NULL;
     50  1.23  blymn 
     51  1.23  blymn /*
     52  1.23  blymn  * map the request numbers to strings for debug
     53  1.23  blymn  */
     54  1.23  blymn char *reqs[] = {
     55  1.23  blymn 	"NEXT_PAGE", "PREV_PAGE", "FIRST_PAGE",	"LAST_PAGE", "NEXT_FIELD",
     56  1.23  blymn 	"PREV_FIELD", "FIRST_FIELD", "LAST_FIELD", "SNEXT_FIELD",
     57  1.23  blymn 	"SPREV_FIELD", "SFIRST_FIELD", "SLAST_FIELD", "LEFT_FIELD",
     58  1.23  blymn 	"RIGHT_FIELD", "UP_FIELD", "DOWN_FIELD", "NEXT_CHAR", "PREV_CHAR",
     59  1.23  blymn 	"NEXT_LINE", "PREV_LINE", "NEXT_WORD", "PREV_WORD", "BEG_FIELD",
     60  1.23  blymn 	"END_FIELD", "BEG_LINE", "END_LINE", "LEFT_CHAR", "RIGHT_CHAR",
     61  1.23  blymn 	"UP_CHAR", "DOWN_CHAR", "NEW_LINE", "INS_CHAR", "INS_LINE",
     62  1.23  blymn 	"DEL_CHAR", "DEL_PREV", "DEL_LINE", "DEL_WORD", "CLR_EOL",
     63  1.23  blymn 	"CLR_EOF", "CLR_FIELD", "OVL_MODE", "INS_MODE", "SCR_FLINE",
     64  1.23  blymn 	"SCR_BLINE", "SCR_FPAGE", "SCR_BPAGE", "SCR_FHPAGE", "SCR_BHPAGE",
     65  1.23  blymn 	"SCR_FCHAR", "SCR_BCHAR", "SCR_HFLINE", "SCR_HBLINE", "SCR_HFHALF",
     66  1.23  blymn 	"SCR_HBHALF", "VALIDATION", "PREV_CHOICE", "NEXT_CHOICE" };
     67   1.2  blymn #endif
     68   1.2  blymn 
     69   1.1  blymn /* define our own min function - this is not generic but will do here
     70   1.1  blymn  * (don't believe me?  think about what value you would get
     71   1.1  blymn  * from min(x++, y++)
     72   1.1  blymn  */
     73   1.1  blymn #define min(a,b) (((a) > (b))? (b) : (a))
     74   1.1  blymn 
     75   1.1  blymn /* for the line joining function... */
     76   1.1  blymn #define JOIN_NEXT    1
     77   1.1  blymn #define JOIN_NEXT_NW 2 /* next join, don't wrap the joined line */
     78   1.1  blymn #define JOIN_PREV    3
     79   1.1  blymn #define JOIN_PREV_NW 4 /* previous join, don't wrap the joined line */
     80   1.1  blymn 
     81  1.15  blymn /* for the bump_lines function... */
     82  1.15  blymn #define _FORMI_USE_CURRENT -1 /* indicates current cursor pos to be used */
     83  1.15  blymn 
     84   1.1  blymn static void
     85   1.8  blymn _formi_do_char_validation(FIELD *field, FIELDTYPE *type, char c, int *ret_val);
     86   1.8  blymn static void
     87   1.1  blymn _formi_do_validation(FIELD *field, FIELDTYPE *type, int *ret_val);
     88   1.1  blymn static int
     89  1.15  blymn _formi_join_line(FIELD *field, unsigned int pos, int direction);
     90   1.1  blymn void
     91   1.1  blymn _formi_hscroll_back(FIELD *field, unsigned int amt);
     92   1.1  blymn void
     93   1.1  blymn _formi_hscroll_fwd(FIELD *field, unsigned int amt);
     94   1.1  blymn static void
     95   1.1  blymn _formi_scroll_back(FIELD *field, unsigned int amt);
     96   1.1  blymn static void
     97   1.1  blymn _formi_scroll_fwd(FIELD *field, unsigned int amt);
     98   1.1  blymn static int
     99  1.28  blymn _formi_set_cursor_xpos(FIELD *field, int no_scroll);
    100  1.25  blymn static int
    101   1.1  blymn find_sow(char *str, unsigned int offset);
    102   1.1  blymn static int
    103  1.15  blymn find_cur_line(FIELD *cur, unsigned pos);
    104  1.15  blymn static int
    105  1.15  blymn split_line(FIELD *field, unsigned pos);
    106  1.15  blymn static void
    107  1.20  blymn bump_lines(FIELD *field, int pos, int amt, bool do_len);
    108  1.21  blymn static bool
    109  1.22  blymn check_field_size(FIELD *field);
    110  1.23  blymn static int
    111  1.23  blymn add_tab(FORM *form, FIELD *field, unsigned row, unsigned int i, char c);
    112  1.23  blymn static int
    113  1.23  blymn tab_size(FIELD *field, unsigned int offset, unsigned int i);
    114  1.23  blymn static unsigned int
    115  1.23  blymn tab_fit_len(FIELD *field, unsigned int row, unsigned int len);
    116  1.23  blymn static int
    117  1.23  blymn tab_fit_window(FIELD *field, unsigned int pos, unsigned int window);
    118  1.15  blymn 
    119   1.1  blymn 
    120   1.1  blymn /*
    121  1.25  blymn  * Initialise the row offset for a field, depending on the type of
    122  1.25  blymn  * field it is and the type of justification used.  The justification
    123  1.25  blymn  * is only used on static single line fields, everything else will
    124  1.25  blymn  * have the cursor_xpos set to 0.
    125  1.25  blymn  */
    126  1.25  blymn void
    127  1.25  blymn _formi_init_field_xpos(FIELD *field)
    128  1.25  blymn {
    129  1.25  blymn 	  /* not static or is multi-line which are not justified, so 0 it is */
    130  1.25  blymn 	if (((field->opts & O_STATIC) != O_STATIC) ||
    131  1.25  blymn 	    ((field->rows + field->nrows) != 1)) {
    132  1.25  blymn 		field->cursor_xpos = 0;
    133  1.25  blymn 		return;
    134  1.25  blymn 	}
    135  1.25  blymn 
    136  1.25  blymn 	switch (field->justification) {
    137  1.25  blymn 	case JUSTIFY_RIGHT:
    138  1.25  blymn 		field->cursor_xpos = field->cols - 1;
    139  1.25  blymn 		break;
    140  1.25  blymn 
    141  1.25  blymn 	case JUSTIFY_CENTER:
    142  1.25  blymn 		field->cursor_xpos = (field->cols - 1) / 2;
    143  1.25  blymn 		break;
    144  1.25  blymn 
    145  1.25  blymn 	default: /* assume left justify */
    146  1.25  blymn 		field->cursor_xpos = 0;
    147  1.25  blymn 		break;
    148  1.25  blymn 	}
    149  1.25  blymn }
    150  1.25  blymn 
    151  1.25  blymn 
    152  1.25  blymn /*
    153   1.4  blymn  * Open the debug file if it is not already open....
    154   1.4  blymn  */
    155   1.4  blymn #ifdef DEBUG
    156   1.4  blymn int
    157   1.4  blymn _formi_create_dbg_file(void)
    158   1.4  blymn {
    159   1.4  blymn 	if (dbg == NULL) {
    160   1.4  blymn 		dbg = fopen("___form_dbg.out", "w");
    161   1.4  blymn 		if (dbg == NULL) {
    162   1.4  blymn 			fprintf(stderr, "Cannot open debug file!\n");
    163   1.4  blymn 			return E_SYSTEM_ERROR;
    164   1.4  blymn 		}
    165   1.4  blymn 	}
    166   1.4  blymn 
    167   1.4  blymn 	return E_OK;
    168   1.4  blymn }
    169   1.4  blymn #endif
    170   1.4  blymn 
    171   1.4  blymn /*
    172  1.15  blymn  * Bump the lines array elements in the given field by the given amount.
    173  1.15  blymn  * The row to start acting on can either be inferred from the given position
    174  1.15  blymn  * or if the special value _FORMI_USE_CURRENT is set then the row will be
    175  1.15  blymn  * the row the cursor is currently on.
    176  1.15  blymn  */
    177  1.15  blymn static void
    178  1.20  blymn bump_lines(FIELD *field, int pos, int amt, bool do_len)
    179  1.15  blymn {
    180  1.23  blymn 	int i, row, old_len;
    181  1.15  blymn #ifdef DEBUG
    182  1.15  blymn 	int dbg_ok = FALSE;
    183  1.15  blymn #endif
    184  1.15  blymn 
    185  1.15  blymn 	if (pos == _FORMI_USE_CURRENT)
    186  1.15  blymn 		row = field->start_line + field->cursor_ypos;
    187  1.15  blymn 	else
    188  1.15  blymn 		row = find_cur_line(field, (unsigned) pos);
    189  1.15  blymn 
    190  1.15  blymn #ifdef DEBUG
    191  1.15  blymn 	if (_formi_create_dbg_file() == E_OK) {
    192  1.15  blymn 		dbg_ok = TRUE;
    193  1.15  blymn 		fprintf(dbg, "bump_lines: bump starting at row %d\n", row);
    194  1.15  blymn 		fprintf(dbg,
    195  1.15  blymn 			"bump_lines: len from %d to %d, end from %d to %d\n",
    196  1.15  blymn 			field->lines[row].length,
    197  1.15  blymn 			field->lines[row].length + amt,
    198  1.15  blymn 			field->lines[row].end, field->lines[row].end + amt);
    199  1.15  blymn 	}
    200  1.15  blymn #endif
    201  1.15  blymn 
    202  1.19  blymn 	if (((int)field->lines[row].length + amt) < 0) {
    203  1.19  blymn 		field->lines[row].length = 0;
    204  1.23  blymn 		old_len = 0;
    205  1.20  blymn 	} else {
    206  1.23  blymn 		old_len = field->lines[row].length;
    207  1.23  blymn 		if (do_len == TRUE) {
    208  1.23  blymn 			field->lines[row].length =
    209  1.23  blymn 				_formi_tab_expanded_length(
    210  1.23  blymn 					&field->buffers[0].string[
    211  1.23  blymn 						field->lines[row].start], 0,
    212  1.23  blymn 					field->lines[row].end + amt
    213  1.23  blymn 					    -field->lines[row].start);
    214  1.23  blymn 		}
    215  1.20  blymn 	}
    216  1.19  blymn 
    217  1.23  blymn 	if (old_len > 0) {
    218  1.23  blymn 		if ((amt < 0) && (- amt > field->lines[row].end))
    219  1.23  blymn 			field->lines[row].end = field->lines[row].start;
    220  1.23  blymn 		else
    221  1.23  blymn 			field->lines[row].end += amt;
    222  1.23  blymn 	} else
    223  1.19  blymn 		field->lines[row].end = field->lines[row].start;
    224  1.23  blymn 
    225  1.23  blymn #ifdef DEBUG
    226  1.23  blymn 	if (dbg_ok)
    227  1.23  blymn 		fprintf(dbg, "bump_lines: expanded length %d\n",
    228  1.23  blymn 			field->lines[row].length);
    229  1.23  blymn #endif
    230  1.19  blymn 
    231  1.15  blymn 	for (i = row + 1; i < field->row_count; i++) {
    232  1.15  blymn #ifdef DEBUG
    233  1.15  blymn 		if (dbg_ok) {
    234  1.15  blymn 			fprintf(dbg,
    235  1.15  blymn 		"bump_lines: row %d: len from %d to %d, end from %d to %d\n",
    236  1.15  blymn 				i, field->lines[i].start,
    237  1.15  blymn 				field->lines[i].start + amt,
    238  1.15  blymn 				field->lines[i].end,
    239  1.15  blymn 				field->lines[i].end + amt);
    240  1.15  blymn 		}
    241  1.15  blymn 		fflush(dbg);
    242  1.15  blymn #endif
    243  1.15  blymn 		field->lines[i].start += amt;
    244  1.15  blymn 		field->lines[i].end += amt;
    245  1.23  blymn 		field->lines[i].length = _formi_tab_expanded_length(
    246  1.23  blymn 			&field->buffers[0].string[field->lines[i].start],
    247  1.23  blymn 			0, field->lines[i].end - field->lines[i].start);
    248  1.23  blymn #ifdef DEBUG
    249  1.23  blymn 		if (dbg_ok) {
    250  1.23  blymn 			fprintf(dbg,
    251  1.23  blymn 				"bump_lines: row %d, expanded length %d\n",
    252  1.23  blymn 				i, field->lines[i].length);
    253  1.23  blymn 		}
    254  1.23  blymn #endif
    255  1.15  blymn 	}
    256  1.15  blymn }
    257  1.15  blymn 
    258  1.15  blymn /*
    259  1.22  blymn  * Check the sizing of the field, if the maximum size is set for a
    260  1.22  blymn  * dynamic field then check that the number of rows or columns does
    261  1.22  blymn  * not exceed the set maximum.  The decision to check the rows or
    262  1.22  blymn  * columns is made on the basis of how many rows are in the field -
    263  1.22  blymn  * one row means the max applies to the number of columns otherwise it
    264  1.22  blymn  * applies to the number of rows.  If the row/column count is less
    265  1.22  blymn  * than the maximum then return TRUE.
    266  1.21  blymn  *
    267  1.21  blymn  */
    268  1.22  blymn static bool
    269  1.22  blymn check_field_size(FIELD *field)
    270  1.21  blymn {
    271  1.22  blymn 	if ((field->opts & O_STATIC) != O_STATIC) {
    272  1.22  blymn 		  /* dynamic field */
    273  1.22  blymn 		if (field->max == 0) /* unlimited */
    274  1.22  blymn 			return TRUE;
    275  1.21  blymn 
    276  1.22  blymn 		if (field->rows == 1) {
    277  1.22  blymn 			return (field->buffers[0].length < field->max);
    278  1.22  blymn 		} else {
    279  1.22  blymn 			return (field->row_count <= field->max);
    280  1.22  blymn 		}
    281  1.21  blymn 	} else {
    282  1.22  blymn 		if ((field->rows + field->nrows) == 1) {
    283  1.23  blymn 			return (field->buffers[0].length <= field->cols);
    284  1.22  blymn 		} else {
    285  1.22  blymn 			return (field->row_count <= (field->rows
    286  1.22  blymn 						     + field->nrows));
    287  1.22  blymn 		}
    288  1.21  blymn 	}
    289  1.21  blymn }
    290  1.21  blymn 
    291  1.21  blymn /*
    292   1.1  blymn  * Set the form's current field to the first valid field on the page.
    293   1.1  blymn  * Assume the fields have been sorted and stitched.
    294   1.1  blymn  */
    295   1.1  blymn int
    296   1.1  blymn _formi_pos_first_field(FORM *form)
    297   1.1  blymn {
    298   1.1  blymn 	FIELD *cur;
    299   1.1  blymn 	int old_page;
    300   1.1  blymn 
    301   1.1  blymn 	old_page = form->page;
    302   1.1  blymn 
    303   1.1  blymn 	  /* scan forward for an active page....*/
    304   1.1  blymn 	while (form->page_starts[form->page].in_use == 0) {
    305   1.1  blymn 		form->page++;
    306   1.1  blymn 		if (form->page > form->max_page) {
    307   1.1  blymn 			form->page = old_page;
    308   1.1  blymn 			return E_REQUEST_DENIED;
    309   1.1  blymn 		}
    310   1.1  blymn 	}
    311   1.1  blymn 
    312  1.13  blymn 	  /* then scan for a field we can use */
    313   1.1  blymn 	cur = form->fields[form->page_starts[form->page].first];
    314   1.1  blymn 	while ((cur->opts & (O_VISIBLE | O_ACTIVE))
    315   1.1  blymn 	       != (O_VISIBLE | O_ACTIVE)) {
    316   1.1  blymn 		cur = CIRCLEQ_NEXT(cur, glue);
    317   1.1  blymn 		if (cur == (void *) &form->sorted_fields) {
    318   1.1  blymn 			form->page = old_page;
    319   1.1  blymn 			return E_REQUEST_DENIED;
    320   1.1  blymn 		}
    321   1.1  blymn 	}
    322   1.1  blymn 
    323   1.1  blymn 	form->cur_field = cur->index;
    324   1.1  blymn 	return E_OK;
    325   1.1  blymn }
    326   1.1  blymn 
    327   1.1  blymn /*
    328   1.1  blymn  * Set the field to the next active and visible field, the fields are
    329   1.1  blymn  * traversed in index order in the direction given.  If the parameter
    330   1.1  blymn  * use_sorted is TRUE then the sorted field list will be traversed instead
    331   1.1  blymn  * of using the field index.
    332   1.1  blymn  */
    333   1.1  blymn int
    334   1.1  blymn _formi_pos_new_field(FORM *form, unsigned direction, unsigned use_sorted)
    335   1.1  blymn {
    336   1.1  blymn 	FIELD *cur;
    337   1.1  blymn 	int i;
    338   1.1  blymn 
    339   1.1  blymn 	i = form->cur_field;
    340   1.1  blymn 	cur = form->fields[i];
    341   1.1  blymn 
    342   1.1  blymn 	do {
    343   1.1  blymn 		if (direction == _FORMI_FORWARD) {
    344   1.1  blymn 			if (use_sorted == TRUE) {
    345   1.4  blymn 				if ((form->wrap == FALSE) &&
    346   1.4  blymn 				    (cur == CIRCLEQ_LAST(&form->sorted_fields)))
    347   1.4  blymn 					return E_REQUEST_DENIED;
    348   1.1  blymn 				cur = CIRCLEQ_NEXT(cur, glue);
    349   1.1  blymn 				i = cur->index;
    350   1.1  blymn 			} else {
    351   1.4  blymn 				if ((form->wrap == FALSE) &&
    352   1.4  blymn 				    ((i + 1) >= form->field_count))
    353   1.4  blymn 					return E_REQUEST_DENIED;
    354   1.1  blymn 				i++;
    355   1.1  blymn 				if (i >= form->field_count)
    356   1.1  blymn 					i = 0;
    357   1.1  blymn 			}
    358   1.1  blymn 		} else {
    359   1.1  blymn 			if (use_sorted == TRUE) {
    360   1.4  blymn 				if ((form->wrap == FALSE) &&
    361   1.4  blymn 				    (cur == CIRCLEQ_FIRST(&form->sorted_fields)))
    362   1.4  blymn 					return E_REQUEST_DENIED;
    363   1.1  blymn 				cur = CIRCLEQ_PREV(cur, glue);
    364   1.1  blymn 				i = cur->index;
    365   1.1  blymn 			} else {
    366   1.4  blymn 				if ((form->wrap == FALSE) && (i <= 0))
    367   1.4  blymn 					return E_REQUEST_DENIED;
    368   1.1  blymn 				i--;
    369   1.1  blymn 				if (i < 0)
    370   1.1  blymn 					i = form->field_count - 1;
    371   1.1  blymn 			}
    372   1.1  blymn 		}
    373   1.1  blymn 
    374   1.1  blymn 		if ((form->fields[i]->opts & (O_VISIBLE | O_ACTIVE))
    375   1.1  blymn 			== (O_VISIBLE | O_ACTIVE)) {
    376   1.1  blymn 			form->cur_field = i;
    377   1.1  blymn 			return E_OK;
    378   1.1  blymn 		}
    379   1.1  blymn 	}
    380   1.1  blymn 	while (i != form->cur_field);
    381   1.1  blymn 
    382   1.1  blymn 	return E_REQUEST_DENIED;
    383   1.1  blymn }
    384   1.1  blymn 
    385   1.1  blymn /*
    386   1.1  blymn  * Find the line in a field that the cursor is currently on.
    387   1.1  blymn  */
    388   1.1  blymn static int
    389  1.15  blymn find_cur_line(FIELD *cur, unsigned pos)
    390   1.1  blymn {
    391  1.15  blymn 	unsigned row;
    392   1.1  blymn 
    393  1.23  blymn 	  /* if there is only one row then that must be it */
    394  1.23  blymn 	if (cur->row_count == 1)
    395  1.23  blymn 		return 0;
    396  1.23  blymn 
    397  1.15  blymn 	  /* first check if pos is at the end of the string, if this
    398  1.15  blymn 	   * is true then just return the last row since the pos may
    399  1.15  blymn 	   * not have been added to the lines array yet.
    400  1.15  blymn 	   */
    401  1.15  blymn 	if (pos == (cur->buffers[0].length - 1))
    402  1.15  blymn 		return (cur->row_count - 1);
    403   1.1  blymn 
    404  1.15  blymn 	for (row = 0; row < cur->row_count; row++) {
    405  1.15  blymn 		if ((pos >= cur->lines[row].start)
    406  1.15  blymn 		    && (pos <= cur->lines[row].end))
    407   1.1  blymn 			return row;
    408   1.1  blymn 	}
    409   1.1  blymn 
    410  1.15  blymn #ifdef DEBUG
    411  1.15  blymn 	  /* barf if we get here, this should not be possible */
    412  1.15  blymn 	assert((row != row));
    413  1.15  blymn #endif
    414   1.1  blymn 	return 0;
    415   1.1  blymn }
    416   1.1  blymn 
    417   1.1  blymn 
    418   1.1  blymn /*
    419   1.1  blymn  * Word wrap the contents of the field's buffer 0 if this is allowed.
    420   1.1  blymn  * If the wrap is successful, that is, the row count nor the buffer
    421   1.1  blymn  * size is exceeded then the function will return E_OK, otherwise it
    422   1.1  blymn  * will return E_REQUEST_DENIED.
    423   1.1  blymn  */
    424   1.9  blymn int
    425  1.16  blymn _formi_wrap_field(FIELD *field, unsigned int loc)
    426   1.1  blymn {
    427  1.15  blymn 	char *str;
    428  1.16  blymn 	int width, row, start_row;
    429  1.16  blymn 	unsigned int pos;
    430   1.1  blymn 
    431  1.15  blymn 	str = field->buffers[0].string;
    432  1.15  blymn 
    433  1.12  blymn 	if ((field->opts & O_STATIC) == O_STATIC) {
    434  1.15  blymn 		if ((field->rows + field->nrows) == 1) {
    435  1.12  blymn 			return E_OK; /* cannot wrap a single line */
    436  1.15  blymn 		}
    437  1.15  blymn 		width = field->cols;
    438  1.12  blymn 	} else {
    439  1.15  blymn 		  /* if we are limited to one line then don't try to wrap */
    440  1.15  blymn 		if ((field->drows + field->nrows) == 1) {
    441  1.12  blymn 			return E_OK;
    442  1.15  blymn 		}
    443  1.15  blymn 
    444  1.15  blymn 		  /*
    445  1.15  blymn 		   * hueristic - if a dynamic field has more than one line
    446  1.15  blymn 		   * on the screen then the field grows rows, otherwise
    447  1.15  blymn 		   * it grows columns, effectively a single line field.
    448  1.15  blymn 		   * This is documented AT&T behaviour.
    449  1.15  blymn 		   */
    450  1.15  blymn 		if (field->rows > 1) {
    451  1.15  blymn 			width = field->cols;
    452  1.15  blymn 		} else {
    453  1.15  blymn 			return E_OK;
    454  1.15  blymn 		}
    455  1.12  blymn 	}
    456  1.16  blymn 
    457  1.16  blymn 	start_row = find_cur_line(field, loc);
    458  1.16  blymn 
    459  1.16  blymn 	  /* if we are not at the top of the field then back up one
    460  1.16  blymn 	   * row because we may be able to merge the current row into
    461  1.16  blymn 	   * the one above.
    462  1.16  blymn 	   */
    463  1.16  blymn 	if (start_row > 0)
    464  1.16  blymn 		start_row--;
    465  1.12  blymn 
    466  1.16  blymn 	for (row = start_row; row < field->row_count; row++) {
    467  1.15  blymn 	  AGAIN:
    468  1.15  blymn 		pos = field->lines[row].end;
    469  1.16  blymn 		if (field->lines[row].length < width) {
    470   1.1  blymn 			  /* line may be too short, try joining some lines */
    471  1.15  blymn 
    472  1.16  blymn 			if ((((int) field->row_count) - 1) == row) {
    473  1.16  blymn 				/* if this is the last row then don't
    474  1.16  blymn 				 * wrap
    475  1.15  blymn 				 */
    476   1.1  blymn 				continue;
    477   1.1  blymn 			}
    478   1.1  blymn 
    479  1.15  blymn 			if (_formi_join_line(field, (unsigned int) pos,
    480  1.15  blymn 					     JOIN_NEXT_NW) == E_OK) {
    481  1.15  blymn 				goto AGAIN;
    482   1.1  blymn 			} else
    483   1.1  blymn 				break;
    484   1.1  blymn 		} else {
    485   1.1  blymn 			  /* line is too long, split it - maybe */
    486  1.15  blymn 
    487  1.15  blymn 			  /* first check if we have not run out of room */
    488  1.15  blymn 			if ((field->opts & O_STATIC) == O_STATIC) {
    489  1.15  blymn 				/* check static field */
    490  1.15  blymn 				if ((field->rows + field->nrows - 1) == row)
    491  1.15  blymn 					return E_REQUEST_DENIED;
    492  1.15  blymn 			} else {
    493  1.15  blymn 				/* check dynamic field */
    494  1.15  blymn 				if ((field->max != 0)
    495  1.15  blymn 				    && ((field->max - 1) == row))
    496  1.15  blymn 					return E_REQUEST_DENIED;
    497  1.15  blymn 			}
    498  1.15  blymn 
    499  1.23  blymn 			  /*
    500  1.23  blymn 			   * split on first whitespace before current word
    501  1.23  blymn 			   * if the line has tabs we need to work out where
    502  1.23  blymn 			   * the field border lies when the tabs are expanded.
    503  1.23  blymn 			   */
    504  1.23  blymn 			if (field->lines[row].tabs == NULL) {
    505  1.23  blymn 				pos = width + field->lines[row].start - 1;
    506  1.23  blymn 				if (pos >= field->buffers[0].length)
    507  1.23  blymn 					pos = field->buffers[0].length - 1;
    508  1.23  blymn 			} else {
    509  1.23  blymn 				pos = tab_fit_len(field, (unsigned) row,
    510  1.23  blymn 						  field->cols);
    511  1.23  blymn 			}
    512  1.23  blymn 
    513  1.15  blymn 
    514  1.13  blymn 			if ((!isblank(str[pos])) &&
    515  1.15  blymn 			    ((field->opts & O_WRAP) == O_WRAP)) {
    516  1.16  blymn 				if (!isblank(str[pos - 1]))
    517  1.16  blymn 					pos = find_sow(str,
    518  1.16  blymn 						       (unsigned int) pos);
    519  1.16  blymn 				/*
    520  1.16  blymn 				 * If we cannot split the line then return
    521  1.16  blymn 				 * NO_ROOM so the driver can tell that it
    522  1.16  blymn 				 * should not autoskip (if that is enabled)
    523  1.16  blymn 				 */
    524  1.16  blymn 				if ((pos == 0) || (!isblank(str[pos - 1]))
    525  1.16  blymn 				    || ((pos <= field->lines[row].start)
    526  1.16  blymn 					&& (field->buffers[0].length
    527  1.16  blymn 					    >= (width - 1
    528  1.16  blymn 						+ field->lines[row].start)))) {
    529  1.16  blymn 					return E_NO_ROOM;
    530   1.1  blymn 				}
    531  1.15  blymn 			}
    532   1.1  blymn 
    533  1.16  blymn 			  /* if we are at the end of the string and it has
    534  1.16  blymn 			   * a trailing blank, don't wrap the blank.
    535  1.16  blymn 			   */
    536  1.16  blymn 			if ((pos == field->buffers[0].length - 1) &&
    537  1.23  blymn 			    (isblank(str[pos])) &&
    538  1.23  blymn 			    field->lines[row].length <= field->cols)
    539  1.16  blymn 				continue;
    540  1.17  blymn 
    541  1.17  blymn 			  /*
    542  1.17  blymn 			   * otherwise, if we are still sitting on a
    543  1.17  blymn 			   * blank but not at the end of the line
    544  1.17  blymn 			   * move forward one char so the blank
    545  1.17  blymn 			   * is on the line boundary.
    546  1.17  blymn 			   */
    547  1.23  blymn 			if ((isblank(str[pos])) &&
    548  1.23  blymn 			    (pos != field->buffers[0].length - 1))
    549  1.17  blymn 				pos++;
    550  1.16  blymn 
    551  1.15  blymn 			if (split_line(field, pos) != E_OK) {
    552  1.15  blymn 				return E_REQUEST_DENIED;
    553  1.15  blymn 			}
    554   1.1  blymn 		}
    555   1.1  blymn 	}
    556   1.1  blymn 
    557   1.1  blymn 	return E_OK;
    558   1.1  blymn }
    559   1.1  blymn 
    560   1.1  blymn /*
    561   1.1  blymn  * Join the two lines that surround the location pos, the type
    562  1.15  blymn  * variable indicates the direction of the join, JOIN_NEXT will join
    563  1.15  blymn  * the next line to the current line, JOIN_PREV will join the current
    564  1.15  blymn  * line to the previous line, the new lines will be wrapped unless the
    565  1.15  blymn  * _NW versions of the directions are used.  Returns E_OK if the join
    566  1.15  blymn  * was successful or E_REQUEST_DENIED if the join cannot happen.
    567   1.1  blymn  */
    568   1.1  blymn static int
    569  1.15  blymn _formi_join_line(FIELD *field, unsigned int pos, int direction)
    570   1.1  blymn {
    571  1.15  blymn 	unsigned int row, i;
    572  1.15  blymn 	int old_alloced, old_row_count;
    573  1.15  blymn 	struct _formi_field_lines *saved;
    574  1.17  blymn #ifdef DEBUG
    575  1.17  blymn 	int dbg_ok = FALSE;
    576  1.15  blymn 
    577  1.17  blymn 	if (_formi_create_dbg_file() == E_OK) {
    578  1.17  blymn 		dbg_ok = TRUE;
    579  1.17  blymn 	}
    580  1.17  blymn #endif
    581  1.17  blymn 
    582  1.15  blymn 	if ((saved = (struct _formi_field_lines *)
    583  1.17  blymn 	     malloc(field->lines_alloced * sizeof(struct _formi_field_lines)))
    584  1.15  blymn 	    == NULL)
    585  1.15  blymn 		return E_REQUEST_DENIED;
    586   1.1  blymn 
    587  1.15  blymn 	bcopy(field->lines, saved,
    588  1.15  blymn 	      field->row_count * sizeof(struct _formi_field_lines));
    589  1.15  blymn 	old_alloced = field->lines_alloced;
    590  1.15  blymn 	old_row_count = field->row_count;
    591  1.15  blymn 
    592  1.15  blymn 	row = find_cur_line(field, pos);
    593  1.17  blymn 
    594  1.17  blymn #ifdef DEBUG
    595  1.17  blymn 	if (dbg_ok == TRUE) {
    596  1.17  blymn 		fprintf(dbg, "join_line: working on row %d, row_count = %d\n",
    597  1.17  blymn 			row, field->row_count);
    598  1.17  blymn 	}
    599  1.17  blymn #endif
    600  1.15  blymn 
    601   1.1  blymn 	if ((direction == JOIN_NEXT) || (direction == JOIN_NEXT_NW)) {
    602   1.1  blymn 		  /* see if there is another line following... */
    603  1.15  blymn 		if (row == (field->row_count - 1)) {
    604  1.15  blymn 			free(saved);
    605   1.1  blymn 			return E_REQUEST_DENIED;
    606  1.15  blymn 		}
    607  1.17  blymn 
    608  1.17  blymn #ifdef DEBUG
    609  1.17  blymn 		if (dbg_ok == TRUE) {
    610  1.17  blymn 			fprintf(dbg,
    611  1.17  blymn 			"join_line: join_next before end = %d, length = %d",
    612  1.17  blymn 				field->lines[row].end,
    613  1.17  blymn 				field->lines[row].length);
    614  1.17  blymn 			fprintf(dbg,
    615  1.17  blymn 				" :: next row end = %d, length = %d\n",
    616  1.17  blymn 				field->lines[row + 1].end,
    617  1.17  blymn 				field->lines[row + 1].length);
    618  1.17  blymn 		}
    619  1.17  blymn #endif
    620  1.17  blymn 
    621  1.15  blymn 		field->lines[row].end = field->lines[row + 1].end;
    622  1.23  blymn 		field->lines[row].length =
    623  1.23  blymn 			_formi_tab_expanded_length(field->buffers[0].string,
    624  1.23  blymn 					    field->lines[row].start,
    625  1.23  blymn 					    field->lines[row].end);
    626  1.23  blymn 		_formi_calculate_tabs(field, row);
    627  1.23  blymn 
    628  1.15  blymn 		  /* shift all the remaining lines up.... */
    629  1.15  blymn 		for (i = row + 2; i < field->row_count; i++)
    630  1.15  blymn 			field->lines[i - 1] = field->lines[i];
    631   1.1  blymn 	} else {
    632  1.15  blymn 		if ((pos == 0) || (row == 0)) {
    633  1.15  blymn 			free(saved);
    634   1.1  blymn 			return E_REQUEST_DENIED;
    635  1.15  blymn 		}
    636  1.17  blymn 
    637  1.17  blymn #ifdef DEBUG
    638  1.17  blymn 		if (dbg_ok == TRUE) {
    639  1.17  blymn 			fprintf(dbg,
    640  1.17  blymn 			"join_line: join_prev before end = %d, length = %d",
    641  1.17  blymn 				field->lines[row].end,
    642  1.17  blymn 				field->lines[row].length);
    643  1.17  blymn 			fprintf(dbg,
    644  1.17  blymn 				" :: prev row end = %d, length = %d\n",
    645  1.17  blymn 				field->lines[row - 1].end,
    646  1.17  blymn 				field->lines[row - 1].length);
    647  1.17  blymn 		}
    648  1.17  blymn #endif
    649  1.17  blymn 
    650  1.15  blymn 		field->lines[row - 1].end = field->lines[row].end;
    651  1.23  blymn 		field->lines[row - 1].length =
    652  1.23  blymn 			_formi_tab_expanded_length(field->buffers[0].string,
    653  1.23  blymn 					    field->lines[row - 1].start,
    654  1.23  blymn 					    field->lines[row].end);
    655  1.15  blymn 		  /* shift all the remaining lines up */
    656  1.15  blymn 		for (i = row + 1; i < field->row_count; i++)
    657  1.15  blymn 			field->lines[i - 1] = field->lines[i];
    658   1.1  blymn 	}
    659  1.15  blymn 
    660  1.17  blymn #ifdef DEBUG
    661  1.17  blymn 	if (dbg_ok == TRUE) {
    662  1.17  blymn 		fprintf(dbg,
    663  1.17  blymn 			"join_line: exit end = %d, length = %d\n",
    664  1.17  blymn 			field->lines[row].end, field->lines[row].length);
    665  1.17  blymn 	}
    666  1.17  blymn #endif
    667  1.17  blymn 
    668  1.15  blymn 	field->row_count--;
    669   1.1  blymn 
    670   1.1  blymn 	  /* wrap the field if required, if this fails undo the change */
    671   1.1  blymn 	if ((direction == JOIN_NEXT) || (direction == JOIN_PREV)) {
    672   1.1  blymn 		if (_formi_wrap_field(field, (unsigned int) pos) != E_OK) {
    673  1.15  blymn 			free(field->lines);
    674  1.15  blymn 			field->lines = saved;
    675  1.15  blymn 			field->lines_alloced = old_alloced;
    676  1.15  blymn 			field->row_count = old_row_count;
    677  1.23  blymn 			for (i = 0; i < field->row_count; i++)
    678  1.23  blymn 				_formi_calculate_tabs(field, i);
    679   1.1  blymn 			return E_REQUEST_DENIED;
    680   1.1  blymn 		}
    681   1.1  blymn 	}
    682  1.15  blymn 
    683  1.15  blymn 	free(saved);
    684  1.15  blymn 	return E_OK;
    685  1.15  blymn }
    686  1.15  blymn 
    687  1.15  blymn /*
    688  1.15  blymn  * Split the line at the given position, if possible
    689  1.15  blymn  */
    690  1.15  blymn static int
    691  1.15  blymn split_line(FIELD *field, unsigned pos)
    692  1.15  blymn {
    693  1.15  blymn 	struct _formi_field_lines *new_lines;
    694  1.15  blymn 	unsigned int row, i;
    695  1.15  blymn #ifdef DEBUG
    696  1.15  blymn 	short dbg_ok = FALSE;
    697  1.15  blymn #endif
    698  1.15  blymn 
    699  1.15  blymn 	if (pos == 0)
    700  1.15  blymn 		return E_REQUEST_DENIED;
    701  1.15  blymn 
    702  1.15  blymn #ifdef DEBUG
    703  1.15  blymn 	if (_formi_create_dbg_file() == E_OK) {
    704  1.15  blymn 		fprintf(dbg, "split_line: splitting line at %d\n", pos);
    705  1.15  blymn 		dbg_ok = TRUE;
    706  1.15  blymn 	}
    707  1.15  blymn #endif
    708  1.15  blymn 
    709  1.15  blymn 	if ((field->row_count + 1) > field->lines_alloced) {
    710  1.15  blymn 		if ((new_lines = (struct _formi_field_lines *)
    711  1.15  blymn 		     realloc(field->lines, (field->row_count + 1)
    712  1.15  blymn 			     * sizeof(struct _formi_field_lines))) == NULL)
    713  1.15  blymn 			return E_SYSTEM_ERROR;
    714  1.15  blymn 		field->lines = new_lines;
    715  1.15  blymn 		field->lines_alloced++;
    716  1.15  blymn 	}
    717   1.1  blymn 
    718  1.15  blymn 	row = find_cur_line(field, pos);
    719  1.15  blymn #ifdef DEBUG
    720  1.15  blymn 	if (dbg_ok == TRUE) {
    721  1.15  blymn 		fprintf(dbg,
    722  1.15  blymn 	"split_line: enter: lines[%d].end = %d, lines[%d].length = %d\n",
    723  1.15  blymn 			row, field->lines[row].end, row,
    724  1.15  blymn 			field->lines[row].length);
    725  1.15  blymn 	}
    726  1.17  blymn 
    727  1.17  blymn 	assert(((field->lines[row].end < INT_MAX) &&
    728  1.17  blymn 		(field->lines[row].length < INT_MAX) &&
    729  1.17  blymn 		(field->lines[row].length > 0)));
    730  1.17  blymn 
    731  1.15  blymn #endif
    732  1.17  blymn 
    733  1.17  blymn 	  /* if asked to split right where the line already starts then
    734  1.17  blymn 	   * just return - nothing to do.
    735  1.17  blymn 	   */
    736  1.17  blymn 	if (field->lines[row].start == pos)
    737  1.17  blymn 		return E_OK;
    738  1.15  blymn 
    739  1.17  blymn 	for (i = field->row_count - 1; i > row; i--) {
    740  1.17  blymn 		field->lines[i + 1] = field->lines[i];
    741  1.17  blymn 	}
    742  1.17  blymn 
    743  1.15  blymn 	field->lines[row + 1].end = field->lines[row].end;
    744  1.15  blymn 	field->lines[row].end = pos - 1;
    745  1.23  blymn 	field->lines[row].length =
    746  1.23  blymn 		_formi_tab_expanded_length(field->buffers[0].string,
    747  1.23  blymn 				    field->lines[row].start,
    748  1.23  blymn 				    field->lines[row].end);
    749  1.23  blymn 	_formi_calculate_tabs(field, row);
    750  1.15  blymn 	field->lines[row + 1].start = pos;
    751  1.23  blymn 	field->lines[row + 1].length =
    752  1.23  blymn 		_formi_tab_expanded_length(field->buffers[0].string,
    753  1.23  blymn 				    field->lines[row + 1].start,
    754  1.23  blymn 				    field->lines[row + 1].end);
    755  1.23  blymn 	field->lines[row + 1].tabs = NULL;
    756  1.23  blymn 	_formi_calculate_tabs(field, row + 1);
    757  1.15  blymn 
    758  1.15  blymn #ifdef DEBUG
    759  1.15  blymn 	assert(((field->lines[row + 1].end < INT_MAX) &&
    760  1.15  blymn 		(field->lines[row].end < INT_MAX) &&
    761  1.15  blymn 		(field->lines[row].length < INT_MAX) &&
    762  1.15  blymn 		(field->lines[row + 1].start < INT_MAX) &&
    763  1.17  blymn 		(field->lines[row + 1].length < INT_MAX) &&
    764  1.17  blymn 		(field->lines[row].length > 0) &&
    765  1.17  blymn 		(field->lines[row + 1].length > 0)));
    766  1.15  blymn 
    767  1.15  blymn 	if (dbg_ok == TRUE) {
    768  1.15  blymn 		fprintf(dbg,
    769  1.15  blymn 	"split_line: exit: lines[%d].end = %d, lines[%d].length = %d, ",
    770  1.15  blymn 			row, field->lines[row].end, row,
    771  1.15  blymn 			field->lines[row].length);
    772  1.15  blymn 		fprintf(dbg, "lines[%d].start = %d, lines[%d].end = %d, ",
    773  1.15  blymn 			row + 1, field->lines[row + 1].start, row + 1,
    774  1.15  blymn 			field->lines[row + 1].end);
    775  1.17  blymn 		fprintf(dbg, "lines[%d].length = %d, row_count = %d\n",
    776  1.17  blymn 			row + 1, field->lines[row + 1].length,
    777  1.17  blymn 			field->row_count + 1);
    778  1.15  blymn 	}
    779  1.15  blymn #endif
    780  1.15  blymn 
    781  1.17  blymn 	field->row_count++;
    782  1.17  blymn 
    783  1.17  blymn #ifdef DEBUG
    784  1.17  blymn 	if (dbg_ok == TRUE) {
    785  1.20  blymn 		bump_lines(field, 0, 0, FALSE); /* will report line data for us */
    786  1.15  blymn 	}
    787  1.17  blymn #endif
    788  1.17  blymn 
    789   1.1  blymn 	return E_OK;
    790   1.1  blymn }
    791   1.1  blymn 
    792   1.1  blymn /*
    793   1.1  blymn  * skip the blanks in the given string, start at the index start and
    794   1.1  blymn  * continue forward until either the end of the string or a non-blank
    795   1.1  blymn  * character is found.  Return the index of either the end of the string or
    796   1.1  blymn  * the first non-blank character.
    797   1.1  blymn  */
    798   1.1  blymn unsigned
    799   1.8  blymn _formi_skip_blanks(char *string, unsigned int start)
    800   1.1  blymn {
    801   1.1  blymn 	unsigned int i;
    802   1.1  blymn 
    803   1.1  blymn 	i = start;
    804   1.1  blymn 
    805   1.1  blymn 	while ((string[i] != '\0') && isblank(string[i]))
    806   1.1  blymn 		i++;
    807   1.1  blymn 
    808   1.1  blymn 	return i;
    809   1.1  blymn }
    810   1.1  blymn 
    811   1.1  blymn /*
    812   1.1  blymn  * Return the index of the top left most field of the two given fields.
    813   1.1  blymn  */
    814   1.1  blymn static int
    815   1.1  blymn _formi_top_left(FORM *form, int a, int b)
    816   1.1  blymn {
    817   1.1  blymn 	  /* lower row numbers always win here.... */
    818   1.1  blymn 	if (form->fields[a]->form_row < form->fields[b]->form_row)
    819   1.1  blymn 		return a;
    820   1.1  blymn 
    821   1.1  blymn 	if (form->fields[a]->form_row > form->fields[b]->form_row)
    822   1.1  blymn 		return b;
    823   1.1  blymn 
    824   1.1  blymn 	  /* rows must be equal, check columns */
    825   1.1  blymn 	if (form->fields[a]->form_col < form->fields[b]->form_col)
    826   1.1  blymn 		return a;
    827   1.1  blymn 
    828   1.1  blymn 	if (form->fields[a]->form_col > form->fields[b]->form_col)
    829   1.1  blymn 		return b;
    830   1.1  blymn 
    831   1.1  blymn 	  /* if we get here fields must be in exactly the same place, punt */
    832   1.1  blymn 	return a;
    833   1.1  blymn }
    834   1.1  blymn 
    835   1.1  blymn /*
    836   1.1  blymn  * Return the index to the field that is the bottom-right-most of the
    837   1.1  blymn  * two given fields.
    838   1.1  blymn  */
    839   1.1  blymn static int
    840   1.1  blymn _formi_bottom_right(FORM *form, int a, int b)
    841   1.1  blymn {
    842   1.1  blymn 	  /* check the rows first, biggest row wins */
    843   1.1  blymn 	if (form->fields[a]->form_row > form->fields[b]->form_row)
    844   1.1  blymn 		return a;
    845   1.1  blymn 	if (form->fields[a]->form_row < form->fields[b]->form_row)
    846   1.1  blymn 		return b;
    847   1.1  blymn 
    848   1.1  blymn 	  /* rows must be equal, check cols, biggest wins */
    849   1.1  blymn 	if (form->fields[a]->form_col > form->fields[b]->form_col)
    850   1.1  blymn 		return a;
    851   1.1  blymn 	if (form->fields[a]->form_col < form->fields[b]->form_col)
    852   1.1  blymn 		return b;
    853   1.1  blymn 
    854   1.1  blymn 	  /* fields in the same place, punt */
    855   1.1  blymn 	return a;
    856   1.1  blymn }
    857   1.1  blymn 
    858   1.1  blymn /*
    859   1.1  blymn  * Find the end of the current word in the string str, starting at
    860   1.1  blymn  * offset - the end includes any trailing whitespace.  If the end of
    861   1.1  blymn  * the string is found before a new word then just return the offset
    862   1.1  blymn  * to the end of the string.
    863   1.1  blymn  */
    864   1.1  blymn static int
    865   1.1  blymn find_eow(char *str, unsigned int offset)
    866   1.1  blymn {
    867   1.1  blymn 	int start;
    868   1.1  blymn 
    869   1.1  blymn 	start = offset;
    870   1.1  blymn 	  /* first skip any non-whitespace */
    871   1.1  blymn 	while ((str[start] != '\0') && !isblank(str[start]))
    872   1.1  blymn 		start++;
    873   1.1  blymn 
    874   1.1  blymn 	  /* see if we hit the end of the string */
    875   1.1  blymn 	if (str[start] == '\0')
    876   1.1  blymn 		return start;
    877   1.1  blymn 
    878   1.1  blymn 	  /* otherwise skip the whitespace.... */
    879   1.1  blymn 	while ((str[start] != '\0') && isblank(str[start]))
    880   1.1  blymn 		start++;
    881   1.1  blymn 
    882   1.1  blymn 	return start;
    883   1.1  blymn }
    884   1.1  blymn 
    885   1.1  blymn /*
    886   1.1  blymn  * Find the beginning of the current word in the string str, starting
    887   1.1  blymn  * at offset.
    888   1.1  blymn  */
    889   1.1  blymn static int
    890   1.1  blymn find_sow(char *str, unsigned int offset)
    891   1.1  blymn {
    892   1.1  blymn 	int start;
    893   1.1  blymn 
    894   1.1  blymn 	start = offset;
    895   1.1  blymn 
    896   1.1  blymn 	if (start > 0) {
    897   1.1  blymn 		if (isblank(str[start]) || isblank(str[start - 1])) {
    898   1.1  blymn 			if (isblank(str[start - 1]))
    899   1.1  blymn 				start--;
    900   1.1  blymn 			  /* skip the whitespace.... */
    901   1.1  blymn 			while ((start >= 0) && isblank(str[start]))
    902   1.1  blymn 				start--;
    903   1.1  blymn 		}
    904   1.1  blymn 	}
    905   1.1  blymn 
    906   1.1  blymn 	  /* see if we hit the start of the string */
    907   1.1  blymn 	if (start < 0)
    908   1.1  blymn 		return 0;
    909   1.1  blymn 
    910   1.1  blymn 	  /* now skip any non-whitespace */
    911   1.1  blymn 	while ((start >= 0) && !isblank(str[start]))
    912   1.1  blymn 		start--;
    913   1.1  blymn 
    914   1.1  blymn 	if (start > 0)
    915   1.1  blymn 		start++; /* last loop has us pointing at a space, adjust */
    916   1.1  blymn 
    917   1.1  blymn 	if (start < 0)
    918   1.1  blymn 		start = 0;
    919   1.1  blymn 
    920   1.1  blymn 	return start;
    921   1.1  blymn }
    922   1.1  blymn 
    923   1.1  blymn /*
    924   1.1  blymn  * Scroll the field forward the given number of lines.
    925   1.1  blymn  */
    926   1.1  blymn static void
    927   1.1  blymn _formi_scroll_fwd(FIELD *field, unsigned int amt)
    928   1.1  blymn {
    929   1.1  blymn 	  /* check if we have lines to scroll */
    930   1.1  blymn 	if (field->row_count < (field->start_line + field->rows))
    931   1.1  blymn 		return;
    932   1.1  blymn 
    933   1.1  blymn 	field->start_line += min(amt,
    934   1.1  blymn 				 field->row_count - field->start_line
    935   1.1  blymn 				 - field->rows);
    936   1.1  blymn }
    937   1.1  blymn 
    938   1.1  blymn /*
    939   1.1  blymn  * Scroll the field backward the given number of lines.
    940   1.1  blymn  */
    941   1.1  blymn static void
    942   1.1  blymn _formi_scroll_back(FIELD *field, unsigned int amt)
    943   1.1  blymn {
    944   1.1  blymn 	if (field->start_line == 0)
    945   1.1  blymn 		return;
    946   1.1  blymn 
    947   1.1  blymn 	field->start_line -= min(field->start_line, amt);
    948   1.1  blymn }
    949   1.1  blymn 
    950   1.1  blymn /*
    951   1.1  blymn  * Scroll the field forward the given number of characters.
    952   1.1  blymn  */
    953   1.1  blymn void
    954   1.1  blymn _formi_hscroll_fwd(FIELD *field, int unsigned amt)
    955   1.1  blymn {
    956  1.23  blymn 	unsigned int row, end, scroll_amt, expanded;
    957  1.23  blymn 	_formi_tab_t *ts;
    958  1.23  blymn 
    959  1.23  blymn 	row = field->start_line + field->cursor_ypos;
    960  1.23  blymn 
    961  1.23  blymn 	if ((field->lines[row].tabs == NULL)
    962  1.23  blymn 	    || (field->lines[row].tabs->in_use == FALSE)) {
    963  1.23  blymn 		  /* if the line has no tabs things are easy... */
    964  1.23  blymn 		end =  field->start_char + field->cols + amt - 1;
    965  1.23  blymn 		scroll_amt = amt;
    966  1.23  blymn 		if (end > field->lines[row].end) {
    967  1.23  blymn 			end = field->lines[row].end;
    968  1.23  blymn 			scroll_amt = end - field->start_char - field->cols + 1;
    969  1.23  blymn 		}
    970  1.23  blymn 	} else {
    971  1.23  blymn 		  /*
    972  1.23  blymn 		   * If there are tabs we need to add on the scroll amount,
    973  1.23  blymn 		   * find the last char position that will fit into
    974  1.23  blymn 		   * the field and finally fix up the start_char.  This
    975  1.23  blymn 		   * is a lot of work but handling the case where there
    976  1.23  blymn 		   * are not enough chars to scroll by amt is difficult.
    977  1.23  blymn 		   */
    978  1.23  blymn 		end = field->start_char + field->row_xpos + amt;
    979  1.23  blymn 		if (end >= field->buffers[0].length)
    980  1.23  blymn 			end = field->buffers[0].length - 1;
    981  1.23  blymn 		else {
    982  1.23  blymn 			expanded = _formi_tab_expanded_length(
    983  1.23  blymn 				field->buffers[0].string,
    984  1.23  blymn 				field->start_char + amt,
    985  1.23  blymn 				field->start_char + field->row_xpos + amt);
    986  1.23  blymn 			ts = field->lines[0].tabs;
    987  1.23  blymn 			  /* skip tabs to the lhs of our starting point */
    988  1.23  blymn 			while ((ts != NULL) && (ts->in_use == TRUE)
    989  1.23  blymn 			       && (ts->pos < end))
    990  1.23  blymn 				ts = ts->fwd;
    991  1.23  blymn 
    992  1.23  blymn 			while ((expanded <= field->cols)
    993  1.23  blymn 			       && (end < field->buffers[0].length)) {
    994  1.23  blymn 				if (field->buffers[0].string[end] == '\t') {
    995  1.23  blymn #ifdef DEBUG
    996  1.23  blymn 					assert((ts != NULL)
    997  1.23  blymn 					       && (ts->in_use == TRUE));
    998  1.23  blymn #endif
    999  1.23  blymn 					if (ts->pos == end) {
   1000  1.23  blymn 						if ((expanded + ts->size)
   1001  1.23  blymn 						    > field->cols)
   1002  1.23  blymn 							break;
   1003  1.23  blymn 						expanded += ts->size;
   1004  1.23  blymn 						ts = ts->fwd;
   1005  1.23  blymn 					}
   1006  1.23  blymn #ifdef DEBUG
   1007  1.23  blymn 					else
   1008  1.23  blymn 						assert(ts->pos == end);
   1009  1.23  blymn #endif
   1010  1.23  blymn 				} else
   1011  1.23  blymn 					expanded++;
   1012  1.23  blymn 				end++;
   1013  1.23  blymn 			}
   1014  1.23  blymn 		}
   1015  1.23  blymn 
   1016  1.23  blymn 		scroll_amt = tab_fit_window(field, end, field->cols);
   1017  1.23  blymn 		if (scroll_amt < field->start_char)
   1018  1.23  blymn 			scroll_amt = 1;
   1019  1.23  blymn 		else
   1020  1.23  blymn 			scroll_amt -= field->start_char;
   1021  1.23  blymn 
   1022  1.23  blymn 		scroll_amt = min(scroll_amt, amt);
   1023  1.23  blymn 	}
   1024  1.23  blymn 
   1025  1.23  blymn 	field->start_char += scroll_amt;
   1026  1.23  blymn 	field->cursor_xpos =
   1027  1.23  blymn 		_formi_tab_expanded_length(field->buffers[0].string,
   1028  1.23  blymn 					   field->start_char,
   1029  1.23  blymn 					   field->row_xpos
   1030  1.23  blymn 					   + field->start_char) - 1;
   1031  1.23  blymn 
   1032   1.1  blymn }
   1033   1.1  blymn 
   1034   1.1  blymn /*
   1035   1.1  blymn  * Scroll the field backward the given number of characters.
   1036   1.1  blymn  */
   1037   1.1  blymn void
   1038   1.1  blymn _formi_hscroll_back(FIELD *field, unsigned int amt)
   1039   1.1  blymn {
   1040  1.14  blymn 	field->start_char -= min(field->start_char, amt);
   1041  1.23  blymn 	field->cursor_xpos =
   1042  1.23  blymn 		_formi_tab_expanded_length(field->buffers[0].string,
   1043  1.23  blymn 					   field->start_char,
   1044  1.23  blymn 					   field->row_xpos
   1045  1.23  blymn 					   + field->start_char) - 1;
   1046  1.23  blymn 	if (field->cursor_xpos >= field->cols) {
   1047  1.23  blymn 		field->row_xpos = 0;
   1048  1.23  blymn 		field->cursor_xpos = 0;
   1049  1.23  blymn 	}
   1050   1.1  blymn }
   1051   1.1  blymn 
   1052   1.1  blymn /*
   1053   1.1  blymn  * Find the different pages in the form fields and assign the form
   1054   1.1  blymn  * page_starts array with the information to find them.
   1055   1.1  blymn  */
   1056   1.1  blymn int
   1057   1.1  blymn _formi_find_pages(FORM *form)
   1058   1.1  blymn {
   1059   1.1  blymn 	int i, cur_page = 0;
   1060   1.1  blymn 
   1061   1.1  blymn 	if ((form->page_starts = (_FORMI_PAGE_START *)
   1062   1.1  blymn 	     malloc((form->max_page + 1) * sizeof(_FORMI_PAGE_START))) == NULL)
   1063   1.1  blymn 		return E_SYSTEM_ERROR;
   1064   1.1  blymn 
   1065   1.1  blymn 	  /* initialise the page starts array */
   1066   1.1  blymn 	memset(form->page_starts, 0,
   1067   1.1  blymn 	       (form->max_page + 1) * sizeof(_FORMI_PAGE_START));
   1068   1.1  blymn 
   1069   1.1  blymn 	for (i =0; i < form->field_count; i++) {
   1070   1.1  blymn 		if (form->fields[i]->page_break == 1)
   1071   1.1  blymn 			cur_page++;
   1072   1.1  blymn 		if (form->page_starts[cur_page].in_use == 0) {
   1073   1.1  blymn 			form->page_starts[cur_page].in_use = 1;
   1074   1.1  blymn 			form->page_starts[cur_page].first = i;
   1075   1.1  blymn 			form->page_starts[cur_page].last = i;
   1076   1.1  blymn 			form->page_starts[cur_page].top_left = i;
   1077   1.1  blymn 			form->page_starts[cur_page].bottom_right = i;
   1078   1.1  blymn 		} else {
   1079   1.1  blymn 			form->page_starts[cur_page].last = i;
   1080   1.1  blymn 			form->page_starts[cur_page].top_left =
   1081   1.1  blymn 				_formi_top_left(form,
   1082   1.1  blymn 						form->page_starts[cur_page].top_left,
   1083   1.1  blymn 						i);
   1084   1.1  blymn 			form->page_starts[cur_page].bottom_right =
   1085   1.1  blymn 				_formi_bottom_right(form,
   1086   1.1  blymn 						    form->page_starts[cur_page].bottom_right,
   1087   1.1  blymn 						    i);
   1088   1.1  blymn 		}
   1089   1.1  blymn 	}
   1090   1.1  blymn 
   1091   1.1  blymn 	return E_OK;
   1092   1.1  blymn }
   1093   1.1  blymn 
   1094   1.1  blymn /*
   1095   1.1  blymn  * Completely redraw the field of the given form.
   1096   1.1  blymn  */
   1097   1.9  blymn void
   1098   1.1  blymn _formi_redraw_field(FORM *form, int field)
   1099   1.1  blymn {
   1100  1.23  blymn 	unsigned int pre, post, flen, slen, i, row, start;
   1101  1.23  blymn 	unsigned int last_row, tab, cpos, len;
   1102  1.23  blymn 	char *str, c;
   1103   1.1  blymn 	FIELD *cur;
   1104   1.1  blymn #ifdef DEBUG
   1105   1.1  blymn 	char buffer[100];
   1106   1.1  blymn #endif
   1107   1.1  blymn 
   1108   1.1  blymn 	cur = form->fields[field];
   1109   1.1  blymn 	str = cur->buffers[0].string;
   1110   1.1  blymn 	flen = cur->cols;
   1111   1.1  blymn 	slen = 0;
   1112   1.1  blymn 	start = 0;
   1113   1.1  blymn 
   1114  1.17  blymn 	if ((cur->row_count - cur->start_line) < cur->rows)
   1115  1.17  blymn 		last_row = cur->row_count;
   1116  1.17  blymn 	else
   1117  1.17  blymn 		last_row = cur->start_line + cur->rows;
   1118  1.17  blymn 
   1119  1.17  blymn 	for (row = cur->start_line; row < last_row; row++) {
   1120  1.16  blymn 		wmove(form->scrwin,
   1121  1.16  blymn 		      (int) (cur->form_row + row - cur->start_line),
   1122  1.15  blymn 		      (int) cur->form_col);
   1123  1.15  blymn 		start = cur->lines[row].start;
   1124  1.23  blymn 		if ((cur->rows + cur->nrows) == 1) {
   1125  1.23  blymn 			if ((cur->start_char + cur->cols)
   1126  1.23  blymn 			    >= cur->buffers[0].length)
   1127  1.23  blymn 				len = cur->buffers[0].length;
   1128  1.23  blymn 			else
   1129  1.23  blymn 				len = cur->cols + cur->start_char;
   1130  1.23  blymn 			slen = _formi_tab_expanded_length(
   1131  1.23  blymn 				cur->buffers[0].string, cur->start_char, len);
   1132  1.23  blymn 			if (slen > cur->cols)
   1133  1.23  blymn 				slen = cur->cols;
   1134  1.23  blymn 			slen += cur->start_char;
   1135  1.23  blymn 		} else
   1136  1.23  blymn 			slen = cur->lines[row].length;
   1137   1.4  blymn 
   1138  1.13  blymn 		if ((cur->opts & O_STATIC) == O_STATIC) {
   1139  1.13  blymn 			switch (cur->justification) {
   1140  1.13  blymn 			case JUSTIFY_RIGHT:
   1141  1.13  blymn 				post = 0;
   1142  1.13  blymn 				if (flen < slen)
   1143  1.13  blymn 					pre = 0;
   1144  1.13  blymn 				else
   1145  1.13  blymn 					pre = flen - slen;
   1146  1.13  blymn 				break;
   1147  1.13  blymn 
   1148  1.13  blymn 			case JUSTIFY_CENTER:
   1149  1.13  blymn 				if (flen < slen) {
   1150  1.13  blymn 					pre = 0;
   1151  1.13  blymn 					post = 0;
   1152  1.13  blymn 				} else {
   1153  1.13  blymn 					pre = flen - slen;
   1154  1.13  blymn 					post = pre = pre / 2;
   1155  1.13  blymn 					  /* get padding right if
   1156  1.13  blymn                                              centring is not even */
   1157  1.13  blymn 					if ((post + pre + slen) < flen)
   1158  1.13  blymn 						post++;
   1159  1.13  blymn 				}
   1160  1.13  blymn 				break;
   1161  1.13  blymn 
   1162  1.13  blymn 			case NO_JUSTIFICATION:
   1163  1.13  blymn 			case JUSTIFY_LEFT:
   1164  1.13  blymn 			default:
   1165   1.1  blymn 				pre = 0;
   1166  1.13  blymn 				if (flen <= slen)
   1167  1.13  blymn 					post = 0;
   1168  1.13  blymn 				else {
   1169  1.13  blymn 					post = flen - slen;
   1170  1.13  blymn 					if (post > flen)
   1171  1.13  blymn 						post = flen;
   1172  1.13  blymn 				}
   1173  1.13  blymn 				break;
   1174   1.1  blymn 			}
   1175  1.13  blymn 		} else {
   1176  1.13  blymn 			  /* dynamic fields are not justified */
   1177   1.1  blymn 			pre = 0;
   1178   1.1  blymn 			if (flen <= slen)
   1179   1.1  blymn 				post = 0;
   1180   1.1  blymn 			else {
   1181   1.1  blymn 				post = flen - slen;
   1182   1.1  blymn 				if (post > flen)
   1183   1.1  blymn 					post = flen;
   1184   1.1  blymn 			}
   1185   1.1  blymn 
   1186  1.13  blymn 			  /* but they do scroll.... */
   1187  1.13  blymn 
   1188  1.14  blymn 			if (pre > cur->start_char - start)
   1189  1.14  blymn 				pre = pre - cur->start_char + start;
   1190  1.13  blymn 			else
   1191  1.13  blymn 				pre = 0;
   1192  1.13  blymn 
   1193  1.14  blymn 			if (slen > cur->start_char) {
   1194  1.14  blymn 				slen -= cur->start_char;
   1195  1.22  blymn 				if (slen > flen)
   1196  1.22  blymn 					post = 0;
   1197  1.22  blymn 				else
   1198  1.22  blymn 					post = flen - slen;
   1199  1.22  blymn 
   1200  1.13  blymn 				if (post > flen)
   1201  1.13  blymn 					post = flen;
   1202  1.13  blymn 			} else {
   1203  1.13  blymn 				slen = 0;
   1204  1.13  blymn 				post = flen - pre;
   1205  1.13  blymn 			}
   1206   1.1  blymn 		}
   1207  1.13  blymn 
   1208   1.1  blymn 		if (form->cur_field == field)
   1209  1.13  blymn 			wattrset(form->scrwin, cur->fore);
   1210   1.1  blymn 		else
   1211  1.13  blymn 			wattrset(form->scrwin, cur->back);
   1212   1.1  blymn 
   1213   1.1  blymn #ifdef DEBUG
   1214  1.12  blymn 		if (_formi_create_dbg_file() == E_OK) {
   1215  1.12  blymn 			fprintf(dbg,
   1216  1.14  blymn   "redraw_field: start=%d, pre=%d, slen=%d, flen=%d, post=%d, start_char=%d\n",
   1217  1.14  blymn 				start, pre, slen, flen, post, cur->start_char);
   1218  1.12  blymn 			if (str != NULL) {
   1219  1.15  blymn 				strncpy(buffer,
   1220  1.15  blymn 					&str[cur->start_char
   1221  1.15  blymn 					    + cur->lines[row].start], flen);
   1222  1.12  blymn 			} else {
   1223  1.12  blymn 				strcpy(buffer, "(null)");
   1224  1.12  blymn 			}
   1225  1.12  blymn 			buffer[flen] = '\0';
   1226  1.12  blymn 			fprintf(dbg, "redraw_field: %s\n", buffer);
   1227   1.4  blymn 		}
   1228   1.1  blymn #endif
   1229   1.1  blymn 
   1230  1.14  blymn 		for (i = start + cur->start_char; i < pre; i++)
   1231  1.13  blymn 			waddch(form->scrwin, cur->pad);
   1232   1.1  blymn 
   1233   1.1  blymn #ifdef DEBUG
   1234  1.14  blymn 		fprintf(dbg, "redraw_field: will add %d chars\n",
   1235  1.14  blymn 			min(slen, flen));
   1236   1.1  blymn #endif
   1237  1.23  blymn 		str = &cur->buffers[0].string[cur->start_char
   1238  1.23  blymn 					     + cur->lines[row].start];
   1239  1.23  blymn 
   1240  1.23  blymn 		for (i = 0, cpos = cur->start_char; i < min(slen, flen);
   1241  1.23  blymn 		     i++, str++, cpos++)
   1242   1.1  blymn 		{
   1243  1.23  blymn 			c = *str;
   1244  1.23  blymn 			tab = 0; /* just to shut gcc up */
   1245   1.1  blymn #ifdef DEBUG
   1246   1.2  blymn 			fprintf(dbg, "adding char str[%d]=%c\n",
   1247  1.23  blymn 				cpos + cur->start_char + cur->lines[row].start,
   1248  1.23  blymn 				c);
   1249   1.1  blymn #endif
   1250  1.13  blymn 			if (((cur->opts & O_PUBLIC) != O_PUBLIC)) {
   1251  1.23  blymn 				if (c == '\t')
   1252  1.23  blymn 					tab = add_tab(form, cur, row,
   1253  1.23  blymn 						      cpos, cur->pad);
   1254  1.23  blymn 				else
   1255  1.23  blymn 					waddch(form->scrwin, cur->pad);
   1256  1.13  blymn 			} else if ((cur->opts & O_VISIBLE) == O_VISIBLE) {
   1257  1.23  blymn 				if (c == '\t')
   1258  1.23  blymn 					tab = add_tab(form, cur, row, cpos,
   1259  1.23  blymn 						      ' ');
   1260  1.23  blymn 				else
   1261  1.23  blymn 					waddch(form->scrwin, c);
   1262  1.13  blymn 			} else {
   1263  1.23  blymn 				if (c == '\t')
   1264  1.23  blymn 					tab = add_tab(form, cur, row, cpos,
   1265  1.23  blymn 						      ' ');
   1266  1.23  blymn 				else
   1267  1.23  blymn 					waddch(form->scrwin, ' ');
   1268  1.13  blymn 			}
   1269  1.23  blymn 
   1270  1.23  blymn 			  /*
   1271  1.23  blymn 			   * If we have had a tab then skip forward
   1272  1.23  blymn 			   * the requisite number of chars to keep
   1273  1.23  blymn 			   * things in sync.
   1274  1.23  blymn 			   */
   1275  1.23  blymn 			if (c == '\t')
   1276  1.23  blymn 				i += tab - 1;
   1277   1.1  blymn 		}
   1278   1.1  blymn 
   1279   1.1  blymn 		for (i = 0; i < post; i++)
   1280  1.13  blymn 			waddch(form->scrwin, cur->pad);
   1281   1.1  blymn 	}
   1282  1.16  blymn 
   1283  1.16  blymn 	for (row = cur->row_count - cur->start_line; row < cur->rows; row++) {
   1284  1.16  blymn 		wmove(form->scrwin, (int) (cur->form_row + row),
   1285  1.16  blymn 		      (int) cur->form_col);
   1286  1.24  blymn 
   1287  1.24  blymn 		if (form->cur_field == field)
   1288  1.24  blymn 			wattrset(form->scrwin, cur->fore);
   1289  1.24  blymn 		else
   1290  1.24  blymn 			wattrset(form->scrwin, cur->back);
   1291  1.24  blymn 
   1292  1.16  blymn 		for (i = 0; i < cur->cols; i++) {
   1293  1.16  blymn 			waddch(form->scrwin, cur->pad);
   1294  1.16  blymn 		}
   1295  1.16  blymn 	}
   1296  1.16  blymn 
   1297  1.24  blymn 	wattrset(form->scrwin, cur->back);
   1298   1.1  blymn 	return;
   1299   1.1  blymn }
   1300   1.1  blymn 
   1301   1.1  blymn /*
   1302  1.23  blymn  * Add the correct number of the given character to simulate a tab
   1303  1.23  blymn  * in the field.
   1304  1.23  blymn  */
   1305  1.23  blymn static int
   1306  1.23  blymn add_tab(FORM *form, FIELD *field, unsigned row, unsigned int i, char c)
   1307  1.23  blymn {
   1308  1.23  blymn 	int j;
   1309  1.23  blymn 	_formi_tab_t *ts = field->lines[row].tabs;
   1310  1.23  blymn 
   1311  1.23  blymn 	while ((ts != NULL) && (ts->pos != i))
   1312  1.23  blymn 		ts = ts->fwd;
   1313  1.23  blymn 
   1314  1.23  blymn #ifdef DEBUG
   1315  1.23  blymn 	assert(ts != NULL);
   1316  1.23  blymn #endif
   1317  1.23  blymn 
   1318  1.23  blymn 	for (j = 0; j < ts->size; j++)
   1319  1.23  blymn 		waddch(form->scrwin, c);
   1320  1.23  blymn 
   1321  1.23  blymn 	return ts->size;
   1322  1.23  blymn }
   1323  1.23  blymn 
   1324  1.23  blymn 
   1325  1.23  blymn /*
   1326   1.1  blymn  * Display the fields attached to the form that are on the current page
   1327   1.1  blymn  * on the screen.
   1328   1.1  blymn  *
   1329   1.1  blymn  */
   1330   1.1  blymn int
   1331   1.1  blymn _formi_draw_page(FORM *form)
   1332   1.1  blymn {
   1333   1.1  blymn 	int i;
   1334   1.1  blymn 
   1335   1.1  blymn 	if (form->page_starts[form->page].in_use == 0)
   1336   1.1  blymn 		return E_BAD_ARGUMENT;
   1337   1.1  blymn 
   1338  1.13  blymn 	wclear(form->scrwin);
   1339   1.1  blymn 
   1340   1.1  blymn 	for (i = form->page_starts[form->page].first;
   1341   1.1  blymn 	     i <= form->page_starts[form->page].last; i++)
   1342   1.1  blymn 		_formi_redraw_field(form, i);
   1343   1.1  blymn 
   1344   1.1  blymn 	return E_OK;
   1345   1.1  blymn }
   1346   1.1  blymn 
   1347   1.1  blymn /*
   1348   1.1  blymn  * Add the character c at the position pos in buffer 0 of the given field
   1349   1.1  blymn  */
   1350   1.1  blymn int
   1351   1.1  blymn _formi_add_char(FIELD *field, unsigned int pos, char c)
   1352   1.1  blymn {
   1353  1.21  blymn 	char *new, old_c;
   1354   1.1  blymn 	unsigned int new_size;
   1355   1.1  blymn 	int status;
   1356   1.1  blymn 
   1357   1.5  blymn 	  /*
   1358   1.5  blymn 	   * If buffer has not had a string before, set it to a blank
   1359   1.5  blymn 	   * string.  Everything should flow from there....
   1360   1.5  blymn 	   */
   1361   1.5  blymn 	if (field->buffers[0].string == NULL) {
   1362   1.5  blymn 		set_field_buffer(field, 0, "");
   1363   1.5  blymn 	}
   1364   1.8  blymn 
   1365   1.8  blymn 	if (_formi_validate_char(field, c) != E_OK) {
   1366   1.8  blymn #ifdef DEBUG
   1367   1.8  blymn 		fprintf(dbg, "add_char: char %c failed char validation\n", c);
   1368   1.8  blymn #endif
   1369   1.8  blymn 		return E_INVALID_FIELD;
   1370   1.8  blymn 	}
   1371  1.23  blymn 
   1372  1.23  blymn 	if ((c == '\t') && (field->cols <= 8)) {
   1373  1.23  blymn #ifdef DEBUG
   1374  1.23  blymn 		fprintf(dbg, "add_char: field too small for a tab\n");
   1375  1.23  blymn #endif
   1376  1.23  blymn 		return E_NO_ROOM;
   1377  1.23  blymn 	}
   1378   1.5  blymn 
   1379   1.1  blymn #ifdef DEBUG
   1380   1.2  blymn 	fprintf(dbg, "add_char: pos=%d, char=%c\n", pos, c);
   1381  1.23  blymn 	fprintf(dbg, "add_char enter: xpos=%d, row_pos=%d, start=%d\n",
   1382  1.23  blymn 		field->cursor_xpos, field->row_xpos, field->start_char);
   1383  1.23  blymn 	fprintf(dbg, "add_char enter: length=%d(%d), allocated=%d\n",
   1384   1.1  blymn 		field->buffers[0].length, strlen(field->buffers[0].string),
   1385   1.1  blymn 		field->buffers[0].allocated);
   1386   1.2  blymn 	fprintf(dbg, "add_char enter: %s\n", field->buffers[0].string);
   1387  1.10  blymn 	fprintf(dbg, "add_char enter: buf0_status=%d\n", field->buf0_status);
   1388   1.1  blymn #endif
   1389   1.1  blymn 	if (((field->opts & O_BLANK) == O_BLANK) &&
   1390  1.13  blymn 	    (field->buf0_status == FALSE) &&
   1391  1.23  blymn 	    ((field->row_xpos + field->start_char) == 0)) {
   1392   1.1  blymn 		field->buffers[0].length = 0;
   1393   1.1  blymn 		field->buffers[0].string[0] = '\0';
   1394   1.1  blymn 		pos = 0;
   1395   1.1  blymn 		field->start_char = 0;
   1396   1.1  blymn 		field->start_line = 0;
   1397   1.9  blymn 		field->row_count = 1;
   1398  1.23  blymn 		field->row_xpos = 0;
   1399   1.1  blymn 		field->cursor_ypos = 0;
   1400  1.15  blymn 		field->lines[0].start = 0;
   1401  1.15  blymn 		field->lines[0].end = 0;
   1402  1.15  blymn 		field->lines[0].length = 0;
   1403  1.25  blymn 		_formi_init_field_xpos(field);
   1404   1.1  blymn 	}
   1405   1.1  blymn 
   1406   1.1  blymn 
   1407   1.1  blymn 	if ((field->overlay == 0)
   1408   1.1  blymn 	    || ((field->overlay == 1) && (pos >= field->buffers[0].length))) {
   1409  1.10  blymn 		  /* first check if the field can have more chars...*/
   1410  1.22  blymn 		if (check_field_size(field) == FALSE)
   1411  1.10  blymn 			return E_REQUEST_DENIED;
   1412  1.10  blymn 
   1413   1.1  blymn 		if (field->buffers[0].length + 1
   1414   1.1  blymn 		    >= field->buffers[0].allocated) {
   1415   1.1  blymn 			new_size = field->buffers[0].allocated + 64
   1416   1.1  blymn 				- (field->buffers[0].allocated % 64);
   1417   1.1  blymn 			if ((new = (char *) realloc(field->buffers[0].string,
   1418   1.1  blymn 						    new_size )) == NULL)
   1419   1.1  blymn 				return E_SYSTEM_ERROR;
   1420   1.1  blymn 			field->buffers[0].allocated = new_size;
   1421   1.1  blymn 			field->buffers[0].string = new;
   1422   1.1  blymn 		}
   1423   1.1  blymn 	}
   1424   1.1  blymn 
   1425   1.1  blymn 	if ((field->overlay == 0) && (field->buffers[0].length > pos)) {
   1426   1.1  blymn 		bcopy(&field->buffers[0].string[pos],
   1427   1.1  blymn 		      &field->buffers[0].string[pos + 1],
   1428   1.1  blymn 		      field->buffers[0].length - pos + 1);
   1429   1.1  blymn 	}
   1430  1.21  blymn 
   1431  1.21  blymn 	old_c = field->buffers[0].string[pos];
   1432   1.1  blymn 	field->buffers[0].string[pos] = c;
   1433   1.1  blymn 	if (pos >= field->buffers[0].length) {
   1434   1.1  blymn 		  /* make sure the string is terminated if we are at the
   1435   1.1  blymn 		   * end of the string, the terminator would be missing
   1436   1.1  blymn 		   * if we are are at the end of the field.
   1437   1.1  blymn 		   */
   1438   1.1  blymn 		field->buffers[0].string[pos + 1] = '\0';
   1439   1.1  blymn 	}
   1440   1.1  blymn 
   1441   1.1  blymn 	  /* only increment the length if we are inserting characters
   1442   1.1  blymn 	   * OR if we are at the end of the field in overlay mode.
   1443   1.1  blymn 	   */
   1444   1.1  blymn 	if ((field->overlay == 0)
   1445  1.15  blymn 	    || ((field->overlay == 1) && (pos >= field->buffers[0].length))) {
   1446  1.15  blymn 		field->buffers[0].length++;
   1447  1.20  blymn 		bump_lines(field, (int) pos, 1, TRUE);
   1448  1.23  blymn 	} else if (field->overlay == 1)
   1449  1.23  blymn 		bump_lines(field, (int) pos, 0, TRUE);
   1450  1.23  blymn 
   1451  1.23  blymn 	new_size = find_cur_line(field, pos);
   1452  1.23  blymn 	_formi_calculate_tabs(field, new_size);
   1453  1.15  blymn 
   1454   1.1  blymn 	  /* wrap the field, if needed */
   1455   1.1  blymn 	status = _formi_wrap_field(field, pos);
   1456  1.23  blymn 
   1457  1.23  blymn 	  /* just in case the row we are on wrapped */
   1458  1.23  blymn 	new_size = find_cur_line(field, pos);
   1459  1.21  blymn 
   1460  1.21  blymn 	  /*
   1461  1.21  blymn 	   * check the wrap worked or that we have not exceeded the
   1462  1.21  blymn 	   * max field size - this can happen if the field is re-wrapped
   1463  1.21  blymn 	   * and the row count is increased past the set limit.
   1464  1.21  blymn 	   */
   1465  1.22  blymn 	if ((status != E_OK) || (check_field_size(field) == FALSE)) {
   1466  1.21  blymn 		if ((field->overlay == 0)
   1467  1.21  blymn 		    || ((field->overlay == 1)
   1468  1.21  blymn 			&& (pos >= field->buffers[0].length))) {
   1469  1.21  blymn 			  /*
   1470  1.21  blymn 			   * wrap failed for some reason, back out the
   1471  1.21  blymn 			   * char insert
   1472  1.21  blymn 			   */
   1473  1.21  blymn 			bcopy(&field->buffers[0].string[pos + 1],
   1474  1.21  blymn 			      &field->buffers[0].string[pos],
   1475  1.21  blymn 			      field->buffers[0].length - pos);
   1476  1.21  blymn 			field->buffers[0].length--;
   1477  1.21  blymn 			bump_lines(field, (int) pos, -1, TRUE);
   1478  1.23  blymn 			if (pos > 0)
   1479  1.23  blymn 				pos--;
   1480  1.21  blymn 		} else if (field->overlay == 1) {
   1481  1.21  blymn 			  /* back out character overlay */
   1482  1.21  blymn 			field->buffers[0].string[pos] = old_c;
   1483  1.21  blymn 		}
   1484  1.21  blymn 
   1485  1.23  blymn 		new_size = find_cur_line(field, pos);
   1486  1.23  blymn 		_formi_calculate_tabs(field, new_size);
   1487  1.23  blymn 
   1488  1.23  blymn 		_formi_wrap_field(field, pos);
   1489  1.23  blymn 		  /*
   1490  1.23  blymn 		   * If we are here then either the status is bad or we
   1491  1.23  blymn 		   * simply ran out of room.  If the status is E_OK then
   1492  1.23  blymn 		   * we ran out of room, let the form driver know this.
   1493  1.23  blymn 		   */
   1494  1.23  blymn 		if (status == E_OK)
   1495  1.23  blymn 			status = E_REQUEST_DENIED;
   1496  1.23  blymn 
   1497   1.1  blymn 	} else {
   1498   1.1  blymn 		field->buf0_status = TRUE;
   1499  1.15  blymn 		if ((field->rows + field->nrows) == 1) {
   1500  1.25  blymn 			field->row_xpos++;
   1501  1.28  blymn 			status = _formi_set_cursor_xpos(field, FALSE);
   1502  1.15  blymn 		} else {
   1503  1.16  blymn 			if (new_size >= field->rows) {
   1504  1.16  blymn 				field->cursor_ypos = field->rows - 1;
   1505  1.16  blymn 				field->start_line = field->row_count
   1506  1.16  blymn 					- field->cursor_ypos - 1;
   1507  1.16  blymn 			} else
   1508  1.16  blymn 				field->cursor_ypos = new_size;
   1509  1.21  blymn 
   1510  1.21  blymn 			if ((field->lines[new_size].start) <= (pos + 1)) {
   1511  1.23  blymn 				field->row_xpos = pos
   1512  1.21  blymn 					- field->lines[new_size].start + 1;
   1513  1.23  blymn 				field->cursor_xpos =
   1514  1.23  blymn 					_formi_tab_expanded_length(
   1515  1.23  blymn 						&field->buffers[0].string[
   1516  1.23  blymn 						    field->lines[new_size].start], 0,
   1517  1.23  blymn 						field->row_xpos - 1);
   1518  1.21  blymn 			} else {
   1519  1.23  blymn 				field->row_xpos = 0;
   1520  1.21  blymn 				field->cursor_xpos = 0;
   1521  1.21  blymn 			}
   1522  1.16  blymn 
   1523  1.16  blymn 			  /*
   1524  1.16  blymn 			   * Annoying corner case - if we are right in
   1525  1.16  blymn 			   * the bottom right corner of the field we
   1526  1.16  blymn 			   * need to scroll the field one line so the
   1527  1.16  blymn 			   * cursor is positioned correctly in the
   1528  1.16  blymn 			   * field.
   1529  1.16  blymn 			   */
   1530  1.16  blymn 			if ((field->cursor_xpos >= field->cols) &&
   1531  1.16  blymn 			    (field->cursor_ypos == (field->rows - 1))) {
   1532  1.16  blymn 				field->cursor_ypos--;
   1533  1.16  blymn 				field->start_line++;
   1534  1.16  blymn 			}
   1535   1.1  blymn 		}
   1536   1.1  blymn 	}
   1537   1.1  blymn 
   1538   1.1  blymn #ifdef DEBUG
   1539  1.21  blymn 	assert((field->cursor_xpos <= field->cols)
   1540  1.16  blymn 	       && (field->cursor_ypos < 400000)
   1541  1.16  blymn 	       && (field->start_line < 400000));
   1542  1.16  blymn 
   1543  1.23  blymn 	fprintf(dbg, "add_char exit: xpos=%d, row_pos=%d, start=%d\n",
   1544  1.23  blymn 		field->cursor_xpos, field->row_xpos, field->start_char);
   1545  1.23  blymn 	fprintf(dbg, "add_char_exit: length=%d(%d), allocated=%d\n",
   1546   1.1  blymn 		field->buffers[0].length, strlen(field->buffers[0].string),
   1547   1.1  blymn 		field->buffers[0].allocated);
   1548  1.16  blymn 	fprintf(dbg, "add_char exit: ypos=%d, start_line=%d\n",
   1549  1.16  blymn 		field->cursor_ypos, field->start_line);
   1550   1.2  blymn 	fprintf(dbg,"add_char exit: %s\n", field->buffers[0].string);
   1551  1.10  blymn 	fprintf(dbg, "add_char exit: buf0_status=%d\n", field->buf0_status);
   1552   1.2  blymn 	fprintf(dbg, "add_char exit: status = %s\n",
   1553   1.1  blymn 		(status == E_OK)? "OK" : "FAILED");
   1554   1.1  blymn #endif
   1555  1.10  blymn 	return status;
   1556   1.1  blymn }
   1557   1.1  blymn 
   1558   1.1  blymn /*
   1559  1.25  blymn  * Set the position of the cursor on the screen in the row depending on
   1560  1.25  blymn  * where the current position in the string is and the justification
   1561  1.25  blymn  * that is to be applied to the field.  Justification is only applied
   1562  1.25  blymn  * to single row, static fields.
   1563  1.25  blymn  */
   1564  1.25  blymn static int
   1565  1.28  blymn _formi_set_cursor_xpos(FIELD *field, int noscroll)
   1566  1.25  blymn {
   1567  1.25  blymn 	int just, pos;
   1568  1.25  blymn 
   1569  1.25  blymn 	just = field->justification;
   1570  1.25  blymn 	pos = field->start_char + field->row_xpos
   1571  1.25  blymn 	   + field->lines[field->start_line + field->cursor_ypos].start;
   1572  1.25  blymn 
   1573  1.25  blymn #ifdef DEBUG
   1574  1.25  blymn 	fprintf(dbg,
   1575  1.25  blymn 	  "cursor_xpos enter: pos %d, start_char %d, row_xpos %d, xpos %d\n",
   1576  1.25  blymn 		pos, field->start_char, field->row_xpos, field->cursor_xpos);
   1577  1.25  blymn #endif
   1578  1.25  blymn 
   1579  1.25  blymn 	  /*
   1580  1.25  blymn 	   * make sure we apply the correct justification to non-static
   1581  1.25  blymn 	   * fields.
   1582  1.25  blymn 	   */
   1583  1.25  blymn 	if (((field->rows + field->nrows) != 1) ||
   1584  1.25  blymn 	    ((field->opts & O_STATIC) != O_STATIC))
   1585  1.25  blymn 		just = JUSTIFY_LEFT;
   1586  1.25  blymn 
   1587  1.25  blymn 	switch (just) {
   1588  1.25  blymn 	case JUSTIFY_RIGHT:
   1589  1.25  blymn 		field->cursor_xpos = field->cols - 1
   1590  1.25  blymn 			- _formi_tab_expanded_length(
   1591  1.25  blymn 				field->buffers[0].string, 0,
   1592  1.25  blymn 				field->buffers[0].length - 1)
   1593  1.25  blymn 			+ _formi_tab_expanded_length(
   1594  1.25  blymn 				field->buffers[0].string, 0,
   1595  1.25  blymn 				field->row_xpos);
   1596  1.25  blymn 		break;
   1597  1.25  blymn 
   1598  1.25  blymn 	case JUSTIFY_CENTER:
   1599  1.25  blymn 		field->cursor_xpos = ((field->cols - 1)
   1600  1.25  blymn 			- _formi_tab_expanded_length(
   1601  1.25  blymn 				field->buffers[0].string, 0,
   1602  1.25  blymn 				field->buffers[0].length - 1) + 1) / 2
   1603  1.25  blymn 			+ _formi_tab_expanded_length(field->buffers[0].string,
   1604  1.25  blymn 						     0, field->row_xpos);
   1605  1.25  blymn 
   1606  1.25  blymn 		if (field->cursor_xpos > (field->cols - 1))
   1607  1.25  blymn 			field->cursor_xpos = (field->cols - 1);
   1608  1.25  blymn 		break;
   1609  1.25  blymn 
   1610  1.25  blymn 	default:
   1611  1.25  blymn 		field->cursor_xpos = _formi_tab_expanded_length(
   1612  1.25  blymn 			field->buffers[0].string,
   1613  1.25  blymn 			field->start_char,
   1614  1.25  blymn 			field->row_xpos	+ field->start_char);
   1615  1.25  blymn 		if ((field->cursor_xpos <= (field->cols - 1)) &&
   1616  1.25  blymn 		    ((field->start_char + field->row_xpos)
   1617  1.25  blymn 		     < field->buffers[0].length))
   1618  1.25  blymn 			field->cursor_xpos--;
   1619  1.25  blymn 
   1620  1.25  blymn 		if (field->cursor_xpos > (field->cols - 1)) {
   1621  1.25  blymn 			if ((field->opts & O_STATIC) == O_STATIC) {
   1622  1.25  blymn 				field->start_char = 0;
   1623  1.25  blymn 
   1624  1.25  blymn 				if (field->row_xpos
   1625  1.25  blymn 				    == (field->buffers[0].length - 1)) {
   1626  1.25  blymn 					field->cursor_xpos = field->cols - 1;
   1627  1.25  blymn 				} else {
   1628  1.25  blymn 					field->cursor_xpos =
   1629  1.25  blymn 						_formi_tab_expanded_length(
   1630  1.25  blymn 						  field->buffers[0].string,
   1631  1.25  blymn 						  field->start_char,
   1632  1.25  blymn 						  field->row_xpos
   1633  1.25  blymn 						    + field->start_char
   1634  1.25  blymn 						  - 1) - 1;
   1635  1.25  blymn 				}
   1636  1.25  blymn 			} else {
   1637  1.28  blymn 				if (noscroll == FALSE) {
   1638  1.28  blymn 					field->start_char =
   1639  1.28  blymn 						tab_fit_window(
   1640  1.28  blymn 							field,
   1641  1.28  blymn 							field->start_char
   1642  1.28  blymn 							+ field->row_xpos,
   1643  1.28  blymn 							field->cols);
   1644  1.28  blymn 					field->row_xpos = pos
   1645  1.28  blymn 						- field->start_char;
   1646  1.28  blymn 					field->cursor_xpos =
   1647  1.28  blymn 						_formi_tab_expanded_length(
   1648  1.28  blymn 						   field->buffers[0].string,
   1649  1.28  blymn 						   field->start_char,
   1650  1.28  blymn 						   field->row_xpos
   1651  1.28  blymn 						      + field->start_char - 1);
   1652  1.28  blymn 				} else {
   1653  1.28  blymn 					field->cursor_xpos = (field->cols - 1);
   1654  1.28  blymn 				}
   1655  1.25  blymn 			}
   1656  1.25  blymn 
   1657  1.25  blymn 		}
   1658  1.25  blymn 		break;
   1659  1.25  blymn 	}
   1660  1.25  blymn 
   1661  1.25  blymn #ifdef DEBUG
   1662  1.25  blymn 	fprintf(dbg,
   1663  1.25  blymn 	  "cursor_xpos exit: pos %d, start_char %d, row_xpos %d, xpos %d\n",
   1664  1.25  blymn 		pos, field->start_char, field->row_xpos, field->cursor_xpos);
   1665  1.25  blymn #endif
   1666  1.25  blymn 	return E_OK;
   1667  1.25  blymn }
   1668  1.25  blymn 
   1669  1.25  blymn /*
   1670   1.1  blymn  * Manipulate the text in a field, this takes the given form and performs
   1671   1.1  blymn  * the passed driver command on the current text field.  Returns 1 if the
   1672   1.1  blymn  * text field was modified.
   1673   1.1  blymn  */
   1674   1.1  blymn int
   1675   1.1  blymn _formi_manipulate_field(FORM *form, int c)
   1676   1.1  blymn {
   1677   1.1  blymn 	FIELD *cur;
   1678  1.20  blymn 	char *str, saved;
   1679  1.25  blymn 	unsigned int start, end, pos, row, status, old_count, size;
   1680  1.23  blymn 	unsigned int old_xpos, old_row_pos;
   1681  1.20  blymn 	int len;
   1682  1.20  blymn 
   1683   1.1  blymn 	cur = form->fields[form->cur_field];
   1684  1.24  blymn 	if ((cur->buffers[0].string == NULL) || (cur->buffers[0].length == 0))
   1685  1.24  blymn 		return E_REQUEST_DENIED;
   1686   1.1  blymn 
   1687   1.1  blymn #ifdef DEBUG
   1688  1.23  blymn 	fprintf(dbg, "entry: request is REQ_%s\n", reqs[c - REQ_MIN_REQUEST]);
   1689   1.2  blymn 	fprintf(dbg,
   1690  1.23  blymn 	"entry: xpos=%d, row_pos=%d, start_char=%d, length=%d, allocated=%d\n",
   1691  1.23  blymn 		cur->cursor_xpos, cur->row_xpos, cur->start_char,
   1692  1.23  blymn 		cur->buffers[0].length,	cur->buffers[0].allocated);
   1693  1.18  blymn 	fprintf(dbg, "entry: start_line=%d, ypos=%d\n", cur->start_line,
   1694  1.18  blymn 		cur->cursor_ypos);
   1695   1.6  blymn 	fprintf(dbg, "entry: string=");
   1696   1.6  blymn 	if (cur->buffers[0].string == NULL)
   1697   1.6  blymn 		fprintf(dbg, "(null)\n");
   1698   1.6  blymn 	else
   1699   1.6  blymn 		fprintf(dbg, "\"%s\"\n", cur->buffers[0].string);
   1700   1.1  blymn #endif
   1701   1.6  blymn 
   1702   1.6  blymn 	  /* Cannot manipulate a null string! */
   1703   1.6  blymn 	if (cur->buffers[0].string == NULL)
   1704   1.6  blymn 		return E_REQUEST_DENIED;
   1705  1.23  blymn 
   1706  1.23  blymn 	row = cur->start_line + cur->cursor_ypos;
   1707  1.23  blymn 	saved = cur->buffers[0].string[cur->start_char + cur->row_xpos
   1708  1.23  blymn 				      + cur->lines[row].start];
   1709   1.6  blymn 
   1710   1.1  blymn 	switch (c) {
   1711  1.23  blymn 	case REQ_RIGHT_CHAR:
   1712  1.23  blymn 		  /*
   1713  1.23  blymn 		   * The right_char request performs the same function
   1714  1.23  blymn 		   * as the next_char request except that the cursor is
   1715  1.23  blymn 		   * not wrapped if it is at the end of the line, so
   1716  1.23  blymn 		   * check if the cursor is at the end of the line and
   1717  1.23  blymn 		   * deny the request otherwise just fall through to
   1718  1.23  blymn 		   * the next_char request handler.
   1719  1.23  blymn 		   */
   1720  1.27  blymn 		if (cur->cursor_xpos >= cur->cols - 1)
   1721  1.23  blymn 			return E_REQUEST_DENIED;
   1722  1.23  blymn 
   1723  1.23  blymn 		  /* FALLTHRU */
   1724  1.23  blymn 
   1725   1.1  blymn 	case REQ_NEXT_CHAR:
   1726  1.14  blymn 		  /* for a dynamic field allow an offset of one more
   1727  1.14  blymn 		   * char so we can insert chars after end of string.
   1728  1.14  blymn 		   * Static fields cannot do this so deny request if
   1729  1.14  blymn 		   * cursor is at the end of the field.
   1730  1.14  blymn 		   */
   1731  1.14  blymn 		if (((cur->opts & O_STATIC) == O_STATIC) &&
   1732  1.23  blymn 		    (cur->row_xpos == cur->cols - 1) &&
   1733  1.17  blymn 		    ((cur->rows + cur->nrows) == 1))
   1734   1.1  blymn 			return E_REQUEST_DENIED;
   1735  1.14  blymn 
   1736  1.23  blymn 		if ((cur->row_xpos + cur->start_char + 1)
   1737  1.14  blymn 		    > cur->buffers[0].length)
   1738  1.14  blymn 			return E_REQUEST_DENIED;
   1739  1.14  blymn 
   1740  1.17  blymn 		if ((cur->rows + cur->nrows) == 1) {
   1741  1.23  blymn 			cur->row_xpos++;
   1742  1.28  blymn 			_formi_set_cursor_xpos(cur, (c == REQ_RIGHT_CHAR));
   1743  1.17  blymn 		} else {
   1744  1.23  blymn 			if (cur->cursor_xpos >= (cur->lines[row].length - 1)) {
   1745  1.27  blymn 				if (((row + 1) >= cur->row_count) ||
   1746  1.27  blymn 				    (c == REQ_RIGHT_CHAR))
   1747  1.17  blymn 					return E_REQUEST_DENIED;
   1748  1.17  blymn 
   1749  1.17  blymn 				cur->cursor_xpos = 0;
   1750  1.23  blymn 				cur->row_xpos = 0;
   1751  1.17  blymn 				if (cur->cursor_ypos == (cur->rows - 1))
   1752  1.17  blymn 					cur->start_line++;
   1753  1.17  blymn 				else
   1754  1.17  blymn 					cur->cursor_ypos++;
   1755  1.23  blymn 			} else {
   1756  1.23  blymn 				old_xpos = cur->cursor_xpos;
   1757  1.23  blymn 				old_row_pos = cur->row_xpos;
   1758  1.23  blymn 				if (saved == '\t')
   1759  1.23  blymn 					cur->cursor_xpos += tab_size(cur,
   1760  1.23  blymn 							cur->lines[row].start,
   1761  1.23  blymn 							cur->row_xpos);
   1762  1.23  blymn 				else
   1763  1.23  blymn 					cur->cursor_xpos++;
   1764  1.23  blymn 				cur->row_xpos++;
   1765  1.23  blymn 				if (cur->cursor_xpos
   1766  1.23  blymn 				    >= cur->lines[row].length) {
   1767  1.27  blymn 					if (((row + 1) >= cur->row_count) ||
   1768  1.27  blymn 					    (c == REQ_RIGHT_CHAR)) {
   1769  1.23  blymn 						cur->cursor_xpos = old_xpos;
   1770  1.23  blymn 						cur->row_xpos = old_row_pos;
   1771  1.23  blymn 						return E_REQUEST_DENIED;
   1772  1.23  blymn 					}
   1773  1.23  blymn 
   1774  1.23  blymn 					cur->cursor_xpos = 0;
   1775  1.23  blymn 					cur->row_xpos = 0;
   1776  1.23  blymn 					if (cur->cursor_ypos
   1777  1.23  blymn 					    == (cur->rows - 1))
   1778  1.23  blymn 						cur->start_line++;
   1779  1.23  blymn 					else
   1780  1.23  blymn 						cur->cursor_ypos++;
   1781  1.23  blymn 				}
   1782  1.23  blymn 			}
   1783   1.1  blymn 		}
   1784  1.17  blymn 
   1785   1.1  blymn 		break;
   1786  1.23  blymn 
   1787  1.23  blymn 	case REQ_LEFT_CHAR:
   1788  1.23  blymn 		  /*
   1789  1.23  blymn 		   * The behaviour of left_char is the same as prev_char
   1790  1.23  blymn 		   * except that the cursor will not wrap if it has
   1791  1.23  blymn 		   * reached the LHS of the field, so just check this
   1792  1.23  blymn 		   * and fall through if we are not at the LHS.
   1793  1.23  blymn 		   */
   1794  1.23  blymn 		if (cur->cursor_xpos == 0)
   1795  1.23  blymn 			return E_REQUEST_DENIED;
   1796  1.23  blymn 
   1797  1.23  blymn 		  /* FALLTHRU */
   1798   1.1  blymn 	case REQ_PREV_CHAR:
   1799  1.17  blymn 		if ((cur->rows + cur->nrows) == 1) {
   1800  1.23  blymn 			if (cur->row_xpos == 0) {
   1801  1.17  blymn 				if (cur->start_char > 0)
   1802  1.17  blymn 					cur->start_char--;
   1803  1.17  blymn 				else
   1804  1.17  blymn 					return E_REQUEST_DENIED;
   1805  1.23  blymn 			} else {
   1806  1.23  blymn 				cur->row_xpos--;
   1807  1.28  blymn 				_formi_set_cursor_xpos(cur, FALSE);
   1808  1.23  blymn 			}
   1809  1.17  blymn 		} else {
   1810  1.17  blymn 			if ((cur->cursor_xpos == 0) &&
   1811  1.17  blymn 			    (cur->cursor_ypos == 0) &&
   1812  1.17  blymn 			    (cur->start_line == 0))
   1813   1.1  blymn 				return E_REQUEST_DENIED;
   1814  1.17  blymn 
   1815  1.23  blymn 			row = cur->start_line + cur->cursor_ypos;
   1816  1.23  blymn 			pos = cur->lines[row].start + cur->row_xpos;
   1817  1.23  blymn 			if ((pos >= cur->buffers[0].length) && (pos > 0))
   1818  1.23  blymn 				pos--;
   1819  1.23  blymn 
   1820  1.17  blymn 			if (cur->cursor_xpos > 0) {
   1821  1.23  blymn 				if (cur->buffers[0].string[pos] == '\t') {
   1822  1.23  blymn 					size = tab_size(cur,
   1823  1.23  blymn 							cur->lines[row].start,
   1824  1.23  blymn 							pos
   1825  1.23  blymn 							- cur->lines[row].start);
   1826  1.23  blymn 					if (size > cur->cursor_xpos) {
   1827  1.23  blymn 						cur->cursor_xpos = 0;
   1828  1.23  blymn 						cur->row_xpos = 0;
   1829  1.23  blymn 					} else {
   1830  1.23  blymn 						cur->row_xpos--;
   1831  1.23  blymn 						cur->cursor_xpos -= size;
   1832  1.23  blymn 					}
   1833  1.23  blymn 				} else {
   1834  1.23  blymn 					cur->cursor_xpos--;
   1835  1.23  blymn 					cur->row_xpos--;
   1836  1.23  blymn 				}
   1837  1.17  blymn 			} else {
   1838  1.17  blymn 				if (cur->cursor_ypos > 0)
   1839  1.17  blymn 					cur->cursor_ypos--;
   1840  1.17  blymn 				else
   1841  1.17  blymn 					cur->start_line--;
   1842  1.23  blymn 				row = cur->start_line + cur->cursor_ypos;
   1843  1.23  blymn 				cur->cursor_xpos = cur->lines[row].length - 1;
   1844  1.23  blymn 				cur->row_xpos = cur->lines[row].end -
   1845  1.23  blymn 					cur->lines[row].start;
   1846  1.17  blymn 			}
   1847  1.17  blymn 		}
   1848  1.17  blymn 
   1849   1.1  blymn 		break;
   1850  1.23  blymn 
   1851  1.23  blymn 	case REQ_DOWN_CHAR:
   1852  1.23  blymn 		  /*
   1853  1.23  blymn 		   * The down_char request has the same functionality as
   1854  1.23  blymn 		   * the next_line request excepting that the field is not
   1855  1.23  blymn 		   * scrolled if the cursor is at the bottom of the field.
   1856  1.23  blymn 		   * Check to see if the cursor is at the bottom of the field
   1857  1.23  blymn 		   * and if it is then deny the request otherwise fall
   1858  1.23  blymn 		   * through to the next_line handler.
   1859  1.23  blymn 		   */
   1860  1.23  blymn 		if (cur->cursor_ypos >= cur->rows - 1)
   1861  1.23  blymn 			return E_REQUEST_DENIED;
   1862  1.23  blymn 
   1863  1.23  blymn 		  /* FALLTHRU */
   1864   1.1  blymn 
   1865   1.1  blymn 	case REQ_NEXT_LINE:
   1866  1.19  blymn 		if ((cur->start_line + cur->cursor_ypos + 1) >= cur->row_count)
   1867  1.19  blymn 			return E_REQUEST_DENIED;
   1868  1.19  blymn 
   1869  1.19  blymn 		if ((cur->cursor_ypos + 1) >= cur->rows) {
   1870   1.1  blymn 			cur->start_line++;
   1871  1.19  blymn 		} else
   1872  1.19  blymn 			cur->cursor_ypos++;
   1873  1.23  blymn 		row = cur->cursor_ypos + cur->start_line;
   1874  1.23  blymn 		cur->row_xpos =	tab_fit_len(cur, row, cur->cursor_xpos)
   1875  1.23  blymn 			- cur->lines[row].start;
   1876  1.23  blymn 		cur->cursor_xpos =
   1877  1.23  blymn 			_formi_tab_expanded_length(
   1878  1.23  blymn 				&cur->buffers[0].string[cur->lines[row].start],
   1879  1.23  blymn 				0, cur->row_xpos);
   1880   1.1  blymn 		break;
   1881   1.1  blymn 
   1882  1.23  blymn 	case REQ_UP_CHAR:
   1883  1.23  blymn 		  /*
   1884  1.23  blymn 		   * The up_char request has the same functionality as
   1885  1.23  blymn 		   * the prev_line request excepting the field is not
   1886  1.23  blymn 		   * scrolled, check if the cursor is at the top of the
   1887  1.23  blymn 		   * field, if it is deny the request otherwise fall
   1888  1.23  blymn 		   * through to the prev_line handler.
   1889  1.23  blymn 		   */
   1890  1.23  blymn 		if (cur->cursor_ypos == 0)
   1891  1.23  blymn 			return E_REQUEST_DENIED;
   1892  1.23  blymn 
   1893  1.23  blymn 		  /* FALLTHRU */
   1894  1.23  blymn 
   1895   1.1  blymn 	case REQ_PREV_LINE:
   1896   1.1  blymn 		if (cur->cursor_ypos == 0) {
   1897   1.1  blymn 			if (cur->start_line == 0)
   1898   1.1  blymn 				return E_REQUEST_DENIED;
   1899   1.1  blymn 			cur->start_line--;
   1900   1.1  blymn 		} else
   1901   1.1  blymn 			cur->cursor_ypos--;
   1902  1.23  blymn 		row = cur->cursor_ypos + cur->start_line;
   1903  1.23  blymn 		cur->row_xpos =	tab_fit_len(cur, row, cur->cursor_xpos + 1)
   1904  1.23  blymn 			- cur->lines[row].start;
   1905  1.23  blymn 		cur->cursor_xpos =
   1906  1.23  blymn 			_formi_tab_expanded_length(
   1907  1.23  blymn 				&cur->buffers[0].string[cur->lines[row].start],
   1908  1.23  blymn 				0, cur->row_xpos) - 1;
   1909   1.1  blymn 		break;
   1910   1.1  blymn 
   1911   1.1  blymn 	case REQ_NEXT_WORD:
   1912  1.18  blymn 		start = cur->lines[cur->start_line + cur->cursor_ypos].start
   1913  1.23  blymn 			+ cur->row_xpos + cur->start_char;
   1914   1.1  blymn 		str = cur->buffers[0].string;
   1915   1.1  blymn 
   1916   1.1  blymn 		start = find_eow(str, start);
   1917   1.1  blymn 
   1918   1.1  blymn 		  /* check if we hit the end */
   1919   1.1  blymn 		if (str[start] == '\0')
   1920   1.1  blymn 			return E_REQUEST_DENIED;
   1921   1.1  blymn 
   1922   1.1  blymn 		  /* otherwise we must have found the start of a word...*/
   1923  1.18  blymn 		if ((cur->rows + cur->nrows) == 1) {
   1924  1.18  blymn 			  /* single line field */
   1925  1.23  blymn 			size = _formi_tab_expanded_length(str,
   1926  1.23  blymn 				cur->start_char, start);
   1927  1.23  blymn 			if (size < cur->cols) {
   1928  1.23  blymn 				cur->row_xpos = start - cur->start_char;
   1929  1.18  blymn 			} else {
   1930  1.18  blymn 				cur->start_char = start;
   1931  1.23  blymn 				cur->row_xpos = 0;
   1932  1.18  blymn 			}
   1933  1.28  blymn 			_formi_set_cursor_xpos(cur, FALSE);
   1934  1.25  blymn 	} else {
   1935  1.18  blymn 			  /* multiline field */
   1936  1.18  blymn 			row = find_cur_line(cur, start);
   1937  1.23  blymn 			cur->row_xpos = start - cur->lines[row].start;
   1938  1.23  blymn 			cur->cursor_xpos = _formi_tab_expanded_length(
   1939  1.23  blymn 				&str[cur->lines[row].start],
   1940  1.23  blymn 				0, cur->row_xpos) - 1;
   1941  1.18  blymn 			if (row != (cur->start_line + cur->cursor_ypos)) {
   1942  1.18  blymn 				if (cur->cursor_ypos == (cur->rows - 1)) {
   1943  1.18  blymn 					cur->start_line = row - cur->rows + 1;
   1944  1.18  blymn 				} else {
   1945  1.18  blymn 					cur->cursor_ypos = row
   1946  1.18  blymn 						- cur->start_line;
   1947  1.18  blymn 				}
   1948  1.18  blymn 			}
   1949   1.1  blymn 		}
   1950   1.1  blymn 		break;
   1951   1.1  blymn 
   1952   1.1  blymn 	case REQ_PREV_WORD:
   1953  1.23  blymn 		start = cur->start_char + cur->row_xpos
   1954  1.18  blymn 			+ cur->lines[cur->start_line + cur->cursor_ypos].start;
   1955   1.1  blymn 		if (cur->start_char > 0)
   1956   1.1  blymn 			start--;
   1957   1.1  blymn 
   1958   1.1  blymn 		if (start == 0)
   1959   1.1  blymn 			return E_REQUEST_DENIED;
   1960   1.1  blymn 
   1961   1.1  blymn 		str = cur->buffers[0].string;
   1962   1.1  blymn 
   1963   1.1  blymn 		start = find_sow(str, start);
   1964   1.1  blymn 
   1965  1.18  blymn 		if ((cur->rows + cur->nrows) == 1) {
   1966  1.18  blymn 			  /* single line field */
   1967  1.23  blymn 			size = _formi_tab_expanded_length(str,
   1968  1.23  blymn 				cur->start_char, start);
   1969  1.23  blymn 
   1970  1.23  blymn 			if (start > cur->start_char) {
   1971  1.23  blymn 				cur->row_xpos = start - cur->start_char;
   1972  1.18  blymn 			} else {
   1973  1.18  blymn 				cur->start_char = start;
   1974  1.23  blymn 				cur->row_xpos = 0;
   1975  1.18  blymn 			}
   1976  1.28  blymn 			_formi_set_cursor_xpos(cur, FALSE);
   1977   1.1  blymn 		} else {
   1978  1.18  blymn 			  /* multiline field */
   1979  1.18  blymn 			row = find_cur_line(cur, start);
   1980  1.23  blymn 			cur->row_xpos = start - cur->lines[row].start;
   1981  1.23  blymn 			cur->cursor_xpos = _formi_tab_expanded_length(
   1982  1.23  blymn 				&str[cur->lines[row].start], 0,
   1983  1.23  blymn 				cur->row_xpos) - 1;
   1984  1.18  blymn 			if (row != (cur->start_line + cur->cursor_ypos)) {
   1985  1.18  blymn 				if (cur->cursor_ypos == 0) {
   1986  1.18  blymn 					cur->start_line = row;
   1987  1.18  blymn 				} else {
   1988  1.18  blymn 					if (cur->start_line > row) {
   1989  1.18  blymn 						cur->start_line = row;
   1990  1.18  blymn 						cur->cursor_ypos = 0;
   1991  1.18  blymn 					} else {
   1992  1.18  blymn 						cur->cursor_ypos = row -
   1993  1.18  blymn 							cur->start_line;
   1994  1.18  blymn 					}
   1995  1.18  blymn 				}
   1996  1.18  blymn 			}
   1997   1.1  blymn 		}
   1998  1.18  blymn 
   1999   1.1  blymn 		break;
   2000  1.23  blymn 
   2001   1.1  blymn 	case REQ_BEG_FIELD:
   2002   1.1  blymn 		cur->start_char = 0;
   2003   1.1  blymn 		cur->start_line = 0;
   2004  1.23  blymn 		cur->row_xpos = 0;
   2005  1.25  blymn 		_formi_init_field_xpos(cur);
   2006   1.1  blymn 		cur->cursor_ypos = 0;
   2007   1.1  blymn 		break;
   2008   1.1  blymn 
   2009   1.1  blymn 	case REQ_BEG_LINE:
   2010  1.23  blymn 		cur->row_xpos = 0;
   2011  1.25  blymn 		_formi_init_field_xpos(cur);
   2012  1.21  blymn 		cur->start_char = 0;
   2013   1.1  blymn 		break;
   2014   1.1  blymn 
   2015  1.14  blymn 	case REQ_END_FIELD:
   2016  1.14  blymn 		if (cur->row_count > cur->rows) {
   2017  1.14  blymn 			cur->start_line = cur->row_count - cur->rows;
   2018  1.14  blymn 			cur->cursor_ypos = cur->rows - 1;
   2019  1.14  blymn 		} else {
   2020  1.14  blymn 			cur->start_line = 0;
   2021  1.14  blymn 			cur->cursor_ypos = cur->row_count - 1;
   2022  1.14  blymn 		}
   2023  1.14  blymn 
   2024  1.14  blymn 		  /* we fall through here deliberately, we are on the
   2025  1.14  blymn 		   * correct row, now we need to get to the end of the
   2026  1.14  blymn 		   * line.
   2027  1.14  blymn 		   */
   2028  1.14  blymn 		  /* FALLTHRU */
   2029  1.14  blymn 
   2030   1.1  blymn 	case REQ_END_LINE:
   2031  1.23  blymn 		row = cur->start_line + cur->cursor_ypos;
   2032  1.23  blymn 		start = cur->lines[row].start;
   2033  1.23  blymn 		end = cur->lines[row].end;
   2034   1.1  blymn 
   2035  1.17  blymn 		if ((cur->rows + cur->nrows) == 1) {
   2036  1.23  blymn 			if (cur->lines[row].length > cur->cols - 1) {
   2037  1.23  blymn 				if ((cur->opts & O_STATIC) != O_STATIC) {
   2038  1.23  blymn 					cur->start_char = tab_fit_window(
   2039  1.23  blymn 						cur, end, cur->cols) + 1;
   2040  1.25  blymn 					cur->row_xpos = cur->buffers[0].length
   2041  1.25  blymn 						- cur->start_char;
   2042  1.23  blymn 				} else {
   2043  1.25  blymn 					cur->start_char = 0;
   2044  1.25  blymn 					cur->row_xpos = cur->cols - 1;
   2045  1.23  blymn 				}
   2046  1.17  blymn 			} else {
   2047  1.23  blymn 				cur->row_xpos = end + 1;
   2048  1.23  blymn 				cur->start_char = 0;
   2049  1.17  blymn 			}
   2050  1.28  blymn 			_formi_set_cursor_xpos(cur, FALSE);
   2051   1.1  blymn 		} else {
   2052  1.23  blymn 			cur->row_xpos = end - start;
   2053  1.23  blymn 			cur->cursor_xpos = cur->lines[row].length - 1;
   2054  1.23  blymn 			if (row == (cur->row_count - 1)) {
   2055  1.23  blymn 				cur->row_xpos++;
   2056  1.23  blymn 				cur->cursor_xpos++;
   2057   1.1  blymn 			}
   2058   1.1  blymn 		}
   2059   1.1  blymn 		break;
   2060   1.1  blymn 
   2061   1.1  blymn 	case REQ_NEW_LINE:
   2062  1.15  blymn 		if ((status = split_line(cur,
   2063  1.23  blymn 				cur->start_char + cur->row_xpos)) != E_OK)
   2064  1.15  blymn 			return status;
   2065   1.1  blymn 		break;
   2066   1.1  blymn 
   2067   1.1  blymn 	case REQ_INS_CHAR:
   2068  1.21  blymn 		if ((status = _formi_add_char(cur, cur->start_char
   2069  1.23  blymn 					      + cur->row_xpos,
   2070  1.21  blymn 					      cur->pad)) != E_OK)
   2071  1.21  blymn 			return status;
   2072   1.1  blymn 		break;
   2073   1.1  blymn 
   2074   1.1  blymn 	case REQ_INS_LINE:
   2075  1.15  blymn 		start = cur->lines[cur->start_line + cur->cursor_ypos].start;
   2076  1.15  blymn 		if ((status = split_line(cur, start)) != E_OK)
   2077  1.15  blymn 			return status;
   2078   1.1  blymn 		break;
   2079   1.1  blymn 
   2080   1.1  blymn 	case REQ_DEL_CHAR:
   2081  1.15  blymn 		if (cur->buffers[0].length == 0)
   2082   1.1  blymn 			return E_REQUEST_DENIED;
   2083  1.15  blymn 
   2084  1.15  blymn 		row = cur->start_line + cur->cursor_ypos;
   2085  1.23  blymn 		start = cur->start_char + cur->row_xpos
   2086  1.20  blymn 			+ cur->lines[row].start;
   2087   1.1  blymn 		end = cur->buffers[0].length;
   2088  1.23  blymn 		if (start >= cur->buffers[0].length)
   2089  1.23  blymn 			return E_REQUEST_DENIED;
   2090  1.23  blymn 
   2091  1.20  blymn 		if (start == cur->lines[row].end) {
   2092  1.20  blymn 			if ((cur->rows + cur->nrows) > 1) {
   2093  1.23  blymn 				/*
   2094  1.23  blymn 				 * If we have more than one row, join the
   2095  1.23  blymn 				 * next row to make things easier unless
   2096  1.23  blymn 				 * we are at the end of the string, in
   2097  1.23  blymn 				 * that case the join would fail but we
   2098  1.23  blymn 				 * really want to delete the last char
   2099  1.23  blymn 				 * in the field.
   2100  1.23  blymn 				 */
   2101  1.23  blymn 				if ((cur->row_count > 1)
   2102  1.23  blymn 				    && (start != (end - 1))) {
   2103  1.20  blymn 					if (_formi_join_line(cur,
   2104  1.20  blymn 							     start,
   2105  1.20  blymn 							     JOIN_NEXT_NW)
   2106  1.20  blymn 					    != E_OK) {
   2107  1.20  blymn 						return E_REQUEST_DENIED;
   2108  1.20  blymn 					}
   2109  1.23  blymn 				}
   2110  1.23  blymn 			}
   2111  1.20  blymn 		}
   2112  1.23  blymn 
   2113  1.20  blymn 		saved = cur->buffers[0].string[start];
   2114  1.20  blymn 		bcopy(&cur->buffers[0].string[start + 1],
   2115  1.20  blymn 		      &cur->buffers[0].string[start],
   2116  1.20  blymn 		      (unsigned) end - start + 1);
   2117  1.23  blymn 		bump_lines(cur, _FORMI_USE_CURRENT, -1, TRUE);
   2118  1.20  blymn 		cur->buffers[0].length--;
   2119  1.23  blymn 
   2120  1.23  blymn 		  /*
   2121  1.23  blymn 		   * recalculate tabs for a single line field, multiline
   2122  1.23  blymn 		   * fields will do this when the field is wrapped.
   2123  1.23  blymn 		   */
   2124  1.23  blymn 		if ((cur->rows + cur->nrows) == 1)
   2125  1.23  blymn 			_formi_calculate_tabs(cur, 0);
   2126  1.23  blymn 		  /*
   2127  1.23  blymn 		   * if we are at the end of the string then back the
   2128  1.23  blymn 		   * cursor pos up one to stick on the end of the line
   2129  1.23  blymn 		   */
   2130  1.23  blymn 		if (start == cur->buffers[0].length) {
   2131  1.23  blymn 			if (cur->buffers[0].length > 1) {
   2132  1.23  blymn 				if ((cur->rows + cur->nrows) == 1) {
   2133  1.23  blymn 					pos = cur->row_xpos + cur->start_char;
   2134  1.23  blymn 					cur->start_char =
   2135  1.25  blymn 						tab_fit_window(
   2136  1.25  blymn 							cur,
   2137  1.25  blymn 							cur->start_char + cur->row_xpos,
   2138  1.25  blymn 							cur->cols);
   2139  1.23  blymn 					cur->row_xpos = pos - cur->start_char
   2140  1.23  blymn 						- 1;
   2141  1.28  blymn 					_formi_set_cursor_xpos(cur, FALSE);
   2142  1.23  blymn 				} else {
   2143  1.23  blymn 					if (cur->row_xpos == 0) {
   2144  1.23  blymn 						if (cur->lines[row].start !=
   2145  1.23  blymn 						    cur->buffers[0].length) {
   2146  1.23  blymn 							if (_formi_join_line(
   2147  1.23  blymn 								cur,
   2148  1.23  blymn 								cur->lines[row].start,
   2149  1.23  blymn 								JOIN_PREV_NW)
   2150  1.23  blymn 							    != E_OK) {
   2151  1.23  blymn 								return E_REQUEST_DENIED;
   2152  1.23  blymn 							}
   2153  1.23  blymn 						} else {
   2154  1.23  blymn 							if (cur->row_count > 1)
   2155  1.23  blymn 								cur->row_count--;
   2156  1.23  blymn 						}
   2157  1.23  blymn 
   2158  1.23  blymn 						row = cur->start_line
   2159  1.23  blymn 							+ cur->cursor_ypos;
   2160  1.23  blymn 						if (row > 0)
   2161  1.23  blymn 							row--;
   2162  1.23  blymn 					}
   2163  1.23  blymn 
   2164  1.23  blymn 					cur->row_xpos = start
   2165  1.23  blymn 						- cur->lines[row].start - 1;
   2166  1.23  blymn 					cur->cursor_xpos =
   2167  1.23  blymn 						_formi_tab_expanded_length(
   2168  1.23  blymn 							&cur->buffers[0].string[cur->lines[row].start],
   2169  1.23  blymn 							0, cur->row_xpos);
   2170  1.23  blymn 					if ((cur->cursor_xpos > 0)
   2171  1.23  blymn 					    && (start != (cur->buffers[0].length - 1)))
   2172  1.23  blymn 						cur->cursor_xpos--;
   2173  1.23  blymn 					if (row >= cur->rows)
   2174  1.23  blymn 						cur->start_line = row
   2175  1.23  blymn 							- cur->cursor_ypos;
   2176  1.23  blymn 					else {
   2177  1.23  blymn 						cur->start_line = 0;
   2178  1.23  blymn 						cur->cursor_ypos = row;
   2179  1.23  blymn 					}
   2180  1.23  blymn 				}
   2181  1.23  blymn 
   2182  1.23  blymn 				start--;
   2183  1.23  blymn 			} else {
   2184  1.23  blymn 				start = 0;
   2185  1.23  blymn 				cur->row_xpos = 0;
   2186  1.26  blymn 				_formi_init_field_xpos(cur);
   2187  1.23  blymn 			}
   2188  1.23  blymn 		}
   2189  1.23  blymn 
   2190  1.20  blymn 		if ((cur->rows + cur->nrows) > 1) {
   2191  1.20  blymn 			if (_formi_wrap_field(cur, start) != E_OK) {
   2192  1.20  blymn 				bcopy(&cur->buffers[0].string[start],
   2193  1.20  blymn 				      &cur->buffers[0].string[start + 1],
   2194  1.20  blymn 				      (unsigned) end - start);
   2195  1.20  blymn 				cur->buffers[0].length++;
   2196  1.20  blymn 				cur->buffers[0].string[start] = saved;
   2197  1.20  blymn 				bump_lines(cur, _FORMI_USE_CURRENT, 1, TRUE);
   2198  1.20  blymn 				_formi_wrap_field(cur, start);
   2199  1.20  blymn 				return E_REQUEST_DENIED;
   2200  1.15  blymn 			}
   2201   1.1  blymn 		}
   2202   1.1  blymn 		break;
   2203  1.23  blymn 
   2204   1.1  blymn 	case REQ_DEL_PREV:
   2205  1.19  blymn 		if ((cur->cursor_xpos == 0) && (cur->start_char == 0)
   2206  1.19  blymn 		    && (cur->start_line == 0) && (cur->cursor_ypos == 0))
   2207   1.1  blymn 			   return E_REQUEST_DENIED;
   2208   1.1  blymn 
   2209  1.19  blymn 		row = cur->start_line + cur->cursor_ypos;
   2210  1.23  blymn 		start = cur->row_xpos + cur->start_char
   2211  1.19  blymn 			+ cur->lines[row].start;
   2212   1.1  blymn 		end = cur->buffers[0].length;
   2213  1.19  blymn 
   2214  1.23  blymn 		if ((cur->start_char + cur->row_xpos) == 0) {
   2215  1.23  blymn 			  /*
   2216  1.23  blymn 			   * Join this line to the next one, but only if
   2217  1.23  blymn 			   * we are not at the end of the string because
   2218  1.23  blymn 			   * in that case there are no characters to join.
   2219  1.23  blymn 			   */
   2220  1.23  blymn 			if (cur->lines[row].start != end) {
   2221  1.23  blymn 				if (_formi_join_line(cur,
   2222  1.23  blymn 						     cur->lines[row].start,
   2223  1.23  blymn 						     JOIN_PREV_NW) != E_OK) {
   2224  1.23  blymn 					return E_REQUEST_DENIED;
   2225  1.23  blymn 				}
   2226  1.23  blymn 			} else {
   2227  1.23  blymn 				/* but we do want the row count decremented */
   2228  1.23  blymn 				if (cur->row_count > 1)
   2229  1.23  blymn 					cur->row_count--;
   2230  1.19  blymn 			}
   2231  1.19  blymn 		}
   2232  1.20  blymn 
   2233  1.20  blymn 		saved = cur->buffers[0].string[start - 1];
   2234  1.19  blymn 		bcopy(&cur->buffers[0].string[start],
   2235  1.19  blymn 		      &cur->buffers[0].string[start - 1],
   2236  1.19  blymn 		      (unsigned) end - start + 1);
   2237  1.20  blymn 		bump_lines(cur, (int) start - 1, -1, TRUE);
   2238  1.19  blymn 		cur->buffers[0].length--;
   2239  1.19  blymn 
   2240  1.19  blymn 		if ((cur->rows + cur->nrows) == 1) {
   2241  1.23  blymn 			_formi_calculate_tabs(cur, 0);
   2242  1.23  blymn 			pos = cur->row_xpos + cur->start_char;
   2243  1.23  blymn 			if (pos > 0)
   2244  1.23  blymn 				pos--;
   2245  1.23  blymn 			cur->start_char =
   2246  1.23  blymn 				tab_fit_window(cur,
   2247  1.23  blymn 					       cur->start_char + cur->row_xpos,
   2248  1.23  blymn 					       cur->cols);
   2249  1.23  blymn 			cur->row_xpos = pos - cur->start_char;
   2250  1.28  blymn 			_formi_set_cursor_xpos(cur, FALSE);
   2251   1.1  blymn 		} else {
   2252  1.19  blymn 			pos = start - 1;
   2253  1.19  blymn 			if (pos >= cur->buffers[0].length)
   2254  1.19  blymn 				pos = cur->buffers[0].length - 1;
   2255   1.1  blymn 
   2256  1.19  blymn 			if ((_formi_wrap_field(cur, pos) != E_OK)) {
   2257  1.20  blymn 				bcopy(&cur->buffers[0].string[start - 1],
   2258  1.20  blymn 				      &cur->buffers[0].string[start],
   2259  1.20  blymn 				      (unsigned) end - start);
   2260  1.20  blymn 				cur->buffers[0].length++;
   2261  1.20  blymn 				cur->buffers[0].string[start - 1] = saved;
   2262  1.20  blymn 				bump_lines(cur, (int) start - 1, 1, TRUE);
   2263  1.20  blymn 				_formi_wrap_field(cur, pos);
   2264  1.19  blymn 				return E_REQUEST_DENIED;
   2265  1.19  blymn 			}
   2266  1.19  blymn 
   2267  1.19  blymn 			row = find_cur_line(cur, pos);
   2268  1.23  blymn 			cur->row_xpos = start - cur->lines[row].start - 1;
   2269  1.23  blymn 			cur->cursor_xpos = _formi_tab_expanded_length(
   2270  1.23  blymn 				&cur->buffers[0].string[cur->lines[row].start],
   2271  1.23  blymn 				0, cur->row_xpos);
   2272  1.23  blymn 			if ((cur->cursor_xpos > 0)
   2273  1.23  blymn 			    && (pos != (cur->buffers[0].length - 1)))
   2274  1.23  blymn 				cur->cursor_xpos--;
   2275   1.1  blymn 
   2276  1.19  blymn 			if (row >= cur->rows)
   2277  1.19  blymn 				cur->start_line = row - cur->cursor_ypos;
   2278  1.19  blymn 			else {
   2279  1.19  blymn 				cur->start_line = 0;
   2280  1.19  blymn 				cur->cursor_ypos = row;
   2281  1.19  blymn 			}
   2282  1.19  blymn 		}
   2283   1.1  blymn 		break;
   2284  1.23  blymn 
   2285   1.1  blymn 	case REQ_DEL_LINE:
   2286  1.15  blymn 		row = cur->start_line + cur->cursor_ypos;
   2287  1.15  blymn 		start = cur->lines[row].start;
   2288  1.15  blymn 		end = cur->lines[row].end;
   2289   1.1  blymn 		bcopy(&cur->buffers[0].string[end + 1],
   2290   1.1  blymn 		      &cur->buffers[0].string[start],
   2291   1.1  blymn 		      (unsigned) cur->buffers[0].length - end + 1);
   2292  1.20  blymn 
   2293  1.20  blymn 		if (((cur->rows + cur->nrows) == 1) ||
   2294  1.20  blymn 		    (cur->row_count == 1)) {
   2295  1.20  blymn 			  /* single line case */
   2296  1.20  blymn 			cur->buffers[0].length = 0;
   2297  1.20  blymn 			cur->lines[0].end = cur->lines[0].length = 0;
   2298  1.25  blymn 			cur->row_xpos = 0;
   2299  1.25  blymn 			_formi_init_field_xpos(cur);
   2300  1.23  blymn 			cur->cursor_ypos = 0;
   2301  1.20  blymn 		} else {
   2302  1.20  blymn 			  /* multiline field */
   2303  1.20  blymn 			old_count = cur->row_count;
   2304   1.1  blymn 			cur->row_count--;
   2305  1.20  blymn 			if (cur->row_count == 0)
   2306  1.20  blymn 				cur->row_count = 1;
   2307  1.20  blymn 
   2308  1.20  blymn 			if (cur->row_count > 1)
   2309  1.20  blymn 				bcopy(&cur->lines[row + 1],
   2310  1.20  blymn 				      &cur->lines[row],
   2311  1.20  blymn 				      (unsigned) (cur->row_count - row)
   2312  1.20  blymn 				      * sizeof(struct _formi_field_lines));
   2313  1.20  blymn 
   2314  1.20  blymn 			cur->lines[row].start = start;
   2315  1.20  blymn 			len = start - end - 1; /* yes, this is negative */
   2316  1.20  blymn 
   2317  1.20  blymn 			if (row < (cur->row_count - 1))
   2318  1.20  blymn 				bump_lines(cur, (int) start, len, FALSE);
   2319  1.20  blymn 			else if (old_count == 1) {
   2320  1.20  blymn 				cur->lines[0].end = cur->lines[0].length = 0;
   2321  1.20  blymn 				cur->cursor_xpos = 0;
   2322  1.23  blymn 				cur->row_xpos = 0;
   2323  1.20  blymn 				cur->cursor_ypos = 0;
   2324  1.20  blymn 			} else if (cur->row_count == 1) {
   2325  1.20  blymn 				cur->lines[0].length = cur->buffers[0].length
   2326  1.20  blymn 					+ len;
   2327  1.20  blymn 				cur->lines[0].end = cur->lines[0].length - 1;
   2328  1.15  blymn 			}
   2329  1.15  blymn 
   2330  1.20  blymn 			cur->buffers[0].length += len;
   2331  1.20  blymn 
   2332  1.20  blymn 			if (row > (cur->row_count - 1)) {
   2333  1.20  blymn 				row--;
   2334  1.15  blymn 				if (cur->cursor_ypos == 0) {
   2335  1.15  blymn 					if (cur->start_line > 0) {
   2336  1.15  blymn 						cur->start_line--;
   2337  1.15  blymn 					}
   2338  1.15  blymn 				} else {
   2339  1.15  blymn 					cur->cursor_ypos--;
   2340  1.15  blymn 				}
   2341  1.15  blymn 			}
   2342  1.20  blymn 
   2343  1.20  blymn 			if (old_count > 1) {
   2344  1.23  blymn 				if (cur->cursor_xpos > cur->lines[row].length) {
   2345  1.20  blymn 					cur->cursor_xpos =
   2346  1.20  blymn 						cur->lines[row].length - 1;
   2347  1.23  blymn 					cur->row_xpos = cur->lines[row].end;
   2348  1.23  blymn 				}
   2349  1.23  blymn 
   2350  1.20  blymn 				if (row >= cur->rows)
   2351  1.20  blymn 					cur->start_line = row
   2352  1.20  blymn 						- cur->cursor_ypos;
   2353  1.20  blymn 				else {
   2354  1.20  blymn 					cur->start_line = 0;
   2355  1.20  blymn 					cur->cursor_ypos = row;
   2356  1.20  blymn 				}
   2357  1.20  blymn 			}
   2358  1.15  blymn 		}
   2359   1.1  blymn 		break;
   2360  1.23  blymn 
   2361   1.1  blymn 	case REQ_DEL_WORD:
   2362  1.23  blymn 		start = cur->start_char + cur->row_xpos
   2363  1.23  blymn 			+ cur->lines[row].start;
   2364  1.23  blymn 		str = cur->buffers[0].string;
   2365  1.23  blymn 
   2366  1.23  blymn 		end = find_eow(str, start);
   2367  1.23  blymn 
   2368  1.23  blymn 		  /*
   2369  1.23  blymn 		   * If not at the start of a word then find the start,
   2370  1.23  blymn 		   * we cannot blindly call find_sow because this will
   2371  1.23  blymn 		   * skip back a word if we are already at the start of
   2372  1.23  blymn 		   * a word.
   2373  1.23  blymn 		   */
   2374  1.23  blymn 		if ((start > 0)
   2375  1.23  blymn 		    && !(isblank(str[start - 1]) && !isblank(str[start])))
   2376  1.23  blymn 			start = find_sow(cur->buffers[0].string, start);
   2377  1.23  blymn 		bcopy(&cur->buffers[0].string[end],
   2378   1.1  blymn 		      &cur->buffers[0].string[start],
   2379   1.1  blymn 		      (unsigned) cur->buffers[0].length - end + 1);
   2380  1.15  blymn 		len = end - start;
   2381  1.15  blymn 		cur->buffers[0].length -= len;
   2382  1.20  blymn 		bump_lines(cur, _FORMI_USE_CURRENT, - (int) len, TRUE);
   2383  1.23  blymn 
   2384  1.23  blymn 		if ((cur->rows + cur->nrows) > 1) {
   2385  1.23  blymn 			row = cur->start_line + cur->cursor_ypos;
   2386  1.23  blymn 			if ((row + 1) < cur->row_count) {
   2387  1.23  blymn 				/*
   2388  1.23  blymn 				 * if not on the last row we need to
   2389  1.23  blymn 				 * join on the next row so the line
   2390  1.23  blymn 				 * will be re-wrapped.
   2391  1.23  blymn 				 */
   2392  1.23  blymn 				_formi_join_line(cur, cur->lines[row].end,
   2393  1.23  blymn 						 JOIN_NEXT_NW);
   2394  1.23  blymn 			}
   2395  1.23  blymn 			_formi_wrap_field(cur, start);
   2396  1.23  blymn 			row = find_cur_line(cur, start);
   2397  1.23  blymn 			cur->row_xpos = start - cur->lines[row].start;
   2398  1.23  blymn 			cur->cursor_xpos = _formi_tab_expanded_length(
   2399  1.23  blymn 				&cur->buffers[0].string[cur->lines[row].start],
   2400  1.23  blymn 				0, cur->row_xpos);
   2401  1.23  blymn 			if ((cur->cursor_xpos > 0)
   2402  1.23  blymn 			    && (start != (cur->buffers[0].length - 1)))
   2403  1.23  blymn 				cur->cursor_xpos--;
   2404  1.23  blymn 		} else {
   2405  1.23  blymn 			_formi_calculate_tabs(cur, 0);
   2406  1.23  blymn 			cur->row_xpos = start - cur->start_char;
   2407  1.23  blymn 			if (cur->row_xpos > 0)
   2408  1.23  blymn 				cur->row_xpos--;
   2409  1.28  blymn 			_formi_set_cursor_xpos(cur, FALSE);
   2410  1.23  blymn 		}
   2411   1.1  blymn 		break;
   2412   1.1  blymn 
   2413   1.1  blymn 	case REQ_CLR_EOL:
   2414  1.15  blymn 		row = cur->start_line + cur->cursor_ypos;
   2415   1.1  blymn 		start = cur->start_char + cur->cursor_xpos;
   2416  1.15  blymn 		end = cur->lines[row].end;
   2417  1.15  blymn 		len = end - start;
   2418  1.15  blymn 		bcopy(&cur->buffers[0].string[end + 1],
   2419  1.15  blymn 		      &cur->buffers[0].string[start],
   2420  1.15  blymn 		      cur->buffers[0].length - end + 1);
   2421  1.15  blymn 		cur->buffers[0].length -= len;
   2422  1.20  blymn 		bump_lines(cur, _FORMI_USE_CURRENT, - (int) len, TRUE);
   2423  1.15  blymn 
   2424  1.25  blymn 		if (cur->row_xpos > cur->lines[row].length) {
   2425  1.23  blymn 			cur->row_xpos = cur->lines[row].end;
   2426  1.25  blymn 			if (cur->rows + cur->nrows == 1)
   2427  1.28  blymn 				_formi_set_cursor_xpos(cur, FALSE);
   2428  1.25  blymn 			else
   2429  1.25  blymn 				cur->cursor_xpos = cur->lines[row].length;
   2430  1.23  blymn 		}
   2431   1.1  blymn 		break;
   2432   1.1  blymn 
   2433   1.1  blymn 	case REQ_CLR_EOF:
   2434  1.15  blymn 		row = cur->start_line + cur->cursor_ypos;
   2435  1.15  blymn 		cur->buffers[0].string[cur->start_char
   2436  1.15  blymn 				      + cur->cursor_xpos] = '\0';
   2437  1.15  blymn 		cur->buffers[0].length = strlen(cur->buffers[0].string);
   2438  1.15  blymn 		cur->lines[row].end = cur->buffers[0].length;
   2439  1.15  blymn 		cur->lines[row].length = cur->lines[row].end
   2440  1.15  blymn 			- cur->lines[row].start;
   2441   1.1  blymn 		break;
   2442   1.1  blymn 
   2443   1.1  blymn 	case REQ_CLR_FIELD:
   2444  1.15  blymn 		cur->buffers[0].string[0] = '\0';
   2445  1.15  blymn 		cur->buffers[0].length = 0;
   2446  1.15  blymn 		cur->row_count = 1;
   2447  1.15  blymn 		cur->start_line = 0;
   2448  1.15  blymn 		cur->cursor_ypos = 0;
   2449  1.23  blymn 		cur->row_xpos = 0;
   2450  1.25  blymn 		_formi_init_field_xpos(cur);
   2451  1.15  blymn 		cur->start_char = 0;
   2452  1.15  blymn 		cur->lines[0].start = 0;
   2453  1.15  blymn 		cur->lines[0].end = 0;
   2454  1.15  blymn 		cur->lines[0].length = 0;
   2455   1.1  blymn 		break;
   2456   1.1  blymn 
   2457   1.1  blymn 	case REQ_OVL_MODE:
   2458   1.1  blymn 		cur->overlay = 1;
   2459   1.1  blymn 		break;
   2460   1.1  blymn 
   2461   1.1  blymn 	case REQ_INS_MODE:
   2462   1.1  blymn 		cur->overlay = 0;
   2463   1.1  blymn 		break;
   2464   1.1  blymn 
   2465   1.1  blymn 	case REQ_SCR_FLINE:
   2466   1.1  blymn 		_formi_scroll_fwd(cur, 1);
   2467   1.1  blymn 		break;
   2468   1.1  blymn 
   2469   1.1  blymn 	case REQ_SCR_BLINE:
   2470   1.1  blymn 		_formi_scroll_back(cur, 1);
   2471   1.1  blymn 		break;
   2472   1.1  blymn 
   2473   1.1  blymn 	case REQ_SCR_FPAGE:
   2474   1.1  blymn 		_formi_scroll_fwd(cur, cur->rows);
   2475   1.1  blymn 		break;
   2476   1.1  blymn 
   2477   1.1  blymn 	case REQ_SCR_BPAGE:
   2478   1.1  blymn 		_formi_scroll_back(cur, cur->rows);
   2479   1.1  blymn 		break;
   2480   1.1  blymn 
   2481   1.1  blymn 	case REQ_SCR_FHPAGE:
   2482   1.1  blymn 		_formi_scroll_fwd(cur, cur->rows / 2);
   2483   1.1  blymn 		break;
   2484   1.1  blymn 
   2485   1.1  blymn 	case REQ_SCR_BHPAGE:
   2486   1.1  blymn 		_formi_scroll_back(cur, cur->rows / 2);
   2487   1.1  blymn 		break;
   2488   1.1  blymn 
   2489   1.1  blymn 	case REQ_SCR_FCHAR:
   2490   1.1  blymn 		_formi_hscroll_fwd(cur, 1);
   2491   1.1  blymn 		break;
   2492   1.1  blymn 
   2493   1.1  blymn 	case REQ_SCR_BCHAR:
   2494   1.1  blymn 		_formi_hscroll_back(cur, 1);
   2495   1.1  blymn 		break;
   2496   1.1  blymn 
   2497   1.1  blymn 	case REQ_SCR_HFLINE:
   2498   1.1  blymn 		_formi_hscroll_fwd(cur, cur->cols);
   2499   1.1  blymn 		break;
   2500   1.1  blymn 
   2501   1.1  blymn 	case REQ_SCR_HBLINE:
   2502   1.1  blymn 		_formi_hscroll_back(cur, cur->cols);
   2503   1.1  blymn 		break;
   2504   1.1  blymn 
   2505   1.1  blymn 	case REQ_SCR_HFHALF:
   2506   1.1  blymn 		_formi_hscroll_fwd(cur, cur->cols / 2);
   2507   1.1  blymn 		break;
   2508   1.1  blymn 
   2509   1.1  blymn 	case REQ_SCR_HBHALF:
   2510   1.1  blymn 		_formi_hscroll_back(cur, cur->cols / 2);
   2511   1.1  blymn 		break;
   2512   1.1  blymn 
   2513   1.1  blymn 	default:
   2514   1.1  blymn 		return 0;
   2515   1.1  blymn 	}
   2516   1.1  blymn 
   2517   1.1  blymn #ifdef DEBUG
   2518  1.23  blymn 	fprintf(dbg,
   2519  1.23  blymn 	 "exit: xpos=%d, row_pos=%d, start_char=%d, length=%d, allocated=%d\n",
   2520  1.23  blymn 		cur->cursor_xpos, cur->row_xpos, cur->start_char,
   2521  1.23  blymn 		cur->buffers[0].length,	cur->buffers[0].allocated);
   2522  1.18  blymn 	fprintf(dbg, "exit: start_line=%d, ypos=%d\n", cur->start_line,
   2523  1.18  blymn 		cur->cursor_ypos);
   2524   1.2  blymn 	fprintf(dbg, "exit: string=\"%s\"\n", cur->buffers[0].string);
   2525  1.23  blymn 	assert ((cur->cursor_xpos < INT_MAX) && (cur->row_xpos < INT_MAX)
   2526  1.23  blymn 		&& (cur->cursor_xpos >= cur->row_xpos));
   2527   1.1  blymn #endif
   2528   1.1  blymn 	return 1;
   2529   1.1  blymn }
   2530   1.1  blymn 
   2531   1.1  blymn /*
   2532   1.8  blymn  * Validate the give character by passing it to any type character
   2533   1.8  blymn  * checking routines, if they exist.
   2534   1.8  blymn  */
   2535   1.8  blymn int
   2536   1.8  blymn _formi_validate_char(FIELD *field, char c)
   2537   1.8  blymn {
   2538   1.8  blymn 	int ret_val;
   2539   1.8  blymn 
   2540   1.8  blymn 	if (field->type == NULL)
   2541   1.8  blymn 		return E_OK;
   2542   1.8  blymn 
   2543   1.8  blymn 	ret_val = E_INVALID_FIELD;
   2544   1.8  blymn 	_formi_do_char_validation(field, field->type, c, &ret_val);
   2545   1.8  blymn 
   2546   1.8  blymn 	return ret_val;
   2547   1.8  blymn }
   2548   1.8  blymn 
   2549   1.8  blymn 
   2550   1.8  blymn /*
   2551   1.8  blymn  * Perform the validation of the character, invoke all field_type validation
   2552   1.8  blymn  * routines.  If the field is ok then update ret_val to E_OK otherwise
   2553   1.8  blymn  * ret_val is not changed.
   2554   1.8  blymn  */
   2555   1.8  blymn static void
   2556   1.8  blymn _formi_do_char_validation(FIELD *field, FIELDTYPE *type, char c, int *ret_val)
   2557   1.8  blymn {
   2558   1.8  blymn 	if ((type->flags & _TYPE_IS_LINKED) == _TYPE_IS_LINKED) {
   2559   1.8  blymn 		_formi_do_char_validation(field, type->link->next, c, ret_val);
   2560   1.8  blymn 		_formi_do_char_validation(field, type->link->prev, c, ret_val);
   2561   1.8  blymn 	} else {
   2562   1.8  blymn 		if (type->char_check == NULL)
   2563   1.8  blymn 			*ret_val = E_OK;
   2564   1.8  blymn 		else {
   2565   1.8  blymn 			if (type->char_check((int)(unsigned char) c,
   2566   1.8  blymn 					     field->args) == TRUE)
   2567   1.8  blymn 				*ret_val = E_OK;
   2568   1.8  blymn 		}
   2569   1.8  blymn 	}
   2570   1.8  blymn }
   2571   1.8  blymn 
   2572   1.8  blymn /*
   2573   1.1  blymn  * Validate the current field.  If the field validation returns success then
   2574   1.1  blymn  * return E_OK otherwise return E_INVALID_FIELD.
   2575   1.1  blymn  *
   2576   1.1  blymn  */
   2577   1.1  blymn int
   2578   1.1  blymn _formi_validate_field(FORM *form)
   2579   1.1  blymn {
   2580   1.1  blymn 	FIELD *cur;
   2581   1.8  blymn 	char *bp;
   2582   1.8  blymn 	int ret_val, count;
   2583   1.1  blymn 
   2584   1.1  blymn 
   2585   1.1  blymn 	if ((form == NULL) || (form->fields == NULL) ||
   2586   1.1  blymn 	    (form->fields[0] == NULL))
   2587   1.1  blymn 		return E_INVALID_FIELD;
   2588   1.1  blymn 
   2589   1.1  blymn 	cur = form->fields[form->cur_field];
   2590   1.1  blymn 
   2591   1.8  blymn 	bp = cur->buffers[0].string;
   2592   1.8  blymn 	count = _formi_skip_blanks(bp, 0);
   2593   1.9  blymn 
   2594   1.9  blymn 	  /* check if we have a null field, depending on the nullok flag
   2595   1.9  blymn 	   * this may be acceptable or not....
   2596   1.9  blymn 	   */
   2597   1.9  blymn 	if (cur->buffers[0].string[count] == '\0') {
   2598   1.9  blymn 		if ((cur->opts & O_NULLOK) == O_NULLOK)
   2599   1.9  blymn 			return E_OK;
   2600   1.9  blymn 		else
   2601   1.9  blymn 			return E_INVALID_FIELD;
   2602   1.9  blymn 	}
   2603   1.1  blymn 
   2604  1.11  blymn 	  /* check if an unmodified field is ok */
   2605  1.11  blymn 	if (cur->buf0_status == 0) {
   2606  1.11  blymn 		if ((cur->opts & O_PASSOK) == O_PASSOK)
   2607  1.11  blymn 			return E_OK;
   2608  1.11  blymn 		else
   2609  1.11  blymn 			return E_INVALID_FIELD;
   2610  1.11  blymn 	}
   2611  1.11  blymn 
   2612   1.1  blymn 	  /* if there is no type then just accept the field */
   2613   1.1  blymn 	if (cur->type == NULL)
   2614   1.1  blymn 		return E_OK;
   2615   1.1  blymn 
   2616   1.1  blymn 	ret_val = E_INVALID_FIELD;
   2617   1.1  blymn 	_formi_do_validation(cur, cur->type, &ret_val);
   2618   1.1  blymn 
   2619   1.1  blymn 	return ret_val;
   2620   1.1  blymn }
   2621   1.1  blymn 
   2622   1.1  blymn /*
   2623   1.1  blymn  * Perform the validation of the field, invoke all field_type validation
   2624   1.1  blymn  * routines.  If the field is ok then update ret_val to E_OK otherwise
   2625   1.1  blymn  * ret_val is not changed.
   2626   1.1  blymn  */
   2627   1.1  blymn static void
   2628   1.1  blymn _formi_do_validation(FIELD *field, FIELDTYPE *type, int *ret_val)
   2629   1.1  blymn {
   2630   1.1  blymn 	if ((type->flags & _TYPE_IS_LINKED) == _TYPE_IS_LINKED) {
   2631   1.1  blymn 		_formi_do_validation(field, type->link->next, ret_val);
   2632   1.1  blymn 		_formi_do_validation(field, type->link->prev, ret_val);
   2633   1.1  blymn 	} else {
   2634   1.1  blymn 		if (type->field_check == NULL)
   2635   1.1  blymn 			*ret_val = E_OK;
   2636   1.1  blymn 		else {
   2637   1.1  blymn 			if (type->field_check(field, field_buffer(field, 0))
   2638   1.1  blymn 			    == TRUE)
   2639   1.1  blymn 				*ret_val = E_OK;
   2640   1.1  blymn 		}
   2641   1.1  blymn 	}
   2642   1.1  blymn }
   2643   1.1  blymn 
   2644   1.1  blymn /*
   2645   1.1  blymn  * Select the next/previous choice for the field, the driver command
   2646   1.1  blymn  * selecting the direction will be passed in c.  Return 1 if a choice
   2647   1.1  blymn  * selection succeeded, 0 otherwise.
   2648   1.1  blymn  */
   2649   1.1  blymn int
   2650   1.1  blymn _formi_field_choice(FORM *form, int c)
   2651   1.1  blymn {
   2652   1.1  blymn 	FIELDTYPE *type;
   2653   1.1  blymn 	FIELD *field;
   2654   1.1  blymn 
   2655   1.1  blymn 	if ((form == NULL) || (form->fields == NULL) ||
   2656   1.1  blymn 	    (form->fields[0] == NULL) ||
   2657   1.1  blymn 	    (form->fields[form->cur_field]->type == NULL))
   2658   1.1  blymn 		return 0;
   2659   1.1  blymn 
   2660   1.1  blymn 	field = form->fields[form->cur_field];
   2661   1.1  blymn 	type = field->type;
   2662   1.1  blymn 
   2663   1.1  blymn 	switch (c) {
   2664   1.1  blymn 	case REQ_NEXT_CHOICE:
   2665   1.1  blymn 		if (type->next_choice == NULL)
   2666   1.1  blymn 			return 0;
   2667   1.1  blymn 		else
   2668   1.1  blymn 			return type->next_choice(field,
   2669   1.1  blymn 						 field_buffer(field, 0));
   2670   1.1  blymn 
   2671   1.1  blymn 	case REQ_PREV_CHOICE:
   2672   1.1  blymn 		if (type->prev_choice == NULL)
   2673   1.1  blymn 			return 0;
   2674   1.1  blymn 		else
   2675   1.1  blymn 			return type->prev_choice(field,
   2676   1.1  blymn 						 field_buffer(field, 0));
   2677   1.1  blymn 
   2678   1.1  blymn 	default: /* should never happen! */
   2679   1.1  blymn 		return 0;
   2680   1.1  blymn 	}
   2681   1.1  blymn }
   2682   1.1  blymn 
   2683   1.1  blymn /*
   2684   1.1  blymn  * Update the fields if they have changed.  The parameter old has the
   2685   1.1  blymn  * previous current field as the current field may have been updated by
   2686   1.1  blymn  * the driver.  Return 1 if the form page needs updating.
   2687   1.1  blymn  *
   2688   1.1  blymn  */
   2689   1.1  blymn int
   2690   1.1  blymn _formi_update_field(FORM *form, int old_field)
   2691   1.1  blymn {
   2692   1.1  blymn 	int cur, i;
   2693   1.1  blymn 
   2694   1.1  blymn 	cur = form->cur_field;
   2695   1.1  blymn 
   2696   1.1  blymn 	if (old_field != cur) {
   2697   1.1  blymn 		if (!((cur >= form->page_starts[form->page].first) &&
   2698   1.1  blymn 		      (cur <= form->page_starts[form->page].last))) {
   2699   1.1  blymn 			  /* not on same page any more */
   2700   1.1  blymn 			for (i = 0; i < form->max_page; i++) {
   2701   1.1  blymn 				if ((form->page_starts[i].in_use == 1) &&
   2702   1.1  blymn 				    (form->page_starts[i].first <= cur) &&
   2703   1.1  blymn 				    (form->page_starts[i].last >= cur)) {
   2704   1.1  blymn 					form->page = i;
   2705   1.1  blymn 					return 1;
   2706   1.1  blymn 				}
   2707   1.1  blymn 			}
   2708   1.1  blymn 		}
   2709   1.1  blymn 	}
   2710   1.1  blymn 
   2711   1.1  blymn 	_formi_redraw_field(form, old_field);
   2712   1.1  blymn 	_formi_redraw_field(form, form->cur_field);
   2713   1.1  blymn 	return 0;
   2714   1.1  blymn }
   2715   1.1  blymn 
   2716   1.1  blymn /*
   2717   1.1  blymn  * Compare function for the field sorting
   2718   1.1  blymn  *
   2719   1.1  blymn  */
   2720   1.1  blymn static int
   2721   1.1  blymn field_sort_compare(const void *one, const void *two)
   2722   1.1  blymn {
   2723   1.1  blymn 	const FIELD *a, *b;
   2724   1.1  blymn 	int tl;
   2725   1.1  blymn 
   2726   1.3  blymn 	  /* LINTED const castaway; we don't modify these! */
   2727   1.1  blymn 	a = (const FIELD *) *((const FIELD **) one);
   2728   1.1  blymn 	b = (const FIELD *) *((const FIELD **) two);
   2729   1.1  blymn 
   2730   1.1  blymn 	if (a == NULL)
   2731   1.1  blymn 		return 1;
   2732   1.1  blymn 
   2733   1.1  blymn 	if (b == NULL)
   2734   1.1  blymn 		return -1;
   2735   1.1  blymn 
   2736   1.1  blymn 	  /*
   2737   1.1  blymn 	   * First check the page, we want the fields sorted by page.
   2738   1.1  blymn 	   *
   2739   1.1  blymn 	   */
   2740   1.1  blymn 	if (a->page != b->page)
   2741   1.1  blymn 		return ((a->page > b->page)? 1 : -1);
   2742   1.1  blymn 
   2743   1.1  blymn 	tl = _formi_top_left(a->parent, a->index, b->index);
   2744   1.1  blymn 
   2745   1.1  blymn 	  /*
   2746   1.1  blymn 	   * sort fields left to right, top to bottom so the top left is
   2747   1.1  blymn 	   * the less than value....
   2748   1.1  blymn 	   */
   2749   1.1  blymn 	return ((tl == a->index)? -1 : 1);
   2750   1.1  blymn }
   2751   1.1  blymn 
   2752   1.1  blymn /*
   2753   1.1  blymn  * Sort the fields in a form ready for driver traversal.
   2754   1.1  blymn  */
   2755   1.1  blymn void
   2756   1.1  blymn _formi_sort_fields(FORM *form)
   2757   1.1  blymn {
   2758   1.1  blymn 	FIELD **sort_area;
   2759   1.1  blymn 	int i;
   2760   1.1  blymn 
   2761   1.1  blymn 	CIRCLEQ_INIT(&form->sorted_fields);
   2762   1.1  blymn 
   2763   1.1  blymn 	if ((sort_area = (FIELD **) malloc(sizeof(FIELD *) * form->field_count))
   2764   1.1  blymn 	    == NULL)
   2765   1.1  blymn 		return;
   2766   1.1  blymn 
   2767   1.1  blymn 	bcopy(form->fields, sort_area, sizeof(FIELD *) * form->field_count);
   2768   1.1  blymn 	qsort(sort_area, (unsigned) form->field_count, sizeof(FIELD *),
   2769   1.1  blymn 	      field_sort_compare);
   2770   1.1  blymn 
   2771   1.1  blymn 	for (i = 0; i < form->field_count; i++)
   2772   1.1  blymn 		CIRCLEQ_INSERT_TAIL(&form->sorted_fields, sort_area[i], glue);
   2773   1.1  blymn 
   2774   1.1  blymn 	free(sort_area);
   2775   1.1  blymn }
   2776   1.1  blymn 
   2777   1.1  blymn /*
   2778   1.1  blymn  * Set the neighbours for all the fields in the given form.
   2779   1.1  blymn  */
   2780   1.1  blymn void
   2781   1.1  blymn _formi_stitch_fields(FORM *form)
   2782   1.1  blymn {
   2783   1.1  blymn 	int above_row, below_row, end_above, end_below, cur_row, real_end;
   2784   1.1  blymn 	FIELD *cur, *above, *below;
   2785   1.1  blymn 
   2786   1.1  blymn 	  /*
   2787   1.1  blymn 	   * check if the sorted fields circle queue is empty, just
   2788   1.1  blymn 	   * return if it is.
   2789   1.1  blymn 	   */
   2790   1.1  blymn 	if (CIRCLEQ_EMPTY(&form->sorted_fields))
   2791   1.1  blymn 		return;
   2792   1.1  blymn 
   2793   1.1  blymn 	  /* initially nothing is above..... */
   2794   1.1  blymn 	above_row = -1;
   2795   1.1  blymn 	end_above = TRUE;
   2796   1.1  blymn 	above = NULL;
   2797   1.1  blymn 
   2798   1.1  blymn 	  /* set up the first field as the current... */
   2799   1.1  blymn 	cur = CIRCLEQ_FIRST(&form->sorted_fields);
   2800   1.1  blymn 	cur_row = cur->form_row;
   2801   1.1  blymn 
   2802   1.1  blymn 	  /* find the first field on the next row if any */
   2803   1.1  blymn 	below = CIRCLEQ_NEXT(cur, glue);
   2804   1.1  blymn 	below_row = -1;
   2805   1.1  blymn 	end_below = TRUE;
   2806   1.1  blymn 	real_end = TRUE;
   2807   1.2  blymn 	while (below != (void *)&form->sorted_fields) {
   2808   1.1  blymn 		if (below->form_row != cur_row) {
   2809   1.1  blymn 			below_row = below->form_row;
   2810   1.1  blymn 			end_below = FALSE;
   2811   1.1  blymn 			real_end = FALSE;
   2812   1.1  blymn 			break;
   2813   1.1  blymn 		}
   2814   1.1  blymn 		below = CIRCLEQ_NEXT(below, glue);
   2815   1.1  blymn 	}
   2816   1.1  blymn 
   2817   1.1  blymn 	  /* walk the sorted fields, setting the neighbour pointers */
   2818   1.1  blymn 	while (cur != (void *) &form->sorted_fields) {
   2819   1.1  blymn 		if (cur == CIRCLEQ_FIRST(&form->sorted_fields))
   2820   1.1  blymn 			cur->left = NULL;
   2821   1.1  blymn 		else
   2822   1.1  blymn 			cur->left = CIRCLEQ_PREV(cur, glue);
   2823   1.1  blymn 
   2824   1.1  blymn 		if (cur == CIRCLEQ_LAST(&form->sorted_fields))
   2825   1.1  blymn 			cur->right = NULL;
   2826   1.1  blymn 		else
   2827   1.1  blymn 			cur->right = CIRCLEQ_NEXT(cur, glue);
   2828   1.1  blymn 
   2829   1.1  blymn 		if (end_above == TRUE)
   2830   1.1  blymn 			cur->up = NULL;
   2831   1.1  blymn 		else {
   2832   1.1  blymn 			cur->up = above;
   2833   1.1  blymn 			above = CIRCLEQ_NEXT(above, glue);
   2834   1.1  blymn 			if (above_row != above->form_row) {
   2835   1.1  blymn 				end_above = TRUE;
   2836   1.1  blymn 				above_row = above->form_row;
   2837   1.1  blymn 			}
   2838   1.1  blymn 		}
   2839   1.1  blymn 
   2840   1.1  blymn 		if (end_below == TRUE)
   2841   1.1  blymn 			cur->down = NULL;
   2842   1.1  blymn 		else {
   2843   1.1  blymn 			cur->down = below;
   2844   1.1  blymn 			below = CIRCLEQ_NEXT(below, glue);
   2845   1.1  blymn 			if (below == (void *) &form->sorted_fields) {
   2846   1.1  blymn 				end_below = TRUE;
   2847   1.1  blymn 				real_end = TRUE;
   2848   1.1  blymn 			} else if (below_row != below->form_row) {
   2849   1.1  blymn 				end_below = TRUE;
   2850   1.1  blymn 				below_row = below->form_row;
   2851   1.1  blymn 			}
   2852   1.1  blymn 		}
   2853   1.1  blymn 
   2854   1.1  blymn 		cur = CIRCLEQ_NEXT(cur, glue);
   2855   1.1  blymn 		if ((cur != (void *) &form->sorted_fields)
   2856   1.1  blymn 		    && (cur_row != cur->form_row)) {
   2857   1.1  blymn 			cur_row = cur->form_row;
   2858   1.1  blymn 			if (end_above == FALSE) {
   2859   1.1  blymn 				for (; above != CIRCLEQ_FIRST(&form->sorted_fields);
   2860   1.1  blymn 				     above = CIRCLEQ_NEXT(above, glue)) {
   2861   1.1  blymn 					if (above->form_row != above_row) {
   2862   1.1  blymn 						above_row = above->form_row;
   2863   1.1  blymn 						break;
   2864   1.1  blymn 					}
   2865   1.1  blymn 				}
   2866   1.1  blymn 			} else if (above == NULL) {
   2867   1.1  blymn 				above = CIRCLEQ_FIRST(&form->sorted_fields);
   2868   1.1  blymn 				end_above = FALSE;
   2869   1.1  blymn 				above_row = above->form_row;
   2870   1.1  blymn 			} else
   2871   1.1  blymn 				end_above = FALSE;
   2872   1.1  blymn 
   2873   1.1  blymn 			if (end_below == FALSE) {
   2874   1.1  blymn 				while (below_row == below->form_row) {
   2875   1.1  blymn 					below = CIRCLEQ_NEXT(below,
   2876   1.1  blymn 							     glue);
   2877   1.1  blymn 					if (below ==
   2878   1.1  blymn 					    (void *)&form->sorted_fields) {
   2879   1.1  blymn 						real_end = TRUE;
   2880   1.1  blymn 						end_below = TRUE;
   2881   1.1  blymn 						break;
   2882   1.1  blymn 					}
   2883   1.1  blymn 				}
   2884   1.1  blymn 
   2885   1.1  blymn 				if (below != (void *)&form->sorted_fields)
   2886   1.1  blymn 					below_row = below->form_row;
   2887   1.1  blymn 			} else if (real_end == FALSE)
   2888   1.1  blymn 				end_below = FALSE;
   2889   1.1  blymn 
   2890   1.1  blymn 		}
   2891   1.1  blymn 	}
   2892  1.23  blymn }
   2893  1.23  blymn 
   2894  1.23  blymn /*
   2895  1.23  blymn  * Calculate the length of the displayed line allowing for any tab
   2896  1.23  blymn  * characters that need to be expanded.  We assume that the tab stops
   2897  1.23  blymn  * are 8 characters apart.  The parameters start and end are the
   2898  1.23  blymn  * character positions in the string str we want to get the length of,
   2899  1.23  blymn  * the function returns the number of characters from the start
   2900  1.23  blymn  * position to the end position that should be displayed after any
   2901  1.23  blymn  * intervening tabs have been expanded.
   2902  1.23  blymn  */
   2903  1.23  blymn int
   2904  1.23  blymn _formi_tab_expanded_length(char *str, unsigned int start, unsigned int end)
   2905  1.23  blymn {
   2906  1.23  blymn 	int len, start_len, i;
   2907  1.23  blymn 
   2908  1.23  blymn 	  /* if we have a null string then there is no length */
   2909  1.23  blymn 	if (str[0] == '\0')
   2910  1.23  blymn 		return 0;
   2911  1.23  blymn 
   2912  1.23  blymn 	len = 0;
   2913  1.23  blymn 	start_len = 0;
   2914  1.23  blymn 
   2915  1.23  blymn 	  /*
   2916  1.23  blymn 	   * preceding tabs affect the length tabs in the span, so
   2917  1.23  blymn 	   * we need to calculate the length including the stuff before
   2918  1.23  blymn 	   * start and then subtract off the unwanted bit.
   2919  1.23  blymn 	   */
   2920  1.23  blymn 	for (i = 0; i <= end; i++) {
   2921  1.23  blymn 		if (i == start) /* stash preamble length for later */
   2922  1.23  blymn 			start_len = len;
   2923  1.23  blymn 
   2924  1.23  blymn 		if (str[i] == '\0')
   2925  1.23  blymn 			break;
   2926  1.23  blymn 
   2927  1.23  blymn 		if (str[i] == '\t')
   2928  1.23  blymn 			len = len - (len % 8) + 8;
   2929  1.23  blymn 		else
   2930  1.23  blymn 			len++;
   2931  1.23  blymn 	}
   2932  1.23  blymn 
   2933  1.23  blymn #ifdef DEBUG
   2934  1.23  blymn 	if (dbg != NULL) {
   2935  1.23  blymn 		fprintf(dbg,
   2936  1.23  blymn 		    "tab_expanded: start=%d, end=%d, expanded=%d (diff=%d)\n",
   2937  1.23  blymn 			start, end, (len - start_len), (end - start));
   2938  1.23  blymn 	}
   2939  1.23  blymn #endif
   2940  1.23  blymn 
   2941  1.23  blymn 	return (len - start_len);
   2942  1.23  blymn }
   2943  1.23  blymn 
   2944  1.23  blymn /*
   2945  1.23  blymn  * Calculate the tab stops on a given line in the field and set up
   2946  1.23  blymn  * the tabs list with the results.  We do this by scanning the line for tab
   2947  1.23  blymn  * characters and if one is found, noting the position and the number of
   2948  1.23  blymn  * characters to get to the next tab stop.  This information is kept to
   2949  1.23  blymn  * make manipulating the field (scrolling and so on) easier to handle.
   2950  1.23  blymn  */
   2951  1.23  blymn void
   2952  1.23  blymn _formi_calculate_tabs(FIELD *field, unsigned row)
   2953  1.23  blymn {
   2954  1.23  blymn 	_formi_tab_t *ts = field->lines[row].tabs, *old_ts = NULL, **tsp;
   2955  1.23  blymn 	int i, j;
   2956  1.23  blymn 
   2957  1.23  blymn 	  /*
   2958  1.23  blymn 	   * If the line already has tabs then invalidate them by
   2959  1.23  blymn 	   * walking the list and killing the in_use flag.
   2960  1.23  blymn 	   */
   2961  1.23  blymn 	for (; ts != NULL; ts = ts->fwd)
   2962  1.23  blymn 		ts->in_use = FALSE;
   2963  1.23  blymn 
   2964  1.23  blymn 
   2965  1.23  blymn 	  /*
   2966  1.23  blymn 	   * Now look for tabs in the row and record the info...
   2967  1.23  blymn 	   */
   2968  1.23  blymn 	tsp = &field->lines[row].tabs;
   2969  1.23  blymn 	for (i = field->lines[row].start, j = 0; i <= field->lines[row].end;
   2970  1.23  blymn 	     i++, j++) {
   2971  1.23  blymn 		if (field->buffers[0].string[i] == '\t') {
   2972  1.23  blymn 			if (*tsp == NULL) {
   2973  1.23  blymn 				if ((*tsp = (_formi_tab_t *)
   2974  1.23  blymn 				     malloc(sizeof(_formi_tab_t))) == NULL)
   2975  1.23  blymn 					return;
   2976  1.23  blymn 				(*tsp)->back = old_ts;
   2977  1.23  blymn 				(*tsp)->fwd = NULL;
   2978  1.23  blymn 			}
   2979  1.23  blymn 
   2980  1.23  blymn 			(*tsp)->in_use = TRUE;
   2981  1.23  blymn 			(*tsp)->pos = i - field->lines[row].start;
   2982  1.23  blymn 			(*tsp)->size = 8 - (j % 8);
   2983  1.23  blymn 			j += (*tsp)->size - 1;
   2984  1.23  blymn 			old_ts = *tsp;
   2985  1.23  blymn 			tsp = &(*tsp)->fwd;
   2986  1.23  blymn 		}
   2987  1.23  blymn 	}
   2988  1.23  blymn }
   2989  1.23  blymn 
   2990  1.23  blymn /*
   2991  1.23  blymn  * Return the size of the tab padding for a tab character at the given
   2992  1.23  blymn  * position.  Return 1 if there is not a tab char entry matching the
   2993  1.23  blymn  * given location.
   2994  1.23  blymn  */
   2995  1.23  blymn static int
   2996  1.23  blymn tab_size(FIELD *field, unsigned int offset, unsigned int i)
   2997  1.23  blymn {
   2998  1.23  blymn 	int row;
   2999  1.23  blymn 	_formi_tab_t *ts;
   3000  1.23  blymn 
   3001  1.23  blymn 	row = find_cur_line(field, offset + i);
   3002  1.23  blymn 	ts = field->lines[row].tabs;
   3003  1.23  blymn 
   3004  1.23  blymn 	while ((ts != NULL) && (ts->pos != i))
   3005  1.23  blymn 		ts = ts->fwd;
   3006  1.23  blymn 
   3007  1.23  blymn 	if (ts == NULL)
   3008  1.23  blymn 		return 1;
   3009  1.23  blymn 	else
   3010  1.23  blymn 		return ts->size;
   3011  1.23  blymn }
   3012  1.23  blymn 
   3013  1.23  blymn /*
   3014  1.23  blymn  * Find the character offset that corresponds to longest tab expanded
   3015  1.23  blymn  * string that will fit into the given window.  Walk the string backwards
   3016  1.23  blymn  * evaluating the sizes of any tabs that are in the string.  Note that
   3017  1.23  blymn  * using this function on a multi-line window will produce undefined
   3018  1.23  blymn  * results - it is really only required for a single row field.
   3019  1.23  blymn  */
   3020  1.23  blymn static int
   3021  1.23  blymn tab_fit_window(FIELD *field, unsigned int pos, unsigned int window)
   3022  1.23  blymn {
   3023  1.23  blymn 	int scroll_amt, i;
   3024  1.23  blymn 	_formi_tab_t *ts;
   3025  1.23  blymn 
   3026  1.23  blymn 	  /* first find the last tab */
   3027  1.23  blymn 	ts = field->lines[0].tabs;
   3028  1.23  blymn 
   3029  1.23  blymn 	  /*
   3030  1.23  blymn 	   * unless there are no tabs - just return the window size,
   3031  1.23  blymn 	   * if there is enough room, otherwise 0.
   3032  1.23  blymn 	   */
   3033  1.23  blymn 	if (ts == NULL) {
   3034  1.23  blymn 		if (field->buffers[0].length < window)
   3035  1.23  blymn 			return 0;
   3036  1.23  blymn 		else
   3037  1.23  blymn 			return field->buffers[0].length - window + 1;
   3038  1.23  blymn 	}
   3039  1.23  blymn 
   3040  1.23  blymn 	while ((ts->fwd != NULL) && (ts->fwd->in_use == TRUE))
   3041  1.23  blymn 		ts = ts->fwd;
   3042  1.23  blymn 
   3043  1.23  blymn 	  /*
   3044  1.23  blymn 	   * now walk backwards finding the first tab that is to the
   3045  1.23  blymn 	   * left of our starting pos.
   3046  1.23  blymn 	   */
   3047  1.23  blymn 	while ((ts != NULL) && (ts->in_use == TRUE) && (ts->pos > pos))
   3048  1.23  blymn 		ts = ts->back;
   3049  1.23  blymn 
   3050  1.23  blymn 	scroll_amt = 0;
   3051  1.23  blymn 	for (i = pos; i >= 0; i--) {
   3052  1.23  blymn 		if (field->buffers[0].string[i] == '\t') {
   3053  1.23  blymn #ifdef DEBUG
   3054  1.23  blymn 			assert((ts != NULL) && (ts->in_use == TRUE));
   3055  1.23  blymn #endif
   3056  1.23  blymn 			if (ts->pos == i) {
   3057  1.23  blymn 				if ((scroll_amt + ts->size) > window) {
   3058  1.23  blymn 					break;
   3059  1.23  blymn 				}
   3060  1.23  blymn 				scroll_amt += ts->size;
   3061  1.23  blymn 				ts = ts->back;
   3062  1.23  blymn 			}
   3063  1.23  blymn #ifdef DEBUG
   3064  1.23  blymn 			else
   3065  1.23  blymn 				assert(ts->pos == i);
   3066  1.23  blymn #endif
   3067  1.23  blymn 		} else {
   3068  1.23  blymn 			scroll_amt++;
   3069  1.23  blymn 			if (scroll_amt > window)
   3070  1.23  blymn 				break;
   3071  1.23  blymn 		}
   3072  1.23  blymn 	}
   3073  1.23  blymn 
   3074  1.23  blymn 	return ++i;
   3075  1.23  blymn }
   3076  1.23  blymn 
   3077  1.23  blymn /*
   3078  1.23  blymn  * Return the position of the last character that will fit into the
   3079  1.23  blymn  * given width after tabs have been expanded for a given row of a given
   3080  1.23  blymn  * field.
   3081  1.23  blymn  */
   3082  1.23  blymn static unsigned int
   3083  1.23  blymn tab_fit_len(FIELD *field, unsigned int row, unsigned int width)
   3084  1.23  blymn {
   3085  1.23  blymn 	unsigned int pos, len, row_pos;
   3086  1.23  blymn 	_formi_tab_t *ts;
   3087  1.23  blymn 
   3088  1.23  blymn 	ts = field->lines[row].tabs;
   3089  1.23  blymn 	pos = field->lines[row].start;
   3090  1.23  blymn 	len = 0;
   3091  1.23  blymn 	row_pos = 0;
   3092  1.23  blymn 
   3093  1.23  blymn 	while ((len < width) && (pos < field->buffers[0].length)) {
   3094  1.23  blymn 		if (field->buffers[0].string[pos] == '\t') {
   3095  1.23  blymn #ifdef DEBUG
   3096  1.23  blymn 			assert((ts != NULL) && (ts->in_use == TRUE));
   3097  1.23  blymn #endif
   3098  1.23  blymn 			if (ts->pos == row_pos) {
   3099  1.23  blymn 				if ((len + ts->size) > width)
   3100  1.23  blymn 					break;
   3101  1.23  blymn 				len += ts->size;
   3102  1.23  blymn 				ts = ts->fwd;
   3103  1.23  blymn 			}
   3104  1.23  blymn #ifdef DEBUG
   3105  1.23  blymn 			else
   3106  1.23  blymn 				assert(ts->pos == row_pos);
   3107  1.23  blymn #endif
   3108  1.23  blymn 		} else
   3109  1.23  blymn 			len++;
   3110  1.23  blymn 		pos++;
   3111  1.23  blymn 		row_pos++;
   3112  1.23  blymn 	}
   3113  1.23  blymn 
   3114  1.23  blymn 	if (pos > 0)
   3115  1.23  blymn 		pos--;
   3116  1.23  blymn 	return pos;
   3117   1.1  blymn }
   3118