OLD | NEW |
1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 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 313 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
324 state != NULL; | 324 state != NULL; |
325 state = state->Next()) { | 325 state = state->Next()) { |
326 char* data = state->data(); | 326 char* data = state->data(); |
327 data = HandleScopeImplementer::Iterate(v, data); | 327 data = HandleScopeImplementer::Iterate(v, data); |
328 data = Top::Iterate(v, data); | 328 data = Top::Iterate(v, data); |
329 data = Relocatable::Iterate(v, data); | 329 data = Relocatable::Iterate(v, data); |
330 } | 330 } |
331 } | 331 } |
332 | 332 |
333 | 333 |
| 334 void ThreadManager::IterateThreads(ThreadVisitor* v) { |
| 335 for (ThreadState* state = ThreadState::FirstInUse(); |
| 336 state != NULL; |
| 337 state = state->Next()) { |
| 338 char* data = state->data(); |
| 339 data += HandleScopeImplementer::ArchiveSpacePerThread(); |
| 340 Top::IterateThread(v, data); |
| 341 } |
| 342 } |
| 343 |
| 344 |
334 void ThreadManager::MarkCompactPrologue(bool is_compacting) { | 345 void ThreadManager::MarkCompactPrologue(bool is_compacting) { |
335 for (ThreadState* state = ThreadState::FirstInUse(); | 346 for (ThreadState* state = ThreadState::FirstInUse(); |
336 state != NULL; | 347 state != NULL; |
337 state = state->Next()) { | 348 state = state->Next()) { |
338 char* data = state->data(); | 349 char* data = state->data(); |
339 data += HandleScopeImplementer::ArchiveSpacePerThread(); | 350 data += HandleScopeImplementer::ArchiveSpacePerThread(); |
340 Top::MarkCompactPrologue(is_compacting, data); | 351 Top::MarkCompactPrologue(is_compacting, data); |
341 } | 352 } |
342 } | 353 } |
343 | 354 |
(...skipping 97 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
441 // Acknowledge the preemption by the receiving thread. | 452 // Acknowledge the preemption by the receiving thread. |
442 void ContextSwitcher::PreemptionReceived() { | 453 void ContextSwitcher::PreemptionReceived() { |
443 ASSERT(Locker::IsLocked()); | 454 ASSERT(Locker::IsLocked()); |
444 // There is currently no accounting being done for this. But could be in the | 455 // There is currently no accounting being done for this. But could be in the |
445 // future, which is why we leave this in. | 456 // future, which is why we leave this in. |
446 } | 457 } |
447 | 458 |
448 | 459 |
449 } // namespace internal | 460 } // namespace internal |
450 } // namespace v8 | 461 } // namespace v8 |
OLD | NEW |