Mercurial > hg > freeDiameter
view libfdproto/lists.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 | 1af09cc156d6 |
children |
line wrap: on
line source
/********************************************************************************************************* * Software License Agreement (BSD License) * * Author: Sebastien Decugis <sdecugis@freediameter.net> * * * * Copyright (c) 2013, 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 "fdproto-internal.h" /* Initialize a list element */ void fd_list_init ( struct fd_list * list, void * obj ) { memset(list, 0, sizeof(struct fd_list)); list->next = list; list->prev = list; list->head = list; list->o = obj; } #define CHECK_SINGLE( li ) { \ ASSERT( ((struct fd_list *)(li))->next == (li) ); \ ASSERT( ((struct fd_list *)(li))->prev == (li) ); \ ASSERT( ((struct fd_list *)(li))->head == (li) ); \ } /* insert after a reference, checks done */ static void list_insert_after( struct fd_list * ref, struct fd_list * item ) { item->prev = ref; item->next = ref->next; item->head = ref->head; ref->next->prev = item; ref->next = item; } /* insert after a reference */ void fd_list_insert_after ( struct fd_list * ref, struct fd_list * item ) { ASSERT(item != NULL); ASSERT(ref != NULL); CHECK_SINGLE ( item ); ASSERT(ref->head != item); list_insert_after(ref, item); } /* Move all elements of list senti at the end of list ref */ void fd_list_move_end(struct fd_list * ref, struct fd_list * senti) { struct fd_list * li; ASSERT(ref->head == ref); ASSERT(senti->head == senti); if (senti->next == senti) return; for (li = senti->next; li != senti; li = li->next) li->head = ref; senti->next->prev = ref->prev; ref->prev->next = senti->next; senti->prev->next = ref; ref->prev = senti->prev; senti->prev = senti; senti->next = senti; } /* insert before a reference, checks done */ static void list_insert_before ( struct fd_list * ref, struct fd_list * item ) { item->prev = ref->prev; item->next = ref; item->head = ref->head; ref->prev->next = item; ref->prev = item; } /* insert before a reference */ void fd_list_insert_before ( struct fd_list * ref, struct fd_list * item ) { ASSERT(item != NULL); ASSERT(ref != NULL); CHECK_SINGLE ( item ); ASSERT(ref->head != item); list_insert_before(ref, item); } /* Insert an item in an ordered list -- ordering function provided. If duplicate object found, it is returned in ref_duplicate */ int fd_list_insert_ordered( struct fd_list * head, struct fd_list * item, int (*cmp_fct)(void *, void *), void ** ref_duplicate) { struct fd_list * ptr = head; int cmp; /* Some debug sanity checks */ ASSERT(head != NULL); ASSERT(item != NULL); ASSERT(cmp_fct != NULL); ASSERT(head->head == head); CHECK_SINGLE ( item ); /* loop in the list */ while (ptr->next != head) { /* Compare the object to insert with the next object in list */ cmp = cmp_fct( item->o, ptr->next->o ); if (!cmp) { /* An element with the same key already exists */ if (ref_duplicate != NULL) *ref_duplicate = ptr->next->o; return EEXIST; } if (cmp < 0) break; /* We must insert the element here */ ptr = ptr->next; } /* Now insert the element between ptr and ptr->next */ list_insert_after( ptr, item ); /* Ok */ return 0; } /* Unlink an object */ void fd_list_unlink ( struct fd_list * item ) { ASSERT(item != NULL); if (item->head == item) return; /* unlink */ item->next->prev = item->prev; item->prev->next = item->next; /* sanitize */ item->next = item; item->prev = item; item->head = item; }