You've already forked linux-apfs
mirror of
https://github.com/linux-apfs/linux-apfs.git
synced 2026-05-01 15:00:59 -07:00
Merge branch 'master' into for-2.6.33
This commit is contained in:
+4
-2
@@ -819,9 +819,11 @@ static void check_unmap(struct dma_debug_entry *ref)
|
||||
err_printk(ref->dev, entry, "DMA-API: device driver frees "
|
||||
"DMA memory with different CPU address "
|
||||
"[device address=0x%016llx] [size=%llu bytes] "
|
||||
"[cpu alloc address=%p] [cpu free address=%p]",
|
||||
"[cpu alloc address=0x%016llx] "
|
||||
"[cpu free address=0x%016llx]",
|
||||
ref->dev_addr, ref->size,
|
||||
(void *)entry->paddr, (void *)ref->paddr);
|
||||
(unsigned long long)entry->paddr,
|
||||
(unsigned long long)ref->paddr);
|
||||
}
|
||||
|
||||
if (ref->sg_call_ents && ref->type == dma_debug_sg &&
|
||||
|
||||
+3
-2
@@ -200,6 +200,9 @@ radix_tree_node_free(struct radix_tree_node *node)
|
||||
* ensure that the addition of a single element in the tree cannot fail. On
|
||||
* success, return zero, with preemption disabled. On error, return -ENOMEM
|
||||
* with preemption not disabled.
|
||||
*
|
||||
* To make use of this facility, the radix tree must be initialised without
|
||||
* __GFP_WAIT being passed to INIT_RADIX_TREE().
|
||||
*/
|
||||
int radix_tree_preload(gfp_t gfp_mask)
|
||||
{
|
||||
@@ -543,7 +546,6 @@ out:
|
||||
}
|
||||
EXPORT_SYMBOL(radix_tree_tag_clear);
|
||||
|
||||
#ifndef __KERNEL__ /* Only the test harness uses this at present */
|
||||
/**
|
||||
* radix_tree_tag_get - get a tag on a radix tree node
|
||||
* @root: radix tree root
|
||||
@@ -606,7 +608,6 @@ int radix_tree_tag_get(struct radix_tree_root *root,
|
||||
}
|
||||
}
|
||||
EXPORT_SYMBOL(radix_tree_tag_get);
|
||||
#endif
|
||||
|
||||
/**
|
||||
* radix_tree_next_hole - find the next hole (not-present entry)
|
||||
|
||||
+14
-6
@@ -246,13 +246,17 @@ EXPORT_SYMBOL(strlcat);
|
||||
#undef strcmp
|
||||
int strcmp(const char *cs, const char *ct)
|
||||
{
|
||||
signed char __res;
|
||||
unsigned char c1, c2;
|
||||
|
||||
while (1) {
|
||||
if ((__res = *cs - *ct++) != 0 || !*cs++)
|
||||
c1 = *cs++;
|
||||
c2 = *ct++;
|
||||
if (c1 != c2)
|
||||
return c1 < c2 ? -1 : 1;
|
||||
if (!c1)
|
||||
break;
|
||||
}
|
||||
return __res;
|
||||
return 0;
|
||||
}
|
||||
EXPORT_SYMBOL(strcmp);
|
||||
#endif
|
||||
@@ -266,14 +270,18 @@ EXPORT_SYMBOL(strcmp);
|
||||
*/
|
||||
int strncmp(const char *cs, const char *ct, size_t count)
|
||||
{
|
||||
signed char __res = 0;
|
||||
unsigned char c1, c2;
|
||||
|
||||
while (count) {
|
||||
if ((__res = *cs - *ct++) != 0 || !*cs++)
|
||||
c1 = *cs++;
|
||||
c2 = *ct++;
|
||||
if (c1 != c2)
|
||||
return c1 < c2 ? -1 : 1;
|
||||
if (!c1)
|
||||
break;
|
||||
count--;
|
||||
}
|
||||
return __res;
|
||||
return 0;
|
||||
}
|
||||
EXPORT_SYMBOL(strncmp);
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user