From 26f3e0f290f317b88248c7e5c6a98e2a6c8d64fa Mon Sep 17 00:00:00 2001
From: Debian Qt/KDE Maintainers <debian-qt-kde@lists.debian.org>
Date: Tue, 22 Aug 2017 12:35:55 +0100
Subject: [PATCH] _sparc_unaligned_access

Gbp-Pq: Name 05_sparc_unaligned_access.diff
---
 Source/WTF/wtf/ListHashSet.h | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)

diff --git a/Source/WTF/wtf/ListHashSet.h b/Source/WTF/wtf/ListHashSet.h
index 78639b40..fe67f48b 100644
--- a/Source/WTF/wtf/ListHashSet.h
+++ b/Source/WTF/wtf/ListHashSet.h
@@ -173,7 +173,7 @@ namespace WTF {
             : m_freeList(pool())
             , m_isDoneWithInitialFreeList(false)
         { 
-            memset(m_pool.pool, 0, sizeof(m_pool.pool));
+            memset(m_pool, 0, sizeof(m_pool));
         }
 
         Node* allocate()
@@ -217,7 +217,7 @@ namespace WTF {
         }
 
     private:
-        Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.pool); }
+        Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool); }
         Node* pastPool() { return pool() + m_poolSize; }
         bool inPool(Node* node)
         {
@@ -227,10 +227,7 @@ namespace WTF {
         Node* m_freeList;
         bool m_isDoneWithInitialFreeList;
         static const size_t m_poolSize = inlineCapacity;
-        union {
-            char pool[sizeof(Node) * m_poolSize];
-            double forAlignment;
-        } m_pool;
+        uint32_t m_pool[(sizeof(Node) * m_poolSize + sizeof(uint32_t) - 1) / sizeof(uint32_t)];
     };
 
     template<typename ValueArg, size_t inlineCapacity> struct ListHashSetNode {
-- 
2.30.2