代码搜索：task
找到约 10,000 项符合「task」的源代码
代码结果 10,000
www.eeworm.com/read/162651/10287928
c task_receiveack.c
#include "config.h"
static volatile uint8 Result_ReceAck;
void Task_ReceAck(void)
{
OSQCreate(AckInBuf,AckBuf);
while(1)
{
OSWait(K_SIG,0);
_RX_SPI(ReceAddr);
Resul
www.eeworm.com/read/162651/10287959
c task_receivedata.c
#include "config.h"
static volatile uint8 Result_ReceData;
void Task_ReceData(void)
{
uint8 temp;
OSQCreate(ReceDataBuf,ReceBuf); // 创建用于PutChar()的缓冲区
while(1)
{
OSWait(K_SIG
www.eeworm.com/read/162651/10287980
c task_transdata.c
#include "config.h"
static volatile uint8 data SendTimes=1,FrameID=0; //只限本文件内使用的静态外部变量
static volatile uint8 data AckResult=_ERROR;
static volatile uint8 data TimeExpire=OS_Q_TMO;
static v
www.eeworm.com/read/280818/10291100
c serial_task.c
/*
* Copyright 2001, Metro Link, Inc.
* All Rights Reserved
*
* This is UNPUBLISHED PROPRIETARY SOURCE CODE of Metro Link, Inc. and may
* contain proprietary, confidential and trade secret
www.eeworm.com/read/280756/10294954
c os_task.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/162571/10295597
ico idr_task.ico
www.eeworm.com/read/425997/10295921
cpp bitree task.cpp
//用扩展二叉树的先序序列建立二叉树的二叉链表存储结构，输出二叉树的先序，中序，后序和层序序列，
//交换二叉树的所有结点的左，右子树，再输出二叉树的先序，中序，后序和层序序列。
#include
#include
#include
#define NULL 0
#define MAXSIZE 100
ty
www.eeworm.com/read/162500/10301409
c os_task.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/162500/10301544
o os_task.o
www.eeworm.com/read/162356/10311416