mirror of
https://github.com/gbdev/rgbds.git
synced 2025-11-20 18:22:07 +00:00
Run clang-format to fix some inconsistent style
This commit is contained in:
@@ -9,10 +9,10 @@
|
|||||||
#include <variant>
|
#include <variant>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
#include "asm/symbol.hpp" // MAXSYMLEN
|
|
||||||
|
|
||||||
#include "platform.hpp" // SSIZE_MAX
|
#include "platform.hpp" // SSIZE_MAX
|
||||||
|
|
||||||
|
#include "asm/symbol.hpp" // MAXSYMLEN
|
||||||
|
|
||||||
#define MAXSTRLEN 255
|
#define MAXSTRLEN 255
|
||||||
|
|
||||||
#define LEXER_BUF_SIZE 42 // TODO: determine a sane value for this
|
#define LEXER_BUF_SIZE 42 // TODO: determine a sane value for this
|
||||||
|
|||||||
@@ -12,10 +12,10 @@
|
|||||||
struct Symbol;
|
struct Symbol;
|
||||||
|
|
||||||
struct Expression {
|
struct Expression {
|
||||||
int32_t val; // If the expression's value is known, it's here
|
int32_t val; // If the expression's value is known, it's here
|
||||||
std::string reason; // Why the expression is not known, if it isn't
|
std::string reason; // Why the expression is not known, if it isn't
|
||||||
bool isKnown; // Whether the expression's value is known at assembly time
|
bool isKnown; // Whether the expression's value is known at assembly time
|
||||||
bool isSymbol; // Whether the expression represents a symbol suitable for const diffing
|
bool isSymbol; // Whether the expression represents a symbol suitable for const diffing
|
||||||
std::vector<uint8_t> *rpn; // Bytes serializing the RPN expression
|
std::vector<uint8_t> *rpn; // Bytes serializing the RPN expression
|
||||||
uint32_t rpnPatchSize; // Size the expression will take in the object file
|
uint32_t rpnPatchSize; // Size the expression will take in the object file
|
||||||
|
|
||||||
|
|||||||
@@ -353,7 +353,6 @@ void rpn_BinaryOp(
|
|||||||
// First, check if the expression is known
|
// First, check if the expression is known
|
||||||
expr.isKnown = src1.isKnown && src2.isKnown;
|
expr.isKnown = src1.isKnown && src2.isKnown;
|
||||||
if (expr.isKnown) {
|
if (expr.isKnown) {
|
||||||
|
|
||||||
// If both expressions are known, just compute the value
|
// If both expressions are known, just compute the value
|
||||||
uint32_t uleft = src1.val, uright = src2.val;
|
uint32_t uleft = src1.val, uright = src2.val;
|
||||||
|
|
||||||
|
|||||||
@@ -249,7 +249,9 @@ static void mergeSections(
|
|||||||
unsigned int nbSectErrors = 0;
|
unsigned int nbSectErrors = 0;
|
||||||
|
|
||||||
if (type != sect.type)
|
if (type != sect.type)
|
||||||
sectError("Section already exists but with type %s\n", sectionTypeInfo[sect.type].name.c_str());
|
sectError(
|
||||||
|
"Section already exists but with type %s\n", sectionTypeInfo[sect.type].name.c_str()
|
||||||
|
);
|
||||||
|
|
||||||
if (sect.modifier != mod) {
|
if (sect.modifier != mod) {
|
||||||
sectError("Section already declared as %s section\n", sectionModNames[sect.modifier]);
|
sectError("Section already declared as %s section\n", sectionModNames[sect.modifier]);
|
||||||
|
|||||||
Reference in New Issue
Block a user