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