Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(490)

Side by Side Diff: src/trusted/validator_arm/address_set.h

Issue 7799013: Intial Thumb2 Sandbox (naclrev 6680) Base URL: svn://svn.chromium.org/native_client/trunk/src/native_client
Patch Set: fix comma Created 9 years, 3 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 /* 1 /*
2 * Copyright 2009 The Native Client Authors. All rights reserved. 2 * Copyright 2009 The Native Client Authors. All rights reserved.
bsy 2011/09/21 22:32:17 11
3 * Use of this source code is governed by a BSD-style license that can 3 * Use of this source code is governed by a BSD-style license that can
4 * be found in the LICENSE file. 4 * be found in the LICENSE file.
5 * Copyright 2009, Google Inc. 5 * Copyright 2009, Google Inc.
6 */ 6 */
7 7
8 #ifndef NATIVE_CLIENT_SRC_TRUSTED_VALIDATOR_ARM_V2_ADDRESS_SET_H 8 #ifndef NATIVE_CLIENT_SRC_TRUSTED_VALIDATOR_ARM_V2_ADDRESS_SET_H
9 #define NATIVE_CLIENT_SRC_TRUSTED_VALIDATOR_ARM_V2_ADDRESS_SET_H 9 #define NATIVE_CLIENT_SRC_TRUSTED_VALIDATOR_ARM_V2_ADDRESS_SET_H
10 10
11 #include <stdint.h> 11 #include <stdint.h>
12 12
13 namespace nacl_arm_val { 13 namespace nacl_arm_val {
14 14
15 /* 15 /*
16 * A set of word addresses, implemented as a dense bitset. 16 * A set of word addresses, implemented as a dense bitset.
17 * 17 *
18 * An AddressSet has a base address and a size, in bytes, of the space to 18 * An AddressSet has a base address and a size, in bytes, of the space to
19 * describe. Describing N bytes costs N/32 bytes here, since we only record 19 * describe. Describing N bytes costs N/16 bytes here, since we only record
20 * word addresses (4-byte alignment) and pack 8 per byte. 20 * half-word addresses (2-byte alignment) and pack 8 per byte.
21 * 21 *
22 * Thus, an AddressSet covering the entire 256MB code region costs 8MB, plus 22 * Thus, an AddressSet covering the entire 256MB code region costs 16MB, plus
23 * a small constant overhead (~16 bytes). 23 * a small constant overhead (~16 bytes).
24 */ 24 */
25 class AddressSet { 25 class AddressSet {
26 public: 26 public:
27 /* 27 /*
28 * Creates an AddressSet describing 'size' bytes starting at 'base'. 28 * Creates an AddressSet describing 'size' bytes starting at 'base'.
29 */ 29 */
30 AddressSet(uint32_t base, uint32_t size); 30 AddressSet(uint32_t base, uint32_t size);
31 ~AddressSet(); 31 ~AddressSet();
32 32
33 /* 33 /*
34 * Adds an address to the set. 34 * Adds an address to the set.
35 * - If the address is already in the set, nothing changes. 35 * - If the address is already in the set, nothing changes.
36 * - If the address is outside of this set's range (delimited by base and size 36 * - If the address is outside of this set's range (delimited by base and size
37 * provided at construction), nothing changes. 37 * provided at construction), nothing changes.
38 * - If the address is not 4-byte aligned, the address of the 4-byte word 38 * - If the address is not 4-byte aligned, the address of the 4-byte word
Karl 2011/09/19 19:56:05 Doesn't this conflict with the 2-byte alignment co
39 * containing the address is added instead. 39 * containing the address is added instead.
40 */ 40 */
41 void add(uint32_t address); 41 void add(uint32_t address);
42 42
43 /* 43 /*
44 * Checks whether the AddressSet contains an address. If the address is not 44 * Checks whether the AddressSet contains an address. If the address is not
45 * 4-byte aligned, the address of the 4-byte word containing the address is 45 * 4-byte aligned, the address of the 4-byte word containing the address is
Karl 2011/09/19 19:56:05 Similar question here.
jasonwkim 2011/09/26 21:35:52 both fixed
46 * checked instead. 46 * checked instead.
47 */ 47 */
48 bool contains(uint32_t address) const; 48 bool contains(uint32_t address) const;
49 49
50 class Iterator { 50 class Iterator {
51 public: 51 public:
52 Iterator(const AddressSet &, uint32_t index, uint32_t shift); 52 Iterator(const AddressSet &, uint32_t index, uint32_t shift);
53 Iterator &operator++(); 53 Iterator &operator++();
54 bool operator!=(const Iterator &) const; 54 bool operator!=(const Iterator &) const;
55 uint32_t operator*() const; 55 uint32_t operator*() const;
(...skipping 15 matching lines...) Expand all
71 uint32_t * const bits_; 71 uint32_t * const bits_;
72 72
73 // Disallow copies - we don't need them, and don't want to refcount bits_. 73 // Disallow copies - we don't need them, and don't want to refcount bits_.
74 AddressSet(const AddressSet &); 74 AddressSet(const AddressSet &);
75 AddressSet &operator=(const AddressSet &); 75 AddressSet &operator=(const AddressSet &);
76 }; 76 };
77 77
78 } // namespace 78 } // namespace
79 79
80 #endif // NATIVE_CLIENT_SRC_TRUSTED_VALIDATOR_ARM_V2_ADDRESS_SET_H 80 #endif // NATIVE_CLIENT_SRC_TRUSTED_VALIDATOR_ARM_V2_ADDRESS_SET_H
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698