1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
/* global.c: global command routines for the ed line editor */
/* GNU ed - The GNU line editor.
Copyright (C) 1993, 1994 Andrew L. Moore, Talke Studio
Copyright (C) 2006-2026 Antonio Diaz Diaz.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <errno.h>
#include <limits.h>
#include <stdlib.h>
#include "ed.h"
/* list of lines active in a global command */
static const line_node **active_list = 0;
static int active_size = 0; /* size (in bytes) of active_list */
static int active_len = 0; /* number of lines in active_list */
static int active_idx = 0; /* active_list index ( non-decreasing ) */
static int active_idxm = 0; /* active_list index ( modulo active_len ) */
/* clear the global-active list */
void clear_active_list( void )
{
disable_interrupts();
if( active_list ) free( active_list );
active_list = 0;
active_size = active_len = active_idx = active_idxm = 0;
enable_interrupts();
}
/* return the next global-active line node */
const line_node * next_active_node( void )
{
while( active_idx < active_len && !active_list[active_idx] )
++active_idx;
return ( active_idx < active_len ) ? active_list[active_idx++] : 0;
}
/* add a line node to the global-active list */
bool set_active_node( const line_node * const lp )
{
const unsigned min_size = ( active_len + 1 ) * sizeof (line_node **);
if( (unsigned)active_size < min_size )
{
if( min_size >= INT_MAX )
{ set_error_msg( "Too many matching lines" ); return false; }
const int new_size = ( ( min_size < 512 ) ? 512 :
( min_size >= INT_MAX / 2 ) ? INT_MAX - 1 : ( min_size / 512 ) * 1024 );
void * new_buf = 0;
disable_interrupts();
if( active_list ) new_buf = realloc( active_list, new_size );
else new_buf = malloc( new_size );
if( !new_buf )
{ show_strerror( 0, errno );
set_error_msg( mem_msg ); enable_interrupts(); return false; }
active_size = new_size;
active_list = (const line_node **)new_buf;
enable_interrupts();
}
active_list[active_len++] = lp;
return true;
}
/* remove a range of lines from the global-active list */
void unset_active_nodes( const line_node * bp, const line_node * const ep )
{
while( bp != ep )
{
int i;
for( i = 0; i < active_len; ++i )
{
if( ++active_idxm >= active_len ) active_idxm = 0;
if( active_list[active_idxm] == bp )
{ active_list[active_idxm] = 0; break; }
}
bp = bp->q_forw;
}
}
|
