The goal is to solve confusion of the "All rights reserved" for licensing
code under an open-source license.
The phrase "All rights reserved" comes from a historical convention that
required this phrase for the copyright protection to apply. This convention
is no longer relevant.
However, even though the phrase has no meaning in establishing the copyright
it has not lost meaning in terms of licensing.
This change makes it so code under the Blender Foundation copyright does
not use "all rights reserved". This is also how the GPL license itself
states how to apply it to the source code:
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software ...
This change does not change copyright notice in cases when the copyright
is dual (BF and an author), or just an author of the code. It also does
mot change copyright which is inherited from NaN Holding BV as it needs
some further investigation about what is the proper way to handle it.
100 lines
2.4 KiB
C
100 lines
2.4 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2022 Blender Foundation */
|
|
|
|
/** \file
|
|
* \ingroup sequencer
|
|
*/
|
|
|
|
#include <string.h>
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
#include "DNA_listBase.h"
|
|
#include "DNA_scene_types.h"
|
|
#include "DNA_sequence_types.h"
|
|
|
|
#include "BLI_blenlib.h"
|
|
|
|
#include "SEQ_channels.h"
|
|
#include "SEQ_iterator.h"
|
|
#include "SEQ_relations.h"
|
|
#include "SEQ_sequencer.h"
|
|
|
|
ListBase *SEQ_channels_displayed_get(Editing *ed)
|
|
{
|
|
return ed->displayed_channels;
|
|
}
|
|
|
|
void SEQ_channels_displayed_set(Editing *ed, ListBase *channels)
|
|
{
|
|
ed->displayed_channels = channels;
|
|
}
|
|
|
|
void SEQ_channels_ensure(ListBase *channels)
|
|
{
|
|
/* Allocate channels. Channel 0 is never used, but allocated to prevent off by 1 issues. */
|
|
for (int i = 0; i < MAXSEQ + 1; i++) {
|
|
SeqTimelineChannel *channel = MEM_callocN(sizeof(SeqTimelineChannel), "seq timeline channel");
|
|
BLI_snprintf(channel->name, sizeof(channel->name), "Channel %d", i);
|
|
channel->index = i;
|
|
BLI_addtail(channels, channel);
|
|
}
|
|
}
|
|
|
|
void SEQ_channels_duplicate(ListBase *channels_dst, ListBase *channels_src)
|
|
{
|
|
LISTBASE_FOREACH (SeqTimelineChannel *, channel, channels_src) {
|
|
SeqTimelineChannel *channel_duplicate = MEM_dupallocN(channel);
|
|
BLI_addtail(channels_dst, channel_duplicate);
|
|
}
|
|
}
|
|
|
|
void SEQ_channels_free(ListBase *channels)
|
|
{
|
|
LISTBASE_FOREACH_MUTABLE (SeqTimelineChannel *, channel, channels) {
|
|
MEM_freeN(channel);
|
|
}
|
|
}
|
|
|
|
SeqTimelineChannel *SEQ_channel_get_by_index(const ListBase *channels, const int channel_index)
|
|
{
|
|
return BLI_findlink(channels, channel_index);
|
|
}
|
|
|
|
char *SEQ_channel_name_get(ListBase *channels, const int channel_index)
|
|
{
|
|
SeqTimelineChannel *channel = SEQ_channel_get_by_index(channels, channel_index);
|
|
return channel->name;
|
|
}
|
|
|
|
int SEQ_channel_index_get(const SeqTimelineChannel *channel)
|
|
{
|
|
return channel->index;
|
|
}
|
|
|
|
bool SEQ_channel_is_locked(const SeqTimelineChannel *channel)
|
|
{
|
|
return (channel->flag & SEQ_CHANNEL_LOCK) != 0;
|
|
}
|
|
|
|
bool SEQ_channel_is_muted(const SeqTimelineChannel *channel)
|
|
{
|
|
return (channel->flag & SEQ_CHANNEL_MUTE) != 0;
|
|
}
|
|
|
|
ListBase *SEQ_get_channels_by_seq(ListBase *seqbase, ListBase *channels, const Sequence *seq)
|
|
{
|
|
ListBase *lb = NULL;
|
|
|
|
LISTBASE_FOREACH (Sequence *, iseq, seqbase) {
|
|
if (seq == iseq) {
|
|
return channels;
|
|
}
|
|
if ((lb = SEQ_get_channels_by_seq(&iseq->seqbase, &iseq->channels, seq))) {
|
|
return lb;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|