Home | History | Annotate | Download | only in bfd

Lines Matching defs:shuffle

338 struct shuffle
341   struct shuffle *next;
369   /* Linked lists describing how to shuffle the input debug
372   struct shuffle *line;
373   struct shuffle *line_end;
374   struct shuffle *pdr;
375   struct shuffle *pdr_end;
376   struct shuffle *sym;
377   struct shuffle *sym_end;
378   struct shuffle *opt;
379   struct shuffle *opt_end;
380   struct shuffle *aux;
381   struct shuffle *aux_end;
382   struct shuffle *ss;
383   struct shuffle *ss_end;
386   struct shuffle *fdr;
387   struct shuffle *fdr_end;
388   struct shuffle *rfd;
389   struct shuffle *rfd_end;
390   /* The size of the largest file shuffle.  */
396 /* Add a file entry to a shuffle list.  */
400 		  struct shuffle **head,
401 		  struct shuffle **tail,
406   struct shuffle *n;
408   if (*tail != (struct shuffle *) NULL
420   n = (struct shuffle *) objalloc_alloc (ainfo->memory,
421 					 sizeof (struct shuffle));
432   if (*head == (struct shuffle *) NULL)
434   if (*tail != (struct shuffle *) NULL)
442 /* Add a memory entry to a shuffle list.  */
446 		    struct shuffle **head,
447 		    struct shuffle **tail,
451   struct shuffle *n;
453   n = (struct shuffle *) objalloc_alloc (ainfo->memory,
454 					 sizeof (struct shuffle));
464   if (*head == (struct shuffle *) NULL)
466   if (*tail != (struct shuffle *) NULL)
1211    probably be changed to use a shuffle structure.  The assembler uses
1527 /* Write out a shuffle list.  */
1533 		     struct shuffle *shuffle,
1536   struct shuffle *l;
1540   for (l = shuffle; l != NULL; l = l->next)
2513    FIXME: The whole point of the shuffle code is to avoid storing
2519 /* Collect a shuffle into a memory buffer.  */
2522 ecoff_collect_shuffle (struct shuffle *l, bfd_byte *buff)
2524   for (; l != (struct shuffle *) NULL; l = l->next)
2571   BFD_ASSERT (ainfo->ss == (struct shuffle *) NULL);