Changes in Makefile

b2441318 - License cleanup: add SPDX GPL-2.0 license identifier to files with no license

Wed, 01 Nov 2017 14:07:57 +0000

License cleanup: add SPDX GPL-2.0 license identifier to files with no licenseMany source files in the tree are missing licensing information, whichmakes it harder for compliance tools to determine the correct license.By default all files without license information are under the defaultlicense of the kernel, which is GPL version 2.Update the files which contain no license information with the 'GPL-2.0'SPDX license identifier. The SPDX identifier is a legally bindingshorthand, which can be used instead of the full boiler plate text.This patch is based on work done by Thomas Gleixner and Kate Stewart andPhilippe Ombredanne.How this work was done:Patches were generated and checked against linux-4.14-rc6 for a subset ofthe use cases: - file had no licensing information it it. - file was a */uapi/* one with no licensing information in it, - file was a */uapi/* one with existing licensing information,Further patches will be generated in subsequent months to fix up caseswhere non-standard license headers were used, and references to licensehad to be inferred by heuristics based on keywords.The analysis to determine which SPDX License Identifier to be applied toa file was done in a spreadsheet of side by side results from of theoutput of two independent scanners (ScanCode & Windriver) producing SPDXtag:value files created by Philippe Ombredanne. Philippe prepared thebase worksheet, and did an initial spot review of a few 1000 files.The 4.13 kernel was the starting point of the analysis with 60,537 filesassessed. Kate Stewart did a file by file comparison of the scannerresults in the spreadsheet to determine which SPDX license identifier(s)to be applied to the file. She confirmed any determination that was notimmediately clear with lawyers working with the Linux Foundation.Criteria used to select files for SPDX license identifier tagging was: - Files considered eligible had to be source code files. - Make and config files were included as candidates if they contained >5 lines of source - File already had some variant of a license header in it (even if <5 lines).All documentation files were explicitly excluded.The following heuristics were used to determine which SPDX licenseidentifiers to apply. - when both scanners couldn't find any license traces, file was considered to have no license information in it, and the top level COPYING file license applied. For non */uapi/* files that summary was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 11139 and resulted in the first patch in this series. If that file was a */uapi/* path one, it was "GPL-2.0 WITH Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 WITH Linux-syscall-note 930 and resulted in the second patch in this series. - if a file had some form of licensing information in it, and was one of the */uapi/* ones, it was denoted with the Linux-syscall-note if any GPL family license was found in the file or had no licensing in it (per prior point). Results summary: SPDX license identifier # files ---------------------------------------------------|------ GPL-2.0 WITH Linux-syscall-note 270 GPL-2.0+ WITH Linux-syscall-note 169 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17 LGPL-2.1+ WITH Linux-syscall-note 15 GPL-1.0+ WITH Linux-syscall-note 14 ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5 LGPL-2.0+ WITH Linux-syscall-note 4 LGPL-2.1 WITH Linux-syscall-note 3 ((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3 ((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1 and that resulted in the third patch in this series. - when the two scanners agreed on the detected license(s), that became the concluded license(s). - when there was disagreement between the two scanners (one detected a license but the other didn't, or they both detected different licenses) a manual inspection of the file occurred. - In most cases a manual inspection of the information in the file resulted in a clear resolution of the license that should apply (and which scanner probably needed to revisit its heuristics). - When it was not immediately clear, the license identifier was confirmed with lawyers working with the Linux Foundation. - If there was any question as to the appropriate license identifier, the file was flagged for further research and to be revisited later in time.In total, over 70 hours of logged manual review was done on thespreadsheet to determine the SPDX license identifiers to apply to thesource files by Kate, Philippe, Thomas and, in some cases, confirmationby lawyers working with the Linux Foundation.Kate also obtained a third independent scan of the 4.13 code base fromFOSSology, and compared selected files where the other two scannersdisagreed against that SPDX file, to see if there was new insights. TheWindriver scanner is based on an older version of FOSSology in part, sothey are related.Thomas did random spot checks in about 500 files from the spreadsheetsfor the uapi headers and agreed with SPDX license identifier in thefiles he inspected. For the non-uapi files Thomas did random spot checksin about 15000 files.In initial set of patches against 4.14-rc6, 3 files were found to havecopy/paste license identifier errors, and have been fixed to reflect thecorrect identifier.Additionally Philippe spent 10 hours this week doing a detailed manualinspection and review of the 12,461 patched files from the initial patchversion early this week with: - a full scancode scan run, collecting the matched texts, detected license ids and scores - reviewing anything where there was a license detected (about 500+ files) to ensure that the applied SPDX license was correct - reviewing anything where there was no detection but the patch license was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied SPDX license was correctThis produced a worksheet with 20 files needing minor correction. Thisworksheet was then exported into 3 different .csv files for thedifferent types of files to be modified.These .csv files were then reviewed by Greg. Thomas wrote a script toparse the csv files and add the proper SPDX tag to the file, in theformat that the file expected. This script was further refined by Gregbased on the output to detect more types of files automatically and todistinguish between header and source .c files (which need differentcomment types.) Finally Greg ran the script using the .csv files togenerate the patches.Reviewed-by: Kate Stewart Reviewed-by: Philippe Ombredanne Reviewed-by: Thomas Gleixner Signed-off-by: Greg Kroah-Hartman List of files: /linux-6.15/crypto/async_tx/Makefile

48a9db46 - drivers/dma: remove unused support for MEMSET operations

Wed, 03 Jul 2013 22:05:06 +0000

drivers/dma: remove unused support for MEMSET operationsThere have never been any real users of MEMSET operations since theyhave been introduced in January 2007 by commit 7405f74badf4 ("dmaengine:refactor dmaengine around dma_async_tx_descriptor"). Therefore removesupport for them for now, it can be always brought back when needed.[sebastian.hesselbarth@gmail.com: fix drivers/dma/mv_xor]Signed-off-by: Bartlomiej Zolnierkiewicz Signed-off-by: Kyungmin Park Signed-off-by: Sebastian Hesselbarth Cc: Vinod Koul Acked-by: Dan Williams Cc: Tomasz Figa Cc: Herbert Xu Cc: Olof Johansson Cc: Kevin Hilman Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds List of files: /linux-6.15/crypto/async_tx/Makefile

cb3c8299 - async_tx: raid6 recovery self test

Tue, 14 Jul 2009 19:20:37 +0000

async_tx: raid6 recovery self testPort drivers/md/raid6test/test.c to use the async raid6 recoveryroutines. This is meant as a unit test for raid6 acceleration drivers. Inaddition to the 16-drive test case this implements tests for the 4-disk and5-disk special cases (dma devices can not generically handle less than 2sources), and adds a test for the D+Q case.Reviewed-by: Andre Noll Acked-by: Maciej Sosnowski Signed-off-by: Dan Williams List of files: /linux-6.15/crypto/async_tx/Makefile

0a82a623 - async_tx: add support for asynchronous RAID6 recovery operations

Tue, 14 Jul 2009 19:20:37 +0000

async_tx: add support for asynchronous RAID6 recovery operations async_raid6_2data_recov() recovers two data disk failures async_raid6_datap_recov() recovers a data disk and the P diskThese routines are a port of the synchronous versions found indrivers/md/raid6recov.c. The primary difference is breaking out the xoroperations into separate calls to async_xor. Two helper routines areintroduced to perform scalar multiplication where needed.async_sum_product() multiplies two sources by scalar coefficients andthen sums (xor) the result. async_mult() simply multiplies a singlesource by a scalar.This implemention also includes, in contrast to the originalsynchronous-only code, special case handling for the 4-disk and 5-diskarray cases. In these situations the default N-disk algorithm willpresent 0-source or 1-source operations to dma devices. To cover fordma devices where the minimum source count is 2 we implement 4-disk and5-disk handling in the recovery code.[ Impact: asynchronous raid6 recovery routines for 2data and datap cases ]Cc: Yuri Tikhonov Cc: Ilya Yanok Cc: H. Peter Anvin Cc: David Woodhouse Reviewed-by: Andre Noll Acked-by: Maciej Sosnowski Signed-off-by: Dan Williams List of files: /linux-6.15/crypto/async_tx/Makefile

b2f46fd8 - async_tx: add support for asynchronous GF multiplication

Tue, 14 Jul 2009 19:20:36 +0000

async_tx: add support for asynchronous GF multiplication[ Based on an original patch by Yuri Tikhonov ]This adds support for doing asynchronous GF multiplication by addingtwo additional functions to the async_tx API: async_gen_syndrome() does simultaneous XOR and Galois field multiplication of sources. async_syndrome_val() validates the given source buffers against known P and Q values.When a request is made to run async_pq against more than the hardwaremaximum number of supported sources we need to reuse the previousgenerated P and Q values as sources into the next operation. Care mustbe taken to remove Q from P' and P from Q'. For example to perform a 5source pq op with hardware that only supports 4 sources at a time thefollowing approach is taken:p, q = PQ(src0, src1, src2, src3, COEF({01}, {02}, {04}, {08}))p', q' = PQ(p, q, q, src4, COEF({00}, {01}, {00}, {10}))p' = p + q + q + src4 = p + src4q' = {00}*p + {01}*q + {00}*q + {10}*src4 = q + {10}*src4Note: 4 is the minimum acceptable maxpq otherwise we punt tosynchronous-software path.The DMA_PREP_CONTINUE flag indicates to the driver to reuse p and q assources (in the above manner) and fill the remaining slots up to maxpqwith the new sources/coefficients.Note1: Some devices have native support for P+Q continuation and can skipthis extra work. Devices with this capability can advertise it withdma_set_maxpq. It is up to each driver how to handle theDMA_PREP_CONTINUE flag.Note2: The api supports disabling the generation of P when generating Q,this is ignored by the synchronous path but is implemented by some dmadevices to save unnecessary writes. In this case the continuationalgorithm is simplified to only reuse Q as a source.Cc: H. Peter Anvin Cc: David Woodhouse Signed-off-by: Yuri Tikhonov Signed-off-by: Ilya Yanok Reviewed-by: Andre Noll Acked-by: Maciej Sosnowski Signed-off-by: Dan Williams List of files: /linux-6.15/crypto/async_tx/Makefile

9bc89cd8 - async_tx: add the async_tx api

Tue, 02 Jan 2007 18:10:44 +0000

async_tx: add the async_tx apiThe async_tx api provides methods for describing a chain of asynchronousbulk memory transfers/transforms with support for inter-transactionaldependencies. It is implemented as a dmaengine client that smooths overthe details of different hardware offload engine implementations. Codethat is written to the api can optimize for asynchronous operation and theapi will fit the chain of operations to the available offload resources. I imagine that any piece of ADMA hardware would register with the 'async_*' subsystem, and a call to async_X would be routed as appropriate, or be run in-line. - Neil Brownasync_tx exploits the capabilities of struct dma_async_tx_descriptor toprovide an api of the following general format:struct dma_async_tx_descriptor *async_(..., struct dma_async_tx_descriptor *depend_tx, dma_async_tx_callback cb_fn, void *cb_param){ struct dma_chan *chan = async_tx_find_channel(depend_tx, ); struct dma_device *device = chan ? chan->device : NULL; int int_en = cb_fn ? 1 : 0; struct dma_async_tx_descriptor *tx = device ? device->device_prep_dma_(chan, len, int_en) : NULL; if (tx) { /* run asynchronously */ ... tx->tx_set_dest(addr, tx, index); ... tx->tx_set_src(addr, tx, index); ... async_tx_submit(chan, tx, flags, depend_tx, cb_fn, cb_param); } else { /* run synchronously */ ... ... async_tx_sync_epilog(flags, depend_tx, cb_fn, cb_param); } return tx;}async_tx_find_channel() returns a capable channel from its pool. Thechannel pool is organized as a per-cpu array of channel pointers. Theasync_tx_rebalance() routine is tasked with managing these arrays. In theuniprocessor case async_tx_rebalance() tries to spread responsibilityevenly over channels of similar capabilities. For example if there are twocopy+xor channels, one will handle copy operations and the other willhandle xor. In the SMP case async_tx_rebalance() attempts to spread theoperations evenly over the cpus, e.g. cpu0 gets copy channel0 and xorchannel0 while cpu1 gets copy channel 1 and xor channel 1. When adependency is specified async_tx_find_channel defaults to keeping theoperation on the same channel. A xor->copy->xor chain will stay on onechannel if it supports both operation types, otherwise the transaction willtransition between a copy and a xor resource.Currently the raid5 implementation in the MD raid456 driver has beenconverted to the async_tx api. A driver for the offload engines on theIntel Xscale series of I/O processors, iop-adma, is provided in a latercommit. With the iop-adma driver and async_tx, raid456 is able to offloadcopy, xor, and xor-zero-sum operations to hardware engines. On iop342 tiobench showed higher throughput for sequential writes (20 - 30%improvement) and sequential reads to a degraded array (40 - 55%improvement). For the other cases performance was roughly equal, +/- a fewpercentage points. On a x86-smp platform the performance of the async_tximplementation (in synchronous mode) was also +/- a few percentage pointsof the original implementation. According to 'top' on iop342 CPUutilization drops from ~50% to ~15% during a 'resync' while the speedaccording to /proc/mdstat doubles from ~25 MB/s to ~50 MB/s. The tiobench command line used for testing was: tiobench --size 2048--block 4096 --block 131072 --dir /mnt/raid --numruns 5* iop342 had 1GB of memory availableDetails:* if CONFIG_DMA_ENGINE=n the asynchronous path is compiled away by making async_tx_find_channel a static inline routine that always returns NULL* when a callback is specified for a given transaction an interrupt will fire at operation completion time and the callback will occur in a tasklet. if the the channel does not support interrupts then a live polling wait will be performed* the api is written as a dmaengine client that requests all available channels* In support of dependencies the api implicitly schedules channel-switch interrupts. The interrupt triggers the cleanup tasklet which causes pending operations to be scheduled on the next channel* Xor engines treat an xor destination address differently than a software xor routine. To the software routine the destination address is an implied source, whereas engines treat it as a write-only destination. This patch modifies the xor_blocks routine to take a an explicit destination address to mirror the hardware.Changelog:* fixed a leftover debug print* don't allow callbacks in async_interrupt_cond* fixed xor_block changes* fixed usage of ASYNC_TX_XOR_DROP_DEST* drop dma mapping methods, suggested by Chris Leech* printk warning fixups from Andrew Morton* don't use inline in C files, Adrian Bunk* select the API when MD is enabled* BUG_ON xor source counts <= 1* implicitly handle hardware concerns like channel switching and interrupts, Neil Brown* remove the per operation type list, and distribute operation capabilities evenly amongst the available channels* simplify async_tx_find_channel to optimize the fast path* introduce the channel_table_initialized flag to prevent early calls to the api* reorganize the code to mimic crypto* include mm.h as not all archs include it in dma-mapping.h* make the Kconfig options non-user visible, Adrian Bunk* move async_tx under crypto since it is meant as 'core' functionality, and the two may share algorithms in the future* move large inline functions into c files* checkpatch.pl fixes* gpl v2 only correctionCc: Herbert Xu Signed-off-by: Dan Williams Acked-By: NeilBrown List of files: /linux-6.15/crypto/async_tx/Makefile