test=developlocal_add_cudnn_lstm
peizhilin
7 years ago
commit
6a85dd3278
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,73 @@
|
||||
/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.
|
||||
|
||||
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. */
|
||||
|
||||
#pragma once
|
||||
#include <string>
|
||||
#include <type_traits>
|
||||
|
||||
namespace paddle {
|
||||
namespace operators {
|
||||
namespace math {
|
||||
namespace jitkernel {
|
||||
|
||||
#define SIGMOID_THRESHOLD_MIN -40.0
|
||||
#define SIGMOID_THRESHOLD_MAX 13.0
|
||||
#define EXP_MAX_INPUT 40.0
|
||||
#define XMM_FLOAT_BLOCK 4
|
||||
#define YMM_FLOAT_BLOCK 8
|
||||
#define ZMM_FLOAT_BLOCK 16
|
||||
|
||||
typedef struct {
|
||||
void* gates; // gates: W_ch, W_ih, W_fh, W_oh
|
||||
const void* ct_1;
|
||||
void* ct;
|
||||
void* ht;
|
||||
/* weight_peephole and checked data are only used in peephole*/
|
||||
const void* wp{nullptr};
|
||||
void* checked{nullptr};
|
||||
} lstm_t;
|
||||
|
||||
typedef struct {
|
||||
void* gates; // gates: {W_update, W_reset; W_state}
|
||||
const void* ht_1;
|
||||
void* ht;
|
||||
} gru_t;
|
||||
|
||||
struct rnn_attr_s {
|
||||
int d;
|
||||
std::string act_gate, act_cand;
|
||||
rnn_attr_s() = default;
|
||||
rnn_attr_s(int _d, const std::string& _act_gate, const std::string& _act_cand)
|
||||
: d(_d), act_gate(_act_gate), act_cand(_act_cand) {}
|
||||
};
|
||||
|
||||
struct lstm_attr_s : public rnn_attr_s {
|
||||
bool use_peephole;
|
||||
std::string act_cell;
|
||||
lstm_attr_s() = default;
|
||||
lstm_attr_s(int _d, const std::string& _act_gate,
|
||||
const std::string& _act_cand, const std::string& _act_cell,
|
||||
bool _use_peephole = false)
|
||||
: rnn_attr_s(_d, _act_gate, _act_cand),
|
||||
use_peephole(_use_peephole),
|
||||
act_cell(_act_cell) {}
|
||||
};
|
||||
|
||||
typedef struct rnn_attr_s gru_attr_t;
|
||||
typedef struct lstm_attr_s lstm_attr_t;
|
||||
|
||||
} // namespace jitkernel
|
||||
} // namespace math
|
||||
} // namespace operators
|
||||
} // namespace paddle
|
||||
@ -0,0 +1,238 @@
|
||||
/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.
|
||||
|
||||
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. */
|
||||
|
||||
#pragma once
|
||||
#include <cmath>
|
||||
#include <string>
|
||||
#include "paddle/fluid/operators/math/jit_kernel_impl.h"
|
||||
#include "paddle/fluid/platform/enforce.h"
|
||||
|
||||
namespace paddle {
|
||||
namespace operators {
|
||||
namespace math {
|
||||
namespace jitkernel {
|
||||
namespace refer {
|
||||
/* Refer code only focus on correctness */
|
||||
|
||||
template <typename T>
|
||||
void VMul(const T* x, const T* y, T* z, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
z[i] = x[i] * y[i];
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VAdd(const T* x, const T* y, T* z, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
z[i] = x[i] + y[i];
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VAddRelu(const T* x, const T* y, T* z, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
z[i] = x[i] + y[i];
|
||||
z[i] = z[i] > 0 ? z[i] : 0;
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VScal(const T* a, const T* x, T* y, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
y[i] = a[0] * x[i];
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VAddBias(const T* a, const T* x, T* y, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
y[i] = a[0] + x[i];
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VRelu(const T* x, T* y, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
y[i] = x[i] > 0 ? x[i] : 0;
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline void VIdentity(const T* x, T* y, int n) {}
|
||||
|
||||
template <typename T>
|
||||
void VExp(const T* x, T* y, int n) {
|
||||
for (int i = 0; i < n; ++i) {
|
||||
y[i] = std::exp(x[i]);
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VSigmoid(const T* x, T* y, int n) {
|
||||
// y = 1 / (1 + e^-x)
|
||||
const T min = SIGMOID_THRESHOLD_MIN;
|
||||
const T max = SIGMOID_THRESHOLD_MAX;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
T tmp = (x[i] < min) ? min : ((x[i] > max) ? max : x[i]);
|
||||
y[i] = static_cast<T>(1) / (static_cast<T>(1) + std::exp(-tmp));
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void VTanh(const T* x, T* y, int n) {
|
||||
// y = 2 * sigmoid(2x) - 1
|
||||
for (int i = 0; i < n; ++i) {
|
||||
y[i] = static_cast<T>(2) * x[i];
|
||||
}
|
||||
VSigmoid(y, y, n);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
y[i] = static_cast<T>(2) * y[i] - static_cast<T>(1);
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void (*getActFunc(const std::string& type))(const T*, T*, int) { // NOLINT
|
||||
if (type == "sigmoid") {
|
||||
return VSigmoid<T>;
|
||||
} else if (type == "relu") {
|
||||
return VRelu<T>;
|
||||
} else if (type == "tanh") {
|
||||
return VTanh<T>;
|
||||
} else if (type == "identity" || type == "") {
|
||||
return VIdentity<T>;
|
||||
}
|
||||
PADDLE_THROW("Not support type: %s", type);
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
// compute ct and ht
|
||||
template <typename T>
|
||||
void LSTMCtHt(lstm_t* step, const lstm_attr_t* attr) {
|
||||
T* gates = reinterpret_cast<T*>(step->gates);
|
||||
const T* ct_1 = reinterpret_cast<const T*>(step->ct_1);
|
||||
T* ct = reinterpret_cast<T*>(step->ct);
|
||||
T* ht = reinterpret_cast<T*>(step->ht);
|
||||
const T* wp = reinterpret_cast<const T*>(step->wp);
|
||||
T* checked = reinterpret_cast<T*>(step->checked);
|
||||
auto act_gate = getActFunc<T>(attr->act_gate);
|
||||
auto act_cand = getActFunc<T>(attr->act_cand);
|
||||
auto act_cell = getActFunc<T>(attr->act_cell);
|
||||
int d = attr->d;
|
||||
int d2 = d * 2;
|
||||
int d3 = d * 3;
|
||||
// gates: W_ch, W_ih, W_fh, W_oh
|
||||
if (attr->use_peephole) {
|
||||
VMul(wp, ct_1, checked, d);
|
||||
VMul(wp + d, ct_1, checked + d, d);
|
||||
VAdd(checked, gates + d, gates + d, d2);
|
||||
act_gate(gates + d, gates + d, d2);
|
||||
} else {
|
||||
act_gate(gates + d, gates + d, d3);
|
||||
}
|
||||
|
||||
// C_t = C_t-1 * fgated + cand_gated * igated
|
||||
act_cand(gates, gates, d);
|
||||
VMul(gates, gates + d, gates + d, d);
|
||||
VMul(ct_1, gates + d2, gates + d2, d);
|
||||
VAdd(gates + d, gates + d2, ct, d);
|
||||
|
||||
if (attr->use_peephole) {
|
||||
// get ogated
|
||||
VMul(wp + d2, ct, gates + d, d);
|
||||
VAdd(gates + d, gates + d3, gates + d3, d);
|
||||
act_gate(gates + d3, gates + d3, d);
|
||||
}
|
||||
// H_t = act_cell(C_t) * ogated
|
||||
act_cell(ct, gates + d2, d);
|
||||
VMul(gates + d2, gates + d3, ht, d);
|
||||
}
|
||||
|
||||
// compute c1 and h1 without c0 or h0
|
||||
template <typename T>
|
||||
void LSTMC1H1(lstm_t* step, const lstm_attr_t* attr) {
|
||||
T* gates = reinterpret_cast<T*>(step->gates);
|
||||
T* ct = reinterpret_cast<T*>(step->ct);
|
||||
T* ht = reinterpret_cast<T*>(step->ht);
|
||||
auto act_gate = getActFunc<T>(attr->act_gate);
|
||||
auto act_cand = getActFunc<T>(attr->act_cand);
|
||||
auto act_cell = getActFunc<T>(attr->act_cell);
|
||||
int d = attr->d;
|
||||
int d2 = d * 2;
|
||||
int d3 = d * 3;
|
||||
/* C_t = igated * cgated*/
|
||||
act_gate(gates + d, gates + d, d);
|
||||
act_cand(gates, gates, d);
|
||||
VMul(gates, gates + d, ct, d);
|
||||
if (attr->use_peephole) {
|
||||
// get outgated, put W_oc * C_t on igated
|
||||
const T* wp = reinterpret_cast<const T*>(step->wp);
|
||||
VMul(wp + d2, ct, gates + d, d);
|
||||
VAdd(gates + d, gates + d3, gates + d3, d);
|
||||
}
|
||||
/* H_t = act_cell(C_t) * ogated */
|
||||
act_gate(gates + d3, gates + d3, d);
|
||||
act_cell(ct, gates + d2, d);
|
||||
VMul(gates + d2, gates + d3, ht, d);
|
||||
}
|
||||
|
||||
// compute h1 without h0
|
||||
template <typename T>
|
||||
void GRUH1(gru_t* step, const gru_attr_t* attr) {
|
||||
T* gates = reinterpret_cast<T*>(step->gates);
|
||||
T* ht = reinterpret_cast<T*>(step->ht);
|
||||
auto act_gate = getActFunc<T>(attr->act_gate);
|
||||
auto act_cand = getActFunc<T>(attr->act_cand);
|
||||
int d = attr->d;
|
||||
int d2 = d * 2;
|
||||
act_gate(gates, gates, d);
|
||||
act_cand(gates + d2, gates + d2, d);
|
||||
VMul(gates, gates + d2, ht, d);
|
||||
}
|
||||
|
||||
// compute the first part of GRU: ht = act_gate(r) * ht_1
|
||||
template <typename T>
|
||||
void GRUHtPart1(gru_t* step, const gru_attr_t* attr) {
|
||||
// W: {W_update, W_reset; W_state}
|
||||
T* gates = reinterpret_cast<T*>(step->gates);
|
||||
T* ht = reinterpret_cast<T*>(step->ht);
|
||||
const T* ht_1 = reinterpret_cast<const T*>(step->ht_1);
|
||||
auto act_gate = getActFunc<T>(attr->act_gate);
|
||||
act_gate(gates + attr->d, gates + attr->d, attr->d);
|
||||
VMul(ht_1, gates + attr->d, ht, attr->d);
|
||||
}
|
||||
|
||||
// compute the second part of GRU:
|
||||
// ht = act_gate(u) * act_cand(s) + (1-act_gate(u)) * ht_1
|
||||
template <typename T>
|
||||
void GRUHtPart2(gru_t* step, const gru_attr_t* attr) {
|
||||
T* gates = reinterpret_cast<T*>(step->gates);
|
||||
T* ht = reinterpret_cast<T*>(step->ht);
|
||||
const T* ht_1 = reinterpret_cast<const T*>(step->ht_1);
|
||||
auto act_gate = getActFunc<T>(attr->act_gate);
|
||||
auto act_cand = getActFunc<T>(attr->act_cand);
|
||||
int d = attr->d;
|
||||
T* y = gates + d * 2;
|
||||
act_gate(gates, gates, d);
|
||||
act_cand(y, y, d);
|
||||
// out = zt*ht~ + (1-zt)*ht_1
|
||||
for (int i = 0; i < d; ++i) {
|
||||
ht[i] = gates[i] * y[i] + (static_cast<T>(1) - gates[i]) * ht_1[i];
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace refer
|
||||
} // namespace jitkernel
|
||||
} // namespace math
|
||||
} // namespace operators
|
||||
} // namespace paddle
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in new issue