diff --git a/Tools/scripts/build_sizes.py b/Tools/scripts/build_sizes.py index fbc11ed4e0..3ead988fc0 100755 --- a/Tools/scripts/build_sizes.py +++ b/Tools/scripts/build_sizes.py @@ -20,6 +20,9 @@ builds = ['Plane', 'Copter', 'Rover', 'Sub', 'Blimp', 'AP_Periph'] args = parser.parse_args() +warning_flash_free = 5000 +warning_build_days = 3 + class APJInfo: def __init__(self, vehicle, board, githash, mtime, flash_free): @@ -28,6 +31,7 @@ class APJInfo: self.githash = githash self.mtime = mtime self.flash_free = flash_free + self.warning = 0 def apj_list(basedir): @@ -56,6 +60,8 @@ def write_headers(h): + + Build List -

Build list

-This is an auto-generated list of current builds allowing us to quickly see how close we are to running out of flash space +
+ + + +

Build List

+

This is an auto-generated list of current builds + allowing us to quickly see how close we are to running out of flash space.

+

Builds that are coloured red haven't built recently. Builds that are coloured yellow have low flash space remaining.

+

Click on any column header to sort by that column, or filter by entering a search term in the box above each table.

''') @@ -99,20 +117,54 @@ def write_table(h, build_type): for build in builds: boards.extend(apj_list(os.path.join(args.basedir, build, build_type))) - h.write(''' -

%s builds

- - -''' % (build_type, build_type)) + max_mtime = 0 + for apjinfo in boards: + if apjinfo.mtime > max_mtime: + max_mtime = apjinfo.mtime for apjinfo in boards: - h.write(''' + if apjinfo.flash_free < warning_flash_free: + apjinfo.warning = 1 + if int(apjinfo.mtime) < int(max_mtime)-warning_build_days*86400: + apjinfo.warning = 2 + + boards.sort(key=lambda board: board.warning, reverse=True) + + try: + idxs1 = [i for (i, e) in enumerate(boards) if e.warning == 1] + boards[min(idxs1):max(idxs1)] = sorted(boards[min(idxs1):max(idxs1)], key=lambda board: board.flash_free) + except ValueError: + pass + + try: + idxs2 = [i for (i, e) in enumerate(boards) if e.warning == 2] + boards[min(idxs2):max(idxs2)] = sorted(boards[min(idxs2):max(idxs2)], key=lambda board: board.mtime) + except ValueError: + pass + + h.write(''' +

%s builds

+

+
VehicleBoardBuild Dategit hashFlash Free
%s%s%s
+ + +''' % (build_type, build_type.capitalize(), build_type, build_type, build_type)) + + for apjinfo in boards: + if apjinfo.warning == 1: + h.write('') + elif apjinfo.warning == 2: + h.write('') + else: + h.write('') + h.write('''\n''' % ( apjinfo.vehicle, apjinfo.board, datetime.fromtimestamp(apjinfo.mtime).strftime("%F %k:%M"), apjinfo.githash, apjinfo.githash, apjinfo.flash_free)) h.write('''
VehicleBoardBuild Dategit hashFlash Free
%s%s%s %s%u
+

Return to top

''') diff --git a/Tools/scripts/build_sizes/filtertable.js b/Tools/scripts/build_sizes/filtertable.js new file mode 100644 index 0000000000..dd4b96febd --- /dev/null +++ b/Tools/scripts/build_sizes/filtertable.js @@ -0,0 +1,30 @@ +//Modified from https://www.w3schools.com/howto/howto_js_filter_table.asp +function searchFunc(build) { + // Declare variables + var input, filter, table, tr, td, i; + input = document.getElementById(`search_${build}`); + filter = input.value.toUpperCase(); + table = document.getElementById(`table_${build}`); + tr = table.getElementsByTagName("tr"); + + // Loop through all table rows, and hide those who don't match the search query + for (i = 0; i < tr.length; i++) { + td = tr[i].getElementsByTagName("td"); + if (td[0]) { + if (contained(td, filter)) { + tr[i].style.display = ""; + } else { + tr[i].style.display = "none"; + } + } + } +} + +function contained(td, filter) { + ret = 0; + for (i = 0; i < td.length; i++) { + txtValue = td[i].textContent || td[i].innerText; + ret += txtValue.toUpperCase().indexOf(filter) > -1; + } + return ret > 0; +} diff --git a/Tools/scripts/build_sizes/sorttable.js b/Tools/scripts/build_sizes/sorttable.js new file mode 100644 index 0000000000..38b0fc627c --- /dev/null +++ b/Tools/scripts/build_sizes/sorttable.js @@ -0,0 +1,495 @@ +/* + SortTable + version 2 + 7th April 2007 + Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/ + + Instructions: + Download this file + Add to your HTML + Add class="sortable" to any table you'd like to make sortable + Click on the headers to sort + + Thanks to many, many people for contributions and suggestions. + Licenced as X11: http://www.kryogenix.org/code/browser/licence.html + This basically means: do what you want with it. +*/ + + +var stIsIE = /*@cc_on!@*/false; + +sorttable = { + init: function() { + // quit if this function has already been called + if (arguments.callee.done) return; + // flag this function so we don't do the same thing twice + arguments.callee.done = true; + // kill the timer + if (_timer) clearInterval(_timer); + + if (!document.createElement || !document.getElementsByTagName) return; + + sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/; + + forEach(document.getElementsByTagName('table'), function(table) { + if (table.className.search(/\bsortable\b/) != -1) { + sorttable.makeSortable(table); + } + }); + + }, + + makeSortable: function(table) { + if (table.getElementsByTagName('thead').length == 0) { + // table doesn't have a tHead. Since it should have, create one and + // put the first table row in it. + the = document.createElement('thead'); + the.appendChild(table.rows[0]); + table.insertBefore(the,table.firstChild); + } + // Safari doesn't support table.tHead, sigh + if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0]; + + if (table.tHead.rows.length != 1) return; // can't cope with two header rows + + // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as + // "total" rows, for example). This is B&R, since what you're supposed + // to do is put them in a tfoot. So, if there are sortbottom rows, + // for backwards compatibility, move them to tfoot (creating it if needed). + sortbottomrows = []; + for (var i=0; i5' : ' ▴'; + this.appendChild(sortrevind); + return; + } + if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) { + // if we're already sorted by this column in reverse, just + // re-reverse the table, which is quicker + sorttable.reverse(this.sorttable_tbody); + this.className = this.className.replace('sorttable_sorted_reverse', + 'sorttable_sorted'); + this.removeChild(document.getElementById('sorttable_sortrevind')); + sortfwdind = document.createElement('span'); + sortfwdind.id = "sorttable_sortfwdind"; + sortfwdind.innerHTML = stIsIE ? ' 6' : ' ▾'; + this.appendChild(sortfwdind); + return; + } + + // remove sorttable_sorted classes + theadrow = this.parentNode; + forEach(theadrow.childNodes, function(cell) { + if (cell.nodeType == 1) { // an element + cell.className = cell.className.replace('sorttable_sorted_reverse',''); + cell.className = cell.className.replace('sorttable_sorted',''); + } + }); + sortfwdind = document.getElementById('sorttable_sortfwdind'); + if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); } + sortrevind = document.getElementById('sorttable_sortrevind'); + if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); } + + this.className += ' sorttable_sorted'; + sortfwdind = document.createElement('span'); + sortfwdind.id = "sorttable_sortfwdind"; + sortfwdind.innerHTML = stIsIE ? ' 6' : ' ▾'; + this.appendChild(sortfwdind); + + // build an array to sort. This is a Schwartzian transform thing, + // i.e., we "decorate" each row with the actual sort key, + // sort based on the sort keys, and then put the rows back in order + // which is a lot faster because you only do getInnerText once per row + row_array = []; + col = this.sorttable_columnindex; + rows = this.sorttable_tbody.rows; + for (var j=0; j 12) { + // definitely dd/mm + return sorttable.sort_ddmm; + } else if (second > 12) { + return sorttable.sort_mmdd; + } else { + // looks like a date, but we can't tell which, so assume + // that it's dd/mm (English imperialism!) and keep looking + sortfn = sorttable.sort_ddmm; + } + } + } + } + return sortfn; + }, + + getInnerText: function(node) { + // gets the text we want to use for sorting for a cell. + // strips leading and trailing whitespace. + // this is *not* a generic getInnerText function; it's special to sorttable. + // for example, you can override the cell text with a customkey attribute. + // it also gets .value for fields. + + if (!node) return ""; + + hasInputs = (typeof node.getElementsByTagName == 'function') && + node.getElementsByTagName('input').length; + + if (node.getAttribute("sorttable_customkey") != null) { + return node.getAttribute("sorttable_customkey"); + } + else if (typeof node.textContent != 'undefined' && !hasInputs) { + return node.textContent.replace(/^\s+|\s+$/g, ''); + } + else if (typeof node.innerText != 'undefined' && !hasInputs) { + return node.innerText.replace(/^\s+|\s+$/g, ''); + } + else if (typeof node.text != 'undefined' && !hasInputs) { + return node.text.replace(/^\s+|\s+$/g, ''); + } + else { + switch (node.nodeType) { + case 3: + if (node.nodeName.toLowerCase() == 'input') { + return node.value.replace(/^\s+|\s+$/g, ''); + } + case 4: + return node.nodeValue.replace(/^\s+|\s+$/g, ''); + break; + case 1: + case 11: + var innerText = ''; + for (var i = 0; i < node.childNodes.length; i++) { + innerText += sorttable.getInnerText(node.childNodes[i]); + } + return innerText.replace(/^\s+|\s+$/g, ''); + break; + default: + return ''; + } + } + }, + + reverse: function(tbody) { + // reverse the rows in a tbody + newrows = []; + for (var i=0; i=0; i--) { + tbody.appendChild(newrows[i]); + } + delete newrows; + }, + + /* sort functions + each sort function takes two parameters, a and b + you are comparing a[0] and b[0] */ + sort_numeric: function(a,b) { + aa = parseFloat(a[0].replace(/[^0-9.-]/g,'')); + if (isNaN(aa)) aa = 0; + bb = parseFloat(b[0].replace(/[^0-9.-]/g,'')); + if (isNaN(bb)) bb = 0; + return aa-bb; + }, + sort_alpha: function(a,b) { + if (a[0]==b[0]) return 0; + if (a[0] 0 ) { + var q = list[i]; list[i] = list[i+1]; list[i+1] = q; + swap = true; + } + } // for + t--; + + if (!swap) break; + + for(var i = t; i > b; --i) { + if ( comp_func(list[i], list[i-1]) < 0 ) { + var q = list[i]; list[i] = list[i-1]; list[i-1] = q; + swap = true; + } + } // for + b++; + + } // while(swap) + } +} + +/* ****************************************************************** + Supporting functions: bundled here to avoid depending on a library + ****************************************************************** */ + +// Dean Edwards/Matthias Miller/John Resig + +/* for Mozilla/Opera9 */ +if (document.addEventListener) { + document.addEventListener("DOMContentLoaded", sorttable.init, false); +} + +/* for Internet Explorer */ +/*@cc_on @*/ +/*@if (@_win32) + document.write("