Subversion Repositories HelenOS

Rev

Rev 3562 | Go to most recent revision | Blame | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2008 Jiri Svoboda
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. /** @addtogroup rtld rtld
  30.  * @brief
  31.  * @{
  32.  */
  33. /**
  34.  * @file
  35.  */
  36.  
  37. #include <stdio.h>
  38. #include <stdlib.h>
  39. #include <unistd.h>
  40. #include <fcntl.h>
  41. #include <libadt/list.h>
  42. #include <loader/pcb.h>
  43.  
  44. #include <rtld.h>
  45. #include <dynamic.h>
  46. #include <elf_load.h>
  47. #include <rtld_arch.h>
  48. #include <module.h>
  49.  
  50. /** (Eagerly) process all relocation tables in a module.
  51.  *
  52.  * Currently works as if LD_BIND_NOW was specified.
  53.  */
  54. void module_process_relocs(module_t *m)
  55. {
  56.     DPRINTF("module_process_relocs('%s')\n", m->dyn.soname);
  57.     if (m->dyn.plt_rel == DT_REL) {
  58.         if (m->dyn.rel != NULL)
  59.             rel_table_process(m, m->dyn.rel, m->dyn.rel_sz);
  60.         /* FIXME: this seems wrong */
  61.         if (m->dyn.jmp_rel != NULL)
  62.             rel_table_process(m, m->dyn.jmp_rel, m->dyn.plt_rel_sz);
  63.     } else { /* (m->dyn.plt_rel == DT_RELA) */
  64.         DPRINTF("table type DT_RELA\n");
  65.         if (m->dyn.rela != NULL) {
  66.             DPRINTF("non-empty\n");
  67.             rela_table_process(m, m->dyn.rela, m->dyn.rela_sz);
  68.         }
  69.     }
  70. }
  71.  
  72. /** Find module structure by soname/pathname.
  73.  *
  74.  * Used primarily to see if a module has already been loaded.
  75.  * Modules are compared according to their soname, i.e. possible
  76.  * path components are ignored.
  77.  */
  78. module_t *module_find(char *name)
  79. {
  80.     link_t *head = &runtime_env->modules_head;
  81.  
  82.     link_t *cur;
  83.     module_t *m;
  84.     char *p, *soname;
  85.  
  86.     printf("got head ptr\n");
  87.     printf(" = 0x%lx\n", (long) head);
  88.  
  89.     /*
  90.      * If name contains slashes, treat it as a pathname and
  91.      * construct soname by chopping off the path. Otherwise
  92.      * treat it as soname.
  93.      */
  94.     p = strrchr(name, '/');
  95.     soname = p ? (p + 1) : name;
  96.  
  97.     printf("did strrchr. soname='%s'\n", soname);
  98.    
  99.     /* Traverse list of all modules. Not extremely fast, but simple */
  100.     for (cur = head->next; cur != head; cur = cur->next) {
  101.         printf("get_instance...\n");
  102.         m = list_get_instance(cur, module_t, modules_link);
  103.         if (strcmp(m->dyn.soname, soname) == 0) {
  104.             return m; /* Found */
  105.         }
  106.     }
  107.    
  108.     return NULL; /* Not found */
  109. }
  110.  
  111. #define NAME_BUF_SIZE 64
  112.  
  113. /** Load a module.
  114.  *
  115.  * Currently this trivially tries to load '/<name>'.
  116.  */
  117. module_t *module_load(char *name)
  118. {
  119.     elf_info_t info;
  120.     char name_buf[NAME_BUF_SIZE];
  121.     module_t *m;
  122.     int rc;
  123.    
  124.     m = malloc(sizeof(module_t));
  125.     if (!m) {
  126.         printf("malloc failed\n");
  127.         exit(1);
  128.     }
  129.  
  130.     if (strlen(name) > NAME_BUF_SIZE - 2) {
  131.         printf("soname too long. increase NAME_BUF_SIZE\n");
  132.         exit(1);
  133.     }
  134.  
  135.     /* Prepend soname with '/lib/' */
  136.     name_buf[0] = '/';
  137.     strcpy(name_buf, "/lib/");
  138.     strcpy(name_buf + 5, name);
  139.  
  140.     /* FIXME: need to vary bias / allocate address space */
  141.     m->bias = 0x20000;
  142.     DPRINTF("filename:'%s'\n", name_buf);
  143.  
  144.     rc = elf_load_file(name_buf, m->bias, ELDF_RW, &info);
  145.     if (rc < 0) {
  146.         printf("Failed to load '%s'\n", name_buf);
  147.         exit(1);
  148.     }
  149.  
  150.     DPRINTF("parse dynamic section\n");
  151.     /* Parse ELF .dynamic section. Store info to m->dyn. */
  152.     dynamic_parse(info.dynamic, m->bias, &m->dyn);
  153.  
  154.     /* Insert into the list of loaded modules */
  155.     list_append(&m->modules_link, &runtime_env->modules_head);
  156.  
  157.     return m;
  158. }
  159.  
  160. /** Load all modules on which m (transitively) depends.
  161.  */
  162. void module_load_deps(module_t *m)
  163. {
  164.     elf_dyn_t *dp;
  165.     char *dep_name;
  166.     module_t *dm;
  167.     size_t n, i;
  168.  
  169.     /* Count direct dependencies */
  170.    
  171.     dp = m->dyn.dynamic;
  172.     n = 0;
  173.  
  174.     while (dp->d_tag != DT_NULL) {
  175.         if (dp->d_tag == DT_NEEDED) ++n;
  176.         ++dp;
  177.     }
  178.  
  179.     /* Create an array of pointers to direct dependencies */
  180.  
  181.     m->n_deps = n;
  182.  
  183.     if (n == 0) {
  184.         /* There are no dependencies, so we are done. */
  185.         m->deps = NULL;
  186.         return;
  187.     }
  188.  
  189.     m->deps = malloc(n * sizeof(module_t *));
  190.     if (!m->deps) {
  191.         printf("malloc failed\n");
  192.         exit(1);
  193.     }
  194.  
  195.     i = 0; /* Current dependency index */
  196.     dp = m->dyn.dynamic;
  197.  
  198.     while (dp->d_tag != DT_NULL) {
  199.         if (dp->d_tag == DT_NEEDED) {
  200.             dep_name = m->dyn.str_tab + dp->d_un.d_val;
  201.  
  202.             DPRINTF("%s needs %s\n", m->dyn.soname, dep_name);
  203.             dm = module_find(dep_name);
  204.             if (!dm) {
  205.                 dm = module_load(dep_name);
  206.                 module_load_deps(dm);
  207.             }
  208.  
  209.             /* Save into deps table */
  210.             m->deps[i++] = dm;
  211.         }
  212.         ++dp;
  213.     }
  214. }
  215.  
  216. void modules_process_relocs(void)
  217. {
  218.     link_t *head = &runtime_env->modules_head;
  219.  
  220.     link_t *cur;
  221.     module_t *m;
  222.  
  223.     for (cur = head->next; cur != head; cur = cur->next) {
  224.         m = list_get_instance(cur, module_t, modules_link);
  225.  
  226.         /* Skip rtld, since it has already been processed */
  227.         if (m != &runtime_env->rtld) {
  228.             module_process_relocs(m);
  229.         }
  230.     }
  231. }
  232.  
  233. /** Clear BFS tags of all modules.
  234.  */
  235. void modules_untag(void)
  236. {
  237.     link_t *head = &runtime_env->modules_head;
  238.  
  239.     link_t *cur;
  240.     module_t *m;
  241.  
  242.     for (cur = head->next; cur != head; cur = cur->next) {
  243.         m = list_get_instance(cur, module_t, modules_link);
  244.         m->bfs_tag = false;
  245.     }
  246. }
  247.  
  248. /** @}
  249.  */
  250.