Lines Matching full:result

214   etree_value_type result;  in fold_unary()  local
216 result = exp_fold_tree (tree->unary.child, in fold_unary()
219 if (result.valid_p) in fold_unary()
225 result = new_rel_from_section (align_n (dot, result.value), in fold_unary()
228 result.valid_p = FALSE; in fold_unary()
234 result.value += result.section->bfd_section->vma; in fold_unary()
235 result.section = abs_output_section; in fold_unary()
238 result.valid_p = FALSE; in fold_unary()
242 make_abs (&result); in fold_unary()
243 result.value = ~result.value; in fold_unary()
247 make_abs (&result); in fold_unary()
248 result.value = !result.value; in fold_unary()
252 make_abs (&result); in fold_unary()
253 result.value = -result.value; in fold_unary()
260 make_abs (&result); in fold_unary()
261 result.value = align_n (dot, result.value); in fold_unary()
264 result.valid_p = FALSE; in fold_unary()
277 exp_data_seg.end = result.value; in fold_unary()
281 result.valid_p = FALSE; in fold_unary()
290 return result; in fold_unary()
300 etree_value_type result; in fold_binary() local
302 result = exp_fold_tree (tree->binary.lhs, current_section, in fold_binary()
304 if (result.valid_p) in fold_binary()
320 || (result.section == abs_output_section in fold_binary()
329 other.value = result.value + other.value; in fold_binary()
331 other.value = result.value - other.value; in fold_binary()
335 else if (result.section != other.section in fold_binary()
338 make_abs (&result); in fold_binary()
347 result.value = ((bfd_signed_vma) result.value in fold_binary()
354 result.value = ((bfd_signed_vma) result.value in fold_binary()
358 #define BOP(x,y) case x : result.value = result.value y other.value; break; in fold_binary()
377 if (result.value < other.value) in fold_binary()
378 result = other; in fold_binary()
382 if (result.value > other.value) in fold_binary()
383 result = other; in fold_binary()
387 result.value = align_n (result.value, other.value); in fold_binary()
397 bfd_vma maxpage = result.value; in fold_binary()
399 result.value = align_n (dot, maxpage); in fold_binary()
402 result.value += dot & (maxpage - 1); in fold_binary()
406 exp_data_seg.base = result.value; in fold_binary()
411 result.value += (dot + other.value - 1) in fold_binary()
415 result.valid_p = FALSE; in fold_binary()
424 result.valid_p = FALSE; in fold_binary()
428 return result; in fold_binary()
438 etree_value_type result; in fold_trinary() local
440 result = exp_fold_tree (tree->trinary.cond, current_section, in fold_trinary()
442 if (result.valid_p) in fold_trinary()
443 result = exp_fold_tree ((result.value in fold_trinary()
449 return result; in fold_trinary()
458 etree_value_type result; in fold_name() local
460 result.valid_p = FALSE; in fold_name()
466 result = new_abs (bfd_sizeof_headers (output_bfd, in fold_name()
481 result.value = (h != NULL in fold_name()
487 result.section = abs_output_section; in fold_name()
488 result.valid_p = TRUE; in fold_name()
495 result = new_rel_from_section (dot, current_section); in fold_name()
510 result = new_abs (h->u.def.value); in fold_name()
530 result = new_rel ((h->u.def.value in fold_name()
556 result = new_rel (0, NULL, os); in fold_name()
569 result = new_rel (0, NULL, os); in fold_name()
571 result = exp_fold_tree_no_dot (os->load_base, in fold_name()
586 result = new_abs (os->bfd_section->_raw_size / opb); in fold_name()
595 return result; in fold_name()
605 etree_value_type result; in exp_fold_tree() local
609 result.valid_p = FALSE; in exp_fold_tree()
610 return result; in exp_fold_tree()
616 result = new_rel (tree->value.value, tree->value.str, current_section); in exp_fold_tree()
621 result.valid_p = FALSE; in exp_fold_tree()
623 result = new_rel ((tree->rel.value in exp_fold_tree()
631 result = exp_fold_tree (tree->assert_s.child, in exp_fold_tree()
634 if (result.valid_p) in exp_fold_tree()
636 if (! result.value) in exp_fold_tree()
638 return result; in exp_fold_tree()
643 result = fold_unary (tree, current_section, allocation_done, in exp_fold_tree()
648 result = fold_binary (tree, current_section, allocation_done, in exp_fold_tree()
653 result = fold_trinary (tree, current_section, allocation_done, in exp_fold_tree()
669 result = exp_fold_tree (tree->assign.src, in exp_fold_tree()
673 if (! result.valid_p) in exp_fold_tree()
683 nextdot = (result.value in exp_fold_tree()
697 result = exp_fold_tree (tree->assign.src, in exp_fold_tree()
700 if (result.valid_p) in exp_fold_tree()
731 h->u.def.value = result.value; in exp_fold_tree()
732 h->u.def.section = result.section->bfd_section; in exp_fold_tree()
741 result = fold_name (tree, current_section, allocation_done, dot); in exp_fold_tree()
749 return result; in exp_fold_tree()
851 if (exp_fold_tree_no_dot (&value, &result)) in exp_assop()
852 return exp_intop (result); in exp_assop()