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

📄 pis.c

📁 test file nucleus source
💻 C
📖 第 1 页 / 共 4 页
字号:
            /* Suspension is requested.   */            /* Increment the number of tasks waiting.  */            pipe -> pi_tasks_waiting++;#ifdef INCLUDE_PROVIEW            _RTProf_DumpPipe(RT_PROF_BROADCAST_TO_PIPE,pipe,RT_PROF_WAIT);#endif /* INCLUDE_PROVIEW */            /* Setup the suspend block and suspend the calling task.  */            suspend_ptr =  &suspend_block;            suspend_ptr -> pi_pipe =                     pipe;            suspend_ptr -> pi_suspend_link.cs_next =     NU_NULL;            suspend_ptr -> pi_suspend_link.cs_previous = NU_NULL;            suspend_ptr -> pi_message_area =             (BYTE_PTR) message;            suspend_ptr -> pi_message_size =             size;            task =                            (TC_TCB *) TCT_Current_Thread();            suspend_ptr -> pi_suspended_task =           task;            /* Determine if priority or FIFO suspension is associated with the               pipe.  */            if (pipe -> pi_fifo_suspend)            {                /* FIFO suspension is required.  Link the suspend block into                   the list of suspended tasks on this pipe.  */                CSC_Place_On_List((CS_NODE **) &(pipe -> pi_suspension_list),                                        &(suspend_ptr -> pi_suspend_link));            }            else            {                /* Get the priority of the current thread so the suspend block                   can be placed in the appropriate place.  */                suspend_ptr -> pi_suspend_link.cs_priority =                                                    TCC_Task_Priority(task);                CSC_Priority_Place_On_List((CS_NODE **)                                &(pipe -> pi_suspension_list),                                        &(suspend_ptr -> pi_suspend_link));            }            /* Finally, suspend the calling task. Note that the suspension call               automatically clears the protection on the pipe.  */            TCC_Suspend_Task((NU_TASK *) task, NU_PIPE_SUSPEND,                                        PIC_Cleanup, suspend_ptr, suspend);            /* Pickup the return status.  */            status =  suspend_ptr -> pi_return_status;        }        else        {            /* Return a status of NU_PIPE_FULL because there is no               room in the pipe for the message.  */            status =  NU_PIPE_FULL;#ifdef INCLUDE_PROVIEW            _RTProf_DumpPipe(RT_PROF_BROADCAST_TO_PIPE,pipe,RT_PROF_FAIL);#endif /* INCLUDE_PROVIEW */        }    }    else    {#ifdef INCLUDE_PROVIEW        _RTProf_DumpPipe(RT_PROF_BROADCAST_TO_PIPE,pipe,RT_PROF_OK);#endif /* INCLUDE_PROVIEW */        /* Determine if a task is waiting on an empty pipe.  */        if ((pipe -> pi_suspension_list) && (pipe -> pi_messages == 0))        {            /* Yes, one or more tasks are waiting for a message from this               pipe.  */            preempt =  0;            do            {                /* Decrement the number of tasks waiting on pipe.  */                pipe -> pi_tasks_waiting--;                /* Remove the first suspended block from the list.  */                suspend_ptr =  pipe -> pi_suspension_list;                CSC_Remove_From_List((CS_NODE **)                                &(pipe -> pi_suspension_list),                                          &(suspend_ptr -> pi_suspend_link));                /* Setup the source and destination pointers.  */                source =       (BYTE_PTR) message;                destination =  suspend_ptr -> pi_message_area;                /* Initialize the return status.  */                suspend_ptr -> pi_return_status =  NU_SUCCESS;                /* Loop to actually copy the message.  */                i =  (INT) size;                do                {                    *(destination++) =  *(source);                    if ((--i) == 0)                        break;                    source++;                } while (1);                /* Return the size of the message copied.  */                suspend_ptr -> pi_actual_size =  size;                /* Wakeup the waiting task and check for preemption.  */                preempt =  preempt |                 TCC_Resume_Task((NU_TASK *) suspend_ptr -> pi_suspended_task,                                                         NU_PIPE_SUSPEND);                /* Move the suspend pointer to the next node, which is now                   at the head of the list.  */                suspend_ptr =  pipe -> pi_suspension_list;            } while (suspend_ptr);            /* Determine if preemption needs to take place. */            if (preempt)                 /* Transfer control to the system if the resumed task function                   detects a preemption condition.  */                TCT_Control_To_System();        }        else        {            /* There is enough room in the pipe and no task is waiting.  */            /* Setup the source pointer.  */            source =       (BYTE_PTR) message;            destination =  pipe -> pi_write;            /* Process according to the type of message supported.  */            if (pipe -> pi_fixed_size)            {                /* Fixed-size messages are supported by this pipe.  */                /* Loop to copy the message into the pipe area.  */                i =  (INT) size;                do                {                    *(destination++) =  *(source);                    if ((--i) == 0)                        break;                    source++;                } while (1);            }            else            {                /* Variable-size messages are supported.  Processing must                   check for pipe wrap-around conditions.  */                /* Place message size in first location.  */                *((UNSIGNED *) destination) =  size;                destination =  destination + sizeof(UNSIGNED);                /* Check for a wrap-around condition on the pipe.  */                if (destination >= pipe -> pi_end)                    /* Wrap the write pointer back to the top of the pipe                       area.  */                    destination =  pipe -> pi_start;                /* Decrement the number of bytes remaining for this                   extra word of overhead.  */                pipe -> pi_available =  pipe -> pi_available -                                                        sizeof(UNSIGNED);                /* Calculate the number of bytes remaining from the write                   pointer to the bottom of the pipe.  */                copy_size =  pipe -> pi_end - destination;                /* Determine if the message needs to be wrapped around the                   edge of the pipe area.  */                if (copy_size >= size)                {                    /* Copy the whole message at once.  */                    i =  (INT) size;                    do                    {                        *(destination++) =  *(source);                        if ((--i) == 0)                            break;                        source++;                    } while (1);                }                else                {                    /* Copy the first half of the message.  */                    i =  (INT) copy_size;                    do                    {                        *(destination) =  *(source++);                        if ((--i) == 0)                            break;                        destination++;                    } while (1);                    /* Copy the second half of the message.  */                    destination =  pipe -> pi_start;                    i =  (INT) (size - copy_size);                    do                    {                        *(destination++) =  *(source);                        if ((--i) == 0)                            break;                        source++;                    } while (1);                }            }            /* Check again for wrap-around condition on the write pointer. */            if (destination >= pipe -> pi_end)                /* Move the write pointer to the top of the pipe area.  */                destination =  pipe -> pi_start;            /* Determine if the pipe supports variable-length messages.  If               so, pad bytes are needed to keep UNSIGNED alignment.  */            if (pad)            {                /* Variable-size message.  Add pad bytes to the write                   pointer.  */                /* Calculate the number of bytes remaining from the write                   pointer to the bottom of the pipe.  */                copy_size =  pipe -> pi_end - destination;                /* If there is not enough room at the bottom of the pipe, the                   pad bytes must be wrapped around to the top.  */                if (copy_size <= pad)                    /* Move write pointer to the top of the pipe and make the                       necessary adjustment.  */                    destination =  pipe -> pi_start + (pad - copy_size);                else                    /* There is enough room in the pipe to simply add the                       the pad bytes to the write pointer.  */                    destination =  destination + pad;                /* Decrement the number of available bytes.  */                pipe -> pi_available =  pipe -> pi_available - pad;            }            /* Update the actual write pointer.  */            pipe -> pi_write =  destination;            /* Decrement the number of available bytes.  */            pipe -> pi_available =  pipe -> pi_available - size;            /* Increment the number of messages in the pipe.  */            pipe -> pi_messages++;        }    }    /* Release protection against access to the pipe.  */    TCT_Unprotect();    /* Return to user mode */    NU_USER_MODE();    /* Return the completion status.  */    return(status);}

⌨️ 快捷键说明

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