Suga koubou / IM920

Interplan IM920 library, 920MHz module

Dependents:   IM920_sample IM920_SDlog IM920_sample IM920_sample3 ... more

IM920 ライブラリ

データモード、低速、長距離　の設定で通信するライブラリです。

920MHz無線モジュール

http://www.interplan.co.jp/images/contents/solution/im920.png IM920 （インタープラン製）

  • mbedとモジュールとは、シリアル（TX,RX）、BUSY、RESET端子を接続します。
  • モジュールはあらかじめ、コマンドでノード番号などを設定しておきます。

NECの920MHz近距離無線モジュールもおすすめ

CBuffer.h@0:d3ab05ed8142, 2014-12-26 (annotated)

Committer:
okini3939
Date:
Fri Dec 26 15:35:20 2014 +0000
Revision:
0:d3ab05ed8142
Child:
1:81b2fd407327
1st tiny build.;

Who changed what in which revision?

UserRevisionLine numberNew contents of line
okini3939 0:d3ab05ed8142 1 /* Copyright (C) 2012 mbed.org, MIT License
okini3939 0:d3ab05ed8142 2 *
okini3939 0:d3ab05ed8142 3 * Permission is hereby granted, free of charge, to any person obtaining a copy of this software
okini3939 0:d3ab05ed8142 4 * and associated documentation files (the "Software"), to deal in the Software without restriction,
okini3939 0:d3ab05ed8142 5 * including without limitation the rights to use, copy, modify, merge, publish, distribute,
okini3939 0:d3ab05ed8142 6 * sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
okini3939 0:d3ab05ed8142 7 * furnished to do so, subject to the following conditions:
okini3939 0:d3ab05ed8142 8 *
okini3939 0:d3ab05ed8142 9 * The above copyright notice and this permission notice shall be included in all copies or
okini3939 0:d3ab05ed8142 10 * substantial portions of the Software.
okini3939 0:d3ab05ed8142 11 *
okini3939 0:d3ab05ed8142 12 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
okini3939 0:d3ab05ed8142 13 * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
okini3939 0:d3ab05ed8142 14 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
okini3939 0:d3ab05ed8142 15 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
okini3939 0:d3ab05ed8142 16 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
okini3939 0:d3ab05ed8142 17 */
okini3939 0:d3ab05ed8142 18
okini3939 0:d3ab05ed8142 19 #ifndef CIRCBUFFER_H_
okini3939 0:d3ab05ed8142 20 #define CIRCBUFFER_H_
okini3939 0:d3ab05ed8142 21
okini3939 0:d3ab05ed8142 22 template <class T>
okini3939 0:d3ab05ed8142 23 class CircBuffer {
okini3939 0:d3ab05ed8142 24 public:
okini3939 0:d3ab05ed8142 25 CircBuffer(int length, void *addr = NULL) {
okini3939 0:d3ab05ed8142 26 write = 0;
okini3939 0:d3ab05ed8142 27 read = 0;
okini3939 0:d3ab05ed8142 28 size = length + 1;
okini3939 0:d3ab05ed8142 29 if (addr) {
okini3939 0:d3ab05ed8142 30 buf = (T *)addr;
okini3939 0:d3ab05ed8142 31 } else {
okini3939 0:d3ab05ed8142 32 buf = (T *)malloc(size * sizeof(T));
okini3939 0:d3ab05ed8142 33 }
okini3939 0:d3ab05ed8142 34 if (buf == NULL)
okini3939 0:d3ab05ed8142 35 error("Can't allocate memory");
okini3939 0:d3ab05ed8142 36 };
okini3939 0:d3ab05ed8142 37
okini3939 0:d3ab05ed8142 38 bool isFull() {
okini3939 0:d3ab05ed8142 39 return (((write + 1) % size) == read);
okini3939 0:d3ab05ed8142 40 };
okini3939 0:d3ab05ed8142 41
okini3939 0:d3ab05ed8142 42 bool isEmpty() {
okini3939 0:d3ab05ed8142 43 return (read == write);
okini3939 0:d3ab05ed8142 44 };
okini3939 0:d3ab05ed8142 45
okini3939 0:d3ab05ed8142 46 void queue(T k) {
okini3939 0:d3ab05ed8142 47 if (isFull()) {
okini3939 0:d3ab05ed8142 48 // read++;
okini3939 0:d3ab05ed8142 49 // read %= size;
okini3939 0:d3ab05ed8142 50 return;
okini3939 0:d3ab05ed8142 51 }
okini3939 0:d3ab05ed8142 52 buf[write++] = k;
okini3939 0:d3ab05ed8142 53 write %= size;
okini3939 0:d3ab05ed8142 54 }
okini3939 0:d3ab05ed8142 55
okini3939 0:d3ab05ed8142 56 void flush() {
okini3939 0:d3ab05ed8142 57 read = 0;
okini3939 0:d3ab05ed8142 58 write = 0;
okini3939 0:d3ab05ed8142 59 }
okini3939 0:d3ab05ed8142 60
okini3939 0:d3ab05ed8142 61
okini3939 0:d3ab05ed8142 62 uint32_t available() {
okini3939 0:d3ab05ed8142 63 return (write >= read) ? write - read : size - read + write;
okini3939 0:d3ab05ed8142 64 };
okini3939 0:d3ab05ed8142 65
okini3939 0:d3ab05ed8142 66 bool dequeue(T * c) {
okini3939 0:d3ab05ed8142 67 bool empty = isEmpty();
okini3939 0:d3ab05ed8142 68 if (!empty) {
okini3939 0:d3ab05ed8142 69 *c = buf[read++];
okini3939 0:d3ab05ed8142 70 read %= size;
okini3939 0:d3ab05ed8142 71 }
okini3939 0:d3ab05ed8142 72 return(!empty);
okini3939 0:d3ab05ed8142 73 };
okini3939 0:d3ab05ed8142 74
okini3939 0:d3ab05ed8142 75 private:
okini3939 0:d3ab05ed8142 76 volatile uint32_t write;
okini3939 0:d3ab05ed8142 77 volatile uint32_t read;
okini3939 0:d3ab05ed8142 78 uint32_t size;
okini3939 0:d3ab05ed8142 79 T * buf;
okini3939 0:d3ab05ed8142 80 };
okini3939 0:d3ab05ed8142 81
okini3939 0:d3ab05ed8142 82 #endif