svn_error_t * svn_client_add(const char *path, svn_boolean_t recursive, svn_client_ctx_t *ctx, apr_pool_t *pool) { return svn_client_add3(path, recursive, FALSE, FALSE, ctx, pool); }
static int l_add (lua_State *L) { const char *path = luaL_checkstring (L, 1); apr_pool_t *pool; svn_error_t *err; svn_client_ctx_t *ctx; init_function (&ctx, &pool, L); path = svn_path_canonicalize (path, pool); err = svn_client_add3 (path, TRUE, FALSE, FALSE, ctx, pool); IF_ERROR_RETURN (err, pool, L); svn_pool_destroy (pool); return 0; }
static int l_add (lua_State *L) { const char *path = luaL_checkstring (L, 1); svn_boolean_t recursive = TRUE; svn_boolean_t force = FALSE; svn_boolean_t no_ignore = FALSE; int itable = 2; if (lua_gettop (L) >= itable && lua_istable (L, itable)) { lua_getfield (L, itable, "recursive"); if (lua_isboolean (L, -1)) { recursive = lua_toboolean (L, -1); } lua_getfield (L, itable, "force"); if (lua_isboolean (L, -1)) { force = lua_toboolean (L, -1); } lua_getfield (L, itable, "no_ignore"); if (lua_isboolean (L, -1)) { no_ignore = lua_toboolean (L, -1); } } apr_pool_t *pool; svn_error_t *err; svn_client_ctx_t *ctx; init_function (&ctx, &pool, L); path = svn_path_canonicalize (path, pool); err = svn_client_add3 (path, recursive, force, no_ignore, ctx, pool); IF_ERROR_RETURN (err, pool, L); svn_pool_destroy (pool); return 0; }