Prj4 KList

[nzcv]

static void* pNodeVec[1000]={0};
static int pNodei=0;
void KList_1_AddTail_mCC8147100C610E26F94BAA7001E272CA5A51FCD3 (KList_1_t6AF59A9C9213F6617917903C9D0478E8FF2E2CA5* __this, KNode_1_tE83AF50763E3689AD9AFE129AFBD28943115BD4B* ___0_pNode, const RuntimeMethod* method)
{
    printf("TP_AddTail %p\n", ___0_pNode);
    for(int i=0;pNodeVec[i];i++)
    {
        if(pNodeVec[i]==___0_pNode)
        {
            assert(0);
        }
    }
    pNodeVec[pNodei++]=___0_pNode;
	((  void (*) (KList_1_t6AF59A9C9213F6617917903C9D0478E8FF2E2CA5*, KNode_1_tE83AF50763E3689AD9AFE129AFBD28943115BD4B*, const RuntimeMethod*))KList_1_AddTail_m6D4116EF7C279906F3526CCADD075312E338D77D_gshared)(__this, ___0_pNode, method);
}

void KNode_1_Remove_mAACB1F521CBE8DF10AFC95FC8C0063DB67C0A325 (KNode_1_tE83AF50763E3689AD9AFE129AFBD28943115BD4B* __this, const RuntimeMethod* method)
{
	printf("TP_Remove  %p\n", __this);
    for(int i=0; pNodeVec[i];i++)
    {
        if(pNodeVec[i]==__this)
        {
            pNodeVec[i]=0;

            //将pNodeVec[i]后面的元素向前移动
            for(int j=i;pNodeVec[j];j++)
            {
                pNodeVec[j]=pNodeVec[j+1];
            }
            pNodei--;
            break;
        }
    }
	((  void (*) (KNode_1_tE83AF50763E3689AD9AFE129AFBD28943115BD4B*, const RuntimeMethod*))KNode_1_Remove_m5F96485D1354EB354C47CB0B976D7DB46ED1DFD4_gshared)(__this, method);
}