Important changes to repositories hosted on mbed.com
Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.
To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.
It is also possible to export all your personal repositories from the account settings page.
Fork of MODSERIAL by
RESIZE.cpp@36:a2ceec937db7, 2014-12-11 (annotated)
- Committer:
- BlazeX
- Date:
- Thu Dec 11 05:25:58 2014 +0000
- Revision:
- 36:a2ceec937db7
- Parent:
- 27:9c93ce7cb9d8
- Child:
- 37:31db07ebcb68
downSizeBuffer >= <= fix
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
AjK | 0:eb2522b41db8 | 1 | /* |
AjK | 0:eb2522b41db8 | 2 | Copyright (c) 2010 Andy Kirkham |
AjK | 0:eb2522b41db8 | 3 | |
AjK | 0:eb2522b41db8 | 4 | Permission is hereby granted, free of charge, to any person obtaining a copy |
AjK | 0:eb2522b41db8 | 5 | of this software and associated documentation files (the "Software"), to deal |
AjK | 0:eb2522b41db8 | 6 | in the Software without restriction, including without limitation the rights |
AjK | 0:eb2522b41db8 | 7 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
AjK | 0:eb2522b41db8 | 8 | copies of the Software, and to permit persons to whom the Software is |
AjK | 0:eb2522b41db8 | 9 | furnished to do so, subject to the following conditions: |
AjK | 0:eb2522b41db8 | 10 | |
AjK | 0:eb2522b41db8 | 11 | The above copyright notice and this permission notice shall be included in |
AjK | 0:eb2522b41db8 | 12 | all copies or substantial portions of the Software. |
AjK | 0:eb2522b41db8 | 13 | |
AjK | 0:eb2522b41db8 | 14 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
AjK | 0:eb2522b41db8 | 15 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
AjK | 0:eb2522b41db8 | 16 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
AjK | 0:eb2522b41db8 | 17 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
AjK | 0:eb2522b41db8 | 18 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
AjK | 0:eb2522b41db8 | 19 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
AjK | 0:eb2522b41db8 | 20 | THE SOFTWARE. |
AjK | 0:eb2522b41db8 | 21 | */ |
AjK | 0:eb2522b41db8 | 22 | |
AjK | 0:eb2522b41db8 | 23 | #include "MODSERIAL.h" |
AjK | 0:eb2522b41db8 | 24 | #include "MACROS.h" |
AjK | 0:eb2522b41db8 | 25 | |
AjK | 0:eb2522b41db8 | 26 | namespace AjK { |
AjK | 0:eb2522b41db8 | 27 | |
AjK | 0:eb2522b41db8 | 28 | int |
AjK | 0:eb2522b41db8 | 29 | MODSERIAL::resizeBuffer(int size, IrqType type, bool memory_check) |
AjK | 0:eb2522b41db8 | 30 | { |
AjK | 0:eb2522b41db8 | 31 | int rval = Ok; |
AjK | 0:eb2522b41db8 | 32 | |
AjK | 0:eb2522b41db8 | 33 | // If the requested size is the same as the current size there's nothing to do, |
AjK | 0:eb2522b41db8 | 34 | // just continue to use the same buffer as it's fine as it is. |
AjK | 0:eb2522b41db8 | 35 | if (buffer_size[type] == size) return rval; |
AjK | 0:eb2522b41db8 | 36 | |
AjK | 0:eb2522b41db8 | 37 | // Make sure the ISR cannot use the buffers while we are manipulating them. |
Sissors | 27:9c93ce7cb9d8 | 38 | NVIC_DisableIRQ(_IRQ); |
AjK | 0:eb2522b41db8 | 39 | |
AjK | 0:eb2522b41db8 | 40 | // If the requested buffer size is larger than the current size, |
AjK | 0:eb2522b41db8 | 41 | // attempt to create a new buffer and use it. |
AjK | 0:eb2522b41db8 | 42 | if (buffer_size[type] < size) { |
AjK | 0:eb2522b41db8 | 43 | rval = upSizeBuffer(size, type, memory_check); |
AjK | 0:eb2522b41db8 | 44 | } |
AjK | 0:eb2522b41db8 | 45 | else if (buffer_size[type] > size) { |
AjK | 0:eb2522b41db8 | 46 | rval = downSizeBuffer(size, type, memory_check); |
AjK | 0:eb2522b41db8 | 47 | } |
AjK | 0:eb2522b41db8 | 48 | |
AjK | 0:eb2522b41db8 | 49 | // Start the ISR system again with the new buffers. |
Sissors | 27:9c93ce7cb9d8 | 50 | NVIC_EnableIRQ(_IRQ); |
AjK | 0:eb2522b41db8 | 51 | |
AjK | 0:eb2522b41db8 | 52 | return rval; |
AjK | 0:eb2522b41db8 | 53 | } |
AjK | 0:eb2522b41db8 | 54 | |
AjK | 0:eb2522b41db8 | 55 | int |
AjK | 0:eb2522b41db8 | 56 | MODSERIAL::downSizeBuffer(int size, IrqType type, bool memory_check) |
AjK | 0:eb2522b41db8 | 57 | { |
BlazeX | 36:a2ceec937db7 | 58 | if (size <= buffer_count[type]) { |
AjK | 0:eb2522b41db8 | 59 | return BufferOversize; |
AjK | 0:eb2522b41db8 | 60 | } |
AjK | 0:eb2522b41db8 | 61 | |
AjK | 0:eb2522b41db8 | 62 | char *s = (char *)malloc(size); |
AjK | 0:eb2522b41db8 | 63 | |
AjK | 0:eb2522b41db8 | 64 | if (s == (char *)NULL) { |
AjK | 0:eb2522b41db8 | 65 | if (memory_check) { |
AjK | 0:eb2522b41db8 | 66 | error("Failed to allocate memory for %s buffer", type == TxIrq ? "TX" : "RX"); |
AjK | 0:eb2522b41db8 | 67 | } |
AjK | 0:eb2522b41db8 | 68 | return NoMemory; |
AjK | 0:eb2522b41db8 | 69 | } |
AjK | 0:eb2522b41db8 | 70 | |
AjK | 0:eb2522b41db8 | 71 | int c, new_in = 0; |
AjK | 0:eb2522b41db8 | 72 | |
AjK | 0:eb2522b41db8 | 73 | do { |
AjK | 0:eb2522b41db8 | 74 | c = __getc(false); |
AjK | 0:eb2522b41db8 | 75 | if (c != -1) s[new_in++] = (char)c; |
AjK | 0:eb2522b41db8 | 76 | if (new_in >= size) new_in = 0; |
AjK | 0:eb2522b41db8 | 77 | } |
AjK | 0:eb2522b41db8 | 78 | while (c != -1); |
AjK | 0:eb2522b41db8 | 79 | |
AjK | 0:eb2522b41db8 | 80 | free((char *)buffer[type]); |
AjK | 0:eb2522b41db8 | 81 | buffer[type] = s; |
AjK | 0:eb2522b41db8 | 82 | buffer_in[type] = new_in; |
AjK | 0:eb2522b41db8 | 83 | buffer_out[type] = 0; |
AjK | 0:eb2522b41db8 | 84 | return Ok; |
AjK | 0:eb2522b41db8 | 85 | } |
AjK | 0:eb2522b41db8 | 86 | |
AjK | 0:eb2522b41db8 | 87 | int |
AjK | 0:eb2522b41db8 | 88 | MODSERIAL::upSizeBuffer(int size, IrqType type, bool memory_check) |
AjK | 0:eb2522b41db8 | 89 | { |
AjK | 0:eb2522b41db8 | 90 | char *s = (char *)malloc(size); |
AjK | 0:eb2522b41db8 | 91 | |
AjK | 0:eb2522b41db8 | 92 | if (s == (char *)NULL) { |
AjK | 0:eb2522b41db8 | 93 | if (memory_check) { |
AjK | 0:eb2522b41db8 | 94 | error("Failed to allocate memory for %s buffer", type == TxIrq ? "TX" : "RX"); |
AjK | 0:eb2522b41db8 | 95 | } |
AjK | 0:eb2522b41db8 | 96 | return NoMemory; |
AjK | 0:eb2522b41db8 | 97 | } |
AjK | 0:eb2522b41db8 | 98 | |
AjK | 0:eb2522b41db8 | 99 | if (buffer_count[type] == 0) { // Current buffer empty? |
AjK | 0:eb2522b41db8 | 100 | free((char *)buffer[type]); |
AjK | 0:eb2522b41db8 | 101 | buffer[type] = s; |
AjK | 0:eb2522b41db8 | 102 | buffer_in[type] = 0; |
AjK | 0:eb2522b41db8 | 103 | buffer_out[type] = 0; |
AjK | 0:eb2522b41db8 | 104 | } |
AjK | 0:eb2522b41db8 | 105 | else { // Copy the current contents into the new buffer. |
AjK | 0:eb2522b41db8 | 106 | int c, new_in = 0; |
AjK | 0:eb2522b41db8 | 107 | do { |
AjK | 0:eb2522b41db8 | 108 | c = __getc(false); |
AjK | 0:eb2522b41db8 | 109 | if (c != -1) s[new_in++] = (char)c; |
AjK | 0:eb2522b41db8 | 110 | if (new_in >= size) new_in = 0; // Shouldn't happen, but be sure. |
AjK | 0:eb2522b41db8 | 111 | } |
AjK | 0:eb2522b41db8 | 112 | while (c != -1); |
AjK | 0:eb2522b41db8 | 113 | free((char *)buffer[type]); |
AjK | 0:eb2522b41db8 | 114 | buffer[type] = s; |
AjK | 0:eb2522b41db8 | 115 | buffer_in[type] = new_in; |
AjK | 0:eb2522b41db8 | 116 | buffer_out[type] = 0; |
AjK | 0:eb2522b41db8 | 117 | } |
AjK | 0:eb2522b41db8 | 118 | |
AjK | 0:eb2522b41db8 | 119 | buffer_size[type] = size; |
AjK | 0:eb2522b41db8 | 120 | return Ok; |
AjK | 0:eb2522b41db8 | 121 | } |
AjK | 0:eb2522b41db8 | 122 | |
AjK | 0:eb2522b41db8 | 123 | }; // namespace AjK ends |