OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 // This file contains the definition of the IdAllocator class. | 5 // This file contains the definition of the IdAllocator class. |
6 | 6 |
7 #ifndef GPU_COMMAND_BUFFER_CLIENT_ID_ALLOCATOR_H_ | 7 #ifndef GPU_COMMAND_BUFFER_CLIENT_ID_ALLOCATOR_H_ |
8 #define GPU_COMMAND_BUFFER_CLIENT_ID_ALLOCATOR_H_ | 8 #define GPU_COMMAND_BUFFER_CLIENT_ID_ALLOCATOR_H_ |
9 | 9 |
10 #include <stdint.h> | 10 #include <stdint.h> |
11 | 11 |
12 #include <set> | 12 #include <map> |
13 #include <utility> | 13 #include <utility> |
14 | 14 |
15 #include "base/compiler_specific.h" | 15 #include "base/compiler_specific.h" |
16 #include "base/macros.h" | 16 #include "base/macros.h" |
17 #include "gpu/gpu_export.h" | 17 #include "gpu/gpu_export.h" |
18 | 18 |
19 namespace gpu { | 19 namespace gpu { |
20 | 20 |
21 // A resource ID, key to the resource maps. | 21 // A resource ID, key to the resource maps. |
22 typedef uint32_t ResourceId; | 22 typedef uint32_t ResourceId; |
23 // Invalid resource ID. | 23 // Invalid resource ID. |
24 static const ResourceId kInvalidResource = 0u; | 24 static const ResourceId kInvalidResource = 0u; |
25 | 25 |
26 // A class to manage the allocation of resource IDs. | 26 // A class to manage the allocation of resource IDs. |
27 class GPU_EXPORT IdAllocator { | 27 class GPU_EXPORT IdAllocator { |
28 public: | 28 public: |
29 IdAllocator(); | 29 IdAllocator(); |
30 ~IdAllocator(); | 30 ~IdAllocator(); |
31 | 31 |
32 // Allocates a new resource ID. | 32 // Allocates a new resource ID. |
33 ResourceId AllocateID(); | 33 ResourceId AllocateID(); |
34 | 34 |
35 // Allocates an Id starting at or above desired_id. | 35 // Allocates an Id starting at or above desired_id. |
36 // Note: may wrap if it starts near limit. | 36 // Note: may wrap if it starts near limit. |
37 ResourceId AllocateIDAtOrAbove(ResourceId desired_id); | 37 ResourceId AllocateIDAtOrAbove(ResourceId desired_id); |
38 | 38 |
| 39 // Allocates |range| amount of contiguous ids. |
| 40 // Returns the first id to |first_id| or |kInvalidResource| if |
| 41 // allocation failed. |
| 42 ResourceId AllocateIDRange(uint32_t range); |
| 43 |
39 // Marks an id as used. Returns false if id was already used. | 44 // Marks an id as used. Returns false if id was already used. |
40 bool MarkAsUsed(ResourceId id); | 45 bool MarkAsUsed(ResourceId id); |
41 | 46 |
42 // Frees a resource ID. | 47 // Frees a resource ID. |
43 void FreeID(ResourceId id); | 48 void FreeID(ResourceId id); |
44 | 49 |
| 50 // Frees a |range| amount of contiguous ids, starting from |first_id|. |
| 51 void FreeIDRange(ResourceId first_id, uint32_t range); |
| 52 |
45 // Checks whether or not a resource ID is in use. | 53 // Checks whether or not a resource ID is in use. |
46 bool InUse(ResourceId id) const; | 54 bool InUse(ResourceId id) const; |
47 | 55 |
48 private: | 56 private: |
49 // TODO(gman): This would work much better with ranges or a hash table. | 57 // first_id -> last_id mapping. |
50 typedef std::set<ResourceId> ResourceIdSet; | 58 typedef std::map<ResourceId, ResourceId> ResourceIdRangeMap; |
51 | 59 |
52 // The highest ID on the used list. | 60 ResourceIdRangeMap used_ids_; |
53 ResourceId LastUsedId() const; | |
54 | |
55 // Lowest ID that isn't on the used list. This is slow, use as a last resort. | |
56 ResourceId FindFirstUnusedId() const; | |
57 | |
58 ResourceIdSet used_ids_; | |
59 ResourceIdSet free_ids_; | |
60 | 61 |
61 DISALLOW_COPY_AND_ASSIGN(IdAllocator); | 62 DISALLOW_COPY_AND_ASSIGN(IdAllocator); |
62 }; | 63 }; |
63 | 64 |
64 } // namespace gpu | 65 } // namespace gpu |
65 | 66 |
66 #endif // GPU_COMMAND_BUFFER_CLIENT_ID_ALLOCATOR_H_ | 67 #endif // GPU_COMMAND_BUFFER_CLIENT_ID_ALLOCATOR_H_ |
OLD | NEW |