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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
|
/* Classic Ladder Project */
/* Copyright (C) 2001 Marc Le Douarain */
/* mavati@club-internet.fr */
/* http://www.multimania.com/mavati/classicladder */
/* August 2002 */
/* ---------------------------- */
/* Sections fonctions utilities */
/* ---------------------------- */
/* This library is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU Lesser General Public */
/* License as published by the Free Software Foundation; either */
/* version 2.1 of the License, or (at your option) any later version. */
/* This library 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 */
/* Lesser General Public License for more details. */
/* You should have received a copy of the GNU Lesser General Public */
/* License along with this library; if not, write to the Free Software */
/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#ifdef HAL_SUPPORT
#include "rtapi.h"
#include "rtapi_string.h"
#else
#include <string.h>
#endif
#include "classicladder.h"
#include "global.h"
#include "edit.h"
#include "manager.h"
void InitSections( void )
{
StrSection * pSection;
int NumSec;
for ( NumSec=0; NumSec<NBR_SECTIONS; NumSec++ )
{
pSection = &SectionArray[ NumSec ];
pSection->Used = FALSE;
strcpy( pSection->Name, "" );
pSection->Language = SECTION_IN_LADDER;
pSection->SubRoutineNumber = -1;
pSection->FirstRung = 0;
pSection->LastRung = 0;
pSection->SequentialPage = 0;
}
// we directly create one section in ladder...
// at least for compatibility with our old progs !
pSection = &SectionArray[ 0 ];
pSection->Used = TRUE;
strcpy( pSection->Name, "Prog1" );
pSection->Language = SECTION_IN_LADDER;
pSection->SubRoutineNumber = -1;
pSection->FirstRung = 0;
pSection->LastRung = 0;
pSection->SequentialPage = 0;
}
int SearchSubRoutineWithItsNumber( int SubRoutineNbrToFind )
{
StrSection * pSection;
int NumSec;
int Found = FALSE;
NumSec = 0;
do
{
pSection = &SectionArray[ NumSec ];
if ( pSection->Used )
{
if ( pSection->SubRoutineNumber==SubRoutineNbrToFind )
Found = TRUE;
else
NumSec++;
}
else
{
NumSec++;
}
}
while( NumSec<NBR_SECTIONS && !Found );
if ( Found )
return NumSec;
else
return -1;
}
/* All the following stuff is not used for real-time working and embedded version... */
#if !defined( __RTL__ ) && defined( GTK_INTERFACE )
int SearchSectionWithName( char * SectionNameToFind )
{
StrSection * pSection;
int NumSec;
int Found = FALSE;
NumSec = 0;
do
{
pSection = &SectionArray[ NumSec ];
if ( pSection->Used )
{
if ( strcmp( pSection->Name, SectionNameToFind )==0 )
Found = TRUE;
else
NumSec++;
}
else
{
NumSec++;
}
}
while( NumSec<NBR_SECTIONS && !Found );
if ( Found )
return NumSec;
else
return -1;
}
void SectionSelected( char * SectionName )
{
StrSection * pSection;
int NumSec = SearchSectionWithName( SectionName );
if ( NumSec>=0 )
{
pSection = &SectionArray[ NumSec ];
InfosGene->FirstRung = pSection->FirstRung;
InfosGene->LastRung = pSection->LastRung;
InfosGene->CurrentRung = InfosGene->FirstRung;
InfosGene->CurrentSection = NumSec;
}
}
int AddSection( char * NewSectionName, int TypeLanguageSection, int SubRoutineNbr )
{
StrSection * pSection;
int NumSec;
int FreeFound = FALSE;
// Search a free available section
NumSec = 0;
do
{
pSection = &SectionArray[ NumSec ];
if ( !pSection->Used )
FreeFound = TRUE;
else
NumSec++;
}
while( NumSec<NBR_SECTIONS && !FreeFound );
if ( FreeFound )
{
int NumFreeRung;
strcpy( pSection->Name, NewSectionName );
pSection->Language = TypeLanguageSection;
pSection->FirstRung = 0;
pSection->LastRung = 0;
pSection->SequentialPage = 0;
if ( TypeLanguageSection==SECTION_IN_LADDER )
{
pSection->SubRoutineNumber = SubRoutineNbr;
NumFreeRung = FindFreeRung( );
if ( NumFreeRung>=0 )
{
pSection->Used = TRUE;
pSection->FirstRung = NumFreeRung;
pSection->LastRung = NumFreeRung;
InitBufferRungEdited( &RungArray[ NumFreeRung ] );
}
else
{
FreeFound = FALSE;
}
}
#ifdef SEQUENTIAL_SUPPORT
if ( TypeLanguageSection==SECTION_IN_SEQUENTIAL )
{
int NumFreePage;
NumFreePage = FindFreeSequentialPage( );
if ( NumFreePage>=0 )
{
pSection->Used = TRUE;
pSection->SequentialPage = NumFreePage;
}
else
{
FreeFound = FALSE;
}
}
#endif
}
return FreeFound;
}
int NbrSectionsDefined( void )
{
StrSection * pSection;
int NumSec;
int NbrSectionsDefined = 0;
for ( NumSec=0; NumSec<NBR_SECTIONS; NumSec++ )
{
pSection = &SectionArray[ NumSec ];
if ( pSection->Used )
NbrSectionsDefined++;
}
return NbrSectionsDefined;
}
int VerifyIfSectionNameAlreadyExist( char * Name )
{
int NumSec;
if ( Name[0]=='\0' )
return TRUE;
NumSec = SearchSectionWithName( Name );
return( NumSec>=0?TRUE:FALSE );
}
int VerifyIfSubRoutineNumberExist( int SubRoutineNbr )
{
int NumSec;
NumSec = SearchSubRoutineWithItsNumber( SubRoutineNbr );
return( NumSec>=0?TRUE:FALSE );
}
void DelSection( char * SectionNameToErase )
{
StrSection * pSection;
int NumSec;
NumSec = SearchSectionWithName( SectionNameToErase );
if ( NumSec>=0 )
{
pSection = &SectionArray[ NumSec ];
pSection->Used = FALSE;
// free the rungs used in this section
if ( pSection->Language==SECTION_IN_LADDER )
{
int ScanRung = InfosGene->FirstRung;
while ( ScanRung!=InfosGene->LastRung )
{
RungArray[ ScanRung ].Used = FALSE;
ScanRung = RungArray[ ScanRung ].NextRung;
}
RungArray[ InfosGene->LastRung ].Used = FALSE;
}
}
}
void SwapSections( char * SectionName1, char * SectionName2 )
{
StrSection * pSection1;
StrSection * pSection2;
StrSection SectionTemp;
StrSection * pSectionTemp = &SectionTemp;
int NumSec1;
int NumSec2;
NumSec1 = SearchSectionWithName( SectionName1 );
NumSec2 = SearchSectionWithName( SectionName2 );
if ( NumSec1>=0 && NumSec2>=0 )
{
pSection1 = &SectionArray[ NumSec1 ];
pSection2 = &SectionArray[ NumSec2 ];
memcpy( pSectionTemp, pSection1, sizeof(StrSection) );
memcpy( pSection1, pSection2, sizeof(StrSection) );
memcpy( pSection2, pSectionTemp, sizeof(StrSection) );
}
}
#ifdef SEQUENTIAL_SUPPORT
int FindFreeSequentialPage( void )
{
int FreePage = -1;
// to mark the pages used
char PageUsed[ NBR_SEQUENTIAL_PAGES ];
int ScanPage;
int ScanSection;
StrSection * pSection;
for ( ScanPage=0; ScanPage<NBR_SEQUENTIAL_PAGES; ScanPage++ )
PageUsed[ ScanPage ] = FALSE;
// scan each section and mark the pages used
for ( ScanSection=0; ScanSection<NBR_SECTIONS; ScanSection++ )
{
pSection = &SectionArray[ ScanSection ];
if ( pSection->Used )
{
if ( pSection->Language==SECTION_IN_SEQUENTIAL )
PageUsed[ pSection->SequentialPage ] = TRUE;
}
}
// find the first free page
ScanPage = 0;
do
{
if ( !PageUsed[ ScanPage ] )
FreePage = ScanPage;
ScanPage++;
}
while( ScanPage<NBR_SEQUENTIAL_PAGES && FreePage==-1 );
return FreePage;
}
#endif
#endif
|
