Dynamic C® for Rabbit 2000 & 3000
Current version 9.62 of Dynamic C comes bundled with the following libraries:
FAT File System
Library Encryption Executable
µC/OS-II Real-time Kernel
Modbus TCP
Point-to-Point Protocol
RabbitWeb
Simple Network Management Protocol (SNMP)
Features in Dynamic C Version 9.XX
* Execution Tracing - Traces code execution and stores the trace information on the host PC. Execution can be traced by any combination of function call, C statement or user inserted trace points. Results are displayed in the Trace window.
* Symbolic Stack Tracing - Shows the function call path of the program at each single step or breakpoint when the program is stopped. Values and names of stack auto variables and arguments are also displayed.
* Enhanced Watch Expressions - structs can now be displayed as a tree structure simply by entering the struct name as a watch expression. struct members no longer need to be added separately to the watch expression list.
* Persistent Breakpoints - Breakpoint information is now retained when switching between edit mode and debug mode and when a file is closed and re-opened. Breakpoints may be set while in edit mode also.
* Attach to a Running Target - Debug mode can be entered without recompiling and reloading the program if the program isn't edited. This helps debugging if target communication is lost due to a target program crash.
* Enhanced Memory Dumps - Changed data in the Memory Dump window is highlighted in reverse video or in customizable colors every time you single step in either C or assembly to better visualize changes.
* TCP/IP Improvements - Reduced TCP/IP root memory usage and increased TCP/IP speed.
* SMTP AUTH - added to support email servers that require authentication.
* Display Target Information While Compiling - information about target type, CPU type and speed, and memory configuration is now displayed when compiling and downloading a program.
* Dynamic Buffer Allocation - An API for dynamic allocation of root and extended memory was added. This makes it easier to implement algorithms such as linked lists. The allocation is implemented with pools of like-sized objects to prevent heap fragmentation. Care must still be taken by the programmer to avoid heap exhaustion.
For more information on and a free download Dynamic C Verion 9 | |
|
|
|
|
