author | etisserant |
Thu, 20 Mar 2008 15:27:58 +0100 | |
changeset 427 | 6deafe46484f |
parent 378 | d2abf6c8c27b |
child 474 | 09c8c4b6c7df |
permissions | -rw-r--r-- |
178 | 1 |
/* |
207 | 2 |
This file is part of CanFestival, a library implementing CanOpen |
3 |
Stack. |
|
178 | 4 |
|
207 | 5 |
Copyright (C): Edouard TISSERANT and Francis DUPIN |
178 | 6 |
|
207 | 7 |
See COPYING file for copyrights details. |
178 | 8 |
|
207 | 9 |
This library is free software; you can redistribute it and/or |
10 |
modify it under the terms of the GNU Lesser General Public |
|
11 |
License as published by the Free Software Foundation; either |
|
12 |
version 2.1 of the License, or (at your option) any later version. |
|
178 | 13 |
|
207 | 14 |
This library is distributed in the hope that it will be useful, |
15 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
16 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
|
17 |
Lesser General Public License for more details. |
|
178 | 18 |
|
207 | 19 |
You should have received a copy of the GNU Lesser General Public |
20 |
License along with this library; if not, write to the Free Software |
|
21 |
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 |
|
22 |
USA |
|
178 | 23 |
*/ |
24 |
||
210 | 25 |
|
208 | 26 |
/** |
207 | 27 |
** @file dcf.c |
28 |
** @author Edouard TISSERANT and Francis DUPIN |
|
29 |
** @date Mon Jun 4 17:06:12 2007 |
|
30 |
** |
|
208 | 31 |
** @brief EXEMPLE OF SOMMARY |
207 | 32 |
** |
33 |
** |
|
34 |
*/ |
|
215 | 35 |
|
36 |
||
378
d2abf6c8c27b
As requested long ago, added CoData* parameter to all this applications callback, let application designer use identical callback for multiple nodes, and reduce source code length.
etisserant
parents:
368
diff
changeset
|
37 |
#include "data.h" |
200 | 38 |
#include "sysdep.h" |
178 | 39 |
|
207 | 40 |
extern UNS8 _writeNetworkDict (CO_Data* d, UNS8 nodeId, UNS16 index, |
41 |
UNS8 subIndex, UNS8 count, UNS8 dataType, void *data, SDOCallback_t Callback, UNS8 endianize); |
|
204
44ce74232ccb
Some fixes for visual studio C compiler compatiblity.
etisserant
parents:
202
diff
changeset
|
42 |
|
178 | 43 |
|
349 | 44 |
static void send_consise_dcf_loop(CO_Data* d,UNS8 nodeId); |
45 |
||
208 | 46 |
/** |
207 | 47 |
** |
48 |
** |
|
49 |
** @param d |
|
50 |
** @param nodeId |
|
208 | 51 |
*/ |
178 | 52 |
static void CheckSDOAndContinue(CO_Data* d, UNS8 nodeId) |
53 |
{ |
|
207 | 54 |
UNS32 abortCode; |
191 | 55 |
|
207 | 56 |
if(getWriteResultNetworkDict (d, nodeId, &abortCode) != SDO_FINISHED) |
57 |
{ |
|
58 |
MSG_ERR(0x1A01, "SDO error in consise DCF", abortCode); |
|
59 |
MSG_WAR(0x2A02, "server node : ", nodeId); |
|
60 |
} |
|
61 |
||
62 |
closeSDOtransfer(d, nodeId, SDO_CLIENT); |
|
349 | 63 |
send_consise_dcf_loop(d,nodeId); |
178 | 64 |
} |
65 |
||
349 | 66 |
|
208 | 67 |
/** |
207 | 68 |
** |
69 |
** |
|
70 |
** @param d |
|
71 |
** @param nodeId |
|
72 |
** |
|
73 |
** @return |
|
208 | 74 |
*/ |
349 | 75 |
UNS8 send_consise_dcf(CO_Data* d,UNS8 nodeId) |
178 | 76 |
{ |
361 | 77 |
UNS8 szData; |
320
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
78 |
/* Fetch DCF OD entry, if not already done */ |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
79 |
if(!d->dcf_odentry) |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
80 |
{ |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
81 |
UNS32 errorCode; |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
82 |
ODCallback_t *Callback; |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
83 |
d->dcf_odentry = (*d->scanIndexOD)(0x1F22, &errorCode, &Callback); |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
84 |
/* If DCF entry do not exist... Nothing to do.*/ |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
85 |
if (errorCode != OD_SUCCESSFUL) goto DCF_finish; |
f82e758840bd
Some fixes suggested by Luis Jim?nez, plus some minor enhancements in DCF.
etisserant
parents:
251
diff
changeset
|
86 |
} |
178 | 87 |
|
361 | 88 |
szData = d->dcf_odentry->pSubindex[nodeId].size; |
89 |
||
349 | 90 |
/* if the entry for the nodeId is not empty. */ |
91 |
if(szData!=0){ |
|
92 |
/* if the entry for the nodeId is already been processing, quit.*/ |
|
93 |
if(d->dcf_odentry->pSubindex[nodeId].bAccessType & DCF_TO_SEND) return 1; |
|
94 |
||
95 |
d->dcf_odentry->pSubindex[nodeId].bAccessType|=DCF_TO_SEND; |
|
96 |
d->dcf_request++; |
|
97 |
if(d->dcf_request==1) |
|
98 |
send_consise_dcf_loop(d,nodeId); |
|
99 |
return 1; |
|
100 |
} |
|
101 |
||
102 |
DCF_finish: |
|
103 |
return 0; |
|
104 |
} |
|
178 | 105 |
|
349 | 106 |
static void send_consise_dcf_loop(CO_Data* d,UNS8 nodeId) |
107 |
{ |
|
108 |
/* Loop on all DCF subindexes, corresponding to node ID until there is no request*/ |
|
109 |
//while (nodeId < d->dcf_odentry->bSubCount){ |
|
110 |
while (d->dcf_request>0){ |
|
111 |
if(d->dcf_odentry->pSubindex[nodeId].bAccessType & DCF_TO_SEND){ |
|
368
7b51757bfc81
changed order of declaration/initialization of variables to prevent some warnings
etisserant
parents:
361
diff
changeset
|
112 |
UNS8* dcfend; |
349 | 113 |
UNS32 nb_entries; |
368
7b51757bfc81
changed order of declaration/initialization of variables to prevent some warnings
etisserant
parents:
361
diff
changeset
|
114 |
UNS8 szData = d->dcf_odentry->pSubindex[nodeId].size; |
349 | 115 |
|
116 |
{ |
|
117 |
UNS8* dcf = *((UNS8**)d->dcf_odentry->pSubindex[nodeId].pObject); |
|
118 |
dcfend = dcf + szData; |
|
119 |
if (!d->dcf_cursor){ |
|
120 |
d->dcf_cursor = (UNS8*)dcf + 4; |
|
121 |
d->dcf_entries_count = 0; |
|
122 |
} |
|
123 |
nb_entries = UNS32_LE(*((UNS32*)dcf)); |
|
124 |
} |
|
207 | 125 |
|
349 | 126 |
/* condition on consise DCF string for NodeID, if big enough */ |
127 |
if((UNS8*)d->dcf_cursor + 7 < (UNS8*)dcfend && d->dcf_entries_count < nb_entries){ |
|
128 |
||
129 |
UNS16 target_Index; |
|
130 |
UNS8 target_Subindex; |
|
131 |
UNS32 target_Size; |
|
207 | 132 |
|
349 | 133 |
/* pointer to the DCF string for NodeID */ |
134 |
target_Index = UNS16_LE(*((UNS16*)(d->dcf_cursor))); d->dcf_cursor += 2; |
|
135 |
target_Subindex = *((UNS8*)((UNS8*)d->dcf_cursor++)); |
|
136 |
target_Size = UNS32_LE(*((UNS32*)(d->dcf_cursor))); d->dcf_cursor += 4; |
|
137 |
||
138 |
_writeNetworkDict(d, /* CO_Data* d*/ |
|
215 | 139 |
nodeId, /* UNS8 nodeId*/ |
140 |
target_Index, /* UNS16 index*/ |
|
141 |
target_Subindex, /* UNS8 subindex*/ |
|
142 |
target_Size, /* UNS8 count*/ |
|
143 |
0, /* UNS8 dataType*/ |
|
144 |
d->dcf_cursor,/* void *data*/ |
|
145 |
CheckSDOAndContinue,/* SDOCallback_t |
|
207 | 146 |
Callback*/ |
215 | 147 |
0); /* no endianize*/ |
349 | 148 |
/* Push d->dcf_cursor to the end of data*/ |
207 | 149 |
|
349 | 150 |
d->dcf_cursor += target_Size; |
151 |
d->dcf_entries_count++; |
|
207 | 152 |
|
349 | 153 |
/* send_consise_dcf_loop will be called by CheckSDOAndContinue for next DCF entry*/ |
154 |
return; |
|
155 |
} |
|
156 |
else |
|
157 |
{ |
|
158 |
/* We have finished with the dcf entry. Change the flag, decrement the request |
|
159 |
* and execute the bootup callback. */ |
|
160 |
d->dcf_odentry->pSubindex[nodeId].bAccessType&=~DCF_TO_SEND; |
|
161 |
d->dcf_request--; |
|
378
d2abf6c8c27b
As requested long ago, added CoData* parameter to all this applications callback, let application designer use identical callback for multiple nodes, and reduce source code length.
etisserant
parents:
368
diff
changeset
|
162 |
(*d->post_SlaveBootup)(d, nodeId); |
349 | 163 |
} |
164 |
} |
|
353 | 165 |
|
166 |
/* Check the next element*/ |
|
167 |
nodeId=(nodeId+1) % d->dcf_odentry->bSubCount; |
|
168 |
if(nodeId==d->dcf_odentry->bSubCount)nodeId=1; |
|
169 |
d->dcf_cursor = NULL; |
|
170 |
||
207 | 171 |
} |
378
d2abf6c8c27b
As requested long ago, added CoData* parameter to all this applications callback, let application designer use identical callback for multiple nodes, and reduce source code length.
etisserant
parents:
368
diff
changeset
|
172 |
|
178 | 173 |
} |