Host library for controlling a WiConnect enabled Wi-Fi module.

Dependents:   wiconnect-ota_example wiconnect-web_setup_example wiconnect-test-console wiconnect-tcp_server_example ... more

Committer:
dan_ackme
Date:
Wed Aug 13 04:41:04 2014 -0700
Revision:
16:7f1d6d359787
Parent:
1:6ec9998427ad
Child:
17:7268f365676b
updated documentation and copyright

Who changed what in which revision?

UserRevisionLine numberNew contents of line
dan_ackme 16:7f1d6d359787 1 /**
dan_ackme 16:7f1d6d359787 2 * ACKme WiConnect Host Library is licensed under the BSD licence:
dan_ackme 16:7f1d6d359787 3 *
dan_ackme 16:7f1d6d359787 4 * Copyright (c)2014 ACKme Networks.
dan_ackme 16:7f1d6d359787 5 * All rights reserved.
dan_ackme 16:7f1d6d359787 6 *
dan_ackme 16:7f1d6d359787 7 * Redistribution and use in source and binary forms, with or without modification,
dan_ackme 16:7f1d6d359787 8 * are permitted provided that the following conditions are met:
dan_ackme 16:7f1d6d359787 9 *
dan_ackme 16:7f1d6d359787 10 * 1. Redistributions of source code must retain the above copyright notice,
dan_ackme 16:7f1d6d359787 11 * this list of conditions and the following disclaimer.
dan_ackme 16:7f1d6d359787 12 * 2. Redistributions in binary form must reproduce the above copyright notice,
dan_ackme 16:7f1d6d359787 13 * this list of conditions and the following disclaimer in the documentation
dan_ackme 16:7f1d6d359787 14 * and/or other materials provided with the distribution.
dan_ackme 16:7f1d6d359787 15 * 3. The name of the author may not be used to endorse or promote products
dan_ackme 16:7f1d6d359787 16 * derived from this software without specific prior written permission.
dan_ackme 16:7f1d6d359787 17 *
dan_ackme 16:7f1d6d359787 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS AND ANY EXPRESS OR IMPLIED
dan_ackme 16:7f1d6d359787 19 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
dan_ackme 16:7f1d6d359787 20 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
dan_ackme 16:7f1d6d359787 21 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
dan_ackme 16:7f1d6d359787 22 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
dan_ackme 16:7f1d6d359787 23 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
dan_ackme 16:7f1d6d359787 24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
dan_ackme 16:7f1d6d359787 25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
dan_ackme 16:7f1d6d359787 26 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
dan_ackme 16:7f1d6d359787 27 * OF SUCH DAMAGE.
dan_ackme 0:ea85c4bb5e1f 28 */
dan_ackme 0:ea85c4bb5e1f 29
dan_ackme 0:ea85c4bb5e1f 30
dan_ackme 0:ea85c4bb5e1f 31 #include "Wiconnect.h"
dan_ackme 0:ea85c4bb5e1f 32 #include "types/FileList.h"
dan_ackme 0:ea85c4bb5e1f 33
dan_ackme 0:ea85c4bb5e1f 34
dan_ackme 0:ea85c4bb5e1f 35
dan_ackme 0:ea85c4bb5e1f 36 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 37 FileList::FileList(int bufferLen_, void *buffer_)
dan_ackme 0:ea85c4bb5e1f 38 {
dan_ackme 0:ea85c4bb5e1f 39 count = 0;
dan_ackme 0:ea85c4bb5e1f 40 listHead = listTail = NULL;
dan_ackme 0:ea85c4bb5e1f 41 buffer = (uint8_t*)buffer_;
dan_ackme 0:ea85c4bb5e1f 42 bufferPtr = buffer;
dan_ackme 0:ea85c4bb5e1f 43 bufferLen = bufferLen_;
dan_ackme 0:ea85c4bb5e1f 44 }
dan_ackme 0:ea85c4bb5e1f 45
dan_ackme 0:ea85c4bb5e1f 46 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 47 FileList::~FileList()
dan_ackme 0:ea85c4bb5e1f 48 {
dan_ackme 0:ea85c4bb5e1f 49 if(buffer == NULL)
dan_ackme 0:ea85c4bb5e1f 50 {
dan_ackme 0:ea85c4bb5e1f 51 File* result = listHead;
dan_ackme 0:ea85c4bb5e1f 52 while(result != NULL)
dan_ackme 0:ea85c4bb5e1f 53 {
dan_ackme 0:ea85c4bb5e1f 54 File* tmp = result;
dan_ackme 0:ea85c4bb5e1f 55 result = result->next;
dan_ackme 0:ea85c4bb5e1f 56 delete tmp;
dan_ackme 0:ea85c4bb5e1f 57 }
dan_ackme 0:ea85c4bb5e1f 58 }
dan_ackme 0:ea85c4bb5e1f 59 }
dan_ackme 0:ea85c4bb5e1f 60
dan_ackme 0:ea85c4bb5e1f 61 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 62 WiconnectResult FileList::add(const char *typeStr, const char *flagsStr, const char* sizeStr, const char *versionStr, const char *nameStr)
dan_ackme 0:ea85c4bb5e1f 63 {
dan_ackme 0:ea85c4bb5e1f 64 WiconnectResult result;
dan_ackme 0:ea85c4bb5e1f 65 File *res;
dan_ackme 0:ea85c4bb5e1f 66
dan_ackme 0:ea85c4bb5e1f 67 if(buffer == NULL)
dan_ackme 0:ea85c4bb5e1f 68 {
dan_ackme 0:ea85c4bb5e1f 69 res = new File();
dan_ackme 0:ea85c4bb5e1f 70 if(res == NULL)
dan_ackme 0:ea85c4bb5e1f 71 {
dan_ackme 0:ea85c4bb5e1f 72 return WICONNECT_NULL_BUFFER;
dan_ackme 0:ea85c4bb5e1f 73 }
dan_ackme 0:ea85c4bb5e1f 74 }
dan_ackme 0:ea85c4bb5e1f 75 else
dan_ackme 0:ea85c4bb5e1f 76 {
dan_ackme 0:ea85c4bb5e1f 77 if(bufferLen < sizeof(File))
dan_ackme 0:ea85c4bb5e1f 78 {
dan_ackme 0:ea85c4bb5e1f 79 return WICONNECT_OVERFLOW;
dan_ackme 0:ea85c4bb5e1f 80 }
dan_ackme 0:ea85c4bb5e1f 81 res = (File*)bufferPtr;
dan_ackme 0:ea85c4bb5e1f 82 memset(res, 0, sizeof(File));
dan_ackme 0:ea85c4bb5e1f 83 bufferLen -= sizeof(File);
dan_ackme 0:ea85c4bb5e1f 84 bufferPtr += sizeof(File);
dan_ackme 0:ea85c4bb5e1f 85 }
dan_ackme 0:ea85c4bb5e1f 86
dan_ackme 0:ea85c4bb5e1f 87 if(WICONNECT_FAILED(result, res->initWithListing(typeStr, flagsStr, sizeStr, versionStr, nameStr)))
dan_ackme 0:ea85c4bb5e1f 88 {
dan_ackme 0:ea85c4bb5e1f 89 if(buffer == NULL)
dan_ackme 0:ea85c4bb5e1f 90 {
dan_ackme 0:ea85c4bb5e1f 91 delete res;
dan_ackme 0:ea85c4bb5e1f 92 }
dan_ackme 0:ea85c4bb5e1f 93 }
dan_ackme 0:ea85c4bb5e1f 94 else
dan_ackme 0:ea85c4bb5e1f 95 {
dan_ackme 0:ea85c4bb5e1f 96 if(listHead == NULL)
dan_ackme 0:ea85c4bb5e1f 97 {
dan_ackme 0:ea85c4bb5e1f 98 listHead = listTail = res;
dan_ackme 0:ea85c4bb5e1f 99 }
dan_ackme 0:ea85c4bb5e1f 100 else
dan_ackme 0:ea85c4bb5e1f 101 {
dan_ackme 0:ea85c4bb5e1f 102 res->previous = listTail;
dan_ackme 0:ea85c4bb5e1f 103 listTail->next = res;
dan_ackme 0:ea85c4bb5e1f 104 listTail = res;
dan_ackme 0:ea85c4bb5e1f 105 }
dan_ackme 0:ea85c4bb5e1f 106 ++count;
dan_ackme 0:ea85c4bb5e1f 107 }
dan_ackme 0:ea85c4bb5e1f 108
dan_ackme 0:ea85c4bb5e1f 109 return result;
dan_ackme 0:ea85c4bb5e1f 110 }
dan_ackme 0:ea85c4bb5e1f 111
dan_ackme 0:ea85c4bb5e1f 112 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 113 const File* FileList::getListHead() const
dan_ackme 0:ea85c4bb5e1f 114 {
dan_ackme 0:ea85c4bb5e1f 115 return listHead;
dan_ackme 0:ea85c4bb5e1f 116 }
dan_ackme 0:ea85c4bb5e1f 117
dan_ackme 0:ea85c4bb5e1f 118 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 119 int FileList::getCount() const
dan_ackme 0:ea85c4bb5e1f 120 {
dan_ackme 0:ea85c4bb5e1f 121 return count;
dan_ackme 0:ea85c4bb5e1f 122 }
dan_ackme 0:ea85c4bb5e1f 123
dan_ackme 0:ea85c4bb5e1f 124 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 125 const File* FileList::getResult(int i) const
dan_ackme 0:ea85c4bb5e1f 126 {
dan_ackme 0:ea85c4bb5e1f 127 if(i >= count)
dan_ackme 0:ea85c4bb5e1f 128 return NULL;
dan_ackme 0:ea85c4bb5e1f 129
dan_ackme 0:ea85c4bb5e1f 130 File* result = listHead;
dan_ackme 0:ea85c4bb5e1f 131 while(i-- != 0)
dan_ackme 0:ea85c4bb5e1f 132 result = result->next;
dan_ackme 0:ea85c4bb5e1f 133
dan_ackme 0:ea85c4bb5e1f 134 return result;
dan_ackme 0:ea85c4bb5e1f 135 }
dan_ackme 0:ea85c4bb5e1f 136
dan_ackme 0:ea85c4bb5e1f 137 /*************************************************************************************************/
dan_ackme 0:ea85c4bb5e1f 138 const File* FileList::operator [](int i) const
dan_ackme 0:ea85c4bb5e1f 139 {
dan_ackme 0:ea85c4bb5e1f 140 return getResult(i);
dan_ackme 0:ea85c4bb5e1f 141 }
dan_ackme 0:ea85c4bb5e1f 142