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

Side by Side Diff: runtime/lib/expando_patch.dart

Issue 17992002: - Add a WeakTable to the VM. This is used to remember the (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/
Patch Set: Created 7 years, 5 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
« no previous file with comments | « no previous file | runtime/lib/object.cc » ('j') | runtime/vm/gc_marker.cc » ('J')
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 patch class Expando<T> { 5 patch class Expando<T> {
6 /* patch */ Expando([this.name]) : _data = new List(); 6 /* patch */ Expando([this.name])
7 : _data = new List(_minSize),
8 _used = 0;
9
10 static const _minSize = 8;
11 static final _deletedEntry = new _WeakProperty(null, null);
7 12
8 /* patch */ T operator[](Object object) { 13 /* patch */ T operator[](Object object) {
9 _checkType(object); 14 _checkType(object);
10 var doCompact = false; 15
11 var result = null; 16 var mask = _size - 1;
12 for (int i = 0; i < _data.length; ++i) { 17 var idx = object.hashCode & mask;
13 var key = _data[i].key; 18 var wp = _data[idx];
14 if (identical(key, object)) { 19
15 result = _data[i].value; 20 while (wp != null) {
16 break; 21 if (identical(wp.key, object)) {
22 return wp.value;
23 } else if (wp.key == null) {
24 // This entry has been cleared by the GC.
25 _data[idx] = _deletedEntry;
17 } 26 }
18 if (key == null) { 27 idx = (idx + 1) & mask;
19 doCompact = true; 28 wp = _data[idx];
20 _data[i] = null;
21 }
22 } 29 }
23 if (doCompact) { 30
24 _data = _data.where((e) => (e != null)).toList(); 31 return null;
25 }
26 return result;
27 } 32 }
28 33
29 /* patch */ void operator[]=(Object object, T value) { 34 /* patch */ void operator[]=(Object object, T value) {
30 _checkType(object); 35 _checkType(object);
31 var doCompact = false; 36
32 int i = 0; 37 var mask = _size - 1;
33 for (; i < _data.length; ++i) { 38 var idx = object.hashCode & mask;
34 var key = _data[i].key; 39 var empty_idx = -1;
35 if (identical(key, object)) { 40 var wp = _data[idx];
36 break; 41
42 while (wp != null) {
43 if (identical(wp.key, object)) {
44 if (value != null) {
45 // Update the associated value.
46 wp.value = value;
47 } else {
48 // Mark the entry as deleted.
49 _data[idx] = _deletedEntry;
50 }
51 return;
52 } else if ((empty_idx < 0) && identical(wp, _deletedEntry)) {
53 empty_idx = idx; // Insert at this location if not found.
54 } else if (wp.key == null) {
55 // This entry has been cleared by the GC.
56 _data[idx] = _deletedEntry;
57 if (empty_idx < 0) {
58 empty_idx = idx; // Insert at this location if not found.
59 }
37 } 60 }
38 if (key == null) { 61 idx = (idx + 1) & mask;
39 doCompact = true; 62 wp = _data[idx];
40 _data[i] = null; 63 }
64
65 if (value == null) {
66 // Not entering a null value. We just needed to make sure to find
siva 2013/06/27 22:11:33 This comment seems incomplete.
Ivan Posva 2013/06/27 23:59:12 Done.
67 return;
68 }
69
70 if (empty_idx >= 0) {
71 // We will be reusing the empty slot below.
72 _used--;
73 idx = empty_idx;
74 }
75
76 if (_used < _limit) {
77 _data[idx] = new _WeakProperty(object, value);
78 _used++;
79 return;
80 }
81
82 // Grow/reallocate if too many slots have been used.
83 _rehash();
84 this[object] = value; // Recursively add the value.
85 }
86
87 _rehash() {
88 // Determine the population count of the map to allocate an appropriately
89 // sized map below.
90 var count = 0;
91 var old_data = _data;
92 var len = old_data.length;
93 for (var i = 0; i < len; i++) {
94 var entry = old_data[i];
95 if ((entry != null) && (entry.key != null)) {
96 // Only count non-cleared entries.
97 count++;
41 } 98 }
42 } 99 }
43 if (i != _data.length && value == null) { 100
44 doCompact = true; 101 var new_size = _size;
45 _data[i] = null; 102 if (count <= (new_size >> 2)) {
46 } else if (i != _data.length) { 103 new_size = new_size >> 1;
47 _data[i].value = value; 104 } else if (count > (new_size >> 1)) {
48 } else { 105 new_size = new_size << 1;
49 _data.add(new _WeakProperty(object, value));
50 } 106 }
51 if (doCompact) { 107 new_size = (new_size < _minSize) ? _minSize : new_size;
52 _data = _data.where((e) => (e != null)).toList(); 108
109 // Reset the mappings to empty so that we can just add the existing
110 // valid entries.
111 _data = new List(new_size);
112 _used = 0;
113
114 for (var i = 0; i < old_data.length; i++) {
115 var entry = old_data[i];
116 if ((entry != null) && (entry.key != null)) {
117 this[entry.key] = entry.value;
118 }
53 } 119 }
54 } 120 }
55 121
56 static _checkType(object) { 122 static _checkType(object) {
57 if (object == null || object is bool || object is num || object is String) { 123 if ((object == null) ||
124 (object is bool) ||
125 (object is num) ||
126 (object is String)) {
58 throw new ArgumentError(object); 127 throw new ArgumentError(object);
59 } 128 }
60 } 129 }
61 130
131 get _size => _data.length;
132 get _limit => (3 * (_size ~/ 4));
133
62 List _data; 134 List _data;
135 int _used; // Number of used (active and deleted) slots.
63 } 136 }
OLDNEW
« no previous file with comments | « no previous file | runtime/lib/object.cc » ('j') | runtime/vm/gc_marker.cc » ('J')

Powered by Google App Engine
This is Rietveld 408576698