summaryrefslogtreecommitdiff
path: root/big-little/lib/bakery.c
blob: 79841680a6e6925b4991d82ae137578ec08bc197 (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
/*
 * Copyright (c) 2012, ARM Limited. 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.
 */

/*
 * bakery.c: Lamport's Bakery algorithm for spinlock handling
 *
 * Note that the algorithm requires the stack and the bakery struct
 * to be in Strongly-Ordered memory.
 */

#include "misc.h"
#include <string.h>
#include "bakery.h"

void init_bakery_spinlock(bakery_t * bakery)
{
	memset(bakery, 0, sizeof(bakery_t));
}

void get_bakery_spinlock(unsigned cpuid, bakery_t * bakery)
{
	unsigned i, max = 0, my_full_number, his_full_number;

	/* Get a ticket */
	bakery->entering[cpuid] = TRUE;
	for (i = 0; i < MAX_CPUS; ++i) {
		if (bakery->number[i] > max) {
			max = bakery->number[i];
		}
	}
	++max;
	bakery->number[cpuid] = max;
	bakery->entering[cpuid] = FALSE;

	/* Wait for our turn */
	my_full_number = (max << 8) + cpuid;
	for (i = 0; i < 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));
	}
}

void release_bakery_spinlock(unsigned cpuid, bakery_t * bakery)
{
	bakery->number[cpuid] = 0;
}