ddlist.cpp

Go to the documentation of this file.

#include "fvar.hpp"

#include <stdlib.h>
#ifndef OPT_LIB
  #include <cassert>
#endif

dlist::dlist()
{
  int on,nopt = 0;
  if ( (on=option_match(ad_comm::argc,ad_comm::argv,"-mdl",nopt))>-1)
  {
    if (nopt == 1)
    {
      int i = atoi(ad_comm::argv[on+1]);
      if (i > 0)
        gradient_structure::MAX_DLINKS = (unsigned int)i;
    }
    else
    {
      cerr << "Wrong number of options to -mdl -- must be 1"
        " you have " << nopt << endl;
      ad_exit(1);
    }
  }
  last = 0;
  nlinks = 0;
  dlink_addresses = new dlink*[gradient_structure::MAX_DLINKS];
  const size_t size = 2 * sizeof(double) * (gradient_structure::MAX_DLINKS + 1);
  ddlist_space = (char*)malloc(size * sizeof(char));

  variables_save = new double[gradient_structure::MAX_DLINKS];

#ifndef OPT_LIB
  //fails for insufficient memory to allocate space for dvariables save buffer
  assert(variables_save != NULL);
#endif

  //Initialize addresses to zero
  memset(dlink_addresses, 0, sizeof(dlink*) * gradient_structure::MAX_DLINKS);
}
dlist::~dlist()
{
  if (dlink_addresses)
  {
    delete [] dlink_addresses;
    dlink_addresses = NULL;
  }
  if (ddlist_space)
  {
    ::free(ddlist_space);
    ddlist_space = NULL;
  }
  if (variables_save)
  {
    delete [] variables_save;
    variables_save = NULL;
  }
}
dlink* dlist::create()
{
  dlink* link = (dlink*)(ddlist_space+2*sizeof(double)*nlinks);
#ifndef OPT_LIB
  assert(link);
#endif

  //do not add to list.
  link->prev=0;

#ifndef OPT_LIB
  //If fails, then need to increase the maximum number of dlinks.
  assert(nlinks <= gradient_structure::MAX_DLINKS);
#endif

  // keep track of the links so you can zero them out
  dlink_addresses[nlinks] = link;
  ++nlinks;

  return link;
}
dlink* dlist::last_remove()
{
  dlink* link = last;
  if (link)
  {
    last = link->prev;
    link->prev = NULL;
  }
  return link;
}
dlink* dlist::append(dlink* link)
{
#ifndef OPT_LIB
  //Should fail if link is NULL.
  assert(link);
#endif

  link->prev = last;
  last = link;

  return last;
}
void dlist::initialize()
{
  dlink** dest = dlink_addresses;
  for (unsigned int i = 0; i < nlinks; ++i)
  {
    (*dest)->di.x = 0;
    ++dest;
  }
}
void dlist::save_variables()
{
  dlink** src = dlink_addresses;
  double* dest = variables_save;
  for (unsigned int i = 0; i < nlinks; ++i)
  {
    *dest = (*src)->di.x;
    ++dest;
    ++src;
  }
}
void dlist::restore_variables()
{
  dlink** dest = dlink_addresses;
  double* src = variables_save;
  for (unsigned int i = 0; i < nlinks; ++i)
  {
    (*dest)->di.x = *src;
    ++dest;
    ++src;
  }
}
size_t dlist::total_addresses() const
{
  size_t total = 0;
  for (unsigned int i = 0; i < gradient_structure::MAX_DLINKS; ++i)
  {
    if (dlink_addresses[i] != 0)
    {
      total++;
    }
  }
  return total;
}
void dlist::check_list(void)
{
  dlink* tmp_last=last;

  unsigned int count=0;
  while(tmp_last && count <=nlinks)
  {
    count+=1;
    if (count > nlinks)
    {
      cerr << "In check_list() number of links > number created\n";
      cerr << " The number created was "<< nlinks << endl;
    }

    dlink* tmp = tmp_last->prev;

//  cout << "last =" << _farptr_tolong(last) << "\n";
//  cout << "last->prev =" << _farptr_tolong(last->prev) << "\n";
//  cout << "deleted dlink with address" << _farptr_tolong(last) << "\n";

    tmp_last = tmp;
  }
  cerr << "In check_list() number of free links is " << count << endl;
}