You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
28 lines
649 B
28 lines
649 B
7 years ago
|
/*
|
||
|
|
* Copyright (c) 2018 - present Facebook, Inc.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* This source code is licensed under the BSD style license found in the
|
||
|
|
* LICENSE file in the root directory of this source tree. An additional grant
|
||
|
|
* of patent rights can be found in the PATENTS file in the same directory.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <stdlib.h>
|
||
|
|
|
||
|
|
struct list_head {
|
||
|
|
struct list_head *next, *prev;
|
||
|
|
};
|
||
|
|
|
||
|
|
struct list_head glob = {0};
|
||
|
|
|
||
|
|
struct list_head ears = {&ears, &ears};
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
struct list_head* node = (struct list_head*)malloc(sizeof(struct list_head));
|
||
|
|
node->next = node->prev = node;
|
||
|
|
free(node);
|
||
|
|
if (&glob != &ears)
|
||
|
|
return 1;
|
||
|
|
return 0;
|
||
|
|
}
|