代码搜索：CS2
找到约 499 项符合「CS2」的源代码
代码结果 499
www.eeworm.com/read/469575/6931559
h dis_void.h
#include
#include
#include
#include
#include
#include
void wcode(unsigned char c_code,unsigned char cs1,un
www.eeworm.com/read/244041/12896363
bl3 gal_300f.bl3
#$ TOOL ispLEVER 5.1.02.70.06.06.SP2006.02
#$ DATE Sun Dec 03 17:53:46 2006
#$ TITLE gal_300f.bls
#$ MODULE gal_300f
#$ PINS 11 POW_EN'o' POW1 POW0 RD CS2'o' CS1'o' CS0'o' A2 A1 A0 WR
.mod
www.eeworm.com/read/187193/8844938
h cs5460.h
#ifndef __CS546X_H__
#define __CS546X_H__
//=======================================
// CS2(P05/B) CS1(P06/A)
// CS5460_CSA 0 0
// CS5460_CSB 0
www.eeworm.com/read/435124/7797073
h defhw.h
// --------------------------------------
// - I/O signals -
// --------------------------------------
#define RS P2_B0 // RS signal
#define E P2_B1 // E signal
#define CS1 P2_B2 // CS1 si
www.eeworm.com/read/244041/12896399
fit gal_300f.fit
$DEVICE P16V8AS fit gal_300f.tt3
$PINS 11 CS2:16 CS0:15 CS1:19 POW_EN:18 A2:7 A1:6 A0:5
WR:4 RD:3 POW0:2 POW1:1
--------------------------------------------
www.eeworm.com/read/244041/12896460
bl1 gal_300f.bl1
#$ TOOL ispLEVER 5.1.02.70.06.06.SP2006.02
#$ DATE Sun Dec 03 17:53:46 2006
#$ TITLE gal_300f.bls
#$ MODULE gal_300f
#$ PINS 11 POW_EN'o' POW1 POW0 RD CS2'o' CS1'o' CS0'o' A2 A1 A0 WR
#$ NOD
www.eeworm.com/read/226581/14457402
h defhw.h
// --------------------------------------
// - I/O signals -
// --------------------------------------
#define RS P2_B7 // RS signal
#define E P2_B6 // E signal
#define CS1 P2_B5 // CS1 si
www.eeworm.com/read/244041/12896372
tt2 gal_300f.tt2
#$ TOOL ispLEVER 5.1.02.70.06.06.SP2006.02
#$ DATE Sun Dec 03 17:53:46 2006
#$ TITLE gal_300f.bls
#$ MODULE gal_300f
#$ PINS 11 POW_EN POW1 POW0 RD CS2 CS1 CS0 A2 A1 A0 WR
.type fr
.i 7
.o 4
www.eeworm.com/read/244041/12896509
naf gal_300f.naf
WR i
A0 i
A1 i
A2 i
RD i
POW0 i
POW1 i
CS0 o
CS1 o
CS2 o
POW_EN o
www.eeworm.com/read/477840/1357758
c memmove.c
#include
void *memmove(void *s1, void *s2, size_t n)
{
unsigned char *cs1 = s1, *cs2 = s2;
if (cs1 == cs2)
return s1;
if (cs2 < cs1)
{
cs1 += n;
cs2 += n;
while