Mercurial > libavutil.hg

changeset 419:290f5853797a libavutil

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
indent
author michael
date Fri, 04 Jan 2008 19:16:38 +0000
parents 9f2461caf179
children 40ef1f81f445
files tree.c
diffstat 1 files changed, 27 insertions(+), 27 deletions(-) [+]
line wrap: on
line diff
--- a/tree.c	Fri Jan 04 18:58:36 2008 +0000
+++ b/tree.c	Fri Jan 04 19:16:38 2008 +0000
@@ -68,38 +68,38 @@
                 return NULL;
             }
         }
-            ret= av_tree_insert(&t->child[v>>31], key, cmp, next);
-            if(!ret){
-                int i= (v>>31) ^ !!*next;
-                AVTreeNode **child= &t->child[i];
-                t->state += 2*i - 1;
+        ret= av_tree_insert(&t->child[v>>31], key, cmp, next);
+        if(!ret){
+            int i= (v>>31) ^ !!*next;
+            AVTreeNode **child= &t->child[i];
+            t->state += 2*i - 1;
 
-                if(!(t->state&1)){
-                    if(t->state){
-                        if((*child)->state*2 == -t->state){
-                            *tp= (*child)->child[i^1];
-                            (*child)->child[i^1]= (*tp)->child[i];
-                            (*tp)->child[i]= *child;
-                            *child= (*tp)->child[i^1];
-                            (*tp)->child[i^1]= t;
+            if(!(t->state&1)){
+                if(t->state){
+                    if((*child)->state*2 == -t->state){
+                        *tp= (*child)->child[i^1];
+                        (*child)->child[i^1]= (*tp)->child[i];
+                        (*tp)->child[i]= *child;
+                        *child= (*tp)->child[i^1];
+                        (*tp)->child[i^1]= t;
 
-                            (*tp)->child[0]->state= -((*tp)->state>0);
-                            (*tp)->child[1]->state=   (*tp)->state<0 ;
-                            (*tp)->state=0;
-                        }else{
-                            *tp= *child;
-                            *child= (*child)->child[i^1];
-                            (*tp)->child[i^1]= t;
-                            if((*tp)->state) t->state  = 0;
-                            else             t->state>>= 1;
-                            (*tp)->state= -t->state;
-                        }
+                        (*tp)->child[0]->state= -((*tp)->state>0);
+                        (*tp)->child[1]->state=   (*tp)->state<0 ;
+                        (*tp)->state=0;
+                    }else{
+                        *tp= *child;
+                        *child= (*child)->child[i^1];
+                        (*tp)->child[i^1]= t;
+                        if((*tp)->state) t->state  = 0;
+                        else             t->state>>= 1;
+                        (*tp)->state= -t->state;
                     }
                 }
-                if(!(*tp)->state ^ !!*next)
-                    return key;
             }
-            return ret;
+            if(!(*tp)->state ^ !!*next)
+                return key;
+        }
+        return ret;
     }else{
         *tp= *next; *next= NULL;
         (*tp)->elem= key;