summaryrefslogtreecommitdiffstats
path: root/nci/jni/DataQueue.cpp
diff options
context:
space:
mode:
authorSteve Kondik <shade@chemlab.org>2012-11-18 22:49:42 -0800
committerRicardo Cerqueira <cyanogenmod@cerqueira.org>2012-11-21 21:08:23 +0000
commit6a645b3241be2ba27b2b38f0cd68ad7e6fafafa5 (patch)
tree4db310cf6ff3ab0dbb5407ffa13235b1d834be3a /nci/jni/DataQueue.cpp
parent3d402b5b2bd83007c5bffa4d40977e3314da4a91 (diff)
parenteba57c26732d3313befb574af85770452d841b87 (diff)
downloadpackages_apps_nfc-6a645b3241be2ba27b2b38f0cd68ad7e6fafafa5.zip
packages_apps_nfc-6a645b3241be2ba27b2b38f0cd68ad7e6fafafa5.tar.gz
packages_apps_nfc-6a645b3241be2ba27b2b38f0cd68ad7e6fafafa5.tar.bz2
Merge branch 'jb-mr1-release' of https://android.googlesource.com/platform/packages/apps/Nfc into HEAD
Conflicts: nxp/jni/com_android_nfc_NativeNfcManager.cpp Change-Id: Ic84af6ad1cda79984f40e9fc464d2cbaa994b89a
Diffstat (limited to 'nci/jni/DataQueue.cpp')
-rw-r--r--nci/jni/DataQueue.cpp155
1 files changed, 155 insertions, 0 deletions
diff --git a/nci/jni/DataQueue.cpp b/nci/jni/DataQueue.cpp
new file mode 100644
index 0000000..caa2575
--- /dev/null
+++ b/nci/jni/DataQueue.cpp
@@ -0,0 +1,155 @@
+/*
+ * Copyright (C) 2012 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ * Store data bytes in a variable-size queue.
+ */
+
+#include "DataQueue.h"
+
+
+/*******************************************************************************
+**
+** Function: DataQueue
+**
+** Description: Initialize member variables.
+**
+** Returns: None.
+**
+*******************************************************************************/
+DataQueue::DataQueue ()
+{
+}
+
+
+/*******************************************************************************
+**
+** Function: ~DataQueue
+**
+** Description: Release all resources.
+**
+** Returns: None.
+**
+*******************************************************************************/
+DataQueue::~DataQueue ()
+{
+ mMutex.lock ();
+ while (mQueue.empty() == false)
+ {
+ tHeader* header = mQueue.front ();
+ mQueue.pop_front ();
+ free (header);
+ }
+ mMutex.unlock ();
+}
+
+
+bool DataQueue::isEmpty()
+{
+ mMutex.lock ();
+ bool retval = mQueue.empty();
+ mMutex.unlock ();
+ return retval;
+}
+
+
+/*******************************************************************************
+**
+** Function: enqueue
+**
+** Description: Append data to the queue.
+** data: array of bytes
+** dataLen: length of the data.
+**
+** Returns: True if ok.
+**
+*******************************************************************************/
+bool DataQueue::enqueue (UINT8* data, UINT16 dataLen)
+{
+ if ((data == NULL) || (dataLen==0))
+ return false;
+
+ mMutex.lock ();
+
+ bool retval = false;
+ tHeader* header = (tHeader*) malloc (sizeof(tHeader) + dataLen);
+
+ if (header)
+ {
+ memset (header, 0, sizeof(tHeader));
+ header->mDataLen = dataLen;
+ memcpy (header+1, data, dataLen);
+
+ mQueue.push_back (header);
+
+ retval = true;
+ }
+ else
+ {
+ ALOGE ("DataQueue::enqueue: out of memory ?????");
+ }
+ mMutex.unlock ();
+ return retval;
+}
+
+
+/*******************************************************************************
+**
+** Function: dequeue
+**
+** Description: Retrieve and remove data from the front of the queue.
+** buffer: array to store the data.
+** bufferMaxLen: maximum size of the buffer.
+** actualLen: actual length of the data.
+**
+** Returns: True if ok.
+**
+*******************************************************************************/
+bool DataQueue::dequeue (UINT8* buffer, UINT16 bufferMaxLen, UINT16& actualLen)
+{
+ mMutex.lock ();
+
+ tHeader* header = mQueue.front ();
+ bool retval = false;
+
+ if (header && buffer && (bufferMaxLen>0))
+ {
+ if (header->mDataLen <= bufferMaxLen)
+ {
+ //caller's buffer is big enough to store all data
+ actualLen = header->mDataLen;
+ char* src = (char*)(header) + sizeof(tHeader) + header->mOffset;
+ memcpy (buffer, src, actualLen);
+
+ mQueue.pop_front ();
+ free (header);
+ }
+ else
+ {
+ //caller's buffer is too small
+ actualLen = bufferMaxLen;
+ char* src = (char*)(header) + sizeof(tHeader) + header->mOffset;
+ memcpy (buffer, src, actualLen);
+ //adjust offset so the next dequeue() will get the remainder
+ header->mDataLen -= actualLen;
+ header->mOffset += actualLen;
+ }
+ retval = true;
+ }
+ mMutex.unlock ();
+ return retval;
+}
+