1
     ˆÃÂƒN5ÁÀ¿ ¸    /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _LIBLOCKDEP_LOCKDEP_H_
#define _LIBLOCKDEP_LOCKDEP_H_

#include <sys/prctl.h>
#include <sys/syscall.h>
#include <string.h>
#include <limits.h>
#include <linux/utsname.h>
#include <linux/compiler.h>
#include <linux/export.h>
#include <linux/kern_levels.h>
#include <linux/err.h>
#include <linux/rcu.h>
#include <linux/list.h>
#include <linux/hardirq.h>
#include <unistd.h>

#define MAX_LOCK_DEPTH 63UL

#define asmlinkage
#define __visible

#include "../../../include/linux/lockdep.h"

struct task_struct {
	u64 curr_chain_key;
	int lockdep_depth;
	unsigned int lockdep_recursion;
	struct held_lock held_locks[MAX_LOCK_DEPTH];
	gfp_t lockdep_reclaim_gfp;
	int pid;
	int state;
	char comm[17];
};

#define TASK_RUNNING 0

extern struct task_struct *__curr(void);

#define current (__curr())

static inline int debug_locks_off(void)
{
	return 1;
}

#define task_pid_nr(tsk) ((tsk)->pid)

#define KSYM_NAME_LEN 128
#define printk(...) dprintf(STDOUT_FILENO, __VA_ARGS__)
#define pr_err(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
#define pr_warn pr_err
#define pr_cont pr_err

#define list_del_rcu list_del

#define atomic_t unsigned long
#define atomic_inc(x) ((*(x))++)

#define print_tainted() ""
#define static_obj(x) 1

#define debug_show_all_locks()
extern void debug_check_no_locks_held(void);

static __used bool __is_kernel_percpu_address(unsigned long addr, void *can_addr)
{
	return false;
}

#endif
      ˆƒ@ï_•I|¥‰ÓMdœv ©ƒ&íK<óo¬ÁÀ S    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
 <head>
  <title>Index of /1337_DATA/alfasymlink/root/lib/modules/5.14.0-687.66.1.el9_8.x86_64/build/tools/testing/selftests/sysctl</title>
 </head>
 <body>
<h1>Index of /1337_DATA/alfasymlink/root/lib/modules/5.14.0-687.66.1.el9_8.x86_64/build/tools/testing/selftests/sysctl</h1>
  <table>
   <tr><th valign="top">&nbsp;</th><th><a href="?C=N;O=D">Name</a></th><th><a href="?C=M;O=A">Last modified</a></th><th><a href="?C=S;O=A">Size</a></th><th><a href="?C=D;O=A">Description</a></th></tr>
   <tr><th colspan="5"><hr></th></tr>
<tr><td valign="top">&nbsp;</td><td><a href="/1337_DATA/alfasymlink/root/lib/modules/5.14.0-687.66.1.el9_8.x86_64/build/tools/testing/selftests/">Parent Directory</a>       </td><td>&nbsp;</td><td align="right">  - </td><td>&nbsp;</td></tr>
<tr><td valign="top">&nbsp;</td><td><a href="Makefile">Makefile</a>               </td><td align="right">2026-11-06 15:56  </td><td align="right">269 </td><td>&nbsp;</td></tr>
   <tr><th colspan="5"><hr></th></tr>
</table>
</body></html>
     	ˆ¿Ãƒh¹ÁÀ      	0627
     ˆÄÃ437ÂÁÀ µ    /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _LIBLOCKDEP_RCU_H_
#define _LIBLOCKDEP_RCU_H_

int rcu_scheduler_active;

static inline int rcu_lockdep_current_cpu_online(void)
{
	return 1;
}

static inline int rcu_is_cpu_idle(void)
{
	return 1;
}

static inline bool rcu_is_watching(void)
{
	return false;
}

#define rcu_assign_pointer(p, v)	do { (p) = (v); } while (0)
#define RCU_INIT_POINTER(p, v)	do { (p) = (v); } while (0)

#endif
     ˆÄÃƒ}¶›ÂÁÀ %I    /* SPDX-License-Identifier: GPL-2.0-or-later */
/*
  Red Black Trees
  (C) 1999  Andrea Arcangeli <andrea@suse.de>


  linux/include/linux/rbtree.h

  To use rbtrees you'll have to implement your own insert and search cores.
  This will avoid us to use callbacks and to drop drammatically performances.
  I know it's not the cleaner way,  but in C (not in C++) to get
  performances and genericity...

  See Documentation/core-api/rbtree.rst for documentation and samples.
*/

#ifndef __TOOLS_LINUX_PERF_RBTREE_H
#define __TOOLS_LINUX_PERF_RBTREE_H

#include <linux/kernel.h>
#include <linux/stddef.h>

struct rb_node {
	unsigned long  __rb_parent_color;
	struct rb_node *rb_right;
	struct rb_node *rb_left;
} __attribute__((aligned(sizeof(long))));
    /* The alignment might seem pointless, but allegedly CRIS needs it */

struct rb_root {
	struct rb_node *rb_node;
};

#define rb_parent(r)   ((struct rb_node 