test_str.c

// Copyright 2023 luo-zeqi
//
// Licensed under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0
//
// 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.

#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <sys/time.h>
#include <stdlib.h>

#include "mempool.h"
#include "llist.h"

#define ARR_LEN(arr, type) (sizeof(arr) / sizeof(type))

#define USE_XMEMPOOL
#define XMEM_BLOCK_SIZE 16

#ifdef USE_XMEMPOOL
xmempool_t mp;
#endif

// The data generate by Chat-GPT.
const char *test_data[] = {
    "Hello World!",
    "Live and let live.",
    "Time is money.",
    "Practice makes perfect.",
    "All is fair in love and war.",
    "Actions speak louder than words.",
    "Beauty is in the eye of the beholder.",
    "Knowledge is power.",
    "Where there's smoke, there's fire.",
    "You can't have your cake and eat it too.",
    "It takes two to tango.",
    "Every cloud has a silver lining.",
    "The early bird catches the worm.",
    "Two heads are better than one.",
    "Look before you leap.",
    "A picture is worth a thousand words.",
    "Rome wasn't built in a day.",
    "Practice what you preach.",
    "When in Rome, do as the Romans do.",
    "Better late than never.",
    "Don't count your chickens before they hatch.",
    "When the going gets tough, the tough get going.",
    "All that glitters is not gold.",
    "The grass is always greener on the other side.",
    "No pain, no gain.",
    "Curiosity killed the cat.",
    "Haste makes waste.",
    "Don't put all your eggs in one basket.",
    "Necessity is the mother of invention.",
    "What goes up must come down.",
    "A bird in the hand is worth two in the bush.",
    "The pen is mightier than the sword.",
    "Actions speak louder than words.",
    "Love conquers all.",
    "Time heals all wounds.",
    "Beauty is only skin deep.",
    "A watched pot never boils.",
    "Better safe than sorry.",
    "Good things come to those who wait.",
    "Laughter is the best medicine.",
    "Where there's a will, there's a way.",
};

int64_t order_alloc() {
  int i;
  struct timeval t1, t2;
  struct xstring {
    char *ptr;
  } strs[ARR_LEN(test_data, char *)];

  gettimeofday(&t1, NULL);

  for (i = 0; i < ARR_LEN(test_data, char *); i++) {
#ifdef USE_XMEMPOOL
    strs[i].ptr = xmempool_alloc(&mp, (int) strlen(test_data[i]));
#else
    strs[i].ptr = malloc(strlen(test_data[i]));
#endif
    assert(strs[i].ptr);

    memcpy(strs[i].ptr, test_data[i], strlen(test_data[i]));
  }

  for (i = 0; i < ARR_LEN(test_data, char *); i++) {
#ifdef USE_XMEMPOOL
    xmempool_free(&mp, strs[i].ptr);
#else
    free(strs[i].ptr);
#endif
  }

  gettimeofday(&t2, NULL);

  return (t2.tv_sec-t1.tv_sec) * 1000000 + (t2.tv_usec - t1.tv_usec);
}

typedef struct xstr {
  llnode_t node;
} xstr_t;

static long count = 0;
static xstr_t head, *curr, *tmp;

int64_t random_alloc() {
  int i, j;
  int size;
  long datanum, allocflag, idx;
  struct timeval t1, t2;

  gettimeofday(&t1, NULL);

  curr = &head;
  datanum = ARR_LEN(test_data, char *);
  for (i = 0; i < datanum * 2; i++) {
    allocflag = rand() % 2;
    if (allocflag && count < 1000) {
      idx = rand() % datanum;
      size = (int) (strlen(test_data[idx]) + sizeof(xstr_t));
#ifdef USE_XMEMPOOL
      tmp = (xstr_t *) xmempool_alloc(&mp, size);
#else
      tmp = (xstr_t *) malloc(size);
#endif
      llist_add(&head.node, &tmp->node);
      count++;
    } else {
      if (count == 0) continue;

      idx = rand() % count;
      curr = &head;
      for (j = 0; j <= idx; j++) {
        curr = (xstr_t *) (curr->node.next);
      }
      llist_remove(&curr->node);

#ifdef USE_XMEMPOOL
      xmempool_free(&mp, curr);
#else
      free(curr);
#endif
      count--;
    }
  }

  gettimeofday(&t2, NULL);

  return (t2.tv_sec-t1.tv_sec) * 1000000 + (t2.tv_usec - t1.tv_usec);
}

int main() {
  int i;
  int batch = 100000;
  int64_t tuse = 0;

  llist_init(&head.node);

  //
#ifdef USE_XMEMPOOL
  xmempool_init(&mp, 4, 16, 24, 32, 64);
#endif

  for (i = 0; i < batch; i++)
    tuse += random_alloc();

  printf("Average elapsed time: %lld\n", tuse / (int64_t) count);

#ifdef USE_XMEMPOOL
  xmempool_destroy(&mp);
#endif
}