├── .gitattributes ├── .gitignore ├── 2024-01-05 19_49_27-Clipboard.greenshot ├── 433mhz_Rolling_Code.ino ├── 433mhz_Rolling_Code.sln ├── 433mhz_Rolling_Code.vcxproj ├── 433mhz_Rolling_Code.vcxproj.filters ├── LICENSE ├── Nano Tx Rx Connections.png ├── PulseView (RX480 Output Pins).png ├── PulseView (Tx Rx Timing).png ├── README.md ├── Rolling Code Example.xlsx ├── Rolling Code and Init-Value Example.png ├── User Configrable Settings.png └── __vm ├── .433mhz_Rolling_Code.vsarduino.h ├── Compile.vmps.xml ├── Configuration.Debug.vmps.xml ├── Configuration.Release.vmps.xml └── Upload.vmps.xml /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | ## Ignore Visual Studio temporary files, build results, and 2 | ## files generated by popular Visual Studio add-ons. 3 | ## 4 | ## Get latest from https://github.com/github/gitignore/blob/main/VisualStudio.gitignore 5 | 6 | # User-specific files 7 | *.rsuser 8 | *.suo 9 | *.user 10 | *.userosscache 11 | *.sln.docstates 12 | 13 | # User-specific files (MonoDevelop/Xamarin Studio) 14 | *.userprefs 15 | 16 | # Mono auto generated files 17 | mono_crash.* 18 | 19 | # Build results 20 | [Dd]ebug/ 21 | [Dd]ebugPublic/ 22 | [Rr]elease/ 23 | [Rr]eleases/ 24 | x64/ 25 | x86/ 26 | [Ww][Ii][Nn]32/ 27 | [Aa][Rr][Mm]/ 28 | [Aa][Rr][Mm]64/ 29 | bld/ 30 | [Bb]in/ 31 | [Oo]bj/ 32 | [Ll]og/ 33 | [Ll]ogs/ 34 | 35 | # Visual Studio 2015/2017 cache/options directory 36 | .vs/ 37 | # Uncomment if you have tasks that create the project's static files in wwwroot 38 | #wwwroot/ 39 | 40 | # Visual Studio 2017 auto generated files 41 | Generated\ Files/ 42 | 43 | # MSTest test Results 44 | [Tt]est[Rr]esult*/ 45 | [Bb]uild[Ll]og.* 46 | 47 | # NUnit 48 | *.VisualState.xml 49 | TestResult.xml 50 | nunit-*.xml 51 | 52 | # Build Results of an ATL Project 53 | [Dd]ebugPS/ 54 | [Rr]eleasePS/ 55 | dlldata.c 56 | 57 | # Benchmark Results 58 | BenchmarkDotNet.Artifacts/ 59 | 60 | # .NET Core 61 | project.lock.json 62 | project.fragment.lock.json 63 | artifacts/ 64 | 65 | # ASP.NET Scaffolding 66 | ScaffoldingReadMe.txt 67 | 68 | # StyleCop 69 | StyleCopReport.xml 70 | 71 | # Files built by Visual Studio 72 | *_i.c 73 | *_p.c 74 | *_h.h 75 | *.ilk 76 | *.meta 77 | *.obj 78 | *.iobj 79 | *.pch 80 | *.pdb 81 | *.ipdb 82 | *.pgc 83 | *.pgd 84 | *.rsp 85 | *.sbr 86 | *.tlb 87 | *.tli 88 | *.tlh 89 | *.tmp 90 | *.tmp_proj 91 | *_wpftmp.csproj 92 | *.log 93 | *.tlog 94 | *.vspscc 95 | *.vssscc 96 | .builds 97 | *.pidb 98 | *.svclog 99 | *.scc 100 | 101 | # Chutzpah Test files 102 | _Chutzpah* 103 | 104 | # Visual C++ cache files 105 | ipch/ 106 | *.aps 107 | *.ncb 108 | *.opendb 109 | *.opensdf 110 | *.sdf 111 | *.cachefile 112 | *.VC.db 113 | *.VC.VC.opendb 114 | 115 | # Visual Studio profiler 116 | *.psess 117 | *.vsp 118 | *.vspx 119 | *.sap 120 | 121 | # Visual Studio Trace Files 122 | *.e2e 123 | 124 | # TFS 2012 Local Workspace 125 | $tf/ 126 | 127 | # Guidance Automation Toolkit 128 | *.gpState 129 | 130 | # ReSharper is a .NET coding add-in 131 | _ReSharper*/ 132 | *.[Rr]e[Ss]harper 133 | *.DotSettings.user 134 | 135 | # TeamCity is a build add-in 136 | _TeamCity* 137 | 138 | # DotCover is a Code Coverage Tool 139 | *.dotCover 140 | 141 | # AxoCover is a Code Coverage Tool 142 | .axoCover/* 143 | !.axoCover/settings.json 144 | 145 | # Coverlet is a free, cross platform Code Coverage Tool 146 | coverage*.json 147 | coverage*.xml 148 | coverage*.info 149 | 150 | # Visual Studio code coverage results 151 | *.coverage 152 | *.coveragexml 153 | 154 | # NCrunch 155 | _NCrunch_* 156 | .*crunch*.local.xml 157 | nCrunchTemp_* 158 | 159 | # MightyMoose 160 | *.mm.* 161 | AutoTest.Net/ 162 | 163 | # Web workbench (sass) 164 | .sass-cache/ 165 | 166 | # Installshield output folder 167 | [Ee]xpress/ 168 | 169 | # DocProject is a documentation generator add-in 170 | DocProject/buildhelp/ 171 | DocProject/Help/*.HxT 172 | DocProject/Help/*.HxC 173 | DocProject/Help/*.hhc 174 | DocProject/Help/*.hhk 175 | DocProject/Help/*.hhp 176 | DocProject/Help/Html2 177 | DocProject/Help/html 178 | 179 | # Click-Once directory 180 | publish/ 181 | 182 | # Publish Web Output 183 | *.[Pp]ublish.xml 184 | *.azurePubxml 185 | # Note: Comment the next line if you want to checkin your web deploy settings, 186 | # but database connection strings (with potential passwords) will be unencrypted 187 | *.pubxml 188 | *.publishproj 189 | 190 | # Microsoft Azure Web App publish settings. Comment the next line if you want to 191 | # checkin your Azure Web App publish settings, but sensitive information contained 192 | # in these scripts will be unencrypted 193 | PublishScripts/ 194 | 195 | # NuGet Packages 196 | *.nupkg 197 | # NuGet Symbol Packages 198 | *.snupkg 199 | # The packages folder can be ignored because of Package Restore 200 | **/[Pp]ackages/* 201 | # except build/, which is used as an MSBuild target. 202 | !**/[Pp]ackages/build/ 203 | # Uncomment if necessary however generally it will be regenerated when needed 204 | #!**/[Pp]ackages/repositories.config 205 | # NuGet v3's project.json files produces more ignorable files 206 | *.nuget.props 207 | *.nuget.targets 208 | 209 | # Microsoft Azure Build Output 210 | csx/ 211 | *.build.csdef 212 | 213 | # Microsoft Azure Emulator 214 | ecf/ 215 | rcf/ 216 | 217 | # Windows Store app package directories and files 218 | AppPackages/ 219 | BundleArtifacts/ 220 | Package.StoreAssociation.xml 221 | _pkginfo.txt 222 | *.appx 223 | *.appxbundle 224 | *.appxupload 225 | 226 | # Visual Studio cache files 227 | # files ending in .cache can be ignored 228 | *.[Cc]ache 229 | # but keep track of directories ending in .cache 230 | !?*.[Cc]ache/ 231 | 232 | # Others 233 | ClientBin/ 234 | ~$* 235 | *~ 236 | *.dbmdl 237 | *.dbproj.schemaview 238 | *.jfm 239 | *.pfx 240 | *.publishsettings 241 | orleans.codegen.cs 242 | 243 | # Including strong name files can present a security risk 244 | # (https://github.com/github/gitignore/pull/2483#issue-259490424) 245 | #*.snk 246 | 247 | # Since there are multiple workflows, uncomment next line to ignore bower_components 248 | # (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) 249 | #bower_components/ 250 | 251 | # RIA/Silverlight projects 252 | Generated_Code/ 253 | 254 | # Backup & report files from converting an old project file 255 | # to a newer Visual Studio version. Backup files are not needed, 256 | # because we have git ;-) 257 | _UpgradeReport_Files/ 258 | Backup*/ 259 | UpgradeLog*.XML 260 | UpgradeLog*.htm 261 | ServiceFabricBackup/ 262 | *.rptproj.bak 263 | 264 | # SQL Server files 265 | *.mdf 266 | *.ldf 267 | *.ndf 268 | 269 | # Business Intelligence projects 270 | *.rdl.data 271 | *.bim.layout 272 | *.bim_*.settings 273 | *.rptproj.rsuser 274 | *- [Bb]ackup.rdl 275 | *- [Bb]ackup ([0-9]).rdl 276 | *- [Bb]ackup ([0-9][0-9]).rdl 277 | 278 | # Microsoft Fakes 279 | FakesAssemblies/ 280 | 281 | # GhostDoc plugin setting file 282 | *.GhostDoc.xml 283 | 284 | # Node.js Tools for Visual Studio 285 | .ntvs_analysis.dat 286 | node_modules/ 287 | 288 | # Visual Studio 6 build log 289 | *.plg 290 | 291 | # Visual Studio 6 workspace options file 292 | *.opt 293 | 294 | # Visual Studio 6 auto-generated workspace file (contains which files were open etc.) 295 | *.vbw 296 | 297 | # Visual Studio 6 auto-generated project file (contains which files were open etc.) 298 | *.vbp 299 | 300 | # Visual Studio 6 workspace and project file (working project files containing files to include in project) 301 | *.dsw 302 | *.dsp 303 | 304 | # Visual Studio 6 technical files 305 | *.ncb 306 | *.aps 307 | 308 | # Visual Studio LightSwitch build output 309 | **/*.HTMLClient/GeneratedArtifacts 310 | **/*.DesktopClient/GeneratedArtifacts 311 | **/*.DesktopClient/ModelManifest.xml 312 | **/*.Server/GeneratedArtifacts 313 | **/*.Server/ModelManifest.xml 314 | _Pvt_Extensions 315 | 316 | # Paket dependency manager 317 | .paket/paket.exe 318 | paket-files/ 319 | 320 | # FAKE - F# Make 321 | .fake/ 322 | 323 | # CodeRush personal settings 324 | .cr/personal 325 | 326 | # Python Tools for Visual Studio (PTVS) 327 | __pycache__/ 328 | *.pyc 329 | 330 | # Cake - Uncomment if you are using it 331 | # tools/** 332 | # !tools/packages.config 333 | 334 | # Tabs Studio 335 | *.tss 336 | 337 | # Telerik's JustMock configuration file 338 | *.jmconfig 339 | 340 | # BizTalk build output 341 | *.btp.cs 342 | *.btm.cs 343 | *.odx.cs 344 | *.xsd.cs 345 | 346 | # OpenCover UI analysis results 347 | OpenCover/ 348 | 349 | # Azure Stream Analytics local run output 350 | ASALocalRun/ 351 | 352 | # MSBuild Binary and Structured Log 353 | *.binlog 354 | 355 | # NVidia Nsight GPU debugger configuration file 356 | *.nvuser 357 | 358 | # MFractors (Xamarin productivity tool) working folder 359 | .mfractor/ 360 | 361 | # Local History for Visual Studio 362 | .localhistory/ 363 | 364 | # Visual Studio History (VSHistory) files 365 | .vshistory/ 366 | 367 | # BeatPulse healthcheck temp database 368 | healthchecksdb 369 | 370 | # Backup folder for Package Reference Convert tool in Visual Studio 2017 371 | MigrationBackup/ 372 | 373 | # Ionide (cross platform F# VS Code tools) working folder 374 | .ionide/ 375 | 376 | # Fody - auto-generated XML schema 377 | FodyWeavers.xsd 378 | 379 | # VS Code files for those working on multiple tools 380 | .vscode/* 381 | !.vscode/settings.json 382 | !.vscode/tasks.json 383 | !.vscode/launch.json 384 | !.vscode/extensions.json 385 | *.code-workspace 386 | 387 | # Local History for Visual Studio Code 388 | .history/ 389 | 390 | # Windows Installer files from build outputs 391 | *.cab 392 | *.msi 393 | *.msix 394 | *.msm 395 | *.msp 396 | 397 | # JetBrains Rider 398 | *.sln.iml 399 | -------------------------------------------------------------------------------- /2024-01-05 19_49_27-Clipboard.greenshot: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/2024-01-05 19_49_27-Clipboard.greenshot -------------------------------------------------------------------------------- /433mhz_Rolling_Code.ino: -------------------------------------------------------------------------------- 1 | /* 2 | Name: qiachip 433mhz_Rolling_Code.ino 3 | Created: 28/12/2023 15:01:03 4 | Author: Bionicbone 5 | MCU: Arduino Nano (powered with 5v) 6 | qiachip parts:TX-118S-4 v2 & RX480E (powered with 5v) 7 | Arduino NANO: TX Pin 1 --> Tx Nano D6 <-- looks strange but TX / RX has illogical pins orders :( 8 | TX Pin 2 --> Tx Nano D7 <-- looks strange but TX / RX has illogical pins orders :( 9 | TX Pin 3 --> Tx Nano D5 10 | TX Pin 4 --> Tx Nano D4 11 | Tx Nano D8 --> Button 1 to GND when pressed 12 | Tx Nano D9 --> Button 2 to GND when pressed 13 | Tx Nano D10 --> Button 3 to GND when pressed 14 | Tx Nano D11 --> Button 4 to GND when pressed 15 | Tx Nano D13 --> High signal when TX is tranmitting 16 | RX Pin D0 --> Rx Nano D4 17 | RX Pin D1 --> Rx Nano D5 18 | RX Pin D2 --> Rx Nano D6 19 | RX Pin D3 --> Rx Nano D7 20 | RX Pin VT --> Rx Nano D2 21 | Rx Nano D8 --> High signal when TX Pin 1 active 22 | Rx Nano D9 --> High signal when TX Pin 2 active 23 | Rx Nano D10 --> High signal when TX Pin 3 active 24 | Rx Nano D11 --> High signal when TX Pin 4 active 25 | Resistors: Only required if using random number generator, any values connected, one from 5v to pin A0 and one from GND to pin A0 for voltage divider (random seed) 26 | 27 | ESP32: As per NANO with pin changes as per __AVR_ATmega328P__ definition section 28 | */ 29 | 30 | 31 | /********************************************************************************************** 32 | *** User "should" change the following settings to make a unique system for added security *** 33 | **********************************************************************************************/ 34 | 35 | // !*!*! REMEMBER TO SET TX ID NUMBER WHEN FLASHING MULTIPLE TX UNITS FOR THE SAME RX !*!*! 36 | // Uncomment MODE line to flash Tx, comment to flash Rx 37 | #define MODE 38 | 39 | // Uncomment RANDOM_NUMBERS line to create a list of random numbers over serial monitor. 40 | // NOTE: connect any value but different value resistors to A0 as voltage dividor to create a random seed otherwise numbers will be default NANO random numbers. 41 | //#define RANDOM_NUMBERS 42 | 43 | uint8_t numberOfTxAttached = 2; // user should set this correctly (1-3), set to 1 if only 1 Tx is being used. 44 | uint8_t TxIdNumber = 1; // user should set this (when flashing Tx) to 1, 2, or 3 so Rx can determine which Tx is being used. 45 | // user should change the rolling code values (1-15 inc.), but must ensure Tx and Rx have the same order. 46 | //uint8_t rollingCode[48] = { 3, 12, 6, 1, 10, 12, 10, 5, 13, 2, 7, 15, 12, 3, 15, 3, 13, 5, 8, 12, 12, 1, 2, 8, 10, 1, 5, 8, 11, 13, 13, 15, 12, 12, 8, 1, 1, 10, 9, 11, 2, 9, 14, 1, 3, 15, 12, 7 }; 47 | uint8_t rollingCode[965] = { 3, 12, 6, 1, 10, 12, 10, 5, 13, 2, 7, 15, 12, 3, 15, 3, 13, 5, 8, 12, 12, 1, 2, 8, 10, 1, 5, 8, 11, 13, 13, 15, 12, 12, 8, 1, 1, 10, 9, 11, 2, 9, 14, 1, 3, 15, 12, 7, 3, 14, 2, 9, 7, 2, 10, 15, 5, 15, 14, 9, 11, 2, 8, 2, 13, 4, 12, 2, 5, 14, 9, 13, 2, 10, 2, 4, 11, 5, 4, 12, 14, 1, 3, 13, 13, 14, 13, 15, 4, 14, 6, 2, 4, 9, 13, 15, 11, 2, 4, 14, 15, 1, 13, 9, 5, 3, 14, 15, 10, 5, 4, 5, 8, 15, 15, 12, 5, 15, 3, 14, 9, 13, 12, 11, 8, 7, 15, 7, 15, 3, 6, 4, 5, 11, 5, 10, 13, 13, 14, 4, 5, 12, 1, 7, 6, 9, 4, 10, 9, 3, 7, 12, 10, 12, 3, 12, 9, 5, 4, 1, 14, 1, 8, 6, 13, 7, 6, 5, 3, 14, 2, 3, 8, 13, 15, 9, 1, 3, 10, 5, 13, 8, 5, 3, 8, 11, 13, 12, 1, 13, 12, 4, 6, 2, 15, 1, 14, 7, 13, 7, 15, 14, 14, 9, 1, 6, 15, 1, 11, 10, 1, 9, 12, 4, 1, 12, 4, 4, 6, 5, 7, 2, 13, 13, 15, 11, 10, 8, 15, 7, 11, 13, 13, 1, 10, 12, 4, 3, 3, 12, 4, 14, 3, 1, 15, 12, 15, 3, 1, 1, 6, 5, 5, 14, 6, 9, 12, 11, 3, 7, 9, 5, 9, 4, 14, 12, 13, 5, 3, 5, 2, 11, 8, 8, 8, 10, 12, 11, 5, 14, 11, 1, 10, 6, 2, 13, 10, 9, 15, 12, 4, 11, 8, 11, 13, 11, 2, 1, 1, 10, 10, 10, 15, 2, 1, 7, 10, 12, 6, 14, 6, 13, 14, 7, 7, 11, 4, 1, 7, 1, 1, 11, 9, 12, 8, 13, 4, 15, 9, 5, 3, 4, 15, 3, 2, 7, 13, 5, 9, 9, 14, 1, 11, 12, 12, 7, 3, 1, 3, 2, 12, 7, 5, 5, 5, 14, 4, 2, 7, 1, 13, 9, 11, 12, 14, 1, 5, 13, 4, 10, 7, 9, 1, 7, 10, 9, 8, 11, 10, 2, 4, 11, 12, 5, 7, 6, 1, 10, 10, 2, 2, 10, 8, 10, 1, 11, 14, 7, 3, 5, 2, 1, 15, 5, 7, 3, 10, 1, 10, 11, 5, 6, 10, 3, 4, 3, 3, 12, 7, 3, 15, 13, 9, 9, 12, 8, 12, 2, 4, 9, 8, 2, 8, 2, 12, 6, 10, 11, 4, 14, 15, 4, 1, 13, 1, 5, 6, 13, 7, 13, 11, 3, 9, 5, 14, 10, 11, 6, 4, 15, 13, 7, 4, 3, 1, 8, 10, 3, 15, 10, 9, 11, 12, 7, 11, 2, 14, 6, 2, 2, 6, 10, 1, 8, 10, 8, 13, 11, 4, 2, 11, 10, 8, 10, 6, 12, 12, 14, 3, 10, 5, 11, 10, 9, 5, 4, 11, 13, 14, 14, 5, 9, 3, 2, 6, 10, 11, 6, 11, 14, 2, 4, 15, 6, 13, 7, 15, 15, 4, 12, 7, 8, 7, 15, 5, 9, 14, 6, 6, 15, 2, 11, 7, 3, 6, 7, 13, 10, 11, 1, 1, 1, 13, 14, 2, 9, 13, 12, 15, 14, 13, 2, 2, 6, 2, 4, 3, 11, 5, 7, 3, 2, 12, 7, 9, 8, 1, 12, 12, 10, 8, 11, 2, 10, 2, 8, 11, 13, 8, 2, 2, 11, 8, 9, 8, 8, 13, 14, 14, 5, 13, 5, 1, 1, 13, 5, 4, 2, 9, 5, 11, 11, 10, 9, 4, 8, 11, 7, 2, 5, 15, 5, 3, 11, 10, 4, 15, 1, 6, 5, 2, 3, 5, 8, 12, 1, 2, 6, 2, 8, 6, 11, 11, 14, 3, 7, 7, 6, 12, 6, 15, 12, 6, 1, 1, 14, 10, 3, 8, 1, 3, 3, 8, 14, 13, 1, 13, 8, 6, 11, 1, 5, 12, 6, 14, 7, 9, 7, 14, 15, 14, 10, 3, 7, 1, 5, 15, 14, 14, 8, 11, 2, 14, 4, 5, 4, 14, 4, 1, 12, 9, 13, 4, 15, 10, 1, 5, 4, 1, 9, 9, 15, 1, 12, 5, 4, 10, 9, 9, 9, 13, 9, 9, 12, 13, 9, 6, 3, 14, 4, 14, 11, 1, 5, 2, 4, 4, 9, 6, 9, 15, 5, 8, 10, 8, 14, 4, 2, 2, 5, 5, 5, 10, 9, 15, 15, 7, 9, 13, 1, 13, 15, 15, 3, 4, 2, 11, 13, 5, 5, 13, 3, 10, 14, 14, 7, 7, 15, 13, 9, 5, 15, 9, 8, 7, 1, 14, 5, 11, 5, 11, 11, 15, 6, 13, 15, 12, 8, 12, 13, 2, 9, 3, 14, 1, 4, 13, 15, 3, 10, 8, 1, 13, 3, 12, 3, 13, 2, 1, 12, 7, 10, 9, 2, 15, 14, 4, 10, 4, 4, 12, 2, 4, 4, 1, 6, 15, 6, 2, 9, 9, 13, 12, 5, 3, 6, 5, 3, 12, 10, 5, 5, 12, 15, 5, 9, 11, 8, 6, 3, 6, 14, 5, 7, 12, 6, 9, 2, 14, 3, 14, 3, 10, 15, 15, 9, 15, 2, 15, 11, 13, 7, 11, 10, 6, 10, 12, 13, 9, 13, 4, 2, 2, 14, 13, 10, 5, 6, 13, 11, 8, 11, 8, 14, 11, 15, 3, 15, 2, 3, 3, 9, 14, 7, 10, 11, 11, 14, 6, 3, 11, 12, 9, 7, 5, 14, 10, 6, 7, 9, 7, 12, 8, 7, 1, 14, 12, 11, 2, 7, 13, 5, 2, 13, 12, 9, 2, 13, 3, 8, 10, 8, 10, 7, 2, 1, 10, 10, 6, 15, 12, 2, 10, 7, 6 }; 48 | uint8_t sizeofSendingRollingCode = 3; // (2 - 10) increase this for extra security but will take longer to transmit, rollingCode[xxx] must be divisable by sizeofSendingRollingCode 49 | uint8_t consecutiveChecks = 10; // user can change this, lower means Tx & Rx will quickly become out of sync on failed attempts, higher will allow the Rx to resync to Tx but reduces security by increasing the number of correct rolling codes. 50 | uint8_t initValue = 3; // (1-14) user should change this, values 5 and 10 are weak, other values can be used with varying strength. No further guidance is given to make all systems as unique as possible 51 | uint16_t bruteForceInitialLockDownTime = 60;// (seconds) User can change this, each time 10 invalide codes is received the current number will be doubled for the lock down time, thus 60 seconds, then 120, 240, 480 etc. 52 | uint8_t bruteForceMaxBeforeLockDown = 10; // (times) User can change this, if this many incorrect codes is received lock down will be initiated. 53 | uint8_t forceReset[2] = { 8,12 }; // user should change this random code, triggered after pressing button 1 for > 5 seconds, it will transmit this code. 54 | uint16_t pulseDutyCycle = 400; // 290 - 500, lower faster less tolerant of interferance & less distance, higher slower but more tolerant to interference and more distance 55 | /************************************** 56 | *** End of User changable settings *** 57 | **************************************/ 58 | 59 | 60 | /**************************** 61 | *** DEBUG Options Follow *** 62 | ****************************/ 63 | 64 | // Uncomment for No Debugging to speed up execution 65 | // !*!*! NEVER PUT DEBUGGING INSIDE TRANSMISSION CRITICAL TIMING CODE !*!*! 66 | //#define debug(fmt, ...) 67 | //#define debugLoop(fmt, ...) 68 | //#define debugChangesLoop(fmt, ...) 69 | 70 | // Nano Version 71 | #ifdef __AVR_ATmega328P__ 72 | char buffer[60]; // WARNING: Do not exceed this debug text limit or NANO will become unstable !!! 73 | #define debug(fmt, ...) sprintf(buffer, fmt "\r", ##__VA_ARGS__); Serial.print(buffer); // Nano 74 | #define debugLoop(fmt, ...) sprintf(buffer, "%s: " fmt "\r", __func__, ##__VA_ARGS__); Serial.print(buffer); // Nano 75 | #define debugChangesLoop(fmt, ...) sprintf(buffer, "%s: " fmt "\r\n", __func__, ##__VA_ARGS__); Serial.print(buffer); // Nano 76 | #endif 77 | 78 | // ESP32 Version 79 | #ifdef ESP32 80 | #define debug(fmt, ...) Serial.printf(fmt "\r", ##__VA_ARGS__) // ESP 81 | #define debugLoop(fmt, ...) Serial.printf("%s: " fmt "\r", __func__, ##__VA_ARGS__) // ESP 82 | #endif 83 | 84 | #ifdef __AVR_ATmega328P__ 85 | uint8_t pinsTxRxToMCU[4] = { 4,5,6,7 }; // Pins to be used on the MCU: Tx4, Tx3, Tx1, Tx2 or RxD0, RxD1, RxD2, RxD3 86 | uint8_t buttonAndOutputPins[4] = { 8,9,10,11 }; // Pins to be used on the MCU: Btn1, Btn2, Btn3, Btn4 87 | uint8_t pinsRxTxIdLED[3] = { 0,0,0 }; // NANO Not Supported 88 | uint8_t pinRxCLK = 2; // Pin that Rx VT pin, LED (clock pulse) connects to 89 | uint8_t pinTxLED = 13; // Pin that Tx transmitting LED connects to 90 | #endif 91 | 92 | #ifdef ESP32 93 | uint8_t pinsTxRxToMCU[4] = { 18,19,21,22 }; //Pins to be used on the MCU : Tx4, Tx3, Tx1, Tx2 or RxD0, RxD1, RxD2, RxD3 94 | uint8_t buttonAndOutputPins[4] = { 26,27,14,12 }; // Pins to be used on the MCU: TxBtn/LED1, TxBtn/LED2, TxBtn/LED3, TxBtn/LED4 95 | uint8_t pinsRxTxIdLED[3] = { 32,33,25 }; // Pins to be used on the MCU: Tx1 LED, Tx2 LED, Tx3 LED 96 | uint8_t pinRxCLK = 23; // Pin that Rx VT pin, LED (clock pulse) connects to 97 | uint8_t pinTxLED = 13; // Pin that Tx transmitting LED connects to 98 | #endif 99 | 100 | uint16_t sizeofRollingCode = 0; 101 | uint8_t sizeofPins = 0; 102 | uint8_t sizeofbuttonAndOutputPins = 0; 103 | uint16_t rollingCodeNumber[3] = { 0,0,0 }; 104 | uint16_t maxRollingCodeNumber[3] = { 0,0,0 }; 105 | uint8_t checkRepeatCode[10] = { 0 }; 106 | uint8_t data[11] = { 0 }; 107 | uint8_t bruteForceCounter = 0; 108 | uint64_t bruteForceLockDownTime = bruteForceInitialLockDownTime; 109 | uint8_t sizeOfForcedReset = 0; 110 | 111 | // The setup() function runs once each time the micro-controller starts 112 | void setup() { 113 | Serial.begin(115200); 114 | sizeofPins = sizeof pinsTxRxToMCU; 115 | sizeofRollingCode = sizeof rollingCode; 116 | sizeofbuttonAndOutputPins = sizeof buttonAndOutputPins; 117 | sizeOfForcedReset = sizeof forceReset; 118 | 119 | #ifdef RANDOM_NUMBERS 120 | RandomCodeGenorator(); 121 | while (true); 122 | #endif //RANDOM_NUMBERS 123 | 124 | // Tx Mode 125 | #if defined MODE && !defined RANDOM_NUMBERS 126 | // Set up inputs for the buttons on the Tx 127 | for (uint8_t i = 0; i < sizeofbuttonAndOutputPins; i++) { 128 | pinMode(buttonAndOutputPins[i], INPUT_PULLUP); 129 | } 130 | // Set all Tx signal pins HIGH, no transmision 131 | for (uint8_t i = 0; i < sizeofPins; i++) { 132 | pinMode(pinsTxRxToMCU[i], OUTPUT); 133 | digitalWrite(pinsTxRxToMCU[i], HIGH); 134 | } 135 | pinMode(pinTxLED, OUTPUT); 136 | // Split RollingCode Array between the number of Tx the system will support 137 | debug("\n\nTx Mode, TxIDNo = %d\n", TxIdNumber); 138 | SetupRollingCodeNumbersForEachTx(); 139 | #endif // Tx Mode 140 | 141 | 142 | // Rx Mode 143 | #if !defined MODE && !defined RANDOM_NUMBERS 144 | // Pin pinRxCLK is used to detect the VT signal from the Rx that indicates that there is an quichip authorised incoming transmission 145 | pinMode(pinRxCLK, INPUT_PULLUP); 146 | // Set up the output on the Rx for the Tx User Buttons 147 | for (uint8_t i = 0; i < sizeofbuttonAndOutputPins; i++) { 148 | pinMode(buttonAndOutputPins[i], OUTPUT); 149 | digitalWrite(buttonAndOutputPins[i], LOW); 150 | } 151 | // Set all Rx input signal pins 152 | for (uint8_t i = 0; i < sizeofPins; i++) { 153 | pinMode(pinsTxRxToMCU[i], INPUT); 154 | } 155 | // Set up Rx TxID outputs 156 | for (uint8_t i = 0; i < sizeof pinsRxTxIdLED; i++) { 157 | pinMode(pinsRxTxIdLED[i], OUTPUT); 158 | digitalWrite(pinsRxTxIdLED[i], LOW); 159 | } 160 | // Split RollingCode Array between the number of Tx the system will support 161 | Serial.println("\n\nRx Mode\n"); 162 | SetupRollingCodeNumbersForEachTx(); 163 | #endif // Rx Mode 164 | } 165 | 166 | // Add the main program code into the continuous loop() function 167 | 168 | // On Raising edge of Rx signal the Tx will go HIGH for 210ms 169 | // Rx signal must hold LOW for 2ms for stable signal, but given Tx will be HIGH for 210ms then Rx may as well be HIGH for 285ms 170 | // Tx will need to be LOW state for 80ms minimum before next signal, thus duty cycle is 287ms absolute minimum. 171 | 172 | #if defined MODE && !defined RANDOM_NUMBERS 173 | // Tx Mode 174 | void loop() { 175 | 176 | //check if button pressed 177 | for (uint8_t i = 0; i < sizeofbuttonAndOutputPins; i++) { 178 | 179 | if (digitalRead(buttonAndOutputPins[i]) == LOW) { 180 | digitalWrite(pinTxLED, HIGH); 181 | 182 | // time the button press 183 | uint64_t buttonTimer = millis(); 184 | while (digitalRead(buttonAndOutputPins[i]) == LOW); 185 | if (millis() - buttonTimer >= 5000) { 186 | debug("\n\nTransmit Forced Reset Signal\n"); 187 | rollingCodeNumber[TxIdNumber-1] = maxRollingCodeNumber[TxIdNumber-1]; 188 | 189 | TransmitData(9, forceReset, sizeOfForcedReset); // 9 indicates forced reset to Transmit function 190 | 191 | //// send a forced reset signal 192 | //for (uint8_t number = 0; number < sizeOfForcedReset; number++) { 193 | // uint64_t pulseTimer = millis() + pulseDutyCycle; // Minimum pulse duty cycle is 290ms, increase if many errors are received 194 | 195 | // for (uint8_t i = 0; i < sizeofPins; i++) { 196 | // if (bitRead(forceReset[number], i)) digitalWrite(pinsTxRxToMCU[i], LOW); else digitalWrite(pinsTxRxToMCU[i], HIGH); 197 | // } 198 | // delay(5); // give time for quichip to detect change 199 | 200 | // // Reset the Tx pins 201 | // for (uint8_t i = 0; i < sizeofPins; i++) { 202 | // digitalWrite(pinsTxRxToMCU[i], HIGH); 203 | // } 204 | 205 | // // control the timing 206 | // while (millis() <= pulseTimer); 207 | //} 208 | 209 | // TODO review the next line - unnecessary ? 210 | //rollingCodeNumber[TxIdNumber] >= maxRollingCodeNumber[TxIdNumber]; // Triggers InitValue code 211 | ApplyInitValueToRollingCodeLoop(); 212 | 213 | debug(" Done... \n"); 214 | digitalWrite(pinTxLED, LOW); 215 | break; // leave for next loop 216 | } 217 | 218 | TransmitData(i, rollingCode, sizeofSendingRollingCode); 219 | 220 | //uint8_t functionButtons = 0; 221 | //// read users buttons 222 | //// TODO must capture all user buttons, allow for slight delay in pressing two user buttons together for example 223 | //// always capture the intial button press 224 | //functionButtons = 0 | (i + 1); 225 | //// check all buttons , OR comparision will not interfere with initial button pressed set above 226 | //for (uint8_t x = 0; x < sizeofbuttonAndOutputPins; x++) { 227 | // if (digitalRead(x) == LOW) functionButtons | (x + 1); 228 | //} 229 | 230 | //// Prepare the Transmission Array 231 | //// place debugging outside of transmission loop so baud is not effected 232 | //debug("\n\nTransmit Rolling Code: \n"); 233 | //for (uint8_t i = 0; i < sizeofSendingRollingCode; i++) { 234 | // data[i] = rollingCode[rollingCodeNumber[TxIdNumber] + i]; 235 | // if (i == 0) { 236 | // debug("TxIDNo %d\n", TxIdNumber); 237 | // debug("Embed TxIDNo was = %d ", data[0]); 238 | // // Embed the Tx number onto Data[0] Rolling Code Value 239 | // bitWrite(data[0], 0, bitRead(TxIdNumber, 0)); 240 | // bitWrite(data[0], 1, bitRead(TxIdNumber, 1)); 241 | // debug("now = %d\n", data[0]); 242 | // } 243 | // debug("p.%d = %d\n", rollingCodeNumber[TxIdNumber] + i, data[i]); 244 | //} 245 | //// add the button data 246 | //data[sizeofSendingRollingCode] = functionButtons; 247 | //debug("Button Pressed = %d \n", data[sizeofSendingRollingCode]); 248 | 249 | //// send the data (rolling code & button value) 250 | //for (uint8_t number = 0; number < sizeofSendingRollingCode + 1; number++) { 251 | // uint64_t pulseTimer = millis() + pulseDutyCycle; // Minimum pulse duty cycle is 290ms, increase if many errors are received 252 | 253 | // for (uint8_t i = 0; i < sizeofPins; i++) { 254 | // if (bitRead(data[number], i)) digitalWrite(pinsTxRxToMCU[i], LOW); else digitalWrite(pinsTxRxToMCU[i], HIGH); 255 | // } 256 | // delay(5); // give time for quichip to detect change 257 | 258 | // // Reset the Tx pins 259 | // for (uint8_t i = 0; i < sizeofPins; i++) { 260 | // digitalWrite(pinsTxRxToMCU[i], HIGH); 261 | // } 262 | 263 | // // control the timing 264 | // while (millis() <= pulseTimer); 265 | //} 266 | 267 | // TODO - Change this so where sizeofRollingCode is not divisable by sizeofSendingRollingCode then the next sequency through is different to the last. 268 | // Thus, the next run through may start at psotion 1 or 2 ect to given a different roll for 3 numbers etc. 269 | rollingCodeNumber[TxIdNumber-1] = rollingCodeNumber[TxIdNumber-1] + sizeofSendingRollingCode; 270 | ApplyInitValueToRollingCodeLoop(); 271 | digitalWrite(pinTxLED, LOW); 272 | } 273 | } 274 | } 275 | 276 | 277 | void TransmitData(uint8_t btnNumber, uint8_t DataArray[], uint8_t sizeofDataArray) { 278 | 279 | // Debug Only 280 | debug("Send Data:\n"); 281 | for (uint8_t y = 0; y < sizeofDataArray; y++) { 282 | debug("%d,", DataArray[y]); 283 | } 284 | 285 | 286 | uint8_t functionButtons = 0; 287 | uint16_t tempRollingCodeNumber = rollingCodeNumber[TxIdNumber-1]; 288 | if (btnNumber == 9) tempRollingCodeNumber = 0; 289 | 290 | // read users buttons 291 | // TODO must capture all user buttons, allow for slight delay in pressing two user buttons together for example 292 | // always capture the intial button press 293 | functionButtons = 0 | (btnNumber + 1); 294 | // check all buttons , OR comparision will not interfere with initial button pressed set above 295 | for (uint8_t x = 0; x < sizeofbuttonAndOutputPins; x++) { 296 | if (digitalRead(x) == LOW) functionButtons | (x + 1); 297 | } 298 | 299 | // Prepare the Transmission Array 300 | // place debugging outside of transmission loop so baud is not effected 301 | debug("\n\nTransmit Rolling Code: \n"); 302 | for (uint8_t i = 0; i < sizeofDataArray; i++) { 303 | data[i] = DataArray[tempRollingCodeNumber + i]; 304 | if (i == 0) { 305 | debug("TxIDNo %d\n", TxIdNumber); 306 | debug("Embed TxIDNo was = %d ", data[0]); 307 | // Embed the Tx number onto Data[0] Rolling Code Value 308 | bitWrite(data[0], 0, bitRead(TxIdNumber, 0)); 309 | bitWrite(data[0], 1, bitRead(TxIdNumber, 1)); 310 | debug("now = %d\n", data[0]); 311 | } 312 | debug("p.%d = %d\n", tempRollingCodeNumber + i, data[i]); 313 | } 314 | 315 | if (btnNumber != 9) { 316 | // add the button data 317 | data[sizeofDataArray] = functionButtons; 318 | debug("Button Pressed = %d \n", data[sizeofDataArray]); 319 | sizeofDataArray++; 320 | } 321 | 322 | // send the data (rolling code & button value) 323 | for (uint8_t number = 0; number < sizeofDataArray; number++) { 324 | uint64_t pulseTimer = millis() + pulseDutyCycle; // Minimum pulse duty cycle is 290ms, increase if many errors are received 325 | 326 | for (uint8_t i = 0; i < sizeofPins; i++) { 327 | if (bitRead(data[number], i)) digitalWrite(pinsTxRxToMCU[i], LOW); else digitalWrite(pinsTxRxToMCU[i], HIGH); 328 | } 329 | delay(5); // give time for quichip to detect change 330 | 331 | // Reset the Tx pins 332 | for (uint8_t i = 0; i < sizeofPins; i++) { 333 | digitalWrite(pinsTxRxToMCU[i], HIGH); 334 | } 335 | 336 | // control the timing 337 | while (millis() <= pulseTimer); 338 | } 339 | } 340 | 341 | #endif // Tx Mode 342 | 343 | 344 | #if !defined MODE && !defined RANDOM_NUMBERS 345 | // Rx Mode 346 | void loop() { 347 | 348 | // Read the data being received by the Rx, if any check it for validity 349 | // QaiChip modules need to be bound Tx to Rx, thus if data is accepted by the Rx we should validate it. 350 | FAIL: 351 | if (Rx_AcceptData()) { 352 | if (CheckRepeatedRollingCode()) { 353 | ApplyInitValueToRollingCodeLoop(); 354 | goto FAIL; 355 | } 356 | 357 | // check the rolling code 358 | uint16_t tryRollingNumber = 0; 359 | uint8_t passed = 0; 360 | uint8_t tempRollingCode = 0; 361 | 362 | // Extract the Tx number from Data[0] Rolling Code Value 363 | bitWrite(TxIdNumber, 0, bitRead(data[0], 0)); 364 | bitWrite(TxIdNumber, 1, bitRead(data[0], 1)); 365 | 366 | // check the next x rolling codes 367 | for (uint8_t i = 0; i < consecutiveChecks * sizeofSendingRollingCode; i = i + sizeofSendingRollingCode) { 368 | tryRollingNumber = rollingCodeNumber[TxIdNumber-1] + i; 369 | // TODO - is this next line really necessary, old code before for/next ? 370 | if (tryRollingNumber >= sizeofRollingCode) rollingCodeNumber[TxIdNumber-1] + i; 371 | 372 | for (uint16_t x = tryRollingNumber; x < tryRollingNumber + sizeofSendingRollingCode; x++) { 373 | tempRollingCode = rollingCode[x]; 374 | 375 | if (x - tryRollingNumber == 0) { 376 | debug("TxIDNo %d\n", TxIdNumber); 377 | debug("Extract TxIDNo was %d ", tempRollingCode); 378 | // Embed the Tx number into tempRollingCode Value before testing it 379 | bitWrite(tempRollingCode, 0, bitRead(TxIdNumber, 0)); 380 | bitWrite(tempRollingCode, 1, bitRead(TxIdNumber, 1)); 381 | debug("now = %d\n", tempRollingCode); 382 | } 383 | 384 | if (data[x - tryRollingNumber] == tempRollingCode) { 385 | debug("p.%d: %d = %d \n", x, data[x - tryRollingNumber], tempRollingCode); 386 | passed++; 387 | } 388 | else { 389 | debug("p.%d: %d <> %d \n", x, data[x - tryRollingNumber], tempRollingCode); 390 | passed = 0; 391 | } 392 | } 393 | if (passed == sizeofSendingRollingCode) { 394 | break; 395 | } 396 | } 397 | 398 | 399 | // check the Forced Reset Code 400 | if (!passed) { 401 | for (uint16_t x = 0; x < sizeOfForcedReset; x++) { 402 | tempRollingCode = forceReset[x]; 403 | if (x == 0) { 404 | debug("Testing Forced Reset\n"); 405 | debug("TxIDNo %d\n", TxIdNumber); 406 | //debug("Extract TxIDNo was %d ", tempRollingCode); 407 | //// Embed the Tx number into tempRollingCode Value before testing it 408 | //bitWrite(tempRollingCode, 0, bitRead(TxIdNumber, 0)); 409 | //bitWrite(tempRollingCode, 1, bitRead(TxIdNumber, 1)); 410 | //debug("now = %d\n", tempRollingCode); 411 | } 412 | if (tempRollingCode == forceReset[x]) { 413 | debug("p.%d: %d = %d \n", x, forceReset[x], tempRollingCode); 414 | passed++; 415 | } 416 | else { 417 | debug("p.%d: %d <> %d \n", x, forceReset[x], tempRollingCode); 418 | passed = 0; 419 | } 420 | } 421 | // Forced Reset Received 422 | if (passed == sizeOfForcedReset) { 423 | rollingCodeNumber[TxIdNumber-1] = maxRollingCodeNumber[TxIdNumber-1]; // Triggers InitValue code 424 | debug("\n\nForced Reset Received\n"); 425 | ApplyInitValueToRollingCodeLoop(); 426 | goto FAIL; 427 | } 428 | } 429 | 430 | 431 | 432 | if (passed != sizeofSendingRollingCode) { 433 | rollingCodeNumber[TxIdNumber-1] += sizeofSendingRollingCode; 434 | debug(" Failed RC Checks\n"); 435 | bruteForceCounter++; 436 | if (bruteForceCounter >= bruteForceMaxBeforeLockDown) InitiateLockDown(); 437 | ApplyInitValueToRollingCodeLoop(); 438 | goto FAIL; 439 | } 440 | 441 | rollingCodeNumber[TxIdNumber-1] = tryRollingNumber + sizeofSendingRollingCode; 442 | debug(" Passed RC Checks\n"); 443 | bruteForceCounter = 0; 444 | bruteForceLockDownTime = bruteForceInitialLockDownTime; 445 | // Light the Tx ID LED (NANO NOT Supported) 446 | digitalWrite(pinsRxTxIdLED[TxIdNumber-1], HIGH); 447 | ActivateRxButtonPins(); 448 | ApplyInitValueToRollingCodeLoop(); 449 | // Clear the Tx ID LED (NANO NOT Supported) 450 | digitalWrite(pinsRxTxIdLED[TxIdNumber-1], LOW); 451 | } 452 | } 453 | 454 | 455 | 456 | uint8_t Rx_AcceptData() { 457 | //debug("AcceptData() Called \n"); 458 | uint8_t countOfDataReceived = 0; 459 | uint64_t transmissionTimer = millis() + ((pulseDutyCycle *1.5) * sizeofSendingRollingCode); // Pulse duty cycle is 287ms 460 | uint8_t readCode = 0; 461 | uint64_t pulseTimer = 0; 462 | if (digitalRead(pinRxCLK)) { 463 | while (millis() <= transmissionTimer) { 464 | if (digitalRead(pinRxCLK)) { 465 | //debug("digitalRead Passed \n"); 466 | pulseTimer = millis() + pulseDutyCycle; // Min Pulse duty cycle is 287ms 467 | 468 | for (int8_t i = sizeofPins - 1; i >= 0; i--) { 469 | bitWrite(readCode, i, digitalRead(pinsTxRxToMCU[i])); 470 | } 471 | //debug("countOfDataReceived = %d \n", countOfDataReceived); 472 | debug("%d, ", readCode); 473 | data[countOfDataReceived] = readCode; 474 | countOfDataReceived++; 475 | if (countOfDataReceived == sizeofSendingRollingCode + 1) { 476 | debug("\nRecieved %d bytes - OK\n", countOfDataReceived); 477 | while (digitalRead(pinRxCLK) && millis() <= pulseTimer); 478 | return countOfDataReceived; 479 | } 480 | // control the timing 481 | while (digitalRead(pinRxCLK) && millis() <= pulseTimer); 482 | } 483 | } 484 | debug("\n\nOnly Recieved %d bytes - TimeOut\n", countOfDataReceived); 485 | } 486 | return countOfDataReceived; 487 | } 488 | 489 | 490 | 491 | bool CheckRepeatedRollingCode() { 492 | // check rolling code is not a repeat of the last one 493 | // TODO - if we receive the same rolling code then send "Hack Attack" text message to mobile 494 | // Since qaichip is bound to Rx, then anything reaching this stage must be a record and playback message 495 | uint8_t checkRepeatCodeCounter = 0; 496 | for (uint8_t i = 0; i < sizeofSendingRollingCode; i++) { 497 | if (checkRepeatCode[i] == data[i]) checkRepeatCodeCounter++; 498 | } 499 | if (checkRepeatCodeCounter == sizeofSendingRollingCode) { 500 | debug("Rolling Code Repeat Detected \n"); 501 | return true; 502 | } 503 | else { // capture this rolling code for next time 504 | for (uint8_t i = 0; i < sizeofSendingRollingCode; i++) { 505 | checkRepeatCode[i] = data[i]; 506 | } 507 | } 508 | return false; 509 | } 510 | 511 | 512 | void ActivateRxButtonPins() { 513 | uint8_t functionButtons = data[sizeofSendingRollingCode]; 514 | debug("Button Pressed %d\n\n\n", functionButtons); 515 | for (uint8_t i = 0; i < sizeofbuttonAndOutputPins; i++) { 516 | //debug("button bit % d = % d \n", i, bitRead(functionButtons, i)); 517 | } 518 | // activate Rx pins for 210ms based on original qaichip Tx 519 | digitalWrite(buttonAndOutputPins[functionButtons - 1], HIGH); 520 | uint64_t waitTimer = millis() + 210; 521 | while (millis() <= waitTimer); 522 | for (uint8_t i = 0; i < sizeofbuttonAndOutputPins; i++) { 523 | digitalWrite(buttonAndOutputPins[i], LOW); 524 | } 525 | } 526 | 527 | 528 | void InitiateLockDown() { 529 | uint64_t LockDownTimer = millis() + (bruteForceLockDownTime * 1000); 530 | debug("Lock Down Started \n"); 531 | debug("bruteForceLockDownTime: %u s\n", bruteForceLockDownTime); 532 | while (millis() < LockDownTimer); 533 | debug("Lock Down Endded\n"); 534 | // double the lock down time in case it is a constant threat. 535 | bruteForceLockDownTime *= 2; 536 | bruteForceCounter = 0; 537 | } 538 | 539 | #endif // RxMode 540 | 541 | 542 | #ifdef RANDOM_NUMBERS 543 | void loop(){} 544 | void RandomCodeGenorator() { 545 | // Choose 2 random resitors and connect 1 from 5v to A0 and the other from GND to A0 to make a voltage divider 546 | debug("\n AO reading %d used as Random Seed \n", analogRead(A0)); 547 | debug("Random Codes: \n"); 548 | randomSeed(analogRead(A0)); 549 | for (uint16_t i = 0; i < 1106; i++) { 550 | random(analogRead(A0)); 551 | byte randNumber = random(15) + 1; 552 | debug("%d, ",randNumber); 553 | } 554 | } 555 | #endif // RANDOM_NUMBERS 556 | 557 | 558 | // The following code required for both Tx and Rx 559 | #ifndef RANDOM_NUMBERS 560 | 561 | // Apply initValue to the rollingCode[] pattern once the pattern has been used 562 | void ApplyInitValueToRollingCodeLoop() { 563 | if (rollingCodeNumber[TxIdNumber-1] >= maxRollingCodeNumber[TxIdNumber-1]) { 564 | debug("New Rolling Code Loop Generating\n"); 565 | debug("Triggered by Tx%d\n", TxIdNumber); 566 | debug("rollingCodeNumber = %d\n sizeofRollingCode = %d\n", rollingCodeNumber[TxIdNumber-1], sizeofRollingCode); 567 | rollingCodeNumber[TxIdNumber-1] = int(sizeofRollingCode / numberOfTxAttached) * TxIdNumber; 568 | for (uint16_t y = rollingCodeNumber[TxIdNumber-1]; y <= maxRollingCodeNumber[TxIdNumber-1] ; y++) { 569 | debug("Position %d was %d ", y, rollingCode[y]); 570 | rollingCode[y] += initValue; 571 | if (rollingCode[y] > 15) rollingCode[y] = int(rollingCode[y] / 15); 572 | debug("now %d \n", rollingCode[y]); 573 | } 574 | // TODO is the next line really needed ? 575 | rollingCodeNumber[TxIdNumber-1] = int(sizeofRollingCode / numberOfTxAttached) * TxIdNumber; 576 | } 577 | } 578 | 579 | 580 | // Split RollingCode Array between the number of Tx the system will support 581 | void SetupRollingCodeNumbersForEachTx() { 582 | debug("\nSetting up Tx/Rx RC Arrays:\n"); 583 | debug("sizeofRollingCode %d, sizeofSendingRollingCode %d \n", sizeofRollingCode, sizeofSendingRollingCode); 584 | rollingCodeNumber[0] = 0; 585 | rollingCodeNumber[1] = int(sizeofRollingCode / numberOfTxAttached) * 1; 586 | rollingCodeNumber[2] = int(sizeofRollingCode / numberOfTxAttached) * 2; 587 | maxRollingCodeNumber[0] = rollingCodeNumber[0] + (uint16_t)sizeofSendingRollingCode * int((sizeofRollingCode / numberOfTxAttached) / (uint16_t)sizeofSendingRollingCode) - 1; 588 | maxRollingCodeNumber[1] = rollingCodeNumber[1] + (uint16_t)sizeofSendingRollingCode * int((sizeofRollingCode / numberOfTxAttached) / (uint16_t)sizeofSendingRollingCode) - 1; 589 | maxRollingCodeNumber[2] = rollingCodeNumber[2] + (uint16_t)sizeofSendingRollingCode * int((sizeofRollingCode / numberOfTxAttached) / (uint16_t)sizeofSendingRollingCode) - 1; 590 | for (uint8_t i = 0; i < numberOfTxAttached; i++) { 591 | debug("Tx%d/Rx%d Range %d to %d\n", i+1, i+1, rollingCodeNumber[i], maxRollingCodeNumber[i]); 592 | } 593 | } 594 | #endif -------------------------------------------------------------------------------- /433mhz_Rolling_Code.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 16 4 | VisualStudioVersion = 16.0.34301.259 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "433mhz_Rolling_Code", "433mhz_Rolling_Code.vcxproj", "{C5F80730-F44F-4478-BDAE-6634EFC2CA88}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|x86 = Debug|x86 11 | Release|x86 = Release|x86 12 | EndGlobalSection 13 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 14 | {C5F80730-F44F-4478-BDAE-6634EFC2CA88}.Debug|x86.ActiveCfg = Debug|Win32 15 | {C5F80730-F44F-4478-BDAE-6634EFC2CA88}.Debug|x86.Build.0 = Debug|Win32 16 | {C5F80730-F44F-4478-BDAE-6634EFC2CA88}.Release|x86.ActiveCfg = Release|Win32 17 | {C5F80730-F44F-4478-BDAE-6634EFC2CA88}.Release|x86.Build.0 = Release|Win32 18 | EndGlobalSection 19 | GlobalSection(SolutionProperties) = preSolution 20 | HideSolutionNode = FALSE 21 | EndGlobalSection 22 | GlobalSection(ExtensibilityGlobals) = postSolution 23 | SolutionGuid = {91A1F740-90EF-4CBC-A52C-7DDDCE03A2BD} 24 | EndGlobalSection 25 | EndGlobal 26 | -------------------------------------------------------------------------------- /433mhz_Rolling_Code.vcxproj.filters: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 6 | cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx 7 | 8 | 9 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 10 | h;hh;hpp;hxx;hm;inl;inc;xsd 11 | 12 | 13 | {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} 14 | rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | Header Files 23 | 24 | 25 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /Nano Tx Rx Connections.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/Nano Tx Rx Connections.png -------------------------------------------------------------------------------- /PulseView (RX480 Output Pins).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/PulseView (RX480 Output Pins).png -------------------------------------------------------------------------------- /PulseView (Tx Rx Timing).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/PulseView (Tx Rx Timing).png -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | **Solution Methodology** 2 | 3 | The code is designed to be user configurable to add an element of uniqueness to each implementation which is a key part of the projects security. For example, a manufacture of a garage door has an implementation, hack one and you have hacked them all. 4 | Consider: The length of the list of random numbers can be decreased or increased (within memory limits), the amount of numbers sent each time between 2 and 10 is recommend (higher is more secure but more lag). The number of consecutive checks covers accidently presses on the Tx and allows the Rx to resync to the Tx position. The init-Value to be added once the list of Rolling Codes runs out. Even the Brute Force controls can be changed, here they are set so after 10 failed attempts the Rx Locks Out for 60 seconds, if repeated, 120, then 240 and 480 etc. A long press on the Tx button > 5 seconds a force a init-Value increament and restart of the new Rolling Code Loop (if activated), allowing emergancy resync of Tx to Rx and new numbers. 5 | ![User Configrable Settings](https://github.com/bionicbone/433mhz_Rolling_Code/blob/main/User%20Configrable%20Settings.png) 6 | 7 | **Rolling Code and Init-Value Example** 8 | ![Rolling Code and Init-Value Example](https://github.com/bionicbone/433mhz_Rolling_Code/blob/main/Rolling%20Code%20and%20Init-Value%20Example.png) 9 | 10 | 11 | **Initial Release Video** 12 | 13 | [https://www.youtube.com/watch?v=JLMbpiywVxQ](https://youtu.be/TpmY-2w8CTI) 14 | 15 | **Updates on 2nd Jan 2024** 16 | 17 | All 4 Buttons are now added, could be an addition for equipment already using qaichip TX-118S-4 v2 & RX480E parts 18 | 19 | code re-written, read "times out" if interference creeps in. 20 | 21 | **Updates on 5th Jan 2024** 22 | 23 | User configrable init-value added to the loop of rolling codes once they have all been consumed, thus only increaments after x codes consumed and invisible to hacker when this occurs or doesn't occur. 24 | 25 | Rx "Lock Out" for ever increasing time when 10 (user configarable) false codes have been received. 26 | 27 | Some documentaion has been added below. 28 | 29 | **Update Video** 30 | 31 | [https://youtu.be/VihT618iKPA?si=CvWJA-HzKL6Me9dn](https://youtu.be/VihT618iKPA?si=CvWJA-HzKL6Me9dn) 32 | 33 | **Updates on 10th Jan 2024** 34 | 35 | Add forced reset when button is pressed > 5 seconds, this applies the initValue to the rolling codes so they are not repeated and allows TX & Rx to resync at the begining of a new set of codes. 36 | 37 | **Updates on 14th Jan 2024** 38 | 39 | Add ESP32 Support 40 | -required for Tx Deep Sleep ( coming soon... ) 41 | -required for Rx advanced feature ( coming soon... ) 42 | Add ATmega328P and ESP32 compile instructions 43 | -around the debugging functions 44 | -around pin setups 45 | Add Tx Transmit LED on pinLED 46 | Embed Tx ID onto first nibble of Rolling Code in Tx 47 | Extract Tx ID rom first nibble of Rolling Code in Rx 48 | Add Rx Tx Identification LEDs fro Tx0, Tx1, Tx2 ID 49 | Share Rolling Codes for x number of attached Tx's 50 | Perfect timing in high interferance environments (timing user configrable) 51 | Tidied up some code - more to do 52 | Tidied up debugging messages 53 | Tested Perfect, no issues found 54 | 55 | **Mulit-Tx Update Video** 56 | 57 | [https://youtu.be/CfMDaaJQzlc](https://youtu.be/CfMDaaJQzlc) 58 | 59 | **RollJam Investigations Video** 60 | [https://youtu.be/gohp3LFnj8Y](https://youtu.be/gohp3LFnj8Y) 61 | 62 | **Decoding the QiaChip Signals Video** 63 | [https://youtu.be/DBNdfk8Yu3U](https://youtu.be/DBNdfk8Yu3U) 64 | 65 | **PulseView of Timing** 66 | 67 | The correct connection method when using a logic analyzer is at both Nano side connections not at the Rx Tx because the outputs on the Rx and Tx are not logical. Think of it as the Tx Nano is transmitting a nibble (4 bits) of data and the Rx Nano is receiving that nibble of data. Here are some close up pictures to help. 68 | 69 | Logic Analyzer 70 | ![DSC00073](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/5f58b94e-5015-4e45-8481-3c4371b61772) 71 | 72 | Tx Nano 73 | ![DSC00074](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/4a711066-c10e-4a55-b3d6-95a00ff8540a) 74 | 75 | Rx Nano 76 | ![DSC00076](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/079acf95-4e34-4057-9b5d-7d913e13cf4e) 77 | 78 | Results, short pulse is the Tx, Long Pulse is the Rx. The Tx should pulse a pattern and the Rx should receive the same pattern. 79 | ![PulseView1](https://github.com/bionicbone/433mhz_Rolling_Code/blob/main/PulseView%20(RX480%20Output%20Pins).png) 80 | 81 | ![PulseView2](https://github.com/bionicbone/433mhz_Rolling_Code/blob/main/PulseView%20(Tx%20Rx%20Timing).png) 82 | 83 | **Tx & Rx Connections for Arduino Nano** 84 | ![Nano TX Rx Connections](https://github.com/bionicbone/433mhz_Rolling_Code/blob/main/Nano%20Tx%20Rx%20Connections.png) 85 | 86 | **Watch the above videos for more information** 87 | 88 | Tx Nano 89 | ![DSC00084](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/8c3b369c-008a-4d64-9549-cf2db4eaaa40) 90 | 91 | ![DSC00085](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/4e7ff7af-a664-4805-9a6a-3a887bf1698e) 92 | 93 | ![DSC00087](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/78143535-a7f3-4c08-882b-8b96a292f79c) 94 | 95 | ![DSC00086](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/64bff07f-60d4-42f4-8239-1040f59840a8) 96 | 97 | Rx Nano 98 | ![DSC00081](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/7a4ddcb5-e1f7-47b9-9360-e9f12c40baed) 99 | 100 | ![DSC00082](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/05e247a5-adff-43fc-a4f4-85e4eff011bb) 101 | 102 | ![DSC00083](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/1cabe503-e7e5-49e9-89c4-14c02838744b) 103 | 104 | Tx ESP32S 105 | ![DSC00088](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/90471e75-18bc-4dcc-b14b-36287cf97699) 106 | 107 | ![DSC00089](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/5c868292-2191-4588-93f9-5d7f4a2518fc) 108 | 109 | ![DSC00090](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/b0b2030f-b9c5-4d89-bde2-ab35de4876c3) 110 | 111 | ![DSC00091](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/feeb637a-3dc8-4862-ba9d-9524abce5e2a) 112 | 113 | ![DSC00092](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/1b9d0faf-afe4-4088-a540-7691293f6f98) 114 | 115 | ![DSC00093](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/354788cb-a193-4cef-b115-c9e7e62e76bf) 116 | 117 | Rx ESP32 118 | ![DSC00094](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/30f422ed-bda6-4436-bd3a-219453a39c78) 119 | 120 | ![DSC00095](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/1e3ba498-e4b5-4f17-bbad-685f01d04a20) 121 | 122 | ![DSC00096](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/badee17d-245e-4c25-999b-01e3647cf4de) 123 | 124 | ![DSC00097](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/fbcbe548-0877-47e7-b5f8-e120f2a79131) 125 | 126 | ![DSC00098](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/006d2af5-92c8-4c33-92c7-c574dffa18bb) 127 | 128 | ![DSC00099](https://github.com/bionicbone/433mhz_Rolling_Code/assets/7845867/e83eea62-5dd5-49f2-a5d6-9fcff2da095d) 129 | 130 | 131 | Disclaimer: 132 | 133 | This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. This software is used at your own risk. I am under no obligation to maintain, support or leave this software or documentation in the public domain, likewise I am under no obligation to release designs for all the sensors or other electronics that I have developed. 134 | -------------------------------------------------------------------------------- /Rolling Code Example.xlsx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/Rolling Code Example.xlsx -------------------------------------------------------------------------------- /Rolling Code and Init-Value Example.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/Rolling Code and Init-Value Example.png -------------------------------------------------------------------------------- /User Configrable Settings.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/bionicbone/433mhz_Rolling_Code/0d9f6d1e3869d80c33eeb1284013e1cfbe060417/User Configrable Settings.png -------------------------------------------------------------------------------- /__vm/.433mhz_Rolling_Code.vsarduino.h: -------------------------------------------------------------------------------- 1 | /* 2 | Editor: https://www.visualmicro.com/ 3 | This file is for intellisense purpose only. 4 | Visual micro (and the arduino ide) ignore this code during compilation. This code is automatically maintained by visualmicro, manual changes to this file will be overwritten 5 | The contents of the _vm sub folder can be deleted prior to publishing a project 6 | All non-arduino files created by visual micro and all visual studio project or solution files can be freely deleted and are not required to compile a sketch (do not delete your own code!). 7 | Note: debugger breakpoints are stored in '.sln' or '.asln' files, knowledge of last uploaded breakpoints is stored in the upload.vmps.xml file. Both files are required to continue a previous debug session without needing to compile and upload again 8 | 9 | Hardware: ATmega328P (Old Bootloader) (Arduino Nano), Platform=avr, Package=arduino 10 | */ 11 | 12 | #if defined(_VMICRO_INTELLISENSE) 13 | 14 | #ifndef _VSARDUINO_H_ 15 | #define _VSARDUINO_H_ 16 | #define __AVR_atmega328p__ 17 | #define __AVR_ATmega328P__ 18 | #define __AVR_ATmega328p__ 19 | #define F_CPU 16000000L 20 | #define ARDUINO 108019 21 | #define ARDUINO_AVR_NANO 22 | #define ARDUINO_ARCH_AVR 23 | #define __cplusplus 201103L 24 | #define _Pragma(x) 25 | #define __AVR__ 26 | #define __inline__ 27 | #define __asm__(...) 28 | #define __extension__ 29 | #define __inline__ 30 | #define __volatile__ 31 | // Redefine __cplusplus to correct version: https://www.visualmicro.com/forums/YaBB.pl?num=1592217268 32 | #undef __cplusplus 33 | #define __cplusplus 201103L 34 | 35 | //#define GCC_VERSION 40902 36 | //https://www.visualmicro.com/forums/YaBB.pl?num=1569762585/5#5 37 | #define __GNUC__ 5 38 | #define __GNUC_MINOR__ 4 39 | #define __GNUC_PATCHLEVEL__ 0 40 | #define GCC_VERSION ((__GNUC__*10000)+(__GNUC_MINOR__*100)+__GNUC_PATCHLEVEL__)) 41 | 42 | 43 | #define volatile(va_arg) 44 | #define _CONST 45 | #define __builtin_va_start 46 | #define __builtin_va_end 47 | #define __attribute__(...) 48 | #define NOINLINE __attribute__((noinline)) 49 | #define prog_void 50 | #define PGM_VOID_P int 51 | 52 | 53 | #ifndef __builtin_constant_p 54 | #define __builtin_constant_p __attribute__((__const__)) 55 | #endif 56 | #ifndef __builtin_strlen 57 | #define __builtin_strlen __attribute__((__const__)) 58 | #endif 59 | 60 | 61 | #define NEW_H 62 | typedef void *__builtin_va_list; 63 | //extern "C" void __cxa_pure_virtual() {;} 64 | 65 | typedef int div_t; 66 | typedef int ldiv_t; 67 | 68 | 69 | typedef void *__builtin_va_list; 70 | //extern "C" void __cxa_pure_virtual() {;} 71 | 72 | 73 | 74 | #include "arduino.h" 75 | #include 76 | //#undef F 77 | //#define F(string_literal) ((const PROGMEM char *)(string_literal)) 78 | #undef PSTR 79 | #define PSTR(string_literal) ((const PROGMEM char *)(string_literal)) 80 | 81 | //typedef unsigned char uint8_t; 82 | //typedef unsigned int uint8_t; 83 | 84 | #define pgm_read_byte_near(address_short) uint8_t() 85 | #define pgm_read_byte(address_short) uint8_t() 86 | #define pgm_read_word(address_short) uint16_t() 87 | #define pgm_read_dword(address_short) uint32_t() 88 | #define pgm_read_float(address_short) float() 89 | #define pgm_read_ptr(address_short) short() 90 | 91 | #include "433mhz_Rolling_Code.ino" 92 | #endif 93 | #endif 94 | -------------------------------------------------------------------------------- /__vm/Compile.vmps.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /__vm/Configuration.Debug.vmps.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /__vm/Upload.vmps.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | --------------------------------------------------------------------------------