update license terms
As of now, everything except the code imported from FreeBSD is proprietary. Of course, it won't be like this for long, only until we have decided which license we like to use. The rationale is that releasing everything under a copyleft license later is always easier than doing so immediately and then changing it afterwards. Naturally, any changes made before this commit are still subject to the terms of the CNPL.main
parent
52ac282ac8
commit
5a5135f416
GPG Key ID:
EC22E476DC2D3D84
@ -1,488 +0,0 @@
|
||||
THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS
|
||||
COOPERATIVE NON-VIOLENT PUBLIC LICENSE ("LICENSE"). THE WORK IS
|
||||
PROTECTED BY COPYRIGHT AND ALL OTHER APPLICABLE LAWS. ANY USE OF THE
|
||||
WORK OTHER THAN AS AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS
|
||||
PROHIBITED. BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED IN THIS
|
||||
LICENSE, YOU AGREE TO BE BOUND BY THE TERMS OF THIS LICENSE.TO THE
|
||||
EXTENT THIS LICENSE MAY BE CONSIDERED TO BE A CONTRACT, THE LICENSOR
|
||||
GRANTS YOU THE RIGHTS CONTAINED HERE IN AS CONSIDERATION FOR ACCEPTING
|
||||
THE TERMS AND CONDITIONS OF THIS LICENSE AND FOR AGREEING TO BE BOUND BY
|
||||
THE TERMS AND CONDITIONS OF THIS LICENSE.
|
||||
|
||||
Definitions
|
||||
===========
|
||||
|
||||
An Act of War is any action of one country against any group either with
|
||||
an intention to provoke a conflict or an action that occurs during a
|
||||
declared war or during armed conflict between military forces of any
|
||||
origin. This includes but is not limited to enforcing sanctions or
|
||||
sieges, supplying armed forces, or profiting from the manufacture of
|
||||
tools or weaponry used in military conflict.
|
||||
|
||||
An Adaptation is a work based upon the Work, or upon the Work and other
|
||||
pre-existing works, such as a translation, adaptation, derivative work,
|
||||
arrangement of music or other alterations of a literary or artistic
|
||||
work, or phonogram or performance and includes cinematographic
|
||||
adaptations or any other form in which the Work may be recast,
|
||||
transformed, or adapted including in any form recognizably derived from
|
||||
the original, except that a work that constitutes a Collection will not
|
||||
be considered an Adaptation for the purpose of this License. For the
|
||||
avoidance of doubt, where the Work is a musical work, performance or
|
||||
phonogram, the synchronization of the Work in timed-relation with a
|
||||
moving image ("synching") will be considered an Adaptation for the
|
||||
purpose of this License. In addition, where the Work is designed to
|
||||
output a neural network the output of the neural network will be
|
||||
considered an Adaptation for the purpose of this license.
|
||||
|
||||
Bodily Harm is any physical hurt or injury to a person that interferes
|
||||
with the health or comfort of the person and that is more than merely
|
||||
transient or trifling in nature.
|
||||
|
||||
Distribute is to make available to the public the original and copies of
|
||||
the Work or Adaptation, as appropriate, through sale, gift or any other
|
||||
transfer of possession or ownership.
|
||||
|
||||
Incarceration is Confinement in a jail, prison, or any other place where
|
||||
individuals of any kind are held against either their will or (if their
|
||||
will cannot be determined) the will of their legal guardian or
|
||||
guardians. In the case of a conflict between the will of the individual
|
||||
and the will of their legal guardian or guardians, the will of the
|
||||
individual will take precedence.
|
||||
|
||||
Licensor is The individual, individuals, entity, or entities that
|
||||
offer(s) the Work under the terms of this License
|
||||
|
||||
Original Author is in the case of a literary or artistic work, the
|
||||
individual, individuals, entity or entities who created the Work or if
|
||||
no individual or entity can be identified, the publisher; and in
|
||||
addition
|
||||
|
||||
- in the case of a performance the actors, singers, musicians, dancers,
|
||||
and other persons who act, sing, deliver, declaim, play in, interpret
|
||||
or otherwise perform literary or artistic works or expressions of
|
||||
folklore;
|
||||
|
||||
- in the case of a phonogram the producer being the person or legal
|
||||
entity who first fixes the sounds of a performance or other sounds;
|
||||
and,
|
||||
|
||||
- in the case of broadcasts, the organization that transmits the
|
||||
broadcast.
|
||||
|
||||
Work is the literary and/or artistic work offered under the terms of
|
||||
this License including without limitation any production in the
|
||||
literary, scientific and artistic domain, whatever may be the mode or
|
||||
form of its expression including digital form, such as a book, pamphlet
|
||||
and other writing; a lecture, address, sermon or other work of the same
|
||||
nature; a dramatic or dramatico-musical work; a choreographic work or
|
||||
entertainment in dumb show; a musical composition with or without words;
|
||||
a cinematographic work to which are assimilated works expressed by a
|
||||
process analogous to cinematography; a work of drawing, painting,
|
||||
architecture, sculpture, engraving or lithography; a photographic work
|
||||
to which are assimilated works expressed by a process analogous to
|
||||
photography; a work of applied art; an illustration, map, plan, sketch
|
||||
or three-dimensional work relative to geography, topography,
|
||||
architecture or science; a performance; a broadcast; a phonogram; a
|
||||
compilation of data to the extent it is protected as a copyrightable
|
||||
work; or a work performed by a variety or circus performer to the extent
|
||||
it is not otherwise considered a literary or artistic work.
|
||||
|
||||
You means an individual or entity exercising rights under this License
|
||||
who has not previously violated the terms of this License with respect
|
||||
to the Work, or who has received express permission from the Licensor to
|
||||
exercise rights under this License despite a previous violation.
|
||||
|
||||
Publicly Perform means to perform public recitations of the Work and to
|
||||
communicate to the public those public recitations, by any means or
|
||||
process, including by wire or wireless means or public digital
|
||||
performances; to make available to the public Works in such a way that
|
||||
members of the public may access these Works from a place and at a place
|
||||
individually chosen by them; to perform the Work to the public by any
|
||||
means or process and the communication to the public of the performances
|
||||
of the Work, including by public digital performance; to broadcast and
|
||||
rebroadcast the Work by any means including signs, sounds or images.
|
||||
|
||||
Reproduce is to make copies of the Work by any means including without
|
||||
limitation by sound or visual recordings and the right of fixation and
|
||||
reproducing fixations of the Work, including storage of a protected
|
||||
performance or phonogram in digital form or other electronic medium.
|
||||
|
||||
Software is any digital Work which, through use of a third-party piece
|
||||
of Software or through the direct usage of itself on a computer system,
|
||||
the memory of the computer is modified dynamically or semi-dynamically.
|
||||
"Software", secondly, processes or interprets information.
|
||||
|
||||
Source Code is Any digital Work which, through use of a third-party
|
||||
piece of Software or through the direct usage of itself on a computer
|
||||
system, the memory of the computer is modified dynamically or
|
||||
semi-dynamically. "Software", secondly, processes or interprets
|
||||
information.
|
||||
|
||||
Surveilling is the use of the Work to either overtly or covertly observe
|
||||
and record persons and or their activities.
|
||||
|
||||
A Network Service is the use of a piece of Software to interpret or
|
||||
modify information that is subsequently and directly served to users
|
||||
over the Internet.
|
||||
|
||||
To Discriminate is the use of a piece of Software to interpret or modify
|
||||
information that is subsequently and directly served to users over the
|
||||
Internet.
|
||||
|
||||
Hate Speech is Communication or any form of expression which is solely
|
||||
for the purpose of expressing hatred for some group or advocating a form
|
||||
of Discrimination between humans.
|
||||
|
||||
Coercion is leveraging of the threat of force or use of force to
|
||||
intimidate a person in order to gain compliance, or to offer large
|
||||
incentives which aim to entice a person to act against their will.
|
||||
|
||||
Fair Dealing Rights
|
||||
===================
|
||||
|
||||
Nothing in this License is intended to reduce, limit, or restrict any
|
||||
uses free from copyright or rights arising from limitations or
|
||||
exceptions that are provided for in connection with the copyright
|
||||
protection under copyright law or other applicable laws.
|
||||
|
||||
License Grant
|
||||
=============
|
||||
|
||||
Subject to the terms and conditions of this License, Licensor hereby
|
||||
grants You a worldwide, royalty-free, non-exclusive, perpetual (for the
|
||||
duration of the applicable copyright) license to exercise the rights in
|
||||
the Work as stated below:
|
||||
|
||||
To Reproduce the Work, to incorporate the Work into one or more
|
||||
Collections, and to Reproduce the Work as incorporated in the
|
||||
Collections
|
||||
|
||||
To create and Reproduce Adaptations provided that any such Adaptation,
|
||||
including any translation in any medium, takes reasonable steps to
|
||||
clearly label, demarcate or otherwise identify that changes were made to
|
||||
the original Work. For example, a translation could be marked "The
|
||||
original work was translated from English to Spanish," or a modification
|
||||
could indicate "The original work has been modified."
|
||||
|
||||
To Distribute and Publicly Perform the Work including as incorporated in
|
||||
Collections.
|
||||
|
||||
To Distribute and Publicly Perform Adaptations. The above rights may be
|
||||
exercised in all media and formats whether now known or hereafter
|
||||
devised. The above rights include the right to make such modifications
|
||||
as are technically necessary to exercise the rights in other media and
|
||||
formats. This License constitutes the entire agreement between the
|
||||
parties with respect to the Work licensed here. There are no
|
||||
understandings, agreements or representations with respect to the Work
|
||||
not specified here. Licensor shall not be bound by any additional
|
||||
provisions that may appear in any communication from You. This License
|
||||
may not be modified without the mutual written agreement of the Licensor
|
||||
and You. All rights not expressly granted by Licensor are hereby
|
||||
reserved, including but not limited to the rights set forth in
|
||||
Non-waivable Compulsory License Schemes, Waivable Compulsory License
|
||||
Schemes, and Voluntary License Schemes in the restrictions.
|
||||
|
||||
Restrictions
|
||||
============
|
||||
|
||||
The license granted in the license grant above is expressly made subject
|
||||
to and limited by the following restrictions:
|
||||
|
||||
You may Distribute or Publicly Perform the Work only under the terms of
|
||||
this License. You must include a copy of, or the Uniform Resource
|
||||
Identifier (URI) for, this License with every copy of the Work You
|
||||
Distribute or Publicly Perform. You may not offer or impose any terms on
|
||||
the Work that restrict the terms of this License or the ability of the
|
||||
recipient of the Work to exercise the rights granted to that recipient
|
||||
under the terms of the License. You may not sublicense the Work. You
|
||||
must keep intact all notices that refer to this License and to the
|
||||
disclaimer of warranties with every copy of the Work You Distribute or
|
||||
Publicly Perform. When You Distribute or Publicly Perform the Work, You
|
||||
may not impose any effective technological measures on the Work that
|
||||
restrict the ability of a recipient of the Work from You to exercise the
|
||||
rights granted to that recipient under the terms of the License. This
|
||||
Section applies to the Work as incorporated in a Collection, but this
|
||||
does not require the Collection apart from the Work itself to be made
|
||||
subject to the terms of this License. If You create a Collection, upon
|
||||
notice from any Licensor You must, to the extent practicable, remove
|
||||
from the Collection any credit as requested. If You create an
|
||||
Adaptation, upon notice from any Licensor You must, to the extent
|
||||
practicable, remove from the Adaptation any credit as requested.
|
||||
|
||||
Commercial Restrictions
|
||||
-----------------------
|
||||
|
||||
You may not exercise any of the rights granted to You in the above
|
||||
section in any manner that is primarily intended for or directed toward
|
||||
commercial advantage or private monetary compensation unless you meet
|
||||
the following requirements.
|
||||
|
||||
i. You are a worker-owned business or worker-owned collective.
|
||||
|
||||
ii. after tax, all financial gain, surplus, profits and benefits
|
||||
produced by the business or collective are distributed among the
|
||||
worker-owners unless a set amount is to be allocated towards
|
||||
community projects as decided by a previously-established consensus
|
||||
agreement between the worker-owners where all worker-owners agreed.
|
||||
|
||||
iii. You are not using such rights on behalf of a business other than
|
||||
those specified in (i) or (ii) above, nor are using such rights as
|
||||
a proxy on behalf of a business with the intent to circumvent the
|
||||
aforementioned restrictions on such a business.
|
||||
|
||||
The exchange of the Work for other copyrighted works by means of digital
|
||||
file-sharing or otherwise shall not be considered to be intended for or
|
||||
directed toward commercial advantage or private monetary compensation,
|
||||
provided there is no payment of any monetary compensation in connection
|
||||
with the exchange of copyrighted works.
|
||||
|
||||
If the Work meets the definition of Software, You may exercise the
|
||||
rights granted in the license grant only if You provide a copy of the
|
||||
corresponding Source Code from which the Work was derived in digital
|
||||
form, or You provide a URI for the corresponding Source Code of the
|
||||
Work, to any recipients upon request.
|
||||
|
||||
If the Work is used as or for a Network Service, You may exercise the
|
||||
rights granted in the license grant only if You provide a copy of the
|
||||
corresponding Source Code from which the Work was derived in digital
|
||||
form, or You provide a URI for the corresponding Source Code to the
|
||||
Work, to any recipients of the data served or modified by the Web
|
||||
Service.
|
||||
|
||||
Any use by a business that is privately owned and managed, and that
|
||||
seeks to generate profit from the labor of employees paid by salary or
|
||||
other wages, is not permitted under this license.
|
||||
|
||||
You may exercise the rights granted in the license grant for any
|
||||
purposes only if:
|
||||
|
||||
i. You do not use the Work for the purpose of inflicting Bodily Harm
|
||||
on human beings (subject to criminal prosecution or otherwise)
|
||||
outside of providing medical aid or undergoing a voluntary
|
||||
procedure under no form of Coercion.
|
||||
|
||||
ii. You do not use the Work for the purpose of Surveilling or tracking
|
||||
individuals for financial gain.
|
||||
|
||||
iii. You do not use the Work in an Act of War.
|
||||
|
||||
iv. You do not use the Work for the purpose of supporting or profiting
|
||||
from an Act of War.
|
||||
|
||||
v. You do not use the Work for the purpose of Incarceration.
|
||||
|
||||
vi. You do not use the Work for the purpose of extracting, processing,
|
||||
or refining, oil, gas, or coal. Or to in any other way to
|
||||
deliberately pollute the environment as a byproduct of
|
||||
manufacturing or irresponsible disposal of hazardous materials.
|
||||
|
||||
vii. You do not use the Work for the purpose of expediting,
|
||||
coordinating, or facilitating paid work undertaken by individuals
|
||||
under the age of 12 years.
|
||||
|
||||
viii. You do not use the Work to either Discriminate or spread Hate
|
||||
Speech on the basis of sex, sexual orientation, gender identity,
|
||||
race, age, disability, color, national origin, religion, caste, or
|
||||
lower economic status.
|
||||
|
||||
If You Distribute, or Publicly Perform the Work or any Adaptations or
|
||||
Collections, You must, unless a request has been made by any Licensor to
|
||||
remove credit from a Collection or Adaptation, keep intact all copyright
|
||||
notices for the Work and provide, reasonable to the medium or means You
|
||||
are utilizing:
|
||||
|
||||
i. the name of the Original Author (or pseudonym, if applicable) if
|
||||
supplied, and/or if the Original Author and/or Licensor designate
|
||||
another party or parties (e.g., a sponsor institute, publishing
|
||||
entity, journal) for attribution ("Attribution Parties") in
|
||||
Licensor's copyright notice, terms of service or by other
|
||||
reasonable means, the name of such party or parties;
|
||||
|
||||
ii. the title of the Work if supplied;
|
||||
|
||||
iii. to the extent reasonably practicable, the URI, if any, that
|
||||
Licensor to be associated with the Work, unless such URI does not
|
||||
refer to the copyright notice or licensing information for the
|
||||
Work; and,
|
||||
|
||||
iv. in the case of an Adaptation, a credit identifying the use of the
|
||||
Work in the Adaptation (e.g., "French translation of the Work by
|
||||
Original Author," or "Screenplay based on original Work by Original
|
||||
Author").
|
||||
|
||||
If any Licensor has sent notice to request removing credit, You must, to
|
||||
the extent practicable, remove any credit as requested. The credit
|
||||
required by this Section may be implemented in any reasonable manner;
|
||||
provided, however, that in the case of an Adaptation or Collection, at a
|
||||
minimum such credit will appear, if a credit for all contributing
|
||||
authors of the Adaptation or Collection appears, then as part of these
|
||||
credits and in a manner at least as prominent as the credits for the
|
||||
other contributing authors. For the avoidance of doubt, You may only use
|
||||
the credit required by this Section for the purpose of attribution in
|
||||
the manner set out above and, by exercising Your rights under this
|
||||
License, You may not implicitly or explicitly assert or imply any
|
||||
connection with, sponsorship or endorsement by the Original Author,
|
||||
Licensor and/or Attribution Parties, as appropriate, of You or Your use
|
||||
of the Work, without the separate, express prior written permission of
|
||||
the Original Author, Licensor and/or Attribution Parties.
|
||||
|
||||
Non-waivable Compulsory License Schemes. In those jurisdictions in which
|
||||
the right to collect royalties through any statutory or compulsory
|
||||
licensing scheme cannot be waived, the Licensor reserves the exclusive
|
||||
right to collect such royalties for any exercise by You of the rights
|
||||
granted under this License
|
||||
|
||||
Waivable Compulsory License Schemes. In those jurisdictions in which the
|
||||
right to collect royalties through any statutory or compulsory licensing
|
||||
scheme can be waived, the Licensor reserves the exclusive right to
|
||||
collect such royalties for any exercise by You of the rights granted
|
||||
under this License if Your exercise of such rights is for a purpose or
|
||||
use which is otherwise than noncommercial as permitted under Commercial
|
||||
Restrictions and otherwise waives the right to collect royalties through
|
||||
any statutory or compulsory licensing scheme.
|
||||
|
||||
Voluntary License Schemes. The Licensor reserves the right to collect
|
||||
royalties, whether individually or, in the event that the Licensor is a
|
||||
member of a collecting society that administers voluntary licensing
|
||||
schemes, via that society, from any exercise by You of the rights
|
||||
granted under this License that is for a purpose or use which is
|
||||
otherwise than noncommercial as permitted under the license grant.
|
||||
|
||||
Except as otherwise agreed in writing by the Licensor or as may be
|
||||
otherwise permitted by applicable law, if You Reproduce, Distribute or
|
||||
Publicly Perform the Work either by itself or as part of any Adaptations
|
||||
or Collections, You must not distort, mutilate, modify or take other
|
||||
derogatory action in relation to the Work which would be prejudicial to
|
||||
the Original Author's honor or reputation. Licensor agrees that in those
|
||||
jurisdictions (e.g. Japan), in which any exercise of the right granted
|
||||
in the license grant of this License (the right to make Adaptations)
|
||||
would be deemed to be a distortion, mutilation, modification or other
|
||||
derogatory action prejudicial to the Original Author's honor and
|
||||
reputation, the Licensor will waive or not assert, as appropriate, this
|
||||
Section, to the fullest extent permitted by the applicable national law,
|
||||
to enable You to reasonably exercise Your right under the license grant
|
||||
of this License (right to make Adaptations) but not otherwise.
|
||||
|
||||
Do not make any legal claim against anyone accusing the Work, with or
|
||||
without changes, alone or with other works, of infringing any patent
|
||||
claim.
|
||||
|
||||
Representations Warranties and Disclaimer
|
||||
=========================================
|
||||
|
||||
UNLESS OTHERWISE MUTUALLY AGREED TO BY THE PARTIES IN WRITING, LICENSOR
|
||||
OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY
|
||||
KIND CONCERNING THE WORK, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE,
|
||||
INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTIBILITY,
|
||||
FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF
|
||||
LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS,
|
||||
WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE
|
||||
EXCLUSION OF IMPLIED WARRANTIES, SO SUCH EXCLUSION MAY NOT APPLY TO YOU.
|
||||
|
||||
Limitation on Liability
|
||||
=======================
|
||||
|
||||
EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE LAW, IN NO EVENT WILL
|
||||
LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR ANY SPECIAL,
|
||||
INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES ARISING OUT OF
|
||||
THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS BEEN ADVISED
|
||||
OF THE POSSIBILITY OF SUCH DAMAGES.
|
||||
|
||||
Termination
|
||||
===========
|
||||
|
||||
This License and the rights granted hereunder will terminate
|
||||
automatically upon any breach by You of the terms of this License.
|
||||
Individuals or entities who have received Adaptations or Collections
|
||||
from You under this License, however, will not have their licenses
|
||||
terminated provided such individuals or entities remain in full
|
||||
compliance with those licenses. The Sections on definitions, fair
|
||||
dealing rights, representations, warranties, and disclaimer, limitation
|
||||
on liability, termination, and revised license versions will survive any
|
||||
termination of this License.
|
||||
|
||||
Subject to the above terms and conditions, the license granted here is
|
||||
perpetual (for the duration of the applicable copyright in the Work).
|
||||
Notwithstanding the above, Licensor reserves the right to release the
|
||||
Work under different license terms or to stop distributing the Work at
|
||||
any time; provided, however that any such election will not serve to
|
||||
withdraw this License (or any other license that has been, or is
|
||||
required to be, granted under the terms of this License), and this
|
||||
License will continue in full force and effect unless terminated as
|
||||
stated above.
|
||||
|
||||
Revised License Versions
|
||||
========================
|
||||
|
||||
This License may receive future revisions in the original spirit of the
|
||||
license intended to strengthen This License. Each version of This
|
||||
License has an incrementing version number.
|
||||
|
||||
Unless otherwise specified like in the below subsection The Licensor has
|
||||
only granted this current version of This License for The Work. In this
|
||||
case future revisions do not apply.
|
||||
|
||||
The Licensor may specify that the latest available revision of This
|
||||
License be used for The Work by either explicitly writing so or by
|
||||
suffixing the License URI with a "+" symbol.
|
||||
|
||||
The Licensor may specify that The Work is also available under the terms
|
||||
of This License's current revision as well as specific future revisions.
|
||||
The Licensor may do this by writing it explicitly or suffixing the
|
||||
License URI with any additional version numbers each separated by a
|
||||
comma.
|
||||
|
||||
Miscellaneous
|
||||
=============
|
||||
|
||||
Each time You Distribute or Publicly Perform the Work or a Collection,
|
||||
the Licensor offers to the recipient a license to the Work on the same
|
||||
terms and conditions as the license granted to You under this License.
|
||||
|
||||
Each time You Distribute or Publicly Perform an Adaptation, Licensor
|
||||
offers to the recipient a license to the original Work on the same terms
|
||||
and conditions as the license granted to You under this License.
|
||||
|
||||
If the Work is classified as Software, each time You Distribute or
|
||||
Publicly Perform an Adaptation, Licensor offers to the recipient a copy
|
||||
and/or URI of the corresponding Source Code on the same terms and
|
||||
conditions as the license granted to You under this License.
|
||||
|
||||
If the Work is used as a Network Service, each time You Distribute or
|
||||
Publicly Perform an Adaptation, or serve data derived from the Software,
|
||||
the Licensor offers to any recipients of the data a copy and/or URI of
|
||||
the corresponding Source Code on the same terms and conditions as the
|
||||
license granted to You under this License.
|
||||
|
||||
If any provision of this License is invalid or unenforceable under
|
||||
applicable law, it shall not affect the validity or enforceability of
|
||||
the remainder of the terms of this License, and without further action
|
||||
by the parties to this agreement, such provision shall be reformed to
|
||||
the minimum extent necessary to make such provision valid and
|
||||
enforceable.
|
||||
|
||||
No term or provision of this License shall be deemed waived and no
|
||||
breach consented to unless such waiver or consent shall be in writing
|
||||
and signed by the party to be charged with such waiver or consent.
|
||||
|
||||
This License constitutes the entire agreement between the parties with
|
||||
respect to the Work licensed here. There are no understandings,
|
||||
agreements or representations with respect to the Work not specified
|
||||
here. Licensor shall not be bound by any additional provisions that may
|
||||
appear in any communication from You. This License may not be modified
|
||||
without the mutual written agreement of the Licensor and You.
|
||||
|
||||
The rights granted under, and the subject matter referenced, in this
|
||||
License were drafted utilizing the terminology of the Berne Convention
|
||||
for the Protection of Literary and Artistic Works (as amended on
|
||||
September 28, 1979), the Rome Convention of 1961, the WIPO Copyright
|
||||
Treaty of 1996, the WIPO Performances and Phonograms Treaty of 1996 and
|
||||
the Universal Copyright Convention (as revised on July 24, 1971). These
|
||||
rights and subject matter take effect in the relevant jurisdiction in
|
||||
which the License terms are sought to be enforced according to the
|
||||
corresponding provisions of the implementation of those treaty
|
||||
provisions in the applicable national law. If the standard suite of
|
||||
rights granted under applicable copyright law includes additional rights
|
||||
not granted under this License, such additional rights are deemed to be
|
||||
included in the License; this License is not intended to restrict the
|
||||
license of any rights under applicable law.
|
||||
@ -0,0 +1,118 @@
|
||||
/* Copyright (C) 2021 fef <owo@fef.moe>. All rights reserved. */
|
||||
|
||||
#include <asm/common.h>
|
||||
|
||||
#include <arch/multiboot.h>
|
||||
|
||||
#include <gay/config.h>
|
||||
|
||||
/*
|
||||
* miscellaneous utility routines shared among both i386 and amd64 startup
|
||||
* sequences (these are called before entering long mode)
|
||||
*/
|
||||
|
||||
.code32
|
||||
.section .multiboot.text, "ax", @progbits
|
||||
|
||||
/*
|
||||
* miscellaneous utility routines
|
||||
*/
|
||||
|
||||
/* void _x86_write_tss_base(u64 *gdt_entry, struct x86_tss *tss) */
|
||||
ENTRY(_x86_write_tss_base)
|
||||
movl 4(%esp), %edi
|
||||
movl 8(%esp), %eax
|
||||
movw %ax, 2(%edi)
|
||||
shrl $16, %eax
|
||||
movb %al, 4(%edi)
|
||||
movb %ah, 7(%edi)
|
||||
ret
|
||||
END(_x86_write_tss_base)
|
||||
|
||||
/* __noreturn void print_err_and_hlt(char *message) */
|
||||
L_ENTRY(print_err_and_hlt)
|
||||
mov $0x000b8000, %edx
|
||||
mov 4(%esp), %ecx
|
||||
movb $0x4f, %ah /* BIOS color code: white text on red background */
|
||||
|
||||
1: movb (%ecx), %al
|
||||
testb %al, %al
|
||||
jz 2f
|
||||
movw %ax, (%edx)
|
||||
addl $2, %edx
|
||||
incl %ecx
|
||||
jmp 1b
|
||||
|
||||
2: cli /* interrupts should already be off, but it won't hurt */
|
||||
hlt
|
||||
jmp 2b
|
||||
L_END(print_err_and_hlt)
|
||||
|
||||
ENTRY(_x86_check_multiboot)
|
||||
cmpl $MB2_BOOTLOADER_MAGIC, 4(%esp)
|
||||
jne 1f
|
||||
ret
|
||||
|
||||
1: pushl $errmsg_no_multiboot
|
||||
jmp print_err_and_hlt
|
||||
END(_x86_check_multiboot)
|
||||
|
||||
/*
|
||||
* check if the CPU supports the CPUID instruction
|
||||
* this is done by checking whether we can flip bit 21 in EFLAGS (??)
|
||||
*/
|
||||
ENTRY(_x86_check_cpuid)
|
||||
pushf
|
||||
pop %eax
|
||||
movl %eax, %ecx
|
||||
xorl $(1 << 21), %eax
|
||||
push %eax
|
||||
popf
|
||||
pushf
|
||||
pop %eax
|
||||
push %ecx /* restore original flags */
|
||||
popf
|
||||
cmp %eax, %ecx
|
||||
je 1f
|
||||
ret
|
||||
|
||||
1: pushl $errmsg_no_cpuid
|
||||
jmp print_err_and_hlt
|
||||
END(_x86_err_no_cpuid)
|
||||
|
||||
ENTRY(_x86_check_ext_cpuid)
|
||||
movl $0x80000000, %eax
|
||||
cpuid
|
||||
cmpl $0x80000001, %eax
|
||||
jb 1f
|
||||
ret
|
||||
|
||||
1: pushl $errmsg_no_ext_cpuid
|
||||
jmp print_err_and_hlt
|
||||
END(_x86_check_ext_cpuid)
|
||||
|
||||
ENTRY(_x86_check_ia32e)
|
||||
movl $0x80000001, %eax
|
||||
cpuid
|
||||
test $(1 << 29), %edx
|
||||
jz 1f
|
||||
ret
|
||||
|
||||
1: pushl $errmsg_no_ia32e
|
||||
jmp print_err_and_hlt
|
||||
END(_x86_check_ia32e)
|
||||
|
||||
.section .multiboot.data, "a", @progbits
|
||||
|
||||
L_DATA(errmsg_no_multiboot)
|
||||
.asciz "Invalid Multiboot 2 magic number in %eax"
|
||||
L_END(errmsg_no_multiboot)
|
||||
L_DATA(errmsg_no_cpuid)
|
||||
.asciz "CPUID instruction not supported"
|
||||
L_END(errmsg_no_cpuid)
|
||||
L_DATA(errmsg_no_ext_cpuid)
|
||||
.asciz "No extended CPUID features available"
|
||||
L_END(errmsg_no_ext_cpuid)
|
||||
L_DATA(errmsg_no_ia32e)
|
||||
.asciz "CPU does not appear to support IA-32e mode"
|
||||
L_END(errmsg_no_ia32e)
|
||||
@ -1,464 +0,0 @@
|
||||
/* See the end of this file for copyright and license terms. */
|
||||
|
||||
#include <arch/page.h>
|
||||
|
||||
#include <gay/arith.h>
|
||||
#include <gay/cdefs.h>
|
||||
#include <gay/clist.h>
|
||||
#include <gay/config.h>
|
||||
#include <gay/errno.h>
|
||||
#include <gay/kprintf.h>
|
||||
#include <gay/mm.h>
|
||||
#include <gay/types.h>
|
||||
|
||||
#include <string.h>
|
||||
|
||||
/*
|
||||
* This allocator is based on the popular design by Doug Lea:
|
||||
* <http://gee.cs.oswego.edu/dl/html/malloc.html>
|
||||
* For a more in-depth description of how the individual parts work together,
|
||||
* see also my implementation for Ardix which is very similar except that it
|
||||
* doesn't have paging:
|
||||
* <https://git.bsd.gay/fef/ardix/src/commit/c767d551d3301fc30f9fce30eda8f04e2f9a42ab/kernel/mm.c>
|
||||
* As a matter of fact, this allocator is merely an extension of the one from
|
||||
* Ardix with the only difference being that the heap can be extended upwards.
|
||||
*/
|
||||
|
||||
/**
|
||||
* Memory block header.
|
||||
* This sits at the beginning of every memory block (duh).
|
||||
*/
|
||||
struct memblk {
|
||||
/**
|
||||
* @brief The usable low_size, i.e. the total block low_size minus `MEMBLK_OVERHEAD`.
|
||||
*
|
||||
* This low_size will also be written to the very end of the block, just after
|
||||
* the last usable address. Additionally, since blocks are always aligned
|
||||
* to at least 4 bytes anyways, we can use the LSB of this low_size as a flag
|
||||
* for whether the block is currently allocated (1) or not (0). This is
|
||||
* going to make it much easier to detect two free neighboring blocks when
|
||||
* `kfree()`ing one.
|
||||
*/
|
||||
usize low_size[1];
|
||||
|
||||
union {
|
||||
/** @brief If the block is allocated, this will be overwritten */
|
||||
struct clist clink;
|
||||
|
||||
/** @brief Used as the return value for `kmalloc()` */
|
||||
u8 data[0];
|
||||
/**
|
||||
* @brief Used to get the copy of the size at the end of
|
||||
* the block, right after the last byte of `data`
|
||||
*/
|
||||
usize high_size[0];
|
||||
};
|
||||
};
|
||||
|
||||
/* overhead per memory block in bytes (the two block sizes at the beginning and end) */
|
||||
#define OVERHEAD (2 * sizeof(usize))
|
||||
/* every allocation is padded to a multiple of this */
|
||||
#define MIN_SIZE (sizeof(struct clist))
|
||||
|
||||
/* memory blocks, sorted by increasing size */
|
||||
static CLIST(blocks);
|
||||
|
||||
/*
|
||||
* We play it *really* simple: Start at an arbitrary (page aligned, preferably
|
||||
* even page table aligned) address in virtual memory and extend the area as
|
||||
* needed as the heap grows. Efficiency doesn't matter for now; we always make
|
||||
* the heap a contiguous area without holes. There isn't even a mechanism for
|
||||
* releasing physical pages yet, i really just want to get to anything that is
|
||||
* at all usable so i can finally work on the core system architecture.
|
||||
*/
|
||||
static void *heap_start = (void *)0xd0000000;
|
||||
/*
|
||||
* Points to the first address that is not part of the heap anymore, such that
|
||||
* sizeof(heap) == heap_end - heap_start
|
||||
* Thus, the heap initially has a size of zero.
|
||||
*/
|
||||
static void *heap_end = (void *)0xd0000000;
|
||||
|
||||
/**
|
||||
* @brief Increase `heap_end` by up to `num_pages * PAGE_SIZE`.
|
||||
*
|
||||
* @param num_pages Number of pages to increase the heap by
|
||||
* @returns The actual number of pages the heap was increased by; this may be
|
||||
* less than `num_pages` if there were not enough free pages left
|
||||
*/
|
||||
static usize grow_heap(usize num_pages);
|
||||
/**
|
||||
* @brief Add a new block at the end of the heap by downloading more RAM (`grow_heap()`, actually). */
|
||||
static struct memblk *blk_create(usize num_pages);
|
||||
/** @brief Get the usable block size in bytes, without flags or overhead. */
|
||||
static usize blk_get_size(struct memblk *blk);
|
||||
/** @brief Set the usable block size without overhead and without affecting flags. */
|
||||
static void blk_set_size(struct memblk *blk, usize size);
|
||||
/** @brief Flag a block as allocated. */
|
||||
static void blk_set_alloc(struct memblk *blk);
|
||||
/** @brief Remove the allocated flag from a block. */
|
||||
static void blk_clear_alloc(struct memblk *blk);
|
||||
/** @brief Return nonzero if the block is allocated. */
|
||||
static bool blk_is_alloc(struct memblk *blk);
|
||||
/** @brief Set the border flag at the start of a block. */
|
||||
static void blk_set_border_start(struct memblk *blk);
|
||||
/** @brief Remove the border flag from the start of a block. */
|
||||
static void blk_clear_border_start(struct memblk *blk);
|
||||
/** @brief Return nonzero if a block has the border flag set at the start. */
|
||||
static bool blk_is_border_start(struct memblk *blk);
|
||||
/** @brief Set the border flag at the end of a block. */
|
||||
static void blk_set_border_end(struct memblk *blk);
|
||||
/** @brief Remove the border flag from the end of a block. */
|
||||
static void blk_clear_border_end(struct memblk *blk);
|
||||
/** @brief Return nonzero if a block has the border flag set at the end. */
|
||||
static bool blk_is_border_end(struct memblk *blk);
|
||||
/** @brief Get a block's immediate lower neighbor, or NULL if it doesn't have one. */
|
||||
static struct memblk *blk_prev(struct memblk *blk);
|
||||
/** @brief Get a block's immediate higher neighbor, or NULL if it doesn't have one. */
|
||||
static struct memblk *blk_next(struct memblk *blk);
|
||||
/** @brief Merge two contiguous free blocks into one, resort the list, and return the block. */
|
||||
static struct memblk *blk_merge(struct memblk *bottom, struct memblk *top);
|
||||
/** @brief Attempt to merge both the lower and higher neighbors of a free block. */
|
||||
static struct memblk *blk_try_merge(struct memblk *blk);
|
||||
/** @brief Cut a slice from a free block and return the slice. */
|
||||
static struct memblk *blk_slice(struct memblk *blk, usize slice_size);
|
||||
|
||||
int kmalloc_init(uintptr_t phys_start, uintptr_t phys_end)
|
||||
{
|
||||
int err = mem_init(phys_start, phys_end);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
if (grow_heap(1) != 1)
|
||||
return -ENOMEM;
|
||||
|
||||
struct memblk *blk = heap_start;
|
||||
blk_set_size(blk, PAGE_SIZE - OVERHEAD);
|
||||
blk_clear_alloc(blk);
|
||||
blk_set_border_start(blk);
|
||||
blk_set_border_end(blk);
|
||||
clist_add(&blocks, &blk->clink);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void *kmalloc(usize size, enum mm_flags flags)
|
||||
{
|
||||
if (flags != MM_KERN) {
|
||||
kprintf("Invalid flags passed to kmalloc()\n");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
if (size == 0)
|
||||
return NULL;
|
||||
|
||||
if (size % MIN_SIZE != 0)
|
||||
size = (size / MIN_SIZE) * MIN_SIZE + MIN_SIZE;
|
||||
|
||||
struct memblk *cursor;
|
||||
struct memblk *blk = NULL;
|
||||
clist_foreach_entry(&blocks, cursor, clink) {
|
||||
if (blk_get_size(cursor) >= size) {
|
||||
blk = cursor;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (blk == NULL) {
|
||||
usize required_pages = ((size + OVERHEAD) / PAGE_SIZE) + 1;
|
||||
blk = blk_create(required_pages);
|
||||
if (blk == NULL) {
|
||||
kprintf("Kernel OOM qwq\n");
|
||||
return NULL;
|
||||
}
|
||||
clist_add(&blocks, &blk->clink);
|
||||
}
|
||||
|
||||
blk = blk_slice(blk, size);
|
||||
blk_set_alloc(blk);
|
||||
# if CFG_POISON_HEAP
|
||||
memset(blk->data, 'a', blk_get_size(blk));
|
||||
# endif
|
||||
return blk->data;
|
||||
}
|
||||
|
||||
void kfree(void *ptr)
|
||||
{
|
||||
# ifdef DEBUG
|
||||
if (ptr < heap_start || ptr > heap_end) {
|
||||
kprintf("Tried to free %p which is outside the heap!\n", ptr);
|
||||
return;
|
||||
}
|
||||
# endif
|
||||
|
||||
struct memblk *blk = ptr - sizeof(blk->low_size);
|
||||
# ifdef DEBUG
|
||||
if (!blk_is_alloc(blk)) {
|
||||
kprintf("Double free of %p!\n", ptr);
|
||||
return;
|
||||
}
|
||||
# endif
|
||||
|
||||
# if CFG_POISON_HEAP
|
||||
memset(blk->data, 'A', blk_get_size(blk));
|
||||
# endif
|
||||
|
||||
blk_clear_alloc(blk);
|
||||
blk_try_merge(blk);
|
||||
}
|
||||
|
||||
/*
|
||||
* These wrappers are used for linking libc against the kernel itself.
|
||||
* This is a "temporary" hack because i haven't figured out the whole C flags
|
||||
* thingy for properly producing two versions of libc (one static one for the
|
||||
* kernel and a shared one for user space).
|
||||
*/
|
||||
|
||||
__weak void *malloc(usize size)
|
||||
{
|
||||
return kmalloc(size, MM_KERN);
|
||||
}
|
||||
|
||||
__weak void free(void *ptr)
|
||||
{
|
||||
kfree(ptr);
|
||||
}
|
||||
|
||||
static inline struct memblk *blk_create(usize num_pages)
|
||||
{
|
||||
usize blksize;
|
||||
if (mul_overflow(&blksize, num_pages, PAGE_SIZE))
|
||||
return NULL;
|
||||
|
||||
/*
|
||||
* heap_end points to the first address that is not part of the heap
|
||||
* anymore, so that's where the new block starts when we add pages
|
||||
*/
|
||||
struct memblk *blk = heap_end;
|
||||
if (grow_heap(num_pages) != num_pages)
|
||||
return NULL; /* OOM :( */
|
||||
|
||||
blk_set_size(blk, blksize - OVERHEAD);
|
||||
blk_clear_alloc(blk);
|
||||
blk_set_border_end(blk);
|
||||
|
||||
struct memblk *old_high = blk_prev(blk);
|
||||
blk_clear_border_end(old_high);
|
||||
if (!blk_is_alloc(old_high)) {
|
||||
clist_del(&old_high->clink);
|
||||
blk = blk_merge(old_high, blk);
|
||||
}
|
||||
|
||||
return blk;
|
||||
}
|
||||
|
||||
static inline usize grow_heap(usize num_pages)
|
||||
{
|
||||
usize i;
|
||||
|
||||
for (i = 0; i < num_pages; i++) {
|
||||
uintptr_t page_phys = get_page();
|
||||
if (!page_phys)
|
||||
break;
|
||||
|
||||
if (map_page(page_phys, heap_end, MM_PAGE_RW) != 0) {
|
||||
put_page(page_phys);
|
||||
break;
|
||||
}
|
||||
|
||||
heap_end += PAGE_SIZE;
|
||||
}
|
||||
|
||||
vm_flush();
|
||||
|
||||
return i;
|
||||
}
|
||||
|
||||
#define ALLOC_FLAG ((usize)1 << 0)
|
||||
#define BORDER_FLAG ((usize)1 << 1)
|
||||
#define SIZE_MASK ( ~(ALLOC_FLAG | BORDER_FLAG) )
|
||||
|
||||
static struct memblk *blk_try_merge(struct memblk *blk)
|
||||
{
|
||||
struct memblk *neighbor = blk_prev(blk);
|
||||
if (neighbor != NULL && !blk_is_alloc(neighbor)) {
|
||||
clist_del(&neighbor->clink);
|
||||
blk = blk_merge(neighbor, blk);
|
||||
}
|
||||
|
||||
neighbor = blk_next(blk);
|
||||
if (neighbor != NULL && !blk_is_alloc(neighbor)) {
|
||||
clist_del(&neighbor->clink);
|
||||
blk = blk_merge(blk, neighbor);
|
||||
}
|
||||
|
||||
struct memblk *cursor;
|
||||
clist_foreach_entry(&blocks, cursor, clink) {
|
||||
if (blk_get_size(cursor) >= blk_get_size(blk))
|
||||
break;
|
||||
}
|
||||
clist_add(&cursor->clink, &blk->clink);
|
||||
|
||||
return blk;
|
||||
}
|
||||
|
||||
static struct memblk *blk_merge(struct memblk *bottom, struct memblk *top)
|
||||
{
|
||||
usize bottom_size = blk_get_size(bottom);
|
||||
usize top_size = blk_get_size(top);
|
||||
usize total_size = bottom_size + top_size + OVERHEAD;
|
||||
|
||||
blk_set_size(bottom, total_size);
|
||||
|
||||
return bottom;
|
||||
}
|
||||
|
||||
static struct memblk *blk_slice(struct memblk *blk, usize slice_size)
|
||||
{
|
||||
struct memblk *cursor = clist_prev_entry(blk, clink);
|
||||
clist_del(&blk->clink);
|
||||
|
||||
/*
|
||||
* If the remaining size is less than the minimum allocation unit, we
|
||||
* hand out the entire block. Additionally, we must add an underflow
|
||||
* check which happens if the slice size is less than OVERHEAD smaller
|
||||
* than the full block size.
|
||||
*/
|
||||
usize rest_size = blk_get_size(blk) - slice_size - OVERHEAD;
|
||||
bool carry = sub_underflow(&rest_size, blk_get_size(blk), slice_size + OVERHEAD);
|
||||
if (rest_size < MIN_SIZE || carry) {
|
||||
blk_set_alloc(blk);
|
||||
return blk;
|
||||
}
|
||||
|
||||
usize slice_words = slice_size / sizeof(blk->low_size);
|
||||
struct memblk *rest = (void *)&blk->high_size[slice_words + 1];
|
||||
blk_set_size(rest, rest_size);
|
||||
blk_clear_alloc(rest);
|
||||
blk_clear_border_start(rest);
|
||||
|
||||
blk_set_size(blk, slice_size);
|
||||
blk_set_alloc(blk);
|
||||
blk_clear_border_end(blk);
|
||||
|
||||
clist_foreach_entry_rev_continue(&blocks, cursor, clink) {
|
||||
if (blk_get_size(cursor) <= rest_size)
|
||||
break;
|
||||
}
|
||||
clist_add_first(&cursor->clink, &rest->clink);
|
||||
|
||||
return blk;
|
||||
}
|
||||
|
||||
static inline struct memblk *blk_prev(struct memblk *blk)
|
||||
{
|
||||
if (blk_is_border_start(blk))
|
||||
return NULL;
|
||||
|
||||
#pragma clang diagnostic push
|
||||
#pragma clang diagnostic ignored "-Warray-bounds" /* trust me bro, this is fine */
|
||||
return (void *)blk - (blk->low_size[-1] & SIZE_MASK) - OVERHEAD;
|
||||
#pragma clang diagnostic pop
|
||||
}
|
||||
|
||||
static inline struct memblk *blk_next(struct memblk *blk)
|
||||
{
|
||||
if (blk_is_border_end(blk))
|
||||
return NULL;
|
||||
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
return (void *)&blk->high_size[index + 1];
|
||||
}
|
||||
|
||||
static inline usize blk_get_size(struct memblk *blk)
|
||||
{
|
||||
# ifdef DEBUG
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
if ((blk->low_size[0] & SIZE_MASK) != (blk->high_size[index] & SIZE_MASK))
|
||||
kprintf("Memory corruption in block %p detected!\n", blk);
|
||||
# endif
|
||||
return blk->low_size[0] & SIZE_MASK;
|
||||
}
|
||||
|
||||
static void blk_set_size(struct memblk *blk, usize size)
|
||||
{
|
||||
/* don't affect flags */
|
||||
blk->low_size[0] &= ~SIZE_MASK;
|
||||
# ifdef DEBUG
|
||||
if (size & ~SIZE_MASK)
|
||||
kprintf("Unaligned size in blk_set_size()\n");
|
||||
# endif
|
||||
blk->low_size[0] |= size & SIZE_MASK;
|
||||
|
||||
usize index = size / sizeof(blk->low_size[0]);
|
||||
blk->high_size[index] &= ~SIZE_MASK;
|
||||
blk->high_size[index] |= size & SIZE_MASK;
|
||||
}
|
||||
|
||||
static inline void blk_set_alloc(struct memblk *blk)
|
||||
{
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
|
||||
blk->low_size[0] |= ALLOC_FLAG;
|
||||
blk->high_size[index] |= ALLOC_FLAG;
|
||||
}
|
||||
|
||||
static inline void blk_clear_alloc(struct memblk *blk)
|
||||
{
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
|
||||
blk->low_size[0] &= ~ALLOC_FLAG;
|
||||
blk->high_size[index] &= ~ALLOC_FLAG;
|
||||
}
|
||||
|
||||
static inline bool blk_is_alloc(struct memblk *blk)
|
||||
{
|
||||
return (blk->low_size[0] & ALLOC_FLAG) != 0;
|
||||
}
|
||||
|
||||
static inline void blk_set_border_start(struct memblk *blk)
|
||||
{
|
||||
blk->low_size[0] |= BORDER_FLAG;
|
||||
}
|
||||
|
||||
static inline void blk_clear_border_start(struct memblk *blk)
|
||||
{
|
||||
blk->low_size[0] &= ~BORDER_FLAG;
|
||||
}
|
||||
|
||||
static inline bool blk_is_border_start(struct memblk *blk)
|
||||
{
|
||||
return (blk->low_size[0] & BORDER_FLAG) != 0;
|
||||
}
|
||||
|
||||
static inline void blk_set_border_end(struct memblk *blk)
|
||||
{
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
blk->high_size[index] |= BORDER_FLAG;
|
||||
}
|
||||
|
||||
static inline void blk_clear_border_end(struct memblk *blk)
|
||||
{
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
blk->high_size[index] &= ~BORDER_FLAG;
|
||||
}
|
||||
|
||||
static inline bool blk_is_border_end(struct memblk *blk)
|
||||
{
|
||||
usize index = blk->low_size[0] / sizeof(blk->low_size[0]);
|
||||
return (blk->high_size[index] & BORDER_FLAG) != 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* This file is part of GayBSD.
|
||||
* Copyright (c) 2021 fef <owo@fef.moe>.
|
||||
*
|
||||
* GayBSD is nonviolent software: you may only use, redistribute, and/or
|
||||
* modify it under the terms of the Cooperative Nonviolent Public License
|
||||
* (CNPL) as found in the LICENSE file in the source code root directory
|
||||
* or at <https://git.pixie.town/thufie/npl-builder>; either version 7
|
||||
* of the license, or (at your option) any later version.
|
||||
*
|
||||
* GayBSD comes with ABSOLUTELY NO WARRANTY, to the extent
|
||||
* permitted by applicable law. See the CNPL for details.
|
||||
*/
|
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue