| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | Robust FIFO |
> I am needing a to write a fifo buffer of dynamic size > that can handle interrupts at ANY point during execution. > This is for an embedded microprocessor application and I > can't work out how to make the fifo robust enough to > handle the interrupts. Other than "embedded microprocessor application", you've not really given enough detail. The interrupt environment varies quite a lot from one architecture to another. Then problem you're going to run into is "dynamic size", however. If you have a fixed memory pool size, you'll do fine - if you have to involve operating system support, well.. that's another matter entirely. Have you considered something like "clists", the UNIX paradigm used to handle character device I/O? Basically, it involves arrays or blocks of data which are chained together (the exact algorithm doesn't matter), but the idea is that this form input and output queues. However, these are still allocated within a fixed (but shared) pool of memory and are preallocated up-front. --- MaltEd/2 1.0.b6* Origin: Unique Computing Pty Limited (3:632/348) SEEN-BY: 50/99 620/243 623/630 632/103 107 271 348 360 601 635/503 544 728 SEEN-BY: 639/252 711/409 410 413 430 808 809 932 934 712/515 713/317 714/906 SEEN-BY: 800/1 @PATH: 632/348 360 50/99 711/808 934 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.