keil 使用筆記:在Memory窗口上輸入address_type:address才能看到正確地址的變量debug～perfermance analyzer加入要察看的模塊名稱，然后view～perfermance analyzer window 可以察看各個模塊運行時間①Display address_type:address B:Bit address C:Code Memory Bx:Code Bank D D：80H 命令可以查看特殊寄存器 data D I：0 命令可以查看內部RAM數據iData； D X：0 命令可以查看外部RAM數據xData； ②R1 //顯示R1 register ~R1 //顯示變量R1 R1 = R7 //對寄存器Rx操作R1 = --R7 R1 = 0x20 ③main //顯示main()的開始地址d main //顯示main()的代碼④向RAM.ROM中寫數據Enter data_type address_type:address expr,expr.... data_type:int char double float long E char data:0x20 1,2,3,4 //向data區0x20開始的地址寫1,2,3,4 變量放在RAM的30H，要把定義放在main前面!另外特別注意，內部RAM通常供C程序存放中間變量等，所以一定要看看編譯后的程序中是否存在存儲單元沖突的情況，比如如果程序中 使用了別的寄存器組的話，08-1FH單元就不能用了unsigned long data i _at_ 0x30
上傳時間： 2013-11-05
上傳用戶：dongqiangqiang
All inputs of the C16x family have Schmitt-Trigger input characteristics. These Schmitt-Triggers are intended to always provide proper internal low and high levels, even if anundefined voltage level (between TTL-VIL and TTL-VIH) is externally applied to the pin.The hysteresis of these inputs, however, is very small, and can not be properly used in anapplication to suppress signal noise, and to shape slow rising/falling input transitions.Thus, it must be taken care that rising/falling input signals pass the undefined area of theTTL-specification between VIL and VIH with a sufficient rise/fall time, as generally usualand specified for TTL components (e.g. 74LS series: gates 1V/us, clock inputs 20V/us).The effect of the implemented Schmitt-Trigger is that even if the input signal remains inthe undefined area, well defined low/high levels are generated internally. Note that allinput signals are evaluated at specific sample points (depending on the input and theperipheral function connected to it), at that signal transitions are detected if twoconsecutive samples show different levels. Thus, only the current level of an input signalat these sample points is relevant, that means, the necessary rise/fall times of the inputsignal is only dependant on the sample rate, that is the distance in time between twoconsecutive evaluation time points. If an input signal, for instance, is sampled throughsoftware every 10us, it is irrelevant, which input level would be seen between thesamples. Thus, it would be allowable for the signal to take 10us to pass through theundefined area. Due to the sample rate of 10us, it is assured that only one sample canoccur while the signal is within the undefined area, and no incorrect transition will bedetected. For inputs which are connected to a peripheral function, e.g. capture inputs, thesample rate is determined by the clock cycle of the peripheral unit. In the case of theCAPCOM unit this means a sample rate of 400ns @ 20MHz CPU clock. This requiresinput signals to pass through the undefined area within these 400ns in order to avoidmultiple capture events.For input signals, which do not provide the required rise/fall times, external circuitry mustbe used to shape the signal transitions.In the attached diagram, the effect of the sample rate is shown. The numbers 1 to 5 in thediagram represent possible sample points. Waveform a) shows the result if the inputsignal transition time through the undefined TTL-level area is less than the time distancebetween the sample points (sampling at 1, 2, 3, and 4). Waveform b) can be the result ifthe sampling is performed more than once within the undefined area (sampling at 1, 2, 5,3, and 4).Sample points:1. Evaluation of the signal clearly results in a low level2. Either a low or a high level can be sampled here. If low is sampled, no transition willbe detected. If the sample results in a high level, a transition is detected, and anappropriate action (e.g. capture) might take place.3. Evaluation here clearly results in a high level. If the previous sample 2) had alreadydetected a high, there is no change. If the previous sample 2) showed a low, atransition from low to high is detected now.
上傳時間： 2013-10-23
上傳用戶：copu
TKS仿真器B系列快速入門
上傳時間： 2013-10-31
上傳用戶：aix008
一個簡單好用的B+樹算法實現
上傳時間： 2015-01-04
上傳用戶：縹緲
一個用Basic實現的B-Tree算法
上傳時間： 2013-12-30
上傳用戶：ccclll
一個用Java applet實現的B-Tree算法
上傳時間： 2013-12-25
上傳用戶：qiao8960
用C++實現的B-Tree算法
上傳時間： 2014-01-20
上傳用戶：jiahao131
用Borland C寫的B-Tree算法
上傳時間： 2014-12-05
上傳用戶：xzt
java 版B+樹程序
上傳時間： 2015-01-06
上傳用戶：chenjjer
里面有相應的hpunix(HP-UX hpl1000 B.11.00 U 9000/800 (tb)),linux(Red Hat Linux release 9 Kernel 2.4.20-8),windows的頭文件、庫文件，還有相應的demo程序
標簽： release hpunix Kernel HP-UX
上傳時間： 2015-01-06
上傳用戶：cursor
