mirror of
https://git.suyu.dev/suyu/sirit.git
synced 2025-01-11 13:16:02 +00:00
42 lines
1.2 KiB
C++
42 lines
1.2 KiB
C++
/* This file is part of the sirit project.
|
|
* Copyright (c) 2018 ReinUsesLisp
|
|
* This software may be used and distributed according to the terms of the GNU
|
|
* Lesser General Public License version 2.1 or any later version.
|
|
*/
|
|
|
|
#include "insts.h"
|
|
#include "sirit/sirit.h"
|
|
#include <cassert>
|
|
|
|
namespace Sirit {
|
|
|
|
Ref Module::Variable(Ref result_type, spv::StorageClass storage_class,
|
|
Ref initializer) {
|
|
auto op{new Op(spv::Op::OpVariable, bound++, result_type)};
|
|
AddEnum(op, storage_class);
|
|
if (initializer) {
|
|
op->Add(initializer);
|
|
}
|
|
return AddCode(op);
|
|
}
|
|
|
|
Ref Module::Load(Ref result_type, Ref pointer,
|
|
std::optional<spv::MemoryAccessMask> memory_access) {
|
|
auto op{new Op(spv::Op::OpLoad, bound++, result_type)};
|
|
op->Add(pointer);
|
|
if (memory_access) {
|
|
AddEnum(op, *memory_access);
|
|
}
|
|
return AddCode(op);
|
|
}
|
|
|
|
Ref Module::AccessChain(Ref result_type, Ref base,
|
|
const std::vector<Ref>& indexes) {
|
|
assert(indexes.size() > 0);
|
|
auto op{new Op(spv::Op::OpAccessChain, bound++, result_type)};
|
|
op->Add(base);
|
|
op->Add(indexes);
|
|
return AddCode(op);
|
|
}
|
|
|
|
} // namespace Sirit
|