Mercurial > hg > freeDiameter
view libfdcore/apps.c @ 1513:73e563165594
Add 3GPP TS 29.468 V15.8.0 (2019-12)
Add AVPs:
- BMSC-Address, Address, code 3500, section 6.4.2
- BMSC-Port, Unsigned32, code 3501, section 6.4.3
- Common-Tunnel-Endpoint-Identifier, OctetString, code 3524, section 6.4.26
- FEC-Request, OctetString, code 3525, section 6.4.27
- FEC-Result, Unsigned32, code 3531, section 6.4.33
- Local-M1-Information, Grouped, code 3518, section 6.4.20
- Local-MB2-U-Information, Grouped, code 3519, section 6.4.21
- MB2U-Security, Unsigned32, code 3517, section 6.4.19
- MBMS-Bearer-Event, Unsigned32, code 3502, section 6.4.4
- MBMS-Bearer-Event-Notification, Grouped, code 3503, section 6.4.5
- MBMS-Bearer-Request, Grouped, code 3504, section 6.4.6
- MBMS-Bearer-Response, Grouped, code 3505, section 6.4.7
- MBMS-Bearer-Result, Unsigned32, code 3506, section 6.4.8
- MBMS-eNB-IP-Multicast-Address, Address, code 3520, section 6.4.22
- MBMS-eNB-IPv6-Multicast-Address, Address, code 3521, section 6.4.23
- MBMS-GW-SSM-IP-Address-29.468, Address, code 3522, section 6.4.24
- MBMS-GW-SSM-IPv6-Address-29.468, Address, code 3523, section 6.4.25
- MBMS-Start-Time, Time, code 3507, section 6.4.9
- Radio-Frequency-29.468, Unsigned32, code 3508, section 6.4.10
- ROHC-Full-Header-Periodicity, Float32, code 3527, section 6.4.29
- ROHC-Max-CID, Unsigned32, code 3532, section 6.4.34
- ROHC-Profile, Unsigned32, code 3528, section 6.4.30
- ROHC-Request, Grouped, code 3526, section 6.4.28
- ROHC-Result, Unsigned32, code 3530, section 6.4.32
- TMGI-Allocation-Request, Grouped, code 3509, section 6.4.11
- TMGI-Allocation-Response, Grouped, code 3510, section 6.4.12
- TMGI-Allocation-Result, Unsigned32, code 3511, section 6.4.13
- TMGI-Deallocation-Request, Grouped, code 3512, section 6.4.14
- TMGI-Deallocation-Response, Grouped, code 3513, section 6.4.15
- TMGI-Deallocation-Result, Unsigned32, code 3514, section 6.4.16
- TMGI-Expiry, Grouped, code 3515, section 6.4.17
- TMGI-Number, Unsigned32, code 3516, section 6.4.18
- Userplane-Protocol-Result, Grouped, code 3529, section 6.4.31
Note: Name conflict with 3GPP TS 29.061 MBMS-GW-SSM-IP-Address (924).
3GPP TS 29.061 V10.4.0 (2011-09) CR 0355 added MBMS-GW-SSM-IP-Address (924).
3GPP TS 29.468 V14.0.0 (2016-12) CR 0021 added MBMS-GW-SSM-IP-Address (3522).
Fix: MBMS-GW-SSM-IP-Address (3522) renamed to MBMS-GW-SSM-IP-Address-29.468 (3522).
Note: Name conflict with 3GPP TS 29.061 MBMS-GW-SSM-IPv6-Address (925).
3GPP TS 29.061 V10.4.0 (2011-09) CR 0355 added MBMS-GW-SSM-IPv6-Address (925).
3GPP TS 29.468 V14.0.0 (2016-12) CR 0021 added MBMS-GW-SSM-IPv6-Address (3523).
Fix: MBMS-GW-SSM-IPv6-Address (3523) renamed to MBMS-GW-SSM-IPv6-Address-29.468 (3523).
Note: Name conflict with 3GPP TS 32.299 Radio-Frequency (3462).
3GPP TS 29.468 V12.0.0 (2014-09) added Radio-Frequency (3508).
3GPP TS 32.299 V13.1.0 (2015-06) CR 0638 added Radio-Frequency (3462).
Fix: Radio-Frequency (3508) renamed to Radio-Frequency-29.468 (3508).
author | Luke Mewburn <luke@mewburn.net> |
---|---|
date | Tue, 07 Apr 2020 19:38:33 +1000 |
parents | 4a9f08d6b6ba |
children |
line wrap: on
line source
/********************************************************************************************************* * Software License Agreement (BSD License) * * Author: Sebastien Decugis <sdecugis@freediameter.net> * * * * Copyright (c) 2011, WIDE Project and NICT * * All rights reserved. * * * * Redistribution and use of this software in source and binary forms, with or without modification, are * * permitted provided that the following conditions are met: * * * * * Redistributions of source code must retain the above * * copyright notice, this list of conditions and the * * following disclaimer. * * * * * Redistributions in binary form must reproduce the above * * copyright notice, this list of conditions and the * * following disclaimer in the documentation and/or other * * materials provided with the distribution. * * * * * Neither the name of the WIDE Project or NICT nor the * * names of its contributors may be used to endorse or * * promote products derived from this software without * * specific prior written permission of WIDE Project and * * NICT. * * * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED * * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR * * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR * * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF * * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * *********************************************************************************************************/ #include "fdcore-internal.h" /* Merge information into a list of apps */ int fd_app_merge(struct fd_list * list, application_id_t aid, vendor_id_t vid, int auth, int acct) { struct fd_list * li; int skip = 0; /* List is ordered by appid. Avoid duplicates */ for (li = list; li->next != list; li = li->next) { struct fd_app * na = (struct fd_app *)(li->next); if (na->appid < aid) continue; if (na->appid > aid) break; /* Otherwise, we merge with existing entry -- ignore vendor id in this case */ skip = 1; if (auth) na->flags.auth = 1; if (acct) na->flags.acct = 1; break; } if (!skip) { struct fd_app * new = NULL; CHECK_MALLOC( new = malloc(sizeof(struct fd_app)) ); memset(new, 0, sizeof(struct fd_app)); fd_list_init(&new->chain, NULL); new->flags.auth = (auth ? 1 : 0); new->flags.acct = (acct ? 1 : 0); new->vndid = vid; new->appid = aid; fd_list_insert_after(li, &new->chain); } return 0; } /* Check if a given application id is in a list */ int fd_app_check(struct fd_list * list, application_id_t aid, struct fd_app **detail) { struct fd_list * li; TRACE_ENTRY("%p %d %p", list, aid, detail); CHECK_PARAMS(list && detail); *detail = NULL; /* Search in the list */ for (li = list->next; li != list; li = li->next) { struct fd_app * a = (struct fd_app *)li; if (a->appid < aid) continue; if (a->appid == aid) *detail = a; break; } return 0; } /* Check if two lists have at least one common application */ int fd_app_check_common(struct fd_list * list1, struct fd_list * list2, int * common_found) { struct fd_list * li1, *li2; TRACE_ENTRY("%p %p %p", list1, list2, common_found); CHECK_PARAMS( list1 && list2 && common_found ); /* Both lists are ordered, so advance both pointers at the same time */ for (li1 = list1->next, li2 = list2->next; (li1 != list1) && (li2 != list2); ) { struct fd_app * a1 = (struct fd_app *)li1, *a2 = (struct fd_app *)li2; if (a1->appid < a2->appid) { li1 = li1->next; continue; } if (a1->appid > a2->appid) { li2 = li2->next; continue; } /* They are equal, compare the applications */ if ((a1->flags.auth && a2->flags.auth) || (a1->flags.acct && a2->flags.acct)) { /* found! */ *common_found = 1; return 0; } /* This application is not common, advance both lists */ li1 = li1->next; li2 = li2->next; } /* We did not find a common app */ *common_found = 0; return 0; } /* Remove the apps from a list */ int fd_app_empty(struct fd_list * list) { TRACE_ENTRY("%p", list); CHECK_PARAMS( list ); while (!FD_IS_LIST_EMPTY(list)) { struct fd_list * li = list->next; fd_list_unlink(li); free(li); } return 0; }