Generated on for Gecode by doxygen 1.17.0
gpi.hpp
Go to the documentation of this file.
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christian Schulte <schulte@gecode.dev>
5 *
6 * Copyright:
7 * Christian Schulte, 2009
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.dev
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <cmath>
35
36namespace Gecode { namespace Kernel {
37
39 class GPI {
40 public:
42 class Info {
43 public:
45 unsigned int pid;
47 unsigned int gid;
49 double afc;
51 void init(unsigned int pid, unsigned int gid);
52 };
53 private:
55 class Block : public HeapAllocated {
56 public:
58 static const int n_info = 8192;
60 Info info[n_info];
62 Block* next;
64 int free;
66 Block(void);
68 void rescale(void);
69 };
71 Block* b;
73 double invd;
75 std::atomic<unsigned int> npid;
77 bool us;
79 Block fst;
82 public:
84 GPI(void);
86 void decay(double d);
88 double decay(void) const;
90 void fail(Info& c);
92 Info* allocate(unsigned int p, unsigned int gid);
94 Info* allocate(unsigned int gid);
96 unsigned int next_pid(void);
98 unsigned int pid(void) const;
100 bool unshare(void);
102 ~GPI(void);
103 };
104
105
106 forceinline void
107 GPI::Info::init(unsigned int pid0, unsigned int gid0) {
108 pid=pid0; gid=gid0; afc=1.0;
109 }
110
111
113 GPI::Block::Block(void)
114 : next(nullptr), free(n_info) {}
115
116 forceinline void
117 GPI::Block::rescale(void) {
118 for (int i=free; i < n_info; i++)
119 info[i].afc *= Kernel::Config::rescale;
120 }
121
122
125 : b(&fst), invd(1.0), npid(0U), us(false) {}
126
127 forceinline void
129 m.acquire();
130 c.afc = invd * (c.afc + 1.0);
132 for (Block* i = b; i != nullptr; i = i->next)
133 i->rescale();
134 m.release();
135 }
136
137 forceinline double
138 GPI::decay(void) const {
139 double d;
140 const_cast<GPI&>(*this).m.acquire();
141 d = 1.0 / invd;
142 const_cast<GPI&>(*this).m.release();
143 return d;
144 }
145
146 forceinline unsigned int
148 return npid.fetch_add(1, std::memory_order_seq_cst);
149 }
150
151 forceinline unsigned int
152 GPI::pid(void) const {
153 return npid.load(std::memory_order_acquire);
154 }
155
156 forceinline bool
158 bool u;
159 m.acquire();
160 u = us; us = true;
161 m.release();
162 return u;
163 }
164
165 forceinline void
166 GPI::decay(double d) {
167 m.acquire();
168 invd = 1.0 / d;
169 m.release();
170 }
171
173 GPI::allocate(unsigned int p, unsigned int gid) {
174 Info* c;
175 m.acquire();
176 if (b->free == 0) {
177 Block* n = new Block;
178 n->next = b; b = n;
179 }
180 c = &b->info[--b->free];
181 m.release();
182 c->init(p,gid);
183 return c;
184 }
185
187 GPI::allocate(unsigned int gid) {
188 Info* c;
189 m.acquire();
190 if (b->free == 0) {
191 Block* n = new Block;
192 n->next = b; b = n;
193 }
194 c = &b->info[--b->free];
195 m.release();
196 c->init(next_pid(),gid);
197 return c;
198 }
199
201 GPI::~GPI(void) {
202 Block* n = b;
203 while (n != &fst) {
204 Block* d = n;
205 n = n->next;
206 delete d;
207 }
208 }
209
210}}
211
212// STATISTICS: kernel-prop
Base class for heap allocated objects.
Definition heap.hpp:344
Class for storing propagator information.
Definition gpi.hpp:42
void init(unsigned int pid, unsigned int gid)
Initialize.
Definition gpi.hpp:107
unsigned int pid
Propagator identifier.
Definition gpi.hpp:45
unsigned int gid
Group identifier.
Definition gpi.hpp:47
double afc
The afc value.
Definition gpi.hpp:49
GPI(void)
Initialize.
Definition gpi.hpp:124
unsigned int pid(void) const
Return next free propagator id.
Definition gpi.hpp:152
unsigned int next_pid(void)
Allocate a new propagator id without allocating information.
Definition gpi.hpp:147
double decay(void) const
Return decay factor.
Definition gpi.hpp:138
void fail(Info &c)
Increment failure count.
Definition gpi.hpp:128
~GPI(void)
Delete.
Definition gpi.hpp:201
bool unshare(void)
Provide access to unshare info and set to true.
Definition gpi.hpp:157
Info * allocate(unsigned int p, unsigned int gid)
Allocate info for existing propagator with pid p.
Definition gpi.hpp:173
A mutex for mutual exclausion among several threads.
Definition thread.hpp:78
#define GECODE_KERNEL_EXPORT
Definition kernel.hh:70
const double rescale_limit
Rescale action and afc values when larger than this.
Definition kernel.hh:101
const double rescale
Rescale factor for action and afc values.
Definition kernel.hh:99
Kernel functionality
Gecode toplevel namespace
#define forceinline
Definition config.hpp:144