nr_pdcp_sdu.c 2.08 KB
Newer Older
Cedric Roux's avatar
Cedric Roux committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78
/*
 * 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
 */

#include "nr_pdcp_sdu.h"

#include <stdlib.h>
#include <string.h>

nr_pdcp_sdu_t *nr_pdcp_new_sdu(uint32_t count, char *buffer, int size)
{
  nr_pdcp_sdu_t *ret = calloc(1, sizeof(nr_pdcp_sdu_t));
  if (ret == NULL)
    exit(1);
  ret->count = count;
  ret->buffer = malloc(size);
  if (ret->buffer == NULL)
    exit(1);
  memcpy(ret->buffer, buffer, size);
  ret->size = size;
  return ret;
}

nr_pdcp_sdu_t *nr_pdcp_sdu_list_add(nr_pdcp_sdu_t *l, nr_pdcp_sdu_t *sdu)
{
  nr_pdcp_sdu_t head;
  nr_pdcp_sdu_t *cur;
  nr_pdcp_sdu_t *prev;

  head.next = l;
  cur = l;
  prev = &head;

  /* order is by 'count' */
  while (cur != NULL) {
    /* check if 'sdu' is before 'cur' in the list */
    if (sdu->count < cur->count)
      break;
    prev = cur;
    cur = cur->next;
  }
  prev->next = sdu;
  sdu->next = cur;
  return head.next;
}

int nr_pdcp_sdu_in_list(nr_pdcp_sdu_t *l, uint32_t count)
{
  while (l != NULL) {
    if (l->count == count)
      return 1;
    l = l->next;
  }
  return 0;
}

void nr_pdcp_free_sdu(nr_pdcp_sdu_t *sdu)
{
  free(sdu->buffer);
  free(sdu);
}