| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "config.h" | 31 #include "config.h" |
| 32 | 32 |
| 33 #if ENABLE(INSPECTOR) | |
| 34 | 33 |
| 35 #include "HeapGraphSerializer.h" | 34 #include "HeapGraphSerializer.h" |
| 36 | 35 |
| 37 #include "WebCoreMemoryInstrumentation.h" | 36 #include "WebCoreMemoryInstrumentation.h" |
| 38 #include <wtf/MemoryInstrumentationHashMap.h> | 37 #include <wtf/MemoryInstrumentationHashMap.h> |
| 39 #include <wtf/MemoryInstrumentationVector.h> | 38 #include <wtf/MemoryInstrumentationVector.h> |
| 40 #include <wtf/MemoryObjectInfo.h> | 39 #include <wtf/MemoryObjectInfo.h> |
| 41 #include <wtf/text/CString.h> | 40 #include <wtf/text/CString.h> |
| 42 #include <wtf/text/WTFString.h> | 41 #include <wtf/text/WTFString.h> |
| 43 | 42 |
| (...skipping 201 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 245 | 244 |
| 246 m_nodes->addItem(registerString("Root")); | 245 m_nodes->addItem(registerString("Root")); |
| 247 m_nodes->addItem(0); | 246 m_nodes->addItem(0); |
| 248 m_nodes->addItem(s_firstNodeId + m_address2NodeIdMap.size() + m_leafCount); | 247 m_nodes->addItem(s_firstNodeId + m_address2NodeIdMap.size() + m_leafCount); |
| 249 m_nodes->addItem(0); | 248 m_nodes->addItem(0); |
| 250 m_nodes->addItem(m_roots.size()); | 249 m_nodes->addItem(m_roots.size()); |
| 251 } | 250 } |
| 252 | 251 |
| 253 } // namespace WebCore | 252 } // namespace WebCore |
| 254 | 253 |
| 255 #endif // ENABLE(INSPECTOR) | |
| OLD | NEW |