aboutsummaryrefslogtreecommitdiffstats
path: root/openbsc/src/libcommon
diff options
context:
space:
mode:
authorHolger Hans Peter Freyther <holger@moiji-mobile.com>2014-12-17 15:44:32 +0100
committerHolger Hans Peter Freyther <holger@moiji-mobile.com>2014-12-17 15:50:11 +0100
commitf7e23c5ff7d28c985d6c1e6d1dc0b9e8f5895a30 (patch)
tree2fb7a5fed1315f299ed37eb919d238a51c611246 /openbsc/src/libcommon
parentc22930e24b8d61cecb1fa7c46fd5dc96355d4978 (diff)
bts: When one link drops.. check what needs to be dropped
In case a BTS is dropped, iterate over the list of BTS and check if a dependency is now missing and then drop the BTS. This check could lead to check of 256*256 checks (e.g. all BTS on each other in the chain and the master is being dropped). The performance aspect of it doesn't matter for our usecase. We expect to have pairs of BTS right now.
Diffstat (limited to 'openbsc/src/libcommon')
-rw-r--r--openbsc/src/libcommon/gsm_data.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/openbsc/src/libcommon/gsm_data.c b/openbsc/src/libcommon/gsm_data.c
index 73041fcec..7cb1d3814 100644
--- a/openbsc/src/libcommon/gsm_data.c
+++ b/openbsc/src/libcommon/gsm_data.c
@@ -388,7 +388,7 @@ void bts_depend_clear(struct gsm_bts *bts, int dep)
bts->depends_on[idx] &= ~(1 << bit);
}
-static int bts_depend_is_depedency(struct gsm_bts *base, struct gsm_bts *other)
+int bts_depend_is_depedency(struct gsm_bts *base, struct gsm_bts *other)
{
int idx, bit;
depends_calc_index_bit(other->nr, &idx, &bit);