1 /* 2 * Author: Zion Orent <zorent (at) ics.com> 3 * Copyright (c) 2014 Intel Corporation. 4 * 5 * Permission is hereby granted, free of charge, to any person obtaining 6 * a copy of this software and associated documentation files (the 7 * "Software"), to deal in the Software without restriction, including 8 * without limitation the rights to use, copy, modify, merge, publish, 9 * distribute, sublicense, and/or sell copies of the Software, and to 10 * permit persons to whom the Software is furnished to do so, subject to 11 * the following conditions: 12 * 13 * The above copyright notice and this permission notice shall be 14 * included in all copies or substantial portions of the Software. 15 * 16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 17 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 19 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 20 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 21 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 22 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 23 */ 24 25 #include <unistd.h> 26 #include <iostream> 27 #include <signal.h> 28 #include "ppd42ns.h" 29 30 using namespace std; 31 32 int shouldRun = true; 33 34 void sig_handler(int signo) 35 { 36 if (signo == SIGINT) 37 shouldRun = false; 38 } 39 40 41 int main () 42 { 43 signal(SIGINT, sig_handler); 44 45 //! [Interesting] 46 // Instantiate a dust sensor on GPIO pin D8 47 upm::PPD42NS* dust = new upm::PPD42NS(8); 48 upm::dustData data; 49 cout << "This program will give readings every 30 seconds until you stop it" << endl; 50 while (shouldRun) 51 { 52 data = dust->getData(); 53 cout << "Low pulse occupancy: " << data.lowPulseOccupancy << endl; 54 cout << "Ratio: " << data.ratio << endl; 55 cout << "Concentration: " << data.concentration << endl; 56 } 57 //! [Interesting] 58 59 cout << "Exiting" << endl; 60 61 delete dust; 62 return 0; 63 } 64
