1056   tre_pos_and_tags_t *new_set;  in tre_set_empty()  local
1058   new_set = tre_mem_calloc(mem, sizeof(*new_set));  in tre_set_empty()
1059   if (new_set == NULL)  in tre_set_empty()
1062   new_set[0].position = -1;  in tre_set_empty()
1063   new_set[0].code_min = -1;  in tre_set_empty()
1064   new_set[0].code_max = -1;  in tre_set_empty()
1066   return new_set;  in tre_set_empty()
1073   tre_pos_and_tags_t *new_set;  in tre_set_one()  local
1075   new_set = tre_mem_calloc(mem, sizeof(*new_set) * 2);  in tre_set_one()
1076   if (new_set == NULL)  in tre_set_one()
1079   new_set[0].position = position;  in tre_set_one()
1080   new_set[0].code_min = code_min;  in tre_set_one()
1081   new_set[0].code_max = code_max;  in tre_set_one()
1082   new_set[0].class = class;  in tre_set_one()
1083   new_set[0].neg_classes = neg_classes;  in tre_set_one()
1084   new_set[0].backref = backref;  in tre_set_one()
1085   new_set[1].position = -1;  in tre_set_one()
1086   new_set[1].code_min = -1;  in tre_set_one()
1087   new_set[1].code_max = -1;  in tre_set_one()
1089   return new_set;  in tre_set_one()
1097   tre_pos_and_tags_t *new_set;  in tre_set_union()  local
1104   new_set = tre_mem_calloc(mem, sizeof(*new_set) * (s1 + s2 + 1));  in tre_set_union()
1105   if (!new_set )  in tre_set_union()
1110       new_set[s1].position = set1[s1].position;  in tre_set_union()
1111       new_set[s1].code_min = set1[s1].code_min;  in tre_set_union()
1112       new_set[s1].code_max = set1[s1].code_max;  in tre_set_union()
1113       new_set[s1].assertions = set1[s1].assertions | assertions;  in tre_set_union()
1114       new_set[s1].class = set1[s1].class;  in tre_set_union()
1115       new_set[s1].neg_classes = set1[s1].neg_classes;  in tre_set_union()
1116       new_set[s1].backref = set1[s1].backref;  in tre_set_union()
1118 	new_set[s1].tags = NULL;  in tre_set_union()
1131 	  new_set[s1].tags = new_tags;  in tre_set_union()
1134 	new_set[s1].params = set1[s1].params;  in tre_set_union()
1137 	  if (!new_set[s1].params)  in tre_set_union()
1138 	    new_set[s1].params = params;  in tre_set_union()
1141 	      new_set[s1].params = tre_mem_alloc(mem, sizeof(*params) *  in tre_set_union()
1143 	      if (!new_set[s1].params)  in tre_set_union()
1147 		  new_set[s1].params[i] = params[i];  in tre_set_union()
1154       new_set[s1 + s2].position = set2[s2].position;  in tre_set_union()
1155       new_set[s1 + s2].code_min = set2[s2].code_min;  in tre_set_union()
1156       new_set[s1 + s2].code_max = set2[s2].code_max;  in tre_set_union()
1158       new_set[s1 + s2].assertions = set2[s2].assertions;  in tre_set_union()
1159       new_set[s1 + s2].class = set2[s2].class;  in tre_set_union()
1160       new_set[s1 + s2].neg_classes = set2[s2].neg_classes;  in tre_set_union()
1161       new_set[s1 + s2].backref = set2[s2].backref;  in tre_set_union()
1163 	new_set[s1 + s2].tags = NULL;  in tre_set_union()
1173 	  new_set[s1 + s2].tags = new_tags;  in tre_set_union()
1176 	new_set[s1 + s2].params = set2[s2].params;  in tre_set_union()
1179 	  if (!new_set[s1 + s2].params)  in tre_set_union()
1180 	    new_set[s1 + s2].params = params;  in tre_set_union()
1183 	      new_set[s1 + s2].params = tre_mem_alloc(mem, sizeof(*params) *  in tre_set_union()
1185 	      if (!new_set[s1 + s2].params)  in tre_set_union()
1189 		  new_set[s1 + s2].params[i] = params[i];  in tre_set_union()
1193   new_set[s1 + s2].position = -1;  in tre_set_union()
1194   return new_set;  in tre_set_union()