| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 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 11 matching lines...) Expand all Loading... |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 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 #include "core/platform/graphics/GraphicsContextAnnotation.h" | 32 #include "platform/graphics/GraphicsContextAnnotation.h" |
| 33 | 33 |
| 34 #include "core/platform/graphics/GraphicsContext.h" | 34 #include "platform/graphics/GraphicsContext.h" |
| 35 | 35 |
| 36 namespace { | 36 namespace { |
| 37 | 37 |
| 38 const char* AnnotationKeyRendererName = "RENDERER"; | 38 const char* AnnotationKeyRendererName = "RENDERER"; |
| 39 const char* AnnotationKeyPaintPhase = "PHASE"; | 39 const char* AnnotationKeyPaintPhase = "PHASE"; |
| 40 const char* AnnotationKeyElementId = "ID"; | 40 const char* AnnotationKeyElementId = "ID"; |
| 41 const char* AnnotationKeyElementClass = "CLASS"; | 41 const char* AnnotationKeyElementClass = "CLASS"; |
| 42 const char* AnnotationKeyElementTag = "TAG"; | 42 const char* AnnotationKeyElementTag = "TAG"; |
| 43 | 43 |
| 44 } | 44 } |
| (...skipping 23 matching lines...) Expand all Loading... |
| 68 list.append(std::make_pair(AnnotationKeyElementId, m_elementId)); | 68 list.append(std::make_pair(AnnotationKeyElementId, m_elementId)); |
| 69 | 69 |
| 70 if (!m_elementClass.isEmpty()) | 70 if (!m_elementClass.isEmpty()) |
| 71 list.append(std::make_pair(AnnotationKeyElementClass, m_elementClass)); | 71 list.append(std::make_pair(AnnotationKeyElementClass, m_elementClass)); |
| 72 | 72 |
| 73 if (!m_elementTag.isEmpty()) | 73 if (!m_elementTag.isEmpty()) |
| 74 list.append(std::make_pair(AnnotationKeyElementTag, m_elementTag)); | 74 list.append(std::make_pair(AnnotationKeyElementTag, m_elementTag)); |
| 75 } | 75 } |
| 76 | 76 |
| 77 } | 77 } |
| OLD | NEW |