lavu/tx: simplify in-place permute search function

diff --git a/libavutil/tx.c b/libavutil/tx.c
index 4a5ec6975f25f2c61ae69424fd433b4803656aa6..ac67b354beb9a18020bde4c29fe99a38af901080 100644 (file)
--- a/libavutil/tx.c
+++ b/libavutil/tx.c
@@ -114,8 +114,7 @@ int ff_tx_gen_ptwo_inplace_revtab_idx(AVTXContext *s)
     if (!(s->inplace_idx = av_malloc(s->m*sizeof(*s->inplace_idx))))
         return AVERROR(ENOMEM);
 
-    for (int d = 1; d < s->m; d++) {
-        int src = d, start_src = src;
+    for (int src = 1; src < s->m; src++) {
         int dst = s->revtab[src];
         int found = 0;
 
@@ -123,7 +122,6 @@ int ff_tx_gen_ptwo_inplace_revtab_idx(AVTXContext *s)
             continue;
 
         do {
-            src = dst;
             for (int j = 0; j < nb_inplace_idx; j++) {
                 if (dst == s->inplace_idx[j]) {
                     found = 1;
@@ -131,10 +129,10 @@ int ff_tx_gen_ptwo_inplace_revtab_idx(AVTXContext *s)
                 }
             }
             dst = s->revtab[dst];
-        } while (dst != start_src && !found);
+        } while (dst != src && !found);
 
         if (!found)
-            s->inplace_idx[nb_inplace_idx++] = start_src;
+            s->inplace_idx[nb_inplace_idx++] = src;
     }
 
     s->inplace_idx[nb_inplace_idx++] = 0;