Ignore:
Timestamp:
Mar 8, 2018, 3:16:30 PM (6 years ago)
Author:
Aaron Moss <a3moss@…>
Branches:
ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
Children:
9d6f011
Parents:
fb2ce27
Message:

Update evaluation section of paper

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/papers/general/evaluation/cfa-stack.c

    rfb2ce27 r28bc8c8  
    1212        stack_node(T) ** crnt = &s.head;
    1313        for ( stack_node(T) * next = t.head; next; next = next->next ) {
    14                 *crnt = malloc();
     14                *crnt = alloc();
    1515                ((*crnt)->value){ next->value };
    1616                crnt = &(*crnt)->next;
     
    3131
    3232forall(otype T) void push( stack(T) & s, T value ) with( s ) {
    33         stack_node(T)* n = malloc();
     33        stack_node(T)* n = alloc();
    3434        (*n){ value, head };
    3535        head = n;
Note: See TracChangeset for help on using the changeset viewer.