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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
/*
* Turbo Vision - Version 2.0
*
* Copyright (c) 1994 by Borland International
* All Rights Reserved.
*
Modified by Robert H”hne to be used for RHIDE.
Modified by Salvador E. Tropea.
*
*
*/
#define Uses_string
#include <tv.h>
#include <stdlib.h>
// Avoid replacing new by MSS's macro
#include <tv/no_mss.h>
// SET: MSVC 7.1 is even more stupid than previous versions and we must
// disable this misleading warning.
#ifdef TVComp_MSC
#pragma warning( disable : 4291 )
#endif
class HistRec
{
public:
HistRec( uchar nId, const char *nStr );
void *operator new( size_t );
void *operator new( size_t, HistRec * );
// SET: This class can't be "deleted", is just some kind of "cast" to
// interpret a buffer as a list of elements, some kind of "heap helper".
// MSVC compiler worries about the fact that it oveloads new but
// doesn't overload delete. So we just make clear that delete isn't
// valid.
void operator delete( void * ) { abort(); };
uchar id;
uchar len;
char str[1];
};
void *HistRec::operator new( size_t, HistRec *hr )
{
return hr;
}
void NEVER_RETURNS *HistRec::operator new( size_t )
{
abort();
RETURN_WHEN_NEVER_RETURNS;
}
inline HistRec::HistRec( uchar nId, const char *nStr ) :
id( nId ),
len( strlen( nStr ) + 3 )
{
strcpy( str, nStr );
}
inline HistRec *advance( HistRec *ptr, size_t s )
{
return (HistRec *)((char *)ptr + s);
}
inline HistRec *backup( HistRec *ptr, size_t s )
{
return (HistRec *)((char *)ptr - s);
}
inline HistRec *next( HistRec *ptr )
{
return ::advance( ptr, ptr->len );
}
inline HistRec *prev( HistRec *ptr )
{
return backup( ptr, ptr->len );
}
ushort historySize = 4000; // initial size of history block
static uchar curId;
static HistRec *curRec;
static HistRec *historyBlock;
static HistRec *lastRec;
void advanceStringPointer()
{
curRec = next( curRec );
while( curRec < lastRec && curRec->id != curId )
curRec = next( curRec );
if( curRec >= lastRec )
curRec = 0;
}
void deleteString()
{
size_t len = curRec->len;
// BUG FIX - EFW - Mon 10/30/95
// This insures that if n = lastRec, no bytes are copied and
// a GPF is prevented.
HistRec *n = next(curRec);
CLY_memcpy(curRec, n, size_t((char *)lastRec - (char *)n));
lastRec = backup( lastRec, len );
}
void insertString( uchar id, const char *str )
{
ushort len = strlen( str ) + 3;
while( len > historySize - ( (char *)lastRec - (char *)historyBlock ) )
{
ushort firstLen = historyBlock->len;
HistRec *dst = historyBlock;
HistRec *src = next( historyBlock );
memmove( dst, src, size_t( (char *)lastRec - (char *)src ) );
lastRec = backup( lastRec, firstLen );
}
new( lastRec ) HistRec( id, str );
lastRec = next( lastRec );
}
void startId( uchar id )
{
curId = id;
curRec = historyBlock;
}
ushort historyCount( uchar id )
{
startId( id );
ushort count = 0;
advanceStringPointer();
while( curRec != 0 )
{
count++;
advanceStringPointer();
}
return count;
}
void historyAdd( uchar id, const char *str )
{
if( str[0] == EOS )
return;
startId( id );
advanceStringPointer();
while( curRec != 0 )
{
if( strcmp( str, curRec->str ) == 0 )
deleteString();
advanceStringPointer();
}
insertString( id, str );
}
const char *historyStr( uchar id, int index )
{
#if 0
startId( id );
for( short i = 0; i <= index; i++ )
advanceStringPointer();
if( curRec != 0 )
return curRec->str;
else
return 0;
#else // To get the history in reverse order
int count = historyCount(id);
startId( id );
int _index = (count - index) - 1;
for (int i=0;i<=_index;i++)
advanceStringPointer();
if( curRec != 0 )
return curRec->str;
else
return 0;
#endif
}
void clearHistory()
{
new (historyBlock) HistRec( 0, "" );
lastRec = next( historyBlock );
}
#include <tv/yes_mss.h>
void initHistory()
{
historyBlock = (HistRec *) new char[historySize];
clearHistory();
}
void doneHistory()
{
delete[] historyBlock;
}
|
