forked from intel/llvm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsmemll.cpp
More file actions
85 lines (69 loc) · 2.01 KB
/
smemll.cpp
File metadata and controls
85 lines (69 loc) · 2.01 KB
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
// piextUSM*Alloc functions for CUDA are not behaving as described in
// https://github.com/intel/llvm/blob/sycl/sycl/doc/extensions/USM/USM.adoc
// https://github.com/intel/llvm/blob/sycl/sycl/doc/extensions/USM/cl_intel_unified_shared_memory.asciidoc
//
// RUN: %clangxx -fsycl -fsycl-targets=%sycl_triple %s -o %t1.out
// RUN: env SYCL_DEVICE_TYPE=HOST %t1.out
// RUN: %CPU_RUN_PLACEHOLDER %t1.out
// RUN: %GPU_RUN_PLACEHOLDER %t1.out
//==------------------- smemll.cpp - Shared Memory Linked List test --------==//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include <CL/sycl.hpp>
using namespace cl::sycl;
int numNodes = 4;
struct Node {
Node() : pNext(nullptr), Num(0xDEADBEEF) {}
Node *pNext;
uint32_t Num;
};
class foo;
int main() {
queue q;
auto dev = q.get_device();
auto ctxt = q.get_context();
if (!dev.get_info<info::device::usm_shared_allocations>())
return 0;
Node *s_head = (Node *)malloc_shared(sizeof(Node), dev, ctxt);
if (s_head == nullptr) {
return -1;
}
Node *s_cur = s_head;
for (int i = 0; i < numNodes; i++) {
s_cur->Num = i * 2;
if (i != (numNodes - 1)) {
s_cur->pNext = (Node *)malloc_shared(sizeof(Node), dev, ctxt);
if (s_cur->pNext == nullptr) {
return -1;
}
} else {
s_cur->pNext = nullptr;
}
s_cur = s_cur->pNext;
}
auto e1 = q.submit([=](handler &cgh) {
cgh.single_task<class foo>([=]() {
Node *pHead = s_head;
while (pHead) {
pHead->Num = pHead->Num * 2 + 1;
pHead = pHead->pNext;
}
});
});
e1.wait();
s_cur = s_head;
for (int i = 0; i < numNodes; i++) {
const int want = i * 4 + 1;
if (s_cur->Num != want) {
return -2;
}
Node *old = s_cur;
s_cur = s_cur->pNext;
free(old, ctxt);
}
return 0;
}