1 | /* |
2 | * Copyright (C) 2019 Apple Inc. All rights reserved. |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions |
6 | * are met: |
7 | * 1. Redistributions of source code must retain the above copyright |
8 | * notice, this list of conditions and the following disclaimer. |
9 | * 2. Redistributions in binary form must reproduce the above copyright |
10 | * notice, this list of conditions and the following disclaimer in the |
11 | * documentation and/or other materials provided with the distribution. |
12 | * |
13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' |
14 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
15 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
17 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
18 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
19 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
20 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
21 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
22 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
23 | * THE POSSIBILITY OF SUCH DAMAGE. |
24 | */ |
25 | |
26 | #pragma once |
27 | |
28 | #include "ArrayStorage.h" |
29 | #include "StructureInlines.h" |
30 | |
31 | namespace JSC { |
32 | |
33 | inline unsigned ArrayStorage::availableVectorLength(unsigned indexBias, Structure* structure, unsigned vectorLength) |
34 | { |
35 | return availableVectorLength(indexBias, structure->outOfLineCapacity(), vectorLength); |
36 | } |
37 | |
38 | inline unsigned ArrayStorage::availableVectorLength(size_t propertyCapacity, unsigned vectorLength) |
39 | { |
40 | return availableVectorLength(m_indexBias, propertyCapacity, vectorLength); |
41 | } |
42 | |
43 | inline unsigned ArrayStorage::availableVectorLength(Structure* structure, unsigned vectorLength) |
44 | { |
45 | return availableVectorLength(structure->outOfLineCapacity(), vectorLength); |
46 | } |
47 | |
48 | inline unsigned ArrayStorage::optimalVectorLength(unsigned indexBias, size_t propertyCapacity, unsigned vectorLength) |
49 | { |
50 | vectorLength = std::max(BASE_ARRAY_STORAGE_VECTOR_LEN, vectorLength); |
51 | return availableVectorLength(indexBias, propertyCapacity, vectorLength); |
52 | } |
53 | |
54 | inline unsigned ArrayStorage::optimalVectorLength(unsigned indexBias, Structure* structure, unsigned vectorLength) |
55 | { |
56 | return optimalVectorLength(indexBias, structure->outOfLineCapacity(), vectorLength); |
57 | } |
58 | |
59 | inline unsigned ArrayStorage::optimalVectorLength(size_t propertyCapacity, unsigned vectorLength) |
60 | { |
61 | return optimalVectorLength(m_indexBias, propertyCapacity, vectorLength); |
62 | } |
63 | |
64 | inline unsigned ArrayStorage::optimalVectorLength(Structure* structure, unsigned vectorLength) |
65 | { |
66 | return optimalVectorLength(structure->outOfLineCapacity(), vectorLength); |
67 | } |
68 | |
69 | inline size_t ArrayStorage::totalSize(Structure* structure) const |
70 | { |
71 | return totalSize(structure->outOfLineCapacity()); |
72 | } |
73 | |
74 | } // namespace JSC |
75 | |