blob: 9c9a50c73e0eaaadb63eb57d16683dd164fc6f09 (
plain)
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
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
/*============================================================
**
** Source : test.c
**
** Purpose: InterlockedDecrement() function
**
**
**=========================================================*/
/* This test is FINISHED. Note: The biggest feature of this function is that
it locks the value before it increments it -- in order to make it so only
one thread can access it. But, I really don't have a great test to make
sure it's thread safe. Any ideas?
*/
#include <palsuite.h>
int __cdecl main(int argc, char *argv[])
{
int TheValue = 0;
int TheReturn;
/*
* Initialize the PAL and return FAILURE if this fails
*/
if(0 != (PAL_Initialize(argc, argv)))
{
return FAIL;
}
InterlockedDecrement(&TheValue);
TheReturn = InterlockedDecrement(&TheValue);
/* Decremented twice, it should be -2 now */
if(TheValue != -2)
{
Fail("ERROR: After being decremented twice, the value should be -2, "
"but it is really %d.",TheValue);
}
/* Check to make sure it returns itself */
if(TheReturn != TheValue)
{
Fail("ERROR: The function should have returned the new value of %d "
"but instead returned %d.",TheValue,TheReturn);
}
PAL_Terminate();
return PASS;
}
|
