2022   tre_pos_and_tags_t *new_set;  in tre_set_empty()  local
2024   new_set = tre_mem_calloc(mem, sizeof(*new_set));  in tre_set_empty()
2025   if (new_set == NULL)  in tre_set_empty()
2028   new_set[0].position = -1;  in tre_set_empty()
2029   new_set[0].code_min = -1;  in tre_set_empty()
2030   new_set[0].code_max = -1;  in tre_set_empty()
2032   return new_set;  in tre_set_empty()
2039   tre_pos_and_tags_t *new_set;  in tre_set_one()  local
2041   new_set = tre_mem_calloc(mem, sizeof(*new_set) * 2);  in tre_set_one()
2042   if (new_set == NULL)  in tre_set_one()
2045   new_set[0].position = position;  in tre_set_one()
2046   new_set[0].code_min = code_min;  in tre_set_one()
2047   new_set[0].code_max = code_max;  in tre_set_one()
2048   new_set[0].class = class;  in tre_set_one()
2049   new_set[0].neg_classes = neg_classes;  in tre_set_one()
2050   new_set[0].backref = backref;  in tre_set_one()
2051   new_set[1].position = -1;  in tre_set_one()
2052   new_set[1].code_min = -1;  in tre_set_one()
2053   new_set[1].code_max = -1;  in tre_set_one()
2055   return new_set;  in tre_set_one()
2063   tre_pos_and_tags_t *new_set;  in tre_set_union()  local
2070   new_set = tre_mem_calloc(mem, sizeof(*new_set) * (s1 + s2 + 1));  in tre_set_union()
2071   if (!new_set )  in tre_set_union()
2076       new_set[s1].position = set1[s1].position;  in tre_set_union()
2077       new_set[s1].code_min = set1[s1].code_min;  in tre_set_union()
2078       new_set[s1].code_max = set1[s1].code_max;  in tre_set_union()
2079       new_set[s1].assertions = set1[s1].assertions | assertions;  in tre_set_union()
2080       new_set[s1].class = set1[s1].class;  in tre_set_union()
2081       new_set[s1].neg_classes = set1[s1].neg_classes;  in tre_set_union()
2082       new_set[s1].backref = set1[s1].backref;  in tre_set_union()
2084 	new_set[s1].tags = NULL;  in tre_set_union()
2097 	  new_set[s1].tags = new_tags;  in tre_set_union()
2103       new_set[s1 + s2].position = set2[s2].position;  in tre_set_union()
2104       new_set[s1 + s2].code_min = set2[s2].code_min;  in tre_set_union()
2105       new_set[s1 + s2].code_max = set2[s2].code_max;  in tre_set_union()
2107       new_set[s1 + s2].assertions = set2[s2].assertions;  in tre_set_union()
2108       new_set[s1 + s2].class = set2[s2].class;  in tre_set_union()
2109       new_set[s1 + s2].neg_classes = set2[s2].neg_classes;  in tre_set_union()
2110       new_set[s1 + s2].backref = set2[s2].backref;  in tre_set_union()
2112 	new_set[s1 + s2].tags = NULL;  in tre_set_union()
2122 	  new_set[s1 + s2].tags = new_tags;  in tre_set_union()
2125   new_set[s1 + s2].position = -1;  in tre_set_union()
2126   return new_set;  in tre_set_union()