MIPS32r2: Fix Chromium runtime crash

tests/MemsetTest.cpp

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkChunkAlloc.h"
+#include "SkRandom.h"
 #include "SkUtils.h"
 #include "Test.h"
 
 static void check_alloc(skiatest::Reporter* reporter, const SkChunkAlloc& alloc,
                         size_t capacity, size_t used, int numBlocks) {
     REPORTER_ASSERT(reporter, alloc.totalCapacity() >= capacity);
     REPORTER_ASSERT(reporter, alloc.totalUsed() == used);
     SkDEBUGCODE(REPORTER_ASSERT(reporter, alloc.blockCount() == numBlocks);)
 }
 
 static void* simple_alloc(skiatest::Reporter* reporter, SkChunkAlloc* alloc, size_t size) {
     void* ptr = alloc->allocThrow(size);
     check_alloc(reporter, *alloc, size, size, 1);
     REPORTER_ASSERT(reporter, alloc->contains(ptr));
     return ptr;
 }
 
+static void check_alloc_alignment(skiatest::Reporter* reporter,
+                                  SkChunkAlloc* alloc, size_t size) {
+    const size_t kAlignment = 8;
+    void* ptr = alloc->allocThrow(size);
+    REPORTER_ASSERT(reporter, ptr != nullptr);
+    REPORTER_ASSERT(reporter, (size_t)ptr % kAlignment == 0);
+}
+
 static void test_chunkalloc(skiatest::Reporter* reporter) {
     static const size_t kMin = 1024;
     SkChunkAlloc alloc(kMin);
 
     //------------------------------------------------------------------------
     // check empty
     check_alloc(reporter, alloc, 0, 0, 0);
     REPORTER_ASSERT(reporter, !alloc.contains(nullptr));
     REPORTER_ASSERT(reporter, !alloc.contains(reporter));
 
@@ skipping 33 matching lines @@
     ptr = alloc.allocThrow(kMin);
     check_alloc(reporter, alloc, 2*kMin, size+kMin, 2);
     REPORTER_ASSERT(reporter, alloc.contains(ptr));
 
     //------------------------------------------------------------------------
     // test out unalloc
     size_t freed = alloc.unalloc(ptr);
     REPORTER_ASSERT(reporter, freed == kMin);
     check_alloc(reporter, alloc, 2*kMin, size, 2);
     REPORTER_ASSERT(reporter, !alloc.contains(ptr));
+
+    //------------------------------------------------------------------------
+    // test the alignment
+    alloc.reset();
+    SkRandom rand;
+    for (int i = 0; i < 1000; i++) {
+        check_alloc_alignment(reporter, &alloc, rand.nextU16());
+    }
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 
 static void set_zero(void* dst, size_t bytes) {
     char* ptr = (char*)dst;
     for (size_t i = 0; i < bytes; ++i) {
         ptr[i] = 0;
     }
 }
@@ skipping 64 matching lines @@
  *  Test sk_memset16 and sk_memset32.
  *  For performance considerations, implementations may take different paths
  *  depending on the alignment of the dst, and/or the size of the count.
  */
 DEF_TEST(Memset, reporter) {
     test_16(reporter);
     test_32(reporter);
 
     test_chunkalloc(reporter);
 }