| 1 | /* | 
|---|
| 2 | * FragmentQueue.hpp | 
|---|
| 3 | * | 
|---|
| 4 | *  Created on: Oct 19, 2011 | 
|---|
| 5 | *      Author: heber | 
|---|
| 6 | */ | 
|---|
| 7 |  | 
|---|
| 8 | #ifndef FRAGMENTQUEUE_HPP_ | 
|---|
| 9 | #define FRAGMENTQUEUE_HPP_ | 
|---|
| 10 |  | 
|---|
| 11 | // include config.h | 
|---|
| 12 | #ifdef HAVE_CONFIG_H | 
|---|
| 13 | #include <config.h> | 
|---|
| 14 | #endif | 
|---|
| 15 |  | 
|---|
| 16 | #include <deque> | 
|---|
| 17 | #include <map> | 
|---|
| 18 | #include <vector> | 
|---|
| 19 |  | 
|---|
| 20 | #include "CodePatterns/Observer/Observable.hpp" | 
|---|
| 21 |  | 
|---|
| 22 | #include "types.hpp" | 
|---|
| 23 | #include "Jobs/FragmentJob.hpp" | 
|---|
| 24 | #include "Results/FragmentResult.hpp" | 
|---|
| 25 |  | 
|---|
| 26 | class FragmentQueueTest; | 
|---|
| 27 |  | 
|---|
| 28 | /** This class contains a deque for temporarily storing the FragmentJob | 
|---|
| 29 | * instances until they are received by the server. Also all results are | 
|---|
| 30 | * contained herein. | 
|---|
| 31 | */ | 
|---|
| 32 | class FragmentQueue : public Observable | 
|---|
| 33 | { | 
|---|
| 34 | friend class FragmentQueueTest; | 
|---|
| 35 | public: | 
|---|
| 36 | FragmentQueue(); | 
|---|
| 37 | ~FragmentQueue(); | 
|---|
| 38 |  | 
|---|
| 39 | enum NotificationType { | 
|---|
| 40 | JobAdded, | 
|---|
| 41 | JobRemoved, | 
|---|
| 42 | NotificationType_MAX  // denotes the maximum of available notification types | 
|---|
| 43 | }; | 
|---|
| 44 |  | 
|---|
| 45 | // entering jobs into queue | 
|---|
| 46 | void pushJob(FragmentJob::ptr job); | 
|---|
| 47 | void pushJobs(std::vector<FragmentJob::ptr> &_jobs); | 
|---|
| 48 | FragmentJob::ptr popJob(); | 
|---|
| 49 | bool isJobPresent() const; | 
|---|
| 50 | void resubmitJob(const JobId_t jobid); | 
|---|
| 51 |  | 
|---|
| 52 | // querying for results | 
|---|
| 53 | bool isResultPresent(JobId_t jobid) const; | 
|---|
| 54 | FragmentResult::ptr getResult(JobId_t jobid); | 
|---|
| 55 | void pushResult(FragmentResult::ptr &result); | 
|---|
| 56 | std::vector<FragmentResult::ptr> getAllResults(); | 
|---|
| 57 |  | 
|---|
| 58 | size_t getDoneJobs() const; | 
|---|
| 59 | size_t getPresentJobs() const; | 
|---|
| 60 |  | 
|---|
| 61 | private: | 
|---|
| 62 | bool isPresentResult(const FragmentResult::ptr result) const; | 
|---|
| 63 |  | 
|---|
| 64 | //!> result that takes place in ResultQueue after job has arrived before it has been popped. | 
|---|
| 65 | static FragmentResult::ptr NoResult; | 
|---|
| 66 | //!> result that takes place in ResultQueue until real result has arrived. | 
|---|
| 67 | static FragmentResult::ptr NoResultQueued; | 
|---|
| 68 | //!> result that takes place in ResultQueue after real result has been delivered. | 
|---|
| 69 | static FragmentResult::ptr ResultDelivered; | 
|---|
| 70 | //!> maximum number of attempts before job is not resubmitted | 
|---|
| 71 | static size_t Max_Attempts; | 
|---|
| 72 |  | 
|---|
| 73 | typedef std::deque<FragmentJob::ptr> JobQueue; | 
|---|
| 74 | typedef std::map<JobId_t, FragmentJob::ptr> BackupMap; | 
|---|
| 75 | typedef std::map<JobId_t, FragmentResult::ptr> ResultMap; | 
|---|
| 76 | typedef std::map<JobId_t, size_t> AttemptsMap; | 
|---|
| 77 |  | 
|---|
| 78 | //!> queue for all jobs | 
|---|
| 79 | JobQueue jobs; | 
|---|
| 80 | //!> backup map for popped jobs that workers failed to calculate | 
|---|
| 81 | BackupMap backup; | 
|---|
| 82 | //!> map for all results that have been polled by the server | 
|---|
| 83 | ResultMap results; | 
|---|
| 84 | //!> map for all jobs that had to be resubmitted storing how often this has been tried | 
|---|
| 85 | AttemptsMap attempts; | 
|---|
| 86 | }; | 
|---|
| 87 |  | 
|---|
| 88 |  | 
|---|
| 89 | #endif /* FRAGMENTQUEUE_HPP_ */ | 
|---|