aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/OpenSim/Region/ClientStack/LindenUDP/LLUDPClientCollection.cs
blob: 06fa3e2e49e4c9916335973168699670df6b8731 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
/*
 * Copyright (c) Contributors, http://opensimulator.org/
 * See CONTRIBUTORS.TXT for a full list of copyright holders.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the OpenSimulator Project nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE DEVELOPERS ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

using System;
using System.Collections.Generic;
using System.Net;
using OpenSim.Framework;
using OpenMetaverse;
using BclExtras.Collections;

using ReaderWriterLockImpl = OpenMetaverse.ReaderWriterLockSlim;

namespace OpenSim.Region.ClientStack.LindenUDP
{
    public sealed class UDPClientCollection
    {
        #region IComparers

        private sealed class UUIDComparer : IComparer<UUID>
        {
            public int Compare(UUID x, UUID y)
            {
                return x.Guid.CompareTo(y.Guid);
            }
        }

        private sealed class IPEndPointComparer : IComparer<IPEndPoint>
        {
            public int Compare(IPEndPoint x, IPEndPoint y)
            {
                int result = x.Address.Address.CompareTo(y.Address.Address);
                if (result == 0) result = x.Port.CompareTo(y.Port);
                return result;
            }
        }

        #endregion IComparers

        private ImmutableMap<UUID, LLUDPClient> m_dict1;
        private ImmutableMap<IPEndPoint, LLUDPClient> m_dict2;
        private LLUDPClient[] m_array;

        public UDPClientCollection()
        {
            m_dict1 = new ImmutableMap<UUID, LLUDPClient>(new UUIDComparer());
            m_dict2 = new ImmutableMap<IPEndPoint, LLUDPClient>(new IPEndPointComparer());
            m_array = new LLUDPClient[0];
        }

        public void Add(UUID key1, IPEndPoint key2, LLUDPClient value)
        {
            m_dict1 = m_dict1.Add(key1, value);
            m_dict2 = m_dict2.Add(key2, value);

            // Copy the array by hand
            LLUDPClient[] oldArray = m_array;
            int oldLength = oldArray.Length;
            LLUDPClient[] newArray = new LLUDPClient[oldLength + 1];

            for (int i = 0; i < oldLength; i++)
                newArray[i] = oldArray[i];
            newArray[oldLength] = value;
            
            m_array = newArray;
        }

        public void Remove(UUID key1, IPEndPoint key2)
        {
            m_dict1 = m_dict1.Delete(key1);
            m_dict2 = m_dict2.Delete(key2);

            LLUDPClient[] oldArray = m_array;
            int oldLength = oldArray.Length;

            // Copy the array by hand

            LLUDPClient[] newArray = new LLUDPClient[oldLength - 1];
            int j = 0;

            for (int i = 0; i < oldLength; i++)
            {
                if (oldArray[i].AgentID != key1)
                    newArray[j++] = oldArray[i];
            }

            m_array = newArray;
        }

        public void Clear()
        {
            m_dict1 = new ImmutableMap<UUID, LLUDPClient>(new UUIDComparer());
            m_dict2 = new ImmutableMap<IPEndPoint, LLUDPClient>(new IPEndPointComparer());
            m_array = new LLUDPClient[0];
        }

        public int Count
        {
            get { return m_array.Length; }
        }

        public bool ContainsKey(UUID key)
        {
            return m_dict1.ContainsKey(key);
        }

        public bool ContainsKey(IPEndPoint key)
        {
            return m_dict2.ContainsKey(key);
        }

        public bool TryGetValue(UUID key, out LLUDPClient value)
        {
            return m_dict1.TryGetValue(key, out value);
        }

        public bool TryGetValue(IPEndPoint key, out LLUDPClient value)
        {
            return m_dict2.TryGetValue(key, out value);
        }

        public void ForEach(Action<LLUDPClient> action)
        {
            Parallel.ForEach<LLUDPClient>(m_array, action); 
        }
    }
}