| 
									
										
										
										
											2024-02-26 19:44:32 +08:00
										 |  |  | // Copyright 2024 The Prometheus Authors
 | 
					
						
							| 
									
										
										
										
											2024-01-23 05:39:24 +08:00
										 |  |  | // Licensed under the Apache License, Version 2.0 (the "License");
 | 
					
						
							|  |  |  | // you may not use this file except in compliance with the License.
 | 
					
						
							|  |  |  | // You may obtain a copy of the License at
 | 
					
						
							|  |  |  | //
 | 
					
						
							|  |  |  | // http://www.apache.org/licenses/LICENSE-2.0
 | 
					
						
							|  |  |  | //
 | 
					
						
							|  |  |  | // Unless required by applicable law or agreed to in writing, software
 | 
					
						
							|  |  |  | // distributed under the License is distributed on an "AS IS" BASIS,
 | 
					
						
							|  |  |  | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 | 
					
						
							|  |  |  | // See the License for the specific language governing permissions and
 | 
					
						
							|  |  |  | // limitations under the License.
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | //go:build dedupelabels
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | package labels | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | import ( | 
					
						
							|  |  |  | 	"github.com/cespare/xxhash/v2" | 
					
						
							|  |  |  | ) | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | // StableHash is a labels hashing implementation which is guaranteed to not change over time.
 | 
					
						
							|  |  |  | // This function should be used whenever labels hashing backward compatibility must be guaranteed.
 | 
					
						
							|  |  |  | func StableHash(ls Labels) uint64 { | 
					
						
							|  |  |  | 	// Use xxhash.Sum64(b) for fast path as it's faster.
 | 
					
						
							|  |  |  | 	b := make([]byte, 0, 1024) | 
					
						
							|  |  |  | 	for pos := 0; pos < len(ls.data); { | 
					
						
							|  |  |  | 		name, newPos := decodeString(ls.syms, ls.data, pos) | 
					
						
							|  |  |  | 		value, newPos := decodeString(ls.syms, ls.data, newPos) | 
					
						
							|  |  |  | 		if len(b)+len(name)+len(value)+2 >= cap(b) { | 
					
						
							|  |  |  | 			// If labels entry is 1KB+, hash the rest of them via Write().
 | 
					
						
							|  |  |  | 			h := xxhash.New() | 
					
						
							|  |  |  | 			_, _ = h.Write(b) | 
					
						
							|  |  |  | 			for pos < len(ls.data) { | 
					
						
							|  |  |  | 				name, pos = decodeString(ls.syms, ls.data, pos) | 
					
						
							|  |  |  | 				value, pos = decodeString(ls.syms, ls.data, pos) | 
					
						
							|  |  |  | 				_, _ = h.WriteString(name) | 
					
						
							|  |  |  | 				_, _ = h.Write(seps) | 
					
						
							|  |  |  | 				_, _ = h.WriteString(value) | 
					
						
							|  |  |  | 				_, _ = h.Write(seps) | 
					
						
							|  |  |  | 			} | 
					
						
							|  |  |  | 			return h.Sum64() | 
					
						
							|  |  |  | 		} | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 		b = append(b, name...) | 
					
						
							| 
									
										
										
										
											2024-07-15 16:47:16 +08:00
										 |  |  | 		b = append(b, sep) | 
					
						
							| 
									
										
										
										
											2024-01-23 05:39:24 +08:00
										 |  |  | 		b = append(b, value...) | 
					
						
							| 
									
										
										
										
											2024-07-15 16:47:16 +08:00
										 |  |  | 		b = append(b, sep) | 
					
						
							| 
									
										
										
										
											2024-01-23 05:39:24 +08:00
										 |  |  | 		pos = newPos | 
					
						
							|  |  |  | 	} | 
					
						
							|  |  |  | 	return xxhash.Sum64(b) | 
					
						
							|  |  |  | } |