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 the FencedAllocator class. | 5 // This file contains the implementation of the FencedAllocator class. |
34 | 6 |
35 #include "gpu/command_buffer/client/fenced_allocator.h" | 7 #include "gpu/command_buffer/client/fenced_allocator.h" |
36 #include <algorithm> | 8 #include <algorithm> |
37 #include "gpu/command_buffer/client/cmd_buffer_helper.h" | 9 #include "gpu/command_buffer/client/cmd_buffer_helper.h" |
38 | 10 |
39 namespace gpu { | 11 namespace gpu { |
40 | 12 |
41 #ifndef COMPILER_MSVC | 13 #ifndef COMPILER_MSVC |
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
205 // The blocks are in offset order, so we can do a binary search. | 177 // The blocks are in offset order, so we can do a binary search. |
206 FencedAllocator::BlockIndex FencedAllocator::GetBlockByOffset(Offset offset) { | 178 FencedAllocator::BlockIndex FencedAllocator::GetBlockByOffset(Offset offset) { |
207 Block templ = { IN_USE, offset, 0, kUnusedToken }; | 179 Block templ = { IN_USE, offset, 0, kUnusedToken }; |
208 Container::iterator it = std::lower_bound(blocks_.begin(), blocks_.end(), | 180 Container::iterator it = std::lower_bound(blocks_.begin(), blocks_.end(), |
209 templ, OffsetCmp()); | 181 templ, OffsetCmp()); |
210 DCHECK(it != blocks_.end() && it->offset == offset); | 182 DCHECK(it != blocks_.end() && it->offset == offset); |
211 return it-blocks_.begin(); | 183 return it-blocks_.begin(); |
212 } | 184 } |
213 | 185 |
214 } // namespace gpu | 186 } // namespace gpu |
OLD | NEW |