[1738] | 1 | // ArchTOIPipe (C) CEA/DAPNIA/SPP IN2P3/LAL
|
---|
| 2 | // Eric Aubourg
|
---|
| 3 | // Christophe Magneville
|
---|
| 4 | // Reza Ansari
|
---|
[1787] | 5 | // $Id: toiprocessor.cc,v 1.21 2001-11-26 15:13:48 aubourg Exp $
|
---|
[1738] | 6 |
|
---|
[1365] | 7 | #include "toiprocessor.h"
|
---|
| 8 | #include "toimanager.h"
|
---|
| 9 | #include <pthread.h>
|
---|
[1663] | 10 |
|
---|
| 11 | #ifdef HAVE_VALUES_H
|
---|
[1365] | 12 | #include <values.h>
|
---|
[1663] | 13 | #endif
|
---|
[1365] | 14 |
|
---|
[1663] | 15 | #ifndef MAXINT
|
---|
| 16 | #define MAXINT 2147483647
|
---|
| 17 | #endif
|
---|
| 18 |
|
---|
| 19 | #ifdef HAVE_STDINT_H
|
---|
| 20 | #include <stdint.h>
|
---|
| 21 | #endif
|
---|
| 22 |
|
---|
[1365] | 23 | #ifdef WITH_SOPHYA
|
---|
| 24 | #include "pexceptions.h"
|
---|
| 25 | #else
|
---|
| 26 | #include "apexceptions.h"
|
---|
| 27 | #endif
|
---|
| 28 |
|
---|
| 29 | #define pthread_mutexattr_setkind_np pthread_mutexattr_settype
|
---|
| 30 |
|
---|
| 31 | TOIProcessor::TOIProcessor() {
|
---|
| 32 | //cout << "TOIProcessor::TOIProcessor" << endl;
|
---|
| 33 | outTOIs = NULL;
|
---|
| 34 | inTOIs = NULL;
|
---|
| 35 | inited=false;
|
---|
| 36 |
|
---|
| 37 | upExtra = 0;
|
---|
| 38 | lowExtra = 0;
|
---|
| 39 | minOut = -1;
|
---|
| 40 | maxOut = -1;
|
---|
[1787] | 41 | forcedMinIn = -1;
|
---|
| 42 | forcedMaxIn = -1;
|
---|
[1365] | 43 | neededHistory = 1000;
|
---|
| 44 | lastAWN = 0;
|
---|
| 45 | wontNeedValue = -1;
|
---|
| 46 |
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | TOIProcessor::~TOIProcessor() {
|
---|
| 50 | delete[] outTOIs;
|
---|
| 51 | delete[] inTOIs;
|
---|
| 52 | //if (mutex)
|
---|
| 53 | pthread_mutex_destroy(&mutex);
|
---|
| 54 | //if (dataReady)
|
---|
| 55 | pthread_cond_destroy(&dataReady);
|
---|
| 56 | pthread_detach(thread);
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 |
|
---|
| 60 | void TOIProcessor::init() {
|
---|
| 61 | //cout << "TOIProcessor::init" << endl;
|
---|
| 62 | }
|
---|
| 63 |
|
---|
| 64 | void TOIProcessor::afterinit() {
|
---|
[1437] | 65 | int i;
|
---|
[1365] | 66 | inTOIs = new (TOI*[inIx.size()]);
|
---|
[1437] | 67 | for(i=0; i<inIx.size(); i++)
|
---|
[1439] | 68 | inTOIs[i] = NULL; // Protection-Initialisation - Reza 11/3/2001
|
---|
[1365] | 69 | outTOIs = new (TOI*[outIx.size()]);
|
---|
[1437] | 70 | for(i=0; i<outIx.size(); i++)
|
---|
[1439] | 71 | outTOIs[i] = NULL; // Protection-Initialisation - Reza 11/3/2001
|
---|
[1365] | 72 | }
|
---|
| 73 |
|
---|
| 74 | int TOIProcessor::getMinOut() {
|
---|
| 75 | //cout << name << "minout" << endl;
|
---|
[1787] | 76 | if (minOut < 0) minOut = calcMinOut();
|
---|
[1365] | 77 | //cout << name << "minout=" << minOut << endl;
|
---|
| 78 | return minOut;
|
---|
| 79 | }
|
---|
| 80 |
|
---|
| 81 | int TOIProcessor::getMaxOut() {
|
---|
| 82 | //cout << name << "maxout" << endl;
|
---|
| 83 | if (maxOut < 0) maxOut = calcMaxOut();
|
---|
| 84 | //cout << name << "maxout=" << maxOut << endl;
|
---|
| 85 | return maxOut;
|
---|
| 86 | }
|
---|
| 87 |
|
---|
| 88 | int TOIProcessor::calcMinOut() {
|
---|
| 89 | return getMinIn() + lowExtra;
|
---|
| 90 | }
|
---|
| 91 |
|
---|
| 92 | int TOIProcessor::calcMaxOut() {
|
---|
| 93 | return getMaxIn() - upExtra;
|
---|
| 94 | }
|
---|
| 95 |
|
---|
| 96 | int TOIProcessor::getMinIn() {
|
---|
| 97 | int nIn = inIx.size();
|
---|
| 98 | int minIn = 0;
|
---|
| 99 | for (int i=0; i<nIn; i++) {
|
---|
| 100 | TOI* toi = inTOIs[i];
|
---|
[1439] | 101 | if (toi == NULL) continue; // Protection - Reza 13/3/2001
|
---|
[1365] | 102 | int x = toi->getMinSn();
|
---|
| 103 | if (x > minIn) minIn = x;
|
---|
| 104 | }
|
---|
[1787] | 105 | if (forcedMinIn > 0 && forcedMinIn > minIn) minIn = forcedMinIn;
|
---|
[1365] | 106 | return minIn;
|
---|
| 107 | }
|
---|
| 108 |
|
---|
| 109 | int TOIProcessor::getMaxIn() {
|
---|
[1663] | 110 | int_4 nIn = inIx.size();
|
---|
| 111 | int_4 maxIn = MAXINT;
|
---|
[1365] | 112 | for (int i=0; i<nIn; i++) {
|
---|
| 113 | TOI* toi = inTOIs[i];
|
---|
[1439] | 114 | if (toi == NULL) continue; // Protection - Reza 13/3/2001
|
---|
[1663] | 115 | int_4 x = toi->getMaxSn();
|
---|
[1365] | 116 | if (x < maxIn) maxIn = x;
|
---|
| 117 | }
|
---|
[1787] | 118 | if (forcedMaxIn > 0 && forcedMaxIn < maxIn) maxIn = forcedMaxIn;
|
---|
[1365] | 119 | return maxIn;
|
---|
| 120 | }
|
---|
| 121 |
|
---|
| 122 |
|
---|
| 123 | int TOIProcessor::declareInput(string toi) {
|
---|
| 124 | if (inIx.find(toi) != inIx.end())
|
---|
| 125 | throw DuplicateIdExc("TOIProcessor::declareInput : "+toi+" already declared");
|
---|
| 126 | int i = inIx.size();
|
---|
| 127 | inIx[toi] = i;
|
---|
| 128 | return i;
|
---|
| 129 | }
|
---|
| 130 |
|
---|
| 131 | int TOIProcessor::declareOutput(string toi) {
|
---|
| 132 | if (outIx.find(toi) != outIx.end())
|
---|
| 133 | throw DuplicateIdExc("TOIProcessor::declareInput : "+toi+" already declared");
|
---|
| 134 | int i = outIx.size();
|
---|
| 135 | outIx[toi] = i;
|
---|
| 136 | return i;
|
---|
| 137 | }
|
---|
| 138 |
|
---|
| 139 | int TOIProcessor::getInputTOIIndex(string toi) {
|
---|
[1367] | 140 | chkinit();
|
---|
[1365] | 141 | map<string, int>::iterator i = inIx.find(toi);
|
---|
| 142 | if (i == inIx.end()) return -1;
|
---|
| 143 | return (*i).second;
|
---|
| 144 | }
|
---|
| 145 |
|
---|
| 146 | int TOIProcessor::getOutputTOIIndex(string toi) {
|
---|
[1367] | 147 | chkinit();
|
---|
[1365] | 148 | map<string, int>::iterator i = outIx.find(toi);
|
---|
| 149 | if (i == outIx.end()) return -1;
|
---|
| 150 | return (*i).second;
|
---|
| 151 | }
|
---|
| 152 |
|
---|
[1437] | 153 | // Methodes rajoutees par Reza 11/3/2001
|
---|
| 154 | TOI* TOIProcessor::getInputTOI(int toiIndex) {
|
---|
| 155 | // chkinit();
|
---|
| 156 | if (toiIndex >= inIx.size())
|
---|
| 157 | throw RangeCheckError("TOIProcessor::getInputTOI() out of bound toiIndex");
|
---|
| 158 | TOI* toi = inTOIs[toiIndex];
|
---|
| 159 | if (toi == NULL)
|
---|
| 160 | throw NullPtrError("TOIProcessor::getInputTOI() - Not assigned TOI !");
|
---|
| 161 | return(toi);
|
---|
| 162 | }
|
---|
| 163 |
|
---|
| 164 | TOI* TOIProcessor::getOutputTOI(int toiIndex) {
|
---|
| 165 | // chkinit();
|
---|
| 166 | if (toiIndex >= outIx.size())
|
---|
| 167 | throw RangeCheckError("TOIProcessor::getOutputTOI() out of bound toiIndex");
|
---|
| 168 | TOI* toi = outTOIs[toiIndex];
|
---|
| 169 | if (toi == NULL)
|
---|
| 170 | throw NullPtrError("TOIProcessor::getOutputTOI() - Not assigned TOI !");
|
---|
| 171 | return(toi);
|
---|
| 172 | }
|
---|
| 173 |
|
---|
| 174 | bool TOIProcessor::checkInputTOIIndex(int toiIndex) {
|
---|
| 175 | if (toiIndex >= inIx.size()) return false;
|
---|
| 176 | if (inTOIs[toiIndex] == NULL) return false;
|
---|
| 177 | return true;
|
---|
| 178 | }
|
---|
| 179 |
|
---|
| 180 | bool TOIProcessor::checkOutputTOIIndex(int toiIndex) {
|
---|
| 181 | if (toiIndex >= outIx.size()) return false;
|
---|
| 182 | if (outTOIs[toiIndex] == NULL) return false;
|
---|
| 183 | return true;
|
---|
| 184 | }
|
---|
| 185 |
|
---|
[1762] | 186 | void TOIProcessor::PrintStatus(::ostream & os)
|
---|
[1437] | 187 | {
|
---|
[1439] | 188 | chkinit();
|
---|
[1437] | 189 | os << " TOIProcessor::PrintStatus() - Name= " << name
|
---|
| 190 | << " MinIn=" << getMinIn() << " MaxIn=" << getMaxIn() << endl;
|
---|
| 191 | os << " --- Inputs N= " << inIx.size() << endl;
|
---|
| 192 | int k;
|
---|
| 193 | for(k=0; k<inIx.size(); k++) {
|
---|
| 194 | os << "Input[" << k << "] : " << getInName(k) ;
|
---|
| 195 | if (inTOIs[k] != NULL)
|
---|
| 196 | os << " Connected TOI " << inTOIs[k]->getName() << endl;
|
---|
| 197 | else os << " NO TOI " << endl;
|
---|
| 198 | }
|
---|
| 199 | os << " --- Outputs N= " << outIx.size() << endl;
|
---|
| 200 | for(k=0; k<outIx.size(); k++) {
|
---|
| 201 | os << "Output[" << k << "] : " << getOutName(k) ;
|
---|
| 202 | if (outTOIs[k] != NULL)
|
---|
| 203 | os << " Connected TOI " << outTOIs[k]->getName() << endl;
|
---|
| 204 | else os << " NO TOI " << endl;
|
---|
| 205 | }
|
---|
| 206 | os << endl;
|
---|
| 207 | return;
|
---|
| 208 | }
|
---|
| 209 |
|
---|
| 210 | // Fin rajout Reza 11/3/2001
|
---|
| 211 |
|
---|
[1365] | 212 | void TOIProcessor::addInput(string name, TOI* toi) {
|
---|
| 213 | chkinit();
|
---|
| 214 | map<string, int>::iterator i = inIx.find(name);
|
---|
| 215 | if (i == inIx.end()) throw NotFoundExc("TOIProcessor::addInput "+
|
---|
| 216 | name+" not declared");
|
---|
[1439] | 217 | inTOIs[(*i).second] = toi;
|
---|
| 218 | toi->addConsumer(this); // $CHECK$ Reza 13/3/2001
|
---|
[1365] | 219 | }
|
---|
| 220 |
|
---|
| 221 | void TOIProcessor::addOutput(string name, TOI* toi) {
|
---|
| 222 | chkinit();
|
---|
| 223 | map<string, int>::iterator i = outIx.find(name);
|
---|
| 224 | if (i == outIx.end()) throw NotFoundExc("TOIProcessor::addOutput "+
|
---|
| 225 | name+" not declared");
|
---|
| 226 | toi->setProducer(this);
|
---|
| 227 | outTOIs[(*i).second] = toi;
|
---|
| 228 | }
|
---|
| 229 |
|
---|
[1367] | 230 | string TOIProcessor::getOutName(int i) {
|
---|
| 231 | if (i > outIx.size()) throw RangeCheckError("TOIProcessor::getOutName "
|
---|
| 232 | " out of bound");
|
---|
[1437] | 233 | map<string, int>::iterator j;
|
---|
| 234 | for(j=outIx.begin(); j!= outIx.end(); j++)
|
---|
| 235 | if ((*j).second == i) return (*j).first;
|
---|
| 236 |
|
---|
| 237 | throw RangeCheckError("TOIProcessor::getOutName Not found index !");
|
---|
[1367] | 238 | }
|
---|
| 239 |
|
---|
| 240 | string TOIProcessor::getInName(int i) {
|
---|
| 241 | if (i > inIx.size()) throw RangeCheckError("TOIProcessor::getInName "
|
---|
| 242 | " out of bound");
|
---|
[1437] | 243 | map<string, int>::iterator j;
|
---|
| 244 | for(j=inIx.begin(); j!= inIx.end(); j++)
|
---|
| 245 | if ((*j).second == i) return (*j).first;
|
---|
| 246 |
|
---|
| 247 | throw RangeCheckError("TOIProcessor::getOutName Not found index !");
|
---|
[1367] | 248 | }
|
---|
| 249 |
|
---|
[1365] | 250 | void TOIProcessor::run() {
|
---|
| 251 |
|
---|
| 252 | }
|
---|
| 253 |
|
---|
[1689] | 254 | void TOIProcessor::warnPutDone() {
|
---|
| 255 | int n = outIx.size();
|
---|
| 256 | for (int i=0; i<n; i++) {
|
---|
| 257 | TOI* toi = outTOIs[i];
|
---|
[1725] | 258 | if (toi) {
|
---|
| 259 | toi->putDone();
|
---|
| 260 | }
|
---|
[1689] | 261 | }
|
---|
| 262 | }
|
---|
| 263 |
|
---|
[1365] | 264 | void* TOIProcessor::ThreadStart(void* arg) {
|
---|
| 265 | TOIProcessor* p = (TOIProcessor*) arg;
|
---|
| 266 | // cout << p->name << " new thread running " << pthread_self() << endl;
|
---|
| 267 | p->run();
|
---|
[1689] | 268 | p->warnPutDone();
|
---|
[1629] | 269 | pthread_exit(NULL);
|
---|
[1365] | 270 | // cout << p->name << " thread done " << pthread_self() << endl;
|
---|
| 271 | return NULL;
|
---|
| 272 | }
|
---|
| 273 |
|
---|
| 274 | #ifdef Linux
|
---|
| 275 | #define pthread_mutexattr_settype pthread_mutexattr_setkind_np
|
---|
| 276 | #define PTHREAD_MUTEX_ERRORCHECK PTHREAD_MUTEX_ERRORCHECK_NP
|
---|
| 277 | #define pthread_mutex_setname_np(a,b,c)
|
---|
| 278 | #define pthread_cond_setname_np(a,b,c)
|
---|
| 279 | #endif
|
---|
| 280 |
|
---|
| 281 | void TOIProcessor::start() {
|
---|
| 282 | pthread_cond_init(&dataReady, NULL);
|
---|
| 283 | pthread_mutexattr_init(&mutattr);
|
---|
| 284 | // pthread_mutexattr_settype(&mutattr, PTHREAD_MUTEX_ERRORCHECK);
|
---|
| 285 | pthread_mutex_init(&mutex, &mutattr);
|
---|
| 286 | //pthread_mutex_setname_np(&mutex, (name + "_proc_mutex").c_str(), 0);
|
---|
| 287 | //pthread_cond_setname_np(&dataReady, (name + "_proc_cond").c_str(), 0);
|
---|
| 288 | //cout << name << " starting thread " << &thread << endl;
|
---|
| 289 | pthread_create(&thread, NULL, ThreadStart, this);
|
---|
| 290 | TOIManager::getManager()->addThread(&thread);
|
---|
| 291 | }
|
---|
| 292 |
|
---|
| 293 | #ifndef NO_SOPHYA
|
---|
[1464] | 294 | /* ---- l'interface va etre modifiee, NE PAS UTILISER
|
---|
[1365] | 295 | Array TOIProcessor::getData(int toiIndex, int iStart, int iEnd) {
|
---|
[1437] | 296 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1365] | 297 | toi->waitForData(iStart, iEnd);
|
---|
| 298 | return toi->getData(iStart, iEnd);
|
---|
| 299 | }
|
---|
| 300 |
|
---|
| 301 | Array TOIProcessor::getError(int toiIndex, int iStart, int iEnd) {
|
---|
[1437] | 302 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1365] | 303 | toi->waitForData(iStart, iEnd);
|
---|
| 304 | return toi->getError(iStart, iEnd);
|
---|
| 305 | }
|
---|
| 306 |
|
---|
| 307 | TArray<int_4> TOIProcessor::getFlag(int toiIndex, int iStart, int iEnd) {
|
---|
[1437] | 308 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1365] | 309 | toi->waitForData(iStart, iEnd);
|
---|
| 310 | return toi->getFlag(iStart, iEnd);
|
---|
| 311 | }
|
---|
[1464] | 312 | l'interface va etre modifiee, NE PAS UTILISER ---- */
|
---|
[1365] | 313 | #endif
|
---|
| 314 |
|
---|
| 315 | double TOIProcessor::getData(int toiIndex, int i) {
|
---|
[1437] | 316 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1740] | 317 | if (toi->needSyncOldWay()) toi->waitForData(i); // seulement pour autre que segmented
|
---|
| 318 | autoWontNeed(i);
|
---|
[1365] | 319 | return toi->getData(i);
|
---|
| 320 | }
|
---|
| 321 |
|
---|
[1532] | 322 | void TOIProcessor::getData(int toiIndex, int i, double &data, uint_8 &flag)
|
---|
[1462] | 323 | {
|
---|
| 324 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1740] | 325 | if (toi->needSyncOldWay()) toi->waitForData(i); // seulement pour autre que segmented
|
---|
[1462] | 326 | toi->getData(i, data, flag);
|
---|
[1742] | 327 | autoWontNeed(i);
|
---|
[1462] | 328 | return;
|
---|
| 329 | }
|
---|
| 330 |
|
---|
[1742] | 331 | void TOIProcessor::getData(int toiIndex, int i, int n, double* d)
|
---|
| 332 | {
|
---|
| 333 | TOI* toi = getInputTOI(toiIndex);
|
---|
| 334 | if (toi->needSyncOldWay()) toi->waitForData(i+n); // seulement pour autre que segmented
|
---|
| 335 | toi->getData(i, n, d);
|
---|
| 336 | autoWontNeed(i);
|
---|
| 337 | return;
|
---|
| 338 | }
|
---|
| 339 |
|
---|
| 340 | void TOIProcessor::getData(int toiIndex, int i, int n, double* d, uint_8* f)
|
---|
| 341 | {
|
---|
| 342 | TOI* toi = getInputTOI(toiIndex);
|
---|
| 343 | if (toi->needSyncOldWay()) toi->waitForData(i+n); // seulement pour autre que segmented
|
---|
| 344 | toi->getData(i, n, d, f);
|
---|
| 345 | autoWontNeed(i);
|
---|
| 346 | return;
|
---|
| 347 | }
|
---|
| 348 |
|
---|
| 349 |
|
---|
[1462] | 350 | /*RZCMV
|
---|
[1365] | 351 | double TOIProcessor::getError(int toiIndex, int i) {
|
---|
[1437] | 352 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1365] | 353 | toi->waitForData(i);
|
---|
| 354 | return toi->getError(i);
|
---|
| 355 | }
|
---|
| 356 |
|
---|
| 357 | int_4 TOIProcessor::getFlag(int toiIndex, int i) {
|
---|
[1437] | 358 | TOI* toi = getInputTOI(toiIndex);
|
---|
[1365] | 359 | toi->waitForData(i);
|
---|
| 360 | return toi->getFlag(i);
|
---|
| 361 | }
|
---|
[1462] | 362 | */
|
---|
[1365] | 363 |
|
---|
| 364 | void TOIProcessor::setNeededHistory(int nsamples) {
|
---|
| 365 | neededHistory = nsamples;
|
---|
| 366 | }
|
---|
| 367 |
|
---|
| 368 | void TOIProcessor::wontNeedBefore(int i) {
|
---|
| 369 | if (i<wontNeedValue) return;
|
---|
| 370 | wontNeedValue = i;
|
---|
| 371 | for (int j=0; j< (int) inIx.size(); j++) {
|
---|
[1490] | 372 | // $CHECK$ Reza 6/5/2001 Protection sur non connected TOI
|
---|
| 373 | if (inTOIs[j]) inTOIs[j]->wontNeedBefore(i);
|
---|
[1365] | 374 | }
|
---|
| 375 | }
|
---|
| 376 |
|
---|
| 377 | void TOIProcessor::autoWontNeed(int iCur) {
|
---|
| 378 | if (neededHistory <=0) return;
|
---|
[1773] | 379 | if (iCur < lastAWN + neededHistory/10) return;
|
---|
[1365] | 380 | lastAWN = iCur;
|
---|
[1750] | 381 | // cout << name << " wontNeedBefore " << iCur-neededHistory << endl;
|
---|
[1365] | 382 | wontNeedBefore(iCur-neededHistory);
|
---|
| 383 | }
|
---|
| 384 |
|
---|
| 385 | void TOIProcessor::notify() {
|
---|
[1740] | 386 | lock();
|
---|
[1365] | 387 | pthread_cond_broadcast(&dataReady);
|
---|
| 388 | unlock();
|
---|
| 389 | }
|
---|
| 390 |
|
---|
| 391 |
|
---|
[1532] | 392 | void TOIProcessor::putData(int toiIndex, int i, double value, uint_8 flg) {
|
---|
[1437] | 393 | TOI* toi = getOutputTOI(toiIndex);
|
---|
[1365] | 394 | toi->putData(i, value, flg);
|
---|
[1742] | 395 | // autoWontNeed(i); // now done on getData
|
---|
[1740] | 396 | if (toi->needSyncOldWay()) notify(); // seulement pour non segmented
|
---|
[1365] | 397 | }
|
---|
| 398 |
|
---|
[1742] | 399 | void TOIProcessor::putData(int toiIndex, int i, int n, double const* val,
|
---|
[1743] | 400 | uint_8 const* flg) {
|
---|
[1742] | 401 | TOI* toi = getOutputTOI(toiIndex);
|
---|
| 402 | toi->putData(i, n, val, flg);
|
---|
| 403 | if (toi->needSyncOldWay()) notify(); // seulement pour non segmented
|
---|
| 404 | }
|
---|
| 405 |
|
---|
[1462] | 406 | /*RZCMV
|
---|
[1365] | 407 | void TOIProcessor::putDataError(int toiIndex, int i, double value,
|
---|
| 408 | double error, int_4 flg) {
|
---|
[1437] | 409 | TOI* toi = getOutputTOI(toiIndex);
|
---|
| 410 | if (toi == NULL)
|
---|
| 411 | throw NullPtrError("TOIProcessor::putDataError() - Not assigned TOI !");
|
---|
[1365] | 412 | toi->putDataError(i, value, error, flg);
|
---|
| 413 | autoWontNeed(i);
|
---|
| 414 | notify();
|
---|
| 415 | }
|
---|
[1462] | 416 | */
|
---|
[1365] | 417 |
|
---|