This is the mail archive of the
mailing list for the GCC project.
Allocation of hotness of data structure with respect to the top of stack.
- From: Ajit Kumar Agarwal <ajit dot kumar dot agarwal at xilinx dot com>
- To: "law at redhat dot com" <law at redhat dot com>, "vmakarov at redhat dot com" <vmakarov at redhat dot com>, Richard Biener <richard dot guenther at gmail dot com>, "Jan Hubicka" <hubicka at ucw dot cz>, "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Cc: Vinod Kathail <vinodk at xilinx dot com>, Shail Aditya Gupta <shailadi at xilinx dot com>, Vidhumouli Hunsigida <vidhum at xilinx dot com>, "Nagaraju Mekala" <nmekala at xilinx dot com>
- Date: Sun, 5 Jul 2015 11:11:45 +0000
- Subject: Allocation of hotness of data structure with respect to the top of stack.
- Authentication-results: sourceware.org; auth=none
- Authentication-results: spf=pass (sender IP is 126.96.36.199) smtp.mailfrom=xilinx.com; redhat.com; dkim=none (message not signed) header.d=none;
I am wondering allocation of hot data structure closer to the top of the stack increases the performance of the application.
The data structure are identified as hot and cold data structure and all the data structures are sorted in decreasing order of
The hotness and the hot data structure will be allocated closer to the top of the stack.
The load and store on accessing with respect to allocation of data structure on stack will be faster with allocation of hot
Data structure closer to the top of the stack.
Based on the above the code is generated with respect to load and store with the correct offset of the stack allocated on
the decreasing order of hotness.
Thanks & Regards