You've already forked godot
mirror of
https://github.com/godotengine/godot.git
synced 2025-11-05 12:10:55 +00:00
Merge pull request #62574 from kdiduk/50971-duplicate-keys-in-dictionary-literal
[3.x] Check duplicate keys in dictionary literals: enums and const variables
This commit is contained in:
@@ -1127,14 +1127,15 @@ GDScriptParser::Node *GDScriptParser::_parse_expression(Node *p_parent, bool p_s
|
|||||||
}
|
}
|
||||||
expecting = DICT_EXPECT_COMMA;
|
expecting = DICT_EXPECT_COMMA;
|
||||||
|
|
||||||
if (key->type == GDScriptParser::Node::TYPE_CONSTANT) {
|
const Variant *key_value = _try_to_find_constant_value_for_expression(key);
|
||||||
Variant const &keyName = static_cast<const GDScriptParser::ConstantNode *>(key)->value;
|
if (key_value) {
|
||||||
|
if (keys.has(*key_value)) {
|
||||||
if (keys.has(keyName)) {
|
_set_error("Duplicate key \"" + String(*key_value) + "\" found in Dictionary literal",
|
||||||
_set_error("Duplicate key found in Dictionary literal");
|
key->line,
|
||||||
|
key->column);
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
keys.insert(keyName);
|
keys.insert(*key_value);
|
||||||
}
|
}
|
||||||
|
|
||||||
DictionaryNode::Pair pair;
|
DictionaryNode::Pair pair;
|
||||||
@@ -2180,6 +2181,49 @@ bool GDScriptParser::_reduce_export_var_type(Variant &p_value, int p_line) {
|
|||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
const Variant *GDScriptParser::_try_to_find_constant_value_for_expression(const Node *p_expr) const {
|
||||||
|
if (p_expr->type == Node::TYPE_CONSTANT) {
|
||||||
|
return &(static_cast<const ConstantNode *>(p_expr)->value);
|
||||||
|
} else if (p_expr->type == Node::TYPE_IDENTIFIER) {
|
||||||
|
const StringName &name = static_cast<const IdentifierNode *>(p_expr)->name;
|
||||||
|
const Map<StringName, ClassNode::Constant>::Element *element =
|
||||||
|
current_class->constant_expressions.find(name);
|
||||||
|
if (element) {
|
||||||
|
Node *cn_exp = element->value().expression;
|
||||||
|
if (cn_exp->type == Node::TYPE_CONSTANT) {
|
||||||
|
return &(static_cast<ConstantNode *>(cn_exp)->value);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else if (p_expr->type == Node::TYPE_OPERATOR) {
|
||||||
|
// Check if expression `p_expr` is a named enum (e.g. `State.IDLE`).
|
||||||
|
const OperatorNode *op_node = static_cast<const OperatorNode *>(p_expr);
|
||||||
|
if (op_node->op == GDScriptParser::OperatorNode::OP_INDEX_NAMED) {
|
||||||
|
const Vector<Node *> &op_args = op_node->arguments;
|
||||||
|
if (op_args.size() < 2) {
|
||||||
|
return nullptr; // Invalid expression.
|
||||||
|
}
|
||||||
|
|
||||||
|
if (op_args[0]->type != Node::TYPE_IDENTIFIER || op_args[1]->type != Node::TYPE_IDENTIFIER) {
|
||||||
|
return nullptr; // Not an enum expression.
|
||||||
|
}
|
||||||
|
|
||||||
|
const StringName &enum_name = static_cast<const IdentifierNode *>(op_args[0])->name;
|
||||||
|
const StringName &const_name = static_cast<const IdentifierNode *>(op_args[1])->name;
|
||||||
|
Map<StringName, ClassNode::Constant>::Element *element =
|
||||||
|
current_class->constant_expressions.find(enum_name);
|
||||||
|
if (element) {
|
||||||
|
Node *cn_exp = element->value().expression;
|
||||||
|
if (cn_exp->type == Node::TYPE_CONSTANT) {
|
||||||
|
const Dictionary &enum_dict = static_cast<ConstantNode *>(cn_exp)->value;
|
||||||
|
return enum_dict.getptr(const_name);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
bool GDScriptParser::_recover_from_completion() {
|
bool GDScriptParser::_recover_from_completion() {
|
||||||
if (!completion_found) {
|
if (!completion_found) {
|
||||||
return false; //can't recover if no completion
|
return false; //can't recover if no completion
|
||||||
|
|||||||
@@ -607,6 +607,7 @@ private:
|
|||||||
Node *_reduce_expression(Node *p_node, bool p_to_const = false);
|
Node *_reduce_expression(Node *p_node, bool p_to_const = false);
|
||||||
Node *_parse_and_reduce_expression(Node *p_parent, bool p_static, bool p_reduce_const = false, bool p_allow_assign = false);
|
Node *_parse_and_reduce_expression(Node *p_parent, bool p_static, bool p_reduce_const = false, bool p_allow_assign = false);
|
||||||
bool _reduce_export_var_type(Variant &p_value, int p_line = 0);
|
bool _reduce_export_var_type(Variant &p_value, int p_line = 0);
|
||||||
|
const Variant *_try_to_find_constant_value_for_expression(const Node *p_expr) const;
|
||||||
|
|
||||||
PatternNode *_parse_pattern(bool p_static);
|
PatternNode *_parse_pattern(bool p_static);
|
||||||
void _parse_pattern_block(BlockNode *p_block, Vector<PatternBranchNode *> &p_branches, bool p_static);
|
void _parse_pattern_block(BlockNode *p_block, Vector<PatternBranchNode *> &p_branches, bool p_static);
|
||||||
|
|||||||
Reference in New Issue
Block a user