2 * futex.spin: Promela code to validate futex wakeup algorithm.
14 * if (this.waiting == 1) {
16 * if (gp_futex == -1) {
27 * waiting |= (queue != gp);
28 * in_registry &= (queue != gp);
29 * if (all in_registry == 0) {
35 * futex_wake = (gp_futex == -1 ? 0 : 1);
36 * while (futex_wake == 0) { }
41 * By testing progress, i.e. [] <> !np_, we check that an infinite sequence
42 * of update_counter_and_wait (and consequently of synchronize_rcu) will
45 * This program is free software; you can redistribute it and/or modify
46 * it under the terms of the GNU General Public License as published by
47 * the Free Software Foundation; either version 2 of the License, or
48 * (at your option) any later version.
50 * This program is distributed in the hope that it will be useful,
51 * but WITHOUT ANY WARRANTY; without even the implied warranty of
52 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
53 * GNU General Public License for more details.
55 * You should have received a copy of the GNU General Public License
56 * along with this program; if not, write to the Free Software
57 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
59 * Copyright (c) 2009 Mathieu Desnoyers
62 #define get_pid() (_pid)
69 int in_registry[2] = 0;
71 active [2] proctype waker()
73 assert(get_pid() < 2);
77 queue[get_pid()] = gp;
80 :: (waiting[get_pid()] == 1) ->
81 waiting[get_pid()] = 0;
83 :: (gp_futex == -1) ->
85 #ifndef INJ_QUEUE_NO_WAKE
96 active proctype waiter()
103 #if (!defined(INJ_LATE_DEC) && !defined(INJ_INVERT_WAITING_VS_GP_FUTEX))
107 :: (in_registry[0] == 1 && queue[0] != gp) ->
113 :: (in_registry[1] == 1 && queue[1] != gp) ->
120 :: (in_registry[0] == 1 && queue[0] == gp) ->
126 :: (in_registry[1] == 1 && queue[1] == gp) ->
131 #ifdef INJ_INVERT_WAITING_VS_GP_FUTEX
136 :: (in_registry[0] == 0 && in_registry[1] == 0) ->
147 futex_wake = gp_futex + 1;
151 :: (futex_wake == 0) ->