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
|
/*
* Copyright (C) 2019-2022 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#pragma once
#include <stddef.h>
template <typename NodeObjectType, typename... Args>
int verifySequence(const NodeObjectType *base, int nodeNum, const NodeObjectType *last) {
if (base == last) {
return -1;
} else {
return nodeNum;
}
}
template <typename NodeObjectType, typename... Rest>
int verifySequence(const NodeObjectType *base, int nodeNum, const NodeObjectType *current, const Rest *...rest) {
if (base == nullptr) {
return nodeNum - 1;
} else if (base == current) {
return verifySequence(base->next, nodeNum + 1, rest...);
} else {
return nodeNum;
}
}
// Helper function for testing if nodes are placed exactly in given order
// Negative return values indicates that the sequence is ordered as requested.
// Non-negative value indicates first node that breaks the order.
template <typename NodeObjectType, typename... Rest>
int verifySequence(const NodeObjectType *base, const NodeObjectType *first, const Rest *...rest) {
return verifySequence(base, 0, first, rest...);
}
// Helper function for testing if nodes are placed exactly in given order
// Negative return values indicates that the sequence is ordered as requested.
// Non-negative value indicates first node that breaks the order.
// Note : verifies also "last->tail == nulptr"
template <typename NodeObjectType, typename... Rest>
int verifyFListOrder(const NodeObjectType *base, const NodeObjectType *first, const Rest *...rest) {
NodeObjectType *sentinel = nullptr;
int sequenceRet = verifySequence(base, first, rest..., sentinel);
if (sequenceRet < 0) {
return sequenceRet;
}
int totalReferenceNodes = static_cast<int>(1 + sizeof...(rest));
if (sequenceRet >= totalReferenceNodes) {
// base defines longer sequence than expected
return totalReferenceNodes - 1;
}
return sequenceRet;
}
// Helper function for testing if nodes are ordered exactly in given order
// Negative return values indicates that the sequence is ordered as requested.
// Non-negative value indicates first node that breaks the order.
// Note : verifies also "first->prev == nullptr" and "last->tail == nulptr"
template <typename NodeObjectType, typename... Rest>
int verifyDListOrder(const NodeObjectType *base, const NodeObjectType *first, const Rest *...rest) {
if (base->prev != nullptr) {
return 0;
}
return verifyFListOrder(base, first, rest...);
}
|
