其他

我們獲得的UBOOT的代碼中實際是有DM9000的網口驅動的，位於：driver/dm9000x.c在S3C6410的配置中，中並沒有將之開啟，而其他的晶片中有使用特別需要注意的是dm9000的驅動與dm9000AE的驅動還是有區別的，如果直接使用代碼中內建的dm9000驅動流程，會出現無法收到資料的情況一、添加dm9000AE的驅動[cpp] view plaincopyprint?修改include/configs/smdk6410.h，參考 include/configs/scb9328.

DescriptionThe king has guards of all   different heights. Rather than line them up in increasing or  decreasing height order, he wants to line them up so each guard   is either shorter than the guards next to him or taller than the guards next to

DescriptionThe sum of the mth  powers of the first n integersS(n,m)  =  SUM  (  j=  1  to  n)( jm)Can be written as a polynomial of degree m+1 in n:S(n,m)  =  SUM  (k  =  1  to  m+1)(F(m,k)  *nk)Fo  example:The coefficients F(m,k) of these formulas

開發平台：ubuntu10.04，核心版本2.6.32-33-generic，交叉編譯器：天嵌公司提供的arm-linux-gcc 4.3.3，核心樹：/opt/EmbedSky/linux-2.6.30.4/目標平台：天嵌公司的TQ2440開發板ARM9，核心版本2.6.30.4 1.      首先解壓天嵌公司提供的核心源碼包linux-2.6.30.4_20100531.tar.bz2，tar xvfj linux-2.6.30.4_20100531.tar.bz2 –C

hdu3905--SleepingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1495    Accepted Submission(s): 565Problem Description       ZZZ is an enthusiastic ACMer and he spends lots of time on

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10199 Accepted Submission(s): 3905Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone

Cow Exhibition Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Description：    "Fat and docile, big and dumb, they look so stupid, they aren't muchfun..."- Cows with Guns by Dana LyonsThe cows want to prove to the

請先看以下程式:Q：若 int a[5];則 &a+1 的含義是甚嗎？A：&a+1 不是表示a的地址(設為Ox0010)加1，變為0x0011. 由於a為包括5個int類型的數組，則"&a+1"中的"+1"表示為相當於"1"個a大小的空間(或成為位移)，此時&a+1 表示 a[5].Q:若 int* ptr = (int*) (&a+1);則 ptr 含義是甚麼 ？而 ptr - 1 又表示甚麼 ？A：由於&a+1 表示 a[5]，

 Is It A Tree?Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:10000KB     64bit IO Format:%I64d & %I64u       DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one

驅動程式：/* * A adc driver as an example of char device drivers * * The initial developer of the original code is Barry Song * <author@linuxdriver.cn>. All Rights Reserved. */#include <linux/module.h>#include <linux/types.h>#include

雙擊QTableView的行，擷取該行資料 代碼如下,請注意參數類型匹配  Cpp代碼   connect(dataTabView_, SIGNAL(doubleClicked(const QModelIndex &)), this, SLOT(slotRowDoubleClicked(const QModelIndex &))); void ABED::rowDoubleClicked(const QModelIndex index)

QFuture<T>run(constClass*object,T(Class::*fn)(Param1,Param2,Param3,Param4,Param5)const,constArg1 &arg1,constArg2 &arg2,constArg3 &arg3,constArg4 &arg4,constArg5

平台：交叉工具鏈arm-linux-gcc 4.3.2     linux2.6.28request_irq的作用是申請使用IRQ並註冊中斷處理常式。request_irq（）函數的原型如下：/* kernel/irq/manage.c */int request_irq(unsigned int irq,irqreturn_t (*handler)(int, void *, struct pt_regs *),unsigned long irqflags, const char

Java String對中文長度的計算問題今天在農行測試系統，碰到個很噁心的問題。我通過socket發到銀行伺服器的報文，總是後面少了幾位，銀行截取字串是按照我在報文頭傳過去的報文總長度計算的。然後懷疑我發過去的報文長度計算不對。但是這個是一個很簡單的string.length()Function Compute出來的長度，應該不會有錯。繼續找原因，發現是Java和銀行端程式對於中文的長度計算演算法不同，造成這種錯誤。如果一個中文字串：  銀行Java中如果這樣計算長度:String str =

我們在用VC6.0的時候可能會遇到如下的問題：LINK : LNK6004: Debug/aoe.exe not found or not built by the last incremental link; performing full link一句話說：此問題是微軟clean工程功能的bug。我的程式是VC6.0下編的，LINK : LNK6004: Debug/aoe.exe not found or not built by the last incremental link;

 poj2823_Sliding WindowCrawling in process...Crawling failedTime Limit:12000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64u       DescriptionAn array of size n ≤ 106 is given to you. There is a sliding window of size k which is

Find the minimumTime Limit: 2 Sec  Memory Limit: 128 MBSubmit: 90  Solved: 22[Submit][Status][Web Board]DescriptionGiven an integer array of size N, we define two kind of operators:1. Add(L,R,W) : adding an integer W to every element in subarray[L,R]

Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30727 Accepted: 9174DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There

                                                    Candy                                 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionLazyChild is a lazy child who likes candy very much.

步驟如下：#tar zxf uboot1.26_FORLINX_6410.tgz  –C  /home/FOLINX_SHARE/uboot1.1.6_256M      解壓，解壓到/home/FOLINX_SHARE/uboot1.1.6_256M目錄下#cd  /home/FOLINX_SHARE/uboot1.1.6_256M                進入/home/FOLINX_SHARE/uboot1.1.6_256M目錄  移植的原因：由於OK6410所用的網卡是DM9000