mirror of
				https://github.com/golang/go.git
				synced 2025-10-31 08:40:55 +00:00 
			
		
		
		
	 69aed4712d
			
		
	
	
		69aed4712d
		
	
	
	
	
		
			
			Currently we use a full cmpstring to do the comparison for each split in the binary search for a string switch. Instead, split by comparing a single byte of the input string with a constant. That will give us a much faster split (although it might be not quite as good a split). Fixes #53333 R=go1.20 Change-Id: I28c7209342314f367071e4aa1f2beb6ec9ff7123 Reviewed-on: https://go-review.googlesource.com/c/go/+/414894 TryBot-Result: Gopher Robot <gobot@golang.org> Run-TryBot: Keith Randall <khr@golang.org> Reviewed-by: David Chase <drchase@google.com> Reviewed-by: Heschi Kreinick <heschi@google.com>
		
			
				
	
	
		
			101 lines
		
	
	
	
		
			1.8 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			101 lines
		
	
	
	
		
			1.8 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| // asmcheck
 | |
| 
 | |
| // Copyright 2019 The Go Authors. All rights reserved.
 | |
| // Use of this source code is governed by a BSD-style
 | |
| // license that can be found in the LICENSE file.
 | |
| 
 | |
| // These tests check code generation of switch statements.
 | |
| 
 | |
| package codegen
 | |
| 
 | |
| // see issue 33934
 | |
| func f(x string) int {
 | |
| 	// amd64:-`cmpstring`
 | |
| 	switch x {
 | |
| 	case "":
 | |
| 		return -1
 | |
| 	case "1", "2", "3":
 | |
| 		return -2
 | |
| 	default:
 | |
| 		return -3
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // use jump tables for 8+ int cases
 | |
| func square(x int) int {
 | |
| 	// amd64:`JMP\s\(.*\)\(.*\)$`
 | |
| 	// arm64:`MOVD\s\(R.*\)\(R.*<<3\)`,`JMP\s\(R.*\)$`
 | |
| 	switch x {
 | |
| 	case 1:
 | |
| 		return 1
 | |
| 	case 2:
 | |
| 		return 4
 | |
| 	case 3:
 | |
| 		return 9
 | |
| 	case 4:
 | |
| 		return 16
 | |
| 	case 5:
 | |
| 		return 25
 | |
| 	case 6:
 | |
| 		return 36
 | |
| 	case 7:
 | |
| 		return 49
 | |
| 	case 8:
 | |
| 		return 64
 | |
| 	default:
 | |
| 		return x * x
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // use jump tables for 8+ string lengths
 | |
| func length(x string) int {
 | |
| 	// amd64:`JMP\s\(.*\)\(.*\)$`
 | |
| 	// arm64:`MOVD\s\(R.*\)\(R.*<<3\)`,`JMP\s\(R.*\)$`
 | |
| 	switch x {
 | |
| 	case "a":
 | |
| 		return 1
 | |
| 	case "bb":
 | |
| 		return 2
 | |
| 	case "ccc":
 | |
| 		return 3
 | |
| 	case "dddd":
 | |
| 		return 4
 | |
| 	case "eeeee":
 | |
| 		return 5
 | |
| 	case "ffffff":
 | |
| 		return 6
 | |
| 	case "ggggggg":
 | |
| 		return 7
 | |
| 	case "hhhhhhhh":
 | |
| 		return 8
 | |
| 	default:
 | |
| 		return len(x)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Use single-byte ordered comparisons for binary searching strings.
 | |
| // See issue 53333.
 | |
| func mimetype(ext string) string {
 | |
| 	// amd64: `CMPB\s1\(.*\), \$104$`,-`cmpstring`
 | |
| 	// arm64: `MOVB\s1\(R.*\), R.*$`, `CMPW\s\$104, R.*$`, -`cmpstring`
 | |
| 	switch ext {
 | |
| 	// amd64: `CMPL\s\(.*\), \$1836345390$`
 | |
| 	// arm64: `CMPW\s\$1836345390, R.*$`
 | |
| 	case ".htm":
 | |
| 		return "A"
 | |
| 	// amd64: `CMPL\s\(.*\), \$1953457454$`
 | |
| 	// arm64: `CMPW\s\$1953457454, R.*$`
 | |
| 	case ".eot":
 | |
| 		return "B"
 | |
| 	// amd64: `CMPL\s\(.*\), \$1735815982$`
 | |
| 	// arm64: `CMPW\s\$1735815982, R.*$`
 | |
| 	case ".svg":
 | |
| 		return "C"
 | |
| 	// amd64: `CMPL\s\(.*\), \$1718907950$`
 | |
| 	// arm64: `CMPW\s\$1718907950, R.*$`
 | |
| 	case ".ttf":
 | |
| 		return "D"
 | |
| 	default:
 | |
| 		return ""
 | |
| 	}
 | |
| }
 |