hcq/oceanbase
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

:In parser_node.c, count_child and merge_child will set ret to -4013, if there wasnt enough memory.

Browse Source
This commit is contained in:
Monk-Liu
2022-03-24 23:03:34 +08:00
committed by LINxiansheng
parent 676333a3d5
commit 11c17f830e
1 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
src/sql/parser/parse_node.c
View File

@ -120,16 +120,16 @@ int count_child(ParseNode* root, void* malloc_pool, int* count)
} else if (NULL == root) { } else if (NULL == root) {
*count = 0; *count = 0;
} else if (NULL == (stack_top = new_link_node(malloc_pool))) { } else if (NULL == (stack_top = new_link_node(malloc_pool))) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR failed to malloc memory\n"); (void)fprintf(stderr, "ERROR failed to malloc memory\n");
} else { } else {
*count = 0; *count = 0;
stack_top->val_ = root; stack_top->val_ = root;
do { do {
ParseNode* tree = NULL; ParseNode *tree = NULL;
if (NULL == stack_top || NULL == (tree = (ParseNode*)stack_top->val_)) { if (NULL == stack_top || NULL == (tree = (ParseNode *)stack_top->val_)) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR invalid null argument\n"); (void)fprintf(stderr, "ERROR invalid null argument\n");
} else { } else {
stack_top = stack_top->next_; stack_top = stack_top->next_;
@ -142,7 +142,7 @@ int count_child(ParseNode* root, void* malloc_pool, int* count)
// do nothing // do nothing
} else { } else {
if (NULL == tree->children_) { if (NULL == tree->children_) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR invalid null children\n"); (void)fprintf(stderr, "ERROR invalid null children\n");
} }
ParserLinkNode* tmp_node = NULL; ParserLinkNode* tmp_node = NULL;
@ -151,7 +151,7 @@ int count_child(ParseNode* root, void* malloc_pool, int* count)
if (NULL == child) { if (NULL == child) {
// do nothing // do nothing
} else if (NULL == (tmp_node = new_link_node(malloc_pool))) { } else if (NULL == (tmp_node = new_link_node(malloc_pool))) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR failed to allocate memory\n"); (void)fprintf(stderr, "ERROR failed to allocate memory\n");
} else { } else {
tmp_node->val_ = child; tmp_node->val_ = child;
@ -171,20 +171,20 @@ int merge_child(ParseNode* node, void* malloc_pool, ParseNode* source_tree, int*
int ret = 0; int ret = 0;
ParserLinkNode* stack_top = NULL; ParserLinkNode* stack_top = NULL;
if (OB_UNLIKELY(NULL == node || NULL == index)) { if (OB_UNLIKELY(NULL == node || NULL == index)) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR node%p or index:%p is NULL\n", node, index); (void)fprintf(stderr, "ERROR node%p or index:%p is NULL\n", node, index);
} else if (NULL == source_tree) { } else if (NULL == source_tree) {
// do nothing // do nothing
} else if (NULL == (stack_top = new_link_node(malloc_pool))) { } else if (NULL == (stack_top = new_link_node(malloc_pool))) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR failed to malloc memory\n"); (void)fprintf(stderr, "ERROR failed to malloc memory\n");
} else { } else {
stack_top->val_ = source_tree; stack_top->val_ = source_tree;
do { do {
ParseNode* tree = NULL; ParseNode *tree = NULL;
if (NULL == stack_top || NULL == (tree = (ParseNode*)stack_top->val_)) { if (NULL == stack_top || NULL == (tree = (ParseNode *)stack_top->val_)) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR invalid null argument\n"); (void)fprintf(stderr, "ERROR invalid null argument\n");
} else { } else {
// pop stack // pop stack
@ -194,11 +194,11 @@ int merge_child(ParseNode* node, void* malloc_pool, ParseNode* source_tree, int*
// do nothing // do nothing
} else if (T_LINK_NODE != tree->type_) { } else if (T_LINK_NODE != tree->type_) {
if (OB_UNLIKELY(*index < 0 || *index >= node->num_child_)) { if (OB_UNLIKELY(*index < 0 || *index >= node->num_child_)) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf( (void)fprintf(
stderr, "ERROR invalid index: %d, num_child:%d\n tree: %d", *index, node->num_child_, tree->type_); stderr, "ERROR invalid index: %d, num_child:%d\n tree: %d", *index, node->num_child_, tree->type_);
} else if (NULL == node->children_) { } else if (NULL == node->children_) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR invalid null children pointer\n"); (void)fprintf(stderr, "ERROR invalid null children pointer\n");
} else { } else {
node->children_[*index] = tree; node->children_[*index] = tree;
@ -207,7 +207,7 @@ int merge_child(ParseNode* node, void* malloc_pool, ParseNode* source_tree, int*
} else if (tree->num_child_ <= 0) { } else if (tree->num_child_ <= 0) {
// do nothing // do nothing
} else if (NULL == tree->children_) { } else if (NULL == tree->children_) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR invalid children pointer\n"); (void)fprintf(stderr, "ERROR invalid children pointer\n");
} else { } else {
ParserLinkNode* tmp_node = NULL; ParserLinkNode* tmp_node = NULL;
@ -215,7 +215,7 @@ int merge_child(ParseNode* node, void* malloc_pool, ParseNode* source_tree, int*
if (NULL == tree->children_[i]) { if (NULL == tree->children_[i]) {
// do nothing // do nothing
} else if (NULL == (tmp_node = new_link_node(malloc_pool))) { } else if (NULL == (tmp_node = new_link_node(malloc_pool))) {
ret = 1; ret = OB_PARSER_ERR_NO_MEMORY;
(void)fprintf(stderr, "ERROR failed to malloc memory\n"); (void)fprintf(stderr, "ERROR failed to malloc memory\n");
} else { } else {
// push stack // push stack