IOR

Search BackLinks only
Display context of search results
Case-sensitive searching

• Garbage collector for C and C++ . . . . 3 matches
       # -DALL_INTERIOR_POINTERS allows all pointers to the interior
       # Alternatively, GC_all_interior_pointers can be set at process
       # -DDONT_ADD_BYTE_AT_END is meaningful only with -DALL_INTERIOR_POINTERS or
       # GC_all_interior_pointers = 1. Normally -DALL_INTERIOR_POINTERS
• LIB_3 . . . . 2 matches
        TCB[count].priority = NULL;
       void LIB_create_task (char *task_name,int priority,void (*task)(void),INT16U * Stack)
        if ( priority < LIB_MIN_PRIORITY || priority > LIB_MAX_PRIORITY ) return; <--------- 우선순위가 지랄 같으면 그냥 끝낸다.
        pReady_heap[ready_tcb_ptr]->priority = priority;
        if ( pReady_heap[temp_count]->priority > pReady_heap[tree_parent(temp_count)]->priority ){
       void LIB_resume_task(INT16U priority ){
        if ( priority == 0 ) return;
        if ( pSuspend_heap[i]->priority == priority ) {
        if ( pReady_heap[temp]->priority > pReady_heap[tree_parent(temp)]->priority ) {
       void LIB_suspend_task(INT16U priority){
        if ( pReady_heap[i]->priority == priority ){
        if ( pReady_heap[tree_left(temp)]->priority > pReady_heap[temp]->priority ) {
        else if ( pReady_heap[tree_right(temp)]->priority > pReady_heap[temp]->priority ) {
        if ( pReady_heap[tree_left(temp_count)]->priority > pReady_heap[temp_count]->priority ){
       void LIB_resume_list(INT16U priority ){
        if ( pSuspend_heap[i]->priority == priority ) {
        if ( pReady_heap[temp]->priority > pReady_heap[tree_parent(temp)]->priority ) {
• JavaNetworkProgramming . . . . 1 match
        execution.setPriority(Thread.MIN_PRIORITY); //우선수위를 정함

Found 3 matching pages out of 7557 total pages (1650 pages are searched)

You can also click here to search title.