| OLD | NEW |
| 1 /* Copyright (c) 2010, Google Inc. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
| 2 * All rights reserved. | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 /* |
| 6 * Copyright (C) 2010 Google Inc. All rights reserved. |
| 3 * | 7 * |
| 4 * Redistribution and use in source and binary forms, with or without | 8 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 9 * modification, are permitted provided that the following conditions are |
| 6 * met: | 10 * met: |
| 7 * | 11 * |
| 8 * * Redistributions of source code must retain the above copyright | 12 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 13 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 14 * * Redistributions in binary form must reproduce the above |
| 11 * copyright notice, this list of conditions and the following disclaimer | 15 * copyright notice, this list of conditions and the following disclaimer |
| 12 * in the documentation and/or other materials provided with the | 16 * in the documentation and/or other materials provided with the |
| 13 * distribution. | 17 * distribution. |
| 14 * * Neither the name of Google Inc. nor the names of its | 18 * * Neither the name of Google Inc. nor the names of its |
| 15 * contributors may be used to endorse or promote products derived from | 19 * contributors may be used to endorse or promote products derived from |
| 16 * this software without specific prior written permission. | 20 * this software without specific prior written permission. |
| 17 * | 21 * |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 23 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 25 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 26 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 27 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 28 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 32 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 * | |
| 30 * --- | |
| 31 * Author: Chris Ruemmler | |
| 32 */ | 33 */ |
| 33 | 34 |
| 34 #ifndef BASE_AUXILIARY_SYNCHRONIZATION_PROFILING_H_ | 35 #include "content/public/test/layout_tests/WebTask.h" |
| 35 #define BASE_AUXILIARY_SYNCHRONIZATION_PROFILING_H_ | |
| 36 | 36 |
| 37 #include "base/basictypes.h" | 37 #include "third_party/WebKit/public/web/WebKit.h" |
| 38 #include <algorithm> |
| 38 | 39 |
| 39 namespace base { | 40 using namespace std; |
| 40 | 41 |
| 41 // We can do contention-profiling of SpinLocks, but the code is in | 42 namespace WebTestRunner { |
| 42 // mutex.cc, which is not always linked in with spinlock. Hence we | |
| 43 // provide a weak definition, which are used if mutex.cc isn't linked in. | |
| 44 | 43 |
| 45 // Submit the number of cycles the spinlock spent contending. | 44 WebTask::WebTask(WebTaskList* list) |
| 46 ATTRIBUTE_WEAK extern void SubmitSpinLockProfileData(const void *, int64); | 45 : m_taskList(list) |
| 47 extern void SubmitSpinLockProfileData(const void *contendedlock, | 46 { |
| 48 int64 wait_cycles) {} | 47 m_taskList->registerTask(this); |
| 49 } | 48 } |
| 50 #endif // BASE_AUXILIARY_SYNCHRONIZATION_PROFILING_H_ | 49 |
| 50 WebTask::~WebTask() |
| 51 { |
| 52 if (m_taskList) |
| 53 m_taskList->unregisterTask(this); |
| 54 } |
| 55 |
| 56 WebTaskList::WebTaskList() |
| 57 { |
| 58 } |
| 59 |
| 60 WebTaskList::~WebTaskList() |
| 61 { |
| 62 revokeAll(); |
| 63 } |
| 64 |
| 65 void WebTaskList::registerTask(WebTask* task) |
| 66 { |
| 67 m_tasks.push_back(task); |
| 68 } |
| 69 |
| 70 void WebTaskList::unregisterTask(WebTask* task) |
| 71 { |
| 72 vector<WebTask*>::iterator iter = find(m_tasks.begin(), m_tasks.end(), task)
; |
| 73 if (iter != m_tasks.end()) |
| 74 m_tasks.erase(iter); |
| 75 } |
| 76 |
| 77 void WebTaskList::revokeAll() |
| 78 { |
| 79 while (!m_tasks.empty()) |
| 80 m_tasks[0]->cancel(); |
| 81 } |
| 82 |
| 83 } |
| OLD | NEW |