seqlock.h 4.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4
#ifndef __LINUX_SEQLOCK_H
#define __LINUX_SEQLOCK_H
/*
 * Reader/writer consistent mechanism without starving writers. This type of
R
Robert P. J. Day 已提交
5
 * lock for data where the reader wants a consistent set of information
L
Linus Torvalds 已提交
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
 * and is willing to retry if the information changes.  Readers never
 * block but they may have to retry if a writer is in
 * progress. Writers do not wait for readers. 
 *
 * This is not as cache friendly as brlock. Also, this will not work
 * for data that contains pointers, because any writer could
 * invalidate a pointer that a reader was following.
 *
 * Expected reader usage:
 * 	do {
 *	    seq = read_seqbegin(&foo);
 * 	...
 *      } while (read_seqretry(&foo, seq));
 *
 *
 * On non-SMP the spin locks disappear but the writer still needs
 * to increment the sequence variables because an interrupt routine could
 * change the state of the data.
 *
 * Based on x86_64 vsyscall gettimeofday 
 * by Keith Owens and Andrea Arcangeli
 */

#include <linux/spinlock.h>
#include <linux/preempt.h>

typedef struct {
	unsigned sequence;
	spinlock_t lock;
} seqlock_t;

/*
 * These macros triggered gcc-3.x compile-time problems.  We think these are
 * OK now.  Be cautious.
 */
41 42
#define __SEQLOCK_UNLOCKED(lockname) \
		 { 0, __SPIN_LOCK_UNLOCKED(lockname) }
L
Linus Torvalds 已提交
43

44 45 46
#define SEQLOCK_UNLOCKED \
		 __SEQLOCK_UNLOCKED(old_style_seqlock_init)

I
Ingo Molnar 已提交
47 48 49 50 51
#define seqlock_init(x)					\
	do {						\
		(x)->sequence = 0;			\
		spin_lock_init(&(x)->lock);		\
	} while (0)
52 53 54

#define DEFINE_SEQLOCK(x) \
		seqlock_t x = __SEQLOCK_UNLOCKED(x)
L
Linus Torvalds 已提交
55 56 57 58 59 60 61 62 63

/* Lock out other writers and update the count.
 * Acts like a normal spin_lock/unlock.
 * Don't need preempt_disable() because that is in the spin_lock already.
 */
static inline void write_seqlock(seqlock_t *sl)
{
	spin_lock(&sl->lock);
	++sl->sequence;
64 65
	smp_wmb();
}
L
Linus Torvalds 已提交
66

67
static inline void write_sequnlock(seqlock_t *sl)
L
Linus Torvalds 已提交
68 69 70 71 72 73 74 75 76 77 78 79
{
	smp_wmb();
	sl->sequence++;
	spin_unlock(&sl->lock);
}

static inline int write_tryseqlock(seqlock_t *sl)
{
	int ret = spin_trylock(&sl->lock);

	if (ret) {
		++sl->sequence;
80
		smp_wmb();
L
Linus Torvalds 已提交
81 82 83 84 85
	}
	return ret;
}

/* Start of read calculation -- fetch last complete writer token */
86
static __always_inline unsigned read_seqbegin(const seqlock_t *sl)
L
Linus Torvalds 已提交
87
{
I
Ingo Molnar 已提交
88 89 90 91
	unsigned ret;

repeat:
	ret = sl->sequence;
L
Linus Torvalds 已提交
92
	smp_rmb();
I
Ingo Molnar 已提交
93 94 95 96 97
	if (unlikely(ret & 1)) {
		cpu_relax();
		goto repeat;
	}

L
Linus Torvalds 已提交
98 99 100
	return ret;
}

I
Ingo Molnar 已提交
101 102 103 104
/*
 * Test if reader processed invalid data.
 *
 * If sequence value changed then writer changed data while in section.
L
Linus Torvalds 已提交
105
 */
I
Ingo Molnar 已提交
106
static __always_inline int read_seqretry(const seqlock_t *sl, unsigned start)
L
Linus Torvalds 已提交
107 108
{
	smp_rmb();
I
Ingo Molnar 已提交
109 110

	return (sl->sequence != start);
L
Linus Torvalds 已提交
111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
}


/*
 * Version using sequence counter only.
 * This can be used when code has its own mutex protecting the
 * updating starting before the write_seqcountbeqin() and ending
 * after the write_seqcount_end().
 */

typedef struct seqcount {
	unsigned sequence;
} seqcount_t;

#define SEQCNT_ZERO { 0 }
#define seqcount_init(x)	do { *(x) = (seqcount_t) SEQCNT_ZERO; } while (0)

/* Start of read using pointer to a sequence counter only.  */
static inline unsigned read_seqcount_begin(const seqcount_t *s)
{
I
Ingo Molnar 已提交
131 132 133 134
	unsigned ret;

repeat:
	ret = s->sequence;
L
Linus Torvalds 已提交
135
	smp_rmb();
I
Ingo Molnar 已提交
136 137 138 139
	if (unlikely(ret & 1)) {
		cpu_relax();
		goto repeat;
	}
L
Linus Torvalds 已提交
140 141 142
	return ret;
}

I
Ingo Molnar 已提交
143 144
/*
 * Test if reader processed invalid data because sequence number has changed.
L
Linus Torvalds 已提交
145
 */
I
Ingo Molnar 已提交
146
static inline int read_seqcount_retry(const seqcount_t *s, unsigned start)
L
Linus Torvalds 已提交
147 148
{
	smp_rmb();
I
Ingo Molnar 已提交
149 150

	return s->sequence != start;
L
Linus Torvalds 已提交
151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
}


/*
 * Sequence counter only version assumes that callers are using their
 * own mutexing.
 */
static inline void write_seqcount_begin(seqcount_t *s)
{
	s->sequence++;
	smp_wmb();
}

static inline void write_seqcount_end(seqcount_t *s)
{
	smp_wmb();
	s->sequence++;
}

/*
 * Possible sw/hw IRQ protected versions of the interfaces.
 */
#define write_seqlock_irqsave(lock, flags)				\
	do { local_irq_save(flags); write_seqlock(lock); } while (0)
#define write_seqlock_irq(lock)						\
	do { local_irq_disable();   write_seqlock(lock); } while (0)
#define write_seqlock_bh(lock)						\
        do { local_bh_disable();    write_seqlock(lock); } while (0)

#define write_sequnlock_irqrestore(lock, flags)				\
	do { write_sequnlock(lock); local_irq_restore(flags); } while(0)
#define write_sequnlock_irq(lock)					\
	do { write_sequnlock(lock); local_irq_enable(); } while(0)
#define write_sequnlock_bh(lock)					\
	do { write_sequnlock(lock); local_bh_enable(); } while(0)

#define read_seqbegin_irqsave(lock, flags)				\
	({ local_irq_save(flags);   read_seqbegin(lock); })

#define read_seqretry_irqrestore(lock, iv, flags)			\
	({								\
		int ret = read_seqretry(lock, iv);			\
		local_irq_restore(flags);				\
		ret;							\
	})

#endif /* __LINUX_SEQLOCK_H */