examples.h

Go to the documentation of this file.

#include <windows.h>
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>

#include "libusbk.h"

#ifndef __EXAMPLE_H_
#define __EXAMPLE_H_


#define EXAMPLES_USE_BENCHMARK_CONFIGURE 1

#ifndef EXAMPLE_VID
#define EXAMPLE_VID 0x04D8
#endif

#ifndef EXAMPLE_PID
#define EXAMPLE_PID 0xFA2E
#endif

typedef enum _BM_COMMAND
{
    BM_COMMAND_SET_TEST = 0x0E,
    BM_COMMAND_GET_TEST = 0x0F,
    BM_COMMAND_SET_VBUF = 0x10,
    BM_COMMAND_GET_VBUF = 0x11,
} BM_COMMAND;

typedef enum _BM_TEST_TYPE
{
    BM_TEST_TYPE_NONE   = 0x00,
    BM_TEST_TYPE_READ   = 0x01,
    BM_TEST_TYPE_WRITE  = 0x02,
    BM_TEST_TYPE_LOOP   = BM_TEST_TYPE_READ | BM_TEST_TYPE_WRITE,
} BM_TEST_TYPE, *PBM_TEST_TYPE;


BOOL Examples_GetTestDevice(KLST_HANDLE* DeviceList,
                            KLST_DEVINFO_HANDLE* DeviceInfo,
                            int argc,
                            char* argv[]);
BOOL Examples_GetTestDeviceEx(KLST_HANDLE* DeviceList,
                              KLST_DEVINFO_HANDLE* DeviceInfo,
                              int argc,
                              char* argv[],
                              KLST_FLAG Flags);

BOOL Bench_Configure(KUSB_HANDLE UsbHandle,
                     BM_COMMAND Command,
                     UCHAR InterfaceNumber,
                     PKUSB_DRIVER_API DriverAPI,
                     PBM_TEST_TYPE TestType);

BOOL Examples_GetArgVal(int argc, char* argv[], LPCSTR argName, PUINT argValue, BOOL isHex);
BOOL Examples_GetArgStr(int argc, char* argv[], LPCSTR argName, LPSTR argValue, PUINT argValLength);

typedef struct _DATA_COUNTER_STATS
{
    LARGE_INTEGER Freq;
    LARGE_INTEGER Start;
    LARGE_INTEGER Stop;

    LONGLONG TotalBytes;
    double Bps;
    double dFreq;
    double Duration;

} DATA_COUNTER_STATS, *PDATA_COUNTER_STATS;

#define mDcs_Init(mDataCounterStats) do {                                                                       \
        memset((mDataCounterStats),0,sizeof(DATA_COUNTER_STATS));                                                   \
        QueryPerformanceFrequency(&((mDataCounterStats)->Freq));                                                    \
        (mDataCounterStats)->dFreq = 1.0/(double)(mDataCounterStats)->Freq.QuadPart;                                \
        QueryPerformanceCounter(&((mDataCounterStats)->Start));                                                     \
    }while(0)

#define mDcs_MarkStop(mDataCounterStats,mAddTransferLength) do {                                                \
        QueryPerformanceCounter(&((mDataCounterStats)->Stop));                                                      \
        (mDataCounterStats)->TotalBytes+=(LONG)(mAddTransferLength);                                                \
        (mDataCounterStats)->Duration =                                                                             \
                ((mDataCounterStats)->dFreq) *                                                                          \
                ((double) ((mDataCounterStats)->Stop.QuadPart - (mDataCounterStats)->Start.QuadPart));                  \
        if ((mDataCounterStats)->Duration != 0.0)                                                                   \
            (mDataCounterStats)->Bps = ((double)(mDataCounterStats)->TotalBytes) / (mDataCounterStats)->Duration;   \
    }while(0)


#endif



#ifndef UTLIST_H
#define UTLIST_H

/*
Copyright (c) 2007-2010, Troy D. Hanson   http://uthash.sourceforge.net
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

/******************************************************************************
 * doubly linked list macros (non-circular)                                   *
 *****************************************************************************/


#define DL_PREPEND(head,add)                                                                   \
    do {                                                                                           \
        (add)->next = head;                                                                           \
        if (head) {                                                                                   \
            (add)->prev = (head)->prev;                                                                 \
            (head)->prev = (add);                                                                       \
        } else {                                                                                      \
            (add)->prev = (add);                                                                        \
        }                                                                                             \
        (head) = (add);                                                                               \
    } while (0)


#define DL_APPEND(head,add)                                                                    \
    do {                                                                                           \
        if (head) {                                                                                  \
            (add)->prev = (head)->prev;                                                              \
            (head)->prev->next = (add);                                                              \
            (head)->prev = (add);                                                                    \
            (add)->next = NULL;                                                                      \
        } else {                                                                                     \
            (head)=(add);                                                                            \
            (head)->prev = (head);                                                                   \
            (head)->next = NULL;                                                                     \
        }                                                                                            \
    } while (0);


#define DL_DELETE(head,del)                                                                    \
    do {                                                                                           \
        if ((del)->prev == (del)) {                                                                  \
            (head)=NULL;                                                                             \
        } else if ((del)==(head)) {                                                                  \
            (del)->next->prev = (del)->prev;                                                         \
            (head) = (del)->next;                                                                    \
        } else {                                                                                     \
            (del)->prev->next = (del)->next;                                                         \
            if ((del)->next) {                                                                       \
                (del)->next->prev = (del)->prev;                                                     \
            } else {                                                                                 \
                (head)->prev = (del)->prev;                                                          \
            }                                                                                        \
        }                                                                                            \
    } while (0);


#define DL_FOREACH(head,el)                                                                    \
    for(el=head;el;el=el->next)


#define DL_FOREACH_SAFE(head,el,tmp)                                                           \
    for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp)

/* these are identical to their singly-linked list counterparts */


#define DL_SEARCH_SCALAR(head,out,field,val)                                                   \
    do {                                                                                           \
        DL_FOREACH(head,out) {                                                                     \
            if ((out)->field == (val)) break;                                                        \
        }                                                                                          \
    } while(0)


#define DL_SEARCH(head,out,elt,cmp)                                                            \
    do {                                                                                           \
        DL_FOREACH(head,out) {                                                                     \
            if ((cmp(out,elt))==0) break;                                                            \
        }                                                                                          \
    } while(0)

#endif /* UTLIST_H */