Home
last modified time | relevance | path

Searched refs:Buckets (Results 176 – 200 of 6294) sorted by relevance

12345678910>>...252

/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Support/
H A DFoldingSet.cpp216 return Buckets + BucketNum; in GetBucketFor()
225 return Buckets; in AllocateBuckets()
235 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
240 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
241 Arg.Buckets = nullptr; in FoldingSetBase()
248 Buckets = RHS.Buckets; in operator =()
251 RHS.Buckets = nullptr; in operator =()
258 free(Buckets); in ~FoldingSetBase()
263 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear()
277 void **OldBuckets = Buckets; in GrowBucketCount()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Support/
H A DFoldingSet.cpp216 return Buckets + BucketNum; in GetBucketFor()
225 return Buckets; in AllocateBuckets()
235 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
240 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
241 Arg.Buckets = nullptr; in FoldingSetBase()
248 Buckets = RHS.Buckets; in operator =()
251 RHS.Buckets = nullptr; in operator =()
258 free(Buckets); in ~FoldingSetBase()
263 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear()
277 void **OldBuckets = Buckets; in GrowBucketCount()
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc9/gcc-9.4.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gnat_util/gcc-6-20180516/gcc/ada/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
H A Dg-dynhta.adb411 Buckets : Buckets_Array_Ptr; variable
414 Buckets :=
420 for Index in Buckets'Range loop
430 return Buckets;
442 if T.Buckets = null then
448 return T.Buckets'Length;
477 for Index in T.Buckets'Range loop
495 Free (T.Buckets);
558 pragma Assert (T.Buckets = null);
619 Buckets : Buckets_Array_Ptr; variable
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc9-aux/bootstrap/lib/gcc/x86_64-aux-dragonfly5.5/9.1.0/adainclude/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc10/gcc-10.3.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc8/gcc-8.5.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ada/libgnat/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ada/
H A Da-chtgke.adb60 return Hash (Key) mod HT.Buckets'Length;
87 X := HT.Buckets (Indx);
95 HT.Buckets (Indx) := Next (X);
135 Node := HT.Buckets (Indx);
165 Node := HT.Buckets (Indx);
175 HT.Buckets (Indx) := Node;
196 Node := New_Node (Next => HT.Buckets (Indx));
199 HT.Buckets (Indx) := Node;
289 N := HT.Buckets (Old_Indx);
293 HT.Buckets (Old_Indx) := Next (Node);
[all …]
H A Dg-dynhta.adb411 Buckets : Buckets_Array_Ptr; variable
414 Buckets :=
420 for Index in Buckets'Range loop
430 return Buckets;
442 if T.Buckets = null then
448 return T.Buckets'Length;
477 for Index in T.Buckets'Range loop
495 Free (T.Buckets);
558 pragma Assert (T.Buckets = null);
619 Buckets : Buckets_Array_Ptr; variable
[all …]
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ada/
H A Da-chtgbk.adb82 Result := HT.Buckets'First + Hash (Key) mod HT.Buckets'Length;
124 X := HT.Buckets (Indx);
135 HT.Buckets (Indx) := Next (HT.Nodes (X));
178 Node := HT.Buckets (Indx);
213 Node := HT.Buckets (Indx);
225 HT.Buckets (Indx) := Node;
247 Set_Next (HT.Nodes (Node), Next => HT.Buckets (Indx));
251 HT.Buckets (Indx) := Node;
267 BB : Buckets_Type renames HT.Buckets;
295 Old_Indx := HT.Buckets'First + Hash (NN (Node)) mod HT.Buckets'Length;
[all …]
H A Da-chtgke.adb82 Result := Hash (Key) mod HT.Buckets'Length;
124 X := HT.Buckets (Indx);
135 HT.Buckets (Indx) := Next (X);
178 Node := HT.Buckets (Indx);
211 Node := HT.Buckets (Indx);
221 HT.Buckets (Indx) := Node;
242 Node := New_Node (Next => HT.Buckets (Indx));
245 HT.Buckets (Indx) := Node;
359 N := HT.Buckets (Old_Indx);
363 HT.Buckets (Old_Indx) := Next (Node);
[all …]
/dports/lang/gcc6-aux/bootstrap/lib/gcc/x86_64-aux-dragonfly4.1/5.1.0/adainclude/
H A Da-chtgbk.adb82 Result := HT.Buckets'First + Hash (Key) mod HT.Buckets'Length;
124 X := HT.Buckets (Indx);
135 HT.Buckets (Indx) := Next (HT.Nodes (X));
178 Node := HT.Buckets (Indx);
213 Node := HT.Buckets (Indx);
225 HT.Buckets (Indx) := Node;
247 Set_Next (HT.Nodes (Node), Next => HT.Buckets (Indx));
251 HT.Buckets (Indx) := Node;
267 BB : Buckets_Type renames HT.Buckets;
295 Old_Indx := HT.Buckets'First + Hash (NN (Node)) mod HT.Buckets'Length;
[all …]
H A Da-chtgke.adb82 Result := Hash (Key) mod HT.Buckets'Length;
124 X := HT.Buckets (Indx);
135 HT.Buckets (Indx) := Next (X);
178 Node := HT.Buckets (Indx);
211 Node := HT.Buckets (Indx);
221 HT.Buckets (Indx) := Node;
242 Node := New_Node (Next => HT.Buckets (Indx));
245 HT.Buckets (Indx) := Node;
359 N := HT.Buckets (Old_Indx);
363 HT.Buckets (Old_Indx) := Next (Node);
[all …]
H A Dg-dynhta.adb411 Buckets : Buckets_Array_Ptr; variable
414 Buckets :=
420 for Index in Buckets'Range loop
430 return Buckets;
442 if T.Buckets = null then
448 return T.Buckets'Length;
477 for Index in T.Buckets'Range loop
495 Free (T.Buckets);
558 pragma Assert (T.Buckets = null);
619 Buckets : Buckets_Array_Ptr; variable
[all …]
/dports/net/rabbitmq/rabbitmq-server-3.9.11/deps/prometheus/src/
H A Dprometheus_buckets.erl45 Buckets = lists:map(fun validate_bound/1, RawBuckets),
46 case lists:sort(Buckets) of
47 Buckets ->
48 case lists:last(Buckets) of
49 infinity -> Buckets;
50 _ -> Buckets ++ [infinity]
53 erlang:error({invalid_buckets, Buckets, "buckets not sorted"})
55 new(Buckets) ->
56 erlang:error({invalid_buckets, Buckets, "not a list"}).
120 position(Buckets, Value) ->
[all …]

12345678910>>...252