blob: c8ba848256d188541ae5571028f7219f9f138c96 (
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
|
/*
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/Forward.h>
#include <AK/HashTable.h>
#include <AK/Random.h>
namespace AK {
// This class manages a pool of random ID's in the range N (default of 1) to INT32_MAX
class IDAllocator {
public:
IDAllocator() = default;
explicit IDAllocator(int minimum_value)
: m_minimum_value(minimum_value)
{
}
~IDAllocator() = default;
int allocate()
{
VERIFY(m_allocated_ids.size() < (INT32_MAX - 2));
int id = 0;
for (;;) {
id = static_cast<int>(get_random_uniform(NumericLimits<int>::max()));
if (id < m_minimum_value)
continue;
if (m_allocated_ids.set(id) == AK::HashSetResult::InsertedNewEntry)
break;
}
return id;
}
void deallocate(int id)
{
m_allocated_ids.remove(id);
}
private:
HashTable<int> m_allocated_ids;
int m_minimum_value { 1 };
};
}
#if USING_AK_GLOBALLY
using AK::IDAllocator;
#endif
|
