Home
last modified time | relevance | path

Searched refs:FN (Results 1 - 25 of 83) sorted by relevance

1234

/third_party/mksh/
H A Demacsfn.h23 #define FN(cname,sname,flags) static int x_##cname(int); macro
25 #define FN(cname,sname,flags) XFUNC_##cname, macro
28 #define FN(cname,sname,flags) { x_##cname, sname, flags }, macro
32 #define F0 FN
37 FN(beg_hist, "beginning-of-history", 0)
38 FN(cls, "clear-screen", 0)
39 FN(comment, "comment", 0)
40 FN(comp_comm, "complete-command", 0)
41 FN(comp_file, "complete-file", 0)
42 FN(comp_lis
140 #undef FN global() macro
[all...]
H A Dexprtok.h25 #define FN(name,len,prec,enum) /* nothing */ macro
29 #define FN(name,len,prec,enum) enum, macro
34 #define FN(name,len,prec,enum) name, macro
37 #define FN(name,len,prec,enum) len, macro
40 #define FN(name,len,prec,enum) prec, macro
45 #define F0 FN
57 FN("--", 2, P_PRIMARY, O_MINUSMINUS) /* before - */
59 FN("==", 2, P_EQUALITY, O_EQ) /* before = */
60 FN("!=", 2, P_EQUALITY, O_NE) /* before ! */
62 FN("
114 #undef FN global() macro
[all...]
H A Dvar_spec.h23 #define FN(name) /* nothing */ macro
25 #define FN(name) V_##name, macro
29 #define FN(name) #name, macro
33 #define F0 FN
36 /* NOTE: F0 are skipped for the ITEMS array, only FN generate names */
42 FN(BASHPID)
44 FN(BEGINLIBPATH)
46 FN(COLUMNS)
48 FN(ENDLIBPATH)
50 FN(EPOCHREALTIM
76 #undef FN global() macro
[all...]
/third_party/ltp/include/lapi/
H A Dbpf.h328 #define __BPF_FUNC_MAPPER(FN) \
329 FN(unspec), \
330 FN(map_lookup_elem), \
331 FN(map_update_elem), \
332 FN(map_delete_elem), \
333 FN(probe_read), \
334 FN(ktime_get_ns), \
335 FN(trace_printk), \
336 FN(get_prandom_u32), \
337 FN(get_smp_processor_i
[all...]
/third_party/libbpf/include/uapi/linux/
H A Dbpf.h5681 #define ___BPF_FUNC_MAPPER(FN, ctx...) \
5682 FN(unspec, 0, ##ctx) \
5683 FN(map_lookup_elem, 1, ##ctx) \
5684 FN(map_update_elem, 2, ##ctx) \
5685 FN(map_delete_elem, 3, ##ctx) \
5686 FN(probe_read, 4, ##ctx) \
5687 FN(ktime_get_ns, 5, ##ctx) \
5688 FN(trace_printk, 6, ##ctx) \
5689 FN(get_prandom_u32, 7, ##ctx) \
5690 FN(get_smp_processor_i
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dhash_forgetful_chain_inc.h8 /* template parameters: FN, BUCKET_BITS, NUM_BANKS, BANK_BITS,
27 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
28 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; } in StoreLookahead()
31 static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes()
38 typedef struct FN(Slot) { in FN() function
41 } FN(Slot); in FN()
43 typedef struct FN(Bank) { in FN() function
44 FN(Slot) slots[BANK_SIZE]; in FN()
45 } FN(Bank); in FN()
64 /* FN(Ban
[all...]
H A Dhistogram_inc.h12 typedef struct FN(Histogram) { in FN() function
16 } FN(Histogram); in FN()
18 static BROTLI_INLINE void FN(HistogramClear)(FN(Histogram)* self) {
24 static BROTLI_INLINE void FN(ClearHistograms)(
25 FN(Histogram)* array, size_t length) {
27 for (i = 0; i < length; ++i) FN(HistogramClear)(array + i);
30 static BROTLI_INLINE void FN(HistogramAdd)(FN(Histogram)* self, size_t val) {
35 static BROTLI_INLINE void FN(HistogramAddVecto
[all...]
H A Dhash_rolling_inc.h8 /* template parameters: FN, JUMP, NUMBUCKETS, MASK, CHUNKLEN */
17 static const uint32_t FN(kRollingHashMul32) = 69069;
18 static const uint32_t FN(kInvalidPos) = 0xffffffff;
23 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
24 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; } in StoreLookahead()
28 static uint32_t FN(HashByte)(uint8_t byte) { in HashByte()
32 static uint32_t FN(HashRollingFunctionInitial)(uint32_t state, uint8_t add, in HashRollingFunctionInitial()
34 return (uint32_t)(factor * state + FN(HashByte)(add)); in HashRollingFunctionInitial()
37 static uint32_t FN(HashRollingFunction)(uint32_t state, uint8_t add, in HashRollingFunction()
41 FN(HashByt in HashRollingFunction()
[all...]
H A Dhash_to_binary_tree_inc.h8 /* template parameters: FN, BUCKET_BITS, MAX_TREE_COMP_LENGTH,
22 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
23 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { in StoreLookahead()
27 static uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes()
57 static void FN(Initialize)( in Initialize()
67 static void FN(Prepare) in Prepare()
81 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
91 static BROTLI_INLINE size_t FN(LeftChildIndex)( in LeftChildIndex()
97 static BROTLI_INLINE size_t FN(RightChildIndex)( in RightChildIndex()
113 static BROTLI_INLINE BackwardMatch* FN(StoreAndFindMatche
[all...]
H A Dmetablock_inc.h8 /* template parameters: FN */
10 #define HistogramType FN(Histogram)
14 typedef struct FN(BlockSplitter) { in FN() function
43 } FN(BlockSplitter); in FN()
45 static void FN(InitBlockSplitter)( in InitBlockSplitter()
46 MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, in InitBlockSplitter()
76 FN(HistogramClear)(&self->histograms_[0]); in InitBlockSplitter()
84 static void FN(BlockSplitterFinishBlock)(
85 FN(BlockSplitter)* self, BROTLI_BOOL is_final) {
102 FN(HistogramClea
[all...]
H A Dhash_longest_match_inc.h8 /* template parameters: FN */
19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
20 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; } in StoreLookahead()
23 static uint32_t FN(HashBytes)( in HashBytes()
57 static BROTLI_INLINE uint16_t* FN(Num)(void* extra) { in Num()
61 static void FN(Initialize)( in Initialize()
78 static void FN(Prepare)( in Prepare()
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_); in Prepare()
95 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
108 static BROTLI_INLINE void FN(Stor
[all...]
H A Dblock_splitter_inc.h8 /* template parameters: FN, DataType */
10 #define HistogramType FN(Histogram)
12 static void FN(InitialEntropyCodes)(const DataType* data, size_t length, in InitialEntropyCodes()
19 FN(ClearHistograms)(histograms, num_histograms); in InitialEntropyCodes()
28 FN(HistogramAddVector)(&histograms[i], data + pos, stride); in InitialEntropyCodes()
32 static void FN(RandomSample)(uint32_t* seed, in RandomSample()
43 FN(HistogramAddVector)(sample, data + pos, stride); in RandomSample()
46 static void FN(RefineEntropyCodes)(const DataType* data, size_t length, in RefineEntropyCodes()
57 FN(HistogramClear)(&sample); in RefineEntropyCodes()
58 FN(RandomSampl in RefineEntropyCodes()
[all...]
H A Dhash_longest_match64_inc.h8 /* template parameters: FN */
19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength()
20 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; } in StoreLookahead()
23 static BROTLI_INLINE uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data, in HashBytes()
60 static void FN(Initialize)( in Initialize()
78 static void FN(Prepare)( in Prepare()
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_, in Prepare()
96 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
109 static BROTLI_INLINE void FN(Store)( in Store()
114 const uint32_t key = FN(HashByte in Store()
[all...]
H A Dhash_longest_match_quickly_inc.h8 /* template parameters: FN, BUCKET_BITS, BUCKET_SWEEP_BITS, HASH_LEN,
19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength()
20 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; } in StoreLookahead()
25 static uint32_t FN(HashBytes)(const uint8_t* data) { in HashBytes()
46 static void FN(Initialize)( in Initialize()
55 static void FN(Prepare)( in Prepare()
64 const uint32_t key = FN(HashBytes)(&data[i]); in Prepare()
83 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
95 static BROTLI_INLINE void FN(Store)( in Store()
98 const uint32_t key = FN(HashByte in Store()
[all...]
H A Dbackward_references_inc.h8 /* template parameters: EXPORT_FN, FN */
16 HASHER()* privat = &hasher->privat.FN(_); in CreateBackwardReferences()
24 const size_t store_end = num_bytes >= FN(StoreLookahead)() ? in CreateBackwardReferences()
25 position + num_bytes - FN(StoreLookahead)() + 1 : position; in CreateBackwardReferences()
38 FN(PrepareDistanceCache)(privat, dist_cache); in CreateBackwardReferences()
40 while (position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
50 FN(FindLongestMatch)(privat, &params->dictionary, in CreateBackwardReferences()
68 FN(FindLongestMatch)(privat, in CreateBackwardReferences()
80 position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
100 FN(PrepareDistanceCach in CreateBackwardReferences()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_forgetful_chain_inc.h8 /* template parameters: FN, BUCKET_BITS, NUM_BANKS, BANK_BITS,
27 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
28 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; } in StoreLookahead()
31 static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes()
38 typedef struct FN(Slot) { in FN() function
41 } FN(Slot); in FN()
43 typedef struct FN(Bank) { in FN() function
44 FN(Slot) slots[BANK_SIZE]; in FN()
45 } FN(Bank); in FN()
64 /* FN(Ban
[all...]
H A Dhistogram_inc.h12 typedef struct FN(Histogram) { in FN() function
16 } FN(Histogram); in FN()
18 static BROTLI_INLINE void FN(HistogramClear)(FN(Histogram)* self) {
24 static BROTLI_INLINE void FN(ClearHistograms)(
25 FN(Histogram)* array, size_t length) {
27 for (i = 0; i < length; ++i) FN(HistogramClear)(array + i);
30 static BROTLI_INLINE void FN(HistogramAdd)(FN(Histogram)* self, size_t val) {
35 static BROTLI_INLINE void FN(HistogramAddVecto
[all...]
H A Dhash_rolling_inc.h8 /* template parameters: FN, JUMP, NUMBUCKETS, MASK, CHUNKLEN */
17 static const uint32_t FN(kRollingHashMul32) = 69069;
18 static const uint32_t FN(kInvalidPos) = 0xffffffff;
23 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
24 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; } in StoreLookahead()
28 static uint32_t FN(HashByte)(uint8_t byte) { in HashByte()
32 static uint32_t FN(HashRollingFunctionInitial)(uint32_t state, uint8_t add, in HashRollingFunctionInitial()
34 return (uint32_t)(factor * state + FN(HashByte)(add)); in HashRollingFunctionInitial()
37 static uint32_t FN(HashRollingFunction)(uint32_t state, uint8_t add, in HashRollingFunction()
41 FN(HashByt in HashRollingFunction()
[all...]
H A Dhash_to_binary_tree_inc.h8 /* template parameters: FN, BUCKET_BITS, MAX_TREE_COMP_LENGTH,
22 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
23 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { in StoreLookahead()
27 static uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes()
57 static void FN(Initialize)( in Initialize()
67 static void FN(Prepare) in Prepare()
81 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
91 static BROTLI_INLINE size_t FN(LeftChildIndex)( in LeftChildIndex()
97 static BROTLI_INLINE size_t FN(RightChildIndex)( in RightChildIndex()
113 static BROTLI_INLINE BackwardMatch* FN(StoreAndFindMatche
[all...]
H A Dmetablock_inc.h8 /* template parameters: FN */
10 #define HistogramType FN(Histogram)
14 typedef struct FN(BlockSplitter) { in FN() function
43 } FN(BlockSplitter); in FN()
45 static void FN(InitBlockSplitter)( in InitBlockSplitter()
46 MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, in InitBlockSplitter()
76 FN(HistogramClear)(&self->histograms_[0]); in InitBlockSplitter()
84 static void FN(BlockSplitterFinishBlock)(
85 FN(BlockSplitter)* self, BROTLI_BOOL is_final) {
102 FN(HistogramClea
[all...]
H A Dhash_longest_match_inc.h8 /* template parameters: FN */
19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength()
20 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; } in StoreLookahead()
23 static uint32_t FN(HashBytes)( in HashBytes()
57 static BROTLI_INLINE uint16_t* FN(Num)(void* extra) { in Num()
61 static void FN(Initialize)( in Initialize()
78 static void FN(Prepare)( in Prepare()
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_); in Prepare()
95 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
108 static BROTLI_INLINE void FN(Stor
[all...]
H A Dblock_splitter_inc.h8 /* template parameters: FN, DataType */
10 #define HistogramType FN(Histogram)
12 static void FN(InitialEntropyCodes)(const DataType* data, size_t length, in InitialEntropyCodes()
19 FN(ClearHistograms)(histograms, num_histograms); in InitialEntropyCodes()
28 FN(HistogramAddVector)(&histograms[i], data + pos, stride); in InitialEntropyCodes()
32 static void FN(RandomSample)(uint32_t* seed, in RandomSample()
43 FN(HistogramAddVector)(sample, data + pos, stride); in RandomSample()
46 static void FN(RefineEntropyCodes)(const DataType* data, size_t length, in RefineEntropyCodes()
57 FN(HistogramClear)(&sample); in RefineEntropyCodes()
58 FN(RandomSampl in RefineEntropyCodes()
[all...]
H A Dhash_longest_match_quickly_inc.h8 /* template parameters: FN, BUCKET_BITS, BUCKET_SWEEP_BITS, HASH_LEN,
19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength()
20 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; } in StoreLookahead()
25 static uint32_t FN(HashBytes)(const uint8_t* data) { in HashBytes()
46 static void FN(Initialize)( in Initialize()
55 static void FN(Prepare)( in Prepare()
64 const uint32_t key = FN(HashBytes)(&data[i]); in Prepare()
83 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
95 static BROTLI_INLINE void FN(Store)( in Store()
98 const uint32_t key = FN(HashByte in Store()
[all...]
H A Dhash_longest_match64_inc.h8 /* template parameters: FN */
19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength()
20 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; } in StoreLookahead()
23 static BROTLI_INLINE uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data, in HashBytes()
60 static void FN(Initialize)( in Initialize()
78 static void FN(Prepare)( in Prepare()
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_, in Prepare()
96 static BROTLI_INLINE size_t FN(HashMemAllocInBytes)( in HashMemAllocInBytes()
109 static BROTLI_INLINE void FN(Store)( in Store()
114 const uint32_t key = FN(HashByte in Store()
[all...]
H A Dbackward_references_inc.h8 /* template parameters: EXPORT_FN, FN */
16 HASHER()* privat = &hasher->privat.FN(_); in CreateBackwardReferences()
24 const size_t store_end = num_bytes >= FN(StoreLookahead)() ? in CreateBackwardReferences()
25 position + num_bytes - FN(StoreLookahead)() + 1 : position; in CreateBackwardReferences()
38 FN(PrepareDistanceCache)(privat, dist_cache); in CreateBackwardReferences()
40 while (position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
50 FN(FindLongestMatch)(privat, &params->dictionary, in CreateBackwardReferences()
68 FN(FindLongestMatch)(privat, in CreateBackwardReferences()
80 position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
100 FN(PrepareDistanceCach in CreateBackwardReferences()
[all...]

Completed in 18 milliseconds

1234