Home | History | Annotate | Download | only in bfd

Lines Matching defs:sinfo

2386   struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
2390 if (sinfo == NULL)
2392 sinfo = alloc_stack_info (sec, 20);
2393 if (sinfo == NULL)
2410 for (i = sinfo->num_fun; --i >= 0; )
2411 if (sinfo->fun[i].lo <= off)
2418 if (sinfo->fun[i].lo == off)
2421 if (global && !sinfo->fun[i].global)
2423 sinfo->fun[i].global = TRUE;
2424 sinfo->fun[i].u.h = sym_h;
2427 sinfo->fun[i].is_func = TRUE;
2428 return &sinfo->fun[i];
2431 else if (sinfo->fun[i].hi > off && size == 0)
2432 return &sinfo->fun[i];
2435 if (sinfo->num_fun >= sinfo->max_fun)
2440 old += (sinfo->max_fun - 1) * sizeof (struct function_info);
2441 sinfo->max_fun += 20 + (sinfo->max_fun >> 1);
2442 amt += (sinfo->max_fun - 1) * sizeof (struct function_info);
2443 sinfo = bfd_realloc (sinfo, amt);
2444 if (sinfo == NULL)
2446 memset ((char *) sinfo + old, 0, amt - old);
2447 sec_data->u.i.stack_info = sinfo;
2450 if (++i < sinfo->num_fun)
2451 memmove (&sinfo->fun[i + 1], &sinfo->fun[i],
2452 (sinfo->num_fun - i) * sizeof (sinfo->fun[i]));
2453 sinfo->fun[i].is_func = is_func;
2454 sinfo->fun[i].global = global;
2455 sinfo->fun[i].sec = sec;
2457 sinfo->fun[i].u.h = sym_h;
2459 sinfo->fun[i].u.sym = sym_h;
2460 sinfo->fun[i].lo = off;
2461 sinfo->fun[i].hi = off + size;
2462 sinfo->fun[i].lr_store = -1;
2463 sinfo->fun[i].sp_adjust = -1;
2464 sinfo->fun[i].stack = -find_function_stack_adjust (sec, off,
2465 &sinfo->fun[i].lr_store,
2466 &sinfo->fun[i].sp_adjust);
2467 sinfo->num_fun += 1;
2468 return &sinfo->fun[i];
2546 struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
2550 if (sinfo == NULL)
2553 for (i = 1; i < sinfo->num_fun; i++)
2554 if (sinfo->fun[i - 1].hi > sinfo->fun[i].lo)
2557 const char *f1 = func_name (&sinfo->fun[i - 1]);
2558 const char *f2 = func_name (&sinfo->fun[i]);
2561 sinfo->fun[i - 1].hi = sinfo->fun[i].lo;
2563 else if (insns_at_end (&sinfo->fun[i - 1], sinfo->fun[i].lo))
2566 if (sinfo->num_fun == 0)
2570 if (sinfo->fun[0].lo != 0)
2572 if (sinfo->fun[sinfo->num_fun - 1].hi > sec->size)
2574 const char *f1 = func_name (&sinfo->fun[sinfo->num_fun - 1]);
2577 sinfo->fun[sinfo->num_fun - 1].hi = sec->size;
2579 else if (insns_at_end (&sinfo->fun[sinfo->num_fun - 1], sec->size))
2592 struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
2596 hi = sinfo->num_fun;
2600 if (offset < sinfo->fun[mid].lo)
2602 else if (offset >= sinfo->fun[mid].hi)
2605 return &sinfo->fun[mid];
2896 struct spu_elf_stack_info *sinfo;
2938 && (sinfo = sec_data->u.i.stack_info) != NULL
2939 && sinfo->num_fun != 0)
2940 fun_start = &sinfo->fun[sinfo->num_fun - 1];
3149 struct spu_elf_stack_info *sinfo;
3152 sinfo = sec_data->u.i.stack_info;
3153 if (sinfo != NULL && sinfo->num_fun != 0)
3158 for (fun_idx = sinfo->num_fun; --fun_idx >= 0; )
3160 sinfo->fun[fun_idx].hi = hi;
3161 hi = sinfo->fun[fun_idx].lo;
3164 sinfo->fun[0].lo = 0;
3216 struct spu_elf_stack_info *sinfo;
3219 && (sinfo = sec_data->u.i.stack_info) != NULL)
3222 for (i = 0; i < sinfo->num_fun; ++i)
3223 if (!root_only || !sinfo->fun[i].non_root)
3224 if (!doit (&sinfo->fun[i], info, param))
3690 struct spu_elf_stack_info *sinfo;
3695 && (sinfo = sec_data->u.i.stack_info) != NULL)
3698 for (i = 0; i < sinfo->num_fun; ++i)
3699 delta -= sinfo->fun[i].call_count;
3703 && (sinfo = sec_data->u.i.stack_info) != NULL)
3706 for (i = 0; i < sinfo->num_fun; ++i)
3707 delta += sinfo->fun[i].call_count;
3765 struct spu_elf_stack_info *sinfo;
3777 && (sinfo = sec_data->u.i.stack_info) != NULL)
3782 for (k = 0; k < sinfo->num_fun; ++k)
3783 for (call = sinfo->fun[k].call_list; call; call = call->next)
3817 && (sinfo = sec_data->u.i.stack_info) != NULL)
3822 for (k = 0; k < sinfo->num_fun; ++k)
3823 for (call = sinfo->fun[k].call_list;
3924 struct spu_elf_stack_info *sinfo;
3927 && (sinfo = sec_data->u.i.stack_info) != NULL)
3930 for (i = 0; i < sinfo->num_fun; ++i)
3931 if (!collect_overlays (&sinfo->fun[i], info, ovly_sections))
4068 struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
4072 for (k = 0; k < sinfo->num_fun; ++k)
4073 for (call = sinfo->fun[k].call_list; call != NULL; call = call->next)
4427 struct spu_elf_stack_info *sinfo;
4474 sinfo = sec_data->u.i.stack_info;
4475 for (k = 0; k < (unsigned) sinfo->num_fun; ++k)
4476 for (call = sinfo->fun[k].call_list; call; call = call->next)