1 1.1 mrg /* 2 1.1 mrg * Copyright 2008-2009 Katholieke Universiteit Leuven 3 1.1 mrg * Copyright 2011 Sven Verdoolaege 4 1.1 mrg * Copyright 2013 Ecole Normale Superieure 5 1.1 mrg * 6 1.1 mrg * Use of this software is governed by the MIT license 7 1.1 mrg * 8 1.1 mrg * Written by Sven Verdoolaege, K.U.Leuven, Departement 9 1.1 mrg * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium 10 1.1 mrg * and Ecole Normale Superieure, 45 rue dUlm, 75230 Paris, France 11 1.1 mrg */ 12 1.1 mrg 13 1.1 mrg #include <isl_ctx_private.h> 14 1.1 mrg #include <isl_seq.h> 15 1.1 mrg #include <isl_val_private.h> 16 1.1 mrg #include <isl_vec_private.h> 17 1.1 mrg 18 1.1 mrg isl_ctx *isl_vec_get_ctx(__isl_keep isl_vec *vec) 19 1.1 mrg { 20 1.1 mrg return vec ? vec->ctx : NULL; 21 1.1 mrg } 22 1.1 mrg 23 1.1 mrg /* Return a hash value that digests "vec". 24 1.1 mrg */ 25 1.1 mrg uint32_t isl_vec_get_hash(__isl_keep isl_vec *vec) 26 1.1 mrg { 27 1.1 mrg if (!vec) 28 1.1 mrg return 0; 29 1.1 mrg 30 1.1 mrg return isl_seq_get_hash(vec->el, vec->size); 31 1.1 mrg } 32 1.1 mrg 33 1.1 mrg __isl_give isl_vec *isl_vec_alloc(struct isl_ctx *ctx, unsigned size) 34 1.1 mrg { 35 1.1 mrg struct isl_vec *vec; 36 1.1 mrg 37 1.1 mrg vec = isl_alloc_type(ctx, struct isl_vec); 38 1.1 mrg if (!vec) 39 1.1 mrg return NULL; 40 1.1 mrg 41 1.1 mrg vec->block = isl_blk_alloc(ctx, size); 42 1.1 mrg if (isl_blk_is_error(vec->block)) 43 1.1 mrg goto error; 44 1.1 mrg 45 1.1 mrg vec->ctx = ctx; 46 1.1 mrg isl_ctx_ref(ctx); 47 1.1 mrg vec->ref = 1; 48 1.1 mrg vec->size = size; 49 1.1 mrg vec->el = vec->block.data; 50 1.1 mrg 51 1.1 mrg return vec; 52 1.1 mrg error: 53 1.1 mrg isl_blk_free(ctx, vec->block); 54 1.1 mrg free(vec); 55 1.1 mrg return NULL; 56 1.1 mrg } 57 1.1 mrg 58 1.1 mrg __isl_give isl_vec *isl_vec_extend(__isl_take isl_vec *vec, unsigned size) 59 1.1 mrg { 60 1.1 mrg if (!vec) 61 1.1 mrg return NULL; 62 1.1 mrg if (size <= vec->size) 63 1.1 mrg return vec; 64 1.1 mrg 65 1.1 mrg vec = isl_vec_cow(vec); 66 1.1 mrg if (!vec) 67 1.1 mrg return NULL; 68 1.1 mrg 69 1.1 mrg vec->block = isl_blk_extend(vec->ctx, vec->block, size); 70 1.1 mrg if (!vec->block.data) 71 1.1 mrg goto error; 72 1.1 mrg 73 1.1 mrg vec->size = size; 74 1.1 mrg vec->el = vec->block.data; 75 1.1 mrg 76 1.1 mrg return vec; 77 1.1 mrg error: 78 1.1 mrg isl_vec_free(vec); 79 1.1 mrg return NULL; 80 1.1 mrg } 81 1.1 mrg 82 1.1 mrg /* Apply the expansion specified by "exp" to the "n" elements starting at "pos". 83 1.1 mrg * "expanded" it the number of elements that need to replace those "n" 84 1.1 mrg * elements. The entries in "exp" have increasing values between 85 1.1 mrg * 0 and "expanded". 86 1.1 mrg */ 87 1.1 mrg __isl_give isl_vec *isl_vec_expand(__isl_take isl_vec *vec, int pos, int n, 88 1.1 mrg int *exp, int expanded) 89 1.1 mrg { 90 1.1 mrg int i, j; 91 1.1 mrg int old_size, extra; 92 1.1 mrg 93 1.1 mrg if (!vec) 94 1.1 mrg return NULL; 95 1.1 mrg if (expanded < n) 96 1.1 mrg isl_die(isl_vec_get_ctx(vec), isl_error_invalid, 97 1.1 mrg "not an expansion", return isl_vec_free(vec)); 98 1.1 mrg if (expanded == n) 99 1.1 mrg return vec; 100 1.1 mrg if (pos < 0 || n < 0 || pos + n > vec->size) 101 1.1 mrg isl_die(isl_vec_get_ctx(vec), isl_error_invalid, 102 1.1 mrg "position out of bounds", return isl_vec_free(vec)); 103 1.1 mrg 104 1.1 mrg old_size = vec->size; 105 1.1 mrg extra = expanded - n; 106 1.1 mrg vec = isl_vec_extend(vec, old_size + extra); 107 1.1 mrg vec = isl_vec_cow(vec); 108 1.1 mrg if (!vec) 109 1.1 mrg return NULL; 110 1.1 mrg 111 1.1 mrg for (i = old_size - 1; i >= pos + n; --i) 112 1.1 mrg isl_int_set(vec->el[i + extra], vec->el[i]); 113 1.1 mrg 114 1.1 mrg j = n - 1; 115 1.1 mrg for (i = expanded - 1; i >= 0; --i) { 116 1.1 mrg if (j >= 0 && exp[j] == i) { 117 1.1 mrg if (i != j) 118 1.1 mrg isl_int_swap(vec->el[pos + i], 119 1.1 mrg vec->el[pos + j]); 120 1.1 mrg j--; 121 1.1 mrg } else { 122 1.1 mrg isl_int_set_si(vec->el[pos + i], 0); 123 1.1 mrg } 124 1.1 mrg } 125 1.1 mrg 126 1.1 mrg return vec; 127 1.1 mrg } 128 1.1 mrg 129 1.1 mrg /* Create a vector of size "size" with zero-valued elements. 130 1.1 mrg */ 131 1.1 mrg __isl_give isl_vec *isl_vec_zero(isl_ctx *ctx, unsigned size) 132 1.1 mrg { 133 1.1 mrg isl_vec *vec; 134 1.1 mrg 135 1.1 mrg vec = isl_vec_alloc(ctx, size); 136 1.1 mrg if (!vec) 137 1.1 mrg return NULL; 138 1.1 mrg isl_seq_clr(vec->el, size); 139 1.1 mrg return vec; 140 1.1 mrg } 141 1.1 mrg 142 1.1 mrg __isl_give isl_vec *isl_vec_zero_extend(__isl_take isl_vec *vec, unsigned size) 143 1.1 mrg { 144 1.1 mrg int extra; 145 1.1 mrg 146 1.1 mrg if (!vec) 147 1.1 mrg return NULL; 148 1.1 mrg if (size <= vec->size) 149 1.1 mrg return vec; 150 1.1 mrg 151 1.1 mrg vec = isl_vec_cow(vec); 152 1.1 mrg if (!vec) 153 1.1 mrg return NULL; 154 1.1 mrg 155 1.1 mrg extra = size - vec->size; 156 1.1 mrg vec = isl_vec_extend(vec, size); 157 1.1 mrg if (!vec) 158 1.1 mrg return NULL; 159 1.1 mrg 160 1.1 mrg isl_seq_clr(vec->el + size - extra, extra); 161 1.1 mrg 162 1.1 mrg return vec; 163 1.1 mrg } 164 1.1 mrg 165 1.1 mrg /* Return a vector containing the elements of "vec1" followed by 166 1.1 mrg * those of "vec2". 167 1.1 mrg */ 168 1.1 mrg __isl_give isl_vec *isl_vec_concat(__isl_take isl_vec *vec1, 169 1.1 mrg __isl_take isl_vec *vec2) 170 1.1 mrg { 171 1.1 mrg if (!vec1 || !vec2) 172 1.1 mrg goto error; 173 1.1 mrg 174 1.1 mrg if (vec2->size == 0) { 175 1.1 mrg isl_vec_free(vec2); 176 1.1 mrg return vec1; 177 1.1 mrg } 178 1.1 mrg 179 1.1 mrg if (vec1->size == 0) { 180 1.1 mrg isl_vec_free(vec1); 181 1.1 mrg return vec2; 182 1.1 mrg } 183 1.1 mrg 184 1.1 mrg vec1 = isl_vec_extend(vec1, vec1->size + vec2->size); 185 1.1 mrg if (!vec1) 186 1.1 mrg goto error; 187 1.1 mrg 188 1.1 mrg isl_seq_cpy(vec1->el + vec1->size - vec2->size, vec2->el, vec2->size); 189 1.1 mrg 190 1.1 mrg isl_vec_free(vec2); 191 1.1 mrg return vec1; 192 1.1 mrg error: 193 1.1 mrg isl_vec_free(vec1); 194 1.1 mrg isl_vec_free(vec2); 195 1.1 mrg return NULL; 196 1.1 mrg } 197 1.1 mrg 198 1.1 mrg __isl_give isl_vec *isl_vec_copy(__isl_keep isl_vec *vec) 199 1.1 mrg { 200 1.1 mrg if (!vec) 201 1.1 mrg return NULL; 202 1.1 mrg 203 1.1 mrg vec->ref++; 204 1.1 mrg return vec; 205 1.1 mrg } 206 1.1 mrg 207 1.1 mrg __isl_give isl_vec *isl_vec_dup(__isl_keep isl_vec *vec) 208 1.1 mrg { 209 1.1 mrg struct isl_vec *vec2; 210 1.1 mrg 211 1.1 mrg if (!vec) 212 1.1 mrg return NULL; 213 1.1 mrg vec2 = isl_vec_alloc(vec->ctx, vec->size); 214 1.1 mrg if (!vec2) 215 1.1 mrg return NULL; 216 1.1 mrg isl_seq_cpy(vec2->el, vec->el, vec->size); 217 1.1 mrg return vec2; 218 1.1 mrg } 219 1.1 mrg 220 1.1 mrg __isl_give isl_vec *isl_vec_cow(__isl_take isl_vec *vec) 221 1.1 mrg { 222 1.1 mrg struct isl_vec *vec2; 223 1.1 mrg if (!vec) 224 1.1 mrg return NULL; 225 1.1 mrg 226 1.1 mrg if (vec->ref == 1) 227 1.1 mrg return vec; 228 1.1 mrg 229 1.1 mrg vec2 = isl_vec_dup(vec); 230 1.1 mrg isl_vec_free(vec); 231 1.1 mrg return vec2; 232 1.1 mrg } 233 1.1 mrg 234 1.1 mrg __isl_null isl_vec *isl_vec_free(__isl_take isl_vec *vec) 235 1.1 mrg { 236 1.1 mrg if (!vec) 237 1.1 mrg return NULL; 238 1.1 mrg 239 1.1 mrg if (--vec->ref > 0) 240 1.1 mrg return NULL; 241 1.1 mrg 242 1.1 mrg isl_ctx_deref(vec->ctx); 243 1.1 mrg isl_blk_free(vec->ctx, vec->block); 244 1.1 mrg free(vec); 245 1.1 mrg 246 1.1 mrg return NULL; 247 1.1 mrg } 248 1.1 mrg 249 1.1 mrg isl_size isl_vec_size(__isl_keep isl_vec *vec) 250 1.1 mrg { 251 1.1 mrg return vec ? vec->size : isl_size_error; 252 1.1 mrg } 253 1.1 mrg 254 1.1 mrg /* Extract the element at position "pos" of "vec". 255 1.1 mrg */ 256 1.1 mrg __isl_give isl_val *isl_vec_get_element_val(__isl_keep isl_vec *vec, int pos) 257 1.1 mrg { 258 1.1 mrg isl_ctx *ctx; 259 1.1 mrg 260 1.1 mrg if (!vec) 261 1.1 mrg return NULL; 262 1.1 mrg ctx = isl_vec_get_ctx(vec); 263 1.1 mrg if (pos < 0 || pos >= vec->size) 264 1.1 mrg isl_die(ctx, isl_error_invalid, "position out of range", 265 1.1 mrg return NULL); 266 1.1 mrg return isl_val_int_from_isl_int(ctx, vec->el[pos]); 267 1.1 mrg } 268 1.1 mrg 269 1.1 mrg __isl_give isl_vec *isl_vec_set_element(__isl_take isl_vec *vec, 270 1.1 mrg int pos, isl_int v) 271 1.1 mrg { 272 1.1 mrg vec = isl_vec_cow(vec); 273 1.1 mrg if (!vec) 274 1.1 mrg return NULL; 275 1.1 mrg if (pos < 0 || pos >= vec->size) 276 1.1 mrg isl_die(vec->ctx, isl_error_invalid, "position out of range", 277 1.1 mrg goto error); 278 1.1 mrg isl_int_set(vec->el[pos], v); 279 1.1 mrg return vec; 280 1.1 mrg error: 281 1.1 mrg isl_vec_free(vec); 282 1.1 mrg return NULL; 283 1.1 mrg } 284 1.1 mrg 285 1.1 mrg __isl_give isl_vec *isl_vec_set_element_si(__isl_take isl_vec *vec, 286 1.1 mrg int pos, int v) 287 1.1 mrg { 288 1.1 mrg vec = isl_vec_cow(vec); 289 1.1 mrg if (!vec) 290 1.1 mrg return NULL; 291 1.1 mrg if (pos < 0 || pos >= vec->size) 292 1.1 mrg isl_die(vec->ctx, isl_error_invalid, "position out of range", 293 1.1 mrg goto error); 294 1.1 mrg isl_int_set_si(vec->el[pos], v); 295 1.1 mrg return vec; 296 1.1 mrg error: 297 1.1 mrg isl_vec_free(vec); 298 1.1 mrg return NULL; 299 1.1 mrg } 300 1.1 mrg 301 1.1 mrg /* Replace the element at position "pos" of "vec" by "v". 302 1.1 mrg */ 303 1.1 mrg __isl_give isl_vec *isl_vec_set_element_val(__isl_take isl_vec *vec, 304 1.1 mrg int pos, __isl_take isl_val *v) 305 1.1 mrg { 306 1.1 mrg if (!v) 307 1.1 mrg return isl_vec_free(vec); 308 1.1 mrg if (!isl_val_is_int(v)) 309 1.1 mrg isl_die(isl_val_get_ctx(v), isl_error_invalid, 310 1.1 mrg "expecting integer value", goto error); 311 1.1 mrg vec = isl_vec_set_element(vec, pos, v->n); 312 1.1 mrg isl_val_free(v); 313 1.1 mrg return vec; 314 1.1 mrg error: 315 1.1 mrg isl_val_free(v); 316 1.1 mrg return isl_vec_free(vec); 317 1.1 mrg } 318 1.1 mrg 319 1.1 mrg /* Compare the elements of "vec1" and "vec2" at position "pos". 320 1.1 mrg */ 321 1.1 mrg int isl_vec_cmp_element(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2, 322 1.1 mrg int pos) 323 1.1 mrg { 324 1.1 mrg if (!vec1 || !vec2) 325 1.1 mrg return 0; 326 1.1 mrg if (pos < 0 || pos >= vec1->size || pos >= vec2->size) 327 1.1 mrg isl_die(isl_vec_get_ctx(vec1), isl_error_invalid, 328 1.1 mrg "position out of range", return 0); 329 1.1 mrg return isl_int_cmp(vec1->el[pos], vec2->el[pos]); 330 1.1 mrg } 331 1.1 mrg 332 1.1 mrg /* Does "vec" contain only zero elements? 333 1.1 mrg */ 334 1.1 mrg isl_bool isl_vec_is_zero(__isl_keep isl_vec *vec) 335 1.1 mrg { 336 1.1 mrg if (!vec) 337 1.1 mrg return isl_bool_error; 338 1.1 mrg return isl_bool_ok(isl_seq_first_non_zero(vec->el, vec->size) < 0); 339 1.1 mrg } 340 1.1 mrg 341 1.1 mrg isl_bool isl_vec_is_equal(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2) 342 1.1 mrg { 343 1.1 mrg if (!vec1 || !vec2) 344 1.1 mrg return isl_bool_error; 345 1.1 mrg 346 1.1 mrg if (vec1->size != vec2->size) 347 1.1 mrg return isl_bool_false; 348 1.1 mrg 349 1.1 mrg return isl_bool_ok(isl_seq_eq(vec1->el, vec2->el, vec1->size)); 350 1.1 mrg } 351 1.1 mrg 352 1.1 mrg __isl_give isl_printer *isl_printer_print_vec(__isl_take isl_printer *printer, 353 1.1 mrg __isl_keep isl_vec *vec) 354 1.1 mrg { 355 1.1 mrg int i; 356 1.1 mrg 357 1.1 mrg if (!printer || !vec) 358 1.1 mrg goto error; 359 1.1 mrg 360 1.1 mrg printer = isl_printer_print_str(printer, "["); 361 1.1 mrg for (i = 0; i < vec->size; ++i) { 362 1.1 mrg if (i) 363 1.1 mrg printer = isl_printer_print_str(printer, ","); 364 1.1 mrg printer = isl_printer_print_isl_int(printer, vec->el[i]); 365 1.1 mrg } 366 1.1 mrg printer = isl_printer_print_str(printer, "]"); 367 1.1 mrg 368 1.1 mrg return printer; 369 1.1 mrg error: 370 1.1 mrg isl_printer_free(printer); 371 1.1 mrg return NULL; 372 1.1 mrg } 373 1.1 mrg 374 1.1 mrg void isl_vec_dump(__isl_keep isl_vec *vec) 375 1.1 mrg { 376 1.1 mrg isl_printer *printer; 377 1.1 mrg 378 1.1 mrg if (!vec) 379 1.1 mrg return; 380 1.1 mrg 381 1.1 mrg printer = isl_printer_to_file(vec->ctx, stderr); 382 1.1 mrg printer = isl_printer_print_vec(printer, vec); 383 1.1 mrg printer = isl_printer_end_line(printer); 384 1.1 mrg 385 1.1 mrg isl_printer_free(printer); 386 1.1 mrg } 387 1.1 mrg 388 1.1 mrg __isl_give isl_vec *isl_vec_set(__isl_take isl_vec *vec, isl_int v) 389 1.1 mrg { 390 1.1 mrg vec = isl_vec_cow(vec); 391 1.1 mrg if (!vec) 392 1.1 mrg return NULL; 393 1.1 mrg isl_seq_set(vec->el, v, vec->size); 394 1.1 mrg return vec; 395 1.1 mrg } 396 1.1 mrg 397 1.1 mrg __isl_give isl_vec *isl_vec_set_si(__isl_take isl_vec *vec, int v) 398 1.1 mrg { 399 1.1 mrg vec = isl_vec_cow(vec); 400 1.1 mrg if (!vec) 401 1.1 mrg return NULL; 402 1.1 mrg isl_seq_set_si(vec->el, v, vec->size); 403 1.1 mrg return vec; 404 1.1 mrg } 405 1.1 mrg 406 1.1 mrg /* Replace all elements of "vec" by "v". 407 1.1 mrg */ 408 1.1 mrg __isl_give isl_vec *isl_vec_set_val(__isl_take isl_vec *vec, 409 1.1 mrg __isl_take isl_val *v) 410 1.1 mrg { 411 1.1 mrg vec = isl_vec_cow(vec); 412 1.1 mrg if (!vec || !v) 413 1.1 mrg goto error; 414 1.1 mrg if (!isl_val_is_int(v)) 415 1.1 mrg isl_die(isl_val_get_ctx(v), isl_error_invalid, 416 1.1 mrg "expecting integer value", goto error); 417 1.1 mrg isl_seq_set(vec->el, v->n, vec->size); 418 1.1 mrg isl_val_free(v); 419 1.1 mrg return vec; 420 1.1 mrg error: 421 1.1 mrg isl_vec_free(vec); 422 1.1 mrg isl_val_free(v); 423 1.1 mrg return NULL; 424 1.1 mrg } 425 1.1 mrg 426 1.1 mrg __isl_give isl_vec *isl_vec_clr(__isl_take isl_vec *vec) 427 1.1 mrg { 428 1.1 mrg vec = isl_vec_cow(vec); 429 1.1 mrg if (!vec) 430 1.1 mrg return NULL; 431 1.1 mrg isl_seq_clr(vec->el, vec->size); 432 1.1 mrg return vec; 433 1.1 mrg } 434 1.1 mrg 435 1.1 mrg void isl_vec_lcm(__isl_keep isl_vec *vec, isl_int *lcm) 436 1.1 mrg { 437 1.1 mrg isl_seq_lcm(vec->block.data, vec->size, lcm); 438 1.1 mrg } 439 1.1 mrg 440 1.1 mrg /* Given a rational vector, with the denominator in the first element 441 1.1 mrg * of the vector, round up all coordinates. 442 1.1 mrg */ 443 1.1 mrg __isl_give isl_vec *isl_vec_ceil(__isl_take isl_vec *vec) 444 1.1 mrg { 445 1.1 mrg vec = isl_vec_cow(vec); 446 1.1 mrg if (!vec) 447 1.1 mrg return NULL; 448 1.1 mrg 449 1.1 mrg isl_seq_cdiv_q(vec->el + 1, vec->el + 1, vec->el[0], vec->size - 1); 450 1.1 mrg 451 1.1 mrg isl_int_set_si(vec->el[0], 1); 452 1.1 mrg 453 1.1 mrg return vec; 454 1.1 mrg } 455 1.1 mrg 456 1.1 mrg __isl_give isl_vec *isl_vec_normalize(__isl_take isl_vec *vec) 457 1.1 mrg { 458 1.1 mrg if (!vec) 459 1.1 mrg return NULL; 460 1.1 mrg isl_seq_normalize(vec->ctx, vec->el, vec->size); 461 1.1 mrg return vec; 462 1.1 mrg } 463 1.1 mrg 464 1.1 mrg __isl_give isl_vec *isl_vec_neg(__isl_take isl_vec *vec) 465 1.1 mrg { 466 1.1 mrg vec = isl_vec_cow(vec); 467 1.1 mrg if (!vec) 468 1.1 mrg return NULL; 469 1.1 mrg isl_seq_neg(vec->el, vec->el, vec->size); 470 1.1 mrg return vec; 471 1.1 mrg } 472 1.1 mrg 473 1.1 mrg __isl_give isl_vec *isl_vec_scale(__isl_take isl_vec *vec, isl_int m) 474 1.1 mrg { 475 1.1 mrg if (isl_int_is_one(m)) 476 1.1 mrg return vec; 477 1.1 mrg vec = isl_vec_cow(vec); 478 1.1 mrg if (!vec) 479 1.1 mrg return NULL; 480 1.1 mrg isl_seq_scale(vec->el, vec->el, m, vec->size); 481 1.1 mrg return vec; 482 1.1 mrg } 483 1.1 mrg 484 1.1 mrg /* Reduce the elements of "vec" modulo "m". 485 1.1 mrg */ 486 1.1 mrg __isl_give isl_vec *isl_vec_fdiv_r(__isl_take isl_vec *vec, isl_int m) 487 1.1 mrg { 488 1.1 mrg vec = isl_vec_cow(vec); 489 1.1 mrg if (!vec) 490 1.1 mrg return NULL; 491 1.1 mrg 492 1.1 mrg isl_seq_fdiv_r(vec->el, vec->el, m, vec->size); 493 1.1 mrg 494 1.1 mrg return vec; 495 1.1 mrg } 496 1.1 mrg 497 1.1 mrg __isl_give isl_vec *isl_vec_add(__isl_take isl_vec *vec1, 498 1.1 mrg __isl_take isl_vec *vec2) 499 1.1 mrg { 500 1.1 mrg vec1 = isl_vec_cow(vec1); 501 1.1 mrg if (!vec1 || !vec2) 502 1.1 mrg goto error; 503 1.1 mrg 504 1.1 mrg isl_assert(vec1->ctx, vec1->size == vec2->size, goto error); 505 1.1 mrg 506 1.1 mrg isl_seq_combine(vec1->el, vec1->ctx->one, vec1->el, 507 1.1 mrg vec1->ctx->one, vec2->el, vec1->size); 508 1.1 mrg 509 1.1 mrg isl_vec_free(vec2); 510 1.1 mrg return vec1; 511 1.1 mrg error: 512 1.1 mrg isl_vec_free(vec1); 513 1.1 mrg isl_vec_free(vec2); 514 1.1 mrg return NULL; 515 1.1 mrg } 516 1.1 mrg 517 1.1 mrg static int qsort_int_cmp(const void *p1, const void *p2) 518 1.1 mrg { 519 1.1 mrg const isl_int *i1 = (const isl_int *) p1; 520 1.1 mrg const isl_int *i2 = (const isl_int *) p2; 521 1.1 mrg 522 1.1 mrg return isl_int_cmp(*i1, *i2); 523 1.1 mrg } 524 1.1 mrg 525 1.1 mrg __isl_give isl_vec *isl_vec_sort(__isl_take isl_vec *vec) 526 1.1 mrg { 527 1.1 mrg if (!vec) 528 1.1 mrg return NULL; 529 1.1 mrg 530 1.1 mrg qsort(vec->el, vec->size, sizeof(*vec->el), &qsort_int_cmp); 531 1.1 mrg 532 1.1 mrg return vec; 533 1.1 mrg } 534 1.1 mrg 535 1.1 mrg __isl_give isl_vec *isl_vec_drop_els(__isl_take isl_vec *vec, 536 1.1 mrg unsigned pos, unsigned n) 537 1.1 mrg { 538 1.1 mrg if (n == 0) 539 1.1 mrg return vec; 540 1.1 mrg vec = isl_vec_cow(vec); 541 1.1 mrg if (!vec) 542 1.1 mrg return NULL; 543 1.1 mrg 544 1.1 mrg if (pos + n > vec->size) 545 1.1 mrg isl_die(vec->ctx, isl_error_invalid, 546 1.1 mrg "range out of bounds", goto error); 547 1.1 mrg 548 1.1 mrg if (pos + n != vec->size) 549 1.1 mrg isl_seq_cpy(vec->el + pos, vec->el + pos + n, 550 1.1 mrg vec->size - pos - n); 551 1.1 mrg 552 1.1 mrg vec->size -= n; 553 1.1 mrg 554 1.1 mrg return vec; 555 1.1 mrg error: 556 1.1 mrg isl_vec_free(vec); 557 1.1 mrg return NULL; 558 1.1 mrg } 559 1.1 mrg 560 1.1 mrg __isl_give isl_vec *isl_vec_insert_els(__isl_take isl_vec *vec, 561 1.1 mrg unsigned pos, unsigned n) 562 1.1 mrg { 563 1.1 mrg isl_vec *ext = NULL; 564 1.1 mrg 565 1.1 mrg if (n == 0) 566 1.1 mrg return vec; 567 1.1 mrg if (!vec) 568 1.1 mrg return NULL; 569 1.1 mrg 570 1.1 mrg if (pos > vec->size) 571 1.1 mrg isl_die(vec->ctx, isl_error_invalid, 572 1.1 mrg "position out of bounds", goto error); 573 1.1 mrg 574 1.1 mrg ext = isl_vec_alloc(vec->ctx, vec->size + n); 575 1.1 mrg if (!ext) 576 1.1 mrg goto error; 577 1.1 mrg 578 1.1 mrg isl_seq_cpy(ext->el, vec->el, pos); 579 1.1 mrg isl_seq_cpy(ext->el + pos + n, vec->el + pos, vec->size - pos); 580 1.1 mrg 581 1.1 mrg isl_vec_free(vec); 582 1.1 mrg return ext; 583 1.1 mrg error: 584 1.1 mrg isl_vec_free(vec); 585 1.1 mrg isl_vec_free(ext); 586 1.1 mrg return NULL; 587 1.1 mrg } 588 1.1 mrg 589 1.1 mrg /* Add "n" elements at the end of "vec". 590 1.1 mrg */ 591 1.1 mrg __isl_give isl_vec *isl_vec_add_els(__isl_take isl_vec *vec, unsigned n) 592 1.1 mrg { 593 1.1 mrg if (!vec) 594 1.1 mrg return NULL; 595 1.1 mrg return isl_vec_insert_els(vec, vec->size, n); 596 1.1 mrg } 597 1.1 mrg 598 1.1 mrg __isl_give isl_vec *isl_vec_insert_zero_els(__isl_take isl_vec *vec, 599 1.1 mrg unsigned pos, unsigned n) 600 1.1 mrg { 601 1.1 mrg vec = isl_vec_insert_els(vec, pos, n); 602 1.1 mrg if (!vec) 603 1.1 mrg return NULL; 604 1.1 mrg 605 1.1 mrg isl_seq_clr(vec->el + pos, n); 606 1.1 mrg 607 1.1 mrg return vec; 608 1.1 mrg } 609 1.1 mrg 610 1.1 mrg /* Move the "n" elements starting as "src_pos" of "vec" 611 1.1 mrg * to "dst_pos". The elements originally at "dst_pos" are moved 612 1.1 mrg * up or down depending on whether "dst_pos" is smaller or greater 613 1.1 mrg * than "src_pos". 614 1.1 mrg */ 615 1.1 mrg __isl_give isl_vec *isl_vec_move_els(__isl_take isl_vec *vec, 616 1.1 mrg unsigned dst_pos, unsigned src_pos, unsigned n) 617 1.1 mrg { 618 1.1 mrg isl_vec *res; 619 1.1 mrg 620 1.1 mrg if (!vec) 621 1.1 mrg return NULL; 622 1.1 mrg 623 1.1 mrg if (src_pos + n > vec->size) 624 1.1 mrg isl_die(vec->ctx, isl_error_invalid, 625 1.1 mrg "source range out of bounds", return isl_vec_free(vec)); 626 1.1 mrg if (dst_pos + n > vec->size) 627 1.1 mrg isl_die(vec->ctx, isl_error_invalid, 628 1.1 mrg "destination range out of bounds", 629 1.1 mrg return isl_vec_free(vec)); 630 1.1 mrg 631 1.1 mrg if (n == 0 || dst_pos == src_pos) 632 1.1 mrg return vec; 633 1.1 mrg 634 1.1 mrg res = isl_vec_alloc(vec->ctx, vec->size); 635 1.1 mrg if (!res) 636 1.1 mrg return isl_vec_free(vec); 637 1.1 mrg 638 1.1 mrg if (dst_pos < src_pos) { 639 1.1 mrg isl_seq_cpy(res->el, vec->el, dst_pos); 640 1.1 mrg isl_seq_cpy(res->el + dst_pos, vec->el + src_pos, n); 641 1.1 mrg isl_seq_cpy(res->el + dst_pos + n, 642 1.1 mrg vec->el + dst_pos, src_pos - dst_pos); 643 1.1 mrg isl_seq_cpy(res->el + src_pos + n, 644 1.1 mrg vec->el + src_pos + n, res->size - src_pos - n); 645 1.1 mrg } else { 646 1.1 mrg isl_seq_cpy(res->el, vec->el, src_pos); 647 1.1 mrg isl_seq_cpy(res->el + src_pos, 648 1.1 mrg vec->el + src_pos + n, dst_pos - src_pos); 649 1.1 mrg isl_seq_cpy(res->el + dst_pos, vec->el + src_pos, n); 650 1.1 mrg isl_seq_cpy(res->el + dst_pos + n, 651 1.1 mrg vec->el + dst_pos + n, res->size - dst_pos - n); 652 1.1 mrg } 653 1.1 mrg 654 1.1 mrg isl_vec_free(vec); 655 1.1 mrg return res; 656 1.1 mrg } 657 1.1 mrg 658 1.1 mrg /* Reorder the elements of "vec" starting at "offset" based 659 1.1 mrg * on the given reordering. 660 1.1 mrg */ 661 1.1 mrg __isl_give isl_vec *isl_vec_reorder(__isl_take isl_vec *vec, 662 1.1 mrg unsigned offset, __isl_take isl_reordering *r) 663 1.1 mrg { 664 1.1 mrg isl_vec *res; 665 1.1 mrg int i; 666 1.1 mrg 667 1.1 mrg if (!vec || !r) 668 1.1 mrg goto error; 669 1.1 mrg 670 1.1 mrg res = isl_vec_alloc(vec->ctx, offset + r->dst_len); 671 1.1 mrg if (!res) 672 1.1 mrg goto error; 673 1.1 mrg isl_seq_cpy(res->el, vec->el, offset); 674 1.1 mrg isl_seq_clr(res->el + offset, res->size - offset); 675 1.1 mrg for (i = 0; i < r->src_len; ++i) 676 1.1 mrg isl_int_set(res->el[offset + r->pos[i]], vec->el[offset + i]); 677 1.1 mrg 678 1.1 mrg isl_reordering_free(r); 679 1.1 mrg isl_vec_free(vec); 680 1.1 mrg return res; 681 1.1 mrg error: 682 1.1 mrg isl_vec_free(vec); 683 1.1 mrg isl_reordering_free(r); 684 1.1 mrg return NULL; 685 1.1 mrg } 686