llx_scx_test.cc 5 KB
Newer Older
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
/*
 * Copyright (c) 2014-2015, Siemens AG. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include <llx_scx_test.h>
#include <embb/containers/internal/fixed_size_list.h>
29
#include <embb/containers/internal/llx_scx.h>
30 31 32 33 34 35

namespace embb {
namespace containers {
namespace test {

using embb::containers::internal::FixedSizeList;
36 37
using embb::containers::internal::LlxScxRecord;
using embb::containers::internal::LlxScx;
38 39

LlxScxTest::LlxScxTest() :
40
  num_threads_(
41 42 43 44
    static_cast<int>(partest::TestSuite::GetDefaultNumThreads())),
  llxscx_(3),
  tail(0, '-'),
  head(0, '-', Node::node_ptr_t(&tail)) {
45 46
  CreateUnit("SerialArrayTest").Add(&LlxScxTest::SerialArrayTest, this);
  CreateUnit("SerialListTest").Add(&LlxScxTest::SerialListTest, this);
47 48 49 50 51 52 53 54 55 56 57 58
  CreateUnit("ParallelTest").Add(&LlxScxTest::ParallelTest, this);
}

void LlxScxTest::ParallelTest() {
  typedef LlxScxTest::Node Node;

  unsigned int thread_index;
  int return_val = embb_internal_thread_index(&thread_index);
  if (return_val != EMBB_SUCCESS)
    EMBB_THROW(embb::base::ErrorException, "Could not get thread id!");
  
  // Threads try to append n nodes to a linked list in parallel
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
void LlxScxTest::SerialArrayTest() {
  typedef int Payload;
  typedef embb::base::Atomic<size_t> AtomicField;
  // LLX/SCX with maximum of 3 active load-links in every thread:
  LlxScx<Payload> llxscx(3);

  // Atomic<size_t> not assignable, TryStoreConditional requires
  // a specialization for atomics that uses a.Store(b.Load()).
  AtomicField field(23);
  // Initialize 
  LlxScxRecord< Payload > * my_list =
    new LlxScxRecord<Payload>[10];
  for (int i = 0; i != 10; ++i) {
    my_list[i] = i;
  }

  Payload l1, l2;
  PT_ASSERT(llxscx.TryLoadLinked(&my_list[0], l1));
  PT_ASSERT(llxscx.TryLoadLinked(&my_list[5], l2));

  FixedSizeList< LlxScxRecord<Payload> * >
    links(2);
  links.PushBack(&my_list[0]);
  links.PushBack(&my_list[5]);

  // Try to store new value depending on links:
  size_t a = 42;
  PT_ASSERT(llxscx.TryStoreConditional(&field, a, links));
  // New value should have been changed successfully:
  PT_ASSERT_EQ(field.Load(), a);
}

void LlxScxTest::SerialListTest() {
94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112
  typedef LlxScxTest::Node Node;
  // Global:
  LlxScx<Node> llxscx(3);

  // Multiset { a, b, b, c }
  Node n1(1, 'a');
  Node n2(2, 'b');
  Node n3(1, 'c');
  
  // V = { dr1, dr2, dr3 }
  // R = { dr1, dr2 }
  LlxScxRecord<Node> dr1(n1);
  LlxScxRecord<Node> dr2(n2);
  LlxScxRecord<Node> dr3(n3);

  dr1->next_.Store(&dr2);
  dr2->next_.Store(&dr3);

  // Thread-local:
113
  Node l1, l2, l3;
114 115 116
  bool finalized;
  PT_ASSERT(llxscx.TryLoadLinked(&dr1, l1, finalized));
  PT_ASSERT(!finalized);
117
  PT_ASSERT_EQ(l1.value_, dr1->value_);
118 119
  PT_ASSERT(llxscx.TryLoadLinked(&dr2, l2, finalized));
  PT_ASSERT(!finalized);
120
  PT_ASSERT_EQ(l2.value_, dr2->value_);
121 122
  PT_ASSERT(llxscx.TryLoadLinked(&dr3, l3, finalized));
  PT_ASSERT(!finalized);
123
  PT_ASSERT_EQ(l3.value_, dr3->value_);
124

125
  FixedSizeList< LlxScxRecord<Node> * >
126 127 128 129 130 131 132 133 134 135 136 137 138
    linked_deps(3);
  linked_deps.PushBack(&dr1);
  linked_deps.PushBack(&dr2);
  linked_deps.PushBack(&dr3);
  FixedSizeList< LlxScxRecord<Node> * >
    finalize_deps(2);
  finalize_deps.PushBack(&dr2);
  finalize_deps.PushBack(&dr3);

  typedef LlxScxRecord<Node> * field_t;
  
  LlxScxRecord<Node> new_node(n3);
  PT_ASSERT(
139
    llxscx.TryStoreConditional(
140 141 142 143 144
      &n2.next_,     // fld: field to update
      &new_node,     // new value
      linked_deps,   // V: dependencies, must be LL'd before
      finalize_deps  // R: Subsequence of V to be finalized
    ));
145 146 147 148 149 150
  // Following LLX calls on finalized data records are
  // expected to fail:
  PT_ASSERT(!llxscx.TryLoadLinked(&dr2, l2, finalized));
  PT_ASSERT(finalized);
  PT_ASSERT(!llxscx.TryLoadLinked(&dr3, l3, finalized));
  PT_ASSERT(finalized);
151 152 153 154 155
}

} // namespace test
} // namespace containers
} // namespace embb