Deleted Added
full compact
suff.c (146184) suff.c (146580)
1/*-
2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Adam de Boor.

--- 25 unchanged lines hidden (view full) ---

34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)suff.c 8.4 (Berkeley) 3/21/94
39 */
40
41#include <sys/cdefs.h>
1/*-
2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Adam de Boor.

--- 25 unchanged lines hidden (view full) ---

34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)suff.c 8.4 (Berkeley) 3/21/94
39 */
40
41#include <sys/cdefs.h>
42__FBSDID("$FreeBSD: head/usr.bin/make/suff.c 146184 2005-05-13 13:47:41Z harti $");
42__FBSDID("$FreeBSD: head/usr.bin/make/suff.c 146580 2005-05-24 15:58:35Z harti $");
43
44/*-
45 * suff.c --
46 * Functions to maintain suffix lists and find implicit dependents
47 * using suffix transformation rules
48 *
49 * Interface:
50 * Suff_Init Initialize all things to do with suffixes.

--- 1448 unchanged lines hidden (view full) ---

1499 *-----------------------------------------------------------------------
1500 */
1501static void
1502SuffFindArchiveDeps(GNode *gn, Lst *slst)
1503{
1504 char *eoarch; /* End of archive portion */
1505 char *eoname; /* End of member portion */
1506 char *name; /* Start of member's name */
43
44/*-
45 * suff.c --
46 * Functions to maintain suffix lists and find implicit dependents
47 * using suffix transformation rules
48 *
49 * Interface:
50 * Suff_Init Initialize all things to do with suffixes.

--- 1448 unchanged lines hidden (view full) ---

1499 *-----------------------------------------------------------------------
1500 */
1501static void
1502SuffFindArchiveDeps(GNode *gn, Lst *slst)
1503{
1504 char *eoarch; /* End of archive portion */
1505 char *eoname; /* End of member portion */
1506 char *name; /* Start of member's name */
1507 char *p1;
1508 GNode *mem; /* Node for member */
1509 Suff *ms; /* Suffix descriptor for member */
1510
1511 static const char *copy[] = {
1512 TARGET, /* Must be first */
1513 PREFIX, /* Must be second */
1514 };
1515

--- 26 unchanged lines hidden (view full) ---

1542 Lst_AtEnd(&gn->children, mem);
1543 Lst_AtEnd(&mem->parents, gn);
1544 gn->unmade += 1;
1545 }
1546
1547 /*
1548 * Copy in the variables from the member node to this one.
1549 */
1507 GNode *mem; /* Node for member */
1508 Suff *ms; /* Suffix descriptor for member */
1509
1510 static const char *copy[] = {
1511 TARGET, /* Must be first */
1512 PREFIX, /* Must be second */
1513 };
1514

--- 26 unchanged lines hidden (view full) ---

1541 Lst_AtEnd(&gn->children, mem);
1542 Lst_AtEnd(&mem->parents, gn);
1543 gn->unmade += 1;
1544 }
1545
1546 /*
1547 * Copy in the variables from the member node to this one.
1548 */
1550 Var_Set(copy[1], Var_Value(copy[1], mem, &p1), gn);
1551 free(p1);
1552 Var_Set(copy[0], Var_Value(copy[0], mem, &p1), gn);
1553 free(p1);
1549 Var_Set(copy[1], Var_Value(copy[1], mem), gn);
1550 Var_Set(copy[0], Var_Value(copy[0], mem), gn);
1554
1555 ms = mem->suffix;
1556 if (ms == NULL) {
1557 /*
1558 * Didn't know what it was -- use .NULL suffix if not in
1559 * make mode
1560 */
1561 DEBUGF(SUFF, ("using null suffix\n"));

--- 646 unchanged lines hidden ---
1551
1552 ms = mem->suffix;
1553 if (ms == NULL) {
1554 /*
1555 * Didn't know what it was -- use .NULL suffix if not in
1556 * make mode
1557 */
1558 DEBUGF(SUFF, ("using null suffix\n"));

--- 646 unchanged lines hidden ---