OLD | NEW |
---|---|
1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 137 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
148 // avoid getting stuck with zero bits in hi or lo by re-initializing | 148 // avoid getting stuck with zero bits in hi or lo by re-initializing |
149 // them on demand. | 149 // them on demand. |
150 if (hi == 0) hi = random(); | 150 if (hi == 0) hi = random(); |
151 if (lo == 0) lo = random(); | 151 if (lo == 0) lo = random(); |
152 | 152 |
153 // Mix the bits. | 153 // Mix the bits. |
154 hi = 36969 * (hi & 0xFFFF) + (hi >> 16); | 154 hi = 36969 * (hi & 0xFFFF) + (hi >> 16); |
155 lo = 18273 * (lo & 0xFFFF) + (lo >> 16); | 155 lo = 18273 * (lo & 0xFFFF) + (lo >> 16); |
156 return (hi << 16) + (lo & 0xFFFF); | 156 return (hi << 16) + (lo & 0xFFFF); |
157 } | 157 } |
158 | 158 |
Kasper Lund
2009/08/20 07:20:25
Two newlines between function definitions?
| |
159 void V8::IdleNotification(bool is_high_priority) { | 159 void V8::IdleNotification(bool is_high_priority) { |
160 // todo(bak): Reduce memory footprint. | 160 if (!FLAG_use_idle_notification) return; |
161 // Ignore high priority instances of V8. | |
162 if (is_high_priority) return; | |
163 | |
164 // Uncommit unused memory in new space. | |
165 Heap::UncommitFromSpace(); | |
161 } | 166 } |
162 | 167 |
163 | 168 |
164 Smi* V8::RandomPositiveSmi() { | 169 Smi* V8::RandomPositiveSmi() { |
165 uint32_t random = Random(); | 170 uint32_t random = Random(); |
166 ASSERT(IsPowerOf2(Smi::kMaxValue + 1)); | 171 ASSERT(IsPowerOf2(Smi::kMaxValue + 1)); |
167 return Smi::FromInt(random & Smi::kMaxValue); | 172 return Smi::FromInt(random & Smi::kMaxValue); |
168 } | 173 } |
169 | 174 |
170 } } // namespace v8::internal | 175 } } // namespace v8::internal |
OLD | NEW |