mirror of
				https://github.com/torvalds/linux.git
				synced 2025-11-04 02:30:34 +02:00 
			
		
		
		
	Rationale:
Reduces attack surface on kernel devs opening the links for MITM
as HTTPS traffic is much harder to manipulate.
Deterministic algorithm:
For each file:
  If not .svg:
    For each line:
      If doesn't contain `\bxmlns\b`:
        For each link, `\bhttp://[^# \t\r\n]*(?:\w|/)`:
	  If neither `\bgnu\.org/license`, nor `\bmozilla\.org/MPL\b`:
            If both the HTTP and HTTPS versions
            return 200 OK and serve the same content:
              Replace HTTP with HTTPS.
Signed-off-by: Alexander A. Klimov <grandmaster@al2klimov.de>
Link: https://lore.kernel.org/r/20200713135018.34708-1-grandmaster@al2klimov.de
Signed-off-by: Kees Cook <keescook@chromium.org>
		
	
			
		
			
				
	
	
		
			69 lines
		
	
	
	
		
			1.7 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			69 lines
		
	
	
	
		
			1.7 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
/*
 | 
						|
 * Copyright 2011-2016 by Emese Revfy <re.emese@gmail.com>
 | 
						|
 * Licensed under the GPL v2, or (at your option) v3
 | 
						|
 *
 | 
						|
 * Homepage:
 | 
						|
 * https://github.com/ephox-gcc-plugins/cyclomatic_complexity
 | 
						|
 *
 | 
						|
 * https://en.wikipedia.org/wiki/Cyclomatic_complexity
 | 
						|
 * The complexity M is then defined as:
 | 
						|
 * M = E - N + 2P
 | 
						|
 * where
 | 
						|
 *
 | 
						|
 *  E = the number of edges of the graph
 | 
						|
 *  N = the number of nodes of the graph
 | 
						|
 *  P = the number of connected components (exit nodes).
 | 
						|
 *
 | 
						|
 * Usage (4.5 - 5):
 | 
						|
 * $ make clean; make run
 | 
						|
 */
 | 
						|
 | 
						|
#include "gcc-common.h"
 | 
						|
 | 
						|
__visible int plugin_is_GPL_compatible;
 | 
						|
 | 
						|
static struct plugin_info cyc_complexity_plugin_info = {
 | 
						|
	.version	= "20160225",
 | 
						|
	.help		= "Cyclomatic Complexity\n",
 | 
						|
};
 | 
						|
 | 
						|
static unsigned int cyc_complexity_execute(void)
 | 
						|
{
 | 
						|
	int complexity;
 | 
						|
	expanded_location xloc;
 | 
						|
 | 
						|
	/* M = E - N + 2P */
 | 
						|
	complexity = n_edges_for_fn(cfun) - n_basic_blocks_for_fn(cfun) + 2;
 | 
						|
 | 
						|
	xloc = expand_location(DECL_SOURCE_LOCATION(current_function_decl));
 | 
						|
	fprintf(stderr, "Cyclomatic Complexity %d %s:%s\n", complexity,
 | 
						|
		xloc.file, DECL_NAME_POINTER(current_function_decl));
 | 
						|
 | 
						|
	return 0;
 | 
						|
}
 | 
						|
 | 
						|
#define PASS_NAME cyc_complexity
 | 
						|
 | 
						|
#define NO_GATE
 | 
						|
#define TODO_FLAGS_FINISH TODO_dump_func
 | 
						|
 | 
						|
#include "gcc-generate-gimple-pass.h"
 | 
						|
 | 
						|
__visible int plugin_init(struct plugin_name_args *plugin_info, struct plugin_gcc_version *version)
 | 
						|
{
 | 
						|
	const char * const plugin_name = plugin_info->base_name;
 | 
						|
 | 
						|
	PASS_INFO(cyc_complexity, "ssa", 1, PASS_POS_INSERT_AFTER);
 | 
						|
 | 
						|
	if (!plugin_default_version_check(version, &gcc_version)) {
 | 
						|
		error(G_("incompatible gcc/plugin versions"));
 | 
						|
		return 1;
 | 
						|
	}
 | 
						|
 | 
						|
	register_callback(plugin_name, PLUGIN_INFO, NULL,
 | 
						|
				&cyc_complexity_plugin_info);
 | 
						|
	register_callback(plugin_name, PLUGIN_PASS_MANAGER_SETUP, NULL,
 | 
						|
				&cyc_complexity_pass_info);
 | 
						|
 | 
						|
	return 0;
 | 
						|
}
 |