| | | 1 | | //======================================================================= |
| | | 2 | | // NavigationQueryAdmissionCoordinator.cs |
| | | 3 | | //======================================================================= |
| | | 4 | | // MIT License, Copyright (c) 2024-present David Oravsky (mrdav30) |
| | | 5 | | // See LICENSE file in the project root for full license information. |
| | | 6 | | //======================================================================= |
| | | 7 | | |
| | | 8 | | using System; |
| | | 9 | | |
| | | 10 | | namespace Trailblazer.Pathing; |
| | | 11 | | |
| | | 12 | | /// <summary>Identifies one generation-safe aggregate query-capacity reservation.</summary> |
| | | 13 | | internal readonly struct NavigationQueryCapacityReservation |
| | | 14 | | { |
| | | 15 | | internal NavigationQueryCapacityReservation( |
| | | 16 | | NavigationQueryAdmissionCoordinator owner, |
| | | 17 | | int lane, |
| | | 18 | | ulong generation, |
| | | 19 | | int count) |
| | | 20 | | { |
| | | 21 | | Owner = owner; |
| | | 22 | | Lane = lane; |
| | | 23 | | Generation = generation; |
| | | 24 | | Count = count; |
| | | 25 | | } |
| | | 26 | | |
| | | 27 | | internal NavigationQueryAdmissionCoordinator? Owner { get; } |
| | | 28 | | internal int Lane { get; } |
| | | 29 | | internal ulong Generation { get; } |
| | | 30 | | internal int Count { get; } |
| | | 31 | | } |
| | | 32 | | |
| | | 33 | | /// <summary>Bounds aggregate A* and Flow admission without sharing their workers.</summary> |
| | | 34 | | internal sealed class NavigationQueryAdmissionCoordinator |
| | | 35 | | { |
| | 1015 | 36 | | private readonly object _sync = new(); |
| | 1015 | 37 | | private readonly LaneState[] _lanes = new LaneState[2]; |
| | | 38 | | private readonly int _maximumCount; |
| | | 39 | | private int _activeCount; |
| | | 40 | | |
| | 1015 | 41 | | internal NavigationQueryAdmissionCoordinator(int maximumCount) |
| | | 42 | | { |
| | 1015 | 43 | | SwiftThrowHelper.ThrowIfArgumentOutOfRange( |
| | 1015 | 44 | | maximumCount <= 0, |
| | 1015 | 45 | | maximumCount, |
| | 1015 | 46 | | nameof(maximumCount)); |
| | 1015 | 47 | | _maximumCount = maximumCount; |
| | 1015 | 48 | | } |
| | | 49 | | |
| | | 50 | | internal int ActiveCount |
| | | 51 | | { |
| | | 52 | | get |
| | | 53 | | { |
| | 16 | 54 | | lock (_sync) |
| | 16 | 55 | | return _activeCount; |
| | 16 | 56 | | } |
| | | 57 | | } |
| | | 58 | | |
| | | 59 | | internal int TryReservePrefix( |
| | | 60 | | PathAlgorithm algorithm, |
| | | 61 | | int requestedCount, |
| | | 62 | | out NavigationQueryCapacityReservation reservation) |
| | | 63 | | { |
| | 467 | 64 | | SwiftThrowHelper.ThrowIfNegative(requestedCount, nameof(requestedCount)); |
| | 467 | 65 | | int lane = GetLane(algorithm); |
| | 467 | 66 | | lock (_sync) |
| | | 67 | | { |
| | 467 | 68 | | ref LaneState state = ref _lanes[lane]; |
| | 467 | 69 | | int count = Math.Min(requestedCount, _maximumCount - _activeCount); |
| | 467 | 70 | | if (requestedCount == 0 |
| | 467 | 71 | | || state.Active |
| | 467 | 72 | | || count == 0) |
| | | 73 | | { |
| | 2 | 74 | | reservation = default; |
| | 2 | 75 | | return 0; |
| | | 76 | | } |
| | 465 | 77 | | state.Generation = unchecked(state.Generation + 1UL); |
| | 465 | 78 | | state.Count = count; |
| | 465 | 79 | | state.Active = true; |
| | 465 | 80 | | _activeCount += count; |
| | 465 | 81 | | reservation = new NavigationQueryCapacityReservation( |
| | 465 | 82 | | this, |
| | 465 | 83 | | lane, |
| | 465 | 84 | | state.Generation, |
| | 465 | 85 | | count); |
| | 465 | 86 | | return count; |
| | | 87 | | } |
| | 467 | 88 | | } |
| | | 89 | | |
| | | 90 | | internal NavigationQueryCapacityReservation Trim( |
| | | 91 | | NavigationQueryCapacityReservation reservation, |
| | | 92 | | int retainedCount) |
| | | 93 | | { |
| | 874 | 94 | | lock (_sync) |
| | | 95 | | { |
| | 874 | 96 | | if (!TryGetActiveLane(reservation, out int lane)) |
| | 4 | 97 | | return default; |
| | 870 | 98 | | ref LaneState state = ref _lanes[lane]; |
| | 870 | 99 | | _activeCount -= state.Count - retainedCount; |
| | 870 | 100 | | state.Count = retainedCount; |
| | 870 | 101 | | if (retainedCount == 0) |
| | | 102 | | { |
| | 2 | 103 | | state.Active = false; |
| | 2 | 104 | | return default; |
| | | 105 | | } |
| | 868 | 106 | | return new NavigationQueryCapacityReservation( |
| | 868 | 107 | | this, |
| | 868 | 108 | | lane, |
| | 868 | 109 | | state.Generation, |
| | 868 | 110 | | retainedCount); |
| | | 111 | | } |
| | 874 | 112 | | } |
| | | 113 | | |
| | | 114 | | internal void Release(NavigationQueryCapacityReservation reservation) |
| | | 115 | | { |
| | 468 | 116 | | lock (_sync) |
| | | 117 | | { |
| | 468 | 118 | | if (!TryGetActiveLane(reservation, out int lane)) |
| | 5 | 119 | | return; |
| | 463 | 120 | | ref LaneState state = ref _lanes[lane]; |
| | 463 | 121 | | _activeCount -= state.Count; |
| | 463 | 122 | | state.Count = 0; |
| | 463 | 123 | | state.Active = false; |
| | 463 | 124 | | } |
| | 468 | 125 | | } |
| | | 126 | | |
| | | 127 | | private bool TryGetActiveLane( |
| | | 128 | | NavigationQueryCapacityReservation reservation, |
| | | 129 | | out int lane) |
| | | 130 | | { |
| | 1342 | 131 | | lane = reservation.Lane; |
| | 1342 | 132 | | return ReferenceEquals(reservation.Owner, this) |
| | 1342 | 133 | | && (uint)lane < (uint)_lanes.Length |
| | 1342 | 134 | | && _lanes[lane].Active |
| | 1342 | 135 | | && _lanes[lane].Generation == reservation.Generation |
| | 1342 | 136 | | && _lanes[lane].Count == reservation.Count; |
| | | 137 | | } |
| | | 138 | | |
| | | 139 | | private static int GetLane(PathAlgorithm algorithm) => |
| | 467 | 140 | | algorithm == PathAlgorithm.AStar ? 0 : 1; |
| | | 141 | | |
| | | 142 | | private struct LaneState |
| | | 143 | | { |
| | | 144 | | internal ulong Generation; |
| | | 145 | | internal int Count; |
| | | 146 | | internal bool Active; |
| | | 147 | | } |
| | | 148 | | } |