HomeSort by: relevance | last modified time | path
    Searched refs:RPLACA (Results 1 - 13 of 13) sorted by relevancy

  /xsrc/external/mit/xedit/dist/lisp/
require.c 147 RPLACA(MOD, module);
core.c 907 RPLACA(result, CAR(list));
910 RPLACA(result, CONS(CAR(CAR(list)), CDR(CAR(list))));
913 RPLACA(result, LispCopyList(builtin, CAR(list), COPY_TREE));
918 RPLACA(result, CAR(list));
926 RPLACA(cons, CAR(list));
929 RPLACA(cons, CONS(CAR(CAR(list)), CDR(CAR(list))));
932 RPLACA(cons, LispCopyList(builtin, CAR(list), COPY_TREE));
937 RPLACA(cons, CAR(list));
1572 RPLACA(acons, item);
1729 RPLACA(list, item)
    [all...]
struct.c 326 return (store ? RPLACA(list, value) : CAR(list));
package.c 461 RPLACA(result, atom->object);
608 * But, if properly implemented, it should be possible to (rplaca)
format.c 1547 RPLACA(cons, NIL);
1551 RPLACA(cons, NIL);
helper.c 656 RPLACA(cons, value);
internal.h 53 #define RPLACA(cons, object) (CAR(cons) = object)
pathname.c 685 RPLACA(result, LSTRING(string, length));
compile.c 1979 RPLACA(com->plist, object);
read.c 1883 RPLACA(fields, ATOM(str));
bytecode.c 857 case XBC_RPLACA:strcpy(ptr, "RPLACA"); break;
3069 LispDestroy("RPLACA: %s is not a cons", STROBJ(reg1));
3070 RPLACA(reg1, reg0);
lisp.c 495 {LispFunction, Lisp_Rplaca, "rplaca place value", 0, 0, Com_Rplac_},
1685 RPLACA(result, value);
  /xsrc/external/mit/xedit/dist/lisp/modules/
xt.c 465 RPLACA(data, input);

Completed in 35 milliseconds