3 files changed, 5 insertions, 5 deletions
diff --git a/samples/kfifo/bytestream-example.c b/samples/kfifo/bytestream-example.c
index cfe40addda76..2fca916d9edf 100644
--- a/samples/kfifo/bytestream-example.c
+++ b/samples/kfifo/bytestream-example.c
@@ -64,7 +64,7 @@ static int __init testfunc(void)
        /* put values into the fifo */
        for (i = 0; i != 10; i++)
-                kfifo_put(&test, &i);
+                kfifo_put(&test, i);
        /* show the number of used elements */
        printk(KERN_INFO "fifo len: %u\n", kfifo_len(&test));
@@ -85,7 +85,7 @@ static int __init testfunc(void)
        kfifo_skip(&test);
        /* put values into the fifo until is full */
-        for (i = 20; kfifo_put(&test, &i); i++)
+        for (i = 20; kfifo_put(&test, i); i++)
                ;
        printk(KERN_INFO "queue len: %u\n", kfifo_len(&test));
diff --git a/samples/kfifo/dma-example.c b/samples/kfifo/dma-example.c
index 06473791c08a..aa243db93f01 100644
--- a/samples/kfifo/dma-example.c
+++ b/samples/kfifo/dma-example.c
@@ -39,7 +39,7 @@ static int __init example_init(void)
        kfifo_in(&fifo, "test", 4);
        for (i = 0; i != 9; i++)
-                kfifo_put(&fifo, &i);
+                kfifo_put(&fifo, i);
        /* kick away first byte */
        kfifo_skip(&fifo);
diff --git a/samples/kfifo/inttype-example.c b/samples/kfifo/inttype-example.c
index 6f8e79e76c9e..8dc3c2e7105a 100644
--- a/samples/kfifo/inttype-example.c
+++ b/samples/kfifo/inttype-example.c
@@ -61,7 +61,7 @@ static int __init testfunc(void)
        /* put values into the fifo */
        for (i = 0; i != 10; i++)
-                kfifo_put(&test, &i);
+                kfifo_put(&test, i);
        /* show the number of used elements */
        printk(KERN_INFO "fifo len: %u\n", kfifo_len(&test));
@@ -78,7 +78,7 @@ static int __init testfunc(void)
        kfifo_skip(&test);
        /* put values into the fifo until is full */
-        for (i = 20; kfifo_put(&test, &i); i++)
+        for (i = 20; kfifo_put(&test, i); i++)
                ;
        printk(KERN_INFO "queue len: %u\n", kfifo_len(&test));

diff --git a/samples/kfifo/bytestream-example.c b/samples/kfifo/bytestream-example.c index cfe40addda76..2fca916d9edf 100644 --- a/samples/kfifo/bytestream-example.c +++ b/samples/kfifo/bytestream-example.c
@@ -64,7 +64,7 @@ static int __init testfunc(void)
64		64
65	/* put values into the fifo */	65	/* put values into the fifo */
66	for (i = 0; i != 10; i++)	66	for (i = 0; i != 10; i++)
67	kfifo_put(&test, &i);	67	kfifo_put(&test, i);
68		68
69	/* show the number of used elements */	69	/* show the number of used elements */
70	printk(KERN_INFO "fifo len: %u\n", kfifo_len(&test));	70	printk(KERN_INFO "fifo len: %u\n", kfifo_len(&test));
@@ -85,7 +85,7 @@ static int __init testfunc(void)
85	kfifo_skip(&test);	85	kfifo_skip(&test);
86		86
87	/* put values into the fifo until is full */	87	/* put values into the fifo until is full */
88	for (i = 20; kfifo_put(&test, &i); i++)	88	for (i = 20; kfifo_put(&test, i); i++)
89	;	89	;
90		90
91	printk(KERN_INFO "queue len: %u\n", kfifo_len(&test));	91	printk(KERN_INFO "queue len: %u\n", kfifo_len(&test));


diff --git a/samples/kfifo/dma-example.c b/samples/kfifo/dma-example.c index 06473791c08a..aa243db93f01 100644 --- a/samples/kfifo/dma-example.c +++ b/samples/kfifo/dma-example.c
@@ -39,7 +39,7 @@ static int __init example_init(void)
39	kfifo_in(&fifo, "test", 4);	39	kfifo_in(&fifo, "test", 4);
40		40
41	for (i = 0; i != 9; i++)	41	for (i = 0; i != 9; i++)
42	kfifo_put(&fifo, &i);	42	kfifo_put(&fifo, i);
43		43
44	/* kick away first byte */	44	/* kick away first byte */
45	kfifo_skip(&fifo);	45	kfifo_skip(&fifo);


diff --git a/samples/kfifo/inttype-example.c b/samples/kfifo/inttype-example.c index 6f8e79e76c9e..8dc3c2e7105a 100644 --- a/samples/kfifo/inttype-example.c +++ b/samples/kfifo/inttype-example.c
@@ -61,7 +61,7 @@ static int __init testfunc(void)
61		61
62	/* put values into the fifo */	62	/* put values into the fifo */
63	for (i = 0; i != 10; i++)	63	for (i = 0; i != 10; i++)
64	kfifo_put(&test, &i);	64	kfifo_put(&test, i);
65		65
66	/* show the number of used elements */	66	/* show the number of used elements */
67	printk(KERN_INFO "fifo len: %u\n", kfifo_len(&test));	67	printk(KERN_INFO "fifo len: %u\n", kfifo_len(&test));
@@ -78,7 +78,7 @@ static int __init testfunc(void)
78	kfifo_skip(&test);	78	kfifo_skip(&test);
79		79
80	/* put values into the fifo until is full */	80	/* put values into the fifo until is full */
81	for (i = 20; kfifo_put(&test, &i); i++)	81	for (i = 20; kfifo_put(&test, i); i++)
82	;	82	;
83		83
84	printk(KERN_INFO "queue len: %u\n", kfifo_len(&test));	84	printk(KERN_INFO "queue len: %u\n", kfifo_len(&test));