aboutsummaryrefslogtreecommitdiff
path: root/lib/sync/locks/bakery/bakery_lock.c
blob: 964124824ecb0178726378c1d23e0fd233544af5 (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
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
94
95
96
97
98
99
100
101
102
103
104
/*
 * Copyright (c) 2013-2014, ARM Limited and Contributors. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * 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.
 *
 * Neither the name of ARM nor the names of its contributors may be used
 * to endorse or promote products derived from this software without specific
 * prior written permission.
 *
 * 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 <assert.h>
#include <string.h>

#include <bakery_lock.h>

#define assert_bakery_entry_valid(entry, bakery) do {	\
	assert(bakery);					\
	assert(entry < BAKERY_LOCK_MAX_CPUS);		\
} while(0)

void bakery_lock_init(bakery_lock * bakery)
{
	assert(bakery);
	memset(bakery, 0, sizeof(*bakery));
	bakery->owner = NO_OWNER;
}

void bakery_lock_get(unsigned long mpidr, bakery_lock * bakery)
{
	unsigned int i, max = 0, my_full_number, his_full_number, entry;

	entry = platform_get_core_pos(mpidr);

	assert_bakery_entry_valid(entry, bakery);

	// Catch recursive attempts to take the lock under the same entry:
	assert(bakery->owner != entry);

	// Get a ticket
	bakery->entering[entry] = 1;
	for (i = 0; i < BAKERY_LOCK_MAX_CPUS; ++i) {
		if (bakery->number[i] > max) {
			max = bakery->number[i];
		}
	}
	++max;
	bakery->number[entry] = max;
	bakery->entering[entry] = 0;

	// Wait for our turn
	my_full_number = (max << 8) + entry;
	for (i = 0; i < BAKERY_LOCK_MAX_CPUS; ++i) {
		while (bakery->entering[i]) ;	/* Wait */
		do {
			his_full_number = bakery->number[i];
			if (his_full_number) {
				his_full_number = (his_full_number << 8) + i;
			}
		}
		while (his_full_number && (his_full_number < my_full_number));
	}

	bakery->owner = entry;
}

void bakery_lock_release(unsigned long mpidr, bakery_lock * bakery)
{
	unsigned int entry = platform_get_core_pos(mpidr);

	assert_bakery_entry_valid(entry, bakery);
	assert(bakery_lock_held(entry, bakery));

	bakery->owner = NO_OWNER;
	bakery->number[entry] = 0;
}

int bakery_lock_held(unsigned long mpidr, const bakery_lock * bakery)
{
	unsigned int entry = platform_get_core_pos(mpidr);

	assert_bakery_entry_valid(entry, bakery);

	return bakery->owner == entry;
}