0
  *   ˆl–Ü4ý( ©³( 	Å€fàB¦-ÿ¿ƒd‡_†I|¥+ÃÂ ÿ    /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _LINUX_SCHED_TASK_STACK_H
#define _LINUX_SCHED_TASK_STACK_H

/*
 * task->stack (kernel stack) handling interfaces:
 */

#include <linux/sched.h>
#include <linux/magic.h>

#ifdef CONFIG_THREAD_INFO_IN_TASK

/*
 * When accessing the stack of a non-current task that might exit, use
 * try_get_task_stack() instead.  task_stack_page will return a pointer
 * that could get freed out from under you.
 */
static __always_inline void *task_stack_page(const struct task_struct *task)
{
	return task->stack;
}

#define setup_thread_stack(new,old)	do { } while(0)

static __always_inline unsigned long *end_of_stack(const struct task_struct *task)
{
	return task->stack;
}

#elif !defined(__HAVE_THREAD_FUNCTIONS)

#define task_stack_page(task)	((void *)(task)->stack)

static inline void setup_thread_stack(struct task_struct *p, struct task_struct *org)
{
	*task_thread_info(p) = *task_thread_info(org);
	task_thread_info(p)->task = p;
}

/*
 * Return the address of the last usable long on the stack.
 *
 * When the stack grows down, this is just above the thread
 * info struct. Going any lower will corrupt the threadinfo.
 *
 * When the stack grows up, this is the highest address.
 * Beyond that position, we corrupt data on the next page.
 */
static inline unsigned long *end_of_stack(struct task_struct *p)
{
#ifdef CONFIG_STACK_GROWSUP
	return (unsigned long *)((unsigned long)task_thread_info(p) + THREAD_SIZE) - 1;
#else
	return (unsigned long *)(task_thread_info(p) + 1);
#endif
}

#endif

#ifdef CONFIG_THREAD_INFO_IN_TASK
static inline void *try_get_task_stack(struct task_struct *tsk)
{
	return refcount_inc_not_zero(&tsk->stack_refcount) ?
		task_stack_page(tsk) : NULL;
}

extern void put_task_stack(struct task_struct *tsk);
#else
static inline void *try_get_task_stack(struct task_struct *tsk)
{
	return task_stack_page(tsk);
}

static inline void put_task_stack(struct task_struct *tsk) {}
#endif

void exit_task_stack_account(struct task_struct *tsk);

#define task_stack_end_corrupted(task) \
		(*(end_of_stack(task)) != STACK_END_MAGIC)

static inline int object_is_on_stack(const void *obj)
{
	void *stack = task_stack_page(current);

	return (obj >= stack) && (obj < (stack + THREAD_SIZE));
}

extern void thread_stack_cache_init(void);

#ifdef CONFIG_DEBUG_STACK_USAGE
static inline unsigned long stack_not_used(struct task_struct *p)
{
	unsigned long *n = end_of_stack(p);

	do { 	/* Skip over canary */
# ifdef CONFIG_STACK_GROWSUP
		n--;
# else
		n++;
# endif
	} while (!*n);

# ifdef CONFIG_STACK_GROWSUP
	return (unsigned long)end_of_stack(p) - (unsigned long)n;
# else
	return (unsigned long)n - (unsigned long)end_of_stack(p);
# endif
}
#endif
extern void set_task_stack_end_magic(struct task_struct *tsk);

#ifndef __HAVE_ARCH_KSTACK_END
static inline int kstack_end(void *addr)
{
	/* Reliable end of stack detection:
	 * Some APM bios versions misalign the stack
	 */
	return !(((unsigned long)addr+sizeof(void*)-1) & (THREAD_SIZE-sizeof(void*)));
}
#endif

#endif /* _LINUX_SCHED_TASK_STACK_H */
     ÄÃÂ       File not found.
         1   	ˆl–ßi~”êh¥8 Eq–®*bÑ¿Á„e·Ü{_ŒuÐb&=Ly[Ï¿ÅÄ ?÷     	ý7zXZ  i"Þ6 !   t/å£à¾'ŒA] /|  d¦f½bËiÓMn~<Ø@lãÙ>Gýæi‰céílÛ¨[ÈRp1¶”ç'¾@÷¡†´'*9°òx¢îS?- ¾¹HIoÀ2ûÿ/"—âo„¹8Ïëoyð!ÇþÇ‹ym2«?½EY`QÜ‡—Ž[¡™5Çæ
Ò4(jx^F7ãñì €9’¥‡ÁLGI¸³26Ä.¹Ò›òé@·´:¼~[ÞÍü4ÀÄæT Ã±,‡‹µfÉÆ}äWïÃ[íÔvo„ª_:î¢Õy=UþðUqï˜2½¡åv½O×ò1ƒ-¿ö0l æè¡*§7{{ V`AÛ¿gâ÷Y¦ˆ´~IÍ”Œÿr÷+B9TË•yó¸]å½?@$¼
ÂVQfŽaŽ°x™†z',^Ïå•½=Rºd2=9šaÑSŸ PiÙ‡NîõÐ­ˆAcõlrgÆ)£²Ã‰jº ^°!Fl€x­<•ð×¬¢Ó%1b4ê*âng÷øïß½¤ó`Zí«C°5ØRZ{)Ž
†'øV¸:
‘¦lÊb¨úH?5¿:"_¶f¡µv¸ñÍnöPîšUÆË¿à‚ÕRö¯\‰y¬ÁWÝ`j 7Ïg1@˜y†0‡ËSg¤zûÀmµX|«üéÜÏcK¾Í…3©jJõƒd'÷e¾‹NHô\Ô[Ýo¤Å%fTšB®õ;a¡cç”œ´·ã¼i©EEÝú{`‹§x8„ ûM¥ŒùL[¾‡­QQl¿§u[J$z!|n}®$wŸ‚s¼0x'Sd,·¿éÃ"ß ¡R§öŸ^ÞVòinÒ—e«FuØQÙ„ü6ê—…çB.Ö¸–ì!` ý9|:îŽ•xØ¤¯ZE:;Õ“MŠæuçæ8Ôžn\óÐôéf²)º8?º€š+ÞU‹7ÞÝ¦~úki•B¦	éDòÿ@p	
 yBú=~%ŠË*q1ŸEóÇÜyHÅO„ªvaÒ²<tºöCfìR%Ï< ÆÚSâ9èê‡‚ñcRÌðj‚"ƒfŠÕºn¹cãÝD³R>ºd