License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license 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 binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the 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 cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base 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 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately 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 license
identifiers 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 the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version 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 correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2006-03-23 18:56:55 +00:00
|
|
|
/*
|
|
|
|
* linux/include/linux/relay.h
|
|
|
|
*
|
|
|
|
* Copyright (C) 2002, 2003 - Tom Zanussi (zanussi@us.ibm.com), IBM Corp
|
|
|
|
* Copyright (C) 1999, 2000, 2001, 2002 - Karim Yaghmour (karim@opersys.com)
|
|
|
|
*
|
|
|
|
* CONFIG_RELAY definitions and declarations
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _LINUX_RELAY_H
|
|
|
|
#define _LINUX_RELAY_H
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/sched.h>
|
2007-05-09 09:34:01 +00:00
|
|
|
#include <linux/timer.h>
|
2006-03-23 18:56:55 +00:00
|
|
|
#include <linux/wait.h>
|
|
|
|
#include <linux/list.h>
|
relay: Use irq_work instead of plain timer for deferred wakeup
Relay avoids calling wake_up_interruptible() for doing the wakeup of
readers/consumers, waiting for the generation of new data, from the
context of a process which produced the data. This is apparently done to
prevent the possibility of a deadlock in case Scheduler itself is is
generating data for the relay, after acquiring rq->lock.
The following patch used a timer (to be scheduled at next jiffy), for
delegating the wakeup to another context.
commit 7c9cb38302e78d24e37f7d8a2ea7eed4ae5f2fa7
Author: Tom Zanussi <zanussi@comcast.net>
Date: Wed May 9 02:34:01 2007 -0700
relay: use plain timer instead of delayed work
relay doesn't need to use schedule_delayed_work() for waking readers
when a simple timer will do.
Scheduling a plain timer, at next jiffies boundary, to do the wakeup
causes a significant wakeup latency for the Userspace client, which makes
relay less suitable for the high-frequency low-payload use cases where the
data gets generated at a very high rate, like multiple sub buffers getting
filled within a milli second. Moreover the timer is re-scheduled on every
newly produced sub buffer so the timer keeps getting pushed out if sub
buffers are filled in a very quick succession (less than a jiffy gap
between filling of 2 sub buffers). As a result relay runs out of sub
buffers to store the new data.
By using irq_work it is ensured that wakeup of userspace client, blocked
in the poll call, is done at earliest (through self IPI or next timer
tick) enabling it to always consume the data in time. Also this makes
relay consistent with printk & ring buffers (trace), as they too use
irq_work for deferred wake up of readers.
[arnd@arndb.de: select CONFIG_IRQ_WORK]
Link: http://lkml.kernel.org/r/20160912154035.3222156-1-arnd@arndb.de
[akpm@linux-foundation.org: coding-style fixes]
Link: http://lkml.kernel.org/r/1472906487-1559-1-git-send-email-akash.goel@intel.com
Signed-off-by: Peter Zijlstra <peterz@infradead.org>
Signed-off-by: Akash Goel <akash.goel@intel.com>
Cc: Tom Zanussi <tzanussi@gmail.com>
Cc: Chris Wilson <chris@chris-wilson.co.uk>
Cc: Tvrtko Ursulin <tvrtko.ursulin@intel.com>
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-10-11 20:54:33 +00:00
|
|
|
#include <linux/irq_work.h>
|
2011-11-24 01:12:59 +00:00
|
|
|
#include <linux/bug.h>
|
2006-03-23 18:56:55 +00:00
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/poll.h>
|
|
|
|
#include <linux/kref.h>
|
2016-09-02 19:47:38 +00:00
|
|
|
#include <linux/percpu.h>
|
2006-03-23 18:56:55 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Tracks changes to rchan/rchan_buf structs
|
|
|
|
*/
|
2007-02-10 09:45:05 +00:00
|
|
|
#define RELAYFS_CHANNEL_VERSION 7
|
2006-03-23 18:56:55 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Per-cpu relay channel buffer
|
|
|
|
*/
|
|
|
|
struct rchan_buf
|
|
|
|
{
|
|
|
|
void *start; /* start of channel buffer */
|
|
|
|
void *data; /* start of current sub-buffer */
|
|
|
|
size_t offset; /* current offset into sub-buffer */
|
|
|
|
size_t subbufs_produced; /* count of sub-buffers produced */
|
|
|
|
size_t subbufs_consumed; /* count of sub-buffers consumed */
|
|
|
|
struct rchan *chan; /* associated channel */
|
|
|
|
wait_queue_head_t read_wait; /* reader wait queue */
|
relay: Use irq_work instead of plain timer for deferred wakeup
Relay avoids calling wake_up_interruptible() for doing the wakeup of
readers/consumers, waiting for the generation of new data, from the
context of a process which produced the data. This is apparently done to
prevent the possibility of a deadlock in case Scheduler itself is is
generating data for the relay, after acquiring rq->lock.
The following patch used a timer (to be scheduled at next jiffy), for
delegating the wakeup to another context.
commit 7c9cb38302e78d24e37f7d8a2ea7eed4ae5f2fa7
Author: Tom Zanussi <zanussi@comcast.net>
Date: Wed May 9 02:34:01 2007 -0700
relay: use plain timer instead of delayed work
relay doesn't need to use schedule_delayed_work() for waking readers
when a simple timer will do.
Scheduling a plain timer, at next jiffies boundary, to do the wakeup
causes a significant wakeup latency for the Userspace client, which makes
relay less suitable for the high-frequency low-payload use cases where the
data gets generated at a very high rate, like multiple sub buffers getting
filled within a milli second. Moreover the timer is re-scheduled on every
newly produced sub buffer so the timer keeps getting pushed out if sub
buffers are filled in a very quick succession (less than a jiffy gap
between filling of 2 sub buffers). As a result relay runs out of sub
buffers to store the new data.
By using irq_work it is ensured that wakeup of userspace client, blocked
in the poll call, is done at earliest (through self IPI or next timer
tick) enabling it to always consume the data in time. Also this makes
relay consistent with printk & ring buffers (trace), as they too use
irq_work for deferred wake up of readers.
[arnd@arndb.de: select CONFIG_IRQ_WORK]
Link: http://lkml.kernel.org/r/20160912154035.3222156-1-arnd@arndb.de
[akpm@linux-foundation.org: coding-style fixes]
Link: http://lkml.kernel.org/r/1472906487-1559-1-git-send-email-akash.goel@intel.com
Signed-off-by: Peter Zijlstra <peterz@infradead.org>
Signed-off-by: Akash Goel <akash.goel@intel.com>
Cc: Tom Zanussi <tzanussi@gmail.com>
Cc: Chris Wilson <chris@chris-wilson.co.uk>
Cc: Tvrtko Ursulin <tvrtko.ursulin@intel.com>
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-10-11 20:54:33 +00:00
|
|
|
struct irq_work wakeup_work; /* reader wakeup */
|
2006-03-23 18:56:55 +00:00
|
|
|
struct dentry *dentry; /* channel file dentry */
|
|
|
|
struct kref kref; /* channel buffer refcount */
|
|
|
|
struct page **page_array; /* array of current buffer pages */
|
|
|
|
unsigned int page_count; /* number of current buffer pages */
|
|
|
|
unsigned int finalized; /* buffer has been finalized */
|
|
|
|
size_t *padding; /* padding counts per sub-buffer */
|
|
|
|
size_t prev_padding; /* temporary variable */
|
|
|
|
size_t bytes_consumed; /* bytes consumed in cur read subbuf */
|
2008-07-26 02:45:12 +00:00
|
|
|
size_t early_bytes; /* bytes consumed before VFS inited */
|
2006-03-23 18:56:55 +00:00
|
|
|
unsigned int cpu; /* this buf's cpu */
|
|
|
|
} ____cacheline_aligned;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Relay channel data structure
|
|
|
|
*/
|
|
|
|
struct rchan
|
|
|
|
{
|
|
|
|
u32 version; /* the version of this struct */
|
|
|
|
size_t subbuf_size; /* sub-buffer size */
|
|
|
|
size_t n_subbufs; /* number of sub-buffers per buffer */
|
|
|
|
size_t alloc_size; /* total buffer size allocated */
|
|
|
|
struct rchan_callbacks *cb; /* client callbacks */
|
|
|
|
struct kref kref; /* channel refcount */
|
|
|
|
void *private_data; /* for user-defined data */
|
|
|
|
size_t last_toobig; /* tried to log event > subbuf size */
|
2019-03-08 00:31:28 +00:00
|
|
|
struct rchan_buf * __percpu *buf; /* per-cpu channel buffers */
|
2007-02-10 09:45:05 +00:00
|
|
|
int is_global; /* One global buffer ? */
|
|
|
|
struct list_head list; /* for channel list */
|
|
|
|
struct dentry *parent; /* parent dentry passed to open */
|
2008-07-26 02:45:12 +00:00
|
|
|
int has_base_filename; /* has a filename associated? */
|
2007-02-10 09:45:05 +00:00
|
|
|
char base_filename[NAME_MAX]; /* saved base filename */
|
2006-03-23 18:56:55 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Relay channel client callbacks
|
|
|
|
*/
|
|
|
|
struct rchan_callbacks
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* subbuf_start - called on buffer-switch to a new sub-buffer
|
|
|
|
* @buf: the channel buffer containing the new sub-buffer
|
|
|
|
* @subbuf: the start of the new sub-buffer
|
|
|
|
* @prev_subbuf: the start of the previous sub-buffer
|
|
|
|
* @prev_padding: unused space at the end of previous sub-buffer
|
|
|
|
*
|
|
|
|
* The client should return 1 to continue logging, 0 to stop
|
|
|
|
* logging.
|
|
|
|
*
|
|
|
|
* NOTE: subbuf_start will also be invoked when the buffer is
|
|
|
|
* created, so that the first sub-buffer can be initialized
|
|
|
|
* if necessary. In this case, prev_subbuf will be NULL.
|
|
|
|
*
|
|
|
|
* NOTE: the client can reserve bytes at the beginning of the new
|
|
|
|
* sub-buffer by calling subbuf_start_reserve() in this callback.
|
|
|
|
*/
|
|
|
|
int (*subbuf_start) (struct rchan_buf *buf,
|
|
|
|
void *subbuf,
|
|
|
|
void *prev_subbuf,
|
|
|
|
size_t prev_padding);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* buf_mapped - relay buffer mmap notification
|
|
|
|
* @buf: the channel buffer
|
|
|
|
* @filp: relay file pointer
|
|
|
|
*
|
|
|
|
* Called when a relay file is successfully mmapped
|
|
|
|
*/
|
|
|
|
void (*buf_mapped)(struct rchan_buf *buf,
|
|
|
|
struct file *filp);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* buf_unmapped - relay buffer unmap notification
|
|
|
|
* @buf: the channel buffer
|
|
|
|
* @filp: relay file pointer
|
|
|
|
*
|
|
|
|
* Called when a relay file is successfully unmapped
|
|
|
|
*/
|
|
|
|
void (*buf_unmapped)(struct rchan_buf *buf,
|
|
|
|
struct file *filp);
|
|
|
|
/*
|
|
|
|
* create_buf_file - create file to represent a relay channel buffer
|
|
|
|
* @filename: the name of the file to create
|
|
|
|
* @parent: the parent of the file to create
|
|
|
|
* @mode: the mode of the file to create
|
|
|
|
* @buf: the channel buffer
|
|
|
|
* @is_global: outparam - set non-zero if the buffer should be global
|
|
|
|
*
|
|
|
|
* Called during relay_open(), once for each per-cpu buffer,
|
|
|
|
* to allow the client to create a file to be used to
|
|
|
|
* represent the corresponding channel buffer. If the file is
|
|
|
|
* created outside of relay, the parent must also exist in
|
|
|
|
* that filesystem.
|
|
|
|
*
|
|
|
|
* The callback should return the dentry of the file created
|
|
|
|
* to represent the relay buffer.
|
|
|
|
*
|
|
|
|
* Setting the is_global outparam to a non-zero value will
|
|
|
|
* cause relay_open() to create a single global buffer rather
|
|
|
|
* than the default set of per-cpu buffers.
|
|
|
|
*
|
2020-04-14 16:48:37 +00:00
|
|
|
* See Documentation/filesystems/relay.rst for more info.
|
2006-03-23 18:56:55 +00:00
|
|
|
*/
|
|
|
|
struct dentry *(*create_buf_file)(const char *filename,
|
|
|
|
struct dentry *parent,
|
2011-07-24 08:33:43 +00:00
|
|
|
umode_t mode,
|
2006-03-23 18:56:55 +00:00
|
|
|
struct rchan_buf *buf,
|
|
|
|
int *is_global);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* remove_buf_file - remove file representing a relay channel buffer
|
|
|
|
* @dentry: the dentry of the file to remove
|
|
|
|
*
|
|
|
|
* Called during relay_close(), once for each per-cpu buffer,
|
|
|
|
* to allow the client to remove a file used to represent a
|
|
|
|
* channel buffer.
|
|
|
|
*
|
|
|
|
* The callback should return 0 if successful, negative if not.
|
|
|
|
*/
|
|
|
|
int (*remove_buf_file)(struct dentry *dentry);
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* CONFIG_RELAY kernel API, kernel/relay.c
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct rchan *relay_open(const char *base_filename,
|
|
|
|
struct dentry *parent,
|
|
|
|
size_t subbuf_size,
|
|
|
|
size_t n_subbufs,
|
2007-02-10 09:45:05 +00:00
|
|
|
struct rchan_callbacks *cb,
|
|
|
|
void *private_data);
|
2008-07-26 02:45:12 +00:00
|
|
|
extern int relay_late_setup_files(struct rchan *chan,
|
|
|
|
const char *base_filename,
|
|
|
|
struct dentry *parent);
|
2006-03-23 18:56:55 +00:00
|
|
|
extern void relay_close(struct rchan *chan);
|
|
|
|
extern void relay_flush(struct rchan *chan);
|
|
|
|
extern void relay_subbufs_consumed(struct rchan *chan,
|
|
|
|
unsigned int cpu,
|
|
|
|
size_t consumed);
|
|
|
|
extern void relay_reset(struct rchan *chan);
|
|
|
|
extern int relay_buf_full(struct rchan_buf *buf);
|
|
|
|
|
|
|
|
extern size_t relay_switch_subbuf(struct rchan_buf *buf,
|
|
|
|
size_t length);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* relay_write - write data into the channel
|
|
|
|
* @chan: relay channel
|
|
|
|
* @data: data to be written
|
|
|
|
* @length: number of bytes to write
|
|
|
|
*
|
|
|
|
* Writes data into the current cpu's channel buffer.
|
|
|
|
*
|
|
|
|
* Protects the buffer by disabling interrupts. Use this
|
|
|
|
* if you might be logging from interrupt context. Try
|
|
|
|
* __relay_write() if you know you won't be logging from
|
|
|
|
* interrupt context.
|
|
|
|
*/
|
|
|
|
static inline void relay_write(struct rchan *chan,
|
|
|
|
const void *data,
|
|
|
|
size_t length)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
struct rchan_buf *buf;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
2016-09-02 19:47:38 +00:00
|
|
|
buf = *this_cpu_ptr(chan->buf);
|
2006-03-23 18:56:55 +00:00
|
|
|
if (unlikely(buf->offset + length > chan->subbuf_size))
|
|
|
|
length = relay_switch_subbuf(buf, length);
|
|
|
|
memcpy(buf->data + buf->offset, data, length);
|
|
|
|
buf->offset += length;
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __relay_write - write data into the channel
|
|
|
|
* @chan: relay channel
|
|
|
|
* @data: data to be written
|
|
|
|
* @length: number of bytes to write
|
|
|
|
*
|
|
|
|
* Writes data into the current cpu's channel buffer.
|
|
|
|
*
|
|
|
|
* Protects the buffer by disabling preemption. Use
|
|
|
|
* relay_write() if you might be logging from interrupt
|
|
|
|
* context.
|
|
|
|
*/
|
|
|
|
static inline void __relay_write(struct rchan *chan,
|
|
|
|
const void *data,
|
|
|
|
size_t length)
|
|
|
|
{
|
|
|
|
struct rchan_buf *buf;
|
|
|
|
|
2016-09-02 19:47:38 +00:00
|
|
|
buf = *get_cpu_ptr(chan->buf);
|
2006-03-23 18:56:55 +00:00
|
|
|
if (unlikely(buf->offset + length > buf->chan->subbuf_size))
|
|
|
|
length = relay_switch_subbuf(buf, length);
|
|
|
|
memcpy(buf->data + buf->offset, data, length);
|
|
|
|
buf->offset += length;
|
2016-09-02 19:47:38 +00:00
|
|
|
put_cpu_ptr(chan->buf);
|
2006-03-23 18:56:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* relay_reserve - reserve slot in channel buffer
|
|
|
|
* @chan: relay channel
|
|
|
|
* @length: number of bytes to reserve
|
|
|
|
*
|
|
|
|
* Returns pointer to reserved slot, NULL if full.
|
|
|
|
*
|
|
|
|
* Reserves a slot in the current cpu's channel buffer.
|
|
|
|
* Does not protect the buffer at all - caller must provide
|
|
|
|
* appropriate synchronization.
|
|
|
|
*/
|
|
|
|
static inline void *relay_reserve(struct rchan *chan, size_t length)
|
|
|
|
{
|
2016-09-02 19:47:38 +00:00
|
|
|
void *reserved = NULL;
|
|
|
|
struct rchan_buf *buf = *get_cpu_ptr(chan->buf);
|
2006-03-23 18:56:55 +00:00
|
|
|
|
|
|
|
if (unlikely(buf->offset + length > buf->chan->subbuf_size)) {
|
|
|
|
length = relay_switch_subbuf(buf, length);
|
|
|
|
if (!length)
|
2016-09-02 19:47:38 +00:00
|
|
|
goto end;
|
2006-03-23 18:56:55 +00:00
|
|
|
}
|
|
|
|
reserved = buf->data + buf->offset;
|
|
|
|
buf->offset += length;
|
|
|
|
|
2016-09-02 19:47:38 +00:00
|
|
|
end:
|
|
|
|
put_cpu_ptr(chan->buf);
|
2006-03-23 18:56:55 +00:00
|
|
|
return reserved;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* subbuf_start_reserve - reserve bytes at the start of a sub-buffer
|
|
|
|
* @buf: relay channel buffer
|
|
|
|
* @length: number of bytes to reserve
|
|
|
|
*
|
|
|
|
* Helper function used to reserve bytes at the beginning of
|
|
|
|
* a sub-buffer in the subbuf_start() callback.
|
|
|
|
*/
|
|
|
|
static inline void subbuf_start_reserve(struct rchan_buf *buf,
|
|
|
|
size_t length)
|
|
|
|
{
|
|
|
|
BUG_ON(length >= buf->chan->subbuf_size - 1);
|
|
|
|
buf->offset = length;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* exported relay file operations, kernel/relay.c
|
|
|
|
*/
|
2006-12-07 04:40:36 +00:00
|
|
|
extern const struct file_operations relay_file_operations;
|
2006-03-23 18:56:55 +00:00
|
|
|
|
2016-08-18 12:57:17 +00:00
|
|
|
#ifdef CONFIG_RELAY
|
|
|
|
int relay_prepare_cpu(unsigned int cpu);
|
|
|
|
#else
|
|
|
|
#define relay_prepare_cpu NULL
|
|
|
|
#endif
|
|
|
|
|
2006-03-23 18:56:55 +00:00
|
|
|
#endif /* _LINUX_RELAY_H */
|
|
|
|
|