[mirror_frr.git] / bgpd / bgp_keepalives.c

/* BGP Keepalives.
 * Implements a producer thread to generate BGP keepalives for peers.
 * Copyright (C) 2017 Cumulus Networks, Inc.
 * Quentin Young
 *
 * This file is part of FRRouting.
 *
 * FRRouting is free software; you can redistribute it and/or modify it under
 * the terms of the GNU General Public License as published by the Free
 * Software Foundation; either version 2, or (at your option) any later
 * version.
 *
 * FRRouting is distributed in the hope that it will be useful, but WITHOUT ANY
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; see the file COPYING; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
 */

/* clang-format off */
#include <zebra.h>
#include <pthread.h>		// for pthread_mutex_lock, pthread_mutex_unlock

#include "frr_pthread.h"        // for frr_pthread
#include "hash.h"		// for hash, hash_clean, hash_create_size...
#include "log.h"		// for zlog_debug
#include "memory.h"		// for MTYPE_TMP, XFREE, XCALLOC, XMALLOC
#include "monotime.h"		// for monotime, monotime_since

#include "bgpd/bgpd.h"          // for peer, PEER_THREAD_KEEPALIVES_ON, peer...
#include "bgpd/bgp_debug.h"	// for bgp_debug_neighbor_events
#include "bgpd/bgp_packet.h"	// for bgp_keepalive_send
#include "bgpd/bgp_keepalives.h"
/* clang-format on */

/*
 * Peer KeepAlive Timer.
 * Associates a peer with the time of its last keepalive.
 */
struct pkat {
	/* the peer to send keepalives to */
	struct peer *peer;
	/* absolute time of last keepalive sent */
	struct timeval last;
};

/* List of peers we are sending keepalives for, and associated mutex. */
static pthread_mutex_t *peerhash_mtx;
static pthread_cond_t *peerhash_cond;
static struct hash *peerhash;

static struct pkat *pkat_new(struct peer *peer)
{
	struct pkat *pkat = XMALLOC(MTYPE_TMP, sizeof(struct pkat));
	pkat->peer = peer;
	monotime(&pkat->last);
	return pkat;
}

static void pkat_del(void *pkat)
{
	XFREE(MTYPE_TMP, pkat);
}


/*
 * Callback for hash_iterate. Determines if a peer needs a keepalive and if so,
 * generates and sends it.
 *
 * For any given peer, if the elapsed time since its last keepalive exceeds its
 * configured keepalive timer, a keepalive is sent to the peer and its
 * last-sent time is reset. Additionally, If the elapsed time does not exceed
 * the configured keepalive timer, but the time until the next keepalive is due
 * is within a hardcoded tolerance, a keepalive is sent as if the configured
 * timer was exceeded. Doing this helps alleviate nanosecond sleeps between
 * ticks by grouping together peers who are due for keepalives at roughly the
 * same time. This tolerance value is arbitrarily chosen to be 100ms.
 *
 * In addition, this function calculates the maximum amount of time that the
 * keepalive thread can sleep before another tick needs to take place. This is
 * equivalent to shortest time until a keepalive is due for any one peer.
 *
 * @return maximum time to wait until next update (0 if infinity)
 */
static void peer_process(struct hash_bucket *hb, void *arg)
{
	struct pkat *pkat = hb->data;

	struct timeval *next_update = arg;

	static struct timeval elapsed;  // elapsed time since keepalive
	static struct timeval ka = {0}; // peer->v_keepalive as a timeval
	static struct timeval diff;     // ka - elapsed

	static const struct timeval tolerance = {0, 100000};

	uint32_t v_ka = atomic_load_explicit(&pkat->peer->v_keepalive,
					     memory_order_relaxed);

	/* 0 keepalive timer means no keepalives */
	if (v_ka == 0)
		return;

	/* calculate elapsed time since last keepalive */
	monotime_since(&pkat->last, &elapsed);

	/* calculate difference between elapsed time and configured time */
	ka.tv_sec = v_ka;
	timersub(&ka, &elapsed, &diff);

	int send_keepalive =
		elapsed.tv_sec >= ka.tv_sec || timercmp(&diff, &tolerance, <);

	if (send_keepalive) {
		if (bgp_debug_neighbor_events(pkat->peer))
			zlog_debug("%s [FSM] Timer (keepalive timer expire)",
				   pkat->peer->host);

		bgp_keepalive_send(pkat->peer);
		monotime(&pkat->last);
		memset(&elapsed, 0x00, sizeof(struct timeval));
		diff = ka;
	}

	/* if calculated next update for this peer < current delay, use it */
	if (next_update->tv_sec < 0 || timercmp(&diff, next_update, <))
		*next_update = diff;
}

static bool peer_hash_cmp(const void *f, const void *s)
{
	const struct pkat *p1 = f;
	const struct pkat *p2 = s;

	return p1->peer == p2->peer;
}

static unsigned int peer_hash_key(const void *arg)
{
	const struct pkat *pkat = arg;
	return (uintptr_t)pkat->peer;
}

/* Cleanup handler / deinitializer. */
static void bgp_keepalives_finish(void *arg)
{
	if (peerhash) {
		hash_clean(peerhash, pkat_del);
		hash_free(peerhash);
	}

	peerhash = NULL;

	pthread_mutex_unlock(peerhash_mtx);
	pthread_mutex_destroy(peerhash_mtx);
	pthread_cond_destroy(peerhash_cond);

	XFREE(MTYPE_TMP, peerhash_mtx);
	XFREE(MTYPE_TMP, peerhash_cond);
}

/*
 * Entry function for peer keepalive generation pthread.
 */
void *bgp_keepalives_start(void *arg)
{
	struct frr_pthread *fpt = arg;
	fpt->master->owner = pthread_self();

	struct timeval currtime = {0, 0};
	struct timeval aftertime = {0, 0};
	struct timeval next_update = {0, 0};
	struct timespec next_update_ts = {0, 0};

	peerhash_mtx = XCALLOC(MTYPE_TMP, sizeof(pthread_mutex_t));
	peerhash_cond = XCALLOC(MTYPE_TMP, sizeof(pthread_cond_t));

	/* initialize mutex */
	pthread_mutex_init(peerhash_mtx, NULL);

	/* use monotonic clock with condition variable */
	pthread_condattr_t attrs;
	pthread_condattr_init(&attrs);
	pthread_condattr_setclock(&attrs, CLOCK_MONOTONIC);
	pthread_cond_init(peerhash_cond, &attrs);
	pthread_condattr_destroy(&attrs);

	/*
	 * We are not using normal FRR pthread mechanics and are
	 * not using fpt_run
	 */
	frr_pthread_set_name(fpt);

	/* initialize peer hashtable */
	peerhash = hash_create_size(2048, peer_hash_key, peer_hash_cmp, NULL);
	pthread_mutex_lock(peerhash_mtx);

	/* register cleanup handler */
	pthread_cleanup_push(&bgp_keepalives_finish, NULL);

	/* notify anybody waiting on us that we are done starting up */
	frr_pthread_notify_running(fpt);

	while (atomic_load_explicit(&fpt->running, memory_order_relaxed)) {
		if (peerhash->count > 0)
			pthread_cond_timedwait(peerhash_cond, peerhash_mtx,
					       &next_update_ts);
		else
			while (peerhash->count == 0
			       && atomic_load_explicit(&fpt->running,
						       memory_order_relaxed))
				pthread_cond_wait(peerhash_cond, peerhash_mtx);

		monotime(&currtime);

		next_update.tv_sec = -1;

		hash_iterate(peerhash, peer_process, &next_update);
		if (next_update.tv_sec == -1)
			memset(&next_update, 0x00, sizeof(next_update));

		monotime_since(&currtime, &aftertime);

		timeradd(&currtime, &next_update, &next_update);
		TIMEVAL_TO_TIMESPEC(&next_update, &next_update_ts);
	}

	/* clean up */
	pthread_cleanup_pop(1);

	return NULL;
}

/* --- thread external functions ------------------------------------------- */

void bgp_keepalives_on(struct peer *peer)
{
	if (CHECK_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON))
		return;

	struct frr_pthread *fpt = bgp_pth_ka;
	assert(fpt->running);

	/* placeholder bucket data to use for fast key lookups */
	static struct pkat holder = {0};

	/*
	 * We need to ensure that bgp_keepalives_init was called first
	 */
	assert(peerhash_mtx);

	frr_with_mutex(peerhash_mtx) {
		holder.peer = peer;
		if (!hash_lookup(peerhash, &holder)) {
			struct pkat *pkat = pkat_new(peer);
			hash_get(peerhash, pkat, hash_alloc_intern);
			peer_lock(peer);
		}
		SET_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON);
	}
	bgp_keepalives_wake();
}

void bgp_keepalives_off(struct peer *peer)
{
	if (!CHECK_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON))
		return;

	struct frr_pthread *fpt = bgp_pth_ka;
	assert(fpt->running);

	/* placeholder bucket data to use for fast key lookups */
	static struct pkat holder = {0};

	/*
	 * We need to ensure that bgp_keepalives_init was called first
	 */
	assert(peerhash_mtx);

	frr_with_mutex(peerhash_mtx) {
		holder.peer = peer;
		struct pkat *res = hash_release(peerhash, &holder);
		if (res) {
			pkat_del(res);
			peer_unlock(peer);
		}
		UNSET_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON);
	}
}

void bgp_keepalives_wake(void)
{
	frr_with_mutex(peerhash_mtx) {
		pthread_cond_signal(peerhash_cond);
	}
}

int bgp_keepalives_stop(struct frr_pthread *fpt, void **result)
{
	assert(fpt->running);

	atomic_store_explicit(&fpt->running, false, memory_order_relaxed);
	bgp_keepalives_wake();

	pthread_join(fpt->thread, result);
	return 0;
}
Commit	Line	Data
5c0c651c QY	1	/* BGP Keepalives.
	2	* Implements a producer thread to generate BGP keepalives for peers.
	3	* Copyright (C) 2017 Cumulus Networks, Inc.
	4	* Quentin Young
	5	*
	6	* This file is part of FRRouting.
	7	*
	8	* FRRouting is free software; you can redistribute it and/or modify it under
	9	* the terms of the GNU General Public License as published by the Free
	10	* Software Foundation; either version 2, or (at your option) any later
	11	* version.
	12	*
	13	* FRRouting is distributed in the hope that it will be useful, but WITHOUT ANY
	14	* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
	15	* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
	16	* details.
	17	*
	18	* You should have received a copy of the GNU General Public License along
	19	* with this program; see the file COPYING; if not, write to the Free Software
	20	* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
03014d48	21	*/
5c0c651c	22
6ee8ea1c	23	/* clang-format off */
03014d48	24	#include <zebra.h>
6ee8ea1c	25	#include <pthread.h> // for pthread_mutex_lock, pthread_mutex_unlock
03014d48	26
6ee8ea1c QY	27	#include "frr_pthread.h" // for frr_pthread
	28	#include "hash.h" // for hash, hash_clean, hash_create_size...
	29	#include "log.h" // for zlog_debug
	30	#include "memory.h" // for MTYPE_TMP, XFREE, XCALLOC, XMALLOC
	31	#include "monotime.h" // for monotime, monotime_since
03014d48	32
6ee8ea1c QY	33	#include "bgpd/bgpd.h" // for peer, PEER_THREAD_KEEPALIVES_ON, peer...
	34	#include "bgpd/bgp_debug.h" // for bgp_debug_neighbor_events
	35	#include "bgpd/bgp_packet.h" // for bgp_keepalive_send
03014d48	36	#include "bgpd/bgp_keepalives.h"
6ee8ea1c	37	/* clang-format on */
03014d48	38
a715eab3	39	/*
03014d48 QY	40	* Peer KeepAlive Timer.
	41	* Associates a peer with the time of its last keepalive.
	42	*/
	43	struct pkat {
a715eab3	44	/* the peer to send keepalives to */
03014d48	45	struct peer *peer;
a715eab3	46	/* absolute time of last keepalive sent */
03014d48 QY	47	struct timeval last;
	48	};
	49
	50	/* List of peers we are sending keepalives for, and associated mutex. */
bd8b71e4 QY	51	static pthread_mutex_t *peerhash_mtx;
	52	static pthread_cond_t *peerhash_cond;
	53	static struct hash *peerhash;
03014d48	54
03014d48 QY	55	static struct pkat pkat_new(struct peer peer)
	56	{
	57	struct pkat *pkat = XMALLOC(MTYPE_TMP, sizeof(struct pkat));
	58	pkat->peer = peer;
	59	monotime(&pkat->last);
	60	return pkat;
	61	}
	62
	63	static void pkat_del(void *pkat)
	64	{
	65	XFREE(MTYPE_TMP, pkat);
	66	}
03014d48	67
bd8b71e4	68
03014d48	69	/*
424ab01d QY	70	* Callback for hash_iterate. Determines if a peer needs a keepalive and if so,
424ab01d QY	71	* generates and sends it.
03014d48 QY	72	*
	73	* For any given peer, if the elapsed time since its last keepalive exceeds its
	74	* configured keepalive timer, a keepalive is sent to the peer and its
	75	* last-sent time is reset. Additionally, If the elapsed time does not exceed
	76	* the configured keepalive timer, but the time until the next keepalive is due
	77	* is within a hardcoded tolerance, a keepalive is sent as if the configured
	78	* timer was exceeded. Doing this helps alleviate nanosecond sleeps between
	79	* ticks by grouping together peers who are due for keepalives at roughly the
	80	* same time. This tolerance value is arbitrarily chosen to be 100ms.
	81	*
	82	* In addition, this function calculates the maximum amount of time that the
	83	* keepalive thread can sleep before another tick needs to take place. This is
	84	* equivalent to shortest time until a keepalive is due for any one peer.
	85	*
	86	* @return maximum time to wait until next update (0 if infinity)
	87	*/
e3b78da8	88	static void peer_process(struct hash_bucket hb, void arg)
03014d48	89	{
bd8b71e4 QY	90	struct pkat *pkat = hb->data;
	91
	92	struct timeval *next_update = arg;
03014d48	93
03014d48 QY	94	static struct timeval elapsed; // elapsed time since keepalive
	95	static struct timeval ka = {0}; // peer->v_keepalive as a timeval
	96	static struct timeval diff; // ka - elapsed
	97
2b64873d	98	static const struct timeval tolerance = {0, 100000};
03014d48	99
bfc18a02 QY	100	uint32_t v_ka = atomic_load_explicit(&pkat->peer->v_keepalive,
	101	memory_order_relaxed);
	102
	103	/* 0 keepalive timer means no keepalives */
	104	if (v_ka == 0)
	105	return;
	106
a715eab3	107	/* calculate elapsed time since last keepalive */
bd8b71e4	108	monotime_since(&pkat->last, &elapsed);
03014d48	109
a715eab3	110	/* calculate difference between elapsed time and configured time */
bfc18a02	111	ka.tv_sec = v_ka;
bd8b71e4	112	timersub(&ka, &elapsed, &diff);
03014d48	113
bd8b71e4 QY	114	int send_keepalive =
bd8b71e4 QY	115	elapsed.tv_sec >= ka.tv_sec \|\| timercmp(&diff, &tolerance, <);
03014d48	116
bd8b71e4 QY	117	if (send_keepalive) {
	118	if (bgp_debug_neighbor_events(pkat->peer))
	119	zlog_debug("%s [FSM] Timer (keepalive timer expire)",
	120	pkat->peer->host);
03014d48	121
bd8b71e4 QY	122	bgp_keepalive_send(pkat->peer);
	123	monotime(&pkat->last);
	124	memset(&elapsed, 0x00, sizeof(struct timeval));
a715eab3	125	diff = ka;
03014d48 QY	126	}
03014d48 QY	127
a715eab3	128	/* if calculated next update for this peer < current delay, use it */
2ccf91b1	129	if (next_update->tv_sec < 0 \|\| timercmp(&diff, next_update, <))
bd8b71e4 QY	130	*next_update = diff;
	131	}
	132
74df8d6d	133	static bool peer_hash_cmp(const void f, const void s)
bd8b71e4 QY	134	{
	135	const struct pkat *p1 = f;
	136	const struct pkat *p2 = s;
74df8d6d	137
bd8b71e4 QY	138	return p1->peer == p2->peer;
	139	}
	140
d8b87afe	141	static unsigned int peer_hash_key(const void *arg)
bd8b71e4	142	{
d8b87afe	143	const struct pkat *pkat = arg;
bd8b71e4	144	return (uintptr_t)pkat->peer;
03014d48 QY	145	}
03014d48 QY	146
a715eab3	147	/* Cleanup handler / deinitializer. */
b72b6f4f	148	static void bgp_keepalives_finish(void *arg)
419dfe6a	149	{
bd8b71e4 QY	150	if (peerhash) {
	151	hash_clean(peerhash, pkat_del);
	152	hash_free(peerhash);
	153	}
419dfe6a	154
bd8b71e4	155	peerhash = NULL;
419dfe6a	156
bd8b71e4 QY	157	pthread_mutex_unlock(peerhash_mtx);
	158	pthread_mutex_destroy(peerhash_mtx);
	159	pthread_cond_destroy(peerhash_cond);
419dfe6a	160
424ab01d QY	161	XFREE(MTYPE_TMP, peerhash_mtx);
424ab01d QY	162	XFREE(MTYPE_TMP, peerhash_cond);
419dfe6a QY	163	}
419dfe6a QY	164
a715eab3	165	/*
419dfe6a	166	* Entry function for peer keepalive generation pthread.
419dfe6a	167	*/
b72b6f4f	168	void bgp_keepalives_start(void arg)
419dfe6a	169	{
a715eab3 QY	170	struct frr_pthread *fpt = arg;
	171	fpt->master->owner = pthread_self();
	172
419dfe6a	173	struct timeval currtime = {0, 0};
bd8b71e4	174	struct timeval aftertime = {0, 0};
419dfe6a QY	175	struct timeval next_update = {0, 0};
	176	struct timespec next_update_ts = {0, 0};
	177
a715eab3 QY	178	peerhash_mtx = XCALLOC(MTYPE_TMP, sizeof(pthread_mutex_t));
	179	peerhash_cond = XCALLOC(MTYPE_TMP, sizeof(pthread_cond_t));
	180
	181	/* initialize mutex */
	182	pthread_mutex_init(peerhash_mtx, NULL);
	183
	184	/* use monotonic clock with condition variable */
	185	pthread_condattr_t attrs;
	186	pthread_condattr_init(&attrs);
	187	pthread_condattr_setclock(&attrs, CLOCK_MONOTONIC);
	188	pthread_cond_init(peerhash_cond, &attrs);
	189	pthread_condattr_destroy(&attrs);
	190
c80bedb8 DS	191	/*
	192	* We are not using normal FRR pthread mechanics and are
	193	* not using fpt_run
	194	*/
	195	frr_pthread_set_name(fpt);
a9198bc1	196
a715eab3 QY	197	/* initialize peer hashtable */
a715eab3 QY	198	peerhash = hash_create_size(2048, peer_hash_key, peer_hash_cmp, NULL);
bd8b71e4	199	pthread_mutex_lock(peerhash_mtx);
03014d48	200
a715eab3	201	/* register cleanup handler */
b72b6f4f	202	pthread_cleanup_push(&bgp_keepalives_finish, NULL);
03014d48	203
a715eab3 QY	204	/* notify anybody waiting on us that we are done starting up */
a715eab3 QY	205	frr_pthread_notify_running(fpt);
03014d48	206
a715eab3	207	while (atomic_load_explicit(&fpt->running, memory_order_relaxed)) {
bd8b71e4 QY	208	if (peerhash->count > 0)
bd8b71e4 QY	209	pthread_cond_timedwait(peerhash_cond, peerhash_mtx,
03014d48 QY	210	&next_update_ts);
03014d48 QY	211	else
bd8b71e4	212	while (peerhash->count == 0
a715eab3 QY	213	&& atomic_load_explicit(&fpt->running,
a715eab3 QY	214	memory_order_relaxed))
bd8b71e4	215	pthread_cond_wait(peerhash_cond, peerhash_mtx);
03014d48 QY	216
03014d48 QY	217	monotime(&currtime);
bd8b71e4 QY	218
	219	next_update.tv_sec = -1;
	220
	221	hash_iterate(peerhash, peer_process, &next_update);
	222	if (next_update.tv_sec == -1)
	223	memset(&next_update, 0x00, sizeof(next_update));
	224
	225	monotime_since(&currtime, &aftertime);
	226
03014d48 QY	227	timeradd(&currtime, &next_update, &next_update);
	228	TIMEVAL_TO_TIMESPEC(&next_update, &next_update_ts);
	229	}
	230
a715eab3	231	/* clean up */
03014d48 QY	232	pthread_cleanup_pop(1);
	233
	234	return NULL;
	235	}
	236
	237	/* --- thread external functions ------------------------------------------- */
	238
b72b6f4f	239	void bgp_keepalives_on(struct peer *peer)
03014d48	240	{
096476dd QY	241	if (CHECK_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON))
	242	return;
	243
1ac267a2	244	struct frr_pthread *fpt = bgp_pth_ka;
a715eab3 QY	245	assert(fpt->running);
a715eab3 QY	246
bd8b71e4 QY	247	/* placeholder bucket data to use for fast key lookups */
	248	static struct pkat holder = {0};
	249
68ede9c4 DS	250	/*
	251	* We need to ensure that bgp_keepalives_init was called first
	252	*/
	253	assert(peerhash_mtx);
934af458	254
00dffa8c	255	frr_with_mutex(peerhash_mtx) {
bd8b71e4 QY	256	holder.peer = peer;
	257	if (!hash_lookup(peerhash, &holder)) {
	258	struct pkat *pkat = pkat_new(peer);
	259	hash_get(peerhash, pkat, hash_alloc_intern);
	260	peer_lock(peer);
	261	}
49507a6f	262	SET_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON);
03014d48	263	}
b72b6f4f	264	bgp_keepalives_wake();
03014d48 QY	265	}
03014d48 QY	266
b72b6f4f	267	void bgp_keepalives_off(struct peer *peer)
03014d48	268	{
096476dd QY	269	if (!CHECK_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON))
	270	return;
	271
1ac267a2	272	struct frr_pthread *fpt = bgp_pth_ka;
a715eab3 QY	273	assert(fpt->running);
a715eab3 QY	274
bd8b71e4 QY	275	/* placeholder bucket data to use for fast key lookups */
bd8b71e4 QY	276	static struct pkat holder = {0};
49507a6f	277
68ede9c4 DS	278	/*
	279	* We need to ensure that bgp_keepalives_init was called first
	280	*/
	281	assert(peerhash_mtx);
934af458	282
00dffa8c	283	frr_with_mutex(peerhash_mtx) {
bd8b71e4 QY	284	holder.peer = peer;
	285	struct pkat *res = hash_release(peerhash, &holder);
	286	if (res) {
	287	pkat_del(res);
	288	peer_unlock(peer);
	289	}
49507a6f	290	UNSET_FLAG(peer->thread_flags, PEER_THREAD_KEEPALIVES_ON);
03014d48	291	}
03014d48 QY	292	}
03014d48 QY	293
4d762f26	294	void bgp_keepalives_wake(void)
03014d48	295	{
00dffa8c	296	frr_with_mutex(peerhash_mtx) {
bd8b71e4	297	pthread_cond_signal(peerhash_cond);
03014d48	298	}
03014d48	299	}
0ca8b79f	300
a715eab3	301	int bgp_keepalives_stop(struct frr_pthread fpt, void *result)
0ca8b79f	302	{
a715eab3 QY	303	assert(fpt->running);
	304
	305	atomic_store_explicit(&fpt->running, false, memory_order_relaxed);
b72b6f4f	306	bgp_keepalives_wake();
a715eab3	307
0ca8b79f QY	308	pthread_join(fpt->thread, result);
	309	return 0;
	310	}