| /external/iproute2/include/ |
| bpf_elf.h | 34 __u32 max_elem; member in struct:bpf_elf_map
|
| bpf_api.h | 99 # define __BPF_MAP(NAME, TYPE, ID, SIZE_KEY, SIZE_VALUE, PIN, MAX_ELEM) \
106 .max_elem = (MAX_ELEM), \
111 # define BPF_HASH(NAME, ID, SIZE_KEY, SIZE_VALUE, PIN, MAX_ELEM) \
113 PIN, MAX_ELEM)
117 # define BPF_ARRAY(NAME, ID, SIZE_VALUE, PIN, MAX_ELEM) \
119 SIZE_VALUE, PIN, MAX_ELEM)
123 # define BPF_ARRAY2(NAME, ID, PIN, MAX_ELEM) \
124 BPF_ARRAY(NAME, ID, sizeof(uint16_t), PIN, MAX_ELEM)
128 # define BPF_ARRAY4(NAME, ID, PIN, MAX_ELEM) \
[all...] |
| /external/opencv3/samples/cpp/tutorial_code/ImgProc/ |
| Morphology_2.cpp | 22 int const max_elem = 2; variable
50 &morph_elem, max_elem,
|
| Morphology_1.cpp | 22 int const max_elem = 2; variable
47 &erosion_elem, max_elem,
56 &dilation_elem, max_elem,
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| kdtree_single_index.h | 389 void computeMinMax(int* ind, int count, int dim, ElementType& min_elem, ElementType& max_elem)
392 max_elem = dataset_[ind[0]][dim];
396 if (val>max_elem) max_elem = val;
416 ElementType min_elem, max_elem; local
417 computeMinMax(ind, count, cutfeat, min_elem, max_elem);
418 cutval = (min_elem+max_elem)/2;
419 max_span = max_elem - min_elem;
427 computeMinMax(ind, count, i, min_elem, max_elem);
428 span = max_elem - min_elem
460 ElementType min_elem, max_elem; local
471 ElementType min_elem, max_elem; local
[all...] |
| /external/iproute2/examples/bpf/ |
| bpf_prog.c | 194 .max_elem = 256,
202 .max_elem = 1024,
210 .max_elem = 64,
|
| bpf_agent.c | 138 printf(" | max elem: %u\n", aux->ent[i].max_elem);
|
| /external/iproute2/tc/ |
| tc_bpf.c | 239 tmp.max_elem = val;
662 offsetof(struct bpf_elf_map, max_elem));
746 unsigned int size_value, unsigned int max_elem)
752 .max_entries = max_elem,
1079 map->max_elem);
1084 map->size_key, map->size_value, map->max_elem,
[all...] |
