diff options
author | Andrew Gregory <andrew.gregory.8@gmail.com> | 2017-04-15 17:29:07 -0400 |
---|---|---|
committer | Andrew Gregory <andrew.gregory.8@gmail.com> | 2017-04-16 08:29:55 -0400 |
commit | f9de3b22ad9e532af14c8d5b0b90a3f0f747e331 (patch) | |
tree | 6b6c3e87f1d5e1122b9252e7215ebacf2c8b8d4c | |
parent | a8670304c9393cbff350fcff7234d8f166dbcf60 (diff) |
sortbydeps: rename vptr -> i
vptr is a simple list iterator, which are typically named i.
Signed-off-by: Andrew Gregory <andrew.gregory.8@gmail.com>
-rw-r--r-- | lib/libalpm/deps.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/lib/libalpm/deps.c b/lib/libalpm/deps.c index f55d6074..96f91739 100644 --- a/lib/libalpm/deps.c +++ b/lib/libalpm/deps.c @@ -215,7 +215,7 @@ alpm_list_t *_alpm_sortbydeps(alpm_handle_t *handle, { alpm_list_t *newtargs = NULL; alpm_list_t *vertices = NULL; - alpm_list_t *vptr; + alpm_list_t *i; alpm_graph_t *vertex; if(targets == NULL) { @@ -226,9 +226,9 @@ alpm_list_t *_alpm_sortbydeps(alpm_handle_t *handle, vertices = dep_graph_init(handle, targets, ignore); - vptr = vertices; + i = vertices; vertex = vertices->data; - while(vptr) { + while(i) { /* mark that we touched the vertex */ vertex->state = ALPM_GRAPH_STATE_PROCESSING; int switched_to_child = 0; @@ -252,8 +252,8 @@ alpm_list_t *_alpm_sortbydeps(alpm_handle_t *handle, vertex = vertex->parent; if(!vertex) { /* top level vertex reached, move to the next unprocessed vertex */ - for( vptr = vptr->next; vptr; vptr = vptr->next) { - vertex = vptr->data; + for(i = i->next; i; i = i->next) { + vertex = i->data; if(vertex->state == ALPM_GRAPH_STATE_UNPROCESSED) { break; } |