2009-06-20 21:17:46 +02:00
|
|
|
/****************************************************************************
|
2018-05-29 21:21:26 +02:00
|
|
|
* libs/libc/symtab/symtab_findbyvalue.c
|
2009-06-20 21:17:46 +02:00
|
|
|
*
|
2021-03-02 15:54:21 +01:00
|
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
|
|
* this work for additional information regarding copyright ownership. The
|
|
|
|
* ASF licenses this file to you 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
|
2009-06-20 21:17:46 +02:00
|
|
|
*
|
2021-03-02 15:54:21 +01:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
2009-06-20 21:17:46 +02:00
|
|
|
*
|
2021-03-02 15:54:21 +01:00
|
|
|
* 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.
|
2009-06-20 21:17:46 +02:00
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Included Files
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
#include <nuttx/config.h>
|
|
|
|
|
2009-12-17 00:23:46 +01:00
|
|
|
#include <stddef.h>
|
2009-06-20 21:17:46 +02:00
|
|
|
#include <debug.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
2015-12-13 15:10:01 +01:00
|
|
|
#include <nuttx/symtab.h>
|
2009-06-20 21:17:46 +02:00
|
|
|
|
2015-10-03 01:43:18 +02:00
|
|
|
/****************************************************************************
|
2009-06-20 21:17:46 +02:00
|
|
|
* Public Functions
|
2015-10-03 01:43:18 +02:00
|
|
|
****************************************************************************/
|
2009-06-20 21:17:46 +02:00
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Name: symtab_findbyvalue
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Find the symbol in the symbol table whose value closest (but not greater
|
2021-03-02 14:33:27 +01:00
|
|
|
* than), the provided value. This version assumes that table is not
|
2021-03-15 10:35:47 +01:00
|
|
|
* ordered with respect to symbol value and, hence, access time will be
|
2021-03-02 14:33:27 +01:00
|
|
|
* linear with respect to nsyms.
|
2009-06-20 21:17:46 +02:00
|
|
|
*
|
|
|
|
* Returned Value:
|
|
|
|
* A reference to the symbol table entry if an entry with the matching
|
2021-03-15 10:35:47 +01:00
|
|
|
* value is found; NULL is returned if the entry is not found.
|
2009-06-20 21:17:46 +02:00
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
FAR const struct symtab_s *
|
|
|
|
symtab_findbyvalue(FAR const struct symtab_s *symtab,
|
|
|
|
FAR void *value, int nsyms)
|
|
|
|
{
|
2021-12-21 17:04:41 +01:00
|
|
|
#ifndef CONFIG_SYMTAB_ORDEREDBYVALUE
|
2009-06-20 21:17:46 +02:00
|
|
|
FAR const struct symtab_s *retval = NULL;
|
2021-12-21 17:04:41 +01:00
|
|
|
#else
|
|
|
|
int high = nsyms - 1;
|
|
|
|
int mid = high >> 1;
|
|
|
|
int low = 0;
|
|
|
|
#endif
|
2009-06-20 21:17:46 +02:00
|
|
|
|
2022-01-27 05:23:17 +01:00
|
|
|
if (symtab == NULL)
|
|
|
|
{
|
|
|
|
DEBUGASSERT(nsyms == 0);
|
|
|
|
return NULL;
|
|
|
|
}
|
2021-12-21 17:04:41 +01:00
|
|
|
|
|
|
|
#ifdef CONFIG_SYMTAB_ORDEREDBYVALUE
|
|
|
|
|
|
|
|
while (high >= low)
|
|
|
|
{
|
|
|
|
mid = (low + high) >> 1;
|
|
|
|
|
|
|
|
if (symtab[mid].sym_value == value)
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if (symtab[mid].sym_value > value)
|
|
|
|
{
|
|
|
|
if (symtab[mid - 1].sym_value <= value)
|
|
|
|
{
|
|
|
|
mid -= 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
high = mid - 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (symtab[mid].sym_value < value)
|
|
|
|
{
|
libs: fix the problem that the address obtained in thumb mode cannot be executed.
The lowest bit of the thumb instruction is 1 by default, which is used to distinguish arm instructions and thumb instructions.
Fixed the problem of misalignment of symbol table when performing binary search
In arm, the lowest bit of the instruction is 1, which is a thumb instruction, and 0, which is an arm instruction.
The nm command was used in mkallsym.sh before, and the result it will return will set the lowest bit of the thumb instruction to 0. There will be a one-byte deviation during binary search, so mkallsyms.py will also set the lowest bit to 0 according to the previous format.
```sh
arm-none-eabi-nm -Cn nuttx | grep hello
0801c384 T hello_main
arm-none-eabi-objdump nuttx -t |grep hello
0801c384 g F .text 0000004c hello_main
arm-none-eabi-readelf nuttx -s |grep hello
4558: 0801c385 76 FUNC GLOBAL DEFAULT 1 hello_main
```
However, in the following case, when you need to find the function address according to the symbol name and execute the corresponding function, the lowest address obtained is 0. It will follow the arm instruction, causing an exception.
```c
void sym_test(void)
{
printf("call sym_test\n");
}
int main(int argc, FAR char *argv[])
{
FAR void *addr = sym_test;
printf("sym_test:%p %pS\n",addr, addr);
printf("sym_test - 1: %pS\n", (char *)addr - 1);
printf("sym_test + 1: %pS\n", (char *)addr + 1);
size_t size;
void (*func)(void);
const struct symtab_s *sym = allsyms_findbyname("sym_test", &size);
printf("sym_test:%p %pS\n",sym, sym);
func = sym->sym_value;
func();
return 0;
}
```
Therefore, you need to change mkallsyms.py back to the correct result and correct the binary search.
Signed-off-by: yinshengkai <yinshengkai@xiaomi.com>
2023-11-27 13:04:46 +01:00
|
|
|
if (symtab[mid + 1].sym_value > value)
|
2021-12-21 17:04:41 +01:00
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
low = mid + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return &symtab[mid];
|
|
|
|
|
|
|
|
#else /* CONFIG_SYMTAB_ORDEREDBYVALUE */
|
|
|
|
|
2009-06-20 21:17:46 +02:00
|
|
|
for (; nsyms > 0; symtab++, nsyms--)
|
|
|
|
{
|
2021-03-02 14:33:27 +01:00
|
|
|
/* Look for symbols of lesser or equal value (probably address) to
|
|
|
|
* value
|
|
|
|
*/
|
2009-06-20 21:17:46 +02:00
|
|
|
|
|
|
|
if (symtab->sym_value <= value)
|
|
|
|
{
|
|
|
|
/* Found one. Is it the largest we have found so far? */
|
|
|
|
|
|
|
|
if (!retval || symtab->sym_value > retval->sym_value)
|
|
|
|
{
|
|
|
|
/* Yes, then it is the new candidate for the symbol whose value
|
|
|
|
* just below 'value'
|
|
|
|
*/
|
|
|
|
|
|
|
|
retval = symtab;
|
|
|
|
|
2021-03-02 14:33:27 +01:00
|
|
|
/* If it is exactly equal to the search 'value', then we might
|
|
|
|
* as well terminate early because we can't do any better than
|
|
|
|
* that.
|
2009-06-20 21:17:46 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
if (retval->sym_value == value)
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return retval;
|
2021-12-21 17:04:41 +01:00
|
|
|
#endif /* CONFIG_SYMTAB_ORDEREDBYVALUE */
|
2009-06-20 21:17:46 +02:00
|
|
|
}
|