MirrorHub/construct
0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-11-25 08:12:37 +01:00
Code Issues Releases Wiki Activity

ircd: Vector initialization fixes for GCC.

Browse source
This commit is contained in:
Jason Volk 2021-05-14 03:31:12 -07:00
parent 7576c11897
commit 4f97dcf456
2 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
include/ircd/math/smax.h
View file

@ -95,7 +95,7 @@ ircd::math::smax(const vector_view<T> &__restrict__ out,
assert(exps.size() >= in.size()); assert(exps.size() >= in.size());
for(uint i(0); i < size(in); ++i) for(uint i(0); i < size(in); ++i)
acc[i] = {0}; acc[i] = D{0};
for(uint i(0); i < size(in); ++i) for(uint i(0); i < size(in); ++i)
exps[i] = exp(lane_cast<D>(in[i])); exps[i] = exp(lane_cast<D>(in[i]));
@ -123,7 +123,7 @@ ircd::math::smax(const vector_view<T> &__restrict__ out,
assert(acc.size() >= in.size()); assert(acc.size() >= in.size());
for(uint i(0); i < size(in); ++i) for(uint i(0); i < size(in); ++i)
acc[i] = {0}; acc[i] = D{0};
for(uint i(0); i < size(in); ++i) for(uint i(0); i < size(in); ++i)
out[i] = exp(in[i]); out[i] = exp(in[i]);

6
ircd/gpt_vocab.cc
View file

@ -397,7 +397,7 @@ ircd::gpt::vocab::pre_tokenize(u8x16 (&token)[16],
len -= (ret[1] + off - 1) - 16; len -= (ret[1] + off - 1) - 16;
// Pack the utf-8 codepoints into the result token // Pack the utf-8 codepoints into the result token
token[i] = {0}; token[i] = u8x16{0};
for(uint j(0); j < cp_num; ++j) for(uint j(0); j < cp_num; ++j)
for(uint k(0); k < rcp_len[j] && idx[j] + k < 16; ++k) for(uint k(0); k < rcp_len[j] && idx[j] + k < 16; ++k)
token[i][idx[j] + k] = rch8[j * 4 + k]; token[i][idx[j] + k] = rch8[j * 4 + k];
@ -694,8 +694,8 @@ ircd::gpt::vocab::bpe_prepare(u8x16 (&out)[16][2],
if(idx[i] >= 16 || !in[idx[i]]) if(idx[i] >= 16 || !in[idx[i]])
break; break;
out[i][0] = {0}; out[i][0] = u8x16{0};
out[i][1] = {0}; out[i][1] = u8x16{0};
for(uint k(0); k < 2; ++k) for(uint k(0); k < 2; ++k)
for(uint j(0); j < cplen[i + k] && idx[i + k] + j < 16; ++j) for(uint j(0); j < cplen[i + k] && idx[i + k] + j < 16; ++j)
out[i][k][j] = in[idx[i + k] + j]; out[i][k][j] = in[idx[i + k] + j];