re-work original osmo-bts with support for sysmocom femtobts
This code re-works osmo-bts to add support for the upcoming sysmocom BTS. It also tries to add some level of abstraction between the generic part of a BTS (A-bis, RSL, OML, data structures, paging scheduling, BCCH/AGCH scheduling, etc.) and the actual hardware-specific bits. The hardware-specific bits are currently only implemented for the sysmocom femtobts, but should be (re-)added for osmocom-bb, as well as a virtual BTS for simulation purpose later. The sysmocom bts specific parts require hardware-specific header files which are (at least currently) not publicly distributed.dbg_fwd
parent
8e47fb89bf
commit
c6b4c87e5d
|
@ -0,0 +1,20 @@
|
|||
*.o
|
||||
*.a
|
||||
Makefile.in
|
||||
Makefile
|
||||
.deps
|
||||
|
||||
aclocal.m4
|
||||
autom4te.cache
|
||||
config.log
|
||||
config.status
|
||||
configure
|
||||
depcomp
|
||||
install-sh
|
||||
missing
|
||||
core
|
||||
core.*
|
||||
|
||||
src/osmo-bts-sysmo/l1fwd-proxy
|
||||
src/osmo-bts-sysmo/sysmobts
|
||||
src/osmo-bts-sysmo/sysmobts-remote
|
|
@ -0,0 +1,661 @@
|
|||
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||
Version 3, 19 November 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU Affero General Public License is a free, copyleft license for
|
||||
software and other kinds of works, specifically designed to ensure
|
||||
cooperation with the community in the case of network server software.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
our General Public Licenses are 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.
|
||||
|
||||
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.
|
||||
|
||||
Developers that use our General Public Licenses protect your rights
|
||||
with two steps: (1) assert copyright on the software, and (2) offer
|
||||
you this License which gives you legal permission to copy, distribute
|
||||
and/or modify the software.
|
||||
|
||||
A secondary benefit of defending all users' freedom is that
|
||||
improvements made in alternate versions of the program, if they
|
||||
receive widespread use, become available for other developers to
|
||||
incorporate. Many developers of free software are heartened and
|
||||
encouraged by the resulting cooperation. However, in the case of
|
||||
software used on network servers, this result may fail to come about.
|
||||
The GNU General Public License permits making a modified version and
|
||||
letting the public access it on a server without ever releasing its
|
||||
source code to the public.
|
||||
|
||||
The GNU Affero General Public License is designed specifically to
|
||||
ensure that, in such cases, the modified source code becomes available
|
||||
to the community. It requires the operator of a network server to
|
||||
provide the source code of the modified version running there to the
|
||||
users of that server. Therefore, public use of a modified version, on
|
||||
a publicly accessible server, gives the public access to the source
|
||||
code of the modified version.
|
||||
|
||||
An older license, called the Affero General Public License and
|
||||
published by Affero, was designed to accomplish similar goals. This is
|
||||
a different license, not a version of the Affero GPL, but Affero has
|
||||
released a new version of the Affero GPL which permits relicensing under
|
||||
this license.
|
||||
|
||||
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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, if you modify the
|
||||
Program, your modified version must prominently offer all users
|
||||
interacting with it remotely through a computer network (if your version
|
||||
supports such interaction) an opportunity to receive the Corresponding
|
||||
Source of your version by providing access to the Corresponding Source
|
||||
from a network server at no charge, through some standard or customary
|
||||
means of facilitating copying of software. This Corresponding Source
|
||||
shall include the Corresponding Source for any work covered by version 3
|
||||
of the GNU General Public License that is incorporated pursuant to the
|
||||
following paragraph.
|
||||
|
||||
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 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 work with which it is combined will remain governed by version
|
||||
3 of the GNU General Public License.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If your software can interact with users remotely through a computer
|
||||
network, you should also make sure that it provides a way for users to
|
||||
get its source. For example, if your program is a web application, its
|
||||
interface could display a "Source" link that leads users to an archive
|
||||
of the code. There are many ways you could offer source, and different
|
||||
solutions will be better for different programs; see section 13 for the
|
||||
specific requirements.
|
||||
|
||||
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 AGPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
|
@ -15,6 +15,7 @@ AC_PROG_RANLIB
|
|||
dnl checks for libraries
|
||||
PKG_CHECK_MODULES(LIBOSMOCORE, libosmocore)
|
||||
PKG_CHECK_MODULES(LIBOSMOVTY, libosmovty)
|
||||
PKG_CHECK_MODULES(LIBOSMOGSM, libosmogsm)
|
||||
|
||||
dnl checks for header files
|
||||
AC_HEADER_STDC
|
||||
|
@ -24,6 +25,7 @@ dnl Checks for typedefs, structures and compiler characteristics
|
|||
AC_OUTPUT(
|
||||
src/Makefile
|
||||
src/common/Makefile
|
||||
src/osmo-bts-sysmo/Makefile
|
||||
src/osmo-bts-bb/Makefile
|
||||
include/Makefile
|
||||
include/osmo-bts/Makefile
|
||||
|
|
|
@ -0,0 +1 @@
|
|||
../osmo-bts/gsm_data.h
|
|
@ -1 +1 @@
|
|||
noinst_HEADERS = bts.h abis.h rsl.h oml.h support.h rtp.h logging.h
|
||||
noinst_HEADERS = abis.h bts.h bts_model.h gsm_data.h logging.h oml.h paging.h rsl.h rtp.h signal.h vty.h
|
||||
|
|
|
@ -5,13 +5,15 @@
|
|||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/gsm/protocol/ipaccess.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#define OML_RETRY_TIMER 5
|
||||
#define OML_PING_TIMER 20
|
||||
|
||||
struct ipabis_link {
|
||||
int state;
|
||||
struct osmocom_bts *bts; /* set, if OML link */
|
||||
struct osmobts_trx *trx; /* set, if RSL link */
|
||||
struct gsm_bts *bts; /* set, if OML link */
|
||||
struct gsm_bts_trx *trx; /* set, if RSL link */
|
||||
struct osmo_fd bfd;
|
||||
struct osmo_timer_list timer;
|
||||
struct msgb *rx_msg;
|
||||
|
@ -33,4 +35,8 @@ void abis_push_ipa(struct msgb *msg, uint8_t proto);
|
|||
int abis_open(struct ipabis_link *link, uint32_t ip);
|
||||
void abis_close(struct ipabis_link *link);
|
||||
|
||||
|
||||
int abis_oml_sendmsg(struct msgb *msg);
|
||||
int abis_rsl_sendmsg(struct msgb *msg);
|
||||
|
||||
#endif /* _ABIS_H */
|
||||
|
|
|
@ -1,132 +1,29 @@
|
|||
#ifndef _BTS_H
|
||||
#define _BTS_H
|
||||
|
||||
#define BTS_SI_NUM 23 /* MUAR match the entries in BTS_SI_LIST */
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#define BTS_SI_LIST { \
|
||||
RSL_SYSTEM_INFO_8, \
|
||||
RSL_SYSTEM_INFO_1, \
|
||||
RSL_SYSTEM_INFO_2, \
|
||||
RSL_SYSTEM_INFO_3, \
|
||||
RSL_SYSTEM_INFO_4, \
|
||||
RSL_SYSTEM_INFO_5, \
|
||||
RSL_SYSTEM_INFO_6, \
|
||||
RSL_SYSTEM_INFO_7, \
|
||||
RSL_SYSTEM_INFO_16, \
|
||||
RSL_SYSTEM_INFO_17, \
|
||||
RSL_SYSTEM_INFO_2bis, \
|
||||
RSL_SYSTEM_INFO_2ter, \
|
||||
RSL_SYSTEM_INFO_5bis, \
|
||||
RSL_SYSTEM_INFO_5ter, \
|
||||
RSL_SYSTEM_INFO_10, \
|
||||
REL_EXT_MEAS_ORDER, \
|
||||
RSL_MEAS_INFO, \
|
||||
RSL_SYSTEM_INFO_13, \
|
||||
RSL_SYSTEM_INFO_2quater, \
|
||||
RSL_SYSTEM_INFO_9, \
|
||||
RSL_SYSTEM_INFO_18, \
|
||||
RSL_SYSTEM_INFO_19, \
|
||||
RSL_SYSTEM_INFO_20, \
|
||||
}
|
||||
extern void *tall_bts_ctx;
|
||||
|
||||
#define BTS_SI_NAME char *bts_si_name[] = { \
|
||||
"RSL_SYSTEM_INFO_8", \
|
||||
"RSL_SYSTEM_INFO_1", \
|
||||
"RSL_SYSTEM_INFO_2", \
|
||||
"RSL_SYSTEM_INFO_3", \
|
||||
"RSL_SYSTEM_INFO_4", \
|
||||
"RSL_SYSTEM_INFO_5", \
|
||||
"RSL_SYSTEM_INFO_6", \
|
||||
"RSL_SYSTEM_INFO_7", \
|
||||
"RSL_SYSTEM_INFO_16", \
|
||||
"RSL_SYSTEM_INFO_17", \
|
||||
"RSL_SYSTEM_INFO_2bis", \
|
||||
"RSL_SYSTEM_INFO_2ter", \
|
||||
"RSL_SYSTEM_INFO_5bis", \
|
||||
"RSL_SYSTEM_INFO_5ter", \
|
||||
"RSL_SYSTEM_INFO_10", \
|
||||
"REL_EXT_MEAS_ORDER", \
|
||||
"RSL_MEAS_INFO", \
|
||||
"RSL_SYSTEM_INFO_13", \
|
||||
"RSL_SYSTEM_INFO_2quater", \
|
||||
"RSL_SYSTEM_INFO_9", \
|
||||
"RSL_SYSTEM_INFO_18", \
|
||||
"RSL_SYSTEM_INFO_19", \
|
||||
"RSL_SYSTEM_INFO_20", \
|
||||
}
|
||||
int bts_init(struct gsm_bts *bts);
|
||||
|
||||
#define BTS_SI_USE 1
|
||||
#define BTS_SI_NEW 2
|
||||
|
||||
/* store sysinfos of a BTS */
|
||||
struct osmobts_sysinfo {
|
||||
uint8_t flags[BTS_SI_NUM];
|
||||
uint8_t si[BTS_SI_NUM][23];
|
||||
struct osmo_timer_list timer;
|
||||
};
|
||||
|
||||
struct osmobts_slot;
|
||||
|
||||
/* one physical radio */
|
||||
struct osmobts_ms {
|
||||
struct llist_head entry;
|
||||
struct osmobts_trx *trx;
|
||||
};
|
||||
|
||||
/* one logical channel instance */
|
||||
struct osmobts_lchan {
|
||||
struct osmobts_slot *slot;
|
||||
uint8_t lchan_nr;
|
||||
uint8_t chan_nr; /* CBITS+TN */
|
||||
struct lapdm_channel lapdm_channel;
|
||||
struct osmobts_rtp rtp;
|
||||
};
|
||||
|
||||
/* one timeslot instance */
|
||||
struct osmobts_slot {
|
||||
struct osmobts_trx *trx;
|
||||
uint8_t slot_nr;
|
||||
uint8_t acch_type; /* TS 08.58 9.3.1 (bits 8..4) */
|
||||
uint8_t has_bcch;
|
||||
uint8_t chan_comb;
|
||||
struct osmobts_lchan *lchan[8];
|
||||
struct osmobts_ms *tx_ms, *rx_ms;
|
||||
};
|
||||
|
||||
/* one TRX instance */
|
||||
struct osmobts_trx {
|
||||
struct osmocom_bts *bts;
|
||||
uint8_t trx_nr;
|
||||
struct osmobts_slot slot[8];
|
||||
struct llist_head ms_list;
|
||||
struct ipabis_link link;
|
||||
struct osmobts_sysinfo si;
|
||||
uint8_t rf_red;
|
||||
uint16_t arfcn_list[128];
|
||||
int arfcn_num;
|
||||
};
|
||||
|
||||
/* the BTS instance */
|
||||
struct osmocom_bts {
|
||||
char *id;
|
||||
uint8_t num_trx;
|
||||
struct osmobts_trx *trx[8];
|
||||
struct ipabis_link link;
|
||||
uint8_t max_ta;
|
||||
uint16_t bcch_arfcn;
|
||||
uint8_t bcc, ncc;
|
||||
uint16_t start_time;
|
||||
};
|
||||
|
||||
struct osmocom_bts *create_bts(uint8_t num_trx, char *id);
|
||||
int create_ms(struct osmobts_trx *trx, int maskc, uint8_t *maskv_tx,
|
||||
struct gsm_bts *create_bts(uint8_t num_trx, char *id);
|
||||
int create_ms(struct gsm_bts_trx *trx, int maskc, uint8_t *maskv_tx,
|
||||
uint8_t *maskv_rx);
|
||||
void destroy_bts(struct osmocom_bts *bts);
|
||||
int work_bts(struct osmocom_bts *bts);
|
||||
int bts_link_estab(struct osmocom_bts *bts);
|
||||
int trx_link_estab(struct osmobts_trx *trx);
|
||||
void destroy_bts(struct gsm_bts *bts);
|
||||
int work_bts(struct gsm_bts *bts);
|
||||
int bts_link_estab(struct gsm_bts *bts);
|
||||
int trx_link_estab(struct gsm_bts_trx *trx);
|
||||
void bts_new_si(void *arg);
|
||||
void bts_setup_slot(struct osmobts_slot *slot, uint8_t comb);
|
||||
void bts_setup_slot(struct gsm_bts_trx_ts *slot, uint8_t comb);
|
||||
|
||||
int lchan_init_lapdm(struct gsm_lchan *lchan);
|
||||
|
||||
int bts_agch_enqueue(struct gsm_bts *bts, struct msgb *msg);
|
||||
struct msgb *bts_agch_dequeue(struct gsm_bts *bts);
|
||||
|
||||
uint8_t *bts_sysinfo_get(struct gsm_bts *bts, struct gsm_time *g_time);
|
||||
uint8_t *lchan_sacch_get(struct gsm_lchan *lchan, struct gsm_time *g_time);
|
||||
|
||||
#endif /* _BTS_H */
|
||||
|
||||
|
|
|
@ -0,0 +1,33 @@
|
|||
#ifndef BTS_MODEL_H
|
||||
#define BTS_MODEL_H
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
#include <osmocom/gsm/tlv.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
/* BTS model specific functions needed by the common code */
|
||||
|
||||
int bts_model_init(struct gsm_bts *bts);
|
||||
|
||||
struct gsm_time *bts_model_get_time(struct gsm_bts *bts);
|
||||
|
||||
int bts_model_check_oml(struct gsm_bts *bts, uint8_t msg_type,
|
||||
struct tlv_parsed *old_attr, struct tlv_parsed *new_attr,
|
||||
void *obj);
|
||||
|
||||
int bts_model_apply_oml(struct gsm_bts *bts, struct msgb *msg,
|
||||
struct tlv_parsed *new_attr, void *obj);
|
||||
|
||||
int bts_model_opstart(struct gsm_bts *bts, struct gsm_abis_mo *mo,
|
||||
void *obj);
|
||||
|
||||
int bts_model_chg_adm_state(struct gsm_bts *bts, struct gsm_abis_mo *mo,
|
||||
void *obj, uint8_t adm_state);
|
||||
|
||||
int bts_model_rsl_chan_act(struct gsm_lchan *lchan, struct tlv_parsed *tp);
|
||||
int bts_model_rsl_chan_rel(struct gsm_lchan *lchan);
|
||||
|
||||
#endif
|
|
@ -0,0 +1,57 @@
|
|||
#ifndef _GSM_DATA_H
|
||||
#define _GSM_DATA_H
|
||||
|
||||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/core/linuxlist.h>
|
||||
#include <osmocom/gsm/lapdm.h>
|
||||
|
||||
#include <osmo-bts/paging.h>
|
||||
|
||||
struct gsm_network {
|
||||
|
||||
};
|
||||
|
||||
/* data structure for BTS related data specific to the BTS role */
|
||||
struct gsm_bts_role_bts {
|
||||
struct {
|
||||
/* Interference Boundaries for OML */
|
||||
int16_t boundary[6];
|
||||
uint8_t intave;
|
||||
} interference;
|
||||
unsigned int t200_ms[7];
|
||||
unsigned int t3105_ms;
|
||||
struct {
|
||||
uint8_t overload_period;
|
||||
struct {
|
||||
/* Input parameters from OML */
|
||||
uint8_t load_ind_thresh; /* percent */
|
||||
uint8_t load_ind_period; /* seconds */
|
||||
/* Internal data */
|
||||
struct osmo_timer_list timer;
|
||||
unsigned int pch_total;
|
||||
unsigned int pch_used;
|
||||
} ccch;
|
||||
struct {
|
||||
/* Input parameters from OML */
|
||||
int16_t busy_thresh; /* in dBm */
|
||||
uint16_t averaging_slots;
|
||||
} rach;
|
||||
} load;
|
||||
uint8_t ny1;
|
||||
uint8_t max_ta;
|
||||
struct llist_head agch_queue;
|
||||
struct paging_state *paging_state;
|
||||
};
|
||||
|
||||
#define bts_role_bts(x) ((struct gsm_bts_role_bts *)(x)->role)
|
||||
|
||||
#include "../../openbsc/openbsc/include/openbsc/gsm_data_shared.h"
|
||||
|
||||
struct femtol1_hdl;
|
||||
|
||||
static inline struct femtol1_hdl *trx_femtol1_hdl(struct gsm_bts_trx *trx)
|
||||
{
|
||||
return trx->role_bts.l1h;
|
||||
}
|
||||
|
||||
#endif /* _GSM_DATA_H */
|
|
@ -9,19 +9,17 @@ enum {
|
|||
DOML,
|
||||
DRLL,
|
||||
DRR,
|
||||
DMM,
|
||||
DCC,
|
||||
DSMS,
|
||||
DMEAS,
|
||||
DPAG,
|
||||
DLAPDM,
|
||||
DL1C,
|
||||
DSAP,
|
||||
DL1P,
|
||||
DABIS,
|
||||
DRTP,
|
||||
DSUM,
|
||||
};
|
||||
|
||||
extern const struct log_info log_info;
|
||||
extern const struct log_info bts_log_info;
|
||||
|
||||
int bts_log_init(const char *category_mask);
|
||||
|
||||
#endif /* _LOGGING_H */
|
||||
|
|
|
@ -1,9 +1,21 @@
|
|||
#ifndef _OML_H
|
||||
#define _OML_H
|
||||
|
||||
int down_oml(struct osmocom_bts *bts, struct msgb *msg);
|
||||
int oml_tx_sw_act_rep(struct ipabis_link *link, uint8_t obj_class, uint8_t bts_nr, uint8_t trx_nr, uint8_t ts_nr);
|
||||
int oml_tx_state_changed(struct ipabis_link *link, uint8_t op_state, uint8_t avail_status, uint8_t obj_class, uint8_t bts_nr, uint8_t trx_nr, uint8_t ts_nr);
|
||||
int oml_init(void);
|
||||
int down_oml(struct gsm_bts *bts, struct msgb *msg);
|
||||
|
||||
struct msgb *oml_msgb_alloc(void);
|
||||
int oml_send_msg(struct msgb *msg, int is_mauf);
|
||||
int oml_mo_send_msg(struct gsm_abis_mo *mo, struct msgb *msg, uint8_t msg_type);
|
||||
int oml_mo_opstart_ack(struct gsm_abis_mo *mo);
|
||||
int oml_mo_opstart_nack(struct gsm_abis_mo *mo, uint8_t nack_cause);
|
||||
int oml_mo_state_chg(struct gsm_abis_mo *mo, int op_state, int avail_state);
|
||||
|
||||
int oml_mo_tx_sw_act_rep(struct gsm_abis_mo *mo);
|
||||
|
||||
int oml_fom_ack_nack(struct msgb *old_msg, uint8_t cause);
|
||||
|
||||
int oml_mo_fom_ack_nack(struct gsm_abis_mo *mo, uint8_t orig_msg_type,
|
||||
uint8_t cause);
|
||||
|
||||
#endif // _OML_H */
|
||||
|
||||
|
|
|
@ -0,0 +1,24 @@
|
|||
#ifndef OSMO_BTS_PAGING_H
|
||||
#define OSMO_BTS_PAGING_H
|
||||
|
||||
#include <stdint.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
#include <osmocom/gsm/protocol/gsm_04_08.h>
|
||||
|
||||
struct paging_state;
|
||||
|
||||
/* initialize paging code */
|
||||
struct paging_state *paging_init(void *ctx, unsigned int num_paging_max,
|
||||
unsigned int paging_lifetime);
|
||||
|
||||
/* update with new SYSTEM INFORMATION parameters */
|
||||
int paging_si_update(struct paging_state *ps, struct gsm48_control_channel_descr *chan_desc);
|
||||
|
||||
/* Add an identity to the paging queue */
|
||||
int paging_add_identity(struct paging_state *ps, uint8_t paging_group,
|
||||
const uint8_t *identity_lv, uint8_t chan_needed);
|
||||
|
||||
/* generate paging message for given gsm time */
|
||||
int paging_gen_msg(struct paging_state *ps, uint8_t *out_buf, struct gsm_time *gt);
|
||||
|
||||
#endif
|
|
@ -1,12 +1,21 @@
|
|||
#ifndef _RSL_H
|
||||
#define _RSL_H
|
||||
|
||||
int down_rsl(struct osmobts_trx *trx, struct msgb *msg);
|
||||
int rsl_tx_rf_res(struct osmobts_trx *trx);
|
||||
int rsl_tx_chan_rqd(struct osmobts_trx *trx);
|
||||
int rsl_tx_est_ind(struct osmobts_lchan *lchan, uint8_t link_id, uint8_t *data, int len);
|
||||
int rsl_tx_rll(struct msgb *msg, struct osmol2_entity *l2_entity);
|
||||
int rsl_tx_ipac_dlcx_ind(struct osmobts_lchan *lchan, uint8_t cause);
|
||||
int down_rsl(struct gsm_bts_trx *trx, struct msgb *msg);
|
||||
int rsl_tx_rf_res(struct gsm_bts_trx *trx);
|
||||
int rsl_tx_chan_rqd(struct gsm_bts_trx *trx, struct gsm_time *gtime,
|
||||
uint8_t ra, uint8_t acc_delay);
|
||||
int rsl_tx_est_ind(struct gsm_lchan *lchan, uint8_t link_id, uint8_t *data, int len);
|
||||
|
||||
int rsl_tx_chan_act_ack(struct gsm_lchan *lchan, struct gsm_time *gtime);
|
||||
int rsl_tx_rf_rel_ack(struct gsm_lchan *lchan);
|
||||
|
||||
/* call-back for LAPDm code, called when it wants to send msgs UP */
|
||||
int lapdm_rll_tx_cb(struct msgb *msg, struct lapdm_entity *le, void *ctx);
|
||||
|
||||
int rsl_tx_ipac_dlcx_ind(struct gsm_lchan *lchan, uint8_t cause);
|
||||
|
||||
struct gsm_lchan *rsl_lchan_lookup(struct gsm_bts_trx *trx, uint8_t chan_nr);
|
||||
|
||||
#endif // _RSL_H */
|
||||
|
||||
|
|
|
@ -0,0 +1,14 @@
|
|||
#ifndef OSMO_BTS_SIGNAL_H
|
||||
#define OSMO_BTS_SIGNAL_H
|
||||
|
||||
#include <osmocom/core/signal.h>
|
||||
|
||||
enum sig_subsys {
|
||||
SS_GLOBAL,
|
||||
};
|
||||
|
||||
enum signals_global {
|
||||
S_NEW_SYSINFO,
|
||||
};
|
||||
|
||||
#endif
|
|
@ -1,30 +0,0 @@
|
|||
#ifndef _BTS_SUPPORT_H
|
||||
#define _BTS_SUPPORT_H
|
||||
|
||||
struct bts_support {
|
||||
/* crypto supprot */
|
||||
uint8_t a5_1;
|
||||
uint8_t a5_2;
|
||||
uint8_t a5_3;
|
||||
uint8_t a5_4;
|
||||
uint8_t a5_5;
|
||||
uint8_t a5_6;
|
||||
uint8_t a5_7;
|
||||
/* radio support */
|
||||
uint8_t freq_map[128];
|
||||
/* codecs */
|
||||
uint8_t chan_comb[256];
|
||||
uint8_t full_v1;
|
||||
uint8_t full_v2;
|
||||
uint8_t full_v3;
|
||||
uint8_t half_v1;
|
||||
uint8_t half_v3;
|
||||
};
|
||||
|
||||
extern struct bts_support bts_support;
|
||||
void bts_support_init(void);
|
||||
char *bts_support_comb_name(uint8_t chan_comb);
|
||||
|
||||
#endif /* _SUPPORT_H */
|
||||
|
||||
|
|
@ -0,0 +1,22 @@
|
|||
#ifndef OSMOBTS_VTY_H
|
||||
#define OSMOBTS_VTY_H
|
||||
|
||||
#include <osmocom/vty/vty.h>
|
||||
#include <osmocom/vty/command.h>
|
||||
|
||||
enum bts_vty_node {
|
||||
BTS_NODE = _LAST_OSMOVTY_NODE + 1,
|
||||
TRX_NODE,
|
||||
TS_NODE,
|
||||
LCHAN_NODE,
|
||||
};
|
||||
|
||||
extern struct cmd_element ournode_exit_cmd;
|
||||
extern struct cmd_element ournode_end_cmd;
|
||||
|
||||
enum node_type bts_vty_go_parent(struct vty *vty);
|
||||
int bts_vty_is_config_node(struct vty *vty, int node);
|
||||
|
||||
extern struct vty_app_info bts_vty_info;
|
||||
|
||||
#endif
|
|
@ -1 +1 @@
|
|||
SUBDIRS = common osmo-bts-bb
|
||||
SUBDIRS = common osmo-bts-sysmo #osmo-bts-bb
|
||||
|
|
|
@ -3,5 +3,5 @@ AM_CFLAGS = -Wall $(LIBOSMOCORE_CFLAGS)
|
|||
LDADD = $(LIBOSMOCORE_LIBS)
|
||||
|
||||
noinst_LIBRARIES = libbts.a
|
||||
libbts_a_SOURCES = support.c bts.c abis.c rsl.c oml.c rtp.c
|
||||
# ../common/l1l2_interface.c ../common/lapdm.c ../common/logging.c
|
||||
libbts_a_SOURCES = gsm_data_shared.c sysinfo.c logging.c abis.c oml.c bts.c rsl.c vty.c paging.c
|
||||
#support.c rtp.c
|
||||
|
|
|
@ -1,10 +1,14 @@
|
|||
/* Minimalistic Abis/IP interface routines, soon to be replaced by
|
||||
* libosmo-abis (Pablo) */
|
||||
|
||||
/* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* 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 2 of the License, or
|
||||
* it under the terms of the GNU Affero 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,
|
||||
|
@ -12,9 +16,8 @@
|
|||
* 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, write to the Free Software Foundation, Inc.,
|
||||
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
|
@ -27,16 +30,20 @@
|
|||
#include <errno.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <osmocore/select.h>
|
||||
#include <osmocore/timer.h>
|
||||
#include <osmocore/msgb.h>
|
||||
#include <osmocom/bb/common/logging.h>
|
||||
#include <osmocom/bb/common/osmocom_data.h>
|
||||
#include <osmocom/bb/bts/abis.h>
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/core/msgb.h>
|
||||
#include <osmocom/gsm/protocol/ipaccess.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
#include <osmo-bts/abis.h>
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/rsl.h>
|
||||
#include <osmo-bts/oml.h>
|
||||
#if 0
|
||||
#include <osmocom/bb/bts/rtp.h>
|
||||
#include <osmocom/bb/bts/bts.h>
|
||||
#include <osmocom/bb/bts/rsl.h>
|
||||
#include <osmocom/bb/bts/oml.h>
|
||||
#endif
|
||||
|
||||
extern char *software_version;
|
||||
extern uint8_t abis_mac[6];
|
||||
|
@ -61,6 +68,23 @@ int abis_tx(struct ipabis_link *link, struct msgb *msg)
|
|||
return 0;
|
||||
}
|
||||
|
||||
int abis_oml_sendmsg(struct msgb *msg)
|
||||
{
|
||||
struct gsm_bts *bts = msg->trx->bts;
|
||||
|
||||
abis_push_ipa(msg, 0xff);
|
||||
|
||||
return abis_tx((struct ipabis_link *) bts->oml_link, msg);
|
||||
}
|
||||
|
||||
int abis_rsl_sendmsg(struct msgb *msg)
|
||||
{
|
||||
struct gsm_bts_trx *trx = msg->trx;
|
||||
|
||||
abis_push_ipa(msg, 0);
|
||||
|
||||
return abis_tx((struct ipabis_link *) trx->rsl_link, msg);
|
||||
}
|
||||
|
||||
struct msgb *abis_msgb_alloc(int headroom)
|
||||
{
|
||||
|
@ -98,7 +122,7 @@ static int abis_tx_ipa_pingpong(struct ipabis_link *link, uint8_t pingpong)
|
|||
if (!nmsg)
|
||||
return -ENOMEM;
|
||||
*msgb_put(nmsg, 1) = pingpong;
|
||||
abis_push_ipa(nmsg, IPA_PROTO_IPACCESS);
|
||||
abis_push_ipa(nmsg, IPAC_PROTO_IPACCESS);
|
||||
|
||||
return abis_tx(link, nmsg);
|
||||
}
|
||||
|
@ -106,16 +130,20 @@ static int abis_tx_ipa_pingpong(struct ipabis_link *link, uint8_t pingpong)
|
|||
/* send ACK and ID RESP */
|
||||
static int abis_rx_ipa_id_get(struct ipabis_link *link, uint8_t *data, int len)
|
||||
{
|
||||
struct gsm_bts *bts = link->bts;
|
||||
struct msgb *nmsg, *nmsg2;
|
||||
char str[64];
|
||||
uint8_t *tag;
|
||||
|
||||
if (!link->bts)
|
||||
bts = link->trx->bts;
|
||||
|
||||
LOGP(DABIS, LOGL_INFO, "Reply to ID_GET\n");
|
||||
|
||||
nmsg = abis_msgb_alloc(0);
|
||||
if (!nmsg)
|
||||
return -ENOMEM;
|
||||
*msgb_put(nmsg, 1) = IPA_MSGT_ID_RESP;
|
||||
*msgb_put(nmsg, 1) = IPAC_MSGT_ID_RESP;
|
||||
while (len) {
|
||||
if (len < 2) {
|
||||
LOGP(DABIS, LOGL_NOTICE,
|
||||
|
@ -124,32 +152,33 @@ static int abis_rx_ipa_id_get(struct ipabis_link *link, uint8_t *data, int len)
|
|||
return -EIO;
|
||||
}
|
||||
switch (data[1]) {
|
||||
case IPA_IDTAG_UNIT:
|
||||
sprintf(str, "%s/%d", (link->trx) ? link->trx->bts->id
|
||||
: link->bts->id,
|
||||
(link->trx) ? link->trx->trx_nr : 0);
|
||||
case IPAC_IDTAG_UNIT:
|
||||
sprintf(str, "%u/%u/%u",
|
||||
bts->ip_access.site_id,
|
||||
bts->ip_access.bts_id,
|
||||
(link->trx) ? link->trx->nr : 0);
|
||||
break;
|
||||
case IPA_IDTAG_MACADDR:
|
||||
case IPAC_IDTAG_MACADDR:
|
||||
sprintf(str, "%02x:%02x:%02x:%02x:%02x:%02x",
|
||||
abis_mac[0], abis_mac[1], abis_mac[2],
|
||||
abis_mac[3], abis_mac[4], abis_mac[5]);
|
||||
break;
|
||||
case IPA_IDTAG_LOCATION1:
|
||||
case IPAC_IDTAG_LOCATION1:
|
||||
strcpy(str, "osmoBTS");
|
||||
break;
|
||||
case IPA_IDTAG_LOCATION2:
|
||||
case IPAC_IDTAG_LOCATION2:
|
||||
strcpy(str, "osmoBTS");
|
||||
break;
|
||||
case IPA_IDTAG_EQUIPVERS:
|
||||
case IPA_IDTAG_SWVERSION:
|
||||
case IPAC_IDTAG_EQUIPVERS:
|
||||
case IPAC_IDTAG_SWVERSION:
|
||||
strcpy(str, software_version);
|
||||
break;
|
||||
case IPA_IDTAG_UNITNAME:
|
||||
case IPAC_IDTAG_UNITNAME:
|
||||
sprintf(str, "osmoBTS-%02x-%02x-%02x-%02x-%02x-%02x",
|
||||
abis_mac[0], abis_mac[1], abis_mac[2],
|
||||
abis_mac[3], abis_mac[4], abis_mac[5]);
|
||||
break;
|
||||
case IPA_IDTAG_SERNR:
|
||||
case IPAC_IDTAG_SERNR:
|
||||
strcpy(str, "");
|
||||
break;
|
||||
default:
|
||||
|
@ -167,15 +196,15 @@ static int abis_rx_ipa_id_get(struct ipabis_link *link, uint8_t *data, int len)
|
|||
data += 2;
|
||||
len -= 2;
|
||||
}
|
||||
abis_push_ipa(nmsg, IPA_PROTO_IPACCESS);
|
||||
abis_push_ipa(nmsg, IPAC_PROTO_IPACCESS);
|
||||
|
||||
nmsg2 = abis_msgb_alloc(0);
|
||||
if (!nmsg2) {
|
||||
msgb_free(nmsg);
|
||||
return -ENOMEM;
|
||||
}
|
||||
*msgb_put(nmsg2, 1) = IPA_MSGT_ID_ACK;
|
||||
abis_push_ipa(nmsg2, IPA_PROTO_IPACCESS);
|
||||
*msgb_put(nmsg2, 1) = IPAC_MSGT_ID_ACK;
|
||||
abis_push_ipa(nmsg2, IPAC_PROTO_IPACCESS);
|
||||
|
||||
link->id_resp = 1;
|
||||
|
||||
|
@ -196,21 +225,23 @@ static int abis_rx_ipaccess(struct ipabis_link *link, struct msgb *msg)
|
|||
}
|
||||
|
||||
switch (*data) {
|
||||
case IPA_MSGT_PONG:
|
||||
case IPAC_MSGT_PONG:
|
||||
#if 0
|
||||
#warning HACK
|
||||
rsl_tx_chan_rqd(link->bts->trx[0]);
|
||||
LOGP(DABIS, LOGL_INFO, "PONG\n");
|
||||
#endif
|
||||
LOGP(DABIS, LOGL_DEBUG, "PONG\n");
|
||||
link->pong = 1;
|
||||
break;
|
||||
case IPA_MSGT_PING:
|
||||
LOGP(DABIS, LOGL_INFO, "reply to ping request\n");
|
||||
ret = abis_tx_ipa_pingpong(link, IPA_MSGT_PONG);
|
||||
case IPAC_MSGT_PING:
|
||||
LOGP(DABIS, LOGL_DEBUG, "reply to ping request\n");
|
||||
ret = abis_tx_ipa_pingpong(link, IPAC_MSGT_PONG);
|
||||
break;
|
||||
case IPA_MSGT_ID_GET:
|
||||
case IPAC_MSGT_ID_GET:
|
||||
ret = abis_rx_ipa_id_get(link, data + 1, len - 1);
|
||||
break;
|
||||
case IPA_MSGT_ID_ACK:
|
||||
LOGP(DABIS, LOGL_INFO, "ID ACK\n");
|
||||
case IPAC_MSGT_ID_ACK:
|
||||
LOGP(DABIS, LOGL_DEBUG, "ID ACK\n");
|
||||
if (link->id_resp && link->bts)
|
||||
ret = bts_link_estab(link->bts);
|
||||
if (link->id_resp && link->trx)
|
||||
|
@ -240,7 +271,7 @@ static int abis_rx(struct ipabis_link *link, struct msgb *msg)
|
|||
int ret = 0;
|
||||
|
||||
switch (hh->proto) {
|
||||
case IPA_PROTO_RSL:
|
||||
case IPAC_PROTO_RSL:
|
||||
if (!link->trx) {
|
||||
LOGP(DABIS, LOGL_NOTICE,
|
||||
"Received RSL message not on RSL link\n");
|
||||
|
@ -248,16 +279,17 @@ static int abis_rx(struct ipabis_link *link, struct msgb *msg)
|
|||
ret = EIO;
|
||||
break;
|
||||
}
|
||||
msg->trx = link->trx;
|
||||
ret = down_rsl(link->trx, msg);
|
||||
break;
|
||||
case IPA_PROTO_IPACCESS:
|
||||
case IPAC_PROTO_IPACCESS:
|
||||
ret = abis_rx_ipaccess(link, msg);
|
||||
break;
|
||||
case IPA_PROTO_SCCP:
|
||||
case IPAC_PROTO_SCCP:
|
||||
LOGP(DABIS, LOGL_INFO, "Received SCCP message\n");
|
||||
msgb_free(msg);
|
||||
break;
|
||||
case IPA_PROTO_OML:
|
||||
case IPAC_PROTO_OML:
|
||||
if (!link->bts) {
|
||||
LOGP(DABIS, LOGL_NOTICE,
|
||||
"Received OML message not on OML link\n");
|
||||
|
@ -265,6 +297,7 @@ static int abis_rx(struct ipabis_link *link, struct msgb *msg)
|
|||
ret = EIO;
|
||||
break;
|
||||
}
|
||||
msg->trx = link->bts->c0;
|
||||
ret = down_oml(link->bts, msg);
|
||||
break;
|
||||
default:
|
||||
|
@ -302,8 +335,8 @@ static void abis_timeout(void *arg)
|
|||
}
|
||||
link->ping = 1;
|
||||
link->pong = 0;
|
||||
LOGP(DABIS, LOGL_INFO, "PING\n");
|
||||
abis_tx_ipa_pingpong(link, IPA_MSGT_PING);
|
||||
LOGP(DABIS, LOGL_DEBUG, "PING\n");
|
||||
abis_tx_ipa_pingpong(link, IPAC_MSGT_PING);
|
||||
osmo_timer_schedule(&link->timer, OML_PING_TIMER, 0);
|
||||
break;
|
||||
}
|
||||
|
@ -348,7 +381,7 @@ static int abis_sock_cb(struct osmo_fd *bfd, unsigned int what)
|
|||
return 0;
|
||||
msg->l2h = msg->data + sizeof(*hh);
|
||||
if (ntohs(hh->len) > msgb_tailroom(msg)) {
|
||||
LOGP(DABIS, LOGL_NOTICE, "Received packet from "
|
||||
LOGP(DABIS, LOGL_DEBUG, "Received packet from "
|
||||
"Abis socket too large.\n");
|
||||
goto close;
|
||||
}
|
||||
|
@ -363,13 +396,13 @@ static int abis_sock_cb(struct osmo_fd *bfd, unsigned int what)
|
|||
if (ntohs(hh->len) + sizeof(*hh) > msg->len)
|
||||
return 0;
|
||||
link->rx_msg = NULL;
|
||||
LOGP(DABIS, LOGL_INFO, "Received messages from Abis socket.\n");
|
||||
LOGP(DABIS, LOGL_DEBUG, "Received messages from Abis socket.\n");
|
||||
ret = abis_rx(link, msg);
|
||||
}
|
||||
if ((what & BSC_FD_WRITE)) {
|
||||
msg = msgb_dequeue(&link->tx_queue);
|
||||
if (msg) {
|
||||
LOGP(DABIS, LOGL_INFO, "Sending messages to Abis socket.\n");
|
||||
LOGP(DABIS, LOGL_DEBUG, "Sending messages to Abis socket.\n");
|
||||
ret = send(link->bfd.fd, msg->data, msg->len, 0);
|
||||
if (ret < 0)
|
||||
goto close;
|
||||
|
@ -377,7 +410,7 @@ static int abis_sock_cb(struct osmo_fd *bfd, unsigned int what)
|
|||
link->bfd.when &= ~BSC_FD_WRITE;
|
||||
}
|
||||
if ((what & BSC_FD_EXCEPT)) {
|
||||
LOGP(DABIS, LOGL_INFO, "Abis socket received exception\n");
|
||||
LOGP(DABIS, LOGL_NOTICE, "Abis socket received exception\n");
|
||||
goto close;
|
||||
}
|
||||
|
||||
|
@ -388,11 +421,11 @@ close:
|
|||
|
||||
/* RSL link will just close and BSC is notified */
|
||||
if (link->trx) {
|
||||
LOGP(DABIS, LOGL_INFO, "Connection to BSC failed\n");
|
||||
LOGP(DABIS, LOGL_NOTICE, "Connection to BSC failed\n");
|
||||
return trx_link_estab(link->trx);
|
||||
}
|
||||
|
||||
LOGP(DABIS, LOGL_INFO, "Connection to BSC failed, retrying in %d "
|
||||
LOGP(DABIS, LOGL_NOTICE, "Connection to BSC failed, retrying in %d "
|
||||
"seconds.\n", OML_RETRY_TIMER);
|
||||
osmo_timer_schedule(&link->timer, OML_RETRY_TIMER, 0);
|
||||
link->state = LINK_STATE_RETRYING;
|
||||
|
@ -407,6 +440,8 @@ int abis_open(struct ipabis_link *link, uint32_t ip)
|
|||
int sock;
|
||||
int ret;
|
||||
|
||||
oml_init();
|
||||
|
||||
if (link->bfd.fd > 0)
|
||||
return -EBUSY;
|
||||
|
||||
|
@ -455,18 +490,11 @@ int abis_open(struct ipabis_link *link, uint32_t ip)
|
|||
void abis_close(struct ipabis_link *link)
|
||||
{
|
||||
struct msgb *msg;
|
||||
int i;
|
||||
|
||||
if (link->bfd.fd <= 0)
|
||||
return;
|
||||
|
||||
LOGP(DABIS, LOGL_INFO, "Abis socket closed.\n");
|
||||
|
||||
#warning if any link fails, shutdown all links
|
||||
if (link->trx) {
|
||||
for (i = 0; i < 8; i++)
|
||||
bts_setup_slot(&link->trx->slot[i], 0xff);
|
||||
}
|
||||
LOGP(DABIS, LOGL_NOTICE, "Abis socket closed.\n");
|
||||
|
||||
if (link->rx_msg) {
|
||||
msgb_free(link->rx_msg);
|
||||
|
|
155
src/common/bts.c
155
src/common/bts.c
|
@ -1,10 +1,13 @@
|
|||
/* BTS support code common to all supported BTS models */
|
||||
|
||||
/* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* 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 2 of the License, or
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||