WebSVN – tendra.SVN – Diff – /trunk/src/installers/common/dwarf2/dw2_locdata.c

+/*
+ * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 3. Neither the name of The TenDRA Project nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific, prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
+ * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
+ * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * $Id$
+ */
 /*
     		 Crown Copyright (c) 1998
     This TenDRA(r) Computer Program is subject to Copyright
     owned by the United Kingdom Secretary of State for Defence
 #include "externs.h"
 #include "dg_aux.h"
 #include "dw2_locdata.h"
-/*	Location list information is collected for each object, held via
+/* Location list information is collected for each object, held via
-	fields of the 'obtain_value' exp (which is a hold_tag). last is set
+   fields of the 'obtain_value' exp (which is a hold_tag). last is set if the
-	if the object is master of a new location. bro is used to hold
+   object is master of a new location. bro is used to hold references to other
-	references to other objects that share this location (as a bro list).
+   objects that share this location (as a bro list).  no is label for shared
-	no is label for shared location set.
-		pt holds other more temporary uses (via ll_item).
+   location set.  pt holds other more temporary uses (via ll_item).
 */
 #define	LOp_Non_Current 1
 #define	LOp_Locked	2
 #define	LOp_Const	3
 #define	LOp_Shared	4
 #define	LOp_Portion	5
-typedef enum
+typedef enum {
-{
-  LL_OPTLOCK = 1,
+	LL_OPTLOCK = 1,
-  LL_CONST,
+	LL_CONST,
-  LL_RET,
+	LL_RET,
-  LL_REGSHARE,
+	LL_REGSHARE,
-  LL_MASTERSHARE
+	LL_MASTERSHARE
 } loclist_key;
-typedef struct rs_s
+typedef struct rs_s {
-{
-  long			start;
+	long		start;
-  long			end;
+	long		end;
-  long			share;
+	long		share;
-  dg_name		nm;
+	dg_name		nm;
-  int			reg;
+	int		reg;
-  struct rs_s *		next_share;
+	struct rs_s	*next_share;
-  struct rs_s *		next_loc;
+	struct rs_s	*next_loc;
-} * regshare_item;
+} *regshare_item;
-typedef struct rsl_s
-{
-  dg_name		alloc;
-  int			reg;
-  regshare_item		items;
-  struct rsl_s *	next;
-} * regshare_list;
-typedef struct ll_s
-{
-  int			key	: 8;
-  int			open	: 1;
-  int			has_inner : 1;
-  union
-  {
-    dg_info		d;
-    retrec *		r;
-    regshare_item	l;
-  } u;
-  struct ll_s *		next;
-  struct ll_s *		inner;
-} * ll_item;
-static ll_item * ll_root
-    PROTO_N ( (nm) )
-    PROTO_T ( dg_name nm )
-{
-  exp x = nm->data.n_obj.obtain_val;
-  exp * ref = &(pt(x));
-  return (ll_item *)((void *)ref);
-}
-static ll_item new_ll_item
-    PROTO_N ( (k, o) )
-    PROTO_T ( loclist_key k X int o )
-{
-  ll_item ans = (ll_item) xmalloc (sizeof (struct ll_s));
-  ans->key = k;
-  ans->open = ans->has_inner = o;
-  ans->next = (ll_item)0;
-  ans->inner = (ll_item)0;
-  return ans;
-}
-static regshare_list all_regshares = (regshare_list)0;
-void * dw_new_regshare
+typedef struct rsl_s {
+	dg_name		alloc;
+	int		reg;
-    PROTO_N ( (nm, reg) )
+	regshare_item	items;
+	struct rsl_s	*next;
-    PROTO_T ( dg_name nm X int reg )
+} *regshare_list;
-{
-  regshare_list ans = (regshare_list) xmalloc (sizeof (struct rsl_s));
+typedef struct ll_s {
+	int		key:8;
+	int		open:1;
-  ans->alloc = nm;
+	int		has_inner:1;
+	union {
+		dg_info		d;
-  ans->reg = reg;
+		retrec		*r;
-  ans->items = (regshare_item)0;
+		regshare_item	l;
+	} u;
-  ans->next = all_regshares;
+	struct ll_s	*next;
-  all_regshares = ans;
+	struct ll_s	*inner;
-  return (void *)ans;		/* actual type local to this file */
-}
+} *ll_item;
-void dw_add_regshare
+static ll_item *
-    PROTO_N ( (w, nm, start, end) )
+ll_root(dg_name nm)
-    PROTO_T ( void * w X dg_name nm X long start X long end )
+{
-  regshare_list holder = (regshare_list)w;
-  regshare_item item = (regshare_item) xmalloc (sizeof (struct rs_s));
-  item->start = start;
+	exp x = nm->data.n_obj.obtain_val;
-  item->end = end;
+	exp * ref = & (pt(x));
-  item->share = 0;
-  item->nm = nm;
-  item->next_share = holder->items;
-  item->next_loc = (regshare_item)0;
+	return(ll_item *)((void *)ref);
-  holder->items = item;
-  return;
+}
+static ll_item
-obj_list * local_objects = (obj_list *)0;
+new_ll_item(loclist_key k, int o)
+{
-static void check_taggable
+	ll_item ans = (ll_item)xmalloc(sizeof(struct ll_s));
-    PROTO_N ( (nm) )
+	ans->key = k;
-    PROTO_T ( dg_name nm )
+	ans->open = ans->has_inner = o;
-{
-  if (!nm->mor || !nm->mor->this_tag)
+	ans->next = (ll_item)0;
-    IGNORE f_dg_tag_name (gen_tg_tag (), nm);
+	ans->inner = (ll_item)0;
-  return;
+	return ans;
 }
+static regshare_list all_regshares = (regshare_list)0;
-void set_locdata
+void *
-    PROTO_N ( (this_obl) )
-    PROTO_T ( obj_list this_obl )
+dw_new_regshare(dg_name nm, int reg)
+{
+	}
-	else {
+	return;
+}
-	  int found = 0;
+static void
-	  obj_list * obl = local_objects;
+extlist_portion(ll_item l)
+{
-	  while (obl && !found) {
+	while (l) {
-	    dg_name nm = obl->obj;
+		switch (l->key) {
-	    while (nm) {
+		case LL_CONST: {
+			long here = l->u.d->data.i_remval.lo_pc;
-	      if (nm->key == DGN_OBJECT) {
+			if (ll_ok && here != startlab) {
+				out_loc_range(startlab, here, 0);
+				dw_at_data(1, LOp_Const);
+				dw_out_const(obval);
+			}
+			startlab = here;
+			ll_ok = 1;
-		exp y = nm->data.n_obj.obtain_val;
+			obval = l->u.d->data.i_remval.val;
+			break;
+		}
+		case LL_OPTLOCK:
+			out_loc_range(l->u.d->data.i_optim.lo_pc,
-		if (y && last(y) && dw_has_location (son(y)) == id) {
+				      l->u.d->data.i_optim.hi_pc, 0);
-		  setbro (x, bro(y));
+			dw_at_data(1, LOp_Locked);
-		  setbro (y, (exp)((void *)this_nm));
+			dw_at_data(1, l->u.d->data.i_optim.reason);
+			break;
+		case LL_REGSHARE: {
+			regshare_item rs = l->u.l;
+			while (rs) {
-		  no(x) = no(y);
+				if (rs->share) {
+					out_loc_range(rs->start, rs->end, 1);
-		  check_taggable (nm);
+					dw_at_data(1, LOp_Shared);
-		  check_taggable (this_nm);
+					dw_at_address(rs->share);
+				}
+				rs = rs->next_loc;
+			}
+		}
-		  found = 1;
+		default:
-		  break;
+			break;
+		}
+		if (l->has_inner) {
+			loclist_portion(l->inner);
+		}
-	      }
-	      if (!obl->islist)
-		break;
-	      nm = nm->next;
-	    }
-	    obl = obl->next;
+		l = l->next;
-	  }
-	  if (!found) {
-	    setlast (x);
-	    no(x) = next_dwarf_label ();
-	    dw_allocated (this_nm, id);
-	  }
+	}
-      }
-      else
-	no(x) = 0;
+	return;
-    }
-    if (!this_obl.islist)
-      break;
-    this_nm = this_nm->next;
-  }
-}
-void close_locdata
-    PROTO_N ( (this_obl) )
-    PROTO_T ( obj_list this_obl )
-{
-  dg_name this_nm = this_obl.obj;
-  while (this_nm) {
-    if (this_nm->key == DGN_OBJECT) {
-      exp x = this_nm->data.n_obj.obtain_val;
-      if (x && last(x))
-	dw_deallocated (this_nm);
-    }
-    if (!this_obl.islist)
-      break;
-    this_nm = this_nm->next;
-  }
+}
-dg_name find_equiv_object
+void
-    PROTO_N ( (e, isc) )
-    PROTO_T ( exp e X int isc )
+out_obj_extloclist(long l1, long l2, exp x)
+{
-  obj_list * obl = local_objects;
-  while (obl) {
-    dg_name nm = obl->obj;
-    while (nm) {
-      if (nm->key == DGN_OBJECT) {
-	exp x = nm->data.n_obj.obtain_val;
-	if (isc) {
-	  if (x && name(son(x)) == cont_tag &&
-		dw_loc_equivalence (e, son(son(x))))
+	ll_item l = (ll_item)((void *)(pt(x)));
-	    return nm;
-	}
-	else {
-	  if (x && dw_loc_equivalence (e, son(x)))
-	    return nm;
-	}
-      }
-      if (!obl->islist)
-	break;
-      nm = nm->next;
-    }
-    obl = obl->next;
-  }
-  return (dg_name)0;
-}
-static dg_name find_simple_object
-    PROTO_N ( (e) )
-    PROTO_T ( exp e )
-{				/* e is name_tag for required object */
-  obj_list * obl = local_objects;
-  while (obl) {
-    dg_name nm = obl->obj;
-    while (nm) {
-      if (nm->key == DGN_OBJECT) {
-	exp x = nm->data.n_obj.obtain_val;
-	while (x && (name(x) == hold_tag || name(x) == cont_tag ||
-		name(x) == reff_tag))
-	  x = son(x);
-	if ((x) && name(x) == name_tag && son(x) == son(e) &&
+	if ((last(x) && bro(x)) || (!last(x) && no(x))) {
-		(no(x) <= no(e)) &&
-		(no(x) + shape_size(sh(x))) >= (no(e) + shape_size(sh(e)) ))
-	  return nm;
-      }
-      if (!obl->islist)
-	break;
-      nm = nm->next;
-    }
-    obl = obl->next;
-  }
-  return (dg_name)0;
-}
-void set_optim_objects
-    PROTO_N ( (optim, start) )
+		/* main location is shared */
-    PROTO_T ( dg_info optim X int start )
-{
-  objset * obj = optim->data.i_optim.objs;
-  while (obj) {
-    dg_name nm = obj->tg->p.nam;
-    if (start) {
-      ll_item * l = ll_root (nm);
+		out_loc_range(l1, l2, 0);
-      while (*l) {
-	if ((*l)->open)
-	  l = &((*l)->inner);
-	else
-	  l = &((*l)->next);
-      }
-      *l = new_ll_item (LL_OPTLOCK, 1);
-      (*l)->u.d = optim;
-    }
-    else {
-      ll_item l = * ll_root (nm);
-      while (l->key != LL_OPTLOCK || l->u.d != optim) {
-	if ((l)->open)
-	  l = l->inner;
-	else
-	  l = l->next;
-      }
-      l->open = 0;
-    }
-    obj = obj->next;
-  }
-  return;
-}
-void set_remval_object
-    PROTO_N ( (rmv) )
-    PROTO_T ( dg_info rmv )
-{
-  dg_name nm = find_simple_object (son (rmv->data.i_remval.var));
-  if (nm) {
-    ll_item * l = ll_root (nm);
-    while (*l) {
-      if ((*l)->open)
-	l = &((*l)->inner);
-      else
-	l = &((*l)->next);
-    }
-    *l = new_ll_item (LL_CONST, 0);
-    (*l)->u.d = rmv;
-  }
-  return;
-}
-void set_obj_rets
-    PROTO_N ( (rec) )
-    PROTO_T ( retrec * rec )
-{
-  obj_list * obl = local_objects;
-  while (obl) {
-    dg_name nm = obl->obj;
-    while (nm) {
-      if (nm->key == DGN_OBJECT) {
-	exp x = nm->data.n_obj.obtain_val;
-	while (x && (name(x) == hold_tag || name(x) == cont_tag ||
-		name(x) == reff_tag))
+		dw_at_data(1, LOp_Shared);
-	  x = son(x);
-	if ((x) && name(x) == name_tag && !isdiscarded(x) &&
-					!isglob(son(x))) {
+		dw_at_address(no(x));
-	  ll_item * l = ll_root (nm);
-	  while (*l) {
-	  if ((*l)->open)
-	    l = &((*l)->inner);
-	  else
-	    l = &((*l)->next);
-	  }
-	  *l = new_ll_item (LL_RET, 0);
-	  (*l)->u.r = rec;
 	}
-      }
-      if (!obl->islist)
-	break;
-      nm = nm->next;
-    }
-    obl = obl->next;
-  }
-  return;
-}
-static ll_item find_ll_item
-    PROTO_N ( (nm, k, force) )
-    PROTO_T ( dg_name nm X loclist_key k X int force )
-{
-  ll_item * ll = ll_root (nm);
-  ll_item l = *ll;
+	startlab = l1;
-  while (l && l->key != k)
-    l = l->next;
-  if (!l && force) {
-    l = new_ll_item (k, 0);
-    l->u.l = (regshare_item)0;
-    l->next = *ll;
-    *ll = l;
+	ll_ok = 0;
-  }
-  return l;
-}
-static void out_regshare_set
-    PROTO_N ( (it) )
-    PROTO_T ( regshare_item it )
-{
-  regshare_item this = it;
-  while (this) {
-    dg_name nm = this->nm;
-    if (nm) {
-      regshare_item look = it;
-      while (look->nm != nm)	/* avoid duplicates */
-	look = look->next_share;
-      if (look == this)
-	dw_at_ext_address (nm->mor->this_tag);
-    }
-    this = this->next_share;
-  }
-  return;
-}
-void init_dw_locdata
-    PROTO_Z ()
-{
-  all_regshares = (regshare_list)0;
-  local_objects = (obj_list *)0;
-  dw_all_deallocated ();
-  return;
-}
-void complete_dw_locdata
-    PROTO_Z ()
-{
-  regshare_list top_l = all_regshares;
-  while (top_l) {
-    dg_name master = top_l->alloc;
-    int reg = top_l->reg;
-    regshare_item regitem = top_l->items;
-    dg_name nm;
-    if (master) {
-      while (regitem) {
-	nm = master;
-	do {
-	  if (regitem->nm == nm) {
-	    regitem->nm = (dg_name)0;
-	    break;
-	  }
-	  nm = (dg_name)((void *)bro(nm->data.n_obj.obtain_val));
-	} while (nm);
-	if (!nm) {	/* regitem not in allocation shareset */
-	  ll_item l = find_ll_item (master, LL_MASTERSHARE, 1);
-	  if (!l->u.l)
-	    l->u.l = regitem;	/* start of extra share list for master */
-	  regitem->share = no(master->data.n_obj.obtain_val);
-	  regitem->reg = reg;
-	  l = find_ll_item (regitem->nm, LL_REGSHARE, 1);
-	  regitem->next_loc = l->u.l;
-	  l->u.l = regitem;
-	  check_taggable (regitem->nm);
-	  check_taggable (master);
-	}
-	regitem = regitem->next_share;
-      }
-    }
-    else {
-      long share = 0;
-      master = nm = (dg_name)0;
-      while (regitem) {
-	if (!master)
-	  master = regitem->nm;
-	if (!nm)
+	if (l) {
-	  nm = regitem->nm;
+		extlist_portion(l);
-	if (nm != master) {
-	  share = next_dwarf_label ();
-	  break;
+	}
-	regitem = regitem->next_share;
-      }
-      regitem = top_l->items;
-      while (regitem) {
-	ll_item l = find_ll_item (regitem->nm, LL_REGSHARE, 1);
-	regitem->share = share;
-	if (share)
-	  check_taggable (regitem->nm);
-	regitem->reg = reg;
-	regitem->next_loc = l->u.l;
-	l->u.l = regitem;
-        regitem = regitem->next_share;
-      }
-      if (share) {
+	if (ll_ok && l2 != startlab) {
-	enter_section ("debug_loc");
-	out_dwf_label (share, 1);
+		out_loc_range(startlab, l2, 0);
-	out_regshare_set (top_l->items);
+		dw_at_data(1, LOp_Const);
-	exit_section ();
+		dw_out_const(obval);
-      }
-    }
-    top_l = top_l->next;
-  }
-  return;
-}
-static int obj_decide
-    PROTO_N ( (l) )
-    PROTO_T ( ll_item l )
-{
-  int ans = 0, x;
-  while (l && ans < 2) {
-    switch (l->key) {
-      case LL_OPTLOCK:
-      case LL_CONST:
-      case LL_MASTERSHARE:
-	return 2;
-      case LL_RET: {
-	if (!ans)
-	  ans = 1;
-	break;
-      }
-      case LL_REGSHARE: {
-	regshare_item rs = l->u.l;
-	while (rs && ans<2) {
-	  if (rs->share)
-	    ans = 2;
-	  else
-	  if (!ans)
-	    ans = 1;
-	  rs = rs->next_loc;
+	}
-	break;
-      }
-    }
-    if (l->has_inner && (x = obj_decide (l->inner), x > ans))
-      ans = x;
-    l = l->next;
-  }
-  return ans;
+	return;
-}
-int decide_ll_type
-    PROTO_N ( (x) )
-    PROTO_T ( exp x )
-{			/* 1 if need location list, 2 if extension list */
-  ll_item l = (ll_item)((void *)(pt(x)));
-  if ((last(x) && bro(x)) || (!last(x) && no(x)))
-				/* main location is shared */
-    return 2;
-  else
-    return obj_decide (l);
+}
-static long startlab;
-static int ll_ok;
-static exp obval;
+void
-static void loclist_portion
-    PROTO_N ( (l) )
-    PROTO_T ( ll_item l )
+out_obj_shared_set(dg_name dn)
 {
-  while (l) {
-    switch (l->key) {
-      case LL_CONST: {
-	ll_ok = 0;
-	break;
-      }
-      case LL_RET: {
-	long endlab = l->u.r->lab;
+	exp x = dn->data.n_obj.obtain_val;
-	if (ll_ok && endlab != startlab) {
-	  out_loc_range (startlab, endlab, 0);
+	ll_item l = find_ll_item(dn, LL_MASTERSHARE, 0);
-	  dw2_locate_exp (obval, 0, 1);
+	if (last(x) && (bro(x) || l)) {
-	}
-	startlab = l->u.r->over;
+		out_dwf_label(no(x), 1);
-	break;
-      }
-      case LL_REGSHARE: {
-	regshare_item rs = l->u.l;
+		dw_at_ext_address(dn->mor->this_tag);
-	while (rs) {
+		while (bro(x)) {
-	  out_loc_range (rs->start, rs->end, 1);
-	  out16 ();
-	  if (rs->reg < 32) {
-	    outn ((long)1); outnl();
-	    out8 (); outn ((long)(DW_OP_reg0 + rs->reg));
-	  }
-	  else {
-	    outn ((long)(1 + uleb128_length((unsigned long)rs->reg)));
-	    outnl(); out8 ();
-	    outn ((long)DW_OP_regx); outs (", ");
-	    uleb128((unsigned long)rs->reg);
-	  }
-	  outnl();
-	  rs = rs->next_loc;
-	}
-      }
-      default:
-	break;
-    }
-    if (l->has_inner)
-      loclist_portion (l->inner);
-    l = l->next;
-  }
-  return;
-}
-void out_obj_loclist
-    PROTO_N ( (l1, l2, x) )
-    PROTO_T ( long l1 X long l2 X exp x )
-{
-  ll_item l = (ll_item)((void *)(pt(x)));
+			dg_name nm = (dg_name)((void *)bro(x));
-  startlab = l1;
-  ll_ok = 1;
-  obval = son(x);
-  loclist_portion (l);
-  if (ll_ok && l2 != startlab) {
-    out_loc_range (startlab, l2, 0);
+			dw_at_ext_address(nm->mor->this_tag);
-    dw2_locate_exp (obval, 0, 1);
+			x = nm->data.n_obj.obtain_val;
-  }
+		}
-  return;
-}
-static void extlist_portion
-    PROTO_N ( (l) )
-    PROTO_T ( ll_item l )
-{
-  while (l) {
+		if (l) {
-    switch (l->key) {
-      case LL_CONST: {
-	long here = l->u.d->data.i_remval.lo_pc;
-	if (ll_ok && here != startlab) {
-	  out_loc_range (startlab, here, 0);
+			out_regshare_set(l->u.l);
-	  dw_at_data (1, LOp_Const);
-	  dw_out_const (obval);
-	}
+		}
-	startlab = here;
-	ll_ok = 1;
+		out32();
-	obval = l->u.d->data.i_remval.val;
-	break;
-      }
-      case LL_OPTLOCK: {
-	out_loc_range (l->u.d->data.i_optim.lo_pc,
-			l->u.d->data.i_optim.hi_pc, 0);
-	dw_at_data (1, LOp_Locked);
-	dw_at_data (1, l->u.d->data.i_optim.reason);
-	break;
-      }
-      case LL_REGSHARE: {
-	regshare_item rs = l->u.l;
-	while (rs) {
+		outs("0");
-	  if (rs->share) {
-	    out_loc_range (rs->start, rs->end, 1);
+		outnl_comment("share list end");
-	    dw_at_data (1, LOp_Shared);
-	    dw_at_address (rs->share);
-	  }
-	  rs = rs->next_loc;
+	}
-      }
-      default:
-	break;
-    }
-    if (l->has_inner)
-      loclist_portion (l->inner);
-    l = l->next;
-  }
-  return;
-}
-void out_obj_extloclist
-    PROTO_N ( (l1, l2, x) )
-    PROTO_T ( long l1 X long l2 X exp x )
-{
-  ll_item l = (ll_item)((void *)(pt(x)));
-  if ((last(x) && bro(x)) || (!last(x) && no(x))) {
-				/* main location is shared */
-    out_loc_range (l1, l2, 0);
-    dw_at_data (1, LOp_Shared);
-    dw_at_address (no(x));
-  }
-  startlab = l1;
-  ll_ok = 0;
-  if (l)
-    extlist_portion (l);
-  if (ll_ok && l2 != startlab) {
-    out_loc_range (startlab, l2, 0);
-    dw_at_data (1, LOp_Const);
-    dw_out_const (obval);
-  }
-  return;
-}
-void out_obj_shared_set
-    PROTO_N ( (dn) )
-    PROTO_T ( dg_name dn )
-{
-  exp x = dn->data.n_obj.obtain_val;
-  ll_item l = find_ll_item (dn, LL_MASTERSHARE, 0);
-  if (last(x) && (bro(x) || l)) {
-    out_dwf_label (no(x), 1);
-    dw_at_ext_address (dn->mor->this_tag);
-    while (bro(x)) {
-      dg_name nm = (dg_name)((void *)bro(x));
-      dw_at_ext_address (nm->mor->this_tag);
-      x = nm->data.n_obj.obtain_val;
-    }
-    if (l)
-      out_regshare_set (l->u.l);
-    out32(); outs("0"); outnl_comment ("share list end");
-  }
-  return;
+	return;
+}

Subversion Repositories tendra.SVN

(root)/trunk/src/installers/common/dwarf2/dw2_locdata.c – Rev 2 → 7