File: vector_alloca.cc

package info (click to toggle)
chromium-browser 57.0.2987.98-1~deb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 2,637,852 kB
  • ctags: 2,544,394
  • sloc: cpp: 12,815,961; ansic: 3,676,222; python: 1,147,112; asm: 526,608; java: 523,212; xml: 286,794; perl: 92,654; sh: 86,408; objc: 73,271; makefile: 27,698; cs: 18,487; yacc: 13,031; tcl: 12,957; pascal: 4,875; ml: 4,716; lex: 3,904; sql: 3,862; ruby: 1,982; lisp: 1,508; php: 1,368; exp: 404; awk: 325; csh: 117; jsp: 39; sed: 37
file content (93 lines) | stat: -rw-r--r-- 3,044 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
 * Copyright (c) 2014 The Native Client Authors. All rights reserved.
 * Use of this source code is governed by a BSD-style license that can be
 * found in the LICENSE file.
 */

/*
 * Make sure that all vector types supported by PNaCl can be stack allocated.
 */

#include "native_client/tests/simd/vector.h"
#include <alloca.h>

volatile size_t NumRecursions = 32;

typedef void (*Recurse)(volatile void *, volatile void *, size_t);

// This function calls itself recursively (through a volatile pointer to avoid
// tail recursion optimization), overallocating space with alloca and copying
// the vector on the stack until there isn't any overallocation. It then simply
// prints out the vector.
template <size_t NumElements, typename T>
NOINLINE void test_alloca(volatile void *fn, volatile void *buf,
                          size_t overallocate) {
  typedef typename VectorHelper<NumElements, T>::VectorAligned VectorAligned;
  typedef typename VectorHelper<NumElements, T>::Unaligned VectorUnaligned;
  Recurse self = (Recurse)fn;
  if (overallocate > 1) {
    // Alloca doesn't guarantee alignment.
    VectorUnaligned *a =
        (VectorUnaligned *)alloca(NumElements * sizeof(T) * overallocate);
    VectorAligned *v = (VectorAligned *)buf;
    a[overallocate - 1] = *v;
    (*self)(fn, &a[overallocate - 1], overallocate - 1);
  } else {
    T *t = (T *)buf;
    std::cout << "  ";
    print_vector<NumElements, T>(t);
    std::cout << '\n';
  }
}

// Setup the memory which will hold the vector data. Align memory to the vector
// size. The test can then offset from this to get unaligned vectors.
template <size_t NumElements, typename T>
NOINLINE void *setup(void *arg) {
  volatile Test *t = (volatile Test *)arg;

  // Allocate the input buffer.
  T **buf_ptr = (T **)&t->bufs[Test::InBuf0];
  size_t vectorBytes = NumElements * sizeof(T);
  int ret = posix_memalign((void **)buf_ptr, vectorBytes, vectorBytes);
  CHECK(ret == 0);
  CHECK(((uintptr_t)*buf_ptr & ~(uintptr_t)(vectorBytes - 1)) ==
        (uintptr_t)*buf_ptr);  // Check alignment.

  // Initialize the in buffer.
  Rng r;
  T *buf = *(T **)&t->bufs[Test::InBuf0];
  pseudoRandomInit(&r, buf, NumElements);
  std::cout << "  ";
  print_vector<NumElements, T>(buf);
  std::cout << '\n';

  return NULL;
}

template <size_t NumElements, typename T>
NOINLINE void *test(void *arg) {
  volatile Test *t = (volatile Test *)arg;
  volatile void *buf = *(void **)&t->bufs[Test::InBuf0];
  volatile void *fn = (void *)&test_alloca<NumElements, T>;
  test_alloca<NumElements, T>(fn, buf, NumRecursions);
  return NULL;
}

NOINLINE void *check(void *arg) {
  (void)arg;
  return NULL;
}

NOINLINE void *cleanup(void *arg) {
  volatile Test *t = (volatile Test *)arg;
  free(t->bufs[Test::InBuf0]);
  return NULL;
}

#define SETUP_TEST(N, T, FMT)                                \
  {{&setup<N, T>, &test<N, T>, &check, &cleanup},            \
    {NULL, NULL, NULL}, "<" #N " x " #T ">"},
volatile Test tests[] = {FOR_EACH_VECTOR_TYPE(SETUP_TEST)};

DEFINE_MAIN(tests)