From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 24716 invoked by alias); 29 Nov 2012 12:11:13 -0000 Received: (qmail 24403 invoked by uid 22791); 29 Nov 2012 12:11:10 -0000 X-SWARE-Spam-Status: No, hits=-3.6 required=5.0 tests=AWL,BAYES_00,DKIM_ADSP_CUSTOM_MED,DKIM_SIGNED,DKIM_VALID,FREEMAIL_ENVFROM_END_DIGIT,FREEMAIL_FROM,KHOP_RCVD_TRUST,NML_ADSP_CUSTOM_MED,RCVD_IN_DNSWL_LOW,RCVD_IN_HOSTKARMA_YE X-Spam-Check-By: sourceware.org Received: from mail-we0-f175.google.com (HELO mail-we0-f175.google.com) (74.125.82.175) by sourceware.org (qpsmtpd/0.43rc1) with ESMTP; Thu, 29 Nov 2012 12:11:01 +0000 Received: by mail-we0-f175.google.com with SMTP id z53so4268846wey.20 for ; Thu, 29 Nov 2012 04:11:00 -0800 (PST) MIME-Version: 1.0 Received: by 10.180.85.194 with SMTP id j2mr26472231wiz.12.1354191060399; Thu, 29 Nov 2012 04:11:00 -0800 (PST) Received: by 10.216.153.132 with HTTP; Thu, 29 Nov 2012 04:11:00 -0800 (PST) Date: Thu, 29 Nov 2012 12:11:00 -0000 Message-ID: Subject: [patch print-tree.c]: 5 of 7 Fix of PR target/53912 bootstrap fails using default c++ mode in stage 2 and 3 for native x86_64-w64-mingw32 From: Kai Tietz To: GCC Patches Content-Type: text/plain; charset=ISO-8859-1 X-IsSubscribed: yes Mailing-List: contact gcc-patches-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-patches-owner@gcc.gnu.org X-SW-Source: 2012-11/txt/msg02415.txt.bz2 Hello, this trivial patch fixes a bootstrap issue on LLP64 hosts. ChangeLog 2012-11-29 Kai Tietz PR target/53912 * print-tree.c (print_node): Cast from pointer via uintptr_t. Tested for i686-w64-mingw32, x86_64-w64-mingw32, and x86_64-unknown-gnu-linux. Ok for apply? Regards, Kai Index: print-tree.c =================================================================== --- print-tree.c (Revision 193925) +++ print-tree.c (Arbeitskopie) @@ -255,7 +255,7 @@ print_node (FILE *file, const char *prefix, tree n /* Allow this function to be called if the table is not there. */ if (table) { - hash = ((unsigned long) node) % HASH_SIZE; + hash = ((uintptr_t) node) % HASH_SIZE; /* If node is in the table, just mention its address. */ for (b = table[hash]; b; b = b->next)