Cleanup: use post increment/decrement

When the result isn't used, prefer post increment/decrement
(already used nearly everywhere in Blender).

source/blender/python/intern/bpy_props.c

@@ -480,7 +480,7 @@ static void bpy_prop_boolean_array_get_cb(struct PointerRNA *ptr,
   if (ret == NULL) {
     PyC_Err_PrintWithFunc(py_func);
 
-    for (i = 0; i < len; ++i) {
+    for (i = 0; i < len; i++) {
       values[i] = false;
     }
   }
@@ -488,7 +488,7 @@ static void bpy_prop_boolean_array_get_cb(struct PointerRNA *ptr,
     if (PyC_AsArray(values, ret, len, &PyBool_Type, false, "BoolVectorProperty get") == -1) {
       PyC_Err_PrintWithFunc(py_func);
 
-      for (i = 0; i < len; ++i) {
+      for (i = 0; i < len; i++) {
         values[i] = false;
       }
 
@@ -724,7 +724,7 @@ static void bpy_prop_int_array_get_cb(struct PointerRNA *ptr,
   if (ret == NULL) {
     PyC_Err_PrintWithFunc(py_func);
 
-    for (i = 0; i < len; ++i) {
+    for (i = 0; i < len; i++) {
       values[i] = 0;
     }
   }
@@ -732,7 +732,7 @@ static void bpy_prop_int_array_get_cb(struct PointerRNA *ptr,
     if (PyC_AsArray(values, ret, len, &PyLong_Type, false, "IntVectorProperty get") == -1) {
       PyC_Err_PrintWithFunc(py_func);
 
-      for (i = 0; i < len; ++i) {
+      for (i = 0; i < len; i++) {
         values[i] = 0;
       }
 
@@ -968,7 +968,7 @@ static void bpy_prop_float_array_get_cb(struct PointerRNA *ptr,
   if (ret == NULL) {
     PyC_Err_PrintWithFunc(py_func);
 
-    for (i = 0; i < len; ++i) {
+    for (i = 0; i < len; i++) {
       values[i] = 0.0f;
     }
   }
@@ -976,7 +976,7 @@ static void bpy_prop_float_array_get_cb(struct PointerRNA *ptr,
     if (PyC_AsArray(values, ret, len, &PyFloat_Type, false, "FloatVectorProperty get") == -1) {
       PyC_Err_PrintWithFunc(py_func);
 
-      for (i = 0; i < len; ++i) {
+      for (i = 0; i < len; i++) {
         values[i] = 0.0f;
       }
 

source/blender/python/mathutils/mathutils_noise.c

@@ -140,11 +140,11 @@ static void next_state(void)
   left = N;
   next = state;
 
-  for (j = N - M + 1; --j; p++) {
+  for (j = N - M + 1; j--; p++) {
     *p = p[M] ^ TWIST(p[0], p[1]);
   }
 
-  for (j = M; --j; p++) {
+  for (j = M; j--; p++) {
     *p = p[M - N] ^ TWIST(p[0], p[1]);
   }