⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 obj.c

📁 c 语言编译器 源代码- c compiler
💻 C
字号:
/* @(#) obj.c 1.2 1/27/86 17:48:06 *//*ident	"@(#)cfront:lib/task/obj.c	1.2"*/#include "task.h"object.~object(){DB(("x%x->~object()\n", this));	if (o_link) task_error(E_OLINK,this);	if (o_next) task_error(E_ONEXT,this);} /* delete *///	note that a task can be on a chain in several placesvoidobject.forget(register task* p)/*	remove all occurrences of task* p from this object's task list*/{DB(("x%x->object::forget( x%x )\n", this, p));	register olink* ll;	register olink* l;	if (o_link == 0) return;	while (o_link->l_task == p) {		ll = o_link;		o_link = ll->l_next;		delete ll;		if (o_link == 0) return;	};	l = o_link;	while (ll = l->l_next) {		if (ll->l_task == p) {			l->l_next = ll->l_next;			delete ll;		}		else l = ll;	};}voidobject.alert()/*	prepare IDLE tasks blocked on this object for sceduling*/{DB(("x%x->object::alert()\n", this));	register olink* l;	for (l=o_link; l; l=l->l_next) {		register task* p = l->l_task;		if (p->s_state == IDLE) p->insert(0,this);	}}voidobject.print(int n){DB(("x%x->object::print( %d )\n", this,n));	int m = n & ~CHAIN;	switch (o_type) {	case QHEAD:		((qhead*) this)->print(m);		break;	case QTAIL:		((qtail*) this)->print(m);		break;	case TASK:		((task*) this)->print(m);		break;	case TIMER:		((task*) this)->print(m);		break;	default:		printf("object (o_type==%d): ",o_type);	}	if (n&VERBOSE) {		olink* l;		printf("remember_chain:\n");		for (l=o_link; l; l=l->l_next) l->l_task->print(m);	}	if (n&CHAIN) {		if (o_next) o_next->print(n);	}	printf("\n");}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -