forked from intel/llvm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhmemll.cpp
More file actions
82 lines (66 loc) · 1.77 KB
/
Copy pathhmemll.cpp
File metadata and controls
82 lines (66 loc) · 1.77 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
// 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
// UNSUPPORTED: cuda
//==------------------- hmemll.cpp - Host 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 ctxt = q.get_context();
auto dev = q.get_device();
if (!dev.get_info<info::device::usm_host_allocations>())
return 0;
Node *h_head = (Node *)malloc_host(sizeof(Node), ctxt);
if (h_head == nullptr) {
return -1;
}
Node *h_cur = h_head;
for (int i = 0; i < numNodes; i++) {
h_cur->Num = i * 2;
if (i != (numNodes - 1)) {
h_cur->pNext = (Node *)malloc_host(sizeof(Node), ctxt);
if (h_cur->pNext == nullptr) {
return -1;
}
} else {
h_cur->pNext = nullptr;
}
h_cur = h_cur->pNext;
}
auto e1 = q.submit([=](handler &cgh) {
cgh.single_task<class foo>([=]() {
Node *pHead = h_head;
while (pHead) {
pHead->Num = pHead->Num * 2 + 1;
pHead = pHead->pNext;
}
});
});
e1.wait();
h_cur = h_head;
for (int i = 0; i < numNodes; i++) {
const int want = i * 4 + 1;
if (h_cur->Num != want) {
return -2;
}
Node *old = h_cur;
h_cur = h_cur->pNext;
free(old, ctxt);
}
return 0;
}