[12657] | 1 | #region License Information
|
---|
| 2 | /* SimSharp - A .NET port of SimPy, discrete event simulation framework
|
---|
[14185] | 3 | Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[12657] | 4 |
|
---|
| 5 | This program is free software: you can redistribute it and/or modify
|
---|
| 6 | it under the terms of the GNU General Public License as published by
|
---|
| 7 | the Free Software Foundation, either version 3 of the License, or
|
---|
| 8 | (at your option) any later version.
|
---|
| 9 |
|
---|
| 10 | This program is distributed in the hope that it will be useful,
|
---|
| 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 13 | GNU General Public License for more details.
|
---|
| 14 |
|
---|
| 15 | You should have received a copy of the GNU General Public License
|
---|
| 16 | along with this program. If not, see <http://www.gnu.org/licenses/>.*/
|
---|
| 17 | #endregion
|
---|
| 18 |
|
---|
| 19 | using System;
|
---|
| 20 | using System.Collections.Generic;
|
---|
| 21 |
|
---|
| 22 | namespace SimSharp {
|
---|
| 23 | public class PriorityResource {
|
---|
| 24 |
|
---|
| 25 | public int Capacity { get; protected set; }
|
---|
| 26 |
|
---|
| 27 | public int InUse { get { return Users.Count; } }
|
---|
| 28 |
|
---|
| 29 | public int Remaining { get { return Capacity - InUse; } }
|
---|
| 30 |
|
---|
| 31 | protected Environment Environment { get; private set; }
|
---|
| 32 |
|
---|
[14196] | 33 | protected SortedList<int, LinkedList<PriorityRequest>> RequestQueue { get; private set; }
|
---|
[12657] | 34 | protected Queue<Release> ReleaseQueue { get; private set; }
|
---|
| 35 | protected HashSet<Request> Users { get; private set; }
|
---|
| 36 |
|
---|
| 37 | public PriorityResource(Environment environment, int capacity = 1) {
|
---|
| 38 | if (capacity <= 0) throw new ArgumentException("Capacity must be > 0.", "capacity");
|
---|
| 39 | Environment = environment;
|
---|
| 40 | Capacity = capacity;
|
---|
[14196] | 41 | RequestQueue = new SortedList<int, LinkedList<PriorityRequest>>();
|
---|
[12657] | 42 | ReleaseQueue = new Queue<Release>();
|
---|
| 43 | Users = new HashSet<Request>();
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | public virtual PriorityRequest Request(int priority = 1) {
|
---|
| 47 | var request = new PriorityRequest(Environment, TriggerRelease, DisposeCallback, priority);
|
---|
| 48 | if (!RequestQueue.ContainsKey(priority))
|
---|
[14196] | 49 | RequestQueue.Add(priority, new LinkedList<PriorityRequest>());
|
---|
| 50 | RequestQueue[priority].AddLast(request);
|
---|
[12657] | 51 | TriggerRequest();
|
---|
| 52 | return request;
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | public virtual Release Release(PriorityRequest request) {
|
---|
| 56 | var release = new Release(Environment, request, TriggerRequest);
|
---|
| 57 | ReleaseQueue.Enqueue(release);
|
---|
| 58 | TriggerRelease();
|
---|
| 59 | return release;
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | protected void DisposeCallback(Event @event) {
|
---|
| 63 | var request = @event as PriorityRequest;
|
---|
| 64 | if (request != null) Release(request);
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | protected virtual void DoRequest(Request request) {
|
---|
| 68 | if (Users.Count < Capacity) {
|
---|
| 69 | Users.Add(request);
|
---|
| 70 | request.Succeed();
|
---|
| 71 | }
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | protected virtual void DoRelease(Release release) {
|
---|
[14196] | 75 | if (!Users.Remove(release.Request)) {
|
---|
| 76 | var prioRequest = release.Request as PriorityRequest;
|
---|
| 77 | if (prioRequest != null) {
|
---|
| 78 | var current = RequestQueue[prioRequest.Priority].First;
|
---|
| 79 | while (current != null && current.Value != release.Request)
|
---|
| 80 | current = current.Next;
|
---|
| 81 | if (current != null) RequestQueue[prioRequest.Priority].Remove(current);
|
---|
| 82 | }
|
---|
| 83 | }
|
---|
[12657] | 84 | release.Succeed();
|
---|
| 85 | }
|
---|
| 86 |
|
---|
| 87 | protected virtual void TriggerRequest(Event @event = null) {
|
---|
| 88 | foreach (var entry in RequestQueue) {
|
---|
| 89 | var cascade = false;
|
---|
| 90 | var requests = entry.Value;
|
---|
| 91 | while (requests.Count > 0) {
|
---|
[14196] | 92 | var req = requests.First.Value;
|
---|
[12657] | 93 | DoRequest(req);
|
---|
| 94 | if (req.IsTriggered) {
|
---|
[14196] | 95 | requests.RemoveFirst();
|
---|
[12657] | 96 | } else {
|
---|
| 97 | cascade = true;
|
---|
| 98 | break;
|
---|
| 99 | }
|
---|
| 100 | }
|
---|
| 101 | if (cascade) break;
|
---|
| 102 | }
|
---|
| 103 | }
|
---|
| 104 |
|
---|
| 105 | protected virtual void TriggerRelease(Event @event = null) {
|
---|
| 106 | while (ReleaseQueue.Count > 0) {
|
---|
| 107 | var release = ReleaseQueue.Peek();
|
---|
| 108 | DoRelease(release);
|
---|
| 109 | if (release.IsTriggered) {
|
---|
| 110 | ReleaseQueue.Dequeue();
|
---|
| 111 | } else break;
|
---|
| 112 | }
|
---|
| 113 | }
|
---|
| 114 | }
|
---|
| 115 | }
|
---|