ruby-104/ruby/regcomp.c

3552   Node *top_root, *root, *snode, *prev_node;
3563   top_root = root = prev_node = snode = NULL_NODE;
3578 	if (IS_NULL(root) && IS_NOT_NULL(prev_node)) {
3579 	  top_root = root = onig_node_list_add(NULL_NODE, prev_node);
3581 	    onig_node_free(prev_node);
3586 	prev_node = snode = onig_node_new_str(NULL, NULL);
3603       if (IS_NULL(root) && IS_NOT_NULL(prev_node)) {
3604 	top_root = root = onig_node_list_add(NULL_NODE, prev_node);
3606 	  onig_node_free(prev_node);
3611       r = expand_case_fold_string_alt(n, items, p, len, end, reg, &prev_node);
3616 	  top_root = prev_node;
3619 	  if (IS_NULL(onig_node_list_add(root, prev_node))) {
3620 	    onig_node_free(prev_node);
3625 	root = NCAR(prev_node);
3629 	  if (IS_NULL(onig_node_list_add(root, prev_node))) {
3630 	    onig_node_free(prev_node);
3648     if (IS_NOT_NULL(prev_node) && IS_NULL(root)) {
3649       top_root = root = onig_node_list_add(NULL_NODE, prev_node);
3652 	onig_node_free(prev_node);
3658       prev_node = srem;
3669   top_root = (IS_NOT_NULL(top_root) ? top_root : prev_node);