PRV Zadaci - Programiranje u Realnom Vremenu

More documents

Recommendations

Info

pq->remove(top->getPriorityElement()); top = (X*)pq->first(); cout
prethodno recikliranih objekata date klase, RecycleBin pri alokaciji koristi ugraĎeni alokator new. Pri dealokaciji, objekat se ne oslobaĎa već se reciklira, tj. upisuje se u listu klase RecycleBin. Implementacija // Project: Real-Time Programming // Subject: Data Structures // Module: Recycle Bin // File: recycle.h // Date: October 2002 // Author: Dragan Milicev // Contents: // Class: // RecycleBin // Macro: // RECYCLE_DEC(X) // RECYCLE_DEF(X) // RECYCLE_CON(X) #ifndef _RECYCLE_ #define _RECYCLE_ #include #include "collect.h" ///////////////////////////////////////////////////////////////////// // class RecycleBin ///////////////////////////////////////////////////////////////////// class RecycleBin { public: void recycle (CollectionElement* e) { col.append(e); } void* getNew (size_t size); int isEmpty () { return col.isEmpty(); } int size () { return col.size(); } private: }; Collection col; ///////////////////////////////////////////////////////////////////// // macro RECYCLE_DEC(X) ///////////////////////////////////////////////////////////////////// #define RECYCLE_DEC(X) \ private: static RecycleBin myRecycleBin; \ public: static void* operator new (size_t); \ public: static void operator delete (void*); \ private: CollectionElement forRecycleBin; 25
Page 1 and 2: Bojan Furlan Programiranje u realno
Page 3 and 4: Rešenje: _________________________
Page 5 and 6: Object* itemAt (int at); int locati
Page 7 and 8: } if (e->prev!=0) e->prev->next=e->
Page 9 and 10: Object* CollectionIterator::current
Page 11 and 12: Prema tome, najkritičnije i najče
Page 13 and 14: Object* first () { return head->get
Page 15 and 16: void Collection::insertBefore (Coll
Page 17 and 18: col1->append(&x2->ceForC1); col1->i
Page 19 and 20: class Queue ///////////////////////
Page 21 and 22: // class PriorityQueue ////////////
Page 23: } } Primer upotrebe #include "pqueu
Page 27 and 28: }; Y() : RECYCLE_CON(Y) {} int i,j,
Page 29 and 30: } Instance()->join(); /*glavni prog
Page 31 and 32: SortAlgorithms::bubbleSort(iWorking
Page 33 and 34: { protected: void sort(int *iArray,
Page 35 and 36: 4. Obrada izuzetaka Komentarisati d
Page 37 and 38: } return 1; 37
Page 39 and 40: entry carsOut when current > 0 is b
Page 41 and 42: Rešenje: task Agent is entry takeT
Page 43 and 44: Realno vreme Mehanizam merenja
Page 45 and 46: : TimerInterrupt : Timer Controller
Page 47 and 48: typedef unsigned long int Time; con
Page 49 and 50: void TimerThread::run () { while (1
Page 51 and 52: const int TimerIntNo = 0; class Tim
Page 53 and 54: virtual void run (); virtual int ha
Page 55 and 56: }; void LightControl::run () { whil
Page 57 and 58: 3. Periodic task Korišćenjem ško
Page 59 and 60: delay until nextTime; nextTime := n
Page 61 and 62: // classes StateR, StateG, StateRY,
Page 63 and 64: int YellowOn; }; TraficLight * Traf
Page 65 and 66: Rešenje: typedef double Amplitude;
Page 67 and 68: void TimedSemaphore::wait () { lock
Page 69 and 70: } catch(TimeoutException){ } //...
Page 71 and 72: ii. iii. (n+1)*T + D ≤ t d + t c
Page 73 and 74: procedure_c3; end loop; (b) Test ra
Page 75 and 76:
4. ICPP - Protokol prioriteta sa ne
Page 77:
Primer upotrebe void Monitor::criti
show all

PRV Zadaci - Programiranje u Realnom Vremenu

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?