Home | History | Annotate | Download | only in bfd

Lines Matching refs:sinfo

2396   struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
2400 if (sinfo == NULL)
2402 sinfo = alloc_stack_info (sec, 20);
2403 if (sinfo == NULL)
2420 for (i = sinfo->num_fun; --i >= 0; )
2421 if (sinfo->fun[i].lo <= off)
2428 if (sinfo->fun[i].lo == off)
2431 if (global && !sinfo->fun[i].global)
2433 sinfo->fun[i].global = true;
2434 sinfo->fun[i].u.h = sym_h;
2437 sinfo->fun[i].is_func = true;
2438 return &sinfo->fun[i];
2441 else if (sinfo->fun[i].hi > off && size == 0)
2442 return &sinfo->fun[i];
2445 if (sinfo->num_fun >= sinfo->max_fun)
2450 old += (sinfo->max_fun - 1) * sizeof (struct function_info);
2451 sinfo->max_fun += 20 + (sinfo->max_fun >> 1);
2452 amt += (sinfo->max_fun - 1) * sizeof (struct function_info);
2453 sinfo = bfd_realloc (sinfo, amt);
2454 if (sinfo == NULL)
2456 memset ((char *) sinfo + old, 0, amt - old);
2457 sec_data->u.i.stack_info = sinfo;
2460 if (++i < sinfo->num_fun)
2461 memmove (&sinfo->fun[i + 1], &sinfo->fun[i],
2462 (sinfo->num_fun - i) * sizeof (sinfo->fun[i]));
2463 sinfo->fun[i].is_func = is_func;
2464 sinfo->fun[i].global = global;
2465 sinfo->fun[i].sec = sec;
2467 sinfo->fun[i].u.h = sym_h;
2469 sinfo->fun[i].u.sym = sym_h;
2470 sinfo->fun[i].lo = off;
2471 sinfo->fun[i].hi = off + size;
2472 sinfo->fun[i].lr_store = -1;
2473 sinfo->fun[i].sp_adjust = -1;
2474 sinfo->fun[i].stack = -find_function_stack_adjust (sec, off,
2475 &sinfo->fun[i].lr_store,
2476 &sinfo->fun[i].sp_adjust);
2477 sinfo->num_fun += 1;
2478 return &sinfo->fun[i];
2556 struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
2560 if (sinfo == NULL)
2563 for (i = 1; i < sinfo->num_fun; i++)
2564 if (sinfo->fun[i - 1].hi > sinfo->fun[i].lo)
2567 const char *f1 = func_name (&sinfo->fun[i - 1]);
2568 const char *f2 = func_name (&sinfo->fun[i]);
2572 sinfo->fun[i - 1].hi = sinfo->fun[i].lo;
2574 else if (insns_at_end (&sinfo->fun[i - 1], sinfo->fun[i].lo))
2577 if (sinfo->num_fun == 0)
2581 if (sinfo->fun[0].lo != 0)
2583 if (sinfo->fun[sinfo->num_fun - 1].hi > sec->size)
2585 const char *f1 = func_name (&sinfo->fun[sinfo->num_fun - 1]);
2588 sinfo->fun[sinfo->num_fun - 1].hi = sec->size;
2590 else if (insns_at_end (&sinfo->fun[sinfo->num_fun - 1], sec->size))
2603 struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
2607 hi = sinfo->num_fun;
2611 if (offset < sinfo->fun[mid].lo)
2613 else if (offset >= sinfo->fun[mid].hi)
2616 return &sinfo->fun[mid];
2909 struct spu_elf_stack_info *sinfo;
2951 && (sinfo = sec_data->u.i.stack_info) != NULL
2952 && sinfo->num_fun != 0)
2953 fun_start = &sinfo->fun[sinfo->num_fun - 1];
3159 struct spu_elf_stack_info *sinfo;
3162 sinfo = sec_data->u.i.stack_info;
3163 if (sinfo != NULL && sinfo->num_fun != 0)
3168 for (fun_idx = sinfo->num_fun; --fun_idx >= 0; )
3170 sinfo->fun[fun_idx].hi = hi;
3171 hi = sinfo->fun[fun_idx].lo;
3174 sinfo->fun[0].lo = 0;
3226 struct spu_elf_stack_info *sinfo;
3229 && (sinfo = sec_data->u.i.stack_info) != NULL)
3232 for (i = 0; i < sinfo->num_fun; ++i)
3233 if (!root_only || !sinfo->fun[i].non_root)
3234 if (!doit (&sinfo->fun[i], info, param))
3701 struct spu_elf_stack_info *sinfo;
3706 && (sinfo = sec_data->u.i.stack_info) != NULL)
3709 for (i = 0; i < sinfo->num_fun; ++i)
3710 delta -= sinfo->fun[i].call_count;
3714 && (sinfo = sec_data->u.i.stack_info) != NULL)
3717 for (i = 0; i < sinfo->num_fun; ++i)
3718 delta += sinfo->fun[i].call_count;
3776 struct spu_elf_stack_info *sinfo;
3788 && (sinfo = sec_data->u.i.stack_info) != NULL)
3793 for (k = 0; k < sinfo->num_fun; ++k)
3794 for (call = sinfo->fun[k].call_list; call; call = call->next)
3828 && (sinfo = sec_data->u.i.stack_info) != NULL)
3833 for (k = 0; k < sinfo->num_fun; ++k)
3834 for (call = sinfo->fun[k].call_list;
3935 struct spu_elf_stack_info *sinfo;
3938 && (sinfo = sec_data->u.i.stack_info) != NULL)
3941 for (i = 0; i < sinfo->num_fun; ++i)
3942 if (!collect_overlays (&sinfo->fun[i], info, ovly_sections))
4079 struct spu_elf_stack_info *sinfo = sec_data->u.i.stack_info;
4083 for (k = 0; k < sinfo->num_fun; ++k)
4084 for (call = sinfo->fun[k].call_list; call != NULL; call = call->next)
4441 struct spu_elf_stack_info *sinfo;
4488 sinfo = sec_data->u.i.stack_info;
4489 for (k = 0; k < (unsigned) sinfo->num_fun; ++k)
4490 for (call = sinfo->fun[k].call_list; call; call = call->next)