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
|
/* Classic Ladder Project */
/* Copyright (C) 2001-2006 Marc Le Douarain */
/* http://www.multimania.com/mavati/classicladder */
/* http://www.sourceforge.net/projects/classicladder */
/* November 2002 */
/* ------------------------------------------------------------------------------------- */
/* Load/Save Sequential pages parameters */
/* ------------------------------------------------------------------------------------- */
/* 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 */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include "classicladder.h"
#include "global.h"
#include "files.h"
#include "files_sequential.h"
#ifdef debug
#define dbg_printf printf
#else
static inline int dbg_printf(char *f, ...) {return 0;}
#endif
char ConvTypeOffsetVar(char * RawLine,int *VarType,int * VarOffset)
{
char * StartOfValue;
char * EndOfValue;
StartOfValue = RawLine;
EndOfValue = RawLine;
/* Extract Var Type */
do
{
EndOfValue++;
}
while(*EndOfValue!='/' && *EndOfValue!='\0');
*EndOfValue++ = '\0';
*VarType = atoi(StartOfValue);
/* Extract Var Offset in the type table */
StartOfValue = EndOfValue;
do
{
EndOfValue++;
}
while( *EndOfValue!=10 && *EndOfValue!='\0');
*EndOfValue++ = '\0';
*VarOffset = atoi(StartOfValue);
return TRUE;
}
char LoadSequential(char * FileName)
{
FILE * File;
char Okay = FALSE;
char Line[300];
char * LineOk;
int NumStep,NumTransi,ScanStep,NumSeqComment;
StrStep * pStep;
StrTransition * pTransi;
StrSeqComment * pSeqComment;
char * pCommentString;
int StepData[100];
int ScanData;
char * pSearch;
File = fopen(FileName,"rt");
if (File)
{
do
{
LineOk = cl_fgets(Line,300,File);
if (LineOk)
{
switch(Line[0])
{
case ';':
break;
case '#':
if(strncmp(&Line[1],"VER=",4)==0)
{
if (atoi(&Line[5])>1)
{
printf("Sequential version not supported...\n");
LineOk = FALSE;
}
}
break;
case 'S':
ConvRawLineOfNumbers(&Line[1],6,StepData);
NumStep = StepData[ 0 ];
pStep = &Sequential->Step[ NumStep ];
pStep->InitStep = StepData[ 1 ];
pStep->StepNumber = StepData[ 2 ];
pStep->NumPage = StepData[ 3 ];
pStep->PosiX = StepData[ 4 ];
pStep->PosiY = StepData[ 5 ];
break;
case 'T':
ConvRawLineOfNumbers(&Line[1],1+4*NBR_SWITCHS_MAX+3,StepData);
ScanData = 0;
NumTransi = StepData[ ScanData++ ];
pTransi = &Sequential->Transition[ NumTransi ];
for ( ScanStep=0; ScanStep<NBR_SWITCHS_MAX; ScanStep++ )
pTransi->NumStepToActiv[ ScanStep ] = StepData[ ScanData++ ];
for ( ScanStep=0; ScanStep<NBR_SWITCHS_MAX; ScanStep++ )
pTransi->NumStepToDesactiv[ ScanStep ] = StepData[ ScanData++ ];
for ( ScanStep=0; ScanStep<NBR_SWITCHS_MAX; ScanStep++ )
pTransi->NumTransLinkedForStart[ ScanStep ] = StepData[ ScanData++ ];
for ( ScanStep=0; ScanStep<NBR_SWITCHS_MAX; ScanStep++ )
pTransi->NumTransLinkedForEnd[ ScanStep ] = StepData[ ScanData++ ];
pTransi->NumPage = StepData[ ScanData++ ];
pTransi->PosiX = StepData[ ScanData++ ];
pTransi->PosiY = StepData[ ScanData++ ];
break;
case 'C':
NumTransi = atoi( &Line[1] );
pTransi = &Sequential->Transition[ NumTransi ];
pSearch = Line;
do
{
pSearch++;
}
while( *pSearch!=',' );
pSearch++;
pSearch++;
pSearch++;
ConvTypeOffsetVar( pSearch, &pTransi->VarTypeCondi, &pTransi->VarNumCondi );
break;
case 'N':
pCommentString = ConvRawLineOfNumbers( &Line[1], 4, StepData );
ScanData = 0;
NumSeqComment = StepData[ ScanData++ ];
pSeqComment = &Sequential->SeqComment[ NumSeqComment ];
pSeqComment->NumPage = StepData[ ScanData++ ];
pSeqComment->PosiX = StepData[ ScanData++ ];
pSeqComment->PosiY = StepData[ ScanData++ ];
if ( pCommentString!='\0' )
{
strcpy( pSeqComment->Comment, pCommentString );
// RemoveEndLine( pSeqComment->Comment );
}
break;
}
}
}
while(LineOk);
fclose(File);
Okay = TRUE;
}
return (Okay);
}
void SaveArray( FILE * File, short int * pArray )
{
int ScanStep = 0;
do
{
// if ( ScanStep>0 )
// fprintf( File, "-" );
fprintf( File, "%d", pArray[ ScanStep ] );
fprintf( File, "," );
ScanStep++;
}
while( ScanStep<NBR_SWITCHS_MAX /*&& pArray[ ScanStep ]!=-1*/ );
// fprintf( File, "," );
}
char SaveSequential(char * FileName)
{
FILE * File;
char Okay = FALSE;
int NumStep,NumTransi,NumSeqComment;
File = fopen(FileName,"wt");
if (File)
{
// fprintf(File,"; Sequential\n");
fprintf(File,S_LINE "#VER=1.0" E_LINE "\n");
for (NumStep=0; NumStep<NBR_STEPS; NumStep++)
{
StrStep * pStep = &Sequential->Step[ NumStep ];
if ( pStep->NumPage!=-1 )
{
fprintf( File, S_LINE "S%d,%d,%d,%d,%d,%d", NumStep, pStep->InitStep, pStep->StepNumber,
pStep->NumPage, pStep->PosiX, pStep->PosiY );
fprintf( File, E_LINE "\n" );
}
}
for (NumTransi=0; NumTransi<NBR_TRANSITIONS; NumTransi++ )
{
StrTransition * pTransi = &Sequential->Transition[ NumTransi ];
if ( pTransi->NumPage!=-1 )
{
fprintf( File, S_LINE "T%d,", NumTransi );
SaveArray( File, pTransi->NumStepToActiv );
SaveArray( File, pTransi->NumStepToDesactiv );
SaveArray( File, pTransi->NumTransLinkedForStart );
SaveArray( File, pTransi->NumTransLinkedForEnd );
fprintf( File, "%d,%d,%d", pTransi->NumPage, pTransi->PosiX, pTransi->PosiY );
fprintf( File, E_LINE "\n" );
}
}
for (NumTransi=0; NumTransi<NBR_TRANSITIONS; NumTransi++ )
{
StrTransition * pTransi = &Sequential->Transition[ NumTransi ];
if ( pTransi->NumPage!=-1 )
{
fprintf( File, S_LINE "C%d,0,%d/%d", NumTransi, pTransi->VarTypeCondi, pTransi->VarNumCondi );
fprintf( File, E_LINE "\n" );
}
}
for( NumSeqComment=0; NumSeqComment<NBR_SEQ_COMMENTS; NumSeqComment++ )
{
StrSeqComment * pSeqComment = &Sequential->SeqComment[ NumSeqComment ];
if ( pSeqComment->NumPage!=-1 )
{
fprintf( File, S_LINE "N%d,", NumSeqComment );
fprintf( File, "%d,%d,%d,", pSeqComment->NumPage, pSeqComment->PosiX, pSeqComment->PosiY );
fprintf( File, "%s", pSeqComment->Comment );
fprintf( File, E_LINE "\n" );
}
}
fclose(File);
Okay = TRUE;
}
return (Okay);
}
|
