aria2/deps/wslay/tests/wslay_queue_test.c

/*
 * Wslay - The WebSocket Library
 *
 * Copyright (c) 2011, 2012 Tatsuhiro Tsujikawa
 *
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 */
#include "wslay_queue_test.h"

#include <CUnit/CUnit.h>

#include "wslay_queue.h"
#include "wslay_macro.h"

struct queue_entry {
  struct wslay_queue_entry qe;
  int value;
};

void test_wslay_queue(void) {
  struct queue_entry ents[] = {
      {{0}, 1}, {{0}, 2}, {{0}, 3}, {{0}, 4}, {{0}, 5},
  };
  int i;
  struct wslay_queue queue;
  wslay_queue_init(&queue);
  CU_ASSERT(wslay_queue_empty(&queue));
  for (i = 0; i < 5; ++i) {
    wslay_queue_push(&queue, &ents[i].qe);
    CU_ASSERT_EQUAL(ents[0].value, wslay_struct_of(wslay_queue_top(&queue),
                                                   struct queue_entry, qe)
                                       ->value);
    CU_ASSERT(!wslay_queue_empty(&queue));
  }
  for (i = 0; i < 5; ++i) {
    CU_ASSERT_EQUAL(ents[i].value, wslay_struct_of(wslay_queue_top(&queue),
                                                   struct queue_entry, qe)
                                       ->value);
    wslay_queue_pop(&queue);
  }
  CU_ASSERT(wslay_queue_empty(&queue));

  for (i = 0; i < 5; ++i) {
    wslay_queue_push_front(&queue, &ents[i].qe);
    CU_ASSERT_EQUAL(ents[i].value, wslay_struct_of(wslay_queue_top(&queue),
                                                   struct queue_entry, qe)
                                       ->value);
    CU_ASSERT(!wslay_queue_empty(&queue));
  }
  for (i = 4; i >= 0; --i) {
    CU_ASSERT_EQUAL(ents[i].value, wslay_struct_of(wslay_queue_top(&queue),
                                                   struct queue_entry, qe)
                                       ->value);
    wslay_queue_pop(&queue);
  }
  CU_ASSERT(wslay_queue_empty(&queue));
  wslay_queue_deinit(&queue);
}