diff options
author | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-08-29 10:58:32 +0000 |
---|---|---|
committer | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-08-29 10:58:32 +0000 |
commit | d193c0629c82ad4b5d866ffd0ea3375cb33fb594 (patch) | |
tree | 6e1b74a6ffa6d93257d6fe4f61aa7566838333fe /gcc/ada/a-synbar.adb | |
parent | 76767c36a1ff9b7bdeeb5d8cd4e678e9ec7174ee (diff) | |
download | gcc-d193c0629c82ad4b5d866ffd0ea3375cb33fb594.tar.gz |
2011-08-29 Tristan Gingold <gingold@adacore.com>
* s-interr-hwint.adb: Revert previous patch (defer aborts in ZCX case).
2011-08-29 Geert Bosch <bosch@adacore.com>
* a-ngelfu.adb (Tan): Do not raise Constraint_Error if the argument is
the closest machine number to Pi / 2.0.
2011-08-29 Jose Ruiz <ruiz@adacore.com>
* impunit.adb (Non_Imp_File_Names_12): Add a-synbar for new Ada 2012
package Ada.Synchronous_Barriers.
* a-synbar.ads, a-synbar.adb, a-synbar-posix.ads, a-synbar-posix.adb:
Add new specs and bodies for Ada.Synchronous_Barriers. There is a
default implementation using protected objects and another one
a-synbar-posix using POSIX barriers as the underlying support.
* gcc-interface/Makefile.in (LIBGNAT_TARGET_PAIRS for Linux (x86,
x86_64, ia64) and MIPS IRIX): Use the a-synbar-posix implementation of
Ada.Synchronous_Barriers which uses POSIX barriers (more efficient).
* Makefile.rtl (GNATRTL_TASKING_OBJS): Add a-synbar.o
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@178200 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-synbar.adb')
-rw-r--r-- | gcc/ada/a-synbar.adb | 71 |
1 files changed, 71 insertions, 0 deletions
diff --git a/gcc/ada/a-synbar.adb b/gcc/ada/a-synbar.adb new file mode 100644 index 00000000000..8efaef6d036 --- /dev/null +++ b/gcc/ada/a-synbar.adb @@ -0,0 +1,71 @@ +------------------------------------------------------------------------------ +-- -- +-- GNAT RUN-TIME COMPONENTS -- +-- -- +-- A D A . S Y N C H R O N O U S _ B A R R I E R S -- +-- -- +-- B o d y -- +-- -- +-- Copyright (C) 1992-2011, Free Software Foundation, Inc. -- +-- -- +-- This specification is derived from the Ada Reference Manual for use with -- +-- GNAT. The copyright notice above, and the license provisions that follow -- +-- apply solely to the contents of the part following the private keyword. -- +-- -- +-- GNAT is free software; you can redistribute it and/or modify it under -- +-- terms of the GNU General Public License as published by the Free Soft- -- +-- ware Foundation; either version 3, or (at your option) any later ver- -- +-- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- +-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- +-- or FITNESS FOR A PARTICULAR PURPOSE. -- +-- -- +-- As a special exception under Section 7 of GPL version 3, you are granted -- +-- additional permissions described in the GCC Runtime Library Exception, -- +-- version 3.1, as published by the Free Software Foundation. -- +-- -- +-- You should have received a copy of the GNU General Public License and -- +-- a copy of the GCC Runtime Library Exception along with this program; -- +-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- +-- <http://www.gnu.org/licenses/>. -- +-- -- +-- GNAT was originally developed by the GNAT team at New York University. -- +-- Extensive contributions were provided by Ada Core Technologies Inc. -- +-- -- +------------------------------------------------------------------------------ + +package body Ada.Synchronous_Barriers is + + protected body Synchronous_Barrier is + -- The condition "Wait'Count = Release_Threshold" opens the barrier when + -- the required number of tasks is reached. The condition "Keep_Open" + -- leaves the barrier open while there are queued tasks. While there are + -- tasks in the queue no new task will be queued, guaranteeing that the + -- barrier will remain open only for those tasks already inside. + + entry Wait (Notified : out Boolean) + when Wait'Count = Release_Threshold or else Keep_Open is + begin + -- If we are executing the entry it means that the required number + -- of tasks have been queued in the entry. Keep_Open barrier will + -- remain true until all queued tasks are out. + + Keep_Open := Wait'Count > 0; + + -- The last released task will close the barrier and get the + -- Notified token. + + Notified := Wait'Count = 0; + end Wait; + end Synchronous_Barrier; + + ---------------------- + -- Wait_For_Release -- + ---------------------- + + procedure Wait_For_Release + (The_Barrier : in out Synchronous_Barrier; + Notified : out Boolean) is + begin + The_Barrier.Wait (Notified); + end Wait_For_Release; +end Ada.Synchronous_Barriers; |