207 lines
5.8 KiB
C
207 lines
5.8 KiB
C
/*
|
|
* Licensed to the OpenAirInterface (OAI) Software Alliance under one or more
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
* this work for additional information regarding copyright ownership.
|
|
* The OpenAirInterface Software Alliance licenses this file to You under
|
|
* the OAI Public License, Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.openairinterface.org/?page_id=698
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*-------------------------------------------------------------------------------
|
|
* For more information about the OpenAirInterface (OAI) Software Alliance:
|
|
* contact@openairinterface.org
|
|
*/
|
|
|
|
/*! \file s1ap_eNB_management_procedures.c
|
|
* \brief S1AP eNB task
|
|
* \author S. Roux and Navid Nikaein
|
|
* \date 2010 - 2016
|
|
* \email: navid.nikaein@eurecom.fr
|
|
* \version 1.0
|
|
* @ingroup _s1ap
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <stdint.h>
|
|
|
|
#include "intertask_interface.h"
|
|
|
|
#include "assertions.h"
|
|
#include "conversions.h"
|
|
|
|
#include "s1ap_common.h"
|
|
#include "s1ap_eNB_defs.h"
|
|
#include "s1ap_eNB.h"
|
|
|
|
static s1ap_eNB_internal_data_t s1ap_eNB_internal_data;
|
|
|
|
RB_GENERATE(s1ap_mme_map, s1ap_eNB_mme_data_s, entry, s1ap_eNB_compare_assoc_id);
|
|
|
|
int s1ap_eNB_compare_assoc_id(
|
|
struct s1ap_eNB_mme_data_s *p1, struct s1ap_eNB_mme_data_s *p2)
|
|
{
|
|
if (p1->assoc_id == -1) {
|
|
if (p1->cnx_id < p2->cnx_id) {
|
|
return -1;
|
|
}
|
|
|
|
if (p1->cnx_id > p2->cnx_id) {
|
|
return 1;
|
|
}
|
|
} else {
|
|
if (p1->assoc_id < p2->assoc_id) {
|
|
return -1;
|
|
}
|
|
|
|
if (p1->assoc_id > p2->assoc_id) {
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
/* Matching reference */
|
|
return 0;
|
|
}
|
|
|
|
uint16_t s1ap_eNB_fetch_add_global_cnx_id(void)
|
|
{
|
|
return ++s1ap_eNB_internal_data.global_cnx_id;
|
|
}
|
|
|
|
void s1ap_eNB_prepare_internal_data(void)
|
|
{
|
|
memset(&s1ap_eNB_internal_data, 0, sizeof(s1ap_eNB_internal_data));
|
|
STAILQ_INIT(&s1ap_eNB_internal_data.s1ap_eNB_instances_head);
|
|
}
|
|
|
|
void s1ap_eNB_insert_new_instance(s1ap_eNB_instance_t *new_instance_p)
|
|
{
|
|
DevAssert(new_instance_p != NULL);
|
|
|
|
STAILQ_INSERT_TAIL(&s1ap_eNB_internal_data.s1ap_eNB_instances_head,
|
|
new_instance_p, s1ap_eNB_entries);
|
|
}
|
|
|
|
struct s1ap_eNB_mme_data_s *s1ap_eNB_get_MME(s1ap_eNB_instance_t *instance_p, sctp_assoc_t assoc_id, uint16_t cnx_id)
|
|
{
|
|
struct s1ap_eNB_mme_data_s temp;
|
|
struct s1ap_eNB_mme_data_s *found;
|
|
struct s1ap_eNB_mme_data_s *mme_p;
|
|
|
|
memset(&temp, 0, sizeof(struct s1ap_eNB_mme_data_s));
|
|
|
|
temp.assoc_id = assoc_id;
|
|
temp.cnx_id = cnx_id;
|
|
|
|
if( cnx_id != 0 ) {
|
|
if (instance_p == NULL) {
|
|
STAILQ_FOREACH(instance_p, &s1ap_eNB_internal_data.s1ap_eNB_instances_head,
|
|
s1ap_eNB_entries) {
|
|
found = RB_FIND(s1ap_mme_map, &instance_p->s1ap_mme_head, &temp);
|
|
|
|
if (found != NULL) {
|
|
return found;
|
|
}
|
|
}
|
|
} else {
|
|
return RB_FIND(s1ap_mme_map, &instance_p->s1ap_mme_head, &temp);
|
|
}
|
|
} else {
|
|
if (instance_p == NULL) {
|
|
STAILQ_FOREACH(instance_p, &s1ap_eNB_internal_data.s1ap_eNB_instances_head,
|
|
s1ap_eNB_entries) {
|
|
RB_FOREACH(mme_p, s1ap_mme_map, &instance_p->s1ap_mme_head) {
|
|
if( mme_p->assoc_id == assoc_id ) {
|
|
return mme_p;
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
RB_FOREACH(mme_p, s1ap_mme_map, &instance_p->s1ap_mme_head) {
|
|
if( mme_p->assoc_id == assoc_id ) {
|
|
return mme_p;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct s1ap_eNB_mme_data_s *s1ap_eNB_get_MME_from_instance(
|
|
s1ap_eNB_instance_t *instance_p)
|
|
{
|
|
|
|
struct s1ap_eNB_mme_data_s *mme = NULL;
|
|
struct s1ap_eNB_mme_data_s *mme_next = NULL;
|
|
|
|
for (mme = RB_MIN(s1ap_mme_map, &instance_p->s1ap_mme_head); mme!=NULL ; mme = mme_next) {
|
|
mme_next = RB_NEXT(s1ap_mme_map, &instance_p->s1ap_mme_head, mme);
|
|
if (mme->s1ap_eNB_instance == instance_p) {
|
|
return mme;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
s1ap_eNB_instance_t *s1ap_eNB_get_instance(instance_t instance)
|
|
{
|
|
s1ap_eNB_instance_t *temp = NULL;
|
|
|
|
STAILQ_FOREACH(temp, &s1ap_eNB_internal_data.s1ap_eNB_instances_head,
|
|
s1ap_eNB_entries) {
|
|
if (temp->instance == instance) {
|
|
/* Matching occurence */
|
|
return temp;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void s1ap_eNB_remove_mme_desc(s1ap_eNB_instance_t * instance)
|
|
{
|
|
|
|
struct s1ap_eNB_mme_data_s *mme = NULL;
|
|
struct s1ap_eNB_mme_data_s *mmeNext = NULL;
|
|
struct plmn_identity_s* plmnInfo;
|
|
struct served_group_id_s* groupInfo;
|
|
struct served_gummei_s* gummeiInfo;
|
|
struct mme_code_s* mmeCode;
|
|
|
|
for (mme = RB_MIN(s1ap_mme_map, &instance->s1ap_mme_head); mme; mme = mmeNext) {
|
|
mmeNext = RB_NEXT(s1ap_mme_map, &instance->s1ap_mme_head, mme);
|
|
RB_REMOVE(s1ap_mme_map, &instance->s1ap_mme_head, mme);
|
|
while (!STAILQ_EMPTY(&mme->served_gummei)) {
|
|
gummeiInfo = STAILQ_FIRST(&mme->served_gummei);
|
|
STAILQ_REMOVE_HEAD(&mme->served_gummei, next);
|
|
|
|
while (!STAILQ_EMPTY(&gummeiInfo->served_plmns)) {
|
|
plmnInfo = STAILQ_FIRST(&gummeiInfo->served_plmns);
|
|
STAILQ_REMOVE_HEAD(&gummeiInfo->served_plmns, next);
|
|
free(plmnInfo);
|
|
}
|
|
while (!STAILQ_EMPTY(&gummeiInfo->served_group_ids)) {
|
|
groupInfo = STAILQ_FIRST(&gummeiInfo->served_group_ids);
|
|
STAILQ_REMOVE_HEAD(&gummeiInfo->served_group_ids, next);
|
|
free(groupInfo);
|
|
}
|
|
while (!STAILQ_EMPTY(&gummeiInfo->mme_codes)) {
|
|
mmeCode = STAILQ_FIRST(&gummeiInfo->mme_codes);
|
|
STAILQ_REMOVE_HEAD(&gummeiInfo->mme_codes, next);
|
|
free(mmeCode);
|
|
}
|
|
free(gummeiInfo);
|
|
}
|
|
free(mme);
|
|
}
|
|
}
|