pike.git/
src/
builtin.cmod
Branch:
Tag:
Non-build tags
All tags
No tags
2004-09-28
2004-09-28 16:58:23 by Henrik Grubbström (Grubba) <grubba@grubba.org>
66994846a267813b03f7afa756ace8f0a2d7e998 (
71
lines) (+
36
/-
35
)
[
Show
|
Annotate
]
Branch:
7.9
Improved C++ compat.
Rev: src/builtin.cmod:1.171
Rev: src/builtin_functions.h:1.32
2:
|| This file is part of Pike. For copyright information see COPYRIGHT. || Pike is distributed under GPL, LGPL and MPL. See the file COPYING || for more information.
-
|| $Id: builtin.cmod,v 1.
170
2004/09/
17
15
:
07
:
43
grubba Exp $
+
|| $Id: builtin.cmod,v 1.
171
2004/09/
28
16
:
58
:
23
grubba Exp $
*/ #include "global.h"
3011:
} PMOD_EXPORT void prepend_list_node(struct list_node *node,
-
struct list_node *new)
+
struct list_node *new
_node
)
{ #ifdef PIKE_DEBUG if (!node) {
3020:
if (!node->prev) { Pike_fatal("Prepending unhooked node.\n"); }
-
if (!new) {
+
if (!new
_node
) {
Pike_fatal("Prepending NULL node.\n"); }
-
if (new->next || new->prev) {
+
if (new
_node
->next || new
_node
->prev) {
Pike_fatal("Prepending hooked node.\n"); } #endif /* PIKE_DEBUG */
-
new->next = node;
-
new->prev = node->prev;
-
new->prev->next = node->prev = new;
-
add_ref(new);
-
add_ref(new);
+
new
_node
->next = node;
+
new
_node
->prev = node->prev;
+
new
_node
->prev->next = node->prev = new
_node
;
+
add_ref(new
_node
);
+
add_ref(new
_node
);
} PMOD_EXPORT void append_list_node(struct list_node *node,
-
struct list_node *new)
+
struct list_node *new
_node
)
{ #ifdef PIKE_DEBUG if (!node) {
3044:
if (!node->next) { Pike_fatal("Appending unhooked node.\n"); }
-
if (!new) {
+
if (!new
_node
) {
Pike_fatal("Appending NULL node.\n"); }
-
if (new->next || new->prev) {
+
if (new
_node
->next || new
_node
->prev) {
Pike_fatal("Appending hooked node.\n"); } #endif /* PIKE_DEBUG */
-
new->next = node->next;
-
new->prev = node;
-
new->next->prev = node->next = new;
-
add_ref(new);
-
add_ref(new);
+
new
_node
->next = node->next;
+
new
_node
->prev = node;
+
new
_node
->next->prev = node->next = new
_node
;
+
add_ref(new
_node
);
+
add_ref(new
_node
);
} /*! @module ADT
3268:
{ struct list_node *node = TAIL_SENTINEL(THIS); while (args--) {
-
struct list_node *new = alloc_list_node();
-
new->val = *(--Pike_sp);
-
prepend_list_node(node, new);
-
free_list_node(node = new);
+
struct list_node *new
_node
= alloc_list_node();
+
new
_node
->val = *(--Pike_sp);
+
prepend_list_node(node, new
_node
);
+
free_list_node(node = new
_node
);
THIS->num_elems++; } push_int(0);
3288:
{ struct list_node *node = THIS->head; while (args--) {
-
struct list_node *new = alloc_list_node();
-
new->val = *(--Pike_sp);
-
prepend_list_node(node, new);
-
free_list_node(node = new);
+
struct list_node *new
_node
= alloc_list_node();
+
new
_node
->val = *(--Pike_sp);
+
prepend_list_node(node, new
_node
);
+
free_list_node(node = new
_node
);
THIS->num_elems++; } push_int(0);
3622:
*/ PIKEFUN void insert(mixed val) {
-
struct list_node *new;
+
struct list_node *new
_node
;
if (!THIS->cur->prev) { Pike_error("Attempt to insert before the start sentinel.\n"); }
-
new = alloc_list_node();
-
assign_svalue_no_free(&new->val, val);
-
prepend_list_node(THIS->cur, new);
+
new
_node
= alloc_list_node();
+
assign_svalue_no_free(&new
_node
->val, val);
+
prepend_list_node(THIS->cur, new
_node
);
free_list_node(THIS->cur);
-
THIS->cur = new;
+
THIS->cur = new
_node
;
List__get_iterator_find_parent()->num_elems++; pop_n_elems(args); push_int(0);
3645:
*/ PIKEFUN void append(mixed val) {
-
struct list_node *new;
+
struct list_node *new
_node
;
if (!THIS->cur->next) { Pike_error("Attempt to append after the end sentinel.\n"); }
-
new = alloc_list_node();
-
assign_svalue_no_free(&new->val, val);
-
append_list_node(THIS->cur, new);
-
free_list_node(new);
+
new
_node
= alloc_list_node();
+
assign_svalue_no_free(&new
_node
->val, val);
+
append_list_node(THIS->cur, new
_node
);
+
free_list_node(new
_node
);
List__get_iterator_find_parent()->num_elems++; pop_n_elems(args); push_int(0);