├── .gitattributes ├── .gitignore ├── LICENSE.md ├── README.md ├── XInputTest.sln └── XInputTest ├── CXBOXController.cpp ├── CXBOXController.h ├── XInputTest.rc ├── XInputTest.vcxproj ├── app.ico ├── app.ico.credits.txt ├── iqsort.c ├── iqsort.h ├── main.cpp ├── qsp.c ├── qsp.h ├── resource.h └── stdlib2.h /.gitattributes: -------------------------------------------------------------------------------- 1 | ############################################################################### 2 | # Set default behavior to automatically normalize line endings. 3 | ############################################################################### 4 | * text=auto 5 | 6 | ############################################################################### 7 | # Set default behavior for command prompt diff. 8 | # 9 | # This is need for earlier builds of msysgit that does not have it on by 10 | # default for csharp files. 11 | # Note: This is only used by command line 12 | ############################################################################### 13 | #*.cs diff=csharp 14 | 15 | ############################################################################### 16 | # Set the merge driver for project and solution files 17 | # 18 | # Merging from the command prompt will add diff markers to the files if there 19 | # are conflicts (Merging from VS is not affected by the settings below, in VS 20 | # the diff markers are never inserted). Diff markers may cause the following 21 | # file extensions to fail to load in VS. An alternative would be to treat 22 | # these files as binary and thus will always conflict and require user 23 | # intervention with every merge. To do so, just uncomment the entries below 24 | ############################################################################### 25 | #*.sln merge=binary 26 | #*.csproj merge=binary 27 | #*.vbproj merge=binary 28 | #*.vcxproj merge=binary 29 | #*.vcproj merge=binary 30 | #*.dbproj merge=binary 31 | #*.fsproj merge=binary 32 | #*.lsproj merge=binary 33 | #*.wixproj merge=binary 34 | #*.modelproj merge=binary 35 | #*.sqlproj merge=binary 36 | #*.wwaproj merge=binary 37 | 38 | ############################################################################### 39 | # behavior for image files 40 | # 41 | # image files are treated as binary by default. 42 | ############################################################################### 43 | #*.jpg binary 44 | #*.png binary 45 | #*.gif binary 46 | 47 | ############################################################################### 48 | # diff behavior for common document formats 49 | # 50 | # Convert binary document formats to text before diffing them. This feature 51 | # is only available from the command line. Turn it on by uncommenting the 52 | # entries below. 53 | ############################################################################### 54 | #*.doc diff=astextplain 55 | #*.DOC diff=astextplain 56 | #*.docx diff=astextplain 57 | #*.DOCX diff=astextplain 58 | #*.dot diff=astextplain 59 | #*.DOT diff=astextplain 60 | #*.pdf diff=astextplain 61 | #*.PDF diff=astextplain 62 | #*.rtf diff=astextplain 63 | #*.RTF diff=astextplain 64 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | ## Ignore Visual Studio temporary files, build results, and 2 | ## files generated by popular Visual Studio add-ons. 3 | 4 | # User-specific files 5 | *.suo 6 | *.user 7 | *.sln.docstates 8 | 9 | # Build results 10 | [Dd]ebug/ 11 | [Dd]ebugPublic/ 12 | [Rr]elease/ 13 | x64/ 14 | build/ 15 | bld/ 16 | [Bb]in/ 17 | [Oo]bj/ 18 | 19 | # Roslyn cache directories 20 | *.ide/ 21 | 22 | # MSTest test Results 23 | [Tt]est[Rr]esult*/ 24 | [Bb]uild[Ll]og.* 25 | 26 | #NUNIT 27 | *.VisualState.xml 28 | TestResult.xml 29 | 30 | # Build Results of an ATL Project 31 | [Dd]ebugPS/ 32 | [Rr]eleasePS/ 33 | dlldata.c 34 | 35 | *_i.c 36 | *_p.c 37 | *_i.h 38 | *.ilk 39 | *.meta 40 | *.obj 41 | *.pch 42 | *.pdb 43 | *.pgc 44 | *.pgd 45 | *.rsp 46 | *.sbr 47 | *.tlb 48 | *.tli 49 | *.tlh 50 | *.tmp 51 | *.tmp_proj 52 | *.log 53 | *.vspscc 54 | *.vssscc 55 | .builds 56 | *.pidb 57 | *.svclog 58 | *.scc 59 | 60 | # Chutzpah Test files 61 | _Chutzpah* 62 | 63 | # Visual C++ cache files 64 | .vs/ 65 | ipch/ 66 | *.aps 67 | *.ncb 68 | *.opensdf 69 | *.sdf 70 | *.cachefile 71 | 72 | # Visual Studio profiler 73 | *.psess 74 | *.vsp 75 | *.vspx 76 | 77 | # TFS 2012 Local Workspace 78 | $tf/ 79 | 80 | # Guidance Automation Toolkit 81 | *.gpState 82 | 83 | # ReSharper is a .NET coding add-in 84 | _ReSharper*/ 85 | *.[Rr]e[Ss]harper 86 | *.DotSettings.user 87 | 88 | # JustCode is a .NET coding addin-in 89 | .JustCode 90 | 91 | # TeamCity is a build add-in 92 | _TeamCity* 93 | 94 | # DotCover is a Code Coverage Tool 95 | *.dotCover 96 | 97 | # NCrunch 98 | _NCrunch_* 99 | .*crunch*.local.xml 100 | 101 | # MightyMoose 102 | *.mm.* 103 | AutoTest.Net/ 104 | 105 | # Web workbench (sass) 106 | .sass-cache/ 107 | 108 | # Installshield output folder 109 | [Ee]xpress/ 110 | 111 | # DocProject is a documentation generator add-in 112 | DocProject/buildhelp/ 113 | DocProject/Help/*.HxT 114 | DocProject/Help/*.HxC 115 | DocProject/Help/*.hhc 116 | DocProject/Help/*.hhk 117 | DocProject/Help/*.hhp 118 | DocProject/Help/Html2 119 | DocProject/Help/html 120 | 121 | # Click-Once directory 122 | publish/ 123 | 124 | # Publish Web Output 125 | *.[Pp]ublish.xml 126 | *.azurePubxml 127 | ## TODO: Comment the next line if you want to checkin your 128 | ## web deploy settings but do note that will include unencrypted 129 | ## passwords 130 | #*.pubxml 131 | 132 | # NuGet Packages Directory 133 | packages/* 134 | ## TODO: If the tool you use requires repositories.config 135 | ## uncomment the next line 136 | !packages/repositories.config 137 | 138 | # Enable "build/" folder in the NuGet Packages folder since 139 | # NuGet packages use it for MSBuild targets. 140 | # This line needs to be after the ignore of the build folder 141 | # (and the packages folder if the line above has been uncommented) 142 | !packages/build/ 143 | 144 | # Windows Azure Build Output 145 | csx/ 146 | *.build.csdef 147 | 148 | # Windows Store app package directory 149 | AppPackages/ 150 | 151 | # Others 152 | sql/ 153 | *.Cache 154 | ClientBin/ 155 | [Ss]tyle[Cc]op.* 156 | ~$* 157 | *~ 158 | *.dbmdl 159 | *.dbproj.schemaview 160 | *.pfx 161 | *.publishsettings 162 | node_modules/ 163 | 164 | # RIA/Silverlight projects 165 | Generated_Code/ 166 | 167 | # Backup & report files from converting an old project file 168 | # to a newer Visual Studio version. Backup files are not needed, 169 | # because we have git ;-) 170 | _UpgradeReport_Files/ 171 | Backup*/ 172 | UpgradeLog*.XML 173 | UpgradeLog*.htm 174 | 175 | # SQL Server files 176 | *.mdf 177 | *.ldf 178 | 179 | # Business Intelligence projects 180 | *.rdl.data 181 | *.bim.layout 182 | *.bim_*.settings 183 | 184 | # Microsoft Fakes 185 | FakesAssemblies/ 186 | 187 | # LightSwitch generated files 188 | GeneratedArtifacts/ 189 | _Pvt_Extensions/ 190 | ModelManifest.xml -------------------------------------------------------------------------------- /LICENSE.md: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Xbox 360 Controller (XInput) Polling Rate Checker 2 | [![GitHub Release](https://img.shields.io/github/release/chrizonix/XInputTest.svg)](https://github.com/chrizonix/XInputTest/releases/tag/v1.2.0.0) 3 | [![Github Downloads](https://img.shields.io/github/downloads/chrizonix/XInputTest/total.svg)](https://github.com/chrizonix/XInputTest/releases/tag/v1.2.0.0) 4 | [![Github Commits (since latest release)](https://img.shields.io/github/commits-since/chrizonix/XInputTest/latest.svg)](https://github.com/chrizonix/XInputTest/compare/v1.2.0.0...master) 5 | [![GitHub Repo Size in Bytes](https://img.shields.io/github/repo-size/chrizonix/XInputTest.svg)](https://github.com/chrizonix/XInputTest) 6 | [![Github License](https://img.shields.io/github/license/chrizonix/XInputTest.svg)](LICENSE.md) 7 | 8 | Simple Tool to Check the Latency and Update Rate of a Xbox 360 Controller, or Virtual XInput Device (DualShock 3/4) 9 | 10 | ## Changelog v1.2.0.0 ([Latest Version](https://github.com/chrizonix/XInputTest/releases/tag/v1.2.0.0)) 11 | * Added Filter for Latencies below 0.5 ms 12 | * Added 64-bit Binaries 13 | 14 | ## Changelog v1.0.0.2 ([Download](https://github.com/chrizonix/XInputTest/releases/tag/v1.0.0.2)) 15 | * Added Rapid Outlier Detection (thanks to Mahito Sugiyama) 16 | * Added XInput Controller Class (thanks to Minalien) 17 | * Added Jitter Calculation 18 | 19 | ## Why? 20 | I wanted to measure the Latency of my DualShock 3/4 Controllers via USB and Bluetooth, but haven't found a Tool which let me do this. Although you can find Videos and Articles about the Update Rates, I wanted to check them by myself. 21 | 22 | I'm using the XInput Library, because most of the Games are using it for Xbox 360 Controllers. 23 | And I wanted to measure the Latency that the Game is "seeing". Furthermore it allowed me to test various Controllers, without rewriting Code. 24 | 25 | ## How Does It Work? 26 | This Tool polls the Gamepad Status several thousand Times a Second, and measures the Time between two distinct Gamepad Reports, aggregates the Data (Average, Min, Max), calculates the Jitter and detects Hiccups (Outliers). 27 | 28 | Although you might get slightly different Results every Time you run the Test (because of the Distance to your Dongle, Hardware, etc) it's generally a good way to compare the Performance of your Gamepad and/or Bluetooth Devices. 29 | 30 | ## Credits 31 | * [Xbox 360 Controller Icon by Mark Davis](https://thenounproject.com/term/xbox-360-controller/195040/) 32 | * [Xbox 360 Controller Input in C++ with XInput by Minalien](https://www.codeproject.com/Articles/26949/Xbox-Controller-Input-in-C-with-XInput) 33 | * [Rapid distance-based Outlier Detection via Sampling by Mahito Sugiyama](https://github.com/BorgwardtLab/sampling-outlier-detection) 34 | -------------------------------------------------------------------------------- /XInputTest.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio 2013 4 | VisualStudioVersion = 12.0.40629.0 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "XInputTest", "XInputTest\XInputTest.vcxproj", "{7BCC5991-C250-41D3-AC4B-C834F9C74288}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|Win32 = Debug|Win32 11 | Debug|x64 = Debug|x64 12 | Release|Win32 = Release|Win32 13 | Release|x64 = Release|x64 14 | EndGlobalSection 15 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 16 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Debug|Win32.ActiveCfg = Debug|Win32 17 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Debug|Win32.Build.0 = Debug|Win32 18 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Debug|x64.ActiveCfg = Debug|x64 19 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Debug|x64.Build.0 = Debug|x64 20 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Release|Win32.ActiveCfg = Release|Win32 21 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Release|Win32.Build.0 = Release|Win32 22 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Release|x64.ActiveCfg = Release|x64 23 | {7BCC5991-C250-41D3-AC4B-C834F9C74288}.Release|x64.Build.0 = Release|x64 24 | EndGlobalSection 25 | GlobalSection(SolutionProperties) = preSolution 26 | HideSolutionNode = FALSE 27 | EndGlobalSection 28 | EndGlobal 29 | -------------------------------------------------------------------------------- /XInputTest/CXBOXController.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Xbox 360 Controller Input in C++ with XInput 3 | Copyright (C) 2008 Minalien 4 | 5 | https://www.codeproject.com/Articles/26949/Xbox-Controller-Input-in-C-with-XInput 6 | */ 7 | 8 | #include "CXBOXController.h" 9 | 10 | CXBOXController::CXBOXController(int playerNumber) 11 | { 12 | // Set the Controller Number 13 | _controllerNum = playerNumber - 1; 14 | } 15 | 16 | XINPUT_STATE CXBOXController::GetState() 17 | { 18 | // Zeroise the state 19 | ZeroMemory(&_controllerState, sizeof(XINPUT_STATE)); 20 | 21 | // Get the state 22 | XInputGetState(_controllerNum, &_controllerState); 23 | 24 | return _controllerState; 25 | } 26 | 27 | bool CXBOXController::IsConnected() 28 | { 29 | // Zeroise the state 30 | ZeroMemory(&_controllerState, sizeof(XINPUT_STATE)); 31 | 32 | // Get the state 33 | DWORD Result = XInputGetState(_controllerNum, &_controllerState); 34 | 35 | if (Result == ERROR_SUCCESS) 36 | { 37 | return true; 38 | } 39 | else 40 | { 41 | return false; 42 | } 43 | } 44 | 45 | void CXBOXController::Vibrate(int leftVal, int rightVal) 46 | { 47 | // Create a Vibraton State 48 | XINPUT_VIBRATION Vibration; 49 | 50 | // Zeroise the Vibration 51 | ZeroMemory(&Vibration, sizeof(XINPUT_VIBRATION)); 52 | 53 | // Set the Vibration Values 54 | Vibration.wLeftMotorSpeed = leftVal; 55 | Vibration.wRightMotorSpeed = rightVal; 56 | 57 | // Vibrate the controller 58 | XInputSetState(_controllerNum, &Vibration); 59 | } -------------------------------------------------------------------------------- /XInputTest/CXBOXController.h: -------------------------------------------------------------------------------- 1 | #ifndef _XBOX_CONTROLLER_H_ 2 | #define _XBOX_CONTROLLER_H_ 3 | 4 | // No MFC 5 | #define WIN32_LEAN_AND_MEAN 6 | 7 | // We need the Windows Header and the XInput Header 8 | #include 9 | #include 10 | 11 | // Now, the XInput Library 12 | // NOTE: COMMENT THIS OUT IF YOU ARE NOT USING A COMPILER THAT SUPPORTS THIS METHOD OF LINKING LIBRARIES 13 | #pragma comment(lib, "Xinput9_1_0.lib") 14 | 15 | // XBOX Controller Class Definition 16 | class CXBOXController 17 | { 18 | private: 19 | XINPUT_STATE _controllerState; 20 | int _controllerNum; 21 | public: 22 | CXBOXController(int playerNumber); 23 | XINPUT_STATE GetState(); 24 | bool IsConnected(); 25 | void Vibrate(int leftVal = 0, int rightVal = 0); 26 | }; 27 | 28 | #endif 29 | -------------------------------------------------------------------------------- /XInputTest/XInputTest.rc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/chrizonix/XInputTest/8e772bc00f370e1c88bea8ad141ed31161c327e4/XInputTest/XInputTest.rc -------------------------------------------------------------------------------- /XInputTest/XInputTest.vcxproj: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | Debug 6 | Win32 7 | 8 | 9 | Debug 10 | x64 11 | 12 | 13 | Release 14 | Win32 15 | 16 | 17 | Release 18 | x64 19 | 20 | 21 | 22 | {7BCC5991-C250-41D3-AC4B-C834F9C74288} 23 | XInputTest 24 | Win32Proj 25 | 26 | 27 | 28 | Application 29 | v120 30 | Unicode 31 | true 32 | 33 | 34 | Application 35 | v120 36 | Unicode 37 | true 38 | 39 | 40 | Application 41 | v120 42 | Unicode 43 | 44 | 45 | Application 46 | v120 47 | Unicode 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | <_ProjectFileVersion>12.0.30501.0 67 | 68 | 69 | $(SolutionDir)$(Configuration)\ 70 | $(Configuration)\ 71 | true 72 | 73 | 74 | true 75 | 76 | 77 | $(SolutionDir)$(Configuration)\ 78 | $(Configuration)\ 79 | false 80 | 81 | 82 | false 83 | 84 | 85 | 86 | Disabled 87 | WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) 88 | true 89 | EnableFastChecks 90 | MultiThreadedDebugDLL 91 | 92 | Level3 93 | EditAndContinue 94 | 95 | 96 | true 97 | Console 98 | MachineX86 99 | winmm.lib;%(AdditionalDependencies) 100 | 101 | 102 | 103 | 104 | Disabled 105 | WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) 106 | EnableFastChecks 107 | MultiThreadedDebugDLL 108 | 109 | 110 | Level3 111 | ProgramDatabase 112 | 113 | 114 | true 115 | Console 116 | 117 | 118 | 119 | 120 | MaxSpeed 121 | true 122 | WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 123 | MultiThreadedDLL 124 | true 125 | 126 | Level3 127 | ProgramDatabase 128 | 129 | 130 | true 131 | Console 132 | true 133 | true 134 | MachineX86 135 | winmm.lib;%(AdditionalDependencies) 136 | 137 | 138 | 139 | 140 | MaxSpeed 141 | true 142 | WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 143 | MultiThreadedDLL 144 | true 145 | 146 | 147 | Level3 148 | ProgramDatabase 149 | 150 | 151 | true 152 | Console 153 | true 154 | true 155 | winmm.lib;%(AdditionalDependencies) 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 | 176 | 177 | 178 | 179 | 180 | -------------------------------------------------------------------------------- /XInputTest/app.ico: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/chrizonix/XInputTest/8e772bc00f370e1c88bea8ad141ed31161c327e4/XInputTest/app.ico -------------------------------------------------------------------------------- /XInputTest/app.ico.credits.txt: -------------------------------------------------------------------------------- 1 | Xbox 360 Controller 2 | By Mark Davis, US 3 | In the VECTOGRAM Collection 4 | 5 | https://thenounproject.com/term/xbox-360-controller/195040/ 6 | 7 | License 8 | Creative Commons Attribution 3.0 9 | https://creativecommons.org/licenses/by/3.0/us/legalcode 10 | -------------------------------------------------------------------------------- /XInputTest/iqsort.c: -------------------------------------------------------------------------------- 1 | // copyright: see the header of "qsp.c" 2 | #include "stdlib2.h" 3 | #include "iqsort.h" 4 | 5 | double *A; 6 | 7 | // index qsort 8 | void iqsort(long *index, double *score, long n) { 9 | long i; 10 | 11 | A = (double *)malloc(sizeof(double) * n); 12 | memcpy(A, score, sizeof(double) * n); 13 | 14 | for (i = 0; i < n; i++) { 15 | index[i] = i; 16 | } 17 | 18 | qsort(index, n, sizeof(long), compare); 19 | 20 | free(A); 21 | } 22 | 23 | // for index qsort 24 | int compare(const void *a, const void *b) { 25 | if (A[*(int *)a] > A[*(int *)b]) { 26 | return -1; 27 | } else if (A[*(int *)a] == A[*(int *)b]) { 28 | return 0; 29 | } 30 | return 1; 31 | } 32 | -------------------------------------------------------------------------------- /XInputTest/iqsort.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #ifdef __cplusplus 4 | extern "C" { 5 | #endif 6 | // copyright: see the header of "qsp.c" 7 | // index qsort 8 | void iqsort(long *index, double *score, long n); 9 | 10 | // comparison function for index qsort 11 | int compare(const void *a, const void *b); 12 | #ifdef __cplusplus 13 | } 14 | #endif 15 | -------------------------------------------------------------------------------- /XInputTest/main.cpp: -------------------------------------------------------------------------------- 1 | //------------------------------- 2 | // Includes 3 | //------------------------------- 4 | #include 5 | 6 | #include 7 | #include 8 | 9 | #include 10 | #include 11 | 12 | #include 13 | #include 14 | 15 | #include "qsp.h" 16 | #include "iqsort.h" 17 | 18 | #include "CXBOXController.h" 19 | 20 | //------------------------------- 21 | // Namespaces 22 | //------------------------------- 23 | using namespace std; 24 | 25 | //------------------------------- 26 | // Defines 27 | //------------------------------- 28 | #define MAX_SAMPLES 1000 29 | #define THRESHOLD 1.5 30 | 31 | //------------------------------- 32 | // Prototypes 33 | //------------------------------- 34 | void rapid_outlier_detection(double *values, double *scores, double avg, string &summary); 35 | void get_time_string(char *buffer, size_t size); 36 | void write_report(double *values, double *scores, double avg, string &summary); 37 | 38 | //------------------------------- 39 | // Functions 40 | //------------------------------- 41 | int main(int argc, char* argv[]) { 42 | bool using_higher_res_timer = false; 43 | 44 | // Set Timer Resolution to 1 ms 45 | if (timeBeginPeriod(1) != TIMERR_NOCANDO) { 46 | using_higher_res_timer = true; 47 | } 48 | 49 | // Create Controller 50 | CXBOXController* controller = new CXBOXController(1); 51 | 52 | // Check Connection 53 | if (controller->IsConnected()) { 54 | cout << "Ready! Waiting for " << MAX_SAMPLES << " Samples (Move Left Stick)" << endl; 55 | } 56 | 57 | // Previous Stick Position 58 | SHORT LX = 0; 59 | SHORT LY = 0; 60 | 61 | // Sample Index 62 | int index = 0; 63 | 64 | // Store Samples and Outlier Score 65 | double* values = new double[MAX_SAMPLES]; 66 | double* scores = new double[MAX_SAMPLES]; 67 | 68 | // Query Performance Counter 69 | LARGE_INTEGER frequency; // Ticks per Second 70 | LARGE_INTEGER time_start, time_now; // Ticks 71 | 72 | // Elapsed Time 73 | char elapsed_text[32]; 74 | double elapsed_time = 0; 75 | 76 | // Get Ticks per Second 77 | QueryPerformanceFrequency(&frequency); 78 | 79 | //------------------- 80 | // Collect Samples 81 | //------------------- 82 | while (true) { 83 | if (controller->IsConnected()) { 84 | XINPUT_STATE state = controller->GetState(); 85 | 86 | // Check Left Stick Position 87 | if (state.Gamepad.sThumbLX != LX || state.Gamepad.sThumbLY != LY) { 88 | // Check Idle 89 | if (LX == 0 && LY == 0) { 90 | // Don't Count Initial Movement (Out of Center) 91 | QueryPerformanceCounter(&time_start); 92 | } else { 93 | // Get Current Time 94 | QueryPerformanceCounter(&time_now); 95 | 96 | // Calculate Elapsed Time (in ms) 97 | elapsed_time = (time_now.QuadPart - time_start.QuadPart) * 1000.0 / frequency.QuadPart; 98 | 99 | // Sanity Check 100 | if (elapsed_time > 0.5) { 101 | // Print Duration (cout seems to be faster than printf) 102 | sprintf_s(elapsed_text, "Duration %.2f ms", elapsed_time); 103 | cout << elapsed_text << endl; 104 | 105 | // Add Sample and Break Loop at the End 106 | if (index < MAX_SAMPLES) { 107 | values[index++] = elapsed_time; 108 | } else { 109 | break; 110 | } 111 | } 112 | 113 | // Get Current Time 114 | QueryPerformanceCounter(&time_start); 115 | } 116 | } 117 | 118 | // Get Left Stick Values 119 | LX = state.Gamepad.sThumbLX; 120 | LY = state.Gamepad.sThumbLY; 121 | } else { 122 | // Controller Not Found 123 | cout << "Error! Player 1 - XBOX 360 Controller Not Found!\n"; 124 | cout << "Press Enter Key To Exit"; 125 | cin.get(); 126 | 127 | // Exit Failure 128 | exit(EXIT_FAILURE); 129 | } 130 | } 131 | 132 | // Reset Timer Resolution 133 | if (using_higher_res_timer) { 134 | timeEndPeriod(1); 135 | } 136 | 137 | //------------------- 138 | // Statistics 139 | //------------------- 140 | double sum = 0; 141 | double max_value = 0; 142 | double min_value = 1000; 143 | 144 | double jitter = 0; 145 | double transit = 0; 146 | 147 | double last_transit = 0; 148 | double delta_transit = 0; 149 | 150 | // Aggregate Values 151 | for (int i = 0; i < MAX_SAMPLES; ++i) { 152 | // Sum for Average Value 153 | sum += values[i]; 154 | 155 | // Min / Max Values 156 | min_value = min(min_value, values[i]); 157 | max_value = max(max_value, values[i]); 158 | 159 | // Jitter Calculation from RFC 1889, Real Time Protocol (RTP) 160 | // J = J + ( | D(i-1,i) | - J ) / 16 161 | transit = values[i]; 162 | 163 | if (last_transit != 0.0) { 164 | delta_transit = fabs(transit - last_transit); 165 | jitter += (delta_transit - jitter) / (16.0); 166 | } 167 | 168 | last_transit = transit; 169 | } 170 | 171 | // Calculate Average Polling Rate 172 | double avg = (sum / (double) MAX_SAMPLES); 173 | 174 | // Summary Block 175 | string summary; 176 | char line[64]; 177 | 178 | // Detect and Print Outliers 179 | rapid_outlier_detection(values, scores, avg, summary); 180 | 181 | // Write Statistics 182 | sprintf_s(line, "\nMin %f ms - Max %f ms - Jitter %f ms\n", min_value, max_value, jitter); 183 | summary.append(line); 184 | 185 | sprintf_s(line, "Average %f ms - Polling Rate %f Hz\n", avg, 1000 / avg); 186 | summary.append(line); 187 | 188 | // Print Statistics 189 | cout << endl << summary.c_str() << endl; 190 | 191 | // Wait for Input 192 | cout << "Write Report To File? J/[N]: "; 193 | 194 | // Get Answer 195 | char answer = cin.get(); 196 | 197 | // Check Answer 198 | if (answer == 'j' || answer == 'J') { 199 | // Write Report To File 200 | write_report(values, scores, avg, summary); 201 | } 202 | 203 | // Free Memory 204 | delete(values); 205 | delete(scores); 206 | delete(controller); 207 | 208 | // Return Status 209 | return EXIT_SUCCESS; 210 | } 211 | 212 | void rapid_outlier_detection(double *values, double *scores, double avg, string &summary) { 213 | long i, n = 0, d = 0, seed = 0, n_sample = 20; 214 | int k = 10, norm = 1, sort = 1; 215 | char line[64]; 216 | 217 | // n: # of rows, d: # of columns 218 | n = MAX_SAMPLES; d = 1; 219 | 220 | // Copy Values Array (Because of Data Manipulation) 221 | double *normalized = (double *) malloc(sizeof(double) * n); 222 | memcpy_s(normalized, sizeof(double) * n, values, sizeof(double) * n); 223 | 224 | // Normalization 225 | normalize(normalized, n, d); 226 | 227 | // Compute QSP Score 228 | qsp(normalized, n, d, n_sample, seed, scores); 229 | 230 | // Outliers 231 | int outliers = 0; 232 | 233 | // Count Outliers 234 | for (i = 0; i < n; i++) { 235 | if (scores[i] > 1.0 && (values[i] - avg) > THRESHOLD) { 236 | outliers++; 237 | } 238 | } 239 | 240 | // Print Outliers 241 | sprintf_s(line, "Outliers: %d / %d\n", outliers, MAX_SAMPLES); 242 | summary.append(line); 243 | 244 | // Index QSort for Ranking 245 | if (sort == 1 && outliers > 0) { 246 | long *index = (long *) malloc(sizeof(long) * n); 247 | 248 | // Fill Indices 249 | for (i = 0; i < n; i++) { 250 | index[i] = i; 251 | } 252 | 253 | // Index QSort for Ranking 254 | iqsort(index, scores, n); 255 | 256 | // Top "x" Outliers 257 | k = min(outliers, k); 258 | 259 | // Print Top "x" Outliers 260 | sprintf_s(line, "Top %d Outliers: ", k); 261 | summary.append(line); 262 | 263 | for (i = 0; i < (k - 1); i++) { 264 | sprintf_s(line, "%.2f ms, ", values[index[i]]); 265 | summary.append(line); 266 | } 267 | 268 | sprintf_s(line, "%.2f ms\n", values[index[i]]); 269 | summary.append(line); 270 | 271 | // Free Memory 272 | free(index); 273 | } 274 | 275 | // Free Memory 276 | free(normalized); 277 | } 278 | 279 | void get_time_string(char *buffer, size_t size) { 280 | time_t rawtime; 281 | struct tm timeinfo; 282 | 283 | // Get Local Time 284 | time(&rawtime); 285 | localtime_s(&timeinfo, &rawtime); 286 | 287 | // Format Local Time 288 | strftime(buffer, size, "%Y%m%d_%H%M%S", &timeinfo); 289 | } 290 | 291 | void write_report(double *values, double *scores, double avg, string &summary) { 292 | // File Name Variables 293 | char date_time[16]; 294 | char file_name[32]; 295 | 296 | // Generate Report File Name 297 | get_time_string(date_time, sizeof(date_time)); 298 | sprintf_s(file_name, "Report_%s.txt", date_time); 299 | 300 | // File Handle 301 | FILE *fp = NULL; 302 | 303 | // Open File 304 | if (fopen_s(&fp, file_name, "w") == 0) { 305 | // Write Summary 306 | fprintf(fp, "%s\n", summary); 307 | 308 | // Write Header 309 | fprintf(fp, "--------------------\n"); 310 | fprintf(fp, " Outlier | Duration \n"); 311 | fprintf(fp, "--------------------\n"); 312 | 313 | // Write to File 314 | for (int i = 0; i < MAX_SAMPLES; i++) { 315 | fprintf(fp, " %3s | %5.2f ms \n", (scores[i] > 1.0 && (values[i] - avg) > THRESHOLD) ? "==>" : " ", values[i]); 316 | } 317 | 318 | // Close File 319 | fclose(fp); 320 | } 321 | } 322 | -------------------------------------------------------------------------------- /XInputTest/qsp.c: -------------------------------------------------------------------------------- 1 | /* 2 | Rapid distance-based outlier detectio via sampling 3 | Copyright (C) 2013 Mahito Sugiyama 4 | 5 | This program is free software; you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation; either version 2 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License along 16 | with this program; if not, write to the Free Software Foundation, Inc., 17 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 18 | 19 | Contact: Mahito Sugiyama 20 | 21 | Please refer the following article in your published research: 22 | Sugiyama, M., Borgwardt, K.M.: Rapid Distance-Based Outlier Detection via Sampling, 23 | Advances in Neural Information Processing Systems (NIPS 2013), 2013. 24 | 25 | https://github.com/BorgwardtLab/sampling-outlier-detection 26 | */ 27 | #include "stdlib2.h" 28 | #include "qsp.h" 29 | 30 | // input -> X: data matrix (array), n: # of objects, d: # of dimensions, Xs: 31 | // sample set, sid: sample indexes, ns: # of samples 32 | // output -> result: an array of qsps 33 | void qsp(double *X, long n, long d, long n_sample, long seed, double *score) { 34 | long i, j, point, *id_sample; 35 | double sum, res; 36 | 37 | // random sampling 38 | id_sample = (long *)malloc(sizeof(long) * n_sample); 39 | sampling(n_sample, 0, n - 1, seed, id_sample); 40 | 41 | // compute the outlierness score qsp for each data point 42 | for (point = 0; point < n; point++) { 43 | res = 0; 44 | for (i = 0; i < n_sample; i++) { 45 | if (point != id_sample[i]) { 46 | sum = 0; 47 | for (j = 0; j < d; j++) 48 | sum += fabs(X[point * d + j] - X[id_sample[i] * d + j]) * 49 | fabs(X[point * d + j] - X[id_sample[i] * d + j]); 50 | if (res == 0) 51 | res = sum; 52 | else if (sum < res && sum > 0) 53 | res = sum; 54 | } 55 | } 56 | score[point] = sqrt(res); 57 | } 58 | } 59 | 60 | // random sampling 61 | // if seed = 0, seed is randomly set 62 | void sampling(long n_sample, long min, long max, long seed, long *id_sample) { 63 | long i, j = 0; 64 | time_t t; 65 | 66 | if (seed == 0) 67 | seed = (long) time(&t); 68 | 69 | for (i = 0; i < n_sample; i++) { 70 | do { 71 | srand(seed + j++); 72 | id_sample[i] = min + rand() % (max - min + 1); 73 | } while (checkArray(id_sample[i], i, id_sample) == 1); 74 | } 75 | } 76 | 77 | long checkArray(long id_current, long n_sample, long *id_sample) { 78 | long i; 79 | 80 | for (i = 0; i < n_sample; i++) { 81 | if (id_current == id_sample[i]) 82 | return (1); 83 | } 84 | return (0); 85 | } 86 | 87 | // normalization of data (divide by SDs for each dimension) 88 | void normalize(double *X, long n, long d) { 89 | long i, j, flag; 90 | double sum, *X_means; 91 | 92 | X_means = (double *)malloc(sizeof(double) * d); 93 | 94 | for (j = 0; j < d; j++) { 95 | sum = 0; 96 | for (i = 0; i < n; i++) { 97 | sum += X[i * d + j]; 98 | } 99 | X_means[j] = sum / n; 100 | } 101 | 102 | for (j = 0; j < d; j++) { 103 | flag = 0; 104 | sum = X[j]; 105 | for (i = 1; i < n; i++) { 106 | if (sum != X[i * d + j]) { 107 | flag = 1; 108 | break; 109 | } 110 | } 111 | if (flag == 1) { 112 | sum = 0; 113 | for (i = 0; i < n; i++) 114 | sum += (X[i * d + j] - X_means[j]) * (X[i * d + j] - X_means[j]); 115 | sum = sqrt(sum / (n - 1)); // unbiased SD 116 | for (i = 0; i < n; i++) 117 | X[i * d + j] = X[i * d + j] / sum; 118 | } 119 | } 120 | 121 | free(X_means); 122 | X_means = NULL; 123 | } 124 | -------------------------------------------------------------------------------- /XInputTest/qsp.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #ifdef __cplusplus 4 | extern "C" { 5 | #endif 6 | // copyright: see the header of "qsp.c" 7 | // compute qsp for every data point 8 | void qsp(double *X, long n, long d, long n_sample, long seed, double *score); 9 | 10 | // random sampling 11 | void sampling(long n, long min, long max, long seed, long *id_sample); 12 | long checkArray(long id_current, long n_sample, long *id_sample); 13 | 14 | // normalization of data (divide by SDs for each dimension) 15 | void normalize(double *X, long n, long d); 16 | #ifdef __cplusplus 17 | } 18 | #endif 19 | -------------------------------------------------------------------------------- /XInputTest/resource.h: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/chrizonix/XInputTest/8e772bc00f370e1c88bea8ad141ed31161c327e4/XInputTest/resource.h -------------------------------------------------------------------------------- /XInputTest/stdlib2.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | // copyright: see the header of "qsp.c" 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | --------------------------------------------------------------------------------