source/blender/blenkernel/intern/curve.c

   1
   2 /*  curve.c
   3  *
   4  *
   5  * $Id$
   6  *
   7  * ***** BEGIN GPL LICENSE BLOCK *****
   8  *
   9  * This program is free software; you can redistribute it and/or
  10  * modify it under the terms of the GNU General Public License
  11  * as published by the Free Software Foundation; either version 2
  12  * of the License, or (at your option) any later version.
  13  *
  14  * This program is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17  * GNU General Public License for more details.
  18  *
  19  * You should have received a copy of the GNU General Public License
  20  * along with this program; if not, write to the Free Software Foundation,
  21  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  22  *
  23  * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
  24  * All rights reserved.
  25  *
  26  * The Original Code is: all of this file.
  27  *
  28  * Contributor(s): none yet.
  29  *
  30  * ***** END GPL LICENSE BLOCK *****
  31  */
  32
  33 /** \file blender/blenkernel/intern/curve.c
  34  *  \ingroup bke
  35  */
  36
  37
  38 #include <math.h>  // floor
  39 #include <string.h>
  40 #include <stdlib.h>
  41
  42 #include "MEM_guardedalloc.h"
  43
  44 #include "BLI_blenlib.h"
  45 #include "BLI_math.h"
  46 #include "BLI_utildefines.h"
  47
  48 #include "DNA_curve_types.h"
  49 #include "DNA_material_types.h"
  50
  51 /* for dereferencing pointers */
  52 #include "DNA_key_types.h"
  53 #include "DNA_scene_types.h"
  54 #include "DNA_vfont_types.h"
  55 #include "DNA_object_types.h"
  56
  57 #include "BKE_animsys.h"
  58 #include "BKE_anim.h"
  59 #include "BKE_curve.h"
  60 #include "BKE_displist.h"
  61 #include "BKE_font.h"
  62 #include "BKE_global.h"
  63 #include "BKE_key.h"
  64 #include "BKE_library.h"
  65 #include "BKE_main.h"
  66 #include "BKE_object.h"
  67 #include "BKE_material.h"
  68
  69
  70 #include "ED_curve.h"
  71
  72 /* globals */
  73
  74 /* local */
  75 static int cu_isectLL(float *v1, float *v2, float *v3, float *v4,
  76                            short cox, short coy,
  77                            float *labda, float *mu, float *vec);
  78
  79 void unlink_curve(Curve *cu)
  80 {
  81         int a;
  82
  83         for(a=0; a<cu->totcol; a++) {
  84                 if(cu->mat[a]) cu->mat[a]->id.us--;
  85                 cu->mat[a]= NULL;
  86         }
  87         if(cu->vfont) cu->vfont->id.us--;
  88         cu->vfont= NULL;
  89
  90         if(cu->vfontb) cu->vfontb->id.us--;
  91         cu->vfontb= NULL;
  92
  93         if(cu->vfonti) cu->vfonti->id.us--;
  94         cu->vfonti= NULL;
  95
  96         if(cu->vfontbi) cu->vfontbi->id.us--;
  97         cu->vfontbi= NULL;
  98
  99         if(cu->key) cu->key->id.us--;
 100         cu->key= NULL;
 101 }
 102
 103 /* frees editcurve entirely */
 104 void BKE_free_editfont(Curve *cu)
 105 {
 106         if(cu->editfont) {
 107                 EditFont *ef= cu->editfont;
 108
 109                 if(ef->oldstr) MEM_freeN(ef->oldstr);
 110                 if(ef->oldstrinfo) MEM_freeN(ef->oldstrinfo);
 111                 if(ef->textbuf) MEM_freeN(ef->textbuf);
 112                 if(ef->textbufinfo) MEM_freeN(ef->textbufinfo);
 113                 if(ef->copybuf) MEM_freeN(ef->copybuf);
 114                 if(ef->copybufinfo) MEM_freeN(ef->copybufinfo);
 115
 116                 MEM_freeN(ef);
 117                 cu->editfont= NULL;
 118         }
 119 }
 120
 121 /* don't free curve itself */
 122 void free_curve(Curve *cu)
 123 {
 124         freeNurblist(&cu->nurb);
 125         BLI_freelistN(&cu->bev);
 126         freedisplist(&cu->disp);
 127         BKE_free_editfont(cu);
 128
 129         free_curve_editNurb(cu);
 130         unlink_curve(cu);
 131         BKE_free_animdata((ID *)cu);
 132
 133         if(cu->mat) MEM_freeN(cu->mat);
 134         if(cu->str) MEM_freeN(cu->str);
 135         if(cu->strinfo) MEM_freeN(cu->strinfo);
 136         if(cu->bb) MEM_freeN(cu->bb);
 137         if(cu->path) free_path(cu->path);
 138         if(cu->tb) MEM_freeN(cu->tb);
 139 }
 140
 141 Curve *add_curve(const char *name, int type)
 142 {
 143         Curve *cu;
 144
 145         cu= alloc_libblock(&G.main->curve, ID_CU, name);
 146
 147         cu->size[0]= cu->size[1]= cu->size[2]= 1.0;
 148         cu->flag= CU_FRONT|CU_BACK|CU_DEFORM_BOUNDS_OFF|CU_PATH_RADIUS;
 149         cu->pathlen= 100;
 150         cu->resolu= cu->resolv= (type == OB_SURF) ? 4 : 12;
 151         cu->width= 1.0;
 152         cu->wordspace = 1.0;
 153         cu->spacing= cu->linedist= 1.0;
 154         cu->fsize= 1.0;
 155         cu->ulheight = 0.05;
 156         cu->texflag= CU_AUTOSPACE;
 157         cu->smallcaps_scale= 0.75f;
 158         cu->twist_mode= CU_TWIST_MINIMUM;       // XXX: this one seems to be the best one in most cases, at least for curve deform...
 159
 160         cu->bb= unit_boundbox();
 161
 162         if(type==OB_FONT) {
 163                 cu->vfont= cu->vfontb= cu->vfonti= cu->vfontbi= get_builtin_font();
 164                 cu->vfont->id.us+=4;
 165                 cu->str= MEM_mallocN(12, "str");
 166                 BLI_strncpy(cu->str, "Text", 12);
 167                 cu->len= cu->pos= 4;
 168                 cu->strinfo= MEM_callocN(12*sizeof(CharInfo), "strinfo new");
 169                 cu->totbox= cu->actbox= 1;
 170                 cu->tb= MEM_callocN(MAXTEXTBOX*sizeof(TextBox), "textbox");
 171                 cu->tb[0].w = cu->tb[0].h = 0.0;
 172         }
 173
 174         return cu;
 175 }
 176
 177 Curve *copy_curve(Curve *cu)
 178 {
 179         Curve *cun;
 180         int a;
 181
 182         cun= copy_libblock(cu);
 183         cun->nurb.first= cun->nurb.last= NULL;
 184         duplicateNurblist( &(cun->nurb), &(cu->nurb));
 185
 186         cun->mat= MEM_dupallocN(cu->mat);
 187         for(a=0; a<cun->totcol; a++) {
 188                 id_us_plus((ID *)cun->mat[a]);
 189         }
 190
 191         cun->str= MEM_dupallocN(cu->str);
 192         cun->strinfo= MEM_dupallocN(cu->strinfo);
 193         cun->tb= MEM_dupallocN(cu->tb);
 194         cun->bb= MEM_dupallocN(cu->bb);
 195
 196         cun->key= copy_key(cu->key);
 197         if(cun->key) cun->key->from= (ID *)cun;
 198
 199         cun->disp.first= cun->disp.last= NULL;
 200         cun->bev.first= cun->bev.last= NULL;
 201         cun->path= NULL;
 202
 203         cun->editnurb= NULL;
 204         cun->editfont= NULL;
 205         cun->selboxes= NULL;
 206
 207 #if 0   // XXX old animation system
 208         /* single user ipo too */
 209         if(cun->ipo) cun->ipo= copy_ipo(cun->ipo);
 210 #endif // XXX old animation system
 211
 212         id_us_plus((ID *)cun->vfont);
 213         id_us_plus((ID *)cun->vfontb);
 214         id_us_plus((ID *)cun->vfonti);
 215         id_us_plus((ID *)cun->vfontbi);
 216
 217         return cun;
 218 }
 219
 220 static void extern_local_curve(Curve *cu)
 221 {
 222         id_lib_extern((ID *)cu->vfont);
 223         id_lib_extern((ID *)cu->vfontb);
 224         id_lib_extern((ID *)cu->vfonti);
 225         id_lib_extern((ID *)cu->vfontbi);
 226
 227         if(cu->mat) {
 228                 extern_local_matarar(cu->mat, cu->totcol);
 229         }
 230 }
 231
 232 void make_local_curve(Curve *cu)
 233 {
 234         Main *bmain= G.main;
 235         Object *ob;
 236         int local=0, lib=0;
 237
 238         /* - when there are only lib users: don't do
 239          * - when there are only local users: set flag
 240          * - mixed: do a copy
 241          */
 242
 243         if(cu->id.lib==NULL) return;
 244
 245         if(cu->id.us==1) {
 246                 cu->id.lib= NULL;
 247                 cu->id.flag= LIB_LOCAL;
 248
 249                 new_id(&bmain->curve, (ID *)cu, NULL);
 250                 extern_local_curve(cu);
 251                 return;
 252         }
 253
 254         for(ob= bmain->object.first; ob && ELEM(0, lib, local); ob= ob->id.next) {
 255                 if(ob->data == cu) {
 256                         if(ob->id.lib) lib= 1;
 257                         else local= 1;
 258                 }
 259         }
 260
 261         if(local && lib==0) {
 262                 cu->id.lib= NULL;
 263                 cu->id.flag= LIB_LOCAL;
 264
 265                 new_id(&bmain->curve, (ID *)cu, NULL);
 266                 extern_local_curve(cu);
 267         }
 268         else if(local && lib) {
 269                 Curve *cun= copy_curve(cu);
 270                 cun->id.us= 0;
 271
 272                 for(ob= bmain->object.first; ob; ob= ob->id.next) {
 273                         if(ob->data==cu) {
 274                                 if(ob->id.lib==NULL) {
 275                                         ob->data= cun;
 276                                         cun->id.us++;
 277                                         cu->id.us--;
 278                                 }
 279                         }
 280                 }
 281         }
 282 }
 283
 284 short curve_type(Curve *cu)
 285 {
 286         Nurb *nu;
 287         if(cu->vfont) {
 288                 return OB_FONT;
 289         }
 290         for (nu= cu->nurb.first; nu; nu= nu->next) {
 291                 if(nu->pntsv>1) {
 292                         return OB_SURF;
 293                 }
 294         }
 295
 296         return OB_CURVE;
 297 }
 298
 299 void test_curve_type(Object *ob)
 300 {
 301         ob->type = curve_type(ob->data);
 302 }
 303
 304 void tex_space_curve(Curve *cu)
 305 {
 306         DispList *dl;
 307         BoundBox *bb;
 308         float *fp, min[3], max[3];
 309         int tot, doit= 0;
 310
 311         if(cu->bb==NULL) cu->bb= MEM_callocN(sizeof(BoundBox), "boundbox");
 312         bb= cu->bb;
 313
 314         INIT_MINMAX(min, max);
 315
 316         dl= cu->disp.first;
 317         while(dl) {
 318
 319                 if(dl->type==DL_INDEX3 || dl->type==DL_INDEX3) tot= dl->nr;
 320                 else tot= dl->nr*dl->parts;
 321
 322                 if(tot) doit= 1;
 323                 fp= dl->verts;
 324                 while(tot--) {
 325                         DO_MINMAX(fp, min, max);
 326                         fp += 3;
 327                 }
 328                 dl= dl->next;
 329         }
 330
 331         if(!doit) {
 332                 min[0] = min[1] = min[2] = -1.0f;
 333                 max[0] = max[1] = max[2] = 1.0f;
 334         }
 335
 336         boundbox_set_from_min_max(bb, min, max);
 337
 338         if(cu->texflag & CU_AUTOSPACE) {
 339                 mid_v3_v3v3(cu->loc, min, max);
 340                 cu->size[0]= (max[0]-min[0])/2.0f;
 341                 cu->size[1]= (max[1]-min[1])/2.0f;
 342                 cu->size[2]= (max[2]-min[2])/2.0f;
 343
 344                 cu->rot[0]= cu->rot[1]= cu->rot[2]= 0.0f;
 345
 346                 if(cu->size[0]==0.0f) cu->size[0]= 1.0f;
 347                 else if(cu->size[0]>0.0f && cu->size[0]<0.00001f) cu->size[0]= 0.00001f;
 348                 else if(cu->size[0]<0.0f && cu->size[0]> -0.00001f) cu->size[0]= -0.00001f;
 349
 350                 if(cu->size[1]==0.0f) cu->size[1]= 1.0f;
 351                 else if(cu->size[1]>0.0f && cu->size[1]<0.00001f) cu->size[1]= 0.00001f;
 352                 else if(cu->size[1]<0.0f && cu->size[1]> -0.00001f) cu->size[1]= -0.00001f;
 353
 354                 if(cu->size[2]==0.0f) cu->size[2]= 1.0f;
 355                 else if(cu->size[2]>0.0f && cu->size[2]<0.00001f) cu->size[2]= 0.00001f;
 356                 else if(cu->size[2]<0.0f && cu->size[2]> -0.00001f) cu->size[2]= -0.00001f;
 357
 358         }
 359 }
 360
 361
 362 int count_curveverts(ListBase *nurb)
 363 {
 364         Nurb *nu;
 365         int tot=0;
 366
 367         nu= nurb->first;
 368         while(nu) {
 369                 if(nu->bezt) tot+= 3*nu->pntsu;
 370                 else if(nu->bp) tot+= nu->pntsu*nu->pntsv;
 371
 372                 nu= nu->next;
 373         }
 374         return tot;
 375 }
 376
 377 int count_curveverts_without_handles(ListBase *nurb)
 378 {
 379         Nurb *nu;
 380         int tot=0;
 381
 382         nu= nurb->first;
 383         while(nu) {
 384                 if(nu->bezt) tot+= nu->pntsu;
 385                 else if(nu->bp) tot+= nu->pntsu*nu->pntsv;
 386
 387                 nu= nu->next;
 388         }
 389         return tot;
 390 }
 391
 392 /* **************** NURBS ROUTINES ******************** */
 393
 394 void freeNurb(Nurb *nu)
 395 {
 396
 397         if(nu==NULL) return;
 398
 399         if(nu->bezt) MEM_freeN(nu->bezt);
 400         nu->bezt= NULL;
 401         if(nu->bp) MEM_freeN(nu->bp);
 402         nu->bp= NULL;
 403         if(nu->knotsu) MEM_freeN(nu->knotsu);
 404         nu->knotsu= NULL;
 405         if(nu->knotsv) MEM_freeN(nu->knotsv);
 406         nu->knotsv= NULL;
 407         /* if(nu->trim.first) freeNurblist(&(nu->trim)); */
 408
 409         MEM_freeN(nu);
 410
 411 }
 412
 413
 414 void freeNurblist(ListBase *lb)
 415 {
 416         Nurb *nu, *next;
 417
 418         if(lb==NULL) return;
 419
 420         nu= lb->first;
 421         while(nu) {
 422                 next= nu->next;
 423                 freeNurb(nu);
 424                 nu= next;
 425         }
 426         lb->first= lb->last= NULL;
 427 }
 428
 429 Nurb *duplicateNurb(Nurb *nu)
 430 {
 431         Nurb *newnu;
 432         int len;
 433
 434         newnu= (Nurb*)MEM_mallocN(sizeof(Nurb),"duplicateNurb");
 435         if(newnu==NULL) return NULL;
 436         memcpy(newnu, nu, sizeof(Nurb));
 437
 438         if(nu->bezt) {
 439                 newnu->bezt=
 440                         (BezTriple*)MEM_mallocN((nu->pntsu)* sizeof(BezTriple),"duplicateNurb2");
 441                 memcpy(newnu->bezt, nu->bezt, nu->pntsu*sizeof(BezTriple));
 442         }
 443         else {
 444                 len= nu->pntsu*nu->pntsv;
 445                 newnu->bp=
 446                         (BPoint*)MEM_mallocN((len)* sizeof(BPoint),"duplicateNurb3");
 447                 memcpy(newnu->bp, nu->bp, len*sizeof(BPoint));
 448
 449                 newnu->knotsu= newnu->knotsv= NULL;
 450
 451                 if(nu->knotsu) {
 452                         len= KNOTSU(nu);
 453                         if(len) {
 454                                 newnu->knotsu= MEM_mallocN(len*sizeof(float), "duplicateNurb4");
 455                                 memcpy(newnu->knotsu, nu->knotsu, sizeof(float)*len);
 456                         }
 457                 }
 458                 if(nu->pntsv>1 && nu->knotsv) {
 459                         len= KNOTSV(nu);
 460                         if(len) {
 461                                 newnu->knotsv= MEM_mallocN(len*sizeof(float), "duplicateNurb5");
 462                                 memcpy(newnu->knotsv, nu->knotsv, sizeof(float)*len);
 463                         }
 464                 }
 465         }
 466         return newnu;
 467 }
 468
 469 void duplicateNurblist(ListBase *lb1, ListBase *lb2)
 470 {
 471         Nurb *nu, *nun;
 472
 473         freeNurblist(lb1);
 474
 475         nu= lb2->first;
 476         while(nu) {
 477                 nun= duplicateNurb(nu);
 478                 BLI_addtail(lb1, nun);
 479
 480                 nu= nu->next;
 481         }
 482 }
 483
 484 void test2DNurb(Nurb *nu)
 485 {
 486         BezTriple *bezt;
 487         BPoint *bp;
 488         int a;
 489
 490         if((nu->flag & CU_2D)==0)
 491                 return;
 492
 493         if(nu->type == CU_BEZIER) {
 494                 a= nu->pntsu;
 495                 bezt= nu->bezt;
 496                 while(a--) {
 497                         bezt->vec[0][2]= 0.0;
 498                         bezt->vec[1][2]= 0.0;
 499                         bezt->vec[2][2]= 0.0;
 500                         bezt++;
 501                 }
 502         }
 503         else {
 504                 a= nu->pntsu*nu->pntsv;
 505                 bp= nu->bp;
 506                 while(a--) {
 507                         bp->vec[2]= 0.0;
 508                         bp++;
 509                 }
 510         }
 511 }
 512
 513 void minmaxNurb(Nurb *nu, float *min, float *max)
 514 {
 515         BezTriple *bezt;
 516         BPoint *bp;
 517         int a;
 518
 519         if(nu->type == CU_BEZIER) {
 520                 a= nu->pntsu;
 521                 bezt= nu->bezt;
 522                 while(a--) {
 523                         DO_MINMAX(bezt->vec[0], min, max);
 524                         DO_MINMAX(bezt->vec[1], min, max);
 525                         DO_MINMAX(bezt->vec[2], min, max);
 526                         bezt++;
 527                 }
 528         }
 529         else {
 530                 a= nu->pntsu*nu->pntsv;
 531                 bp= nu->bp;
 532                 while(a--) {
 533                         DO_MINMAX(bp->vec, min, max);
 534                         bp++;
 535                 }
 536         }
 537 }
 538
 539 /* be sure to call makeknots after this */
 540 void addNurbPoints(Nurb *nu, int number)
 541 {
 542         BPoint *tmp= nu->bp;
 543         int i;
 544         nu->bp= (BPoint *)MEM_mallocN((nu->pntsu + number) * sizeof(BPoint), "rna_Curve_spline_points_add");
 545
 546         if(tmp) {
 547                 memmove(nu->bp, tmp, nu->pntsu * sizeof(BPoint));
 548                 MEM_freeN(tmp);
 549         }
 550
 551         memset(nu->bp + nu->pntsu, 0, number * sizeof(BPoint));
 552
 553         for(i=0, tmp= nu->bp + nu->pntsu; i < number; i++, tmp++) {
 554                 tmp->radius= 1.0f;
 555         }
 556
 557         nu->pntsu += number;
 558 }
 559
 560 void addNurbPointsBezier(Nurb *nu, int number)
 561 {
 562         BezTriple *tmp= nu->bezt;
 563         int i;
 564         nu->bezt= (BezTriple *)MEM_mallocN((nu->pntsu + number) * sizeof(BezTriple), "rna_Curve_spline_points_add");
 565
 566         if(tmp) {
 567                 memmove(nu->bezt, tmp, nu->pntsu * sizeof(BezTriple));
 568                 MEM_freeN(tmp);
 569         }
 570
 571         memset(nu->bezt + nu->pntsu, 0, number * sizeof(BezTriple));
 572
 573         for(i=0, tmp= nu->bezt + nu->pntsu; i < number; i++, tmp++) {
 574                 tmp->radius= 1.0f;
 575         }
 576
 577         nu->pntsu += number;
 578 }
 579
 580 /* ~~~~~~~~~~~~~~~~~~~~Non Uniform Rational B Spline calculations ~~~~~~~~~~~ */
 581
 582
 583 static void calcknots(float *knots, const short pnts, const short order, const short flag)
 584 {
 585         /* knots: number of pnts NOT corrected for cyclic */
 586         const int pnts_order= pnts + order;
 587         float k;
 588         int a;
 589
 590         switch(flag & (CU_NURB_ENDPOINT|CU_NURB_BEZIER)) {
 591         case CU_NURB_ENDPOINT:
 592                 k= 0.0;
 593                 for(a=1; a <= pnts_order; a++) {
 594                         knots[a-1]= k;
 595                         if(a >= order && a <= pnts) k+= 1.0f;
 596                 }
 597                 break;
 598         case CU_NURB_BEZIER:
 599                 /* Warning, the order MUST be 2 or 4,
 600                  * if this is not enforced, the displist will be corrupt */
 601                 if(order==4) {
 602                         k= 0.34;
 603                         for(a=0; a < pnts_order; a++) {
 604                                 knots[a]= floorf(k);
 605                                 k+= (1.0f/3.0f);
 606                         }
 607                 }
 608                 else if(order==3) {
 609                         k= 0.6f;
 610                         for(a=0; a < pnts_order; a++) {
 611                                 if(a >= order && a <= pnts) k+= 0.5f;
 612                                 knots[a]= floorf(k);
 613                         }
 614                 }
 615                 else {
 616                         printf("bez nurb curve order is not 3 or 4, should never happen\n");
 617                 }
 618                 break;
 619         default:
 620                 for(a=0; a < pnts_order; a++) {
 621                         knots[a]= (float)a;
 622                 }
 623                 break;
 624         }
 625 }
 626
 627 static void makecyclicknots(float *knots, short pnts, short order)
 628 /* pnts, order: number of pnts NOT corrected for cyclic */
 629 {
 630         int a, b, order2, c;
 631
 632         if(knots==NULL) return;
 633
 634         order2=order-1;
 635
 636         /* do first long rows (order -1), remove identical knots at endpoints */
 637         if(order>2) {
 638                 b= pnts+order2;
 639                 for(a=1; a<order2; a++) {
 640                         if(knots[b]!= knots[b-a]) break;
 641                 }
 642                 if(a==order2) knots[pnts+order-2]+= 1.0f;
 643         }
 644
 645         b= order;
 646                 c=pnts + order + order2;
 647         for(a=pnts+order2; a<c; a++) {
 648                 knots[a]= knots[a-1]+ (knots[b]-knots[b-1]);
 649                 b--;
 650         }
 651 }
 652
 653
 654
 655 static void makeknots(Nurb *nu, short uv)
 656 {
 657         if(nu->type == CU_NURBS) {
 658                 if(uv == 1) {
 659                         if(nu->knotsu) MEM_freeN(nu->knotsu);
 660                         if(check_valid_nurb_u(nu)) {
 661                                 nu->knotsu= MEM_callocN(4+sizeof(float)*KNOTSU(nu), "makeknots");
 662                                 if(nu->flagu & CU_NURB_CYCLIC) {
 663                                         calcknots(nu->knotsu, nu->pntsu, nu->orderu, 0);  /* cyclic should be uniform */
 664                                         makecyclicknots(nu->knotsu, nu->pntsu, nu->orderu);
 665                                 } else {
 666                                         calcknots(nu->knotsu, nu->pntsu, nu->orderu, nu->flagu);
 667                                 }
 668                         }
 669                         else nu->knotsu= NULL;
 670
 671                 } else if(uv == 2) {
 672                         if(nu->knotsv) MEM_freeN(nu->knotsv);
 673                         if(check_valid_nurb_v(nu)) {
 674                                 nu->knotsv= MEM_callocN(4+sizeof(float)*KNOTSV(nu), "makeknots");
 675                                 if(nu->flagv & CU_NURB_CYCLIC) {
 676                                         calcknots(nu->knotsv, nu->pntsv, nu->orderv, 0);  /* cyclic should be uniform */
 677                                         makecyclicknots(nu->knotsv, nu->pntsv, nu->orderv);
 678                                 } else {
 679                                         calcknots(nu->knotsv, nu->pntsv, nu->orderv, nu->flagv);
 680                                 }
 681                         }
 682                         else nu->knotsv= NULL;
 683                 }
 684         }
 685 }
 686
 687 void nurbs_knot_calc_u(Nurb *nu)
 688 {
 689         makeknots(nu, 1);
 690 }
 691
 692 void nurbs_knot_calc_v(Nurb *nu)
 693 {
 694         makeknots(nu, 2);
 695 }
 696
 697 static void basisNurb(float t, short order, short pnts, float *knots, float *basis, int *start, int *end)
 698 {
 699         float d, e;
 700         int i, i1 = 0, i2 = 0 ,j, orderpluspnts, opp2, o2;
 701
 702         orderpluspnts= order+pnts;
 703                 opp2 = orderpluspnts-1;
 704
 705         /* this is for float inaccuracy */
 706         if(t < knots[0]) t= knots[0];
 707         else if(t > knots[opp2]) t= knots[opp2];
 708
 709         /* this part is order '1' */
 710                 o2 = order + 1;
 711         for(i=0;i<opp2;i++) {
 712                 if(knots[i]!=knots[i+1] && t>= knots[i] && t<=knots[i+1]) {
 713                         basis[i]= 1.0;
 714                         i1= i-o2;
 715                         if(i1<0) i1= 0;
 716                         i2= i;
 717                         i++;
 718                         while(i<opp2) {
 719                                 basis[i]= 0.0;
 720                                 i++;
 721                         }
 722                         break;
 723                 }
 724                 else basis[i]= 0.0;
 725         }
 726         basis[i]= 0.0;
 727
 728         /* this is order 2,3,... */
 729         for(j=2; j<=order; j++) {
 730
 731                 if(i2+j>= orderpluspnts) i2= opp2-j;
 732
 733                 for(i= i1; i<=i2; i++) {
 734                         if(basis[i]!=0.0f)
 735                                 d= ((t-knots[i])*basis[i]) / (knots[i+j-1]-knots[i]);
 736                         else
 737                                 d= 0.0f;
 738
 739                         if(basis[i+1] != 0.0f)
 740                                 e= ((knots[i+j]-t)*basis[i+1]) / (knots[i+j]-knots[i+1]);
 741                         else
 742                                 e= 0.0;
 743
 744                         basis[i]= d+e;
 745                 }
 746         }
 747
 748         *start= 1000;
 749         *end= 0;
 750
 751         for(i=i1; i<=i2; i++) {
 752                 if(basis[i] > 0.0f) {
 753                         *end= i;
 754                         if(*start==1000) *start= i;
 755                 }
 756         }
 757 }
 758
 759
 760 void makeNurbfaces(Nurb *nu, float *coord_array, int rowstride, int resolu, int resolv)
 761 /* coord_array  has to be 3*4*resolu*resolv in size, and zero-ed */
 762 {
 763         BPoint *bp;
 764         float *basisu, *basis, *basisv, *sum, *fp, *in;
 765         float u, v, ustart, uend, ustep, vstart, vend, vstep, sumdiv;
 766         int i, j, iofs, jofs, cycl, len, curu, curv;
 767         int istart, iend, jsta, jen, *jstart, *jend, ratcomp;
 768
 769         int totu = nu->pntsu*resolu, totv = nu->pntsv*resolv;
 770
 771         if(nu->knotsu==NULL || nu->knotsv==NULL) return;
 772         if(nu->orderu>nu->pntsu) return;
 773         if(nu->orderv>nu->pntsv) return;
 774         if(coord_array==NULL) return;
 775
 776         /* allocate and initialize */
 777         len = totu * totv;
 778         if(len==0) return;
 779
 780
 781
 782         sum= (float *)MEM_callocN(sizeof(float)*len, "makeNurbfaces1");
 783
 784         len= totu*totv;
 785         if(len==0) {
 786                 MEM_freeN(sum);
 787                 return;
 788         }
 789
 790         bp= nu->bp;
 791         i= nu->pntsu*nu->pntsv;
 792         ratcomp=0;
 793         while(i--) {
 794                 if(bp->vec[3] != 1.0f) {
 795                         ratcomp= 1;
 796                         break;
 797                 }
 798                 bp++;
 799         }
 800
 801         fp= nu->knotsu;
 802         ustart= fp[nu->orderu-1];
 803         if(nu->flagu & CU_NURB_CYCLIC) uend= fp[nu->pntsu+nu->orderu-1];
 804         else uend= fp[nu->pntsu];
 805         ustep= (uend-ustart)/((nu->flagu & CU_NURB_CYCLIC) ? totu : totu - 1);
 806
 807         basisu= (float *)MEM_mallocN(sizeof(float)*KNOTSU(nu), "makeNurbfaces3");
 808
 809         fp= nu->knotsv;
 810         vstart= fp[nu->orderv-1];
 811
 812         if(nu->flagv & CU_NURB_CYCLIC) vend= fp[nu->pntsv+nu->orderv-1];
 813         else vend= fp[nu->pntsv];
 814         vstep= (vend-vstart)/((nu->flagv & CU_NURB_CYCLIC) ? totv : totv - 1);
 815
 816         len= KNOTSV(nu);
 817         basisv= (float *)MEM_mallocN(sizeof(float)*len*totv, "makeNurbfaces3");
 818         jstart= (int *)MEM_mallocN(sizeof(float)*totv, "makeNurbfaces4");
 819         jend= (int *)MEM_mallocN(sizeof(float)*totv, "makeNurbfaces5");
 820
 821         /* precalculation of basisv and jstart,jend */
 822         if(nu->flagv & CU_NURB_CYCLIC) cycl= nu->orderv-1;
 823         else cycl= 0;
 824         v= vstart;
 825         basis= basisv;
 826         curv= totv;
 827         while(curv--) {
 828                 basisNurb(v, nu->orderv, (short)(nu->pntsv+cycl), nu->knotsv, basis, jstart+curv, jend+curv);
 829                 basis+= KNOTSV(nu);
 830                 v+= vstep;
 831         }
 832
 833         if(nu->flagu & CU_NURB_CYCLIC) cycl= nu->orderu-1;
 834         else cycl= 0;
 835         in= coord_array;
 836         u= ustart;
 837         curu= totu;
 838         while(curu--) {
 839
 840                 basisNurb(u, nu->orderu, (short)(nu->pntsu+cycl), nu->knotsu, basisu, &istart, &iend);
 841
 842                 basis= basisv;
 843                 curv= totv;
 844                 while(curv--) {
 845
 846                         jsta= jstart[curv];
 847                         jen= jend[curv];
 848
 849                         /* calculate sum */
 850                         sumdiv= 0.0;
 851                         fp= sum;
 852
 853                         for(j= jsta; j<=jen; j++) {
 854
 855                                 if(j>=nu->pntsv) jofs= (j - nu->pntsv);
 856                                 else jofs= j;
 857                                 bp= nu->bp+ nu->pntsu*jofs+istart-1;
 858
 859                                 for(i= istart; i<=iend; i++, fp++) {
 860
 861                                         if(i>= nu->pntsu) {
 862                                                 iofs= i- nu->pntsu;
 863                                                 bp= nu->bp+ nu->pntsu*jofs+iofs;
 864                                         }
 865                                         else bp++;
 866
 867                                         if(ratcomp) {
 868                                                 *fp= basisu[i]*basis[j]*bp->vec[3];
 869                                                 sumdiv+= *fp;
 870                                         }
 871                                         else *fp= basisu[i]*basis[j];
 872                                 }
 873                         }
 874
 875                         if(ratcomp) {
 876                                 fp= sum;
 877                                 for(j= jsta; j<=jen; j++) {
 878                                         for(i= istart; i<=iend; i++, fp++) {
 879                                                 *fp/= sumdiv;
 880                                         }
 881                                 }
 882                         }
 883
 884                         /* one! (1.0) real point now */
 885                         fp= sum;
 886                         for(j= jsta; j<=jen; j++) {
 887
 888                                 if(j>=nu->pntsv) jofs= (j - nu->pntsv);
 889                                 else jofs= j;
 890                                 bp= nu->bp+ nu->pntsu*jofs+istart-1;
 891
 892                                 for(i= istart; i<=iend; i++, fp++) {
 893
 894                                         if(i>= nu->pntsu) {
 895                                                 iofs= i- nu->pntsu;
 896                                                 bp= nu->bp+ nu->pntsu*jofs+iofs;
 897                                         }
 898                                         else bp++;
 899
 900                                         if(*fp != 0.0f) {
 901                                                 in[0]+= (*fp) * bp->vec[0];
 902                                                 in[1]+= (*fp) * bp->vec[1];
 903                                                 in[2]+= (*fp) * bp->vec[2];
 904                                         }
 905                                 }
 906                         }
 907
 908                         in+=3;
 909                         basis+= KNOTSV(nu);
 910                 }
 911                 u+= ustep;
 912                 if (rowstride!=0) in = (float*) (((unsigned char*) in) + (rowstride - 3*totv*sizeof(*in)));
 913         }
 914
 915         /* free */
 916         MEM_freeN(sum);
 917         MEM_freeN(basisu);
 918         MEM_freeN(basisv);
 919         MEM_freeN(jstart);
 920         MEM_freeN(jend);
 921 }
 922
 923 void makeNurbcurve(Nurb *nu, float *coord_array, float *tilt_array, float *radius_array, float *weight_array, int resolu, int stride)
 924 /* coord_array has to be 3*4*pntsu*resolu in size and zero-ed
 925  * tilt_array and radius_array will be written to if valid */
 926 {
 927         BPoint *bp;
 928         float u, ustart, uend, ustep, sumdiv;
 929         float *basisu, *sum, *fp;
 930         float *coord_fp= coord_array, *tilt_fp= tilt_array, *radius_fp= radius_array, *weight_fp= weight_array;
 931         int i, len, istart, iend, cycl;
 932
 933         if(nu->knotsu==NULL) return;
 934         if(nu->orderu>nu->pntsu) return;
 935         if(coord_array==NULL) return;
 936
 937         /* allocate and initialize */
 938         len= nu->pntsu;
 939         if(len==0) return;
 940         sum= (float *)MEM_callocN(sizeof(float)*len, "makeNurbcurve1");
 941
 942         resolu= (resolu*SEGMENTSU(nu));
 943
 944         if(resolu==0) {
 945                 MEM_freeN(sum);
 946                 return;
 947         }
 948
 949         fp= nu->knotsu;
 950         ustart= fp[nu->orderu-1];
 951         if(nu->flagu & CU_NURB_CYCLIC) uend= fp[nu->pntsu+nu->orderu-1];
 952         else uend= fp[nu->pntsu];
 953         ustep= (uend-ustart)/(resolu - ((nu->flagu & CU_NURB_CYCLIC) ? 0 : 1));
 954
 955         basisu= (float *)MEM_mallocN(sizeof(float)*KNOTSU(nu), "makeNurbcurve3");
 956
 957         if(nu->flagu & CU_NURB_CYCLIC) cycl= nu->orderu-1;
 958         else cycl= 0;
 959
 960         u= ustart;
 961         while(resolu--) {
 962
 963                 basisNurb(u, nu->orderu, (short)(nu->pntsu+cycl), nu->knotsu, basisu, &istart, &iend);
 964                 /* calc sum */
 965                 sumdiv= 0.0;
 966                 fp= sum;
 967                 bp= nu->bp+ istart-1;
 968                 for(i= istart; i<=iend; i++, fp++) {
 969
 970                         if(i>=nu->pntsu) bp= nu->bp+(i - nu->pntsu);
 971                         else bp++;
 972
 973                         *fp= basisu[i]*bp->vec[3];
 974                         sumdiv+= *fp;
 975                 }
 976                 if(sumdiv != 0.0f) if(sumdiv < 0.999f || sumdiv > 1.001f) {
 977                         /* is normalizing needed? */
 978                         fp= sum;
 979                         for(i= istart; i<=iend; i++, fp++) {
 980                                 *fp/= sumdiv;
 981                         }
 982                 }
 983
 984                 /* one! (1.0) real point */
 985                 fp= sum;
 986                 bp= nu->bp+ istart-1;
 987                 for(i= istart; i<=iend; i++, fp++) {
 988
 989                         if(i>=nu->pntsu) bp= nu->bp+(i - nu->pntsu);
 990                         else bp++;
 991
 992                         if(*fp != 0.0f) {
 993
 994                                 coord_fp[0]+= (*fp) * bp->vec[0];
 995                                 coord_fp[1]+= (*fp) * bp->vec[1];
 996                                 coord_fp[2]+= (*fp) * bp->vec[2];
 997
 998                                 if (tilt_fp)
 999                                         (*tilt_fp) += (*fp) * bp->alfa;
1000
1001                                 if (radius_fp)
1002                                         (*radius_fp) += (*fp) * bp->radius;
1003
1004                                 if (weight_fp)
1005                                         (*weight_fp) += (*fp) * bp->weight;
1006
1007                         }
1008                 }
1009
1010                 coord_fp = (float *)(((char *)coord_fp) + stride);
1011
1012                 if (tilt_fp)    tilt_fp = (float *)(((char *)tilt_fp) + stride);
1013                 if (radius_fp)  radius_fp = (float *)(((char *)radius_fp) + stride);
1014                 if (weight_fp)  weight_fp = (float *)(((char *)weight_fp) + stride);
1015
1016                 u+= ustep;
1017         }
1018
1019         /* free */
1020         MEM_freeN(sum);
1021         MEM_freeN(basisu);
1022 }
1023
1024 /* forward differencing method for bezier curve */
1025 void forward_diff_bezier(float q0, float q1, float q2, float q3, float *p, int it, int stride)
1026 {
1027         float rt0,rt1,rt2,rt3,f;
1028         int a;
1029
1030         f= (float)it;
1031         rt0= q0;
1032         rt1= 3.0f*(q1-q0)/f;
1033         f*= f;
1034         rt2= 3.0f*(q0-2.0f*q1+q2)/f;
1035         f*= it;
1036         rt3= (q3-q0+3.0f*(q1-q2))/f;
1037
1038         q0= rt0;
1039         q1= rt1+rt2+rt3;
1040         q2= 2*rt2+6*rt3;
1041         q3= 6*rt3;
1042
1043         for(a=0; a<=it; a++) {
1044                 *p= q0;
1045                 p = (float *)(((char *)p)+stride);
1046                 q0+= q1;
1047                 q1+= q2;
1048                 q2+= q3;
1049         }
1050 }
1051
1052 static void forward_diff_bezier_cotangent(float *p0, float *p1, float *p2, float *p3, float *p, int it, int stride)
1053 {
1054         /* note that these are not purpendicular to the curve
1055          * they need to be rotated for this,
1056          *
1057          * This could also be optimized like forward_diff_bezier */
1058         int a;
1059         for(a=0; a<=it; a++) {
1060                 float t = (float)a / (float)it;
1061
1062                 int i;
1063                 for(i=0; i<3; i++) {
1064                         p[i]= (-6*t + 6)*p0[i] + (18*t - 12)*p1[i] + (-18*t + 6)*p2[i] + (6*t)*p3[i];
1065                 }
1066                 normalize_v3(p);
1067                 p = (float *)(((char *)p)+stride);
1068         }
1069 }
1070
1071 /* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ */
1072
1073 float *make_orco_surf(Object *ob)
1074 {
1075         /* Note: this function is used in convertblender only atm, so
1076          * suppose nonzero curve's render resolution should always be used */
1077         Curve *cu= ob->data;
1078         Nurb *nu;
1079         int a, b, tot=0;
1080         int sizeu, sizev;
1081         int resolu, resolv;
1082         float *fp, *coord_array;
1083
1084         /* first calculate the size of the datablock */
1085         nu= cu->nurb.first;
1086         while(nu) {
1087                 /* as we want to avoid the seam in a cyclic nurbs
1088                 texture wrapping, reserve extra orco data space to save these extra needed
1089                 vertex based UV coordinates for the meridian vertices.
1090                 Vertices on the 0/2pi boundary are not duplicated inside the displist but later in
1091                 the renderface/vert construction.
1092
1093                 See also convertblender.c: init_render_surf()
1094                 */
1095
1096                 resolu= cu->resolu_ren ? cu->resolu_ren : nu->resolu;
1097                 resolv= cu->resolv_ren ? cu->resolv_ren : nu->resolv;
1098
1099                 sizeu = nu->pntsu*resolu;
1100                 sizev = nu->pntsv*resolv;
1101                 if (nu->flagu & CU_NURB_CYCLIC) sizeu++;
1102                 if (nu->flagv & CU_NURB_CYCLIC) sizev++;
1103                 if(nu->pntsv>1) tot+= sizeu * sizev;
1104
1105                 nu= nu->next;
1106         }
1107         /* makeNurbfaces wants zeros */
1108         fp= coord_array= MEM_callocN(3*sizeof(float)*tot, "make_orco");
1109
1110         nu= cu->nurb.first;
1111         while(nu) {
1112                 resolu= cu->resolu_ren ? cu->resolu_ren : nu->resolu;
1113                 resolv= cu->resolv_ren ? cu->resolv_ren : nu->resolv;
1114
1115                 if(nu->pntsv>1) {
1116                         sizeu = nu->pntsu*resolu;
1117                         sizev = nu->pntsv*resolv;
1118                         if (nu->flagu & CU_NURB_CYCLIC) sizeu++;
1119                         if (nu->flagv & CU_NURB_CYCLIC) sizev++;
1120
1121                         if(cu->flag & CU_UV_ORCO) {
1122                                 for(b=0; b< sizeu; b++) {
1123                                         for(a=0; a< sizev; a++) {
1124
1125                                                 if(sizev <2) fp[0]= 0.0f;
1126                                                 else fp[0]= -1.0f + 2.0f*((float)a)/(sizev - 1);
1127
1128                                                 if(sizeu <2) fp[1]= 0.0f;
1129                                                 else fp[1]= -1.0f + 2.0f*((float)b)/(sizeu - 1);
1130
1131                                                 fp[2]= 0.0;
1132
1133                                                 fp+= 3;
1134                                         }
1135                                 }
1136                         }
1137                         else {
1138                                 float *_tdata= MEM_callocN((nu->pntsu*resolu) * (nu->pntsv*resolv) *3*sizeof(float), "temp data");
1139                                 float *tdata= _tdata;
1140
1141                                 makeNurbfaces(nu, tdata, 0, resolu, resolv);
1142
1143                                 for(b=0; b<sizeu; b++) {
1144                                         int use_b= b;
1145                                         if (b==sizeu-1 && (nu->flagu & CU_NURB_CYCLIC))
1146                                                 use_b= 0;
1147
1148                                         for(a=0; a<sizev; a++) {
1149                                                 int use_a= a;
1150                                                 if (a==sizev-1 && (nu->flagv & CU_NURB_CYCLIC))
1151                                                         use_a= 0;
1152
1153                                                 tdata = _tdata + 3 * (use_b * (nu->pntsv*resolv) + use_a);
1154
1155                                                 fp[0]= (tdata[0]-cu->loc[0])/cu->size[0];
1156                                                 fp[1]= (tdata[1]-cu->loc[1])/cu->size[1];
1157                                                 fp[2]= (tdata[2]-cu->loc[2])/cu->size[2];
1158                                                 fp+= 3;
1159                                         }
1160                                 }
1161
1162                                 MEM_freeN(_tdata);
1163                         }
1164                 }
1165                 nu= nu->next;
1166         }
1167
1168         return coord_array;
1169 }
1170
1171
1172         /* NOTE: This routine is tied to the order of vertex
1173          * built by displist and as passed to the renderer.
1174          */
1175 float *make_orco_curve(Scene *scene, Object *ob)
1176 {
1177         Curve *cu = ob->data;
1178         DispList *dl;
1179         int u, v, numVerts;
1180         float *fp, *coord_array;
1181         ListBase disp = {NULL, NULL};
1182
1183         makeDispListCurveTypes_forOrco(scene, ob, &disp);
1184
1185         numVerts = 0;
1186         for (dl=disp.first; dl; dl=dl->next) {
1187                 if (dl->type==DL_INDEX3) {
1188                         numVerts += dl->nr;
1189                 } else if (dl->type==DL_SURF) {
1190                         /* convertblender.c uses the Surface code for creating renderfaces when cyclic U only (closed circle beveling) */
1191                         if (dl->flag & DL_CYCL_U) {
1192                                 if (dl->flag & DL_CYCL_V)
1193                                         numVerts += (dl->parts+1)*(dl->nr+1);
1194                                 else
1195                                         numVerts += dl->parts*(dl->nr+1);
1196                         }
1197                         else
1198                                 numVerts += dl->parts*dl->nr;
1199                 }
1200         }
1201
1202         fp= coord_array= MEM_mallocN(3*sizeof(float)*numVerts, "cu_orco");
1203         for (dl=disp.first; dl; dl=dl->next) {
1204                 if (dl->type==DL_INDEX3) {
1205                         for (u=0; u<dl->nr; u++, fp+=3) {
1206                                 if (cu->flag & CU_UV_ORCO) {
1207                                         fp[0]= 2.0f*u/(dl->nr-1) - 1.0f;
1208                                         fp[1]= 0.0;
1209                                         fp[2]= 0.0;
1210                                 } else {
1211                                         VECCOPY(fp, &dl->verts[u*3]);
1212
1213                                         fp[0]= (fp[0]-cu->loc[0])/cu->size[0];
1214                                         fp[1]= (fp[1]-cu->loc[1])/cu->size[1];
1215                                         fp[2]= (fp[2]-cu->loc[2])/cu->size[2];
1216                                 }
1217                         }
1218                 } else if (dl->type==DL_SURF) {
1219                         int sizeu= dl->nr, sizev= dl->parts;
1220
1221                         /* exception as handled in convertblender.c too */
1222                         if (dl->flag & DL_CYCL_U) {
1223                                 sizeu++;
1224                                 if (dl->flag & DL_CYCL_V)
1225                                         sizev++;
1226                         }
1227
1228                         for (u=0; u<sizev; u++) {
1229                                 for (v=0; v<sizeu; v++,fp+=3) {
1230                                         if (cu->flag & CU_UV_ORCO) {
1231                                                 fp[0]= 2.0f*u/(sizev - 1) - 1.0f;
1232                                                 fp[1]= 2.0f*v/(sizeu - 1) - 1.0f;
1233                                                 fp[2]= 0.0;
1234                                         } else {
1235                                                 float *vert;
1236                                                 int realv= v % dl->nr;
1237                                                 int realu= u % dl->parts;
1238
1239                                                 vert= dl->verts + 3*(dl->nr*realu + realv);
1240                                                 VECCOPY(fp, vert);
1241
1242                                                 fp[0]= (fp[0]-cu->loc[0])/cu->size[0];
1243                                                 fp[1]= (fp[1]-cu->loc[1])/cu->size[1];
1244                                                 fp[2]= (fp[2]-cu->loc[2])/cu->size[2];
1245                                         }
1246                                 }
1247                         }
1248                 }
1249         }
1250
1251         freedisplist(&disp);
1252
1253         return coord_array;
1254 }
1255
1256
1257 /* ***************** BEVEL ****************** */
1258
1259 void makebevelcurve(Scene *scene, Object *ob, ListBase *disp, int forRender)
1260 {
1261         DispList *dl, *dlnew;
1262         Curve *bevcu, *cu;
1263         float *fp, facx, facy, angle, dangle;
1264         int nr, a;
1265
1266         cu= ob->data;
1267         disp->first = disp->last = NULL;
1268
1269         /* if a font object is being edited, then do nothing */
1270 // XXX  if( ob == obedit && ob->type == OB_FONT ) return;
1271
1272         if(cu->bevobj) {
1273                 if (cu->bevobj->type!=OB_CURVE) return;
1274
1275                 bevcu= cu->bevobj->data;
1276                 if(bevcu->ext1==0.0f && bevcu->ext2==0.0f) {
1277                         ListBase bevdisp= {NULL, NULL};
1278                         facx= cu->bevobj->size[0];
1279                         facy= cu->bevobj->size[1];
1280
1281                         if (forRender) {
1282                                 makeDispListCurveTypes_forRender(scene, cu->bevobj, &bevdisp, NULL, 0);
1283                                 dl= bevdisp.first;
1284                         } else {
1285                                 dl= cu->bevobj->disp.first;
1286                                 if(dl==NULL) {
1287                                         makeDispListCurveTypes(scene, cu->bevobj, 0);
1288                                         dl= cu->bevobj->disp.first;
1289                                 }
1290                         }
1291
1292                         while(dl) {
1293                                 if ELEM(dl->type, DL_POLY, DL_SEGM) {
1294                                         dlnew= MEM_mallocN(sizeof(DispList), "makebevelcurve1");
1295                                         *dlnew= *dl;
1296                                         dlnew->verts= MEM_mallocN(3*sizeof(float)*dl->parts*dl->nr, "makebevelcurve1");
1297                                         memcpy(dlnew->verts, dl->verts, 3*sizeof(float)*dl->parts*dl->nr);
1298
1299                                         if(dlnew->type==DL_SEGM) dlnew->flag |= (DL_FRONT_CURVE|DL_BACK_CURVE);
1300
1301                                         BLI_addtail(disp, dlnew);
1302                                         fp= dlnew->verts;
1303                                         nr= dlnew->parts*dlnew->nr;
1304                                         while(nr--) {
1305                                                 fp[2]= fp[1]*facy;
1306                                                 fp[1]= -fp[0]*facx;
1307                                                 fp[0]= 0.0;
1308                                                 fp+= 3;
1309                                         }
1310                                 }
1311                                 dl= dl->next;
1312                         }
1313
1314                         freedisplist(&bevdisp);
1315                 }
1316         }
1317         else if(cu->ext1==0.0f && cu->ext2==0.0f) {
1318                 ;
1319         }
1320         else if(cu->ext2==0.0f) {
1321                 dl= MEM_callocN(sizeof(DispList), "makebevelcurve2");
1322                 dl->verts= MEM_mallocN(2*3*sizeof(float), "makebevelcurve2");
1323                 BLI_addtail(disp, dl);
1324                 dl->type= DL_SEGM;
1325                 dl->parts= 1;
1326                 dl->flag= DL_FRONT_CURVE|DL_BACK_CURVE;
1327                 dl->nr= 2;
1328
1329                 fp= dl->verts;
1330                 fp[0]= fp[1]= 0.0;
1331                 fp[2]= -cu->ext1;
1332                 fp[3]= fp[4]= 0.0;
1333                 fp[5]= cu->ext1;
1334         }
1335         else if( (cu->flag & (CU_FRONT|CU_BACK))==0 && cu->ext1==0.0f)  { // we make a full round bevel in that case
1336
1337                 nr= 4+ 2*cu->bevresol;
1338
1339                 dl= MEM_callocN(sizeof(DispList), "makebevelcurve p1");
1340                 dl->verts= MEM_mallocN(nr*3*sizeof(float), "makebevelcurve p1");
1341                 BLI_addtail(disp, dl);
1342                 dl->type= DL_POLY;
1343                 dl->parts= 1;
1344                 dl->flag= DL_BACK_CURVE;
1345                 dl->nr= nr;
1346
1347                 /* a circle */
1348                 fp= dl->verts;
1349                 dangle= (2.0f*(float)M_PI/(nr));
1350                 angle= -(nr-1)*dangle;
1351
1352                 for(a=0; a<nr; a++) {
1353                         fp[0]= 0.0;
1354                         fp[1]= (cosf(angle)*(cu->ext2));
1355                         fp[2]= (sinf(angle)*(cu->ext2)) - cu->ext1;
1356                         angle+= dangle;
1357                         fp+= 3;
1358                 }
1359         }
1360         else {
1361                 short dnr;
1362
1363                 /* bevel now in three parts, for proper vertex normals */
1364                 /* part 1, back */
1365
1366                 if((cu->flag & CU_BACK) || !(cu->flag & CU_FRONT)) {
1367                         dnr= nr= 2+ cu->bevresol;
1368                         if( (cu->flag & (CU_FRONT|CU_BACK))==0)
1369                                 nr= 3+ 2*cu->bevresol;
1370
1371                         dl= MEM_callocN(sizeof(DispList), "makebevelcurve p1");
1372                         dl->verts= MEM_mallocN(nr*3*sizeof(float), "makebevelcurve p1");
1373                         BLI_addtail(disp, dl);
1374                         dl->type= DL_SEGM;
1375                         dl->parts= 1;
1376                         dl->flag= DL_BACK_CURVE;
1377                         dl->nr= nr;
1378
1379                         /* half a circle */
1380                         fp= dl->verts;
1381                         dangle= (0.5*M_PI/(dnr-1));
1382                         angle= -(nr-1)*dangle;
1383
1384                         for(a=0; a<nr; a++) {
1385                                 fp[0]= 0.0;
1386                                 fp[1]= (float)(cosf(angle)*(cu->ext2));
1387                                 fp[2]= (float)(sinf(angle)*(cu->ext2)) - cu->ext1;
1388                                 angle+= dangle;
1389                                 fp+= 3;
1390                         }
1391                 }
1392
1393                 /* part 2, sidefaces */
1394                 if(cu->ext1!=0.0f) {
1395                         nr= 2;
1396
1397                         dl= MEM_callocN(sizeof(DispList), "makebevelcurve p2");
1398                         dl->verts= MEM_callocN(nr*3*sizeof(float), "makebevelcurve p2");
1399                         BLI_addtail(disp, dl);
1400                         dl->type= DL_SEGM;
1401                         dl->parts= 1;
1402                         dl->nr= nr;
1403
1404                         fp= dl->verts;
1405                         fp[1]= cu->ext2;
1406                         fp[2]= -cu->ext1;
1407                         fp[4]= cu->ext2;
1408                         fp[5]= cu->ext1;
1409
1410                         if( (cu->flag & (CU_FRONT|CU_BACK))==0) {
1411                                 dl= MEM_dupallocN(dl);
1412                                 dl->verts= MEM_dupallocN(dl->verts);
1413                                 BLI_addtail(disp, dl);
1414
1415                                 fp= dl->verts;
1416                                 fp[1]= -fp[1];
1417                                 fp[2]= -fp[2];
1418                                 fp[4]= -fp[4];
1419                                 fp[5]= -fp[5];
1420                         }
1421                 }
1422
1423                 /* part 3, front */
1424                 if((cu->flag & CU_FRONT) || !(cu->flag & CU_BACK)) {
1425                         dnr= nr= 2+ cu->bevresol;
1426                         if( (cu->flag & (CU_FRONT|CU_BACK))==0)
1427                                 nr= 3+ 2*cu->bevresol;
1428
1429                         dl= MEM_callocN(sizeof(DispList), "makebevelcurve p3");
1430                         dl->verts= MEM_mallocN(nr*3*sizeof(float), "makebevelcurve p3");
1431                         BLI_addtail(disp, dl);
1432                         dl->type= DL_SEGM;
1433                         dl->flag= DL_FRONT_CURVE;
1434                         dl->parts= 1;
1435                         dl->nr= nr;
1436
1437                         /* half a circle */
1438                         fp= dl->verts;
1439                         angle= 0.0;
1440                         dangle= (0.5*M_PI/(dnr-1));
1441
1442                         for(a=0; a<nr; a++) {
1443                                 fp[0]= 0.0;
1444                                 fp[1]= (float)(cosf(angle)*(cu->ext2));
1445                                 fp[2]= (float)(sinf(angle)*(cu->ext2)) + cu->ext1;
1446                                 angle+= dangle;
1447                                 fp+= 3;
1448                         }
1449                 }
1450         }
1451 }
1452
1453 static int cu_isectLL(float *v1, float *v2, float *v3, float *v4, short cox, short coy, float *labda, float *mu, float *vec)
1454 {
1455         /* return:
1456                 -1: colliniar
1457                  0: no intersection of segments
1458                  1: exact intersection of segments
1459                  2: cross-intersection of segments
1460         */
1461         float deler;
1462
1463         deler= (v1[cox]-v2[cox])*(v3[coy]-v4[coy])-(v3[cox]-v4[cox])*(v1[coy]-v2[coy]);
1464         if(deler==0.0f) return -1;
1465
1466         *labda= (v1[coy]-v3[coy])*(v3[cox]-v4[cox])-(v1[cox]-v3[cox])*(v3[coy]-v4[coy]);
1467         *labda= -(*labda/deler);
1468
1469         deler= v3[coy]-v4[coy];
1470         if(deler==0) {
1471                 deler=v3[cox]-v4[cox];
1472                 *mu= -(*labda*(v2[cox]-v1[cox])+v1[cox]-v3[cox])/deler;
1473         } else {
1474                 *mu= -(*labda*(v2[coy]-v1[coy])+v1[coy]-v3[coy])/deler;
1475         }
1476         vec[cox]= *labda*(v2[cox]-v1[cox])+v1[cox];
1477         vec[coy]= *labda*(v2[coy]-v1[coy])+v1[coy];
1478
1479         if(*labda>=0.0f && *labda<=1.0f && *mu>=0.0f && *mu<=1.0f) {
1480                 if(*labda==0.0f || *labda==1.0f || *mu==0.0f || *mu==1.0f) return 1;
1481                 return 2;
1482         }
1483         return 0;
1484 }
1485
1486
1487 static short bevelinside(BevList *bl1,BevList *bl2)
1488 {
1489         /* is bl2 INSIDE bl1 ? with left-right method and "labda's" */
1490         /* returns '1' if correct hole  */
1491         BevPoint *bevp, *prevbevp;
1492         float min,max,vec[3],hvec1[3],hvec2[3],lab,mu;
1493         int nr, links=0,rechts=0,mode;
1494
1495         /* take first vertex of possible hole */
1496
1497         bevp= (BevPoint *)(bl2+1);
1498         hvec1[0]= bevp->vec[0];
1499         hvec1[1]= bevp->vec[1];
1500         hvec1[2]= 0.0;
1501         VECCOPY(hvec2,hvec1);
1502         hvec2[0]+=1000;
1503
1504         /* test it with all edges of potential surounding poly */
1505         /* count number of transitions left-right  */
1506
1507         bevp= (BevPoint *)(bl1+1);
1508         nr= bl1->nr;
1509         prevbevp= bevp+(nr-1);
1510
1511         while(nr--) {
1512                 min= prevbevp->vec[1];
1513                 max= bevp->vec[1];
1514                 if(max<min) {
1515                         min= max;
1516                         max= prevbevp->vec[1];
1517                 }
1518                 if(min!=max) {
1519                         if(min<=hvec1[1] && max>=hvec1[1]) {
1520                                 /* there's a transition, calc intersection point */
1521                                 mode= cu_isectLL(prevbevp->vec, bevp->vec, hvec1, hvec2, 0, 1, &lab, &mu, vec);
1522                                 /* if lab==0.0 or lab==1.0 then the edge intersects exactly a transition
1523                                            only allow for one situation: we choose lab= 1.0
1524                                  */
1525                                 if(mode >= 0 && lab != 0.0f) {
1526                                         if(vec[0]<hvec1[0]) links++;
1527                                         else rechts++;
1528                                 }
1529                         }
1530                 }
1531                 prevbevp= bevp;
1532                 bevp++;
1533         }
1534
1535         if( (links & 1) && (rechts & 1) ) return 1;
1536         return 0;
1537 }
1538
1539
1540 struct bevelsort {
1541         float left;
1542         BevList *bl;
1543         int dir;
1544 };
1545
1546 static int vergxcobev(const void *a1, const void *a2)
1547 {
1548         const struct bevelsort *x1=a1,*x2=a2;
1549
1550         if( x1->left > x2->left ) return 1;
1551         else if( x1->left < x2->left) return -1;
1552         return 0;
1553 }
1554
1555 /* this function cannot be replaced with atan2, but why? */
1556
1557 static void calc_bevel_sin_cos(float x1, float y1, float x2, float y2, float *sina, float *cosa)
1558 {
1559         float t01, t02, x3, y3;
1560
1561         t01= (float)sqrt(x1*x1+y1*y1);
1562         t02= (float)sqrt(x2*x2+y2*y2);
1563         if(t01==0.0f) t01= 1.0f;
1564         if(t02==0.0f) t02= 1.0f;
1565
1566         x1/=t01;
1567         y1/=t01;
1568         x2/=t02;
1569         y2/=t02;
1570
1571         t02= x1*x2+y1*y2;
1572         if(fabs(t02)>=1.0) t02= .5*M_PI;
1573         else t02= (saacos(t02))/2.0f;
1574
1575         t02= (float)sin(t02);
1576         if(t02==0.0f) t02= 1.0f;
1577
1578         x3= x1-x2;
1579         y3= y1-y2;
1580         if(x3==0 && y3==0) {
1581                 x3= y1;
1582                 y3= -x1;
1583         } else {
1584                 t01= (float)sqrt(x3*x3+y3*y3);
1585                 x3/=t01;
1586                 y3/=t01;
1587         }
1588
1589         *sina= -y3/t02;
1590         *cosa= x3/t02;
1591
1592 }
1593
1594 static void alfa_bezpart(BezTriple *prevbezt, BezTriple *bezt, Nurb *nu, float *tilt_array, float *radius_array, float *weight_array, int resolu, int stride)
1595 {
1596         BezTriple *pprev, *next, *last;
1597         float fac, dfac, t[4];
1598         int a;
1599
1600         if(tilt_array==NULL && radius_array==NULL)
1601                 return;
1602
1603         last= nu->bezt+(nu->pntsu-1);
1604
1605         /* returns a point */
1606         if(prevbezt==nu->bezt) {
1607                 if(nu->flagu & CU_NURB_CYCLIC) pprev= last;
1608                 else pprev= prevbezt;
1609         }
1610         else pprev= prevbezt-1;
1611
1612         /* next point */
1613         if(bezt==last) {
1614                 if(nu->flagu & CU_NURB_CYCLIC) next= nu->bezt;
1615                 else next= bezt;
1616         }
1617         else next= bezt+1;
1618
1619         fac= 0.0;
1620         dfac= 1.0f/(float)resolu;
1621
1622         for(a=0; a<resolu; a++, fac+= dfac) {
1623                 if (tilt_array) {
1624                         if (nu->tilt_interp==KEY_CU_EASE) { /* May as well support for tilt also 2.47 ease interp */
1625                                 *tilt_array = prevbezt->alfa + (bezt->alfa - prevbezt->alfa)*(3.0f*fac*fac - 2.0f*fac*fac*fac);
1626                         } else {
1627                                 key_curve_position_weights(fac, t, nu->tilt_interp);
1628                                 *tilt_array= t[0]*pprev->alfa + t[1]*prevbezt->alfa + t[2]*bezt->alfa + t[3]*next->alfa;
1629                         }
1630
1631                         tilt_array = (float *)(((char *)tilt_array) + stride);
1632                 }
1633
1634                 if (radius_array) {
1635                         if (nu->radius_interp==KEY_CU_EASE) {
1636                                 /* Support 2.47 ease interp
1637                                  * Note! - this only takes the 2 points into account,
1638                                  * giving much more localized results to changes in radius, sometimes you want that */
1639                                 *radius_array = prevbezt->radius + (bezt->radius - prevbezt->radius)*(3.0f*fac*fac - 2.0f*fac*fac*fac);
1640                         } else {
1641
1642                                 /* reuse interpolation from tilt if we can */
1643                                 if (tilt_array==NULL || nu->tilt_interp != nu->radius_interp) {
1644                                         key_curve_position_weights(fac, t, nu->radius_interp);
1645                                 }
1646                                 *radius_array= t[0]*pprev->radius + t[1]*prevbezt->radius + t[2]*bezt->radius + t[3]*next->radius;
1647                         }
1648
1649                         radius_array = (float *)(((char *)radius_array) + stride);
1650                 }
1651
1652                 if(weight_array) {
1653                         /* basic interpolation for now, could copy tilt interp too  */
1654                         *weight_array = prevbezt->weight + (bezt->weight - prevbezt->weight)*(3.0f*fac*fac - 2.0f*fac*fac*fac);
1655
1656                         weight_array = (float *)(((char *)weight_array) + stride);
1657                 }
1658         }
1659 }
1660
1661 /* make_bevel_list_3D_* funcs, at a minimum these must
1662  * fill in the bezp->quat and bezp->dir values */
1663
1664 /* correct non-cyclic cases by copying direction and rotation
1665  * values onto the first & last end-points */
1666 static void bevel_list_cyclic_fix_3D(BevList *bl)
1667 {
1668         BevPoint *bevp, *bevp1;
1669
1670         bevp= (BevPoint *)(bl+1);
1671         bevp1= bevp+1;
1672         QUATCOPY(bevp->quat, bevp1->quat);
1673         VECCOPY(bevp->dir, bevp1->dir);
1674         VECCOPY(bevp->tan, bevp1->tan);
1675         bevp= (BevPoint *)(bl+1);
1676         bevp+= (bl->nr-1);
1677         bevp1= bevp-1;
1678         QUATCOPY(bevp->quat, bevp1->quat);
1679         VECCOPY(bevp->dir, bevp1->dir);
1680         VECCOPY(bevp->tan, bevp1->tan);
1681 }
1682 /* utility for make_bevel_list_3D_* funcs */
1683 static void bevel_list_calc_bisect(BevList *bl)
1684 {
1685         BevPoint *bevp2, *bevp1, *bevp0;
1686         int nr;
1687
1688         bevp2= (BevPoint *)(bl+1);
1689         bevp1= bevp2+(bl->nr-1);
1690         bevp0= bevp1-1;
1691
1692         nr= bl->nr;
1693         while(nr--) {
1694                 /* totally simple */
1695                 bisect_v3_v3v3v3(bevp1->dir, bevp0->vec, bevp1->vec, bevp2->vec);
1696
1697                 bevp0= bevp1;
1698                 bevp1= bevp2;
1699                 bevp2++;
1700         }
1701 }
1702 static void bevel_list_flip_tangents(BevList *bl)
1703 {
1704         BevPoint *bevp2, *bevp1, *bevp0;
1705         int nr;
1706
1707         bevp2= (BevPoint *)(bl+1);
1708         bevp1= bevp2+(bl->nr-1);
1709         bevp0= bevp1-1;
1710
1711         nr= bl->nr;
1712         while(nr--) {
1713                 if(RAD2DEGF(angle_v2v2(bevp0->tan, bevp1->tan)) > 90.0f)
1714                         negate_v3(bevp1->tan);
1715
1716                 bevp0= bevp1;
1717                 bevp1= bevp2;
1718                 bevp2++;
1719         }
1720 }
1721 /* apply user tilt */
1722 static void bevel_list_apply_tilt(BevList *bl)
1723 {
1724         BevPoint *bevp2, *bevp1;
1725         int nr;
1726         float q[4];
1727
1728         bevp2= (BevPoint *)(bl+1);
1729         bevp1= bevp2+(bl->nr-1);
1730
1731         nr= bl->nr;
1732         while(nr--) {
1733                 axis_angle_to_quat(q, bevp1->dir, bevp1->alfa);
1734                 mul_qt_qtqt(bevp1->quat, q, bevp1->quat);
1735                 normalize_qt(bevp1->quat);
1736
1737                 bevp1= bevp2;
1738                 bevp2++;
1739         }
1740 }
1741 /* smooth quats, this function should be optimized, it can get slow with many iterations. */
1742 static void bevel_list_smooth(BevList *bl, int smooth_iter)
1743 {
1744         BevPoint *bevp2, *bevp1, *bevp0;
1745         int nr;
1746
1747         float q[4];
1748         float bevp0_quat[4];
1749         int a;
1750
1751         for(a=0; a < smooth_iter; a++) {
1752
1753                 bevp2= (BevPoint *)(bl+1);
1754                 bevp1= bevp2+(bl->nr-1);
1755                 bevp0= bevp1-1;
1756
1757                 nr= bl->nr;
1758
1759                 if(bl->poly== -1) { /* check its not cyclic */
1760                         /* skip the first point */
1761                         /* bevp0= bevp1; */
1762                         bevp1= bevp2;
1763                         bevp2++;
1764                         nr--;
1765
1766                         bevp0= bevp1;
1767                         bevp1= bevp2;
1768                         bevp2++;
1769                         nr--;
1770
1771                 }
1772
1773                 QUATCOPY(bevp0_quat, bevp0->quat);
1774
1775                 while(nr--) {
1776                         /* interpolate quats */
1777                         float zaxis[3] = {0,0,1}, cross[3], q2[4];
1778                         interp_qt_qtqt(q, bevp0_quat, bevp2->quat, 0.5);
1779                         normalize_qt(q);
1780
1781                         mul_qt_v3(q, zaxis);
1782                         cross_v3_v3v3(cross, zaxis, bevp1->dir);
1783                         axis_angle_to_quat(q2, cross, angle_normalized_v3v3(zaxis, bevp1->dir));
1784                         normalize_qt(q2);
1785
1786                         QUATCOPY(bevp0_quat, bevp1->quat);
1787                         mul_qt_qtqt(q, q2, q);
1788                         interp_qt_qtqt(bevp1->quat, bevp1->quat, q, 0.5);
1789                         normalize_qt(bevp1->quat);
1790
1791
1792                         /* bevp0= bevp1; */ /* UNUSED */
1793                         bevp1= bevp2;
1794                         bevp2++;
1795                 }
1796         }
1797 }
1798
1799 static void make_bevel_list_3D_zup(BevList *bl)
1800 {
1801         BevPoint *bevp2, *bevp1, *bevp0; /* standard for all make_bevel_list_3D_* funcs */
1802         int nr;
1803
1804         bevp2= (BevPoint *)(bl+1);
1805         bevp1= bevp2+(bl->nr-1);
1806         bevp0= bevp1-1;
1807
1808         nr= bl->nr;
1809         while(nr--) {
1810                 /* totally simple */
1811                 bisect_v3_v3v3v3(bevp1->dir, bevp0->vec, bevp1->vec, bevp2->vec);
1812                 vec_to_quat( bevp1->quat,bevp1->dir, 5, 1);
1813
1814                 bevp0= bevp1;
1815                 bevp1= bevp2;
1816                 bevp2++;
1817         }
1818 }
1819
1820 static void make_bevel_list_3D_minimum_twist(BevList *bl)
1821 {
1822         BevPoint *bevp2, *bevp1, *bevp0; /* standard for all make_bevel_list_3D_* funcs */
1823         int nr;
1824         float q[4];
1825
1826         bevel_list_calc_bisect(bl);
1827
1828         bevp2= (BevPoint *)(bl+1);
1829         bevp1= bevp2+(bl->nr-1);
1830         bevp0= bevp1-1;
1831
1832         nr= bl->nr;
1833         while(nr--) {
1834
1835                 if(nr+4 > bl->nr) { /* first time and second time, otherwise first point adjusts last */
1836                         vec_to_quat( bevp1->quat,bevp1->dir, 5, 1);
1837                 }
1838                 else {
1839                         float angle= angle_normalized_v3v3(bevp0->dir, bevp1->dir);
1840
1841                         if(angle > 0.0f) { /* otherwise we can keep as is */
1842                                 float cross_tmp[3];
1843                                 cross_v3_v3v3(cross_tmp, bevp0->dir, bevp1->dir);
1844                                 axis_angle_to_quat(q, cross_tmp, angle);
1845                                 mul_qt_qtqt(bevp1->quat, q, bevp0->quat);
1846                         }
1847                         else {
1848                                 QUATCOPY(bevp1->quat, bevp0->quat);
1849                         }
1850                 }
1851
1852                 bevp0= bevp1;
1853                 bevp1= bevp2;
1854                 bevp2++;
1855         }
1856
1857         if(bl->poly != -1) { /* check for cyclic */
1858
1859                 /* Need to correct for the start/end points not matching
1860                  * do this by calculating the tilt angle difference, then apply
1861                  * the rotation gradually over the entire curve
1862                  *
1863                  * note that the split is between last and second last, rather than first/last as youd expect.
1864                  *
1865                  * real order is like this
1866                  * 0,1,2,3,4 --> 1,2,3,4,0
1867                  *
1868                  * this is why we compare last with second last
1869                  * */
1870                 float vec_1[3]= {0,1,0}, vec_2[3]= {0,1,0}, angle, ang_fac, cross_tmp[3];
1871
1872                 BevPoint *bevp_first;
1873                 BevPoint *bevp_last;
1874
1875
1876                 bevp_first= (BevPoint *)(bl+1);
1877                 bevp_first+= bl->nr-1;
1878                 bevp_last = bevp_first;
1879                 bevp_last--;
1880
1881                 /* quats and vec's are normalized, should not need to re-normalize */
1882                 mul_qt_v3(bevp_first->quat, vec_1);
1883                 mul_qt_v3(bevp_last->quat, vec_2);
1884                 normalize_v3(vec_1);
1885                 normalize_v3(vec_2);
1886
1887                 /* align the vector, can avoid this and it looks 98% OK but
1888                  * better to align the angle quat roll's before comparing */
1889                 {
1890                         cross_v3_v3v3(cross_tmp, bevp_last->dir, bevp_first->dir);
1891                         angle = angle_normalized_v3v3(bevp_first->dir, bevp_last->dir);
1892                         axis_angle_to_quat(q, cross_tmp, angle);
1893                         mul_qt_v3(q, vec_2);
1894                 }
1895
1896                 angle= angle_normalized_v3v3(vec_1, vec_2);
1897
1898                 /* flip rotation if needs be */
1899                 cross_v3_v3v3(cross_tmp, vec_1, vec_2);
1900                 normalize_v3(cross_tmp);
1901                 if(angle_normalized_v3v3(bevp_first->dir, cross_tmp) < 90.0f/(float)(180.0/M_PI))
1902                         angle = -angle;
1903
1904                 bevp2= (BevPoint *)(bl+1);
1905                 bevp1= bevp2+(bl->nr-1);
1906                 bevp0= bevp1-1;
1907
1908                 nr= bl->nr;
1909                 while(nr--) {
1910                         ang_fac= angle * (1.0f-((float)nr/bl->nr)); /* also works */
1911
1912                         axis_angle_to_quat(q, bevp1->dir, ang_fac);
1913                         mul_qt_qtqt(bevp1->quat, q, bevp1->quat);
1914
1915                         bevp0= bevp1;
1916                         bevp1= bevp2;
1917                         bevp2++;
1918                 }
1919         }
1920 }
1921
1922 static void make_bevel_list_3D_tangent(BevList *bl)
1923 {
1924         BevPoint *bevp2, *bevp1, *bevp0; /* standard for all make_bevel_list_3D_* funcs */
1925         int nr;
1926
1927         float bevp0_tan[3], cross_tmp[3];
1928
1929         bevel_list_calc_bisect(bl);
1930         if(bl->poly== -1) /* check its not cyclic */
1931                 bevel_list_cyclic_fix_3D(bl); // XXX - run this now so tangents will be right before doing the flipping
1932         bevel_list_flip_tangents(bl);
1933
1934         /* correct the tangents */
1935         bevp2= (BevPoint *)(bl+1);
1936         bevp1= bevp2+(bl->nr-1);
1937         bevp0= bevp1-1;
1938
1939         nr= bl->nr;
1940         while(nr--) {
1941
1942                 cross_v3_v3v3(cross_tmp, bevp1->tan, bevp1->dir);
1943                 cross_v3_v3v3(bevp1->tan, cross_tmp, bevp1->dir);
1944                 normalize_v3(bevp1->tan);
1945
1946                 bevp0= bevp1;
1947                 bevp1= bevp2;
1948                 bevp2++;
1949         }
1950
1951
1952         /* now for the real twist calc */
1953         bevp2= (BevPoint *)(bl+1);
1954         bevp1= bevp2+(bl->nr-1);
1955         bevp0= bevp1-1;
1956
1957         VECCOPY(bevp0_tan, bevp0->tan);
1958
1959         nr= bl->nr;
1960         while(nr--) {
1961
1962                 /* make perpendicular, modify tan in place, is ok */
1963                 float cross_tmp[3];
1964                 float zero[3] = {0,0,0};
1965
1966                 cross_v3_v3v3(cross_tmp, bevp1->tan, bevp1->dir);
1967                 normalize_v3(cross_tmp);
1968                 tri_to_quat( bevp1->quat,zero, cross_tmp, bevp1->tan); /* XXX - could be faster */
1969
1970                 /* bevp0= bevp1; */ /* UNUSED */
1971                 bevp1= bevp2;
1972                 bevp2++;
1973         }
1974 }
1975
1976 static void make_bevel_list_3D(BevList *bl, int smooth_iter, int twist_mode)
1977 {
1978         switch(twist_mode) {
1979         case CU_TWIST_TANGENT:
1980                 make_bevel_list_3D_tangent(bl);
1981                 break;
1982         case CU_TWIST_MINIMUM:
1983                 make_bevel_list_3D_minimum_twist(bl);
1984                 break;
1985         default: /* CU_TWIST_Z_UP default, pre 2.49c */
1986                 make_bevel_list_3D_zup(bl);
1987         }
1988
1989         if(bl->poly== -1) /* check its not cyclic */
1990                 bevel_list_cyclic_fix_3D(bl);
1991
1992         if(smooth_iter)
1993                 bevel_list_smooth(bl, smooth_iter);
1994
1995         bevel_list_apply_tilt(bl);
1996 }
1997
1998
1999
2000 /* only for 2 points */
2001 static void make_bevel_list_segment_3D(BevList *bl)
2002 {
2003         float q[4];
2004
2005         BevPoint *bevp2= (BevPoint *)(bl+1);
2006         BevPoint *bevp1= bevp2+1;
2007
2008         /* simple quat/dir */
2009         sub_v3_v3v3(bevp1->dir, bevp1->vec, bevp2->vec);
2010         normalize_v3(bevp1->dir);
2011
2012         vec_to_quat( bevp1->quat,bevp1->dir, 5, 1);
2013
2014         axis_angle_to_quat(q, bevp1->dir, bevp1->alfa);
2015         mul_qt_qtqt(bevp1->quat, q, bevp1->quat);
2016         normalize_qt(bevp1->quat);
2017         VECCOPY(bevp2->dir, bevp1->dir);
2018         QUATCOPY(bevp2->quat, bevp1->quat);
2019 }
2020
2021
2022
2023 void makeBevelList(Object *ob)
2024 {
2025         /*
2026          - convert all curves to polys, with indication of resol and flags for double-vertices
2027          - possibly; do a smart vertice removal (in case Nurb)
2028          - separate in individual blicks with BoundBox
2029          - AutoHole detection
2030         */
2031         Curve *cu;
2032         Nurb *nu;
2033         BezTriple *bezt, *prevbezt;
2034         BPoint *bp;
2035         BevList *bl, *blnew, *blnext;
2036         BevPoint *bevp, *bevp2, *bevp1 = NULL, *bevp0;
2037         float min, inp, x1, x2, y1, y2;
2038         struct bevelsort *sortdata, *sd, *sd1;
2039         int a, b, nr, poly, resolu = 0, len = 0;
2040         int do_tilt, do_radius, do_weight;
2041
2042         /* this function needs an object, because of tflag and upflag */
2043         cu= ob->data;
2044
2045         /* do we need to calculate the radius for each point? */
2046         /* do_radius = (cu->bevobj || cu->taperobj || (cu->flag & CU_FRONT) || (cu->flag & CU_BACK)) ? 0 : 1; */
2047
2048         /* STEP 1: MAKE POLYS  */
2049
2050         BLI_freelistN(&(cu->bev));
2051         if(cu->editnurb && ob->type!=OB_FONT) {
2052                 ListBase *nurbs= ED_curve_editnurbs(cu);
2053                 nu= nurbs->first;
2054         } else nu= cu->nurb.first;
2055
2056         while(nu) {
2057
2058                 /* check if we will calculate tilt data */
2059                 do_tilt = CU_DO_TILT(cu, nu);
2060                 do_radius = CU_DO_RADIUS(cu, nu); /* normal display uses the radius, better just to calculate them */
2061                 do_weight = 1;
2062
2063                 /* check we are a single point? also check we are not a surface and that the orderu is sane,
2064                  * enforced in the UI but can go wrong possibly */
2065                 if(!check_valid_nurb_u(nu)) {
2066                         bl= MEM_callocN(sizeof(BevList)+1*sizeof(BevPoint), "makeBevelList1");
2067                         BLI_addtail(&(cu->bev), bl);
2068                         bl->nr= 0;
2069                 } else {
2070                         if(G.rendering && cu->resolu_ren!=0)
2071                                 resolu= cu->resolu_ren;
2072                         else
2073                                 resolu= nu->resolu;
2074
2075                         if(nu->type == CU_POLY) {
2076                                 len= nu->pntsu;
2077                                 bl= MEM_callocN(sizeof(BevList)+len*sizeof(BevPoint), "makeBevelList2");
2078                                 BLI_addtail(&(cu->bev), bl);
2079
2080                                 if(nu->flagu & CU_NURB_CYCLIC) bl->poly= 0;
2081                                 else bl->poly= -1;
2082                                 bl->nr= len;
2083                                 bl->dupe_nr= 0;
2084                                 bevp= (BevPoint *)(bl+1);
2085                                 bp= nu->bp;
2086
2087                                 while(len--) {
2088                                         VECCOPY(bevp->vec, bp->vec);
2089                                         bevp->alfa= bp->alfa;
2090                                         bevp->radius= bp->radius;
2091                                         bevp->weight= bp->weight;
2092                                         bevp->split_tag= TRUE;
2093                                         bevp++;
2094                                         bp++;
2095                                 }
2096                         }
2097                         else if(nu->type == CU_BEZIER) {
2098
2099                                 len= resolu*(nu->pntsu+ (nu->flagu & CU_NURB_CYCLIC) -1)+1;     /* in case last point is not cyclic */
2100                                 bl= MEM_callocN(sizeof(BevList)+len*sizeof(BevPoint), "makeBevelBPoints");
2101                                 BLI_addtail(&(cu->bev), bl);
2102
2103                                 if(nu->flagu & CU_NURB_CYCLIC) bl->poly= 0;
2104                                 else bl->poly= -1;
2105                                 bevp= (BevPoint *)(bl+1);
2106
2107                                 a= nu->pntsu-1;
2108                                 bezt= nu->bezt;
2109                                 if(nu->flagu & CU_NURB_CYCLIC) {
2110                                         a++;
2111                                         prevbezt= nu->bezt+(nu->pntsu-1);
2112                                 }
2113                                 else {
2114                                         prevbezt= bezt;
2115                                         bezt++;
2116                                 }
2117
2118                                 while(a--) {
2119                                         if(prevbezt->h2==HD_VECT && bezt->h1==HD_VECT) {
2120
2121                                                 VECCOPY(bevp->vec, prevbezt->vec[1]);
2122                                                 bevp->alfa= prevbezt->alfa;
2123                                                 bevp->radius= prevbezt->radius;
2124                                                 bevp->weight= prevbezt->weight;
2125                                                 bevp->split_tag= TRUE;
2126                                                 bevp->dupe_tag= FALSE;
2127                                                 bevp++;
2128                                                 bl->nr++;
2129                                                 bl->dupe_nr= 1;
2130                                         }
2131                                         else {
2132                                                 /* always do all three, to prevent data hanging around */
2133                                                 int j;
2134
2135                                                 /* BevPoint must stay aligned to 4 so sizeof(BevPoint)/sizeof(float) works */
2136                                                 for(j=0; j<3; j++) {
2137                                                         forward_diff_bezier(    prevbezt->vec[1][j],    prevbezt->vec[2][j],
2138                                                                                                         bezt->vec[0][j],                bezt->vec[1][j],
2139                                                                                                         &(bevp->vec[j]), resolu, sizeof(BevPoint));
2140                                                 }
2141
2142                                                 /* if both arrays are NULL do nothiong */
2143                                                 alfa_bezpart(   prevbezt, bezt, nu,
2144                                                                                  do_tilt        ? &bevp->alfa : NULL,
2145                                                                                  do_radius      ? &bevp->radius : NULL,
2146                                                                                  do_weight      ? &bevp->weight : NULL,
2147                                                                                  resolu, sizeof(BevPoint));
2148
2149
2150                                                 if(cu->twist_mode==CU_TWIST_TANGENT) {
2151                                                         forward_diff_bezier_cotangent(
2152                                                                                                         prevbezt->vec[1],       prevbezt->vec[2],
2153                                                                                                         bezt->vec[0],           bezt->vec[1],
2154                                                                                                         bevp->tan, resolu, sizeof(BevPoint));
2155                                                 }
2156
2157                                                 /* indicate with handlecodes double points */
2158                                                 if(prevbezt->h1==prevbezt->h2) {
2159                                                         if(prevbezt->h1==0 || prevbezt->h1==HD_VECT) bevp->split_tag= TRUE;
2160                                                 }
2161                                                 else {
2162                                                         if(prevbezt->h1==0 || prevbezt->h1==HD_VECT) bevp->split_tag= TRUE;
2163                                                         else if(prevbezt->h2==0 || prevbezt->h2==HD_VECT) bevp->split_tag= TRUE;
2164                                                 }
2165                                                 bl->nr+= resolu;
2166                                                 bevp+= resolu;
2167                                         }
2168                                         prevbezt= bezt;
2169                                         bezt++;
2170                                 }
2171
2172                                 if((nu->flagu & CU_NURB_CYCLIC)==0) {       /* not cyclic: endpoint */
2173                                         VECCOPY(bevp->vec, prevbezt->vec[1]);
2174                                         bevp->alfa= prevbezt->alfa;
2175                                         bevp->radius= prevbezt->radius;
2176                                         bevp->weight= prevbezt->weight;
2177                                         bl->nr++;
2178                                 }
2179                         }
2180                         else if(nu->type == CU_NURBS) {
2181                                 if(nu->pntsv==1) {
2182                                         len= (resolu*SEGMENTSU(nu));
2183
2184                                         bl= MEM_callocN(sizeof(BevList)+len*sizeof(BevPoint), "makeBevelList3");
2185                                         BLI_addtail(&(cu->bev), bl);
2186                                         bl->nr= len;
2187                                         bl->dupe_nr= 0;
2188                                         if(nu->flagu & CU_NURB_CYCLIC) bl->poly= 0;
2189                                         else bl->poly= -1;
2190                                         bevp= (BevPoint *)(bl+1);
2191
2192                                         makeNurbcurve(  nu, &bevp->vec[0],
2193                                                                         do_tilt         ? &bevp->alfa : NULL,
2194                                                                         do_radius       ? &bevp->radius : NULL,
2195                                                                         do_weight       ? &bevp->weight : NULL,
2196                                                                         resolu, sizeof(BevPoint));
2197                                 }
2198                         }
2199                 }
2200                 nu= nu->next;
2201         }
2202
2203         /* STEP 2: DOUBLE POINTS AND AUTOMATIC RESOLUTION, REDUCE DATABLOCKS */
2204         bl= cu->bev.first;
2205         while(bl) {
2206                 if (bl->nr) { /* null bevel items come from single points */
2207                         nr= bl->nr;
2208                         bevp1= (BevPoint *)(bl+1);
2209                         bevp0= bevp1+(nr-1);
2210                         nr--;
2211                         while(nr--) {
2212                                 if( fabs(bevp0->vec[0]-bevp1->vec[0])<0.00001 ) {
2213                                         if( fabs(bevp0->vec[1]-bevp1->vec[1])<0.00001 ) {
2214                                                 if( fabs(bevp0->vec[2]-bevp1->vec[2])<0.00001 ) {
2215                                                         bevp0->dupe_tag= TRUE;
2216                                                         bl->dupe_nr++;
2217                                                 }
2218                                         }
2219                                 }
2220                                 bevp0= bevp1;
2221                                 bevp1++;
2222                         }
2223                 }
2224                 bl= bl->next;
2225         }
2226         bl= cu->bev.first;
2227         while(bl) {
2228                 blnext= bl->next;
2229                 if(bl->nr && bl->dupe_nr) {
2230                         nr= bl->nr- bl->dupe_nr+1;      /* +1 because vectorbezier sets flag too */
2231                         blnew= MEM_mallocN(sizeof(BevList)+nr*sizeof(BevPoint), "makeBevelList4");
2232                         memcpy(blnew, bl, sizeof(BevList));
2233                         blnew->nr= 0;
2234                         BLI_remlink(&(cu->bev), bl);
2235                         BLI_insertlinkbefore(&(cu->bev),blnext,blnew);  /* to make sure bevlijst is tuned with nurblist */
2236                         bevp0= (BevPoint *)(bl+1);
2237                         bevp1= (BevPoint *)(blnew+1);
2238                         nr= bl->nr;
2239                         while(nr--) {
2240                                 if(bevp0->dupe_tag==0) {
2241                                         memcpy(bevp1, bevp0, sizeof(BevPoint));
2242                                         bevp1++;
2243                                         blnew->nr++;
2244                                 }
2245                                 bevp0++;
2246                         }
2247                         MEM_freeN(bl);
2248                         blnew->dupe_nr= 0;
2249                 }
2250                 bl= blnext;
2251         }
2252
2253         /* STEP 3: POLYS COUNT AND AUTOHOLE */
2254         bl= cu->bev.first;
2255         poly= 0;
2256         while(bl) {
2257                 if(bl->nr && bl->poly>=0) {
2258                         poly++;
2259                         bl->poly= poly;
2260                         bl->hole= 0;
2261                 }
2262                 bl= bl->next;
2263         }
2264
2265
2266         /* find extreme left points, also test (turning) direction */
2267         if(poly>0) {
2268                 sd= sortdata= MEM_mallocN(sizeof(struct bevelsort)*poly, "makeBevelList5");
2269                 bl= cu->bev.first;
2270                 while(bl) {
2271                         if(bl->poly>0) {
2272
2273                                 min= 300000.0;
2274                                 bevp= (BevPoint *)(bl+1);
2275                                 nr= bl->nr;
2276                                 while(nr--) {
2277                                         if(min>bevp->vec[0]) {
2278                                                 min= bevp->vec[0];
2279                                                 bevp1= bevp;
2280                                         }
2281                                         bevp++;
2282                                 }
2283                                 sd->bl= bl;
2284                                 sd->left= min;
2285
2286                                 bevp= (BevPoint *)(bl+1);
2287                                 if(bevp1== bevp) bevp0= bevp+ (bl->nr-1);
2288                                 else bevp0= bevp1-1;
2289                                 bevp= bevp+ (bl->nr-1);
2290                                 if(bevp1== bevp) bevp2= (BevPoint *)(bl+1);
2291                                 else bevp2= bevp1+1;
2292
2293                                 inp= (bevp1->vec[0]- bevp0->vec[0]) * (bevp0->vec[1]- bevp2->vec[1]) + (bevp0->vec[1]- bevp1->vec[1]) * (bevp0->vec[0]- bevp2->vec[0]);
2294
2295                                 if(inp > 0.0f) sd->dir= 1;
2296                                 else sd->dir= 0;
2297
2298                                 sd++;
2299                         }
2300
2301                         bl= bl->next;
2302                 }
2303                 qsort(sortdata,poly,sizeof(struct bevelsort), vergxcobev);
2304
2305                 sd= sortdata+1;
2306                 for(a=1; a<poly; a++, sd++) {
2307                         bl= sd->bl;         /* is bl a hole? */
2308                         sd1= sortdata+ (a-1);
2309                         for(b=a-1; b>=0; b--, sd1--) {  /* all polys to the left */
2310                                 if(bevelinside(sd1->bl, bl)) {
2311                                         bl->hole= 1- sd1->bl->hole;
2312                                         break;
2313                                 }
2314                         }
2315                 }
2316
2317                 /* turning direction */
2318                 if((cu->flag & CU_3D)==0) {
2319                         sd= sortdata;
2320                         for(a=0; a<poly; a++, sd++) {
2321                                 if(sd->bl->hole==sd->dir) {
2322                                         bl= sd->bl;
2323                                         bevp1= (BevPoint *)(bl+1);
2324                                         bevp2= bevp1+ (bl->nr-1);
2325                                         nr= bl->nr/2;
2326                                         while(nr--) {
2327                                                 SWAP(BevPoint, *bevp1, *bevp2);
2328                                                 bevp1++;
2329                                                 bevp2--;
2330                                         }
2331                                 }
2332                         }
2333                 }
2334                 MEM_freeN(sortdata);
2335         }
2336
2337         /* STEP 4: 2D-COSINES or 3D ORIENTATION */
2338         if((cu->flag & CU_3D)==0) {
2339                 /* note: bevp->dir and bevp->quat are not needed for beveling but are
2340                  * used when making a path from a 2D curve, therefor they need to be set - Campbell */
2341                 bl= cu->bev.first;
2342                 while(bl) {
2343
2344                         if(bl->nr < 2) {
2345                                 /* do nothing */
2346                         }
2347                         else if(bl->nr==2) {    /* 2 pnt, treat separate */
2348                                 bevp2= (BevPoint *)(bl+1);
2349                                 bevp1= bevp2+1;
2350
2351                                 x1= bevp1->vec[0]- bevp2->vec[0];
2352                                 y1= bevp1->vec[1]- bevp2->vec[1];
2353
2354                                 calc_bevel_sin_cos(x1, y1, -x1, -y1, &(bevp1->sina), &(bevp1->cosa));
2355                                 bevp2->sina= bevp1->sina;
2356                                 bevp2->cosa= bevp1->cosa;
2357
2358                                 /* fill in dir & quat */
2359                                 make_bevel_list_segment_3D(bl);
2360                         }
2361                         else {
2362                                 bevp2= (BevPoint *)(bl+1);
2363                                 bevp1= bevp2+(bl->nr-1);
2364                                 bevp0= bevp1-1;
2365
2366                                 nr= bl->nr;
2367                                 while(nr--) {
2368                                         x1= bevp1->vec[0]- bevp0->vec[0];
2369                                         x2= bevp1->vec[0]- bevp2->vec[0];
2370                                         y1= bevp1->vec[1]- bevp0->vec[1];
2371                                         y2= bevp1->vec[1]- bevp2->vec[1];
2372
2373                                         calc_bevel_sin_cos(x1, y1, x2, y2, &(bevp1->sina), &(bevp1->cosa));
2374
2375                                         /* from: make_bevel_list_3D_zup, could call but avoid a second loop.
2376                                          * no need for tricky tilt calculation as with 3D curves */
2377                                         bisect_v3_v3v3v3(bevp1->dir, bevp0->vec, bevp1->vec, bevp2->vec);
2378                                         vec_to_quat( bevp1->quat,bevp1->dir, 5, 1);
2379                                         /* done with inline make_bevel_list_3D_zup */
2380
2381                                         bevp0= bevp1;
2382                                         bevp1= bevp2;
2383                                         bevp2++;
2384                                 }
2385
2386                                 /* correct non-cyclic cases */
2387                                 if(bl->poly== -1) {
2388                                         bevp= (BevPoint *)(bl+1);
2389                                         bevp1= bevp+1;
2390                                         bevp->sina= bevp1->sina;
2391                                         bevp->cosa= bevp1->cosa;
2392                                         bevp= (BevPoint *)(bl+1);
2393                                         bevp+= (bl->nr-1);
2394                                         bevp1= bevp-1;
2395                                         bevp->sina= bevp1->sina;
2396                                         bevp->cosa= bevp1->cosa;
2397
2398                                         /* correct for the dir/quat, see above why its needed */
2399                                         bevel_list_cyclic_fix_3D(bl);
2400                                 }
2401                         }
2402                         bl= bl->next;
2403                 }
2404         }
2405         else { /* 3D Curves */
2406                 bl= cu->bev.first;
2407                 while(bl) {
2408
2409                         if(bl->nr < 2) {
2410                                 /* do nothing */
2411                         }
2412                         else if(bl->nr==2) {    /* 2 pnt, treat separate */
2413                                 make_bevel_list_segment_3D(bl);
2414                         }
2415                         else {
2416                                 make_bevel_list_3D(bl, (int)(resolu*cu->twist_smooth), cu->twist_mode);
2417                         }
2418                         bl= bl->next;
2419                 }
2420         }
2421 }
2422
2423 /* ****************** HANDLES ************** */
2424
2425 /*
2426  *   handlecodes:
2427  *              0: nothing,  1:auto,  2:vector,  3:aligned
2428  */
2429
2430 /* mode: is not zero when FCurve, is 2 when forced horizontal for autohandles */
2431 void calchandleNurb(BezTriple *bezt, BezTriple *prev, BezTriple *next, int mode)
2432 {
2433         float *p1,*p2,*p3, pt[3];
2434         float dx1,dy1,dz1,dx,dy,dz,vx,vy,vz,len,len1,len2;
2435         const float eps= 1e-5;
2436
2437         if(bezt->h1==0 && bezt->h2==0) return;
2438
2439         p2= bezt->vec[1];
2440
2441         if(prev==NULL) {
2442                 p3= next->vec[1];
2443                 pt[0]= 2*p2[0]- p3[0];
2444                 pt[1]= 2*p2[1]- p3[1];
2445                 pt[2]= 2*p2[2]- p3[2];
2446                 p1= pt;
2447         }
2448         else p1= prev->vec[1];
2449
2450         if(next==NULL) {
2451                 pt[0]= 2*p2[0]- p1[0];
2452                 pt[1]= 2*p2[1]- p1[1];
2453                 pt[2]= 2*p2[2]- p1[2];
2454                 p3= pt;
2455         }
2456         else p3= next->vec[1];
2457
2458         dx= p2[0]- p1[0];
2459         dy= p2[1]- p1[1];
2460         dz= p2[2]- p1[2];
2461
2462         if(mode) len1= dx;
2463         else len1= (float)sqrt(dx*dx+dy*dy+dz*dz);
2464
2465         dx1= p3[0]- p2[0];
2466         dy1= p3[1]- p2[1];
2467         dz1= p3[2]- p2[2];
2468
2469         if(mode) len2= dx1;
2470         else len2= (float)sqrt(dx1*dx1+dy1*dy1+dz1*dz1);
2471
2472         if(len1==0.0f) len1=1.0f;
2473         if(len2==0.0f) len2=1.0f;
2474
2475
2476         if(bezt->h1==HD_AUTO || bezt->h2==HD_AUTO) {    /* auto */
2477                 vx= dx1/len2 + dx/len1;
2478                 vy= dy1/len2 + dy/len1;
2479                 vz= dz1/len2 + dz/len1;
2480                 len= 2.5614f*(float)sqrt(vx*vx + vy*vy + vz*vz);
2481                 if(len!=0.0f) {
2482                         int leftviolate=0, rightviolate=0;      /* for mode==2 */
2483
2484                         if(len1>5.0f*len2) len1= 5.0f*len2;
2485                         if(len2>5.0f*len1) len2= 5.0f*len1;
2486
2487                         if(bezt->h1==HD_AUTO) {
2488                                 len1/=len;
2489                                 *(p2-3)= *p2-vx*len1;
2490                                 *(p2-2)= *(p2+1)-vy*len1;
2491                                 *(p2-1)= *(p2+2)-vz*len1;
2492
2493                                 if(mode==2 && next && prev) {   // keep horizontal if extrema
2494                                         float ydiff1= prev->vec[1][1] - bezt->vec[1][1];
2495                                         float ydiff2= next->vec[1][1] - bezt->vec[1][1];
2496                                         if( (ydiff1 <= 0.0f && ydiff2 <= 0.0f) || (ydiff1 >= 0.0f && ydiff2 >= 0.0f) ) {
2497                                                 bezt->vec[0][1]= bezt->vec[1][1];
2498                                         }
2499                                         else {                                          // handles should not be beyond y coord of two others
2500                                                 if(ydiff1 <= 0.0f) {
2501                                                         if(prev->vec[1][1] > bezt->vec[0][1]) {
2502                                                                 bezt->vec[0][1]= prev->vec[1][1];
2503                                                                 leftviolate= 1;
2504                                                         }
2505                                                 }
2506                                                 else {
2507                                                         if(prev->vec[1][1] < bezt->vec[0][1]) {
2508                                                                 bezt->vec[0][1]= prev->vec[1][1];
2509                                                                 leftviolate= 1;
2510                                                         }
2511                                                 }
2512                                         }
2513                                 }
2514                         }
2515                         if(bezt->h2==HD_AUTO) {
2516                                 len2/=len;
2517                                 *(p2+3)= *p2+vx*len2;
2518                                 *(p2+4)= *(p2+1)+vy*len2;
2519                                 *(p2+5)= *(p2+2)+vz*len2;
2520
2521                                 if(mode==2 && next && prev) {   // keep horizontal if extrema
2522                                         float ydiff1= prev->vec[1][1] - bezt->vec[1][1];
2523                                         float ydiff2= next->vec[1][1] - bezt->vec[1][1];
2524                                         if( (ydiff1 <= 0.0f && ydiff2 <= 0.0f) || (ydiff1 >= 0.0f && ydiff2 >= 0.0f) ) {
2525                                                 bezt->vec[2][1]= bezt->vec[1][1];
2526                                         }
2527                                         else {                                          // handles should not be beyond y coord of two others
2528                                                 if(ydiff1 <= 0.0f) {
2529                                                         if(next->vec[1][1] < bezt->vec[2][1]) {
2530                                                                 bezt->vec[2][1]= next->vec[1][1];
2531                                                                 rightviolate= 1;
2532                                                         }
2533                                                 }
2534                                                 else {
2535                                                         if(next->vec[1][1] > bezt->vec[2][1]) {
2536                                                                 bezt->vec[2][1]= next->vec[1][1];
2537                                                                 rightviolate= 1;
2538                                                         }
2539                                                 }
2540                                         }
2541                                 }
2542                         }
2543                         if(leftviolate || rightviolate) {       /* align left handle */
2544                                 float h1[3], h2[3];
2545
2546                                 sub_v3_v3v3(h1, p2-3, p2);
2547                                 sub_v3_v3v3(h2, p2, p2+3);
2548                                 len1= normalize_v3(h1);
2549                                 len2= normalize_v3(h2);
2550
2551                                 vz= INPR(h1, h2);
2552
2553                                 if(leftviolate) {
2554                                         *(p2+3)= *(p2)   - vz*len2*h1[0];
2555                                         *(p2+4)= *(p2+1) - vz*len2*h1[1];
2556                                         *(p2+5)= *(p2+2) - vz*len2*h1[2];
2557                                 }
2558                                 else {
2559                                         *(p2-3)= *(p2)   + vz*len1*h2[0];
2560                                         *(p2-2)= *(p2+1) + vz*len1*h2[1];
2561                                         *(p2-1)= *(p2+2) + vz*len1*h2[2];
2562                                 }
2563                         }
2564
2565                 }
2566         }
2567
2568         if(bezt->h1==HD_VECT) { /* vector */
2569                 dx/=3.0f;
2570                 dy/=3.0f;
2571                 dz/=3.0f;
2572                 *(p2-3)= *p2-dx;
2573                 *(p2-2)= *(p2+1)-dy;
2574                 *(p2-1)= *(p2+2)-dz;
2575         }
2576         if(bezt->h2==HD_VECT) {
2577                 dx1/=3.0f;
2578                 dy1/=3.0f;
2579                 dz1/=3.0f;
2580                 *(p2+3)= *p2+dx1;
2581                 *(p2+4)= *(p2+1)+dy1;
2582                 *(p2+5)= *(p2+2)+dz1;
2583         }
2584
2585         len2= len_v3v3(p2, p2+3);
2586         len1= len_v3v3(p2, p2-3);
2587         if(len1==0.0f) len1= 1.0f;
2588         if(len2==0.0f) len2= 1.0f;
2589
2590         if(bezt->f1 & SELECT) { /* order of calculation */
2591                 if(bezt->h2==HD_ALIGN) {        /* aligned */
2592                         if(len1>eps) {
2593                                 len= len2/len1;
2594                                 p2[3]= p2[0]+len*(p2[0]-p2[-3]);
2595                                 p2[4]= p2[1]+len*(p2[1]-p2[-2]);
2596                                 p2[5]= p2[2]+len*(p2[2]-p2[-1]);
2597                         }
2598                 }
2599                 if(bezt->h1==HD_ALIGN) {
2600                         if(len2>eps) {
2601                                 len= len1/len2;
2602                                 p2[-3]= p2[0]+len*(p2[0]-p2[3]);
2603                                 p2[-2]= p2[1]+len*(p2[1]-p2[4]);
2604                                 p2[-1]= p2[2]+len*(p2[2]-p2[5]);
2605                         }
2606                 }
2607         }
2608         else {
2609                 if(bezt->h1==HD_ALIGN) {
2610                         if(len2>eps) {
2611                                 len= len1/len2;
2612                                 p2[-3]= p2[0]+len*(p2[0]-p2[3]);
2613                                 p2[-2]= p2[1]+len*(p2[1]-p2[4]);
2614                                 p2[-1]= p2[2]+len*(p2[2]-p2[5]);
2615                         }
2616                 }
2617                 if(bezt->h2==HD_ALIGN) {        /* aligned */
2618                         if(len1>eps) {
2619                                 len= len2/len1;
2620                                 p2[3]= p2[0]+len*(p2[0]-p2[-3]);
2621                                 p2[4]= p2[1]+len*(p2[1]-p2[-2]);
2622                                 p2[5]= p2[2]+len*(p2[2]-p2[-1]);
2623                         }
2624                 }
2625         }
2626 }
2627
2628 void calchandlesNurb(Nurb *nu) /* first, if needed, set handle flags */
2629 {
2630         BezTriple *bezt, *prev, *next;
2631         short a;
2632
2633         if(nu->type != CU_BEZIER) return;
2634         if(nu->pntsu<2) return;
2635
2636         a= nu->pntsu;
2637         bezt= nu->bezt;
2638         if(nu->flagu & CU_NURB_CYCLIC) prev= bezt+(a-1);
2639         else prev= NULL;
2640         next= bezt+1;
2641
2642         while(a--) {
2643                 calchandleNurb(bezt, prev, next, 0);
2644                 prev= bezt;
2645                 if(a==1) {
2646                         if(nu->flagu & CU_NURB_CYCLIC) next= nu->bezt;
2647                         else next= NULL;
2648                 }
2649                 else next++;
2650
2651                 bezt++;
2652         }
2653 }
2654
2655
2656 void testhandlesNurb(Nurb *nu)
2657 {
2658         /* use when something has changed with handles.
2659         it treats all BezTriples with the following rules:
2660         PHASE 1: do types have to be altered?
2661            Auto handles: become aligned when selection status is NOT(000 || 111)
2662            Vector handles: become 'nothing' when (one half selected AND other not)
2663         PHASE 2: recalculate handles
2664         */
2665         BezTriple *bezt;
2666         short flag, a;
2667
2668         if(nu->type != CU_BEZIER) return;
2669
2670         bezt= nu->bezt;
2671         a= nu->pntsu;
2672         while(a--) {
2673                 flag= 0;
2674                 if(bezt->f1 & SELECT) flag++;
2675                 if(bezt->f2 & SELECT) flag += 2;
2676                 if(bezt->f3 & SELECT) flag += 4;
2677
2678                 if( !(flag==0 || flag==7) ) {
2679                         if(bezt->h1==HD_AUTO) {   /* auto */
2680                                 bezt->h1= HD_ALIGN;
2681                         }
2682                         if(bezt->h2==HD_AUTO) {   /* auto */
2683                                 bezt->h2= HD_ALIGN;
2684                         }
2685
2686                         if(bezt->h1==HD_VECT) {   /* vector */
2687                                 if(flag < 4) bezt->h1= 0;
2688                         }
2689                         if(bezt->h2==HD_VECT) {   /* vector */
2690                                 if( flag > 3) bezt->h2= 0;
2691                         }
2692                 }
2693                 bezt++;
2694         }
2695
2696         calchandlesNurb(nu);
2697 }
2698
2699 void autocalchandlesNurb(Nurb *nu, int flag)
2700 {
2701         /* checks handle coordinates and calculates type */
2702
2703         BezTriple *bezt2, *bezt1, *bezt0;
2704         int i, align, leftsmall, rightsmall;
2705
2706         if(nu==NULL || nu->bezt==NULL) return;
2707
2708         bezt2 = nu->bezt;
2709         bezt1 = bezt2 + (nu->pntsu-1);
2710         bezt0 = bezt1 - 1;
2711         i = nu->pntsu;
2712
2713         while(i--) {
2714
2715                 align= leftsmall= rightsmall= 0;
2716
2717                 /* left handle: */
2718                 if(flag==0 || (bezt1->f1 & flag) ) {
2719                         bezt1->h1= 0;
2720                         /* distance too short: vectorhandle */
2721                         if( len_v3v3( bezt1->vec[1], bezt0->vec[1] ) < 0.0001f) {
2722                                 bezt1->h1= HD_VECT;
2723                                 leftsmall= 1;
2724                         }
2725                         else {
2726                                 /* aligned handle? */
2727                                 if(dist_to_line_v2(bezt1->vec[1], bezt1->vec[0], bezt1->vec[2]) < 0.0001f) {
2728                                         align= 1;
2729                                         bezt1->h1= HD_ALIGN;
2730                                 }
2731                                 /* or vector handle? */
2732                                 if(dist_to_line_v2(bezt1->vec[0], bezt1->vec[1], bezt0->vec[1]) < 0.0001f)
2733                                         bezt1->h1= HD_VECT;
2734
2735                         }
2736                 }
2737                 /* right handle: */
2738                 if(flag==0 || (bezt1->f3 & flag) ) {
2739                         bezt1->h2= 0;
2740                         /* distance too short: vectorhandle */
2741                         if( len_v3v3( bezt1->vec[1], bezt2->vec[1] ) < 0.0001f) {
2742                                 bezt1->h2= HD_VECT;
2743                                 rightsmall= 1;
2744                         }
2745                         else {
2746                                 /* aligned handle? */
2747                                 if(align) bezt1->h2= HD_ALIGN;
2748
2749                                 /* or vector handle? */
2750                                 if(dist_to_line_v2(bezt1->vec[2], bezt1->vec[1], bezt2->vec[1]) < 0.0001f)
2751                                         bezt1->h2= HD_VECT;
2752
2753                         }
2754                 }
2755                 if(leftsmall && bezt1->h2==HD_ALIGN) bezt1->h2= 0;
2756                 if(rightsmall && bezt1->h1==HD_ALIGN) bezt1->h1= 0;
2757
2758                 /* undesired combination: */
2759                 if(bezt1->h1==HD_ALIGN && bezt1->h2==HD_VECT) bezt1->h1= 0;
2760                 if(bezt1->h2==HD_ALIGN && bezt1->h1==HD_VECT) bezt1->h2= 0;
2761
2762                 bezt0= bezt1;
2763                 bezt1= bezt2;
2764                 bezt2++;
2765         }
2766
2767         calchandlesNurb(nu);
2768 }
2769
2770 void autocalchandlesNurb_all(ListBase *editnurb, int flag)
2771 {
2772         Nurb *nu;
2773
2774         nu= editnurb->first;
2775         while(nu) {
2776                 autocalchandlesNurb(nu, flag);
2777                 nu= nu->next;
2778         }
2779 }
2780
2781 void sethandlesNurb(ListBase *editnurb, short code)
2782 {
2783         /* code==1: set autohandle */
2784         /* code==2: set vectorhandle */
2785         /* code==3 (HD_ALIGN) it toggle, vectorhandles become HD_FREE */
2786         /* code==4: sets icu flag to become IPO_AUTO_HORIZ, horizontal extremes on auto-handles */
2787         /* code==5: Set align, like 3 but no toggle */
2788         /* code==6: Clear align, like 3 but no toggle */
2789         Nurb *nu;
2790         BezTriple *bezt;
2791         short a, ok=0;
2792
2793         if(code==1 || code==2) {
2794                 nu= editnurb->first;
2795                 while(nu) {
2796                         if(nu->type == CU_BEZIER) {
2797                                 bezt= nu->bezt;
2798                                 a= nu->pntsu;
2799                                 while(a--) {
2800                                         if((bezt->f1 & SELECT) || (bezt->f3 & SELECT)) {
2801                                                 if(bezt->f1 & SELECT) bezt->h1= code;
2802                                                 if(bezt->f3 & SELECT) bezt->h2= code;
2803                                                 if(bezt->h1!=bezt->h2) {
2804                                                         if ELEM(bezt->h1, HD_ALIGN, HD_AUTO) bezt->h1= HD_FREE;
2805                                                         if ELEM(bezt->h2, HD_ALIGN, HD_AUTO) bezt->h2= HD_FREE;
2806                                                 }
2807                                         }
2808                                         bezt++;
2809                                 }
2810                                 calchandlesNurb(nu);
2811                         }
2812                         nu= nu->next;
2813                 }
2814         }
2815         else {
2816                 /* there is 1 handle not FREE: FREE it all, else make ALIGNED  */
2817
2818                 nu= editnurb->first;
2819                 if (code == 5) {
2820                         ok = HD_ALIGN;
2821                 } else if (code == 6) {
2822                         ok = HD_FREE;
2823                 } else {
2824                         /* Toggle */
2825                         while(nu) {
2826                                 if(nu->type == CU_BEZIER) {
2827                                         bezt= nu->bezt;
2828                                         a= nu->pntsu;
2829                                         while(a--) {
2830                                                 if((bezt->f1 & SELECT) && bezt->h1) ok= 1;
2831                                                 if((bezt->f3 & SELECT) && bezt->h2) ok= 1;
2832                                                 if(ok) break;
2833                                                 bezt++;
2834                                         }
2835                                 }
2836                                 nu= nu->next;
2837                         }
2838                         if(ok) ok= HD_FREE;
2839                         else ok= HD_ALIGN;
2840                 }
2841                 nu= editnurb->first;
2842                 while(nu) {
2843                         if(nu->type == CU_BEZIER) {
2844                                 bezt= nu->bezt;
2845                                 a= nu->pntsu;
2846                                 while(a--) {
2847                                         if(bezt->f1 & SELECT) bezt->h1= ok;
2848                                         if(bezt->f3 & SELECT) bezt->h2= ok;
2849
2850                                         bezt++;
2851                                 }
2852                                 calchandlesNurb(nu);
2853                         }
2854                         nu= nu->next;
2855                 }
2856         }
2857 }
2858
2859 static void swapdata(void *adr1, void *adr2, int len)
2860 {
2861
2862         if(len<=0) return;
2863
2864         if(len<65) {
2865                 char adr[64];
2866
2867                 memcpy(adr, adr1, len);
2868                 memcpy(adr1, adr2, len);
2869                 memcpy(adr2, adr, len);
2870         }
2871         else {
2872                 char *adr;
2873
2874                 adr= (char *)MEM_mallocN(len, "curve swap");
2875                 memcpy(adr, adr1, len);
2876                 memcpy(adr1, adr2, len);
2877                 memcpy(adr2, adr, len);
2878                 MEM_freeN(adr);
2879         }
2880 }
2881
2882 void switchdirectionNurb(Nurb *nu)
2883 {
2884         BezTriple *bezt1, *bezt2;
2885         BPoint *bp1, *bp2;
2886         float *fp1, *fp2, *tempf;
2887         int a, b;
2888
2889         if(nu->pntsu==1 && nu->pntsv==1) return;
2890
2891         if(nu->type == CU_BEZIER) {
2892                 a= nu->pntsu;
2893                 bezt1= nu->bezt;
2894                 bezt2= bezt1+(a-1);
2895                 if(a & 1) a+= 1;        /* if odd, also swap middle content */
2896                 a/= 2;
2897                 while(a>0) {
2898                         if(bezt1!=bezt2) SWAP(BezTriple, *bezt1, *bezt2);
2899
2900                         swapdata(bezt1->vec[0], bezt1->vec[2], 12);
2901                         if(bezt1!=bezt2) swapdata(bezt2->vec[0], bezt2->vec[2], 12);
2902
2903                         SWAP(char, bezt1->h1, bezt1->h2);
2904                         SWAP(short, bezt1->f1, bezt1->f3);
2905
2906                         if(bezt1!=bezt2) {
2907                                 SWAP(char, bezt2->h1, bezt2->h2);
2908                                 SWAP(short, bezt2->f1, bezt2->f3);
2909                                 bezt1->alfa= -bezt1->alfa;
2910                                 bezt2->alfa= -bezt2->alfa;
2911                         }
2912                         a--;
2913                         bezt1++;
2914                         bezt2--;
2915                 }
2916         }
2917         else if(nu->pntsv==1) {
2918                 a= nu->pntsu;
2919                 bp1= nu->bp;
2920                 bp2= bp1+(a-1);
2921                 a/= 2;
2922                 while(bp1!=bp2 && a>0) {
2923                         SWAP(BPoint, *bp1, *bp2);
2924                         a--;
2925                         bp1->alfa= -bp1->alfa;
2926                         bp2->alfa= -bp2->alfa;
2927                         bp1++;
2928                         bp2--;
2929                 }
2930                 if(nu->type == CU_NURBS) {
2931                         /* no knots for too short paths */
2932                         if(nu->knotsu) {
2933                                 /* inverse knots */
2934                                 a= KNOTSU(nu);
2935                                 fp1= nu->knotsu;
2936                                 fp2= fp1+(a-1);
2937                                 a/= 2;
2938                                 while(fp1!=fp2 && a>0) {
2939                                         SWAP(float, *fp1, *fp2);
2940                                         a--;
2941                                         fp1++;
2942                                         fp2--;
2943                                 }
2944                                 /* and make in increasing order again */
2945                                 a= KNOTSU(nu);
2946                                 fp1= nu->knotsu;
2947                                 fp2=tempf= MEM_mallocN(sizeof(float)*a, "switchdirect");
2948                                 while(a--) {
2949                            &