Deleting The Head of The List in Linux Kernel
We are developing a kernel device. There is a list in a device that keeps the messages. We want to delete the head of the list. The related part of the code is below:
Device Message and Device Struct:
typedef struct dev_message
{
char *data;
int *message_count;
struct list_head list;
}device_message;
typedef struct queue_dev
{
device_message *message_head;
struct semaphore sem;
struct cdev cdev;
}queue_device;
Adding to head of the list is done with
INIT_LIST_HEAD(&(dev->message_head->list));
and adding the other entries are done with
list_add_tail(&newMsg->list,&dev->message_head->list);
We can delete every element of the list except the head of the list. How can we delete the only head of the list?
Sincerely.
c linked-list linux-kernel
|
show 1 more comment
We are developing a kernel device. There is a list in a device that keeps the messages. We want to delete the head of the list. The related part of the code is below:
Device Message and Device Struct:
typedef struct dev_message
{
char *data;
int *message_count;
struct list_head list;
}device_message;
typedef struct queue_dev
{
device_message *message_head;
struct semaphore sem;
struct cdev cdev;
}queue_device;
Adding to head of the list is done with
INIT_LIST_HEAD(&(dev->message_head->list));
and adding the other entries are done with
list_add_tail(&newMsg->list,&dev->message_head->list);
We can delete every element of the list except the head of the list. How can we delete the only head of the list?
Sincerely.
c linked-list linux-kernel
Are you saying that when you callLIST_REMOVE
it can't find the element at the head of the list?
– bruceg
Nov 28 '18 at 19:14
You are not showing any of the code for deletion, which makes this hard to debug. However, since the head of a list is generally not stored in a list node, but in an indepenent location, it takes special handling to delete it. See for example this question.
– AShelly
Nov 28 '18 at 19:39
kernel lists expect you to keep one extra list_head for each list. Every element is also a list_head so a list of N has N+1 list_heads. Deleting the 1st element is no different from deleting one in the middle.
– stark
Nov 28 '18 at 20:15
@AShelly when we implement our design, we did not know the information about the storage of the head of the list. We have used another approach to the the task. Thank you for the information. Additionally, thanks for other people they try to hepl me.
– Latif Uluman
Nov 29 '18 at 5:38
When writing kernel code I would advise you to strictly adhere to the style of the other device drivers.
– stark
Nov 29 '18 at 12:19
|
show 1 more comment
We are developing a kernel device. There is a list in a device that keeps the messages. We want to delete the head of the list. The related part of the code is below:
Device Message and Device Struct:
typedef struct dev_message
{
char *data;
int *message_count;
struct list_head list;
}device_message;
typedef struct queue_dev
{
device_message *message_head;
struct semaphore sem;
struct cdev cdev;
}queue_device;
Adding to head of the list is done with
INIT_LIST_HEAD(&(dev->message_head->list));
and adding the other entries are done with
list_add_tail(&newMsg->list,&dev->message_head->list);
We can delete every element of the list except the head of the list. How can we delete the only head of the list?
Sincerely.
c linked-list linux-kernel
We are developing a kernel device. There is a list in a device that keeps the messages. We want to delete the head of the list. The related part of the code is below:
Device Message and Device Struct:
typedef struct dev_message
{
char *data;
int *message_count;
struct list_head list;
}device_message;
typedef struct queue_dev
{
device_message *message_head;
struct semaphore sem;
struct cdev cdev;
}queue_device;
Adding to head of the list is done with
INIT_LIST_HEAD(&(dev->message_head->list));
and adding the other entries are done with
list_add_tail(&newMsg->list,&dev->message_head->list);
We can delete every element of the list except the head of the list. How can we delete the only head of the list?
Sincerely.
c linked-list linux-kernel
c linked-list linux-kernel
asked Nov 28 '18 at 18:54
Latif UlumanLatif Uluman
32
32
Are you saying that when you callLIST_REMOVE
it can't find the element at the head of the list?
– bruceg
Nov 28 '18 at 19:14
You are not showing any of the code for deletion, which makes this hard to debug. However, since the head of a list is generally not stored in a list node, but in an indepenent location, it takes special handling to delete it. See for example this question.
– AShelly
Nov 28 '18 at 19:39
kernel lists expect you to keep one extra list_head for each list. Every element is also a list_head so a list of N has N+1 list_heads. Deleting the 1st element is no different from deleting one in the middle.
– stark
Nov 28 '18 at 20:15
@AShelly when we implement our design, we did not know the information about the storage of the head of the list. We have used another approach to the the task. Thank you for the information. Additionally, thanks for other people they try to hepl me.
– Latif Uluman
Nov 29 '18 at 5:38
When writing kernel code I would advise you to strictly adhere to the style of the other device drivers.
– stark
Nov 29 '18 at 12:19
|
show 1 more comment
Are you saying that when you callLIST_REMOVE
it can't find the element at the head of the list?
– bruceg
Nov 28 '18 at 19:14
You are not showing any of the code for deletion, which makes this hard to debug. However, since the head of a list is generally not stored in a list node, but in an indepenent location, it takes special handling to delete it. See for example this question.
– AShelly
Nov 28 '18 at 19:39
kernel lists expect you to keep one extra list_head for each list. Every element is also a list_head so a list of N has N+1 list_heads. Deleting the 1st element is no different from deleting one in the middle.
– stark
Nov 28 '18 at 20:15
@AShelly when we implement our design, we did not know the information about the storage of the head of the list. We have used another approach to the the task. Thank you for the information. Additionally, thanks for other people they try to hepl me.
– Latif Uluman
Nov 29 '18 at 5:38
When writing kernel code I would advise you to strictly adhere to the style of the other device drivers.
– stark
Nov 29 '18 at 12:19
Are you saying that when you call
LIST_REMOVE
it can't find the element at the head of the list?– bruceg
Nov 28 '18 at 19:14
Are you saying that when you call
LIST_REMOVE
it can't find the element at the head of the list?– bruceg
Nov 28 '18 at 19:14
You are not showing any of the code for deletion, which makes this hard to debug. However, since the head of a list is generally not stored in a list node, but in an indepenent location, it takes special handling to delete it. See for example this question.
– AShelly
Nov 28 '18 at 19:39
You are not showing any of the code for deletion, which makes this hard to debug. However, since the head of a list is generally not stored in a list node, but in an indepenent location, it takes special handling to delete it. See for example this question.
– AShelly
Nov 28 '18 at 19:39
kernel lists expect you to keep one extra list_head for each list. Every element is also a list_head so a list of N has N+1 list_heads. Deleting the 1st element is no different from deleting one in the middle.
– stark
Nov 28 '18 at 20:15
kernel lists expect you to keep one extra list_head for each list. Every element is also a list_head so a list of N has N+1 list_heads. Deleting the 1st element is no different from deleting one in the middle.
– stark
Nov 28 '18 at 20:15
@AShelly when we implement our design, we did not know the information about the storage of the head of the list. We have used another approach to the the task. Thank you for the information. Additionally, thanks for other people they try to hepl me.
– Latif Uluman
Nov 29 '18 at 5:38
@AShelly when we implement our design, we did not know the information about the storage of the head of the list. We have used another approach to the the task. Thank you for the information. Additionally, thanks for other people they try to hepl me.
– Latif Uluman
Nov 29 '18 at 5:38
When writing kernel code I would advise you to strictly adhere to the style of the other device drivers.
– stark
Nov 29 '18 at 12:19
When writing kernel code I would advise you to strictly adhere to the style of the other device drivers.
– stark
Nov 29 '18 at 12:19
|
show 1 more comment
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53526254%2fdeleting-the-head-of-the-list-in-linux-kernel%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53526254%2fdeleting-the-head-of-the-list-in-linux-kernel%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Are you saying that when you call
LIST_REMOVE
it can't find the element at the head of the list?– bruceg
Nov 28 '18 at 19:14
You are not showing any of the code for deletion, which makes this hard to debug. However, since the head of a list is generally not stored in a list node, but in an indepenent location, it takes special handling to delete it. See for example this question.
– AShelly
Nov 28 '18 at 19:39
kernel lists expect you to keep one extra list_head for each list. Every element is also a list_head so a list of N has N+1 list_heads. Deleting the 1st element is no different from deleting one in the middle.
– stark
Nov 28 '18 at 20:15
@AShelly when we implement our design, we did not know the information about the storage of the head of the list. We have used another approach to the the task. Thank you for the information. Additionally, thanks for other people they try to hepl me.
– Latif Uluman
Nov 29 '18 at 5:38
When writing kernel code I would advise you to strictly adhere to the style of the other device drivers.
– stark
Nov 29 '18 at 12:19