Skip to content

Commit

Permalink
Use connected lists for tape data structure
Browse files Browse the repository at this point in the history
Instead of a single list use mutliple connected lists to store elements.
This allows to dynamically increase the size of tape without the need of
relocating elements.
  • Loading branch information
rohanjulka19 committed Jun 20, 2024
1 parent ac24906 commit 8fd8064
Show file tree
Hide file tree
Showing 5 changed files with 97 additions and 11 deletions.
2 changes: 1 addition & 1 deletion benchmark/AlgorithmicComplexity.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ static void BM_NumericGausP(benchmark::State& state) {
double p[] = {1, 2, 3, 4, 5};
double dx[5] = {0, 0, 0, 0, 0};
double dp[5] = {0, 0, 0, 0, 0};
clad::tape<clad::array_ref<double>> results = {};
clad::old_tape<clad::array_ref<double>> results = {};
int dim = 5;
results.emplace_back(dx, dim);
results.emplace_back(dp, dim);
Expand Down
2 changes: 1 addition & 1 deletion demos/CustomTypeNumDiff.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -134,7 +134,7 @@ int main() {
// This is how we return the derivative with respect to all arguments.
// The order of being placed in this tape should be the same as the order of
// the arguments being passed to the function.
clad::tape<clad::array_ref<
clad::old_tape<clad::array_ref<
double /*This should be the return value of the function you want to differentiate.*/>>
grad = {};
// Place the l-value reference of the variables in the tape.
Expand Down
18 changes: 10 additions & 8 deletions include/clad/Differentiator/Differentiator.h
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@
#include "DynamicGraph.h"
#include "FunctionTraits.h"
#include "Matrix.h"
#include "NewTape.h"
#include "NumericalDiff.h"
#include "Tape.h"

Expand Down Expand Up @@ -43,15 +44,16 @@ inline CUDA_HOST_DEVICE unsigned int GetLength(const char* code) {
}

/// Tape type used for storing values in reverse-mode AD inside loops.
template <typename T>
using tape = tape_impl<T>;
template <typename T> using tape = new_tape_impl<T>;

/// Add value to the end of the tape, return the same value.
template <typename T, typename... ArgsT>
CUDA_HOST_DEVICE T push(tape<T>& to, ArgsT... val) {
to.emplace_back(std::forward<ArgsT>(val)...);
return to.back();
}
template <typename T> using old_tape = tape_impl<T>;

/// Add value to the end of the tape, return the same value.
template <typename T, typename... ArgsT>
CUDA_HOST_DEVICE T push(tape<T>& to, ArgsT... val) {
to.emplace_back(std::forward<ArgsT>(val)...);
return to.back();
}

/// Add value to the end of the tape, return the same value.
/// A specialization for clad::array_ref types to use in reverse mode.
Expand Down
84 changes: 84 additions & 0 deletions include/clad/Differentiator/NewTape.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,84 @@
#ifndef CLAD_NEWTAPE_H
#define CLAD_NEWTAPE_H

#include <cassert>
#include <cstdio>
#include <memory>
#include <type_traits>
#include <utility>

namespace clad {

template <typename T> class Block {
public:
T* _data;
Block<T>* next;
Block<T>* prev;

Block(std::size_t& _capacity) {
_data =
static_cast<T*>(::operator new(_capacity * sizeof(T), std::nothrow));
next = nullptr;
prev = nullptr;
}

~Block() {}
};

template <typename T> class new_tape_impl {
Block<T>* cur_block = nullptr;
std::size_t _capacity = 32;
std::size_t _size = 0;
using pointer = T*;
using reference = T&;

using iterator = pointer;

public:
template <typename... ArgsT>

void emplace_back(ArgsT&&... args) {
if (!cur_block || _size >= _capacity) {
Block<T>* prev_block = cur_block;
cur_block = new Block<T>(_capacity);
if (prev_block) {
prev_block->next = cur_block;
cur_block->prev = prev_block;
}
_size = 0;
}
_size += 1;
::new (const_cast<void*>(static_cast<const volatile void*>(block_end())))
T(std::forward<ArgsT>(args)...);
}

std::size_t size() const { return _size; }

iterator block_begin() {
return reinterpret_cast<iterator>(cur_block->_data);
}

iterator block_end() {
return reinterpret_cast<iterator>(cur_block->_data + _size - 1);
}

reference back() {
assert(_size || cur_block->prev);
return block_begin()[_size - 1];
}

void pop_back() {
assert(_size || cur_block->prev);
block_end()->~T();
_size -= 1;
if (_size == 0) {
Block<T>* temp = cur_block;
cur_block = cur_block->prev;
temp->~Block<T>();
_size = _capacity;
}
}
};
} // namespace clad

#endif // CLAD_NEWTAPE_H
2 changes: 1 addition & 1 deletion test/NumericalDiff/PureCentralDiffCalls.C
Original file line number Diff line number Diff line change
Expand Up @@ -75,7 +75,7 @@ int main() { // expected-no-diagnostics
printf("Result is = %f\n", func1_res); // CHECK-EXEC: Result is = 2.000000

// Gradients, derivative wrt all args
clad::tape<clad::array_ref<double>> grad = {};
clad::old_tape<clad::array_ref<double>> grad = {};
grad.emplace_back(dx, 3);
grad.emplace_back(&dy);
grad.emplace_back(&dz);
Expand Down

0 comments on commit 8fd8064

Please sign in to comment.