Commit 5b14df33 authored by Ben Avison's avatar Ben Avison
Browse files

Initial import of OMAP4 HAL

Detail:
  Target platform is the Pandaboard, based on the TI OMAP4 SoC.
  Port is not yet complete, in particular, audio is not yet working.
Admin:
  Submission from Willi Theiß
parents
hdr/** gitlab-language=armasm linguist-language=armasm linguist-detectable=true
s/** gitlab-language=armasm linguist-language=armasm linguist-detectable=true
c/** gitlab-language=c linguist-language=c linguist-detectable=true
h/** gitlab-language=c linguist-language=c linguist-detectable=true
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
# Copyright 2011 Castle Technology Ltd
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#
# Makefile for OMAP-4 HAL
#
COMPONENT = OMAP-4 HAL
TARGET = OMAP4
OBJS = Top Boot Interrupts Timers CLib CLibAsm Stubs UART Debug PRCM Video USB I2C RTC SDMA TPS Audio GPIO GPMC NVMemory NVMem fat KbdScan #CPUClk
USBDIR = <Lib$Dir>.USB
HDRS =
CMHGFILE =
CUSTOMRES = custom
CUSTOMROM = custom
ROM_TARGET = custom
LNK_TARGET = custom
AIFDBG = aif._OMAP4
GPADBG = gpa.GPA
include StdRules
include StdTools
include CModule
CCFLAGS += -ff -APCS 3/32bit/nofp/noswst
ASFLAGS += -APCS 3/nofp/noswst
AASMFLAGS += -APCS 3/nofp/noswst
ROM_LIBS += ${USBDIR}.o.EHCIDriver ${USBDIR}.o.USBDriver
resources:
@${ECHO} ${COMPONENT}: no resources
rom: aof.${TARGET}
@${ECHO} ${COMPONENT}: rom module built
_debug: ${GPADBG}
@echo ${COMPONENT}: debug image built
install_rom: linked.${TARGET}
${CP} linked.${TARGET} ${INSTDIR}.${TARGET} ${CPFLAGS}
@echo ${COMPONENT}: rom module installed
aof.${TARGET}: ${ROM_OBJS_} ${ROM_LIBS} ${DIRS} ${ROM_DEPEND}
${LD} -o $@ -aof ${ROM_OBJS_} ${ROM_LIBS}
linked.${TARGET}: aof.${TARGET}
${LD} ${LDFLAGS} ${LDLINKFLAGS} -o $@ -bin -base 0xFC000000 aof.${TARGET}
${AIFDBG}: ${ROM_OBJS_}
${MKDIR} aif
${LD} -aif -bin -d -o ${AIFDBG} ${ROM_OBJS_} ${ROM_LIBS}
${GPADBG}: ${AIFDBG}
ToGPA -s ${AIFDBG} ${GPADBG}
# Dynamic dependencies:
Dir <Obey$Dir>
amu_machine clean
stripdepnd
Dir <Obey$Dir>
amu_machine rom _debug linked.OMAP4 THROWBACK=-throwback
This diff is collapsed.
This diff is collapsed.
/* Copyright 2011 Castle Technology Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "common.h"
#include "NVMem.h"
#include "fat.h"
extern int stricmp(const char *s1, const char *s2);
#define ATTR_READ_ONLY 0x01
#define ATTR_HIDDEN 0x02
#define ATTR_SYSTEM 0x04
#define ATTR_VOLUME_ID 0x08
#define ATTR_DIRECTORY 0x10
#define ATTR_ARCHIVE 0x20
#define ATTR_LONG_NAME (ATTR_READ_ONLY | ATTR_HIDDEN | ATTR_SYSTEM | ATTR_VOLUME_ID)
/* Define the mask of non-reserved bits as being the OR of all the above */
#define ATTR_NON_RESERVED (ATTR_LONG_NAME | ATTR_DIRECTORY | ATTR_ARCHIVE)
#define LAST_LONG_ENTRY 0x40
/******************************************************************
* FindDirectoryEntry
* Reads a block pointed to by the cluster and the offset.
* In: wsptr - pointer to ws struct.
* In: FileName - file name to be matched.
* In: da - pointer to data_area struct.
* Out: da - contains block containing the directory entry.
* Return: int - index of the directory entry in da.
******************************************************************/
int FindDirectoryEntry(ws *wsptr, char FileName[], union data_area *da)
{
uint i = 0;
bool bDone = false;
uchar uc = 0;
char short_name[16] = "";
char long_name[256] = "";
char long_name_2[256] = "";
bool bRetVal = false;
uint ci = 0; /* Character index */
int Block = 0; /* MUST be set to 0 for first call */
uint Cluster = wsptr->BPB_RootClus;
bool bFuncRetVal = false;
uchar LongNameChecksum = 0;
uchar ShortNameChecksum = 0;
uint pFcbName = 0;
ReadRootDirectoryBlock(wsptr, &Block, &Cluster, da);
print_block_data(da);
for (bDone = false; !bDone;)
{
for (i = 0; (i < 16) && !bDone; i++)
{
uc = da->byte[i * 32];
switch (uc)
{
case 0 :
dprintf("%02X: Finished\n", uc);
bDone = true;
break;
case 0xE5 :
dprintf("%02X: Empty\n", uc);
break;
default :
dprintf("%02X: valid, i = %d\n", uc, i);
/* Having found out that it is valid, we need to look */
/* at the attributes to decide how to interpret it */
uc = da->byte[(i * 32) + 11];
dprintf("Attributes: %02X\n", uc);
short_name[0] = '\0';
long_name[0] = '\0';
long_name_2[0] = '\0';
if ((uc & ATTR_NON_RESERVED) == ATTR_LONG_NAME)
{
/* This is a fragment of a long name. */
/* If we have found it at this point, it should be the last */
/* fragment (working backwards) of the long name, so it */
/* should have the LAST_LONG_ENTRY bit set. */
uc = da->byte[i * 32]; /* Get byte 0 again */
if ((uc & LAST_LONG_ENTRY) == 0)
{
dprintf("This should have been the last fragment of a long entry\n");
bDone = true;
break;
}
/* So far, so good. Get the long name into long_name. */
bFuncRetVal = GetLongName(wsptr, long_name, da, &i, &Block, &Cluster);
dprintf("Long name: %s\n", long_name);
dprintf("i = %d\n", i);
if (bFuncRetVal)
{
/* The long name was read without apparent errors, */
/* so let's try comparing it with the given name. */
bFuncRetVal = (stricmp (FileName, long_name) == 0);
if (bFuncRetVal)
{
/*
We have a match. We must return the short file name entry
that this long entry corresponds to, having checked that it
really does correspond. The match is determined by the
checksums.
*/
LongNameChecksum = da->byte[(i * 32) + 13];
dprintf("Matched long name; checksum = %d, index = %d\n",
LongNameChecksum, i);
++i;
if (i >= 16)
{
i = 0;
ReadRootDirectoryBlock(wsptr, &Block, &Cluster, da);
}
// Now i should be pointing to the short directory entry.
// Calculate its checksum.
for (ci = 11, pFcbName = i * 32, ShortNameChecksum = 0;
ci != 0; ci--)
{
ShortNameChecksum = ((ShortNameChecksum & 1) ? 0x80 : 0)
+ (ShortNameChecksum >> 1)
+ da->byte[pFcbName++];
}
dprintf("Short name checksum = %d\n", ShortNameChecksum);
if (ShortNameChecksum == LongNameChecksum)
{
return i;
}
}
}
}
else
{
/* This is a short name. */
strncpy(short_name, (char *)&da->byte[i * 32], 8);
/* It's possible that the root is padded with spaces, so remove them */
ci = 7;
while ((ci > 0) && (short_name[ci] == ' '))
{
short_name[ci--] = '\0';
}
short_name[++ci] = '.'; /* Add the dot */
short_name[++ci] = '\0'; /* Null terminate */
strncat(short_name, (char*) &da->byte[(i * 32) + 8], 3);
/* The extension may also be padded with spaces, so remove them */
ci = strlen(short_name) - 1;
while ((ci > 0) && (short_name[ci] == ' '))
{
short_name[ci--] = '\0';
}
dprintf("Short name: %s\n", short_name);
if (stricmp(FileName, short_name) == 0)
{
return i;
}
}
break;
}
}
if (!bDone)
{
/*
We must have worked through a block without getting a true comparison.
If there's another block to read, get it and loop back,
else we've finished so set bDone.
*/
if (Block < 0)
{
dprintf("We've finished\n");
bDone = true;
}
else
{
ReadRootDirectoryBlock(wsptr, &Block, &Cluster, da);
}
}
}
if (bRetVal)
{
return i; /* Return the index (0..15) to the entry */
}
else
{
return -1; /* No match */
}
}
/******************************************************************
* GetLongName
* Gets a long file name from the root directory.
* In: wsptr - pointer to ws struct.
* In: long_name[] - character array to hold the name.
* in: da - pointer to a data_area union which holds
* the block's data. This must have been
* filled in.
* In: entry - pointer to the directory entry (0..15) within
* the block.
* In: Block - pointer to the directory block number. This
* has to be compatible with ReadRootDirectoryBlock().
* In: Cluster - pointer to the clutsre if necessary. This
* has to be compatible with ReadRootDirectoryBlock().
* Out: long_name - filled in with the name.
* Out: da - will have been updated if block has been updated.
* Out: Block - if the long name extended into another block,
* block will have been incremented.
* Out: Cluster - this may have been updated.
* Out: entry - will certainly have been updated.
* Return: bool - true if success, else false.
******************************************************************/
bool GetLongName(ws *wsptr, char long_name[], union data_area *da, uint *entry,
int *Block, uint *Cluster)
{
char long_name_2[256] = "";
uchar uc = 0;
bool bError = false;
uchar checksum = 0;
checksum = da->byte[((*entry) * 32) + 13]; /* Get checksum of first fragment */
uc = da->byte[(*entry) * 32]; /* Get byte 0 of the entry */
uc &= ~LAST_LONG_ENTRY; /* Clear the bit so it looks like the number of the entry */
for (; (uc >= 1) && !bError; uc--)
{
/* The fragments are in reverse order, so we need to add later ones
in front of the name so far, so we need to shuffle the strings around */
strcpy(long_name_2, long_name);
long_name[0] = '\0'; /* Clear it to receive the leftmost known fragment */
GetLongNameFragment(long_name, da, ((*entry) * 32) + 1, 5);
GetLongNameFragment(long_name, da, ((*entry) * 32) + 14, 6);
GetLongNameFragment(long_name, da, ((*entry) * 32) + 28, 2);
if (checksum != da->byte[((*entry) * 32) + 13])
{
bError = true;
dprintf("Checksum error\n");
}
/* Concatenate the previous stuff */
strcat(long_name, long_name_2);
/* Increment the directory entry number */
if (uc > 1)
{
(*entry)++;
}
/* If the entry number is now 16, reset it to 0 and read the next block */
if ((*entry) >= 16)
{
*entry = 0;
bError |= !ReadRootDirectoryBlock(wsptr, Block, Cluster, da);
}
}
return !bError;
}
/******************************************************************
* GetLongNameFragment
* Gets a fragment of a long file name from the root directory.
* In: frag_name[] - character array to hold the name.
* in: da - pointer to a data_area union which holds
* the block's data. This must have been
* filled in.
* In: offset - the byte offset within the directory entry
* In: num_chars - the number of characters to get.
* Out: frag_name - filled in with the name fragment.
* Return: void
******************************************************************/
void GetLongNameFragment(char frag_name[], union data_area *da, uint offset, uint num_chars)
{
uint j = 0;
uint frag_name_len = 0;
uint c = 0;
frag_name_len = strlen(frag_name);
for (j = 0; j < num_chars; j++)
{
c = GetUShort(da, offset + (j * 2));
if ((c < 32) || (c == 0xFFFF)) /* It seems that words following a NUL can be 0xFFFF */
{
c = 0; /* Replace any control character with NUL */
}
else if (c == 127)
{
c = '.'; /* Replace rubout with dot */
}
frag_name[frag_name_len++] = (char) c;
frag_name[frag_name_len] = '\0';
}
}
/******************************************************************
* ReadBlockClustered
* Reads a block pointed to by the cluster and the offset.
* In: wsptr - pointer to ws struct.
* In: cluster - pointer to a cluster number.
* In: offset - pointer to the block offset in the cluster.
* In: da - pointer to data_area union
* Out: cluster - will have been updated to point to the next
* cluster if the block read was the last of
* the cluster.
* Out: offset - will have been updated to point to the
* next block in this cluster, or to 0 if
* the block read was the last of the cluster.
* Out: da - filled with block's contents.
* Return: bool - true if read was successful, else false.
******************************************************************/
bool ReadBlockClustered(ws *wsptr, uint *cluster, uint *offset, union data_area *da)
{
bool bRetVal = false;
uint BlockAddress = 0;
dprintf("ReadBlockClustered (%u, %u)\n", *cluster, *offset);
BlockAddress = FirstSectorOfCluster(wsptr, *cluster) + (*offset);
(*offset)++; /* Increment offset */
/* If the offset is now beyond the cluster, we must get the next linked cluster. */
if ((*offset) >= wsptr->BPB_SecPerClus)
{
*offset = 0;
*cluster = NextCluster(wsptr, *cluster);
//dprintf ("Next cluster will be %u\n", *cluster);
}
//dprintf ("ReadBlockClustered is about to read sector 0x%X\n", BlockAddress);
ReadBlockOfPartition(wsptr, BlockAddress, da);
return bRetVal;
}
/******************************************************************
* FirstSectorOfCluster
* Returns the block number of the first data block in a cluster.
* In: wsptr - pointer to ws struct.
* In: cluster - a cluster number (2...)
* Return: uint - the block number (relative to the base
* of the partition) of the cluster.
* If called with cluster == 0 or 1,
* returns 0xFFFFFFFF.
******************************************************************/
uint FirstSectorOfCluster(ws *wsptr, uint cluster)
{
if (cluster < 2)
{
return 0xFFFFFFFF;
}
else