OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All |
| 3 * rights reserved. |
3 * Copyright (C) 2005 Alexey Proskuryakov. | 4 * Copyright (C) 2005 Alexey Proskuryakov. |
4 * | 5 * |
5 * Redistribution and use in source and binary forms, with or without | 6 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 7 * modification, are permitted provided that the following conditions |
7 * are met: | 8 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 9 * 1. Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
10 * 2. Redistributions in binary form must reproduce the above copyright | 11 * 2. Redistributions in binary form must reproduce the above copyright |
11 * notice, this list of conditions and the following disclaimer in the | 12 * notice, this list of conditions and the following disclaimer in the |
12 * documentation and/or other materials provided with the distribution. | 13 * documentation and/or other materials provided with the distribution. |
(...skipping 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
61 unsigned shift = (m_size - 1) & bitInWordMask; | 62 unsigned shift = (m_size - 1) & bitInWordMask; |
62 unsigned index = (m_size - 1) / bitsInWord; | 63 unsigned index = (m_size - 1) / bitsInWord; |
63 return m_words[index] & (1U << shift); | 64 return m_words[index] & (1U << shift); |
64 } | 65 } |
65 | 66 |
66 unsigned BitStack::size() const { | 67 unsigned BitStack::size() const { |
67 return m_size; | 68 return m_size; |
68 } | 69 } |
69 | 70 |
70 } // namespace blink | 71 } // namespace blink |
OLD | NEW |