/linux-master/arch/x86/pci/ |
H A D | bus_numa.h | 26 resource_size_t end, unsigned long flags, int merge);
|
H A D | bus_numa.c | 96 resource_size_t end, unsigned long flags, int merge) 107 if (!merge) 110 /* try to merge it with old one */ 95 update_res(struct pci_root_info *info, resource_size_t start, resource_size_t end, unsigned long flags, int merge) argument
|
/linux-master/arch/powerpc/include/asm/ |
H A D | kexec_ranges.h | 7 void sort_memory_ranges(struct crash_mem *mrngs, bool merge);
|
/linux-master/tools/lib/ |
H A D | list_sort.c | 11 * to chaining of merge() calls: null-terminated, no reserved or 15 static struct list_head *merge(void *priv, list_cmp_func_t cmp, function 44 * Combine final list merge with restoration of standard doubly-linked 45 * list structure. This approach duplicates code from merge(), but 82 * If the merge is highly unbalanced (e.g. the input is 143 * for each bit, when count increments to 2^k), we merge two lists of 146 * This merge happens exactly when the count reaches an odd multiple of 148 * so it's safe to merge away two lists of size 2^k. 169 * (merge and loop back to state 2) 173 * merge the [all...] |
/linux-master/fs/btrfs/ |
H A D | extent_map.c | 192 /* Don't merge compressed extents, we need to know their actual size. */ 200 * We don't want to merge stuff that hasn't been written to the log yet 210 /* Check to see if two extent_map structs are adjacent and safe to merge. */ 228 struct extent_map *merge = NULL; local 248 merge = rb_entry(rb, struct extent_map, rb_node); 249 if (rb && can_merge_extent_map(merge) && mergeable_maps(merge, em)) { 250 em->start = merge->start; 251 em->orig_start = merge->orig_start; 252 em->len += merge [all...] |
/linux-master/tools/perf/tests/shell/ |
H A D | stat.sh | 91 if ! perf stat --no-merge -e "$ok_grouping" true > /dev/null 2>&1 97 if perf stat --no-merge -e "$group_needs_break" true 2>&1 | grep -E -q "<not supported>"
|
/linux-master/lib/ |
H A D | list_sort.c | 12 * to chaining of merge() calls: null-terminated, no reserved or 16 static struct list_head *merge(void *priv, list_cmp_func_t cmp, function 45 * Combine final list merge with restoration of standard doubly-linked 46 * list structure. This approach duplicates code from merge(), but 83 * If the merge is highly unbalanced (e.g. the input is 144 * for each bit, when count increments to 2^k), we merge two lists of 147 * This merge happens exactly when the count reaches an odd multiple of 149 * so it's safe to merge away two lists of size 2^k. 170 * (merge and loop back to state 2) 174 * merge the [all...] |
/linux-master/fs/notify/ |
H A D | notification.c | 73 * The group can use the @merge hook to merge the event with a queued event. 83 int (*merge)(struct fsnotify_group *, 112 if (!list_empty(list) && merge) { 113 ret = merge(group, event);
|
/linux-master/include/media/ |
H A D | v4l2-event.h | 44 * @merge: Optional callback that can merge event 'old' into event 'new'. 50 void (*merge)(const struct v4l2_event *old, struct v4l2_event *new); member in struct:v4l2_subscribed_event_ops
|
/linux-master/drivers/gpu/drm/mediatek/ |
H A D | mtk_disp_ovl_adaptor.c | 78 [OVL_ADAPTOR_TYPE_MERGE] = "merge", 89 static const struct mtk_ddp_comp_funcs merge = { variable in typeref:struct:mtk_ddp_comp_funcs 119 [OVL_ADAPTOR_MERGE0] = { OVL_ADAPTOR_TYPE_MERGE, DDP_COMPONENT_MERGE1, 1, &merge }, 120 [OVL_ADAPTOR_MERGE1] = { OVL_ADAPTOR_TYPE_MERGE, DDP_COMPONENT_MERGE2, 2, &merge }, 121 [OVL_ADAPTOR_MERGE2] = { OVL_ADAPTOR_TYPE_MERGE, DDP_COMPONENT_MERGE3, 3, &merge }, 122 [OVL_ADAPTOR_MERGE3] = { OVL_ADAPTOR_TYPE_MERGE, DDP_COMPONENT_MERGE4, 4, &merge }, 142 struct device *merge; local 158 merge = ovl_adaptor->ovl_adaptor_comp[OVL_ADAPTOR_MERGE0 + idx]; 162 mtk_merge_stop_cmdq(merge, cmdq_pkt); 181 mtk_merge_advance_config(merge, l_ [all...] |
/linux-master/drivers/net/ethernet/netronome/nfp/flower/ |
H A D | offload.c | 586 struct nfp_flower_merge_check *merge, 616 merge->tci = cpu_to_be16(0xffff); 619 merge->tci = cpu_to_be16(0); 623 eth_broadcast_addr(&merge->l2.mac_dst[0]); 624 eth_broadcast_addr(&merge->l2.mac_src[0]); 625 memset(&merge->l4, 0xff, 628 memset(&merge->ipv6, 0xff, 631 memset(&merge->ipv4, 0xff, 637 merge->l2.mac_dst[i] |= eth->eth_addr_mask[i]; 639 merge 585 nfp_flower_update_merge_with_actions(struct nfp_fl_payload *flow, struct nfp_flower_merge_check *merge, u8 *last_act_id, int *act_out) argument 701 nfp_flower_populate_merge_match(struct nfp_fl_payload *flow, struct nfp_flower_merge_check *merge, bool extra_fields) argument [all...] |
/linux-master/tools/crypto/tcrypt/ |
H A D | tcrypt_speed_compare.py | 113 def merge(base, new): function 182 merged = merge(base, new)
|
/linux-master/tools/perf/tests/shell/lib/ |
H A D | stat_output.sh | 40 perf stat -A -a --no-merge $2 true
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_gpuvm.c | 8 * the rights to use, copy, modify, merge, publish, distribute, sublicense, 429 * operations, such as split / merge or prefetch. 2090 struct drm_gpuva *va, bool merge) 2096 op.unmap.keep = merge; 2120 bool merge = !!va->gem.obj; local 2123 merge &= obj == req_obj && 2127 ret = op_unmap_cb(ops, priv, va, merge); 2134 ret = op_unmap_cb(ops, priv, va, merge); 2149 .keep = merge, 2167 merge 2089 op_unmap_cb(const struct drm_gpuvm_ops *fn, void *priv, struct drm_gpuva *va, bool merge) argument [all...] |
/linux-master/drivers/misc/ |
H A D | hpilo.h | 168 u64 merge; /* O/C bits to merge in during enqueue operation */ member in struct:fifo
|
/linux-master/arch/alpha/lib/ |
H A D | csum_ipv6_magic.S | 85 addq $0,$1,$0 # .. e1 : merge the carries back into the csum
|
/linux-master/kernel/gcov/ |
H A D | gcc_4_7.c | 67 * idiom. The number of counters is determined from the merge pointer 87 * @merge: merge functions (null for unused counter type) 103 void (*merge[GCOV_COUNTERS])(gcov_type *, unsigned int); member in struct:gcov_info 187 return info->merge[type] ? 1 : 0;
|
/linux-master/scripts/ |
H A D | diffconfig | 24 If -m is specified, then output will be in "merge" style, which has the
|
/linux-master/block/ |
H A D | blk-rq-qos.c | 83 if (rqos->ops->merge) 84 rqos->ops->merge(rqos, rq, bio);
|
H A D | Makefile | 8 blk-merge.o blk-timeout.o \
|
/linux-master/arch/powerpc/kexec/ |
H A D | ranges.c | 93 * @mem_rngs: Range list to merge. 138 * @merge: If true, merge the list after sorting. 142 void sort_memory_ranges(struct crash_mem *mem_rngs, bool merge) argument 153 if (merge)
|
/linux-master/drivers/media/v4l2-core/ |
H A D | v4l2-event.c | 130 } else if (sev->ops && sev->ops->merge) { 133 sev->ops->merge(&kev->event, &second_oldest->event); 356 .merge = v4l2_event_src_merge,
|
/linux-master/include/linux/ |
H A D | btree-type.h | 30 static inline int BTREE_FN(merge)(BTREE_TYPE_HEAD *target, function
|
/linux-master/include/crypto/ |
H A D | if_alg.h | 134 * @merge: Shall new data from user space be merged into existing 155 bool merge; member in struct:af_alg_ctx
|
/linux-master/drivers/gpu/drm/amd/display/dc/resource/dcn20/ |
H A D | dcn20_resource.h | 7 * the rights to use, copy, modify, merge, publish, distribute, sublicense, 131 bool *merge);
|