ＳＫＹＳＨＥＬＬＭＡＮＡＧＥＲ

📁 ＳＫＹＳＨＥＬＬＭＡＮＡＧＥＲ PHP v8.1.34

Path:root/home/africainfos/Nazareth.israel.africa-infos.com/

Name	Size	Perm	Actions
📁 .tmb	-	0755	🗑️ 🏷️
📁 159264	-	0755	🗑️ 🏷️
📁 289519	-	0755	🗑️ 🏷️
📁 876911	-	0755	🗑️ 🏷️
📁 cgi-bin	-	0755	🗑️ 🏷️
📁 images	-	0755	🗑️ 🏷️
📁 wk	-	0755	🗑️ 🏷️
📁 wp-admin	-	0755	🗑️ 🏷️
📁 wp-content	-	0755	🗑️ 🏷️
📁 wp-includes	-	0755	🗑️ 🏷️
📁 wpclone_backup	-	0755	🗑️ 🏷️
📄 .webshell_scan_active.json	0.38 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 .webshell_scan_queue_55dae80fafb463c677b0550283aeeb211cd741aba4fd5d3090a7a63262bb588a.lst	105679.91 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 .webshell_scan_state_55dae80fafb463c677b0550283aeeb211cd741aba4fd5d3090a7a63262bb588a.json	0.21 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 OBFUSCATE.html	86 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 _.txt	0.08 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 adminfuns.php	173.77 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 cmd.php	35.08 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 d.php	35.08 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 database.php	159.32 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 database.php7	159.32 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 database.phtml	159.32 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 elish.php	53.54 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 elish.php7	53.54 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 elish.phtml	53.54 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 enum.php	52.49 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 enum.php7	52.49 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 enum.phtml	52.49 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 features.php	10.52 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 filefuns.php	5.75 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 function.php	4.98 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 inc1.php	4.36 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 inc2.php	0.64 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 index.php	0.4 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 license.txt	19.44 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 mailers.php	124.82 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 mailers.php7	124.82 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 mailers.phtml	124.82 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 min.php	6.83 KB	0444	🗑️ 🏷️ ⬇️ ✏️
📄 php.php	70.78 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 readme.html	7.23 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 robots.txt	0.09 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 samurai_activity.log	0.41 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 test.html	86 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 test.php	211.92 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 test.phtml	211.92 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 test1.php7	211.92 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 txets.php	5.93 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 w3ll_protected_2025-10-25T07-11-52.html	160.57 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 w3lls.php	206.14 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 w3lls.php7	209.23 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 w3llscc - Copy.php7	174.5 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 w3llscc.php7	174.5 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 webshell_scan_batch_progress.log	63.85 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-activate.php	7.2 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-blog-header.php	0.34 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-canvas.php	10.83 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-constants.php	1.91 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-frame.php	27.84 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-query.php	10.46 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-response.php	123 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-schema.php	1.92 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-class-tokens.php	1.82 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-comments-post.php	2.27 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-conffq.php	0 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config-sample.php	3.26 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-cron.php	5.49 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-formatting.php	34.81 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-headre.php	0 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-links-opml.php	2.43 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-load.php	3.84 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-login.php	50.63 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-mail.php	8.52 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-protection.php	10.8 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-settings.php	31.88 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-signup.php	33.81 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-templates.php	1.86 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 wp-trackback.php	5.09 KB	0644	🗑️ 🏷️ ⬇️ ✏️
📄 xmlrpc.php	3.13 KB	0644	🗑️ 🏷️ ⬇️ ✏️

Edit: memmgr.c

//----------------------------------------------------------------
// Statically-allocated memory manager
//
// by Eli Bendersky (eliben@gmail.com)
//  
// This code is in the public domain.
//----------------------------------------------------------------
#include "memmgr.h"

typedef ulong Align;

union mem_header_union
{
    struct 
    {
        // Pointer to the next block in the free list
        //
        union mem_header_union* next;

// Size of the block (in quantas of sizeof(mem_header_t))
        //
        ulong size; 
    } s;

// Used to align headers in memory to a boundary
    //
    Align align_dummy;
};

typedef union mem_header_union mem_header_t;

// Initial empty list
//
static mem_header_t base;

// Start of free list
//
static mem_header_t* freep = 0;

// Static pool for new allocations
//
static byte pool[POOL_SIZE] = {0};
static ulong pool_free_pos = 0;

void memmgr_init()
{
    base.s.next = 0;
    base.s.size = 0;
    freep = 0;
    pool_free_pos = 0;
}

static mem_header_t* get_mem_from_pool(ulong nquantas)
{
    ulong total_req_size;

mem_header_t* h;

if (nquantas < MIN_POOL_ALLOC_QUANTAS)
        nquantas = MIN_POOL_ALLOC_QUANTAS;

total_req_size = nquantas * sizeof(mem_header_t);

if (pool_free_pos + total_req_size <= POOL_SIZE)
    {
        h = (mem_header_t*) (pool + pool_free_pos);
        h->s.size = nquantas;
        memmgr_free((void*) (h + 1));
        pool_free_pos += total_req_size;
    }
    else
    {
        return 0;
    }

return freep;
}

// Allocations are done in 'quantas' of header size.
// The search for a free block of adequate size begins at the point 'freep' 
// where the last block was found.
// If a too-big block is found, it is split and the tail is returned (this 
// way the header of the original needs only to have its size adjusted).
// The pointer returned to the user points to the free space within the block,
// which begins one quanta after the header.
//
void* memmgr_alloc(ulong nbytes)
{
    mem_header_t* p;
    mem_header_t* prevp;

// Calculate how many quantas are required: we need enough to house all
    // the requested bytes, plus the header. The -1 and +1 are there to make sure
    // that if nbytes is a multiple of nquantas, we don't allocate too much
    //
    ulong nquantas = (nbytes + sizeof(mem_header_t) - 1) / sizeof(mem_header_t) + 1;

// First alloc call, and no free list yet ? Use 'base' for an initial
    // denegerate block of size 0, which points to itself
    // 
    if ((prevp = freep) == 0)
    {
        base.s.next = freep = prevp = &base;
        base.s.size = 0;
    }

for (p = prevp->s.next; ; prevp = p, p = p->s.next)
    {
        // big enough ?
        if (p->s.size >= nquantas) 
        {
            // exactly ?
            if (p->s.size == nquantas)
            {
                // just eliminate this block from the free list by pointing
                // its prev's next to its next
                //
                prevp->s.next = p->s.next;
            }
            else // too big
            {
                p->s.size -= nquantas;
                p += p->s.size;
                p->s.size = nquantas;
            }

freep = prevp;
            return (void*) (p + 1);
        }
        // Reached end of free list ?
        // Try to allocate the block from the pool. If that succeeds,
        // get_mem_from_pool adds the new block to the free list and
        // it will be found in the following iterations. If the call
        // to get_mem_from_pool doesn't succeed, we've run out of
        // memory
        //
        else if (p == freep)
        {
            if ((p = get_mem_from_pool(nquantas)) == 0)
            {
                #ifdef DEBUG_MEMMGR_FATAL
                printf("!! Memory allocation failed !!\n");
                #endif
                return 0;
            }
        }
    }
}

// Scans the free list, starting at freep, looking the the place to insert the 
// free block. This is either between two existing blocks or at the end of the
// list. In any case, if the block being freed is adjacent to either neighbor,
// the adjacent blocks are combined.
//
void memmgr_free(void* ap)
{
    mem_header_t* block;
    mem_header_t* p;

// acquire pointer to block header
    block = ((mem_header_t*) ap) - 1;

// Find the correct place to place the block in (the free list is sorted by
    // address, increasing order)
    //
    for (p = freep; !(block > p && block < p->s.next); p = p->s.next)
    {
        // Since the free list is circular, there is one link where a 
        // higher-addressed block points to a lower-addressed block. 
        // This condition checks if the block should be actually 
        // inserted between them
        //
        if (p >= p->s.next && (block > p || block < p->s.next))
            break;
    }

// Try to combine with the higher neighbor
    //
    if (block + block->s.size == p->s.next)
    {
        block->s.size += p->s.next->s.size;
        block->s.next = p->s.next->s.next;
    }
    else
    {
        block->s.next = p->s.next;
    }

// Try to combine with the lower neighbor
    //
    if (p + p->s.size == block)
    {
        p->s.size += block->s.size;
        p->s.next = block->s.next;
    }
    else
    {
        p->s.next = block;
    }

freep = p;
}

📁 ＳＫＹＳＨＥＬＬ ＭＡＮＡＧＥＲ PHP v8.1.34

Edit: memmgr.c

📁 ＳＫＹＳＨＥＬＬＭＡＮＡＧＥＲ PHP v8.1.34