';
248 | }
249 |
250 | return toExport;
251 | };
252 |
253 | /**
254 | * Export the data
255 | */
256 | const onExport = () => {
257 | let ext = '';
258 | switch (exportType) {
259 | case 'text/plain':
260 | ext = 'txt';
261 | break;
262 | case 'application/json':
263 | ext = 'json';
264 | break;
265 | case 'text/html':
266 | ext = 'html';
267 | break;
268 | default:
269 | ext = 'csv';
270 | break;
271 | }
272 | save({
273 | multiple: false,
274 | filters: [
275 | {
276 | name: exportType,
277 | extensions: [ext],
278 | },
279 | ],
280 | })
281 | .then((res) => {
282 | if (res && res.length > 0) {
283 | const resExt = res.slice(((res.lastIndexOf('.') - 1) >>> 0) + 2);
284 | const path = resExt && resExt.length > 0 ? res : `${res}.${ext}`;
285 | invoke('save_string_to_disk', {
286 | content: getExportData(scanResults, exportType),
287 | path,
288 | })
289 | .then(() => {
290 | setSnackOpen(true);
291 | })
292 | .catch((e) => {
293 | d1(setError(e));
294 | });
295 | }
296 | })
297 | .catch((e) => {
298 | d1(setError(e));
299 | });
300 | };
301 |
302 | /**
303 | * Create a data object
304 | * @param id The ID
305 | * @param addr The address
306 | * @param port The port
307 | * @param hostName The host name
308 | * @param portStatus The port status
309 | * @param scanDate The scan date
310 | * @returns {{hostName, portType, address, port, scanDate}}
311 | */
312 | const createData = (id, addr, port, hostName, portStatus, scanDate) => ({
313 | id,
314 | address: addr,
315 | port,
316 | hostName,
317 | portStatus,
318 | scanDate,
319 | });
320 |
321 | const columns = [
322 | {
323 | field: 'address',
324 | headerName: language.address,
325 | editable: false,
326 | flex: 1,
327 | },
328 | {
329 | field: 'port',
330 | headerName: language.port,
331 | type: 'number',
332 | editable: false,
333 | },
334 | {
335 | field: 'hostName',
336 | headerName: language.hostName,
337 | editable: false,
338 | flex: 1,
339 | },
340 | {
341 | field: 'portStatus',
342 | headerName: language.portStatus,
343 | editable: false,
344 | flex: 1,
345 | },
346 | {
347 | field: 'scanDate',
348 | headerName: language.scanDate,
349 | editable: false,
350 | flex: 1,
351 | },
352 | ];
353 |
354 | const scanResultRows = [];
355 | if (scanResults && scanResults.length > 0) {
356 | for (const res of scanResults) {
357 | if (
358 | (noClosed && res.portStatus === 'Closed') ||
359 | (noUnknown && res.portStatus === 'Unknown')
360 | ) {
361 | continue;
362 | }
363 |
364 | let portStatus = language.closed;
365 | if (res.portStatus === 'Open') {
366 | portStatus = language.open;
367 | } else if (res.portStatus === 'Unknown') {
368 | portStatus = language.unknown;
369 | }
370 |
371 | scanResultRows.push(
372 | createData(
373 | res.address + res.port,
374 | res.address,
375 | res.port,
376 | res.hostName,
377 | portStatus,
378 | res.scanDate,
379 | ),
380 | );
381 | }
382 | }
383 |
384 | const addressElements = addresses.map((e, i) => {
385 | const canAdd = i === addresses.length - 1;
386 |
387 | return (
388 | 0 ? 1 : 0 }}>
389 |
390 | changeAddress(event, i)}
399 | onKeyDown={handleKeyDown}
400 | />
401 |
402 | {canAdd ? (
403 |
404 |
410 |
411 |
412 |
413 | ) : (
414 |
415 | removeAddress(i)}
419 | disabled={isScanning}
420 | >
421 |
422 |
423 |
424 | )}
425 |
426 | );
427 | });
428 |
429 | useEffect(() => {
430 | d1(setPageIndex(0));
431 | // eslint-disable-next-line react-hooks/exhaustive-deps
432 | }, []);
433 |
434 | return (
435 |
436 |
437 |
438 | {addressElements}
439 |
440 |
441 |
448 |
449 |
450 |
457 |
458 |
459 |
460 |
461 |
462 |
468 |
469 | {isScanning ? : null}
470 |
479 |
488 |
503 |
504 | {language.exportType}
505 |
519 |
520 |
521 |
522 | {language.exportSuccessful}
523 |
524 |
525 |
526 | );
527 | };
528 |
529 | export default Home;
530 |
--------------------------------------------------------------------------------
/src-tauri/src/main.rs:
--------------------------------------------------------------------------------
1 | // Prevents additional console window on Windows in release, DO NOT REMOVE!!
2 | #![cfg_attr(not(debug_assertions), windows_subsystem = "windows")]
3 |
4 | use crate::result::{PortStatus, ScanResult};
5 | use std::net::{IpAddr, Ipv4Addr, Ipv6Addr, Shutdown, TcpStream, ToSocketAddrs};
6 | use std::ops::Deref;
7 | use std::sync::atomic::{AtomicBool, Ordering};
8 | use std::sync::{Arc, Mutex};
9 | use std::thread::available_parallelism;
10 | use std::time::Duration;
11 | use std::{fs, thread};
12 | use tauri::Manager;
13 |
14 | mod result;
15 |
16 | struct SharedState {
17 | is_scanning: Arc,
18 | cancellation_token: Arc,
19 | last_error: Arc>,
20 | }
21 |
22 | fn main() {
23 | // Fix for NVIDIA
24 | #[cfg(target_os = "linux")]
25 | unsafe {
26 | std::env::set_var("WEBKIT_DISABLE_COMPOSITING_MODE", "1");
27 | }
28 |
29 | let shared_state = SharedState {
30 | is_scanning: Arc::new(AtomicBool::new(false)),
31 | cancellation_token: Arc::new(AtomicBool::new(false)),
32 | last_error: Arc::new(Mutex::new(String::from(""))),
33 | };
34 |
35 | tauri::Builder::default()
36 | .setup(|app| {
37 | #[cfg(debug_assertions)] // only include this code on debug builds
38 | {
39 | let window = app.get_webview_window("main").unwrap();
40 | window.open_devtools();
41 | }
42 | Ok(())
43 | })
44 | .plugin(tauri_plugin_os::init())
45 | .plugin(tauri_plugin_dialog::init())
46 | .manage(shared_state)
47 | .invoke_handler(tauri::generate_handler![
48 | open_website,
49 | scan_port_range,
50 | cancel_scan,
51 | get_number_of_threads,
52 | save_string_to_disk
53 | ])
54 | .run(tauri::generate_context!())
55 | .expect("error while running tauri application");
56 | }
57 |
58 | /// Save a string to disk
59 | ///
60 | /// # Arguments
61 | ///
62 | /// * `content` - The content that needs to be saved
63 | /// * `path` - The path where the content needs to be saved
64 | ///
65 | /// # Returns
66 | ///
67 | /// * `Ok(())` - If the content was saved successfully
68 | /// * `Err(String)` - If the content could not be saved
69 | #[tauri::command]
70 | fn save_string_to_disk(content: &str, path: &str) -> Result<(), String> {
71 | match fs::write(path, content) {
72 | Ok(_) => Ok(()),
73 | Err(e) => Err(e.to_string()),
74 | }
75 | }
76 |
77 | /// Get the number of threads that can be used for port scanning
78 | ///
79 | /// # Returns
80 | ///
81 | /// * `u32` - The number of threads that can be used for port scanning
82 | #[tauri::command]
83 | fn get_number_of_threads() -> usize {
84 | available_parallelism().unwrap().get()
85 | }
86 |
87 | /// Open a website using the default browser
88 | ///
89 | /// # Arguments
90 | ///
91 | /// * `website` - The website that needs to be opened
92 | ///
93 | /// # Returns
94 | ///
95 | /// * `Ok(())` - If the website was opened successfully
96 | /// * `Err(String)` - If the website could not be opened
97 | #[tauri::command]
98 | fn open_website(website: &str) -> Result<(), String> {
99 | match open::that(website) {
100 | Ok(_) => Ok(()),
101 | Err(e) => Err(e.to_string()),
102 | }
103 | }
104 |
105 | /// Cancel a port scan
106 | ///
107 | /// # Arguments
108 | ///
109 | /// * `state` - The shared state that contains the cancellation token
110 | ///
111 | /// # Returns
112 | ///
113 | /// * `Ok(())` - If the cancellation token was set successfully
114 | /// * `Err(String)` - If the cancellation token could not be set
115 | #[tauri::command]
116 | async fn cancel_scan(state: tauri::State<'_, SharedState>) -> Result<(), String> {
117 | if !state.is_scanning.load(Ordering::SeqCst) {
118 | return Err(String::from("No scan is currently running"));
119 | }
120 |
121 | state.cancellation_token.store(true, Ordering::SeqCst);
122 | state.is_scanning.store(false, Ordering::SeqCst);
123 |
124 | Ok(())
125 | }
126 |
127 | /// Scan a range of ports for a specified host
128 | ///
129 | /// # Arguments
130 | ///
131 | /// * `state` - The shared state that contains the cancellation token
132 | /// * `address` - The host that needs to be scanned
133 | /// * `start_port` - The initial port that needs to be scanned
134 | /// * `end_port` - The final port that needs to be scanned
135 | /// * `timeout` - The connection timeout (in milliseconds) before a port is marked as closed
136 | /// * `threads` - The number of threads that should be used to scan the ports
137 | /// * `sort` - Whether the results should be sorted by port number
138 | ///
139 | /// # Returns
140 | ///
141 | /// * `Ok(Vec)` - If the scan was successful
142 | /// * `Err(String)` - If the scan was unsuccessful
143 | #[tauri::command]
144 | async fn scan_port_range(
145 | state: tauri::State<'_, SharedState>,
146 | addresses: Vec,
147 | start_port: u16,
148 | end_port: u16,
149 | timeout: u64,
150 | threads: usize,
151 | sort: bool,
152 | ) -> Result, String> {
153 | if state.is_scanning.load(Ordering::SeqCst) {
154 | return Err(String::from("A scan is already running"));
155 | }
156 |
157 | state.is_scanning.store(true, Ordering::SeqCst);
158 | state.last_error.lock().unwrap().clear();
159 |
160 | let mut addresses_to_scan: Vec = vec![];
161 |
162 | for address in addresses {
163 | let cancellation_token = Arc::clone(&state.cancellation_token);
164 | // Check the cancellation token and return if it's true
165 | if cancellation_token.load(Ordering::Relaxed) {
166 | state.is_scanning.store(false, Ordering::SeqCst);
167 | state.cancellation_token.store(false, Ordering::SeqCst);
168 | return Ok(vec![]);
169 | }
170 |
171 | let mut address_parts = address.splitn(2, '/');
172 | let address = match address_parts.next() {
173 | Some(address) => address,
174 | None => {
175 | state.is_scanning.store(false, Ordering::SeqCst);
176 | state.cancellation_token.store(false, Ordering::SeqCst);
177 | return Err(format!("\"{}\" is an invalid address!", address));
178 | }
179 | };
180 |
181 | let subnet = address_parts.next();
182 | if subnet.is_some() {
183 | let subnet_parts = match subnet {
184 | Some(subnet) => subnet,
185 | None => {
186 | state.is_scanning.store(false, Ordering::SeqCst);
187 | state.cancellation_token.store(false, Ordering::SeqCst);
188 | return Err(format!("\"{:?}\" is an invalid subnet mask!", subnet));
189 | }
190 | };
191 | let subnet = match subnet_parts.parse::() {
192 | Ok(subnet) => subnet,
193 | Err(_) => {
194 | state.is_scanning.store(false, Ordering::SeqCst);
195 | state.cancellation_token.store(false, Ordering::SeqCst);
196 | return Err(format!("\"{}\" is an invalid subnet mask!", subnet_parts));
197 | }
198 | };
199 |
200 | // Validate the subnet mask
201 | if subnet == 0 {
202 | state.is_scanning.store(false, Ordering::SeqCst);
203 | state.cancellation_token.store(false, Ordering::SeqCst);
204 | return Err(String::from("Subnet mask cannot be 0"));
205 | }
206 |
207 | // Use a dummy port to resolve a possible hostname to a parsable IP address
208 | let dummy_address_res = format!("{}:80", address).to_socket_addrs();
209 | let mut dummy_address = match dummy_address_res {
210 | Ok(res) => res,
211 | Err(e) => {
212 | state.is_scanning.store(false, Ordering::SeqCst);
213 | state.cancellation_token.store(false, Ordering::SeqCst);
214 | return Err(format!(
215 | "{}:80 is an invalid socket address!\n{}",
216 | address, e
217 | ));
218 | }
219 | };
220 |
221 | let socket_address = dummy_address.next().unwrap();
222 | let ip_addr: IpAddr = socket_address.ip();
223 |
224 | match ip_addr {
225 | IpAddr::V4(v4) => {
226 | // Validate the subnet mask
227 | if subnet > 32 {
228 | state.is_scanning.store(false, Ordering::SeqCst);
229 | state.cancellation_token.store(false, Ordering::SeqCst);
230 | return Err(format!("\"{}\" is an invalid subnet mask!", subnet));
231 | }
232 |
233 | // Convert base IP address to a u32 integer
234 | let base_ip_u32 = u32::from(v4);
235 |
236 | // Calculate the subnet mask by shifting bits left
237 | let mask = !((1 << (32u8 - subnet)) - 1);
238 |
239 | // Get the network address by applying the subnet mask to the base IP
240 | let network_ip_u32 = base_ip_u32 & mask;
241 |
242 | // Calculate the number of host addresses in the subnet
243 | let num_addresses = 1 << (32 - subnet);
244 |
245 | for i in 0..num_addresses {
246 | let cancellation_token = Arc::clone(&state.cancellation_token);
247 | // Check the cancellation token and return if it's true
248 | if cancellation_token.load(Ordering::Relaxed) {
249 | state.is_scanning.store(false, Ordering::SeqCst);
250 | state.cancellation_token.store(false, Ordering::SeqCst);
251 | return Ok(vec![]);
252 | }
253 |
254 | let ip_u32 = network_ip_u32 + i;
255 | let ip = Ipv4Addr::from(ip_u32);
256 | addresses_to_scan.push(ip.to_string());
257 | }
258 | }
259 | IpAddr::V6(v6) => {
260 | // Validate the subnet mask
261 | if subnet > 128 {
262 | state.is_scanning.store(false, Ordering::SeqCst);
263 | state.cancellation_token.store(false, Ordering::SeqCst);
264 | return Err(format!("\"{}\" is an invalid subnet mask", subnet));
265 | }
266 |
267 | // Convert the IPv6 address to a u128 representation
268 | let ipv6_int = u128::from_be_bytes(v6.octets());
269 |
270 | // Create the subnet mask
271 | let mask = !((1u128 << (128 - subnet)) - 1);
272 |
273 | // Calculate the network base address (first IP in the subnet)
274 | let network_base = ipv6_int & mask;
275 |
276 | // Calculate the range of addresses in the subnet
277 | let subnet_size = 1u128 << (128 - subnet);
278 | let last_ip = network_base + subnet_size - 1;
279 |
280 | // Iterate through all IP addresses in the subnet
281 | for ip_int in network_base..=last_ip {
282 | let cancellation_token = Arc::clone(&state.cancellation_token);
283 | // Check the cancellation token and return if it's true
284 | if cancellation_token.load(Ordering::Relaxed) {
285 | state.is_scanning.store(false, Ordering::SeqCst);
286 | state.cancellation_token.store(false, Ordering::SeqCst);
287 | return Ok(vec![]);
288 | }
289 |
290 | let ip_addr = Ipv6Addr::from(ip_int.to_be_bytes());
291 | addresses_to_scan.push(ip_addr.to_string());
292 | }
293 | }
294 | }
295 | } else {
296 | addresses_to_scan.push(address.to_string());
297 | }
298 | }
299 |
300 | let mut threads = threads;
301 | let all_results: Arc>> = Arc::new(Mutex::new(vec![]));
302 |
303 | let mut scan_results: Vec = vec![];
304 | for address in addresses_to_scan {
305 | // Check the cancellation token and return if it's true
306 | let cancellation_token = Arc::clone(&state.cancellation_token);
307 | if cancellation_token.load(Ordering::Relaxed) {
308 | state.is_scanning.store(false, Ordering::SeqCst);
309 | state.cancellation_token.store(false, Ordering::SeqCst);
310 |
311 | let res = all_results.lock().unwrap();
312 | return Ok(res.deref().to_vec());
313 | }
314 |
315 | for port in start_port..=end_port {
316 | match format!("{}:{}", &address, port).to_socket_addrs() {
317 | Ok(res) => res,
318 | Err(e) => {
319 | state.is_scanning.store(false, Ordering::SeqCst);
320 | state.cancellation_token.store(false, Ordering::SeqCst);
321 | return Err(format!(
322 | "{}:{} is an invalid socket address!\n{}",
323 | address, port, e
324 | ));
325 | }
326 | };
327 |
328 | let scan_result = ScanResult::initialize(&address, port);
329 | scan_results.push(scan_result);
330 | }
331 | }
332 |
333 | if threads > 1 {
334 | if threads > scan_results.len() {
335 | threads = scan_results.len();
336 | }
337 |
338 | // Divide the scan results into equal parts for each thread
339 | let range = scan_results.len() / threads;
340 | let remainder = scan_results.len() % threads;
341 |
342 | let mut current_start = 0;
343 | let mut current_end = range - 1;
344 |
345 | let mut handles = vec![];
346 | for t in 0..threads {
347 | // Make sure the remainder is included in the last thread
348 | if t == threads - 1 && remainder > 0 {
349 | current_end += remainder;
350 | }
351 |
352 | let local_start = current_start;
353 | let local_end = current_end;
354 |
355 | let all_results = Arc::clone(&all_results);
356 | let cancellation_token = Arc::clone(&state.cancellation_token);
357 | let last_error = Arc::clone(&state.last_error);
358 |
359 | // Get a slice of the scan results for the current thread
360 | let scan_results_slice = scan_results[local_start..=local_end].to_vec();
361 |
362 | let handle = thread::spawn(move || {
363 | let mut local_results = vec![];
364 | for scan_result in scan_results_slice {
365 | if cancellation_token.load(Ordering::Relaxed) {
366 | break;
367 | }
368 |
369 | let address = scan_result.address.clone();
370 | let port = scan_result.port;
371 |
372 | let res = match scan_request(scan_result, timeout) {
373 | Ok(r) => r,
374 | Err(e) => {
375 | let mut last_error = last_error.lock().unwrap();
376 | *last_error = e.to_string();
377 | ScanResult::new(&address, port, "", PortStatus::Unknown)
378 | }
379 | };
380 |
381 | local_results.push(res);
382 | }
383 |
384 | // Append the results to the global results at the end of the thread
385 | let mut results = all_results.lock().unwrap();
386 | results.append(&mut local_results);
387 | });
388 | handles.push(handle);
389 |
390 | current_start = current_end + 1;
391 | current_end += range;
392 | }
393 |
394 | for handle in handles {
395 | handle.join().unwrap();
396 | }
397 | } else {
398 | for scan_result in scan_results {
399 | // Check the cancellation token and return if it's true
400 | let cancellation_token = Arc::clone(&state.cancellation_token);
401 | if cancellation_token.load(Ordering::Relaxed) {
402 | state.is_scanning.store(false, Ordering::SeqCst);
403 | state.cancellation_token.store(false, Ordering::SeqCst);
404 |
405 | let res = all_results.lock().unwrap();
406 | return Ok(res.deref().to_vec());
407 | }
408 |
409 | let res = scan_request(scan_result, timeout);
410 | let res = match res {
411 | Ok(res) => res,
412 | Err(e) => {
413 | return Err(e.to_string());
414 | }
415 | };
416 |
417 | let mut all = all_results.lock().unwrap();
418 | all.push(res);
419 | }
420 | }
421 |
422 | let mut res = all_results.lock().unwrap();
423 |
424 | if sort {
425 | // Sort by port number
426 | res.sort_by(|a, b| a.port.cmp(&b.port));
427 | }
428 |
429 | state.is_scanning.store(false, Ordering::SeqCst);
430 | state.cancellation_token.store(false, Ordering::SeqCst);
431 |
432 | if res.is_empty() {
433 | let last_error = state.last_error.lock().unwrap();
434 | if !last_error.is_empty() {
435 | return Err(last_error.deref().to_string());
436 | }
437 | }
438 |
439 | Ok(res.deref().to_vec())
440 | }
441 |
442 | /// Scan a single port on a specified host
443 | ///
444 | /// # Arguments
445 | ///
446 | /// * `request` - The request that needs to be scanned
447 | /// * `timeout` - The connection timeout (in milliseconds) before a port is marked as closed
448 | ///
449 | /// # Returns
450 | ///
451 | /// * `Ok(ScanResult)` - If the scan was successful
452 | /// * `Err(String)` - If the scan was unsuccessful
453 | fn scan_request(mut request: ScanResult, timeout: u64) -> Result {
454 | let address = format!("{}:{}", request.address, request.port).to_socket_addrs();
455 | let mut address = match address {
456 | Ok(res) => res,
457 | Err(e) => {
458 | return Err(e.to_string());
459 | }
460 | };
461 |
462 | let socket_address = address.next().unwrap();
463 | let ip_addr: IpAddr = socket_address.ip();
464 | let host_name = ip_addr.to_string();
465 |
466 | if let Ok(stream) = TcpStream::connect_timeout(&socket_address, Duration::from_millis(timeout))
467 | {
468 | request.set_scan_result(&host_name, PortStatus::Open);
469 |
470 | let res = stream.shutdown(Shutdown::Both);
471 | match res {
472 | Ok(_) => {}
473 | Err(e) => {
474 | println!("Unable to shut down TcpStream: {}", e)
475 | }
476 | }
477 | } else {
478 | request.set_scan_result(&host_name, PortStatus::Closed);
479 | }
480 |
481 | Ok(request)
482 | }
483 |
--------------------------------------------------------------------------------
/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 |
--------------------------------------------------------------------------------