Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'source/blender/editors/sculpt_paint/paint_undo.c')
-rw-r--r--source/blender/editors/sculpt_paint/paint_undo.c74
1 files changed, 37 insertions, 37 deletions
diff --git a/source/blender/editors/sculpt_paint/paint_undo.c b/source/blender/editors/sculpt_paint/paint_undo.c
index b00910195ff..8406c8b20af 100644
--- a/source/blender/editors/sculpt_paint/paint_undo.c
+++ b/source/blender/editors/sculpt_paint/paint_undo.c
@@ -71,13 +71,13 @@ static UndoStack MeshUndoStack = {UNDO_PAINT_MESH, {NULL, NULL}, NULL};
static void undo_restore(bContext *C, UndoStack *UNUSED(stack), UndoElem *uel)
{
- if(uel && uel->restore)
+ if (uel && uel->restore)
uel->restore(C, &uel->elems);
}
static void undo_elem_free(UndoStack *UNUSED(stack), UndoElem *uel)
{
- if(uel && uel->free) {
+ if (uel && uel->free) {
uel->free(&uel->elems);
BLI_freelistN(&uel->elems);
}
@@ -93,7 +93,7 @@ static void undo_stack_push_begin(UndoStack *stack, const char *name, UndoRestor
* know how much memory the undo used to remove old undo elements */
/* remove all undos after (also when stack->current==NULL) */
- while(stack->elems.last != stack->current) {
+ while (stack->elems.last != stack->current) {
uel= stack->elems.last;
undo_elem_free(stack, uel);
BLI_freelinkN(&stack->elems, uel);
@@ -111,13 +111,13 @@ static void undo_stack_push_begin(UndoStack *stack, const char *name, UndoRestor
/* limit amount to the maximum amount*/
nr= 0;
uel= stack->elems.last;
- while(uel) {
+ while (uel) {
nr++;
- if(nr==U.undosteps) break;
+ if (nr==U.undosteps) break;
uel= uel->prev;
}
- if(uel) {
- while(stack->elems.first!=uel) {
+ if (uel) {
+ while (stack->elems.first!=uel) {
UndoElem *first= stack->elems.first;
undo_elem_free(stack, first);
BLI_freelinkN(&stack->elems, first);
@@ -130,20 +130,20 @@ static void undo_stack_push_end(UndoStack *stack)
UndoElem *uel;
uintptr_t totmem, maxmem;
- if(U.undomemory != 0) {
+ if (U.undomemory != 0) {
/* limit to maximum memory (afterwards, we can't know in advance) */
totmem= 0;
maxmem= ((uintptr_t)U.undomemory)*1024*1024;
uel= stack->elems.last;
- while(uel) {
+ while (uel) {
totmem+= uel->undosize;
- if(totmem>maxmem) break;
+ if (totmem>maxmem) break;
uel= uel->prev;
}
- if(uel) {
- while(stack->elems.first!=uel) {
+ if (uel) {
+ while (stack->elems.first!=uel) {
UndoElem *first= stack->elems.first;
undo_elem_free(stack, first);
BLI_freelinkN(&stack->elems, first);
@@ -156,25 +156,25 @@ static int undo_stack_step(bContext *C, UndoStack *stack, int step, const char *
{
UndoElem *undo;
- if(step==1) {
- if(stack->current==NULL);
+ if (step==1) {
+ if (stack->current==NULL);
else {
- if(!name || strcmp(stack->current->name, name) == 0) {
- if(G.f & G_DEBUG) printf("undo %s\n", stack->current->name);
+ if (!name || strcmp(stack->current->name, name) == 0) {
+ if (G.f & G_DEBUG) printf("undo %s\n", stack->current->name);
undo_restore(C, stack, stack->current);
stack->current= stack->current->prev;
return 1;
}
}
}
- else if(step==-1) {
- if((stack->current!=NULL && stack->current->next==NULL) || stack->elems.first==NULL);
+ else if (step==-1) {
+ if ((stack->current!=NULL && stack->current->next==NULL) || stack->elems.first==NULL);
else {
- if(!name || strcmp(stack->current->name, name) == 0) {
+ if (!name || strcmp(stack->current->name, name) == 0) {
undo= (stack->current && stack->current->next)? stack->current->next: stack->elems.first;
undo_restore(C, stack, undo);
stack->current= undo;
- if(G.f & G_DEBUG) printf("redo %s\n", undo->name);
+ if (G.f & G_DEBUG) printf("redo %s\n", undo->name);
return 1;
}
}
@@ -187,7 +187,7 @@ static void undo_stack_free(UndoStack *stack)
{
UndoElem *uel;
- for(uel=stack->elems.first; uel; uel=uel->next)
+ for (uel=stack->elems.first; uel; uel=uel->next)
undo_elem_free(stack, uel);
BLI_freelistN(&stack->elems);
@@ -198,20 +198,20 @@ static void undo_stack_free(UndoStack *stack)
void undo_paint_push_begin(int type, const char *name, UndoRestoreCb restore, UndoFreeCb free)
{
- if(type == UNDO_PAINT_IMAGE)
+ if (type == UNDO_PAINT_IMAGE)
undo_stack_push_begin(&ImageUndoStack, name, restore, free);
- else if(type == UNDO_PAINT_MESH)
+ else if (type == UNDO_PAINT_MESH)
undo_stack_push_begin(&MeshUndoStack, name, restore, free);
}
ListBase *undo_paint_push_get_list(int type)
{
- if(type == UNDO_PAINT_IMAGE) {
- if(ImageUndoStack.current)
+ if (type == UNDO_PAINT_IMAGE) {
+ if (ImageUndoStack.current)
return &ImageUndoStack.current->elems;
}
- else if(type == UNDO_PAINT_MESH) {
- if(MeshUndoStack.current)
+ else if (type == UNDO_PAINT_MESH) {
+ if (MeshUndoStack.current)
return &MeshUndoStack.current->elems;
}
@@ -220,25 +220,25 @@ ListBase *undo_paint_push_get_list(int type)
void undo_paint_push_count_alloc(int type, int size)
{
- if(type == UNDO_PAINT_IMAGE)
+ if (type == UNDO_PAINT_IMAGE)
ImageUndoStack.current->undosize += size;
- else if(type == UNDO_PAINT_MESH)
+ else if (type == UNDO_PAINT_MESH)
MeshUndoStack.current->undosize += size;
}
void undo_paint_push_end(int type)
{
- if(type == UNDO_PAINT_IMAGE)
+ if (type == UNDO_PAINT_IMAGE)
undo_stack_push_end(&ImageUndoStack);
- else if(type == UNDO_PAINT_MESH)
+ else if (type == UNDO_PAINT_MESH)
undo_stack_push_end(&MeshUndoStack);
}
int ED_undo_paint_step(bContext *C, int type, int step, const char *name)
{
- if(type == UNDO_PAINT_IMAGE)
+ if (type == UNDO_PAINT_IMAGE)
return undo_stack_step(C, &ImageUndoStack, step, name);
- else if(type == UNDO_PAINT_MESH)
+ else if (type == UNDO_PAINT_MESH)
return undo_stack_step(C, &MeshUndoStack, step, name);
return 0;
@@ -248,16 +248,16 @@ int ED_undo_paint_valid(int type, const char *name)
{
UndoStack *stack;
- if(type == UNDO_PAINT_IMAGE)
+ if (type == UNDO_PAINT_IMAGE)
stack= &ImageUndoStack;
- else if(type == UNDO_PAINT_MESH)
+ else if (type == UNDO_PAINT_MESH)
stack= &MeshUndoStack;
else
return 0;
- if(stack->current==NULL);
+ if (stack->current==NULL);
else {
- if(name && strcmp(stack->current->name, name) == 0)
+ if (name && strcmp(stack->current->name, name) == 0)
return 1;
else
return stack->elems.first != stack->elems.last;