Compare commits
26 Commits
bootstrap5
...
master
Author | SHA1 | Date |
---|---|---|
Øyvind Skaaden | 5f4166ff2c | |
Øyvind Skaaden | 4b86daad53 | |
Øyvind Skaaden | a955d1d4be | |
Øyvind Skaaden | d94ab3a3fb | |
Øyvind Skaaden | 5dcfcaa481 | |
Øyvind Skaaden | a459e59e7b | |
Øyvind Skaaden | 1c95b649ee | |
Øyvind Skaaden | 5700b6232a | |
Øyvind Skaaden | 3e8d62ad13 | |
Øyvind Skaaden | 45bec71687 | |
Øyvind Skaaden | 278d2975c9 | |
Øyvind Skaaden | 854ed6508a | |
Øyvind Skaaden | e4131cbcaa | |
Øyvind Skaaden | a552d38111 | |
Øyvind Skaaden | 757b0a5799 | |
Øyvind Skaaden | e5eae18389 | |
Øyvind Skaaden | 0300fcb5f5 | |
Øyvind Skaaden | 0252ea6fc8 | |
Øyvind Skaaden | da58611720 | |
Øyvind Skaaden | b240cff0ff | |
Øyvind Skaaden | 5dd2250844 | |
Øyvind Skaaden | a0c0091bde | |
Øyvind Skaaden | b6749b36d1 | |
Øyvind Skaaden | 8a3727a967 | |
Øyvind Skaaden | 836a8fcb16 | |
Øyvind Skaaden | 1257c2a304 |
2
404.html
2
404.html
|
@ -12,4 +12,4 @@ description: Siden ble ikke funnet :(
|
||||||
function goBack() {
|
function goBack() {
|
||||||
history.go(-1); event.preventDefault();
|
history.go(-1); event.preventDefault();
|
||||||
}
|
}
|
||||||
</script>
|
</script>
|
||||||
|
|
4
Gemfile
4
Gemfile
|
@ -7,7 +7,7 @@ source "https://rubygems.org"
|
||||||
#
|
#
|
||||||
# This will help ensure the proper Jekyll version is running.
|
# This will help ensure the proper Jekyll version is running.
|
||||||
# Happy Jekylling!
|
# Happy Jekylling!
|
||||||
gem "jekyll", "~> 4.1.1"
|
gem "jekyll", "~> 4.3.0"
|
||||||
# This is the default theme for new Jekyll sites. You may change this to anything you like.
|
# This is the default theme for new Jekyll sites. You may change this to anything you like.
|
||||||
|
|
||||||
# If you want to use GitHub Pages, remove the "gem "jekyll"" above and
|
# If you want to use GitHub Pages, remove the "gem "jekyll"" above and
|
||||||
|
@ -18,3 +18,5 @@ gem "jekyll", "~> 4.1.1"
|
||||||
# gem "jekyll-feed", "~> 0.12"
|
# gem "jekyll-feed", "~> 0.12"
|
||||||
#end
|
#end
|
||||||
|
|
||||||
|
|
||||||
|
gem "webrick", "~> 1.8"
|
||||||
|
|
|
@ -0,0 +1,674 @@
|
||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 29 June 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The GNU General Public License is a free, copyleft license for
|
||||||
|
software and other kinds of works.
|
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed
|
||||||
|
to take away your freedom to share and change the works. By contrast,
|
||||||
|
the GNU General Public License is intended to guarantee your freedom to
|
||||||
|
share and change all versions of a program--to make sure it remains free
|
||||||
|
software for all its users. We, the Free Software Foundation, use the
|
||||||
|
GNU General Public License for most of our software; it applies also to
|
||||||
|
any other work released this way by its authors. You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
them if you wish), that you receive source code or can get it if you
|
||||||
|
want it, that you can change the software or use pieces of it in new
|
||||||
|
free programs, and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to prevent others from denying you
|
||||||
|
these rights or asking you to surrender the rights. Therefore, you have
|
||||||
|
certain responsibilities if you distribute copies of the software, or if
|
||||||
|
you modify it: responsibilities to respect the freedom of others.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must pass on to the recipients the same
|
||||||
|
freedoms that you received. You must make sure that they, too, receive
|
||||||
|
or can get the source code. And you must show them these terms so they
|
||||||
|
know their rights.
|
||||||
|
|
||||||
|
Developers that use the GNU GPL protect your rights with two steps:
|
||||||
|
(1) assert copyright on the software, and (2) offer you this License
|
||||||
|
giving you legal permission to copy, distribute and/or modify it.
|
||||||
|
|
||||||
|
For the developers' and authors' protection, the GPL clearly explains
|
||||||
|
that there is no warranty for this free software. For both users' and
|
||||||
|
authors' sake, the GPL requires that modified versions be marked as
|
||||||
|
changed, so that their problems will not be attributed erroneously to
|
||||||
|
authors of previous versions.
|
||||||
|
|
||||||
|
Some devices are designed to deny users access to install or run
|
||||||
|
modified versions of the software inside them, although the manufacturer
|
||||||
|
can do so. This is fundamentally incompatible with the aim of
|
||||||
|
protecting users' freedom to change the software. The systematic
|
||||||
|
pattern of such abuse occurs in the area of products for individuals to
|
||||||
|
use, which is precisely where it is most unacceptable. Therefore, we
|
||||||
|
have designed this version of the GPL to prohibit the practice for those
|
||||||
|
products. If such problems arise substantially in other domains, we
|
||||||
|
stand ready to extend this provision to those domains in future versions
|
||||||
|
of the GPL, as needed to protect the freedom of users.
|
||||||
|
|
||||||
|
Finally, every program is threatened constantly by software patents.
|
||||||
|
States should not allow patents to restrict development and use of
|
||||||
|
software on general-purpose computers, but in those that do, we wish to
|
||||||
|
avoid the special danger that patents applied to a free program could
|
||||||
|
make it effectively proprietary. To prevent this, the GPL assures that
|
||||||
|
patents cannot be used to render the program non-free.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
0. Definitions.
|
||||||
|
|
||||||
|
"This License" refers to version 3 of the GNU General Public License.
|
||||||
|
|
||||||
|
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||||
|
works, such as semiconductor masks.
|
||||||
|
|
||||||
|
"The Program" refers to any copyrightable work licensed under this
|
||||||
|
License. Each licensee is addressed as "you". "Licensees" and
|
||||||
|
"recipients" may be individuals or organizations.
|
||||||
|
|
||||||
|
To "modify" a work means to copy from or adapt all or part of the work
|
||||||
|
in a fashion requiring copyright permission, other than the making of an
|
||||||
|
exact copy. The resulting work is called a "modified version" of the
|
||||||
|
earlier work or a work "based on" the earlier work.
|
||||||
|
|
||||||
|
A "covered work" means either the unmodified Program or a work based
|
||||||
|
on the Program.
|
||||||
|
|
||||||
|
To "propagate" a work means to do anything with it that, without
|
||||||
|
permission, would make you directly or secondarily liable for
|
||||||
|
infringement under applicable copyright law, except executing it on a
|
||||||
|
computer or modifying a private copy. Propagation includes copying,
|
||||||
|
distribution (with or without modification), making available to the
|
||||||
|
public, and in some countries other activities as well.
|
||||||
|
|
||||||
|
To "convey" a work means any kind of propagation that enables other
|
||||||
|
parties to make or receive copies. Mere interaction with a user through
|
||||||
|
a computer network, with no transfer of a copy, is not conveying.
|
||||||
|
|
||||||
|
An interactive user interface displays "Appropriate Legal Notices"
|
||||||
|
to the extent that it includes a convenient and prominently visible
|
||||||
|
feature that (1) displays an appropriate copyright notice, and (2)
|
||||||
|
tells the user that there is no warranty for the work (except to the
|
||||||
|
extent that warranties are provided), that licensees may convey the
|
||||||
|
work under this License, and how to view a copy of this License. If
|
||||||
|
the interface presents a list of user commands or options, such as a
|
||||||
|
menu, a prominent item in the list meets this criterion.
|
||||||
|
|
||||||
|
1. Source Code.
|
||||||
|
|
||||||
|
The "source code" for a work means the preferred form of the work
|
||||||
|
for making modifications to it. "Object code" means any non-source
|
||||||
|
form of a work.
|
||||||
|
|
||||||
|
A "Standard Interface" means an interface that either is an official
|
||||||
|
standard defined by a recognized standards body, or, in the case of
|
||||||
|
interfaces specified for a particular programming language, one that
|
||||||
|
is widely used among developers working in that language.
|
||||||
|
|
||||||
|
The "System Libraries" of an executable work include anything, other
|
||||||
|
than the work as a whole, that (a) is included in the normal form of
|
||||||
|
packaging a Major Component, but which is not part of that Major
|
||||||
|
Component, and (b) serves only to enable use of the work with that
|
||||||
|
Major Component, or to implement a Standard Interface for which an
|
||||||
|
implementation is available to the public in source code form. A
|
||||||
|
"Major Component", in this context, means a major essential component
|
||||||
|
(kernel, window system, and so on) of the specific operating system
|
||||||
|
(if any) on which the executable work runs, or a compiler used to
|
||||||
|
produce the work, or an object code interpreter used to run it.
|
||||||
|
|
||||||
|
The "Corresponding Source" for a work in object code form means all
|
||||||
|
the source code needed to generate, install, and (for an executable
|
||||||
|
work) run the object code and to modify the work, including scripts to
|
||||||
|
control those activities. However, it does not include the work's
|
||||||
|
System Libraries, or general-purpose tools or generally available free
|
||||||
|
programs which are used unmodified in performing those activities but
|
||||||
|
which are not part of the work. For example, Corresponding Source
|
||||||
|
includes interface definition files associated with source files for
|
||||||
|
the work, and the source code for shared libraries and dynamically
|
||||||
|
linked subprograms that the work is specifically designed to require,
|
||||||
|
such as by intimate data communication or control flow between those
|
||||||
|
subprograms and other parts of the work.
|
||||||
|
|
||||||
|
The Corresponding Source need not include anything that users
|
||||||
|
can regenerate automatically from other parts of the Corresponding
|
||||||
|
Source.
|
||||||
|
|
||||||
|
The Corresponding Source for a work in source code form is that
|
||||||
|
same work.
|
||||||
|
|
||||||
|
2. Basic Permissions.
|
||||||
|
|
||||||
|
All rights granted under this License are granted for the term of
|
||||||
|
copyright on the Program, and are irrevocable provided the stated
|
||||||
|
conditions are met. This License explicitly affirms your unlimited
|
||||||
|
permission to run the unmodified Program. The output from running a
|
||||||
|
covered work is covered by this License only if the output, given its
|
||||||
|
content, constitutes a covered work. This License acknowledges your
|
||||||
|
rights of fair use or other equivalent, as provided by copyright law.
|
||||||
|
|
||||||
|
You may make, run and propagate covered works that you do not
|
||||||
|
convey, without conditions so long as your license otherwise remains
|
||||||
|
in force. You may convey covered works to others for the sole purpose
|
||||||
|
of having them make modifications exclusively for you, or provide you
|
||||||
|
with facilities for running those works, provided that you comply with
|
||||||
|
the terms of this License in conveying all material for which you do
|
||||||
|
not control copyright. Those thus making or running the covered works
|
||||||
|
for you must do so exclusively on your behalf, under your direction
|
||||||
|
and control, on terms that prohibit them from making any copies of
|
||||||
|
your copyrighted material outside their relationship with you.
|
||||||
|
|
||||||
|
Conveying under any other circumstances is permitted solely under
|
||||||
|
the conditions stated below. Sublicensing is not allowed; section 10
|
||||||
|
makes it unnecessary.
|
||||||
|
|
||||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||||
|
|
||||||
|
No covered work shall be deemed part of an effective technological
|
||||||
|
measure under any applicable law fulfilling obligations under article
|
||||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||||
|
similar laws prohibiting or restricting circumvention of such
|
||||||
|
measures.
|
||||||
|
|
||||||
|
When you convey a covered work, you waive any legal power to forbid
|
||||||
|
circumvention of technological measures to the extent such circumvention
|
||||||
|
is effected by exercising rights under this License with respect to
|
||||||
|
the covered work, and you disclaim any intention to limit operation or
|
||||||
|
modification of the work as a means of enforcing, against the work's
|
||||||
|
users, your or third parties' legal rights to forbid circumvention of
|
||||||
|
technological measures.
|
||||||
|
|
||||||
|
4. Conveying Verbatim Copies.
|
||||||
|
|
||||||
|
You may convey verbatim copies of the Program's source code as you
|
||||||
|
receive it, in any medium, provided that you conspicuously and
|
||||||
|
appropriately publish on each copy an appropriate copyright notice;
|
||||||
|
keep intact all notices stating that this License and any
|
||||||
|
non-permissive terms added in accord with section 7 apply to the code;
|
||||||
|
keep intact all notices of the absence of any warranty; and give all
|
||||||
|
recipients a copy of this License along with the Program.
|
||||||
|
|
||||||
|
You may charge any price or no price for each copy that you convey,
|
||||||
|
and you may offer support or warranty protection for a fee.
|
||||||
|
|
||||||
|
5. Conveying Modified Source Versions.
|
||||||
|
|
||||||
|
You may convey a work based on the Program, or the modifications to
|
||||||
|
produce it from the Program, in the form of source code under the
|
||||||
|
terms of section 4, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) The work must carry prominent notices stating that you modified
|
||||||
|
it, and giving a relevant date.
|
||||||
|
|
||||||
|
b) The work must carry prominent notices stating that it is
|
||||||
|
released under this License and any conditions added under section
|
||||||
|
7. This requirement modifies the requirement in section 4 to
|
||||||
|
"keep intact all notices".
|
||||||
|
|
||||||
|
c) You must license the entire work, as a whole, under this
|
||||||
|
License to anyone who comes into possession of a copy. This
|
||||||
|
License will therefore apply, along with any applicable section 7
|
||||||
|
additional terms, to the whole of the work, and all its parts,
|
||||||
|
regardless of how they are packaged. This License gives no
|
||||||
|
permission to license the work in any other way, but it does not
|
||||||
|
invalidate such permission if you have separately received it.
|
||||||
|
|
||||||
|
d) If the work has interactive user interfaces, each must display
|
||||||
|
Appropriate Legal Notices; however, if the Program has interactive
|
||||||
|
interfaces that do not display Appropriate Legal Notices, your
|
||||||
|
work need not make them do so.
|
||||||
|
|
||||||
|
A compilation of a covered work with other separate and independent
|
||||||
|
works, which are not by their nature extensions of the covered work,
|
||||||
|
and which are not combined with it such as to form a larger program,
|
||||||
|
in or on a volume of a storage or distribution medium, is called an
|
||||||
|
"aggregate" if the compilation and its resulting copyright are not
|
||||||
|
used to limit the access or legal rights of the compilation's users
|
||||||
|
beyond what the individual works permit. Inclusion of a covered work
|
||||||
|
in an aggregate does not cause this License to apply to the other
|
||||||
|
parts of the aggregate.
|
||||||
|
|
||||||
|
6. Conveying Non-Source Forms.
|
||||||
|
|
||||||
|
You may convey a covered work in object code form under the terms
|
||||||
|
of sections 4 and 5, provided that you also convey the
|
||||||
|
machine-readable Corresponding Source under the terms of this License,
|
||||||
|
in one of these ways:
|
||||||
|
|
||||||
|
a) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by the
|
||||||
|
Corresponding Source fixed on a durable physical medium
|
||||||
|
customarily used for software interchange.
|
||||||
|
|
||||||
|
b) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by a
|
||||||
|
written offer, valid for at least three years and valid for as
|
||||||
|
long as you offer spare parts or customer support for that product
|
||||||
|
model, to give anyone who possesses the object code either (1) a
|
||||||
|
copy of the Corresponding Source for all the software in the
|
||||||
|
product that is covered by this License, on a durable physical
|
||||||
|
medium customarily used for software interchange, for a price no
|
||||||
|
more than your reasonable cost of physically performing this
|
||||||
|
conveying of source, or (2) access to copy the
|
||||||
|
Corresponding Source from a network server at no charge.
|
||||||
|
|
||||||
|
c) Convey individual copies of the object code with a copy of the
|
||||||
|
written offer to provide the Corresponding Source. This
|
||||||
|
alternative is allowed only occasionally and noncommercially, and
|
||||||
|
only if you received the object code with such an offer, in accord
|
||||||
|
with subsection 6b.
|
||||||
|
|
||||||
|
d) Convey the object code by offering access from a designated
|
||||||
|
place (gratis or for a charge), and offer equivalent access to the
|
||||||
|
Corresponding Source in the same way through the same place at no
|
||||||
|
further charge. You need not require recipients to copy the
|
||||||
|
Corresponding Source along with the object code. If the place to
|
||||||
|
copy the object code is a network server, the Corresponding Source
|
||||||
|
may be on a different server (operated by you or a third party)
|
||||||
|
that supports equivalent copying facilities, provided you maintain
|
||||||
|
clear directions next to the object code saying where to find the
|
||||||
|
Corresponding Source. Regardless of what server hosts the
|
||||||
|
Corresponding Source, you remain obligated to ensure that it is
|
||||||
|
available for as long as needed to satisfy these requirements.
|
||||||
|
|
||||||
|
e) Convey the object code using peer-to-peer transmission, provided
|
||||||
|
you inform other peers where the object code and Corresponding
|
||||||
|
Source of the work are being offered to the general public at no
|
||||||
|
charge under subsection 6d.
|
||||||
|
|
||||||
|
A separable portion of the object code, whose source code is excluded
|
||||||
|
from the Corresponding Source as a System Library, need not be
|
||||||
|
included in conveying the object code work.
|
||||||
|
|
||||||
|
A "User Product" is either (1) a "consumer product", which means any
|
||||||
|
tangible personal property which is normally used for personal, family,
|
||||||
|
or household purposes, or (2) anything designed or sold for incorporation
|
||||||
|
into a dwelling. In determining whether a product is a consumer product,
|
||||||
|
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||||
|
product received by a particular user, "normally used" refers to a
|
||||||
|
typical or common use of that class of product, regardless of the status
|
||||||
|
of the particular user or of the way in which the particular user
|
||||||
|
actually uses, or expects or is expected to use, the product. A product
|
||||||
|
is a consumer product regardless of whether the product has substantial
|
||||||
|
commercial, industrial or non-consumer uses, unless such uses represent
|
||||||
|
the only significant mode of use of the product.
|
||||||
|
|
||||||
|
"Installation Information" for a User Product means any methods,
|
||||||
|
procedures, authorization keys, or other information required to install
|
||||||
|
and execute modified versions of a covered work in that User Product from
|
||||||
|
a modified version of its Corresponding Source. The information must
|
||||||
|
suffice to ensure that the continued functioning of the modified object
|
||||||
|
code is in no case prevented or interfered with solely because
|
||||||
|
modification has been made.
|
||||||
|
|
||||||
|
If you convey an object code work under this section in, or with, or
|
||||||
|
specifically for use in, a User Product, and the conveying occurs as
|
||||||
|
part of a transaction in which the right of possession and use of the
|
||||||
|
User Product is transferred to the recipient in perpetuity or for a
|
||||||
|
fixed term (regardless of how the transaction is characterized), the
|
||||||
|
Corresponding Source conveyed under this section must be accompanied
|
||||||
|
by the Installation Information. But this requirement does not apply
|
||||||
|
if neither you nor any third party retains the ability to install
|
||||||
|
modified object code on the User Product (for example, the work has
|
||||||
|
been installed in ROM).
|
||||||
|
|
||||||
|
The requirement to provide Installation Information does not include a
|
||||||
|
requirement to continue to provide support service, warranty, or updates
|
||||||
|
for a work that has been modified or installed by the recipient, or for
|
||||||
|
the User Product in which it has been modified or installed. Access to a
|
||||||
|
network may be denied when the modification itself materially and
|
||||||
|
adversely affects the operation of the network or violates the rules and
|
||||||
|
protocols for communication across the network.
|
||||||
|
|
||||||
|
Corresponding Source conveyed, and Installation Information provided,
|
||||||
|
in accord with this section must be in a format that is publicly
|
||||||
|
documented (and with an implementation available to the public in
|
||||||
|
source code form), and must require no special password or key for
|
||||||
|
unpacking, reading or copying.
|
||||||
|
|
||||||
|
7. Additional Terms.
|
||||||
|
|
||||||
|
"Additional permissions" are terms that supplement the terms of this
|
||||||
|
License by making exceptions from one or more of its conditions.
|
||||||
|
Additional permissions that are applicable to the entire Program shall
|
||||||
|
be treated as though they were included in this License, to the extent
|
||||||
|
that they are valid under applicable law. If additional permissions
|
||||||
|
apply only to part of the Program, that part may be used separately
|
||||||
|
under those permissions, but the entire Program remains governed by
|
||||||
|
this License without regard to the additional permissions.
|
||||||
|
|
||||||
|
When you convey a copy of a covered work, you may at your option
|
||||||
|
remove any additional permissions from that copy, or from any part of
|
||||||
|
it. (Additional permissions may be written to require their own
|
||||||
|
removal in certain cases when you modify the work.) You may place
|
||||||
|
additional permissions on material, added by you to a covered work,
|
||||||
|
for which you have or can give appropriate copyright permission.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, for material you
|
||||||
|
add to a covered work, you may (if authorized by the copyright holders of
|
||||||
|
that material) supplement the terms of this License with terms:
|
||||||
|
|
||||||
|
a) Disclaiming warranty or limiting liability differently from the
|
||||||
|
terms of sections 15 and 16 of this License; or
|
||||||
|
|
||||||
|
b) Requiring preservation of specified reasonable legal notices or
|
||||||
|
author attributions in that material or in the Appropriate Legal
|
||||||
|
Notices displayed by works containing it; or
|
||||||
|
|
||||||
|
c) Prohibiting misrepresentation of the origin of that material, or
|
||||||
|
requiring that modified versions of such material be marked in
|
||||||
|
reasonable ways as different from the original version; or
|
||||||
|
|
||||||
|
d) Limiting the use for publicity purposes of names of licensors or
|
||||||
|
authors of the material; or
|
||||||
|
|
||||||
|
e) Declining to grant rights under trademark law for use of some
|
||||||
|
trade names, trademarks, or service marks; or
|
||||||
|
|
||||||
|
f) Requiring indemnification of licensors and authors of that
|
||||||
|
material by anyone who conveys the material (or modified versions of
|
||||||
|
it) with contractual assumptions of liability to the recipient, for
|
||||||
|
any liability that these contractual assumptions directly impose on
|
||||||
|
those licensors and authors.
|
||||||
|
|
||||||
|
All other non-permissive additional terms are considered "further
|
||||||
|
restrictions" within the meaning of section 10. If the Program as you
|
||||||
|
received it, or any part of it, contains a notice stating that it is
|
||||||
|
governed by this License along with a term that is a further
|
||||||
|
restriction, you may remove that term. If a license document contains
|
||||||
|
a further restriction but permits relicensing or conveying under this
|
||||||
|
License, you may add to a covered work material governed by the terms
|
||||||
|
of that license document, provided that the further restriction does
|
||||||
|
not survive such relicensing or conveying.
|
||||||
|
|
||||||
|
If you add terms to a covered work in accord with this section, you
|
||||||
|
must place, in the relevant source files, a statement of the
|
||||||
|
additional terms that apply to those files, or a notice indicating
|
||||||
|
where to find the applicable terms.
|
||||||
|
|
||||||
|
Additional terms, permissive or non-permissive, may be stated in the
|
||||||
|
form of a separately written license, or stated as exceptions;
|
||||||
|
the above requirements apply either way.
|
||||||
|
|
||||||
|
8. Termination.
|
||||||
|
|
||||||
|
You may not propagate or modify a covered work except as expressly
|
||||||
|
provided under this License. Any attempt otherwise to propagate or
|
||||||
|
modify it is void, and will automatically terminate your rights under
|
||||||
|
this License (including any patent licenses granted under the third
|
||||||
|
paragraph of section 11).
|
||||||
|
|
||||||
|
However, if you cease all violation of this License, then your
|
||||||
|
license from a particular copyright holder is reinstated (a)
|
||||||
|
provisionally, unless and until the copyright holder explicitly and
|
||||||
|
finally terminates your license, and (b) permanently, if the copyright
|
||||||
|
holder fails to notify you of the violation by some reasonable means
|
||||||
|
prior to 60 days after the cessation.
|
||||||
|
|
||||||
|
Moreover, your license from a particular copyright holder is
|
||||||
|
reinstated permanently if the copyright holder notifies you of the
|
||||||
|
violation by some reasonable means, this is the first time you have
|
||||||
|
received notice of violation of this License (for any work) from that
|
||||||
|
copyright holder, and you cure the violation prior to 30 days after
|
||||||
|
your receipt of the notice.
|
||||||
|
|
||||||
|
Termination of your rights under this section does not terminate the
|
||||||
|
licenses of parties who have received copies or rights from you under
|
||||||
|
this License. If your rights have been terminated and not permanently
|
||||||
|
reinstated, you do not qualify to receive new licenses for the same
|
||||||
|
material under section 10.
|
||||||
|
|
||||||
|
9. Acceptance Not Required for Having Copies.
|
||||||
|
|
||||||
|
You are not required to accept this License in order to receive or
|
||||||
|
run a copy of the Program. Ancillary propagation of a covered work
|
||||||
|
occurring solely as a consequence of using peer-to-peer transmission
|
||||||
|
to receive a copy likewise does not require acceptance. However,
|
||||||
|
nothing other than this License grants you permission to propagate or
|
||||||
|
modify any covered work. These actions infringe copyright if you do
|
||||||
|
not accept this License. Therefore, by modifying or propagating a
|
||||||
|
covered work, you indicate your acceptance of this License to do so.
|
||||||
|
|
||||||
|
10. Automatic Licensing of Downstream Recipients.
|
||||||
|
|
||||||
|
Each time you convey a covered work, the recipient automatically
|
||||||
|
receives a license from the original licensors, to run, modify and
|
||||||
|
propagate that work, subject to this License. You are not responsible
|
||||||
|
for enforcing compliance by third parties with this License.
|
||||||
|
|
||||||
|
An "entity transaction" is a transaction transferring control of an
|
||||||
|
organization, or substantially all assets of one, or subdividing an
|
||||||
|
organization, or merging organizations. If propagation of a covered
|
||||||
|
work results from an entity transaction, each party to that
|
||||||
|
transaction who receives a copy of the work also receives whatever
|
||||||
|
licenses to the work the party's predecessor in interest had or could
|
||||||
|
give under the previous paragraph, plus a right to possession of the
|
||||||
|
Corresponding Source of the work from the predecessor in interest, if
|
||||||
|
the predecessor has it or can get it with reasonable efforts.
|
||||||
|
|
||||||
|
You may not impose any further restrictions on the exercise of the
|
||||||
|
rights granted or affirmed under this License. For example, you may
|
||||||
|
not impose a license fee, royalty, or other charge for exercise of
|
||||||
|
rights granted under this License, and you may not initiate litigation
|
||||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||||
|
any patent claim is infringed by making, using, selling, offering for
|
||||||
|
sale, or importing the Program or any portion of it.
|
||||||
|
|
||||||
|
11. Patents.
|
||||||
|
|
||||||
|
A "contributor" is a copyright holder who authorizes use under this
|
||||||
|
License of the Program or a work on which the Program is based. The
|
||||||
|
work thus licensed is called the contributor's "contributor version".
|
||||||
|
|
||||||
|
A contributor's "essential patent claims" are all patent claims
|
||||||
|
owned or controlled by the contributor, whether already acquired or
|
||||||
|
hereafter acquired, that would be infringed by some manner, permitted
|
||||||
|
by this License, of making, using, or selling its contributor version,
|
||||||
|
but do not include claims that would be infringed only as a
|
||||||
|
consequence of further modification of the contributor version. For
|
||||||
|
purposes of this definition, "control" includes the right to grant
|
||||||
|
patent sublicenses in a manner consistent with the requirements of
|
||||||
|
this License.
|
||||||
|
|
||||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||||
|
patent license under the contributor's essential patent claims, to
|
||||||
|
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||||
|
propagate the contents of its contributor version.
|
||||||
|
|
||||||
|
In the following three paragraphs, a "patent license" is any express
|
||||||
|
agreement or commitment, however denominated, not to enforce a patent
|
||||||
|
(such as an express permission to practice a patent or covenant not to
|
||||||
|
sue for patent infringement). To "grant" such a patent license to a
|
||||||
|
party means to make such an agreement or commitment not to enforce a
|
||||||
|
patent against the party.
|
||||||
|
|
||||||
|
If you convey a covered work, knowingly relying on a patent license,
|
||||||
|
and the Corresponding Source of the work is not available for anyone
|
||||||
|
to copy, free of charge and under the terms of this License, through a
|
||||||
|
publicly available network server or other readily accessible means,
|
||||||
|
then you must either (1) cause the Corresponding Source to be so
|
||||||
|
available, or (2) arrange to deprive yourself of the benefit of the
|
||||||
|
patent license for this particular work, or (3) arrange, in a manner
|
||||||
|
consistent with the requirements of this License, to extend the patent
|
||||||
|
license to downstream recipients. "Knowingly relying" means you have
|
||||||
|
actual knowledge that, but for the patent license, your conveying the
|
||||||
|
covered work in a country, or your recipient's use of the covered work
|
||||||
|
in a country, would infringe one or more identifiable patents in that
|
||||||
|
country that you have reason to believe are valid.
|
||||||
|
|
||||||
|
If, pursuant to or in connection with a single transaction or
|
||||||
|
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||||
|
covered work, and grant a patent license to some of the parties
|
||||||
|
receiving the covered work authorizing them to use, propagate, modify
|
||||||
|
or convey a specific copy of the covered work, then the patent license
|
||||||
|
you grant is automatically extended to all recipients of the covered
|
||||||
|
work and works based on it.
|
||||||
|
|
||||||
|
A patent license is "discriminatory" if it does not include within
|
||||||
|
the scope of its coverage, prohibits the exercise of, or is
|
||||||
|
conditioned on the non-exercise of one or more of the rights that are
|
||||||
|
specifically granted under this License. You may not convey a covered
|
||||||
|
work if you are a party to an arrangement with a third party that is
|
||||||
|
in the business of distributing software, under which you make payment
|
||||||
|
to the third party based on the extent of your activity of conveying
|
||||||
|
the work, and under which the third party grants, to any of the
|
||||||
|
parties who would receive the covered work from you, a discriminatory
|
||||||
|
patent license (a) in connection with copies of the covered work
|
||||||
|
conveyed by you (or copies made from those copies), or (b) primarily
|
||||||
|
for and in connection with specific products or compilations that
|
||||||
|
contain the covered work, unless you entered into that arrangement,
|
||||||
|
or that patent license was granted, prior to 28 March 2007.
|
||||||
|
|
||||||
|
Nothing in this License shall be construed as excluding or limiting
|
||||||
|
any implied license or other defenses to infringement that may
|
||||||
|
otherwise be available to you under applicable patent law.
|
||||||
|
|
||||||
|
12. No Surrender of Others' Freedom.
|
||||||
|
|
||||||
|
If conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot convey a
|
||||||
|
covered work so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you may
|
||||||
|
not convey it at all. For example, if you agree to terms that obligate you
|
||||||
|
to collect a royalty for further conveying from those to whom you convey
|
||||||
|
the Program, the only way you could satisfy both those terms and this
|
||||||
|
License would be to refrain entirely from conveying the Program.
|
||||||
|
|
||||||
|
13. Use with the GNU Affero General Public License.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, you have
|
||||||
|
permission to link or combine any covered work with a work licensed
|
||||||
|
under version 3 of the GNU Affero General Public License into a single
|
||||||
|
combined work, and to convey the resulting work. The terms of this
|
||||||
|
License will continue to apply to the part which is the covered work,
|
||||||
|
but the special requirements of the GNU Affero General Public License,
|
||||||
|
section 13, concerning interaction through a network will apply to the
|
||||||
|
combination as such.
|
||||||
|
|
||||||
|
14. Revised Versions of this License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of
|
||||||
|
the GNU General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the
|
||||||
|
Program specifies that a certain numbered version of the GNU General
|
||||||
|
Public License "or any later version" applies to it, you have the
|
||||||
|
option of following the terms and conditions either of that numbered
|
||||||
|
version or of any later version published by the Free Software
|
||||||
|
Foundation. If the Program does not specify a version number of the
|
||||||
|
GNU General Public License, you may choose any version ever published
|
||||||
|
by the Free Software Foundation.
|
||||||
|
|
||||||
|
If the Program specifies that a proxy can decide which future
|
||||||
|
versions of the GNU General Public License can be used, that proxy's
|
||||||
|
public statement of acceptance of a version permanently authorizes you
|
||||||
|
to choose that version for the Program.
|
||||||
|
|
||||||
|
Later license versions may give you additional or different
|
||||||
|
permissions. However, no additional obligations are imposed on any
|
||||||
|
author or copyright holder as a result of your choosing to follow a
|
||||||
|
later version.
|
||||||
|
|
||||||
|
15. Disclaimer of Warranty.
|
||||||
|
|
||||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||||
|
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||||
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||||
|
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
16. Limitation of Liability.
|
||||||
|
|
||||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||||
|
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||||
|
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||||
|
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||||
|
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||||
|
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||||
|
SUCH DAMAGES.
|
||||||
|
|
||||||
|
17. Interpretation of Sections 15 and 16.
|
||||||
|
|
||||||
|
If the disclaimer of warranty and limitation of liability provided
|
||||||
|
above cannot be given local legal effect according to their terms,
|
||||||
|
reviewing courts shall apply local law that most closely approximates
|
||||||
|
an absolute waiver of all civil liability in connection with the
|
||||||
|
Program, unless a warranty or assumption of liability accompanies a
|
||||||
|
copy of the Program in return for a fee.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs
|
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest
|
||||||
|
possible use to the public, the best way to achieve this is to make it
|
||||||
|
free software which everyone can redistribute and change under these terms.
|
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest
|
||||||
|
to attach them to the start of each source file to most effectively
|
||||||
|
state the exclusion of warranty; and each file should have at least
|
||||||
|
the "copyright" line and a pointer to where the full notice is found.
|
||||||
|
|
||||||
|
<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: you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If the program does terminal interaction, make it output a short
|
||||||
|
notice like this when it starts in an interactive mode:
|
||||||
|
|
||||||
|
<program> Copyright (C) <year> <name of author>
|
||||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||||
|
This is free software, and you are welcome to redistribute it
|
||||||
|
under certain conditions; type `show c' for details.
|
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||||
|
parts of the General Public License. Of course, your program's commands
|
||||||
|
might be different; for a GUI interface, you would use an "about box".
|
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or school,
|
||||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||||
|
For more information on this, and how to apply and follow the GNU GPL, see
|
||||||
|
<https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
The GNU General Public License does not permit incorporating your program
|
||||||
|
into proprietary programs. If your program is a subroutine library, you
|
||||||
|
may consider it more useful to permit linking proprietary applications with
|
||||||
|
the library. If this is what you want to do, use the GNU Lesser General
|
||||||
|
Public License instead of this License. But first, please read
|
||||||
|
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
|
@ -36,8 +36,6 @@ author:
|
||||||
collections:
|
collections:
|
||||||
posts:
|
posts:
|
||||||
excerpt_separator: <!--more-->
|
excerpt_separator: <!--more-->
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
markdown: kramdown
|
markdown: kramdown
|
||||||
|
|
|
@ -1,7 +1,7 @@
|
||||||
-
|
-
|
||||||
title: NTNU
|
title: NTNU
|
||||||
href: /ntnu/
|
href: /ntnu/
|
||||||
description: Alt som er relatert til NTNU, både fag og filer. Her kan du finne tidligere eksamensoppgaver, LF, mine løsninger og oppsummeringer.
|
description: Alt som er relatert til NTNU, både fag og noen filer. Her kan du finne mine løsninger og oppsummeringer.
|
||||||
icon: fa-graduation-cap
|
icon: fa-graduation-cap
|
||||||
|
|
||||||
-
|
-
|
||||||
|
|
|
@ -14,11 +14,11 @@
|
||||||
-
|
-
|
||||||
course: ttk4145
|
course: ttk4145
|
||||||
desc: Sanntidsprogrammering, våren 2021.
|
desc: Sanntidsprogrammering, våren 2021.
|
||||||
updated: 2021-05-04
|
updated: 2021-05-18
|
||||||
-
|
# -
|
||||||
course: tiø4252
|
# course: tiø4252
|
||||||
desc: Teknologiledelse, våren 2021.
|
# desc: Teknologiledelse, våren 2021.
|
||||||
updated: 2021-05-04
|
# updated: 2021-05-13
|
||||||
|
|
||||||
# Høsten 2020
|
# Høsten 2020
|
||||||
-
|
-
|
||||||
|
@ -79,10 +79,10 @@
|
||||||
course: ttt4260
|
course: ttt4260
|
||||||
desc: Elektronisk systemdesign og -analyse I, våren 2019.
|
desc: Elektronisk systemdesign og -analyse I, våren 2019.
|
||||||
updated: 2019-05-05
|
updated: 2019-05-05
|
||||||
-
|
# -
|
||||||
course: tma4105
|
# course: tma4105
|
||||||
desc: Matematikk 2, våren 2019.
|
# desc: Matematikk 2, våren 2019.
|
||||||
updated: 2019-05-21
|
# updated: 2019-05-21
|
||||||
-
|
-
|
||||||
course: tdt4102
|
course: tdt4102
|
||||||
desc: Prosedyre og objektorientert programmering, våren 2019.
|
desc: Prosedyre og objektorientert programmering, våren 2019.
|
||||||
|
|
2
about.md
2
about.md
|
@ -4,7 +4,7 @@ title: Om
|
||||||
permalink: /om/
|
permalink: /om/
|
||||||
---
|
---
|
||||||
|
|
||||||
Mitt navn er Øyvind Skaaden. Jeg er 22 år gammel og studerer Elektronisk systemdesign og innovasjon på NTNU.
|
Mitt navn er Øyvind Skaaden. Jeg er 24 år gammel og studerer Elektronisk systemdesign og innovasjon på NTNU.
|
||||||
|
|
||||||
Jeg er stor fan av open-source og prøver så godt jeg kan å fremme dette.
|
Jeg er stor fan av open-source og prøver så godt jeg kan å fremme dette.
|
||||||
|
|
||||||
|
|
|
@ -1,6 +1,6 @@
|
||||||
---
|
---
|
||||||
layout: layouts/home
|
layout: layouts/home
|
||||||
description: Personlig nettside for Øyvind Skaaden. Inneholder det meste av personlige prosjekter og fag fra NTNU.
|
description: Personlig nettside for Øyvind Skaaden. Inneholder det meste av personlige prosjekter og noen ting fra NTNU.
|
||||||
---
|
---
|
||||||
|
|
||||||
<div class="homepage-main">
|
<div class="homepage-main">
|
||||||
|
@ -18,4 +18,3 @@ description: Personlig nettside for Øyvind Skaaden. Inneholder det meste av per
|
||||||
{% endfor %}
|
{% endfor %}
|
||||||
</div>
|
</div>
|
||||||
</div>
|
</div>
|
||||||
|
|
||||||
|
|
|
@ -4,10 +4,6 @@ title: "TFE4130"
|
||||||
description: "Bølgeforplantning"
|
description: "Bølgeforplantning"
|
||||||
---
|
---
|
||||||
|
|
||||||
## Filer og annet
|
|
||||||
|
|
||||||
Alle øvinger og andre viktige filer ligger på [git](https://git.glados.no/oyvindskaaden/TFE4130).
|
|
||||||
|
|
||||||
## Forelesninger
|
## Forelesninger
|
||||||
|
|
||||||
[2021-01-12](./lectures/2021-01-12/) - Intro
|
[2021-01-12](./lectures/2021-01-12/) - Intro
|
||||||
|
|
|
@ -0,0 +1,68 @@
|
||||||
|
---
|
||||||
|
title: TIØ4252
|
||||||
|
description: Teknologiledelse, våren 2021
|
||||||
|
date: 2021-05-13
|
||||||
|
---
|
||||||
|
|
||||||
|
|
||||||
|
## Formelark
|
||||||
|
|
||||||
|
Formelark i TIØ4252 kan finnes [her][formel].
|
||||||
|
|
||||||
|
Kildekoden ligger på [git][git_formel].
|
||||||
|
|
||||||
|
[formel]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/formelark/formelark.pdf
|
||||||
|
[git_formel]:https://git.glados.no/oyvindskaaden/TIO4252/src/branch/main/formelark/
|
||||||
|
|
||||||
|
## Eksamen
|
||||||
|
|
||||||
|
Alle filer er tilgjengelig på [git][git].
|
||||||
|
|
||||||
|
[git]: https://git.glados.no/oyvindskaaden/TIO4252
|
||||||
|
|
||||||
|
Kombinert løsningsforslag for alle eksamener finnes [her][LF_alle].
|
||||||
|
|
||||||
|
[LF_alle]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/LF.pdf
|
||||||
|
|
||||||
|
| År | Eksamen | Oppgave | LF |
|
||||||
|
| :--- | :------ | :------------ | :------- |
|
||||||
|
| 2020 | Høst | [Oppgave][1] | [LF][2] |
|
||||||
|
| 2020 | Sommer | [Oppgave][3] | [LF][4] |
|
||||||
|
| 2020 | Vår | [Oppgave][5] | [LF][6] |
|
||||||
|
| 2019 | Høst | [Oppgave][7] | [LF][8] |
|
||||||
|
| 2019 | Sommer | [Oppgave][9] | [LF][10] |
|
||||||
|
| 2018 | Høst | [Oppgave][11] | [LF][12] |
|
||||||
|
| 2018 | Sommer | [Oppgave][13] | [LF][14] |
|
||||||
|
| 2018 | Vår | [Oppgave][15] | [LF][16] |
|
||||||
|
| 2017 | Høst | [Oppgave][17] | [LF][18] |
|
||||||
|
| 2017 | Vår | [Oppgave][19] | [LF][20] |
|
||||||
|
| 2014 | Sommer | [Oppgave][21] | [LF][22] |
|
||||||
|
| 2013 | Sommer | [Oppgave][23] | [LF][24] |
|
||||||
|
{: .table-responsive-lg .table }
|
||||||
|
|
||||||
|
[1]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/20H/Eksamen_20H.pdf
|
||||||
|
[2]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/20H/Losning_20H.pdf
|
||||||
|
[3]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/20S/Eksamen_20S.pdf
|
||||||
|
[4]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/20S/Losning_20S.pdf
|
||||||
|
[5]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/20V/Eksamen_20V.pdf
|
||||||
|
[6]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/20V/Losning_20V.pdf
|
||||||
|
[7]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/19H/Eksamen_19H.pdf
|
||||||
|
[8]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/19H/Losning_19H.pdf
|
||||||
|
[9]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/19S/Eksamen_19S.pdf
|
||||||
|
[10]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/19S/Losning_19S.pdf
|
||||||
|
[11]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/18H/Eksamen_18H.pdf
|
||||||
|
[12]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/18H/Losning_18H.pdf
|
||||||
|
[13]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/18S/Eksamen_18S.pdf
|
||||||
|
[14]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/18S/Losning_18S.pdf
|
||||||
|
[15]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/18V/Eksamen_18V.pdf
|
||||||
|
[16]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/18V/Losning_18V.pdf
|
||||||
|
[17]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/17H/Eksamen_17H.pdf
|
||||||
|
[18]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/17H/Losning_17H.pdf
|
||||||
|
[19]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/17V/Eksamen_17V.pdf
|
||||||
|
[20]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/17V/Losning_17V.pdf
|
||||||
|
[21]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/14S/Eksamen_14S.pdf
|
||||||
|
[22]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/14S/Losning_14S.pdf
|
||||||
|
[23]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/13S/Eksamen_13S.pdf
|
||||||
|
[24]:https://git.glados.no/oyvindskaaden/TIO4252/raw/branch/main/eksamen/13S/Losning_13S.pdf
|
||||||
|
|
||||||
|
|
|
@ -26,7 +26,7 @@ Hard to capture faults.
|
||||||
|
|
||||||
### Traditional error handeling
|
### Traditional error handeling
|
||||||
|
|
||||||
{% highlight c %}
|
{% highlight java %}
|
||||||
FILE *
|
FILE *
|
||||||
openConfigFile(){
|
openConfigFile(){
|
||||||
FILE * f = fopen("/path/to/config.conf");
|
FILE * f = fopen("/path/to/config.conf");
|
||||||
|
@ -63,9 +63,9 @@ This is some of the error handling real time programming have.
|
||||||
* Handling of unexpected errors
|
* Handling of unexpected errors
|
||||||
* More threads hanles errors
|
* More threads hanles errors
|
||||||
* Can not test the conventional way
|
* Can not test the conventional way
|
||||||
* Can only show extistence of errors
|
* Can only show extistence of errors
|
||||||
* Can not find errors in specification
|
* Can not find errors in specification
|
||||||
* Can not find race conditions
|
* Can not find race conditions
|
||||||
|
|
||||||
The fault path is shown under.
|
The fault path is shown under.
|
||||||
|
|
||||||
|
@ -103,8 +103,8 @@ To test how the systems responds for a unknown error is to insert a failed accep
|
||||||
**Dynammic redunancy**
|
**Dynammic redunancy**
|
||||||
|
|
||||||
* Relies on detecting the error and recovering
|
* Relies on detecting the error and recovering
|
||||||
* Resend if timeout and not receiving "ack"
|
* Resend if timeout and not receiving "ack"
|
||||||
* Go with default if no messages have been received
|
* Go with default if no messages have been received
|
||||||
* The acceptancetest must be good.
|
* The acceptancetest must be good.
|
||||||
|
|
||||||
|
|
||||||
|
@ -128,29 +128,29 @@ Find the failure modes: What could go wrong?
|
||||||
**Step 3: Handling with redundancy**
|
**Step 3: Handling with redundancy**
|
||||||
|
|
||||||
* Have multiple copies of the the information
|
* Have multiple copies of the the information
|
||||||
* Use only the newest
|
* Use only the newest
|
||||||
|
|
||||||
#### Example with communication function
|
#### Example with communication function
|
||||||
|
|
||||||
**Step 1: Failure modes**
|
**Step 1: Failure modes**
|
||||||
|
|
||||||
* Message
|
* Message
|
||||||
* Lost
|
* Lost
|
||||||
* Delayed
|
* Delayed
|
||||||
* Corrupted
|
* Corrupted
|
||||||
* Duplicated
|
* Duplicated
|
||||||
* Wrong recipient
|
* Wrong recipient
|
||||||
|
|
||||||
**Step 2: Detection, Merging of errormodes and error injection**
|
**Step 2: Detection, Merging of errormodes and error injection**
|
||||||
|
|
||||||
* Adding information to message
|
* Adding information to message
|
||||||
* Checksum
|
* Checksum
|
||||||
* Session ID
|
* Session ID
|
||||||
* Sequence number
|
* Sequence number
|
||||||
* Adding "ack" on well recieved messages
|
* Adding "ack" on well recieved messages
|
||||||
* All errors will be treaded as "Lost message"
|
* All errors will be treaded as "Lost message"
|
||||||
* Injection
|
* Injection
|
||||||
* Occasionally throw away some messages
|
* Occasionally throw away some messages
|
||||||
|
|
||||||
**Step 3: Handling with redundancy**
|
**Step 3: Handling with redundancy**
|
||||||
|
|
||||||
|
@ -179,7 +179,7 @@ There are three solutions:
|
||||||
* Store a checkpoint
|
* Store a checkpoint
|
||||||
* Do the "side effects"
|
* Do the "side effects"
|
||||||
2. Process pairs
|
2. Process pairs
|
||||||
* Crash and let an another process take over
|
* Crash and let an another process take over
|
||||||
3. Presistent processes
|
3. Presistent processes
|
||||||
|
|
||||||
|
|
||||||
|
@ -198,3 +198,343 @@ A transaction is a design framework for Damage Confinement and Error Recovery.
|
||||||
* **C**oncistency: Leaves the system in a consistent state when finished
|
* **C**oncistency: Leaves the system in a consistent state when finished
|
||||||
* **I**solation: Errors does not spread
|
* **I**solation: Errors does not spread
|
||||||
* **D**urability: Results are not lost
|
* **D**urability: Results are not lost
|
||||||
|
|
||||||
|
### Atomic Actions
|
||||||
|
|
||||||
|
**Resumption vs. Termination mode**
|
||||||
|
* If we continue where we were (e.g. after the interrupt) --> *Resumption*
|
||||||
|
* If we continue somewhere else (i.e. terminating what we where doing) --> Termination
|
||||||
|
|
||||||
|
**Async Notification (AN) = Low level thread interaction**
|
||||||
|
* Async event handling. ("Signals") (resumption)
|
||||||
|
* Modeled after a HW interrupt
|
||||||
|
* Can be sent to the correct thread
|
||||||
|
* Can be handled, ignored, blocked --> The domain can be controlled.
|
||||||
|
* Often lead to polling
|
||||||
|
* Could rather skip the signal and poll a status variable or a message queue
|
||||||
|
* Useless
|
||||||
|
* ATC --> Async transfer of Control (termination)
|
||||||
|
* Canceling threads
|
||||||
|
* setjmpt/longjmp could convert signals to ATC (not really, but still)
|
||||||
|
* ADA: a strictured mechanism for ATV is integraded with the selected statement
|
||||||
|
* RT Java: A structured mechanism for ATC is integraded with the exception-handling mechanism
|
||||||
|
|
||||||
|
#### Cancelling threads
|
||||||
|
|
||||||
|
**Yes, killing threads is ATC!**
|
||||||
|
|
||||||
|
* Can make termination model by letting domain be a thread
|
||||||
|
* "Create a `doWork` thread, and kill it if the action fails"
|
||||||
|
* Ca still control domain by disabling "cancelstate"
|
||||||
|
|
||||||
|
**But, but, but: It leaves ut in undifined state!?**
|
||||||
|
* Not if we have...
|
||||||
|
* Full control over changed state (like logs or recovery points) or some other way of recovering well.
|
||||||
|
* A lock manager that can unlock on behalf of killed thread
|
||||||
|
* Some control of where we were killed (like nok in the middle of a lock manager or log call)
|
||||||
|
* An this is what we have!
|
||||||
|
|
||||||
|
|
||||||
|
## Shared variable synchronization
|
||||||
|
|
||||||
|
### Non-Preemptive scheduling
|
||||||
|
|
||||||
|
Controlling a pump filling a tank.
|
||||||
|
|
||||||
|
**Spec:**
|
||||||
|
* Every second: measure the water level of the tank and generate the reference to the pump
|
||||||
|
* 10 times a second: Set the power of the pump motor
|
||||||
|
* Do some GUI: let the human control the process
|
||||||
|
|
||||||
|
#### A trivial solution: "Cyclic Exectutive"
|
||||||
|
|
||||||
|
{% highlight java %}
|
||||||
|
oldTime = now();
|
||||||
|
i = 0;
|
||||||
|
while(true) {
|
||||||
|
i = i + 1;
|
||||||
|
if (i % 10 == 0) {
|
||||||
|
i = 0;
|
||||||
|
calculatePumpReference();
|
||||||
|
}
|
||||||
|
controlPump();
|
||||||
|
do {
|
||||||
|
handleUserEvent();
|
||||||
|
} while(now() < oldTime + 0.1);
|
||||||
|
oldTime = oldTime + 0.1;
|
||||||
|
}
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
**Drawbacks**
|
||||||
|
|
||||||
|
* OK tasks?
|
||||||
|
* Timing hard to tune (what if pump sampling should be $\pi$/10?)
|
||||||
|
* Overload (what if `calucaltePumpReference` uses more than 1/10 seconds?)
|
||||||
|
* How to add new tasks? (Everything is coupled)
|
||||||
|
* Waste of time in the do-loop?
|
||||||
|
* What is priority of `handleUserEvents`?
|
||||||
|
* How are erros, exceptions, alarms etc. handled?
|
||||||
|
|
||||||
|
#### Better soulution with Non-preemptive scheduler
|
||||||
|
|
||||||
|
* *3 taskts* administered by a scheduler
|
||||||
|
* The scheduler takes care of who runs and timing
|
||||||
|
* Scheduler often inculuded in OSes
|
||||||
|
* Introducing priorities
|
||||||
|
|
||||||
|
{% highlight java %}
|
||||||
|
/**
|
||||||
|
* scheduler_registerThread(function, time, priority)
|
||||||
|
* Higher priority numer means higher priority in scheduler
|
||||||
|
*/
|
||||||
|
main() {
|
||||||
|
scheduler_registrerThread(controlPump, 0.1, 3);
|
||||||
|
scheduler_registrerThread(calculatePumpReference, 1, 2);
|
||||||
|
scheduler_registrerThread(handleUserEvents, 0.2, 1);
|
||||||
|
scheduler_mainLoop();
|
||||||
|
}
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
**Some notes on priorities**
|
||||||
|
* Priority is generally not important; rather, the main rule is to give higher priority to shorter-deadline tasks.
|
||||||
|
* This allows tasks to reach its deadlines.
|
||||||
|
* ... but this is not always the case - if e.g. the tasks are cooperating
|
||||||
|
* We still handle overload badly
|
||||||
|
* And: What connection between deadline and priority to start with?
|
||||||
|
* Is this a good dependency seen from a code quality perspective?
|
||||||
|
|
||||||
|
### Pros and cons of nonpreemptive scheduling
|
||||||
|
|
||||||
|
| **Pros** | **Cons** |
|
||||||
|
| :--------------------------------------------- | :------------------------------------------------------------------------- |
|
||||||
|
| Simple, intuitive, predictable | C macro hell |
|
||||||
|
| No kernel | Threads must cooperate <-- a form of dependency breaking module boundaries |
|
||||||
|
| Fast switching times | Heavy threads must be divided |
|
||||||
|
| Some elegant sunchronization patterns possible | Can we handle blocking of library functions? |
|
||||||
|
| | Unrobust to errors |
|
||||||
|
| | Unrobust to (heavy) error handling |
|
||||||
|
| | Hard to tune at end of project |
|
||||||
|
{: .table-responsive-lg .table }
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
### Preemptive Kernel
|
||||||
|
|
||||||
|
* Preemption, thread objects and the timer interrupt
|
||||||
|
* Enabling synchronization: Busy waiting, tes-and-set, disabling the timer interrupt
|
||||||
|
* Blocking and suspend & resume
|
||||||
|
* An API for synchronization? Semaphores!
|
||||||
|
|
||||||
|
|
||||||
|
#### Preemption
|
||||||
|
|
||||||
|
* Make a handler for a timer interrupt
|
||||||
|
* Store all registers (including IP & SP) in a "thread object"
|
||||||
|
* Organize queue of processes (Round Robin e.g. - a collection of thread objects?)
|
||||||
|
* Can synchronize by: `while(!ready);` (busy wating, "spin locks")
|
||||||
|
|
||||||
|
**Bad solution**
|
||||||
|
|
||||||
|
{% highlight java%}
|
||||||
|
while(lock==1) {}
|
||||||
|
lock = 1;
|
||||||
|
// We may run
|
||||||
|
lock = 0;
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
**Better solution**
|
||||||
|
|
||||||
|
{% highlight java%}
|
||||||
|
void t1() {
|
||||||
|
flag1 = 1; // Declare my intention
|
||||||
|
turn = 2; // But try to be polite
|
||||||
|
while(flag2 == 1 && turn == 2) {}
|
||||||
|
// We may run
|
||||||
|
flag1 = 0;
|
||||||
|
}
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
##### Looking more closely at the arsenal
|
||||||
|
|
||||||
|
**How can we make basic synchronization under preemption?**
|
||||||
|
|
||||||
|
* Spin locks (wasting time and cpu)
|
||||||
|
* Test&Set (swap) assembly instruction (atomic, but not obvious)
|
||||||
|
* Disable interrupt (steals control from OS/scheduler)
|
||||||
|
|
||||||
|
**But**
|
||||||
|
* If we disable the timer interrupt we don not have preemption any more
|
||||||
|
* And... Are these good abstractions in the application programmer domain?
|
||||||
|
|
||||||
|
#### Blocked threads
|
||||||
|
|
||||||
|
**Let us introduce another queue; the collection of threads not running, waiting for something**
|
||||||
|
|
||||||
|
* Fixes the bad performance of spin locks. Is conceptually better.
|
||||||
|
* `suspend` moves a thread object from "run" queue to "blocked" queue
|
||||||
|
* `resume` moves it back.
|
||||||
|
|
||||||
|
##### Two bad solutions
|
||||||
|
|
||||||
|
{% highlight java%}
|
||||||
|
t1(){
|
||||||
|
while(busy == 1) suspend();
|
||||||
|
busy = 1; // It is free; tak it - No
|
||||||
|
// Run
|
||||||
|
busy = 0; // Release resource
|
||||||
|
|
||||||
|
resume t2 // No
|
||||||
|
}
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
or
|
||||||
|
|
||||||
|
{% highlight java%}
|
||||||
|
t1(){
|
||||||
|
while(TestNSet(busy, 1) == 1) suspend();
|
||||||
|
// We own resource
|
||||||
|
// Run
|
||||||
|
busy = 0;
|
||||||
|
|
||||||
|
resume t2 // No
|
||||||
|
}
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
##### The suspend/resume problem
|
||||||
|
|
||||||
|
{% highlight java%}
|
||||||
|
// Global variables
|
||||||
|
bool g_initDone = False;
|
||||||
|
|
||||||
|
// Threads
|
||||||
|
t1(){ t2(){
|
||||||
|
/* Do init */ if (g_initDone == False) {
|
||||||
|
g_initDone = True; Suspend();
|
||||||
|
resume(t2) }
|
||||||
|
// Continue executing // Continue exectuting
|
||||||
|
} }
|
||||||
|
{% endhighlight %}
|
||||||
|
|
||||||
|
#### Priorities
|
||||||
|
|
||||||
|
* Threads mey have different *priorities*. (A sortet run-queue, or more of them.)
|
||||||
|
* Only if there are no running threads on a higher priority, a thread will run.
|
||||||
|
* We are not aiming for some sens of fairness (!). But predictability.
|
||||||
|
* And priorities supports schedulability proofs.
|
||||||
|
* But we open ourselves up to *starvation*. A thread may not ever get to run, even if it is runnable.
|
||||||
|
|
||||||
|
|
||||||
|
#### Application-level syncronization
|
||||||
|
|
||||||
|
**SO, the application programmer needs some syncronozation primitives...**
|
||||||
|
|
||||||
|
* `sleep()`? - Ok
|
||||||
|
* Publish `suspend` and `resume` - No
|
||||||
|
* Events (`wait` and `signal`) - Just named versions of suspend & resume semantics.
|
||||||
|
* Fixes the need to know aboud "thread objects". But no
|
||||||
|
* ...or "Condition variables" - same
|
||||||
|
|
||||||
|
|
||||||
|
### Semaphores
|
||||||
|
|
||||||
|
**A counting semaphore**
|
||||||
|
|
||||||
|
* `signal(SEM)` increases the counter (possibly resuming a thread waiting for the semaphore)
|
||||||
|
* `wait(SEM)` decrements the counter - will block (be suspended) `if SEM == 0`
|
||||||
|
* The semaphores value can not be negative
|
||||||
|
* Of course; These calls are protected from interleaving by disabling the timer interrupt
|
||||||
|
|
||||||
|
**We solve beautifully:**
|
||||||
|
* Mutual Exclusion
|
||||||
|
* Conditional Synchronization (ref `suspend`/`resume`)
|
||||||
|
* Basic resource allocation
|
||||||
|
|
||||||
|
**Semaphore variations**
|
||||||
|
|
||||||
|
* `wait` and `signal` nay take parameter value to add or subtract
|
||||||
|
* `getValue(SEM)` returning the value of the semaphore. (Fishy)
|
||||||
|
* BInary semaphores (`signal` will fail `if SEM == 1`)
|
||||||
|
* Who is woken at `signal` (FIFO, Arbitrary, Highest priority)
|
||||||
|
* The mutex
|
||||||
|
* binary
|
||||||
|
* ownership
|
||||||
|
* allows mulitple waits by owner
|
||||||
|
* regions (may be released by Javas `wait` or POSIX condition variables)
|
||||||
|
* RTFM
|
||||||
|
|
||||||
|
**Semaphore challenges**
|
||||||
|
|
||||||
|
* Breaks modules (both ways)
|
||||||
|
* Does not scale!
|
||||||
|
* Deadlocks
|
||||||
|
* Global analysis --> Does not scale
|
||||||
|
* Can not release "temporarily
|
||||||
|
* "Limited expressive power". Some reasonalbe problems are hard to solve
|
||||||
|
* Ref ["The Little Book of Semaphores"](https://greenteapress.com/semaphores/LittleBookOfSemaphores.pdf)
|
||||||
|
|
||||||
|
### Why shared-variable synchronization
|
||||||
|
|
||||||
|
**Why not?**
|
||||||
|
|
||||||
|
* "Shared variables" is bad code quality
|
||||||
|
* Ref global variables, and data members in module interfaces
|
||||||
|
* An obvious bottleneck? Scales terribly
|
||||||
|
* "Variables" are passive objects
|
||||||
|
* They can not protect themselves
|
||||||
|
* Why use synchronization when it is communication we need?
|
||||||
|
* Technology transfers badly to distibuted systems
|
||||||
|
* ... and this is before we start discussing how hard it is
|
||||||
|
|
||||||
|
**Why?**
|
||||||
|
|
||||||
|
* Part of the "real-time" design pattern
|
||||||
|
* "One thread per timing demand"
|
||||||
|
* We do have scheduling proofs and best practises
|
||||||
|
* Timing analysis is global anyway
|
||||||
|
* Scalability and deadlock analysis may not be the limiting constraint
|
||||||
|
* HW is shared memory architecture
|
||||||
|
* Infrastucture is avalible
|
||||||
|
* Communication systems requires infrastucture that we may not have
|
||||||
|
|
||||||
|
#### *All* resources are shared!
|
||||||
|
|
||||||
|
* Memory, certainly
|
||||||
|
* "Hidden" memory used by libraries (.. your own modules and the kernel)
|
||||||
|
* If the library takes care of this itself, it is called *"reentrant"*
|
||||||
|
* Sensors and actuators
|
||||||
|
* "CPU" - Computing capacity
|
||||||
|
* *This* is real-time programming; We solve it by *Scheduling*
|
||||||
|
* ... any other interface
|
||||||
|
|
||||||
|
|
||||||
|
#### Some standard problems/pit-falls
|
||||||
|
|
||||||
|
* **Race condition**: A bug that surfaces by unfortunate timing or order of events
|
||||||
|
* **Deadlock:** system in circular wait
|
||||||
|
* Special case of livelock
|
||||||
|
* Does not use CPU
|
||||||
|
* **Livelock:** system locked in a subset of states
|
||||||
|
* like deadlock, but we use CPU
|
||||||
|
* Busy-Waiting is a livelock
|
||||||
|
* **Starvation:** A thread does "by accident" not get the necessary resources
|
||||||
|
|
||||||
|
|
||||||
|
#### Features in syncronization
|
||||||
|
|
||||||
|
* Critical Section - Code that must not be interupted
|
||||||
|
* Mutual Exclusion - More piecesof code that must not interrupt each other
|
||||||
|
* Bounded buffer - Buffer with full/empty synchronization
|
||||||
|
* Read/Write Locks
|
||||||
|
* Readers can interleave eachother
|
||||||
|
* Writers have mutual exclusion
|
||||||
|
* Condition Syncronization - Blocking on event or status
|
||||||
|
* Guards etc.
|
||||||
|
* Resource allocation
|
||||||
|
* More than mutual exclution!
|
||||||
|
* Ref: The lock manager
|
||||||
|
* Rendezvouz/barriere - Synchronization point
|
||||||
|
* Ref: AA "end boundary"
|
||||||
|
* Communication
|
||||||
|
* Broadcast
|
||||||
|
* ...
|
||||||
|
|
||||||
|
|
|
@ -8,8 +8,4 @@ description: "Sanntidsprogrammering"
|
||||||
|
|
||||||
[Oppsummering](summary/) av faget TTK4145.
|
[Oppsummering](summary/) av faget TTK4145.
|
||||||
|
|
||||||
## Prosjekt
|
|
||||||
|
|
||||||
## Øvinger
|
|
||||||
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue