| OLD | NEW |
| 1 /* | 1 // Copyright (c) 2009 The Chromium Authors. All rights reserved. |
| 2 * Copyright 2009, Google Inc. | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 * All rights reserved. | 3 // found in the LICENSE file. |
| 4 * | |
| 5 * Redistribution and use in source and binary forms, with or without | |
| 6 * modification, are permitted provided that the following conditions are | |
| 7 * met: | |
| 8 * | |
| 9 * * Redistributions of source code must retain the above copyright | |
| 10 * notice, this list of conditions and the following disclaimer. | |
| 11 * * Redistributions in binary form must reproduce the above | |
| 12 * copyright notice, this list of conditions and the following disclaimer | |
| 13 * in the documentation and/or other materials provided with the | |
| 14 * distribution. | |
| 15 * * Neither the name of Google Inc. nor the names of its | |
| 16 * contributors may be used to endorse or promote products derived from | |
| 17 * this software without specific prior written permission. | |
| 18 * | |
| 19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 30 */ | |
| 31 | |
| 32 | 4 |
| 33 // This file contains the implementation of IdAllocator. | 5 // This file contains the implementation of IdAllocator. |
| 34 | 6 |
| 35 #include "gpu/command_buffer/client/id_allocator.h" | 7 #include "gpu/command_buffer/client/id_allocator.h" |
| 36 | 8 |
| 37 namespace gpu { | 9 namespace gpu { |
| 38 | 10 |
| 39 IdAllocator::IdAllocator() : bitmap_(1) { bitmap_[0] = 0; } | 11 IdAllocator::IdAllocator() : bitmap_(1) { bitmap_[0] = 0; } |
| 40 | 12 |
| 41 static const unsigned int kBitsPerUint32 = sizeof(Uint32) * 8; // NOLINT | 13 static const unsigned int kBitsPerUint32 = sizeof(Uint32) * 8; // NOLINT |
| (...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 76 // Gets the bit from the proper entry. This doesn't resize the vector, just | 48 // Gets the bit from the proper entry. This doesn't resize the vector, just |
| 77 // returns false if the bit is beyond the last entry. | 49 // returns false if the bit is beyond the last entry. |
| 78 bool IdAllocator::GetBit(unsigned int bit) const { | 50 bool IdAllocator::GetBit(unsigned int bit) const { |
| 79 size_t size = bitmap_.size(); | 51 size_t size = bitmap_.size(); |
| 80 if (bit / kBitsPerUint32 >= size) return false; | 52 if (bit / kBitsPerUint32 >= size) return false; |
| 81 Uint32 mask = 1U << (bit % kBitsPerUint32); | 53 Uint32 mask = 1U << (bit % kBitsPerUint32); |
| 82 return (bitmap_[bit / kBitsPerUint32] & mask) != 0; | 54 return (bitmap_[bit / kBitsPerUint32] & mask) != 0; |
| 83 } | 55 } |
| 84 | 56 |
| 85 } // namespace gpu | 57 } // namespace gpu |
| OLD | NEW |