linux源代码剖析之init

init

main.c
#define LIBRARY
#include <unistd.h>
#include <time.h>

/*

  • we need this inline - forking from kernel space will result
  • in NO COPY ON WRITE (!!!), until an execve is executed. This
  • is no problem, but for the stack. This is handled by not letting
  • main() use the stack at all after fork(). Thus, no function
  • calls - which means inline code for fork too, as otherwise we
  • would use the stack upon exit from ‘fork()’.
  • Actually only pause and fork are needed inline, so that there
  • won’t be any messing with the stack from main(), but we define
  • some others too.
    */
    static inline _syscall0(int,fork)
    static inline _syscall0(int,pause)
    static inline _syscall0(int,setup)
    static inline _syscall0(int,sync)

#include <linux/tty.h>
#include <linux/sched.h>
#include <linux/head.h>
#include <asm/system.h>
#include <asm/io.h>

#include <stddef.h>
#include <stdarg.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/types.h>

#include <linux/fs.h>

static char printbuf[1024];

extern int vsprintf();
extern void init(void);
extern void hd_init(void);
extern long kernel_mktime(struct tm * tm);
extern long startup_time;

/*

  • Yeah, yeah, it’s ugly, but I cannot find how to do this correctly
  • and this seems to work. I anybody has more info on the real-time
  • clock I’d be interested. Most of this was trial and error, and some
  • bios-listing reading. Urghh.
    */

#define CMOS_READ(addr) ({
outb_p(0x80|addr,0x70);
inb_p(0x71);
})

#define BCD_TO_BIN(val) ((val)=((val)&15) + ((val)>>4)*10)

static void time_init(void)
{
struct tm time;

do {
	time.tm_sec = CMOS_READ(0);
	time.tm_min = CMOS_READ(2);
	time.tm_hour = CMOS_READ(4);
	time.tm_mday = CMOS_READ(7);
	time.tm_mon = CMOS_READ(8)-1;
	time.tm_year = CMOS_READ(9);
} while (time.tm_sec != CMOS_READ(0));
BCD_TO_BIN(time.tm_sec);
BCD_TO_BIN(time.tm_min);
BCD_TO_BIN(time.tm_hour);
BCD_TO_BIN(time.tm_mday);
BCD_TO_BIN(time.tm_mon);
BCD_TO_BIN(time.tm_year);
startup_time = kernel_mktime(&time);

}

void main(void) /* This really IS void, no error here. /
{ /
The startup routine assumes (well, …) this /
/

  • Interrupts are still disabled. Do necessary setups, then
  • enable them
    /
    time_init();
    tty_init();
    trap_init();
    sched_init();
    buffer_init();
    hd_init();
    sti();
    move_to_user_mode();
    if (!fork()) { /
    we count on this going ok /
    init();
    }
    /
  • NOTE!! For any other task ‘pause()’ would mean we have to get a
  • signal to awaken, but task0 is the sole exception (see ‘schedule()’)
  • as task 0 gets activated at every idle moment (when no other tasks
  • can run). For task0 ‘pause()’ just means we go check if some other
  • task can run, and if not we return here.
    */
    for(;😉 pause();
    }

static int printf(const char *fmt, …)
{
va_list args;
int i;

va_start(args, fmt);
write(1,printbuf,i=vsprintf(printbuf, fmt, args));
va_end(args);
return i;

}

static char * argv[] = { “-”,NULL };
static char * envp[] = { “HOME=/usr/root”, NULL };

void init(void)
{
int i,j;

setup();
if (!fork())
	_exit(execve("/bin/update",NULL,NULL));
(void) open("/dev/tty0",O_RDWR,0);
(void) dup(0);
(void) dup(0);
printf("%d buffers = %d bytes buffer space\n\r",NR_BUFFERS,
	NR_BUFFERS*BLOCK_SIZE);
printf(" Ok.\n\r");
if ((i=fork())<0)
	printf("Fork failed in init\r\n");
else if (!i) {
	close(0);close(1);close(2);
	setsid();
	(void) open("/dev/tty0",O_RDWR,0);
	(void) dup(0);
	(void) dup(0);
	_exit(execve("/bin/sh",argv,envp));
}
j=wait(&i);
printf("child %d died with code %04x\n",j,i);
sync();
_exit(0);	/* NOTE! _exit, not exit() */

}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
Linux 互斥锁主要是通过内核中的 mutex API 实现的。下面是一个简单的互斥锁示例代码: ``` #include <pthread.h> #include <stdio.h> pthread_mutex_t mutex; void *thread_func(void *arg) { pthread_mutex_lock(&mutex); // 加锁 printf("Thread %d is in critical section\n", *((int*)arg)); pthread_mutex_unlock(&mutex); // 解锁 return NULL; } int main() { pthread_t tid[2]; int thread_num[2] = {1, 2}; pthread_mutex_init(&mutex, NULL); // 初始化互斥锁 pthread_create(&tid[0], NULL, thread_func, &thread_num[0]); pthread_create(&tid[1], NULL, thread_func, &thread_num[1]); pthread_join(tid[0], NULL); pthread_join(tid[1], NULL); pthread_mutex_destroy(&mutex); // 销毁互斥锁 return 0; } ``` 在该示例中,我们首先使用 `pthread_mutex_init()` 初始化互斥锁并创建两个线程。线程函数 `thread_func()` 中,通过 `pthread_mutex_lock()` 和 `pthread_mutex_unlock()` 来进行锁的加解锁操作。 下面是互斥锁的源代码分析: 互斥锁的数据结构定义如下: ``` typedef struct { int count; int owner; struct futex q; } mutex_t; ``` 其中,`count` 表示锁的计数,`owner` 表示当前持有锁的线程 ID,`q` 表示等待队列。 下面是互斥锁的加锁操作 `mutex_lock()` 的源代码: ``` void mutex_lock(mutex_t *lock) { if (atomic_inc_return(&lock->count) == 1) { lock->owner = current_thread_id(); return; } if (lock->owner == current_thread_id()) return; futex_down(&lock->q, lock->count, current_thread_id()); lock->owner = current_thread_id(); } ``` 在该函数中,我们首先通过原子加操作 `atomic_inc_return()` 来将 `lock->count` 加 1,并判断锁是否已经被占用。如果是第一个线程获取锁,那么直接将 `lock->owner` 设置为当前线程 ID 并返回,否则则将当前线程加入到等待队列中并阻塞。 下面是互斥锁的解锁操作 `mutex_unlock()` 的源代码: ``` void mutex_unlock(mutex_t *lock) { if (!atomic_dec_return(&lock->count)) { lock->owner = 0; futex_up(&lock->q, 1); } } ``` 在该函数中,我们首先通过原子减操作 `atomic_dec_return()` 将 `lock->count` 减 1,并判断是否为 0。如果为 0,则将 `lock->owner` 设置为 0 并唤醒等待队列中的一个线程。 综上所述,Linux 互斥锁主要是通过内核中的 mutex API 实现的。在加锁操作中,通过原子操作对计数进行加一,并根据计数判断是否需要将当前线程加入到等待队列中;在解锁操作中,通过原子操作对计数进行减一,并根据计数判断是否需要唤醒等待队列中的一个线程。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

低调的小哥哥

你的关注就是我为你服务的动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值