]> git.sur5r.net Git - u-boot/blobdiff - common/memsize.c
common/memsize.c: Increase save array for supporting memory size > 4GB
[u-boot] / common / memsize.c
index 73b92c8a00e4f76ebde34a50b5da4847e4599455..13b004778667f98d15b6f8dfbcbdea808ab0e0a8 100644 (file)
@@ -1,11 +1,13 @@
+// SPDX-License-Identifier: GPL-2.0+
 /*
  * (C) Copyright 2004
  * Wolfgang Denk, DENX Software Engineering, wd@denx.de.
- *
- * SPDX-License-Identifier:    GPL-2.0+
  */
 
-#include <config.h>
+#include <common.h>
+
+DECLARE_GLOBAL_DATA_PTR;
+
 #ifdef __PPC__
 /*
  * At least on G2 PowerPC cores, sequential accesses to non-existent
 long get_ram_size(long *base, long maxsize)
 {
        volatile long *addr;
-       long           save[32];
+       long           save[BITS_PER_LONG - 1];
+       long           save_base;
        long           cnt;
        long           val;
        long           size;
        int            i = 0;
 
-       for (cnt = (maxsize / sizeof (long)) >> 1; cnt > 0; cnt >>= 1) {
+       for (cnt = (maxsize / sizeof(long)) >> 1; cnt > 0; cnt >>= 1) {
                addr = base + cnt;      /* pointer arith! */
-               sync ();
+               sync();
                save[i++] = *addr;
-               sync ();
+               sync();
                *addr = ~cnt;
        }
 
        addr = base;
-       sync ();
-       save[i] = *addr;
-       sync ();
+       sync();
+       save_base = *addr;
+       sync();
        *addr = 0;
 
-       sync ();
+       sync();
        if ((val = *addr) != 0) {
-               /* Restore the original data before leaving the function.
-                */
-               sync ();
-               *addr = save[i];
+               /* Restore the original data before leaving the function. */
+               sync();
+               *base = save_base;
                for (cnt = 1; cnt < maxsize / sizeof(long); cnt <<= 1) {
                        addr  = base + cnt;
-                       sync ();
+                       sync();
                        *addr = save[--i];
                }
                return (0);
        }
 
-       for (cnt = 1; cnt < maxsize / sizeof (long); cnt <<= 1) {
+       for (cnt = 1; cnt < maxsize / sizeof(long); cnt <<= 1) {
                addr = base + cnt;      /* pointer arith! */
                val = *addr;
                *addr = save[--i];
                if (val != ~cnt) {
-                       size = cnt * sizeof (long);
-                       /* Restore the original data before leaving the function.
+                       size = cnt * sizeof(long);
+                       /*
+                        * Restore the original data
+                        * before leaving the function.
                         */
-                       for (cnt <<= 1; cnt < maxsize / sizeof (long); cnt <<= 1) {
+                       for (cnt <<= 1;
+                            cnt < maxsize / sizeof(long);
+                            cnt <<= 1) {
                                addr  = base + cnt;
                                *addr = save[--i];
                        }
+                       /* warning: don't restore save_base in this case,
+                        * it is already done in the loop because
+                        * base and base+size share the same physical memory
+                        * and *base is saved after *(base+size) modification
+                        * in first loop
+                        */
                        return (size);
                }
        }
+       *base = save_base;
 
        return (maxsize);
 }
+
+phys_size_t __weak get_effective_memsize(void)
+{
+#ifndef CONFIG_VERY_BIG_RAM
+       return gd->ram_size;
+#else
+       /* limit stack to what we can reasonable map */
+       return ((gd->ram_size > CONFIG_MAX_MEM_MAPPED) ?
+               CONFIG_MAX_MEM_MAPPED : gd->ram_size);
+#endif
+}