2020-01-18 08:38:21 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT HOLDER OR 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.
|
|
|
|
*/
|
|
|
|
|
2020-01-04 23:28:42 +00:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <AK/HashTable.h>
|
2020-09-18 07:49:51 +00:00
|
|
|
#include <stdlib.h>
|
2020-01-04 23:28:42 +00:00
|
|
|
|
|
|
|
namespace AK {
|
|
|
|
|
|
|
|
class IDAllocator {
|
|
|
|
|
|
|
|
public:
|
2020-09-18 07:49:51 +00:00
|
|
|
IDAllocator() { }
|
|
|
|
~IDAllocator() { }
|
2020-01-04 23:28:42 +00:00
|
|
|
|
|
|
|
int allocate()
|
|
|
|
{
|
|
|
|
int r = rand();
|
|
|
|
for (int i = 0; i < 100000; ++i) {
|
|
|
|
int allocated_id = r + i;
|
2020-01-05 14:11:49 +00:00
|
|
|
// Make sure we never vend ID 0, as some code may interpret that as "no ID"
|
|
|
|
if (allocated_id == 0)
|
|
|
|
++allocated_id;
|
2020-01-04 23:28:42 +00:00
|
|
|
if (!m_allocated_ids.contains(allocated_id)) {
|
|
|
|
m_allocated_ids.set(allocated_id);
|
|
|
|
return allocated_id;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ASSERT_NOT_REACHED();
|
|
|
|
}
|
|
|
|
|
|
|
|
void deallocate(int id)
|
|
|
|
{
|
|
|
|
m_allocated_ids.remove(id);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
HashTable<int> m_allocated_ids;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
using AK::IDAllocator;
|