module.c 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274
  1. /*
  2. * File : module.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2006 - 2011, RT-Thread Development Team
  5. *
  6. * The license and distribution terms for this file may be
  7. * found in the file LICENSE in this distribution or at
  8. * http://www.rt-thread.org/license/LICENSE
  9. *
  10. * Change Logs:
  11. * Date Author Notes
  12. * 2010-01-09 Bernard first version
  13. * 2010-04-09 yi.qiu implement based on first version
  14. * 2010-10-23 yi.qiu implement module memory allocator
  15. * 2011-05-25 yi.qiu implement module hook function
  16. * 2011-06-23 yi.qiu rewrite module memory allocator
  17. */
  18. #include <rthw.h>
  19. #include <rtthread.h>
  20. #include <rtm.h>
  21. #include "string.h"
  22. #include "kservice.h"
  23. #ifdef RT_USING_MODULE
  24. #include "module.h"
  25. #define elf_module ((Elf32_Ehdr *)module_ptr)
  26. #define shdr ((Elf32_Shdr *)((rt_uint8_t *)module_ptr + elf_module->e_shoff))
  27. #define phdr ((Elf32_Phdr *)((rt_uint8_t *)module_ptr + elf_module->e_phoff))
  28. #define IS_PROG(s) (s.sh_type == SHT_PROGBITS)
  29. #define IS_NOPROG(s) (s.sh_type == SHT_NOBITS)
  30. #define IS_REL(s) (s.sh_type == SHT_REL)
  31. #define IS_RELA(s) (s.sh_type == SHT_RELA)
  32. #define IS_ALLOC(s) (s.sh_flags == SHF_ALLOC)
  33. #define IS_AX(s) ((s.sh_flags & SHF_ALLOC) && (s.sh_flags & SHF_EXECINSTR))
  34. #define IS_AW(s) ((s.sh_flags & SHF_ALLOC) && (s.sh_flags & SHF_WRITE))
  35. #define PAGE_COUNT_MAX 256
  36. /* module memory allocator */
  37. struct rt_mem_head
  38. {
  39. rt_size_t size; /* size of memory block */
  40. struct rt_mem_head *next; /* next valid memory block */
  41. };
  42. struct rt_page_info
  43. {
  44. rt_uint32_t *page_ptr;
  45. rt_uint32_t npage;
  46. };
  47. static void *rt_module_malloc_page(rt_size_t npages);
  48. static void rt_module_free_page(void *page_ptr, rt_size_t npages);
  49. static rt_module_t rt_current_module = RT_NULL;
  50. static struct rt_semaphore mod_sem;
  51. static struct rt_module_symtab *_rt_module_symtab_begin = RT_NULL, *_rt_module_symtab_end = RT_NULL;
  52. rt_list_t rt_module_symbol_list;
  53. static char *_strip_name(const char *string)
  54. {
  55. int i = 0, p = 0, q = 0;
  56. const char *str = string;
  57. char *dest = RT_NULL;
  58. while (*str != '\n' && *str != '\0')
  59. {
  60. if (*str =='/' ) p = i + 1;
  61. if (*str == '.') q = i;
  62. str++; i++;
  63. }
  64. if (p < q)
  65. {
  66. int len = q - p;
  67. dest = (char *)rt_malloc(len + 1);
  68. rt_strncpy(dest, &string[p], len);
  69. dest[len] = '\0';
  70. }
  71. return dest;
  72. }
  73. /**
  74. * @ingroup SystemInit
  75. *
  76. * This function will initialize system module
  77. *
  78. */
  79. void rt_system_module_init(void)
  80. {
  81. #ifdef __GNUC__
  82. extern int __rtmsymtab_start;
  83. extern int __rtmsymtab_end;
  84. _rt_module_symtab_begin = (struct rt_module_symtab *)&__rtmsymtab_start;
  85. _rt_module_symtab_end = (struct rt_module_symtab *)&__rtmsymtab_end;
  86. #elif defined (__CC_ARM)
  87. extern int RTMSymTab$$Base;
  88. extern int RTMSymTab$$Limit;
  89. _rt_module_symtab_begin = (struct rt_module_symtab *)&RTMSymTab$$Base;
  90. _rt_module_symtab_end = (struct rt_module_symtab *)&RTMSymTab$$Limit;
  91. #endif
  92. rt_list_init(&rt_module_symbol_list);
  93. /* initialize heap semaphore */
  94. rt_sem_init(&mod_sem, "module", 1, RT_IPC_FLAG_FIFO);
  95. /* init current module */
  96. rt_current_module = RT_NULL;
  97. }
  98. static rt_uint32_t rt_module_symbol_find(const char *sym_str)
  99. {
  100. /* find in kernel symbol table */
  101. struct rt_module_symtab *index;
  102. for (index = _rt_module_symtab_begin; index != _rt_module_symtab_end; index ++)
  103. {
  104. if (rt_strcmp(index->name, sym_str) == 0)
  105. return (rt_uint32_t)index->addr;
  106. }
  107. return 0;
  108. }
  109. /**
  110. * This function will return self module object
  111. *
  112. * @return the self module object
  113. *
  114. */
  115. rt_module_t rt_module_self(void)
  116. {
  117. /* return current module */
  118. return rt_current_module;
  119. }
  120. /**
  121. * This function will set current module object
  122. *
  123. * @return RT_EOK
  124. */
  125. rt_err_t rt_module_set(rt_module_t module)
  126. {
  127. /* set current module */
  128. rt_current_module = module;
  129. return RT_EOK;
  130. }
  131. static int rt_module_arm_relocate(struct rt_module *module, Elf32_Rel *rel, Elf32_Addr sym_val)
  132. {
  133. Elf32_Addr *where, tmp;
  134. Elf32_Sword addend;
  135. where = (Elf32_Addr *)((rt_uint8_t *)module->module_space + rel->r_offset);
  136. switch (ELF32_R_TYPE(rel->r_info))
  137. {
  138. case R_ARM_NONE:
  139. break;
  140. case R_ARM_ABS32:
  141. *where += (Elf32_Addr)sym_val;
  142. RT_DEBUG_LOG(RT_DEBUG_MODULE, ("R_ARM_ABS32: %x -> %x\n", where, *where));
  143. break;
  144. case R_ARM_PC24:
  145. case R_ARM_PLT32:
  146. case R_ARM_CALL:
  147. case R_ARM_JUMP24:
  148. addend = *where & 0x00ffffff;
  149. if (addend & 0x00800000)
  150. addend |= 0xff000000;
  151. tmp = sym_val - (Elf32_Addr)where + (addend << 2);
  152. tmp >>= 2;
  153. *where = (*where & 0xff000000) | (tmp & 0x00ffffff);
  154. RT_DEBUG_LOG(RT_DEBUG_MODULE, ("R_ARM_PC24: %x -> %x\n", where, *where));
  155. break;
  156. case R_ARM_V4BX:
  157. *where &= 0xf000000f;
  158. *where |= 0x01a0f000;
  159. break;
  160. case R_ARM_GLOB_DAT:
  161. case R_ARM_JUMP_SLOT:
  162. *where = (Elf32_Addr)sym_val;
  163. RT_DEBUG_LOG(RT_DEBUG_MODULE,
  164. ("R_ARM_JUMP_SLOT: 0x%x -> 0x%x 0x%x\n", where, *where, sym_val));
  165. break;
  166. case R_ARM_RELATIVE:
  167. *where += (Elf32_Addr)sym_val;
  168. RT_DEBUG_LOG(RT_DEBUG_MODULE,
  169. ("R_ARM_RELATIVE: 0x%x -> 0x%x 0x%x\n", where, *where, sym_val));
  170. break;
  171. default:
  172. return -1;
  173. }
  174. return 0;
  175. }
  176. static void rt_module_init_object_container(struct rt_module *module)
  177. {
  178. RT_ASSERT(module != RT_NULL);
  179. /* initialize object container - thread */
  180. rt_list_init(&(module->module_object[RT_Object_Class_Thread].object_list));
  181. module->module_object[RT_Object_Class_Thread].object_size = sizeof(struct rt_thread);
  182. module->module_object[RT_Object_Class_Thread].type = RT_Object_Class_Thread;
  183. #ifdef RT_USING_SEMAPHORE
  184. /* initialize object container - semaphore */
  185. rt_list_init(&(module->module_object[RT_Object_Class_Semaphore].object_list));
  186. module->module_object[RT_Object_Class_Semaphore].object_size = sizeof(struct rt_semaphore);
  187. module->module_object[RT_Object_Class_Semaphore].type = RT_Object_Class_Semaphore;
  188. #endif
  189. #ifdef RT_USING_MUTEX
  190. /* initialize object container - mutex */
  191. rt_list_init(&(module->module_object[RT_Object_Class_Mutex].object_list));
  192. module->module_object[RT_Object_Class_Mutex].object_size = sizeof(struct rt_mutex);
  193. module->module_object[RT_Object_Class_Mutex].type = RT_Object_Class_Mutex;
  194. #endif
  195. #ifdef RT_USING_EVENT
  196. /* initialize object container - event */
  197. rt_list_init(&(module->module_object[RT_Object_Class_Event].object_list));
  198. module->module_object[RT_Object_Class_Event].object_size = sizeof(struct rt_event);
  199. module->module_object[RT_Object_Class_Event].type = RT_Object_Class_Event;
  200. #endif
  201. #ifdef RT_USING_MAILBOX
  202. /* initialize object container - mailbox */
  203. rt_list_init(&(module->module_object[RT_Object_Class_MailBox].object_list));
  204. module->module_object[RT_Object_Class_MailBox].object_size = sizeof(struct rt_mailbox);
  205. module->module_object[RT_Object_Class_MailBox].type = RT_Object_Class_MailBox;
  206. #endif
  207. #ifdef RT_USING_MESSAGEQUEUE
  208. /* initialize object container - message queue */
  209. rt_list_init(&(module->module_object[RT_Object_Class_MessageQueue].object_list));
  210. module->module_object[RT_Object_Class_MessageQueue].object_size = sizeof(struct rt_messagequeue);
  211. module->module_object[RT_Object_Class_MessageQueue].type = RT_Object_Class_MessageQueue;
  212. #endif
  213. #ifdef RT_USING_MEMPOOL
  214. /* initialize object container - memory pool */
  215. rt_list_init(&(module->module_object[RT_Object_Class_MemPool].object_list));
  216. module->module_object[RT_Object_Class_MemPool].object_size = sizeof(struct rt_mempool);
  217. module->module_object[RT_Object_Class_MemPool].type = RT_Object_Class_MemPool;
  218. #endif
  219. #ifdef RT_USING_DEVICE
  220. /* initialize object container - device */
  221. rt_list_init(&(module->module_object[RT_Object_Class_Device].object_list));
  222. module->module_object[RT_Object_Class_Device].object_size = sizeof(struct rt_device);
  223. module->module_object[RT_Object_Class_Device].type = RT_Object_Class_Device;
  224. #endif
  225. /* initialize object container - timer */
  226. rt_list_init(&(module->module_object[RT_Object_Class_Timer].object_list));
  227. module->module_object[RT_Object_Class_Timer].object_size = sizeof(struct rt_timer);
  228. module->module_object[RT_Object_Class_Timer].type = RT_Object_Class_Timer;
  229. }
  230. #ifdef RT_USING_HOOK
  231. static void (*rt_module_load_hook)(rt_module_t module);
  232. static void (*rt_module_unload_hook)(rt_module_t module);
  233. /**
  234. * @addtogroup Hook
  235. */
  236. /*@{*/
  237. /**
  238. * This function will set a hook function, which will be invoked when module
  239. * be loaded to system.
  240. *
  241. * @param hook the hook function
  242. */
  243. void rt_module_load_sethook(void (*hook)(rt_module_t module))
  244. {
  245. rt_module_load_hook = hook;
  246. }
  247. /**
  248. * This function will set a hook function, which will be invoked when module
  249. * be unloaded from system.
  250. *
  251. * @param hook the hook function
  252. */
  253. void rt_module_unload_sethook(void (*hook)(rt_module_t module))
  254. {
  255. rt_module_unload_hook = hook;
  256. }
  257. /*@}*/
  258. #endif
  259. /**
  260. * This function will load a module from memory and create a thread for it
  261. *
  262. * @param name the name of module, which shall be unique
  263. * @param module_ptr the memory address of module image
  264. *
  265. * @return the module object
  266. *
  267. */
  268. rt_module_t rt_module_load(const char *name, void *module_ptr)
  269. {
  270. rt_uint8_t *ptr = RT_NULL;
  271. rt_module_t module = RT_NULL;
  272. rt_bool_t linked = RT_FALSE;
  273. rt_uint32_t index, module_size = 0;
  274. RT_DEBUG_NOT_IN_INTERRUPT;
  275. rt_kprintf("rt_module_load: %s ,", name);
  276. /* check ELF header */
  277. if (rt_memcmp(elf_module->e_ident, RTMMAG, SELFMAG) == 0)
  278. {
  279. /* rtmlinke finished */
  280. linked = RT_TRUE;
  281. }
  282. else if (rt_memcmp(elf_module->e_ident, ELFMAG, SELFMAG) != 0)
  283. {
  284. rt_kprintf(" module magic error\n");
  285. return RT_NULL;
  286. }
  287. /* check ELF class */
  288. if(elf_module->e_ident[EI_CLASS] != ELFCLASS32)
  289. {
  290. rt_kprintf(" module class error\n");
  291. return RT_NULL;
  292. }
  293. /* get the ELF image size */
  294. for (index = 0; index < elf_module->e_phnum; index++)
  295. {
  296. if(phdr[index].p_type == PT_LOAD)
  297. module_size += phdr[index].p_memsz;
  298. }
  299. if (module_size == 0)
  300. {
  301. rt_kprintf(" module size error\n");
  302. return module;
  303. }
  304. /* allocate module */
  305. module = (struct rt_module *)rt_object_allocate(RT_Object_Class_Module, name);
  306. if (!module) return RT_NULL;
  307. /* allocate module space */
  308. module->module_space = rt_malloc(module_size);
  309. if (module->module_space == RT_NULL)
  310. {
  311. rt_object_delete(&(module->parent));
  312. return RT_NULL;
  313. }
  314. /* zero all space */
  315. ptr = module->module_space;
  316. rt_memset(ptr, 0, module_size);
  317. rt_kprintf(" load address at 0x%x\n", ptr);
  318. for (index = 0; index < elf_module->e_phnum; index++)
  319. {
  320. if (phdr[index].p_type == PT_LOAD)
  321. {
  322. rt_memcpy(ptr, (rt_uint8_t *)elf_module + phdr[index].p_offset, phdr[index].p_filesz);
  323. ptr += phdr[index].p_memsz;
  324. }
  325. }
  326. /* set module entry */
  327. module->module_entry = module->module_space + elf_module->e_entry;
  328. /* handle relocation section */
  329. for (index = 0; index < elf_module->e_shnum; index ++)
  330. {
  331. if (IS_REL(shdr[index]))
  332. {
  333. rt_uint32_t i, nr_reloc;
  334. Elf32_Sym *symtab;
  335. Elf32_Rel *rel;
  336. rt_uint8_t *strtab;
  337. static rt_bool_t unsolved = RT_FALSE;
  338. /* get relocate item */
  339. rel = (Elf32_Rel *)((rt_uint8_t *)module_ptr + shdr[index].sh_offset);
  340. /* locate .rel.plt and .rel.dyn section */
  341. symtab =(Elf32_Sym *)((rt_uint8_t *)module_ptr + shdr[shdr[index].sh_link].sh_offset);
  342. strtab = (rt_uint8_t*)module_ptr + shdr[shdr[shdr[index].sh_link].sh_link].sh_offset;
  343. nr_reloc = (rt_uint32_t)(shdr[index].sh_size / sizeof(Elf32_Rel));
  344. /* relocate every items */
  345. for (i = 0; i < nr_reloc; i ++)
  346. {
  347. Elf32_Sym *sym = &symtab[ELF32_R_SYM(rel->r_info)];
  348. RT_DEBUG_LOG(RT_DEBUG_MODULE,
  349. ("relocate symbol %s shndx %d\n", strtab + sym->st_name, sym->st_shndx));
  350. if ((sym->st_shndx != SHT_NULL) || (ELF_ST_BIND(sym->st_info) == STB_LOCAL))
  351. rt_module_arm_relocate(module, rel, (Elf32_Addr)(module->module_space + sym->st_value));
  352. else if (!linked)
  353. {
  354. Elf32_Addr addr;
  355. RT_DEBUG_LOG(RT_DEBUG_MODULE,
  356. ("unresolved relocate symbol: %s\n", strtab + sym->st_name));
  357. /* need to resolve symbol in kernel symbol table */
  358. addr = rt_module_symbol_find((const char *)(strtab + sym->st_name));
  359. if (addr == 0)
  360. {
  361. rt_kprintf("can't find %s in kernel symbol table\n", strtab + sym->st_name);
  362. unsolved = RT_TRUE;
  363. }
  364. else rt_module_arm_relocate(module, rel, addr);
  365. }
  366. rel ++;
  367. }
  368. if (unsolved)
  369. {
  370. rt_object_delete(&(module->parent));
  371. rt_free(module);
  372. return RT_NULL;
  373. }
  374. }
  375. }
  376. /* construct module symbol table */
  377. for (index = 0; index < elf_module->e_shnum; index ++)
  378. {
  379. /* find .dynsym section */
  380. rt_uint8_t *shstrab = (rt_uint8_t *)module_ptr + shdr[elf_module->e_shstrndx].sh_offset;
  381. if (rt_strcmp((const char *)(shstrab + shdr[index].sh_name), ELF_DYNSYM) == 0) break;
  382. }
  383. /* found .dynsym section */
  384. if (index != elf_module->e_shnum)
  385. {
  386. int i, count = 0;
  387. Elf32_Sym *symtab = RT_NULL;
  388. rt_uint8_t *strtab = RT_NULL;
  389. symtab =(Elf32_Sym *)((rt_uint8_t *)module_ptr + shdr[index].sh_offset);
  390. strtab = (rt_uint8_t *)module_ptr + shdr[shdr[index].sh_link].sh_offset;
  391. for (i=0; i<shdr[index].sh_size/sizeof(Elf32_Sym); i++)
  392. {
  393. if ((ELF_ST_BIND(symtab[i].st_info) == STB_GLOBAL) && (ELF_ST_TYPE(symtab[i].st_info) == STT_FUNC))
  394. count ++;
  395. }
  396. module->symtab = (struct rt_module_symtab *)rt_malloc(count * sizeof(struct rt_module_symtab));
  397. module->nsym = count;
  398. for (i=0, count=0; i<shdr[index].sh_size/sizeof(Elf32_Sym); i++)
  399. {
  400. if ((ELF_ST_BIND(symtab[i].st_info) == STB_GLOBAL) && (ELF_ST_TYPE(symtab[i].st_info) == STT_FUNC))
  401. {
  402. rt_size_t length = rt_strlen((const char *)(strtab + symtab[i].st_name)) + 1;
  403. module->symtab[count].addr = (void *)(module->module_space + symtab[i].st_value);
  404. module->symtab[count].name = rt_malloc(length);
  405. rt_memset((void *)module->symtab[count].name, 0, length);
  406. rt_memcpy((void *)module->symtab[count].name, strtab + symtab[i].st_name, length);
  407. count ++;
  408. }
  409. }
  410. }
  411. /* init module object container */
  412. rt_module_init_object_container(module);
  413. /* increase module reference count */
  414. module->nref ++;
  415. if (elf_module->e_entry != 0)
  416. {
  417. /* init module memory allocator */
  418. module->mem_list = RT_NULL;
  419. /* create page array */
  420. module->page_array = (void *)rt_malloc(PAGE_COUNT_MAX * sizeof(struct rt_page_info));
  421. module->page_cnt = 0;
  422. /* create module thread */
  423. module->stack_size = 2048;
  424. module->thread_priority = 25;
  425. module->module_thread = rt_thread_create(name,
  426. module->module_entry, RT_NULL,
  427. module->stack_size,
  428. module->thread_priority, 10);
  429. module->module_thread->module_id = (void*)module;
  430. module->parent.flag = RT_MODULE_FLAG_WITHENTRY;
  431. /* startup module thread */
  432. rt_thread_startup(module->module_thread);
  433. }
  434. else
  435. {
  436. /* without entry point */
  437. module->parent.flag |= RT_MODULE_FLAG_WITHOUTENTRY;
  438. }
  439. #ifdef RT_USING_HOOK
  440. if (rt_module_load_hook != RT_NULL)
  441. {
  442. rt_module_load_hook(module);
  443. }
  444. #endif
  445. return module;
  446. }
  447. #ifdef RT_USING_DFS
  448. #include <dfs_posix.h>
  449. /**
  450. * This function will load a module from a file
  451. *
  452. * @param filename the file name of application module
  453. *
  454. * @return the module object
  455. *
  456. */
  457. rt_module_t rt_module_open(const char *path)
  458. {
  459. int fd, length;
  460. struct rt_module *module;
  461. struct stat s;
  462. char *buffer, *offset_ptr, *name;
  463. RT_DEBUG_NOT_IN_INTERRUPT;
  464. /* check parameters */
  465. RT_ASSERT(path != RT_NULL);
  466. if (stat(path, &s) !=0)
  467. {
  468. rt_kprintf("access %s failed\n", path);
  469. return RT_NULL;
  470. }
  471. buffer = (char *)rt_malloc(s.st_size);
  472. if (buffer == RT_NULL)
  473. {
  474. rt_kprintf("out of memory\n");
  475. return RT_NULL;
  476. }
  477. offset_ptr = buffer;
  478. fd = open(path, O_RDONLY, 0);
  479. if (fd < 0)
  480. {
  481. rt_kprintf("open %s failed\n", path);
  482. rt_free(buffer);
  483. return RT_NULL;
  484. }
  485. do
  486. {
  487. length = read(fd, offset_ptr, 4096);
  488. if (length > 0)
  489. {
  490. offset_ptr += length;
  491. }
  492. }while (length > 0);
  493. /* close fd */
  494. close(fd);
  495. if ((rt_uint32_t)offset_ptr - (rt_uint32_t)buffer != s.st_size)
  496. {
  497. rt_kprintf("check: read file failed\n");
  498. rt_free(buffer);
  499. return RT_NULL;
  500. }
  501. name = _strip_name(path);
  502. module = rt_module_load(name, (void *)buffer);
  503. rt_free(buffer);
  504. rt_free(name);
  505. return module;
  506. }
  507. #if defined(RT_USING_FINSH)
  508. #include <finsh.h>
  509. FINSH_FUNCTION_EXPORT_ALIAS(rt_module_open, exec, exec module from file);
  510. #endif
  511. #endif
  512. /**
  513. * This function will unload a module from memory and release resources
  514. *
  515. * @param module the module to be unloaded
  516. *
  517. * @return the operation status, RT_EOK on OK; -RT_ERROR on error
  518. *
  519. */
  520. rt_err_t rt_module_unload(rt_module_t module)
  521. {
  522. int i;
  523. struct rt_object *object;
  524. struct rt_list_node *list;
  525. RT_DEBUG_NOT_IN_INTERRUPT;
  526. /* check parameter */
  527. RT_ASSERT(module != RT_NULL);
  528. rt_kprintf("rt_module_unload: %s\n", module->parent.name);
  529. /* module has entry point */
  530. if ((module->parent.flag & RT_MODULE_FLAG_WITHOUTENTRY) != RT_MODULE_FLAG_WITHOUTENTRY)
  531. {
  532. /* suspend module main thread */
  533. if (module->module_thread != RT_NULL)
  534. {
  535. if (module->module_thread->stat == RT_THREAD_READY)
  536. rt_thread_suspend(module->module_thread);
  537. }
  538. /* delete threads */
  539. list = &module->module_object[RT_Object_Class_Thread].object_list;
  540. while (list->next != list)
  541. {
  542. object = rt_list_entry(list->next, struct rt_object, list);
  543. if (rt_object_is_systemobject(object) == RT_EOK)
  544. {
  545. /* detach static object */
  546. rt_thread_detach((rt_thread_t)object);
  547. }
  548. else
  549. {
  550. /* delete dynamic object */
  551. rt_thread_delete((rt_thread_t)object);
  552. }
  553. }
  554. #ifdef RT_USING_SEMAPHORE
  555. /* delete semaphores */
  556. list = &module->module_object[RT_Object_Class_Thread].object_list;
  557. while (list->next != list)
  558. {
  559. object = rt_list_entry(list->next, struct rt_object, list);
  560. if (rt_object_is_systemobject(object) == RT_EOK)
  561. {
  562. /* detach static object */
  563. rt_sem_detach((rt_sem_t)object);
  564. }
  565. else
  566. {
  567. /* delete dynamic object */
  568. rt_sem_delete((rt_sem_t)object);
  569. }
  570. }
  571. #endif
  572. #ifdef RT_USING_MUTEX
  573. /* delete mutexs*/
  574. list = &module->module_object[RT_Object_Class_Mutex].object_list;
  575. while (list->next != list)
  576. {
  577. object = rt_list_entry(list->next, struct rt_object, list);
  578. if (rt_object_is_systemobject(object) == RT_EOK)
  579. {
  580. /* detach static object */
  581. rt_mutex_detach((rt_mutex_t)object);
  582. }
  583. else
  584. {
  585. /* delete dynamic object */
  586. rt_mutex_delete((rt_mutex_t)object);
  587. }
  588. }
  589. #endif
  590. #ifdef RT_USING_EVENT
  591. /* delete mailboxs */
  592. list = &module->module_object[RT_Object_Class_Event].object_list;
  593. while (list->next != list)
  594. {
  595. object = rt_list_entry(list->next, struct rt_object, list);
  596. if (rt_object_is_systemobject(object) == RT_EOK)
  597. {
  598. /* detach static object */
  599. rt_event_detach((rt_event_t)object);
  600. }
  601. else
  602. {
  603. /* delete dynamic object */
  604. rt_event_delete((rt_event_t)object);
  605. }
  606. }
  607. #endif
  608. #ifdef RT_USING_MAILBOX
  609. /* delete mailboxs */
  610. list = &module->module_object[RT_Object_Class_MailBox].object_list;
  611. while (list->next != list)
  612. {
  613. object = rt_list_entry(list->next, struct rt_object, list);
  614. if (rt_object_is_systemobject(object) == RT_EOK)
  615. {
  616. /* detach static object */
  617. rt_mb_detach((rt_mailbox_t)object);
  618. }
  619. else
  620. {
  621. /* delete dynamic object */
  622. rt_mb_delete((rt_mailbox_t)object);
  623. }
  624. }
  625. #endif
  626. #ifdef RT_USING_MESSAGEQUEUE
  627. /* delete msgqueues */
  628. list = &module->module_object[RT_Object_Class_MessageQueue].object_list;
  629. while (list->next != list)
  630. {
  631. object = rt_list_entry(list->next, struct rt_object, list);
  632. if (rt_object_is_systemobject(object) == RT_EOK)
  633. {
  634. /* detach static object */
  635. rt_mq_detach((rt_mq_t)object);
  636. }
  637. else
  638. {
  639. /* delete dynamic object */
  640. rt_mq_delete((rt_mq_t)object);
  641. }
  642. }
  643. #endif
  644. #ifdef RT_USING_MEMPOOL
  645. /* delete mempools */
  646. list = &module->module_object[RT_Object_Class_MemPool].object_list;
  647. while (list->next != list)
  648. {
  649. object = rt_list_entry(list->next, struct rt_object, list);
  650. if (rt_object_is_systemobject(object) == RT_EOK)
  651. {
  652. /* detach static object */
  653. rt_mp_detach((rt_mp_t)object);
  654. }
  655. else
  656. {
  657. /* delete dynamic object */
  658. rt_mp_delete((rt_mp_t)object);
  659. }
  660. }
  661. #endif
  662. #ifdef RT_USING_DEVICE
  663. /* delete devices */
  664. list = &module->module_object[RT_Object_Class_Device].object_list;
  665. while (list->next != list)
  666. {
  667. object = rt_list_entry(list->next, struct rt_object, list);
  668. rt_device_unregister((rt_device_t)object);
  669. }
  670. #endif
  671. /* delete timers */
  672. list = &module->module_object[RT_Object_Class_Timer].object_list;
  673. while (list->next != list)
  674. {
  675. object = rt_list_entry(list->next, struct rt_object, list);
  676. if (rt_object_is_systemobject(object) == RT_EOK)
  677. {
  678. /* detach static object */
  679. rt_timer_detach((rt_timer_t)object);
  680. }
  681. else
  682. {
  683. /* delete dynamic object */
  684. rt_timer_delete((rt_timer_t)object);
  685. }
  686. }
  687. }
  688. if (module->page_cnt > 0)
  689. {
  690. int i;
  691. struct rt_page_info *page = (struct rt_page_info *)module->page_array;
  692. rt_kprintf("warning: some module memory still hasn't be freed\n");
  693. //list_memlist("tetris");
  694. for(i=0; i<module->page_cnt; i++)
  695. {
  696. rt_module_free_page(page[i].page_ptr, page[i].npage);
  697. }
  698. }
  699. /* release module space memory */
  700. rt_free(module->module_space);
  701. /* release module symbol table */
  702. for (i=0; i<module->nsym; i++) rt_free((void *)module->symtab[i].name);
  703. if (module->symtab != RT_NULL) rt_free(module->symtab);
  704. #ifdef RT_USING_HOOK
  705. if (rt_module_unload_hook != RT_NULL)
  706. {
  707. rt_module_unload_hook(module);
  708. }
  709. #endif
  710. rt_free(module->page_array);
  711. /* delete module object */
  712. rt_object_delete((rt_object_t)module);
  713. return RT_EOK;
  714. }
  715. /**
  716. * This function will find the specified module.
  717. *
  718. * @param name the name of module finding
  719. *
  720. * @return the module
  721. */
  722. rt_module_t rt_module_find(const char *name)
  723. {
  724. struct rt_object_information *information;
  725. struct rt_object *object;
  726. struct rt_list_node *node;
  727. extern struct rt_object_information rt_object_container[];
  728. RT_DEBUG_NOT_IN_INTERRUPT;
  729. /* enter critical */
  730. rt_enter_critical();
  731. /* try to find device object */
  732. information = &rt_object_container[RT_Object_Class_Module];
  733. for (node = information->object_list.next; node != &(information->object_list); node = node->next)
  734. {
  735. object = rt_list_entry(node, struct rt_object, list);
  736. if (rt_strncmp(object->name, name, RT_NAME_MAX) == 0)
  737. {
  738. /* leave critical */
  739. rt_exit_critical();
  740. return (rt_module_t)object;
  741. }
  742. }
  743. /* leave critical */
  744. rt_exit_critical();
  745. /* not found */
  746. return RT_NULL;
  747. }
  748. #ifdef RT_USING_SLAB
  749. /*
  750. * This function will allocate the numbers page with specified size
  751. * in page memory.
  752. *
  753. * @param size the size of memory to be allocated.
  754. * @note this function is used for RT-Thread Application Module
  755. */
  756. static void *rt_module_malloc_page(rt_size_t npages)
  757. {
  758. void *chunk;
  759. struct rt_page_info *page;
  760. chunk = rt_page_alloc(npages);
  761. if (chunk == RT_NULL) return RT_NULL;
  762. page = (struct rt_page_info *)rt_current_module->page_array;
  763. page[rt_current_module->page_cnt].page_ptr = chunk;
  764. page[rt_current_module->page_cnt].npage = npages;
  765. rt_current_module->page_cnt ++;
  766. RT_ASSERT(rt_current_module->page_cnt <= PAGE_COUNT_MAX);
  767. return chunk;
  768. }
  769. /*
  770. * This function will release the previously allocated memory page
  771. * by rt_malloc_page.
  772. *
  773. * @param page_ptr the page address to be released.
  774. * @param npages the number of page shall be released.
  775. *
  776. * @note this function is used for RT-Thread Application Module
  777. */
  778. static void rt_module_free_page(void *page_ptr, rt_size_t npages)
  779. {
  780. int i, index;
  781. struct rt_page_info *page;
  782. //rt_kprintf("rt_module_free_page 0x%x %d\n", page_ptr, npages);
  783. rt_page_free(page_ptr, npages);
  784. page = (struct rt_page_info *)rt_current_module->page_array;
  785. for (i=0; i<rt_current_module->page_cnt; i++)
  786. {
  787. if (page[i].page_ptr == page_ptr)
  788. {
  789. if (page[i].npage == npages + 1)
  790. {
  791. page[i].page_ptr += npages * RT_MM_PAGE_SIZE / sizeof(rt_uint32_t);
  792. }
  793. else if (page[i].npage == npages)
  794. {
  795. for (index=i; index<rt_current_module->page_cnt-1; index++)
  796. {
  797. page[index].page_ptr = page[index + 1].page_ptr;
  798. page[index].npage = page[index + 1].npage;
  799. }
  800. page[rt_current_module->page_cnt - 1].page_ptr = RT_NULL;
  801. page[rt_current_module->page_cnt - 1].npage = 0;
  802. }
  803. else RT_ASSERT(RT_FALSE);
  804. rt_current_module->page_cnt --;
  805. return;
  806. }
  807. }
  808. /* should not be get here */
  809. RT_ASSERT(RT_FALSE);
  810. }
  811. /*
  812. rt_module_malloc - allocate memory block in free list
  813. */
  814. void *rt_module_malloc(rt_size_t size)
  815. {
  816. struct rt_mem_head *b, *n, *up;
  817. struct rt_mem_head **prev;
  818. rt_uint32_t npage;
  819. rt_size_t nunits;
  820. RT_DEBUG_NOT_IN_INTERRUPT;
  821. nunits = (size + sizeof(struct rt_mem_head) -1)/sizeof(struct rt_mem_head) + 1;
  822. RT_ASSERT(size != 0);
  823. RT_ASSERT(nunits != 0);
  824. rt_sem_take(&mod_sem, RT_WAITING_FOREVER);
  825. for (prev = (struct rt_mem_head **)&rt_current_module->mem_list; (b = *prev) != RT_NULL; prev = &(b->next))
  826. {
  827. if (b->size > nunits)
  828. {
  829. /* split memory */
  830. n = b + nunits;
  831. n->next = b->next;
  832. n->size = b->size - nunits;
  833. b->size = nunits;
  834. *prev = n;
  835. //rt_kprintf("rt_module_malloc 0x%x, %d\n",b + 1, size);
  836. rt_sem_release(&mod_sem);
  837. //list_memlist("tetris");
  838. return (void *)(b + 1);
  839. }
  840. if (b->size == nunits)
  841. {
  842. /* this node fit, remove this node */
  843. *prev = b->next;
  844. rt_kprintf("rt_module_malloc 0x%x, %d\n",b + 1, size);
  845. //list_memlist("tetris");
  846. rt_sem_release(&mod_sem);
  847. return (void *)(b + 1);
  848. }
  849. }
  850. /* allocate pages from system heap */
  851. npage = (size + sizeof(struct rt_mem_head) + RT_MM_PAGE_SIZE - 1)/RT_MM_PAGE_SIZE;
  852. if ((up = (struct rt_mem_head *)rt_module_malloc_page(npage)) == RT_NULL) return RT_NULL;
  853. up->size = npage * RT_MM_PAGE_SIZE / sizeof(struct rt_mem_head);
  854. for (prev = (struct rt_mem_head **)&rt_current_module->mem_list; (b = *prev) != RT_NULL; prev = &(b->next))
  855. {
  856. if (b > up + up->size) break;
  857. }
  858. up->next = b;
  859. *prev = up;
  860. rt_sem_release(&mod_sem);
  861. return rt_module_malloc(size);
  862. }
  863. /*
  864. rt_module_free - free memory block in free list
  865. */
  866. void rt_module_free(rt_module_t module, void *addr)
  867. {
  868. struct rt_mem_head *b, *n, *r;
  869. struct rt_mem_head **prev;
  870. RT_DEBUG_NOT_IN_INTERRUPT;
  871. RT_ASSERT(addr);
  872. RT_ASSERT((((rt_uint32_t)addr) & (sizeof(struct rt_mem_head) -1)) == 0);
  873. //rt_kprintf("rt_module_free 0x%x\n", addr);
  874. rt_sem_take(&mod_sem, RT_WAITING_FOREVER);
  875. n = (struct rt_mem_head *)addr - 1;
  876. prev = (struct rt_mem_head **)&module->mem_list;
  877. while ((b = *prev) != RT_NULL)
  878. {
  879. RT_ASSERT(b->size > 0);
  880. RT_ASSERT(b > n || b + b->size <= n);
  881. if (b + b->size == n && ((rt_uint32_t)n % RT_MM_PAGE_SIZE != 0))
  882. {
  883. if (b + (b->size + n->size) == b->next)
  884. {
  885. b->size += b->next->size + n->size;
  886. b->next = b->next->next;
  887. }
  888. else b->size += n->size;
  889. if ((rt_uint32_t)b % RT_MM_PAGE_SIZE == 0)
  890. {
  891. int npage = b->size * sizeof(struct rt_page_info) / RT_MM_PAGE_SIZE;
  892. if (npage > 0)
  893. {
  894. if ((b->size * sizeof(struct rt_page_info) % RT_MM_PAGE_SIZE) != 0)
  895. {
  896. rt_size_t nunits = npage * RT_MM_PAGE_SIZE / sizeof(struct rt_mem_head);
  897. /* split memory */
  898. r = b + nunits;
  899. r->next = b->next;
  900. r->size = b->size - nunits;
  901. *prev = r;
  902. }
  903. else
  904. {
  905. *prev = b->next;
  906. }
  907. rt_module_free_page(b, npage);
  908. }
  909. }
  910. /* unlock */
  911. rt_sem_release(&mod_sem);
  912. ////list_memlist("tetris");
  913. return;
  914. }
  915. if (b == n + n->size)
  916. {
  917. n->size = b->size + n->size;
  918. n->next = b->next;
  919. if ((rt_uint32_t)n % RT_MM_PAGE_SIZE == 0)
  920. {
  921. int npage = n->size * sizeof(struct rt_page_info) / RT_MM_PAGE_SIZE;
  922. if (npage > 0)
  923. {
  924. if ((n->size * sizeof(struct rt_page_info) % RT_MM_PAGE_SIZE) != 0)
  925. {
  926. rt_size_t nunits = npage * RT_MM_PAGE_SIZE / sizeof(struct rt_mem_head);
  927. /* split memory */
  928. r = n + nunits;
  929. r->next = n->next;
  930. r->size = n->size - nunits;
  931. *prev = r;
  932. }
  933. else *prev = n->next;
  934. rt_module_free_page(n, npage);
  935. }
  936. }
  937. else
  938. {
  939. *prev = n;
  940. }
  941. /* unlock */
  942. rt_sem_release(&mod_sem);
  943. //list_memlist("tetris");
  944. return;
  945. }
  946. if (b > n + n->size) break;
  947. prev = &(b->next);
  948. }
  949. if ((rt_uint32_t)n % RT_MM_PAGE_SIZE == 0)
  950. {
  951. int npage = n->size * sizeof(struct rt_page_info) / RT_MM_PAGE_SIZE;
  952. if (npage > 0)
  953. {
  954. rt_module_free_page(n, npage);
  955. if (n->size % RT_MM_PAGE_SIZE != 0)
  956. {
  957. rt_size_t nunits = npage * RT_MM_PAGE_SIZE / sizeof(struct rt_mem_head);
  958. /* split memory */
  959. r = n + nunits;
  960. r->next = b;
  961. r->size = n->size - nunits;
  962. *prev = r;
  963. }
  964. else
  965. {
  966. *prev = b;
  967. }
  968. }
  969. }
  970. else
  971. {
  972. n->next = b;
  973. *prev = n;
  974. }
  975. /* unlock */
  976. rt_sem_release(&mod_sem);
  977. //list_memlist("tetris");
  978. }
  979. /*
  980. rt_module_realloc - realloc memory block in free list
  981. */
  982. void *rt_module_realloc(void *ptr, rt_size_t size)
  983. {
  984. struct rt_mem_head *b, *p, *prev, *tmpp;
  985. rt_size_t nunits;
  986. RT_DEBUG_NOT_IN_INTERRUPT;
  987. if (!ptr) return rt_module_malloc(size);
  988. if (size == 0)
  989. {
  990. rt_module_free(rt_current_module, ptr);
  991. return RT_NULL;
  992. }
  993. nunits = (size + sizeof(struct rt_mem_head) - 1) / sizeof(struct rt_mem_head) + 1;
  994. b = (struct rt_mem_head *)ptr - 1;
  995. if (nunits <= b->size)
  996. {
  997. /* new size is smaller or equal then before */
  998. if (nunits == b->size) return ptr;
  999. else
  1000. {
  1001. p = b + nunits;
  1002. p->size = b->size - nunits;
  1003. b->size = nunits;
  1004. rt_module_free(rt_current_module, (void *)(p + 1));
  1005. return (void *)(b + 1);
  1006. }
  1007. }
  1008. else
  1009. {
  1010. /* more space then required */
  1011. prev = (struct rt_mem_head *)rt_current_module->mem_list;
  1012. for (p = prev->next; p != (b->size + b) && p != RT_NULL; prev = p, p = p->next) break;
  1013. /* available block after ap in freelist */
  1014. if (p != RT_NULL && (p->size >= (nunits - (b->size))) && p == (b + b->size))
  1015. {
  1016. /* perfect match */
  1017. if (p->size == (nunits - (b->size)))
  1018. {
  1019. b->size = nunits;
  1020. prev->next = p->next;
  1021. }
  1022. else /* more space then required, split block*/
  1023. {
  1024. /* pointer to old header */
  1025. tmpp = p;
  1026. p = b + nunits;
  1027. /* restoring old pointer */
  1028. p->next = tmpp->next;
  1029. /* new size for p */
  1030. p->size = tmpp->size + b->size - nunits;
  1031. b->size = nunits;
  1032. prev->next = p;
  1033. }
  1034. rt_current_module->mem_list = (void *)prev;
  1035. return (void *)(b + 1);
  1036. }
  1037. else /* allocate new memory and copy old data */
  1038. {
  1039. if ((p = rt_module_malloc(size)) == RT_NULL) return RT_NULL;
  1040. rt_memmove(p, (b+1), ((b->size) * sizeof(struct rt_mem_head)));
  1041. rt_module_free(rt_current_module, (void *)(b + 1));
  1042. return (void *)(p);
  1043. }
  1044. }
  1045. }
  1046. #endif
  1047. #ifdef RT_USING_FINSH
  1048. #include <finsh.h>
  1049. void list_memlist(const char* name)
  1050. {
  1051. rt_module_t module;
  1052. struct rt_mem_head **prev;
  1053. struct rt_mem_head *b;
  1054. module = rt_module_find(name);
  1055. if (module == RT_NULL) return;
  1056. for (prev = (struct rt_mem_head **)&module->mem_list; (b = *prev) != RT_NULL; prev = &(b->next))
  1057. {
  1058. rt_kprintf("0x%x--%d\n", b, b->size * sizeof(struct rt_mem_head));
  1059. }
  1060. }
  1061. FINSH_FUNCTION_EXPORT(list_memlist, list module free memory information)
  1062. void list_mempage(const char *name)
  1063. {
  1064. rt_module_t module;
  1065. struct rt_page_info *page;
  1066. int i;
  1067. module = rt_module_find(name);
  1068. if (module == RT_NULL) return;
  1069. page = (struct rt_page_info*)module->page_array;
  1070. for (i=0; i<module->page_cnt; i++)
  1071. {
  1072. rt_kprintf("0x%x--%d\n", page[i].page_ptr, page[i].npage);
  1073. }
  1074. }
  1075. FINSH_FUNCTION_EXPORT(list_mempage, list module using memory page information)
  1076. #endif
  1077. #endif